Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Vidal, Yi Ma (2004)
A Unified Algebraic Approach to 2-D and 3-D Motion Segmentation
D.L. Donoho (2006)
Compressed sensingIEEE Trans. Inf. Theory, 52
R. DeVore (2007)
Deterministic constructions of compressed sensing matricesJ. Complex., 23
Extrapolation and Interpolation)
R. Vidal, Yi Ma (2006)
A Unified Algebraic Approach to 2-D and 3-D Motion Segmentation and EstimationJournal of Mathematical Imaging and Vision, 25
J. Ho, Ming-Hsuan Yang, Jongwoo Lim, Kuang-chih Lee, D. Kriegman (2003)
Clustering appearances of objects under varying illumination conditions2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings., 1
A. Aldroubi, K. Gröchenig (2001)
Nonuniform Sampling and Reconstruction in Shift-Invariant SpacesSIAM Rev., 43
M. Aharon, Michael Elad, A. Bruckstein (2006)
On the uniqueness of overcomplete dictionaries, and a practical way to retrieve themLinear Algebra and its Applications, 416
Yi Ma, A. Yang, H. Derksen, R. Fossum (2008)
Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed DataSIAM Rev., 50
I. Maravic, M. Vetterli (2005)
Sampling and reconstruction of signals with finite rate of innovation in the presence of noiseIEEE Transactions on Signal Processing, 53
K. Kanatani, Y. Sugaya (2003)
Multi-stage Optimization for Multi-body Motion Segmentation
E. Candès, J. Romberg (2004)
Quantitative Robust Uncertainty Principles and Optimally Sparse DecompositionsFoundations of Computational Mathematics, 6
A. Aldroubi, C.A. Cabrelli, U.M. Molter (2008)
Optimal nonlinear models for sparsity and samplingJ. Funct. Anal. Appl., 14
R. Vidal, Yi Ma, S. Sastry (2005)
Generalized principal component analysis (GPCA)IEEE Transactions on Pattern Analysis and Machine Intelligence, 27
Yue Lu, M. Do
Ieee Transactions on Signal Processing 1 a Theory for Sampling Signals from a Union of Subspaces
A. Aldroubi, K. Gröchenig (2007)
NON-UNIFORM SAMPLING IN SHIFT-INVARIANT SPACES
E. Candès, T. Tao (2004)
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?IEEE Transactions on Information Theory, 52
C. Eckart, G. Young (1936)
The approximation of one matrix by another of lower rankPsychometrika, 1
R. Chellappa (2005)
Introduction of New Editor-in-ChiefIEEE Transactions on Pattern Analysis and Machine Intelligence, 27
R. Gribonval, M. Nielsen (2003)
Sparse representations in unions of basesIEEE Trans. Inf. Theory, 49
P.L. Dragotti, M. Vetterli, T. Blu (2007)
Sampling moments and reconstructing signals of finite rate of innovation: Shannon meets strang-fixIEEE Trans. Signal Process., 55
R. Gribonval, M. Nielsen (2003)
Sparse decompositions in unions of basesIEEE Trans. Inf. Theory, 49
K. Kanatani (2001)
Motion segmentation by subspace separation and model selectionProceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, 2
T. Rabbani, F. Heuvel (2005)
EFFICIENT HOUGH TRANSFORM FOR AUTOMATIC DETECTION OF CYLINDERS IN POINT CLOUDS
M. Aharon, Michael Elad, A. Bruckstein (2006)
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse RepresentationIEEE Transactions on Signal Processing, 54
Yi Ma, H. Derksen, Wei Hong, John Wright (2007)
Segmentation of Multivariate Mixed Data via Lossy Data Coding and CompressionIEEE Transactions on Pattern Analysis and Machine Intelligence, 29
K. Kanatani (2001)
Evaluation and Selection of Models for Motion Segmentation
A. Torii, A. Imiya (2007)
The randomized-Hough-transform-based method for great-circle detection on spherePattern Recognit. Lett., 28
H. Rauhut, K. Schnass, P. Vandergheynst (2007)
Compressed Sensing and Redundant DictionariesIEEE Transactions on Information Theory, 54
J. Tropp (2004)
Greed is good: algorithmic results for sparse approximationIEEE Transactions on Information Theory, 50
E. Candès, J. Romberg, T. Tao (2004)
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency informationIEEE Transactions on Information Theory, 52
Y. Lu, M.N. Do (2008)
A theory for sampling signals from a union of subspacesIEEE Trans. Signal Process., 56
A. Aldroubi, C. Cabrelli, U. Molter (2007)
Optimal Non-Linear Models for Sparsity and SamplingJournal of Fourier Analysis and Applications, 14
Recent research and new paradigms in mathematics, engineering, and science assume nonlinear signal models of the form ℳ=∪ i∈I V i consisting of a union of subspaces V i instead of a single subspace ℳ=V. These models have been used in sampling and reconstruction of signals with finite rate of innovation, the Generalized Principle Component Analysis and the subspace segmentation problem in computer vision, and problems related to sparsity, compressed sensing, and dictionary design.
Acta Applicandae Mathematicae – Springer Journals
Published: Jan 21, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.