Orthonormal basis

About: Orthonormal basis is a research topic. Over the lifetime, 6014 publications have been published within this topic receiving 174416 citations.

Wavelet analysis and synthesis of fractional Brownian motion

Abstract: Fractional Brownian motion (FBM) offers a convenient modeling for nonstationary stochastic processes with long-term dependencies and 1/f-type spectral behavior over wide ranges of frequencies. Statistical self-similarity is an essential feature of FBM and makes natural the use of wavelets for both its analysis and its synthesis. A detailed second-order analysis is carried out for wavelet coefficients of FBM. It reveals a stationary structure at each scale and a power-law behavior of the coefficients' variance from which the fractal dimension of FBM can be estimated. Conditions for using orthonormal wavelet decompositions as approximate whitening filters are discussed, consequences of discretization are considered, and some connections between the wavelet point of view and previous approaches based on length measurements (analysis) or dyadic interpolation (synthesis) are briefly pointed out. >

Fast and globally convergent pose estimation from video images

Abstract: Determining the rigid transformation relating 2D images to known 3D geometry is a classical problem in photogrammetry and computer vision. Heretofore, the best methods for solving the problem have relied on iterative optimization methods which cannot be proven to converge and/or which do not effectively account for the orthonormal structure of rotation matrices. We show that the pose estimation problem can be formulated as that of minimizing an error metric based on collinearity in object (as opposed to image) space. Using object space collinearity error, we derive an iterative algorithm which directly computes orthogonal rotation matrices and which is globally convergent. Experimentally, we show that the method is computationally efficient, that it is no less accurate than the best currently employed optimization methods, and that it outperforms all tested methods in robustness to outliers.

Systematic design of unitary space-time constellations

Abstract: We propose a systematic method for creating constellations of unitary space-time signals for multiple-antenna communication links. Unitary space-time signals, which are orthonormal in time across the antennas, have been shown to be well-tailored to a Rayleigh fading channel where neither the transmitter nor the receiver knows the fading coefficients. The signals can achieve low probability of error by exploiting multiple-antenna diversity. Because the fading coefficients are not known, the criterion for creating and evaluating the constellation is nonstandard and differs markedly from the familiar maximum-Euclidean-distance norm. Our construction begins with the first signal in the constellation-an oblong complex-valued matrix whose columns are orthonormal-and systematically produces the remaining signals by successively rotating this signal in a high-dimensional complex space. This construction easily produces large constellations of high-dimensional signals. We demonstrate its efficacy through examples involving one, two, and three transmitter antennas.

The finite ridgelet transform for image representation

Abstract: The ridgelet transform was introduced as a sparse expansion for functions on continuous spaces that are smooth away from discontinuities along lines. We propose an orthonormal version of the ridgelet transform for discrete and finite-size images. Our construction uses the finite Radon transform (FRAT) as a building block. To overcome the periodization effect of a finite transform, we introduce a novel ordering of the FRAT coefficients. We also analyze the FRAT as a frame operator and derive the exact frame bounds. The resulting finite ridgelet transform (FRIT) is invertible, nonredundant and computed via fast algorithms. Furthermore, this construction leads to a family of directional and orthonormal bases for images. Numerical results show that the FRIT is more effective than the wavelet transform in approximating and denoising images with straight edges.

A generalized uncertainty principle and sparse representation in pairs of bases

Abstract: An elementary proof of a basic uncertainty principle concerning pairs of representations of R/sup N/ vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pairs of orthonormal bases as overcomplete dictionaries. The main contribution in this paper is the improvement of an important result due to Donoho and Huo (2001) concerning the replacement of the l/sub 0/ optimization problem by a linear programming (LP) minimization when searching for the unique sparse representation.