908 resultados para INVARIANT-MANIFOLDS
Resumo:
MSC 2010: 33C15, 33C05, 33C45, 65R10, 20C40
Resumo:
2000 Mathematics Subject Classification: 53C42, 53C55.
Resumo:
2000 Mathematics Subject Classification: 13N15, 13A50, 16W25.
Resumo:
2000 Mathematics Subject Classification: 53C15, 53C40, 53C42.
Resumo:
2000 Mathematics Subject Classification: 13N15, 13A50, 13F20.
Resumo:
2000 Mathematics Subject Classification: 54C35, 54D20, 54C60.
Resumo:
The contributions of this dissertation are in the development of two new interrelated approaches to video data compression: (1) A level-refined motion estimation and subband compensation method for the effective motion estimation and motion compensation. (2) A shift-invariant sub-decimation decomposition method in order to overcome the deficiency of the decimation process in estimating motion due to its shift-invariant property of wavelet transform. ^ The enormous data generated by digital videos call for an intense need of efficient video compression techniques to conserve storage space and minimize bandwidth utilization. The main idea of video compression is to reduce the interpixel redundancies inside and between the video frames by applying motion estimation and motion compensation (MEMO) in combination with spatial transform coding. To locate the global minimum of the matching criterion function reasonably, hierarchical motion estimation by coarse to fine resolution refinements using discrete wavelet transform is applied due to its intrinsic multiresolution and scalability natures. ^ Due to the fact that most of the energies are concentrated in the low resolution subbands while decreased in the high resolution subbands, a new approach called level-refined motion estimation and subband compensation (LRSC) method is proposed. It realizes the possible intrablocks in the subbands for lower entropy coding while keeping the low computational loads of motion estimation as the level-refined method, thus to achieve both temporal compression quality and computational simplicity. ^ Since circular convolution is applied in wavelet transform to obtain the decomposed subframes without coefficient expansion, symmetric-extended wavelet transform is designed on the finite length frame signals for more accurate motion estimation without discontinuous boundary distortions. ^ Although wavelet transformed coefficients still contain spatial domain information, motion estimation in wavelet domain is not as straightforward as in spatial domain due to the shift variance property of the decimation process of the wavelet transform. A new approach called sub-decimation decomposition method is proposed, which maintains the motion consistency between the original frame and the decomposed subframes, improving as a consequence the wavelet domain video compressions by shift invariant motion estimation and compensation. ^
Resumo:
We prove that the dimension of the 1-nullity distribution N(1) on a closed Sasakian manifold M of rankl is at least equal to 2l−1 provided that M has an isolated closed characteristic. The result is then used to provide some examples of k-contact manifolds which are not Sasakian. On a closed, 2n+1-dimensional Sasakian manifold of positive bisectional curvature, we show that either the dimension of N(1) is less than or equal to n+1 or N(1) is the entire tangent bundle TM. In the latter case, the Sasakian manifold Mis isometric to a quotient of the Euclidean sphere under a finite group of isometries. We also point out some interactions between k-nullity, Weinstein conjecture, and minimal unit vector fields.
Resumo:
lmage super-resolution is defined as a class of techniques that enhance the spatial resolution of images. Super-resolution methods can be subdivided in single and multi image methods. This thesis focuses on developing algorithms based on mathematical theories for single image super resolution problems. lndeed, in arder to estimate an output image, we adopta mixed approach: i.e., we use both a dictionary of patches with sparsity constraints (typical of learning-based methods) and regularization terms (typical of reconstruction-based methods). Although the existing methods already per- form well, they do not take into account the geometry of the data to: regularize the solution, cluster data samples (samples are often clustered using algorithms with the Euclidean distance as a dissimilarity metric), learn dictionaries (they are often learned using PCA or K-SVD). Thus, state-of-the-art methods still suffer from shortcomings. In this work, we proposed three new methods to overcome these deficiencies. First, we developed SE-ASDS (a structure tensor based regularization term) in arder to improve the sharpness of edges. SE-ASDS achieves much better results than many state-of-the- art algorithms. Then, we proposed AGNN and GOC algorithms for determining a local subset of training samples from which a good local model can be computed for recon- structing a given input test sample, where we take into account the underlying geometry of the data. AGNN and GOC methods outperform spectral clustering, soft clustering, and geodesic distance based subset selection in most settings. Next, we proposed aSOB strategy which takes into account the geometry of the data and the dictionary size. The aSOB strategy outperforms both PCA and PGA methods. Finally, we combine all our methods in a unique algorithm, named G2SR. Our proposed G2SR algorithm shows better visual and quantitative results when compared to the results of state-of-the-art methods.
Resumo:
Peer reviewed
Resumo:
Date of Acceptance: 09/06/2015
Resumo:
Peer reviewed
Resumo:
Date of Acceptance: 09/06/2015
Resumo:
Peer reviewed
Resumo:
A Hilbert space operator is called universal (in the sense of Rota) if every operator on the Hilbert space is similar to a multiple of the restriction of the universal operator to one of its invariant subspaces. We exhibit an analytic Toeplitz operator whose adjoint is universal in the sense of Rota and commutes with a quasi-nilpotent injective compact operator with dense range. In articular, this new universal operator invites an approach to the Invariant Subspace Problem that uses properties of operators that commute with the universal operator.