Sparse Representation for Computer Vision and Pattern Recognition
Proceedings of the IEEEPublished 10 May 2010Open access
John Wright, Yi Ma, Julien Mairal, Guillermo Sapiro, Thomas S. Huang, Shuicheng Yan
Citations1,855
SJR quartileQ4
SJR score0.11
SNIP0.06
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This review paper highlights a few representative examples of how the interaction between sparse signal representation and computer vision can enrich both fields, and raises a number of open questions for further study.
Abstract
10.1109/JPROC.2010.2044470
Keywords
Computer ScienceEngineering
Journal of the Royal Statistical Society Series B (Statistical Methodology)Regression Shrinkage and Selection Via the Lasso
51,790 Citations1996Robert Tibshirani
A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Cambridge University Press eBooksConvex Optimization
31,266 Citations2004Stephen Boyd, Lieven Vandenberghe
IEEE Transactions on Information TheoryCompressed sensing
23,147 Citations2006David L. Donoho
It is shown that "most" subspaces in Ropfm are near-optimal, and that convex optimization (Basis Pursuit) is a near-optimal way to extract information derived from these near-optimal subspaces.
Compressed sensing
17,129 Citations2004David L. Donoho
IEEE Transactions on Pattern Analysis and Machine IntelligenceNormalized cuts and image segmentation
15,696 Citations2000Jianbo Shi, Jitendra Malik
ScienceNonlinear Dimensionality Reduction by Locally Linear Embedding
15,035 Citations2000Sam T. Roweis, Lawrence K. Saul
Locally linear embedding (LLE) is introduced, an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs that learns the global structure of nonlinear manifolds.
Journal of Cognitive NeuroscienceEigenfaces for Recognition
13,775 Citations1991Matthew Turk, Alex Pentland
A near-real-time computer system that can locate and track a subject's head, and then recognize the person by comparing characteristics of the face to those of known individuals, and that is easy to implement using a neural network architecture.
ScienceA Global Geometric Framework for Nonlinear Dimensionality Reduction
13,740 Citations2000Joshua B. Tenenbaum, Vin de Silva +1 more
An approach to solving dimensionality reduction problems that uses easily measured local metric information to learn the underlying global geometry of a data set and efficiently computes a globally optimal solution, and is guaranteed to converge asymptotically to the true structure.
IEEE Transactions on Pattern Analysis and Machine IntelligenceEigenfaces vs. Fisherfaces: recognition using class specific linear projection
11,753 Citations1997Peter N. Belhumeur, João P. Hespanha +1 more
IEEE Transactions on Signal Processing$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
9,506 Citations2006Michal Aharon, Michael Elad +1 more
A novel algorithm for adapting dictionaries in order to achieve sparse signal representations, the K-SVD algorithm, an iterative method that alternates between sparse coding of the examples based on the current dictionary and a process of updating the dictionary atoms to better fit the data.
The Annals of StatisticsLeast angle regression
9,493 Citations2004Bradley Efron, Trevor Hastie +2 more
IEEE Transactions on Pattern Analysis and Machine IntelligenceRobust Face Recognition via Sparse Representation
9,444 Citations2009John Wright, A. Yang +3 more
This work considers the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise, and proposes a general classification algorithm for (image-based) object recognition based on a sparse representation computed by C1-minimization.
Neural ComputationLaplacian Eigenmaps for Dimensionality Reduction and Data Representation
7,709 Citations2003Mikhail Belkin, Partha Niyogi
This work proposes a geometrically motivated algorithm for representing the high-dimensional data that provides a computationally efficient approach to nonlinear dimensionality reduction that has locality-preserving properties and a natural connection to clustering.
Journal of the American Statistical AssociationThe Adaptive Lasso and Its Oracle Properties
7,633 Citations2006Hui Zou
A new version of the lasso is proposed, called the adaptive lasso, where adaptive weights are used for penalizing different coefficients in the ℓ1 penalty, and the nonnegative garotte is shown to be consistent for variable selection.
IEEE Transactions on Information TheoryDecoding by Linear Programming
7,181 Citations2005Emmanuel J. Candès, Terence Tao
F can be recovered exactly by solving a simple convex optimization problem (which one can recast as a linear program) and numerical experiments suggest that this recovery procedure works unreasonably well; f is recovered exactly even in situations where a significant fraction of the output is corrupted.
SIAM Journal on Scientific ComputingAtomic Decomposition by Basis Pursuit
6,899 Citations1998Scott Shaobing Chen, David L. Donoho +1 more
Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
ACM Computing SurveysFace recognition
6,167 Citations2003Wenyi Zhao, Rama Chellappa +2 more
This paper provides an up-to-date critical survey of still- and video-based face recognition research, and categorizes existing recognition techniques but also presents detailed descriptions of representative methods within each category.
IEEE Transactions on Image ProcessingImage Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
5,385 Citations2006Michael Elad, Michal Aharon
This work addresses the image denoising problem, where zero-mean white and homogeneous Gaussian additive noise is to be removed from a given image, and uses the K-SVD algorithm to obtain a dictionary that describes the image content effectively.
Face recognition using eigenfaces
5,211 Citations2002Matthew Turk, Alex Pentland
An approach to the detection and identification of human faces is presented, and a working, near-real-time face recognition system which tracks a subject's head and then recognizes the person by comparing characteristics of the face to those of known individuals is described.
Communications on Pure and Applied MathematicsAn iterative thresholding algorithm for linear inverse problems with a sparsity constraint
4,957 Citations2004Ingrid Daubechies, Michel Defrise +1 more
It is proved that replacing the usual quadratic regularizing penalties by weighted 𝓁p‐penalized penalties on the coefficients of such expansions, with 1 ≤ p ≤ 2, still regularizes the problem.
Journal of Fourier Analysis and ApplicationsEnhancing Sparsity by Reweighted ℓ 1 Minimization
4,945 Citations2008Emmanuel J. Candès, Michael B. Wakin +1 more
A novel method for sparse signal recovery that in many situations outperforms ℓ1 minimization in the sense that substantially fewer measurements are needed for exact recovery.
IEEE Transactions on Pattern Analysis and Machine IntelligenceFrom few to many: illumination cone models for face recognition under variable lighting and pose
4,915 Citations2001Athinodoros S. Georghiades, Peter N. Belhumeur +1 more
A generative appearance-based method for recognizing human faces under variation in lighting and viewpoint that exploits the fact that the set of images of an object in fixed pose but under all possible illumination conditions, is a convex cone in the space of images.
Multiscale Modeling and SimulationA Review of Image Denoising Algorithms, with a New One
4,004 Citations2005Antoni Buades, B. Coll +1 more
A general mathematical and experimental methodology to compare and classify classical image denoising algorithms and a nonlocal means (NL-means) algorithm addressing the preservation of structure in a digital image are defined.
Minds at UW (University of Wisconsin)Semi-Supervised Learning Literature Survey
3,868 Citations2005Xiaojin Zhu
The study clearly indicates that the common practice of stripwise precommercial thinning is unjustified, and the justification of heavy 'chessboard' thinning (with pruning) depends on whether the potential reduction in rotation length and the improvement in wood quality outweigh the discounted costs of pre-commercial thinning and selection and pruning of crop trees.
Vision ResearchSparse coding with an overcomplete basis set: A strategy employed by V1?
3,720 Citations1997Bruno A. Olshausen, David J. Field
These deviations from linearity provide a potential explanation for the weak forms of non-linearity observed in the response properties of cortical simple cells, and they further make predictions about the expected interactions among units in response to naturalistic stimuli.
IEEE Transactions on Information TheoryGreed is Good: Algorithmic Results for Sparse Approximation
3,648 Citations2004Joel A. Tropp
This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries and develops a sufficient condition under which OMP can identify atoms from an optimal approximation of a nonsparse signal.
Proceedings of the National Academy of SciencesOptimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization
2,941 Citations2003David L. Donoho, Michael Elad
This article obtains parallel results in a more general setting, where the dictionary D can arise from two or several bases, frames, or even less structured systems, and sketches three applications: separating linear features from planar ones in 3D data, noncooperative multiuser encoding, and identification of over-complete independent component models.
2009 IEEE Conference on Computer Vision and Pattern RecognitionLinear spatial pyramid matching using sparse coding for image classification
2,869 Citations2009Shuicheng Yan, Kai Yu +2 more
An extension of the SPM method is developed, by generalizing vector quantization to sparse coding followed by multi-scale spatial max pooling, and a linear SPM kernel based on SIFT sparse codes is proposed, leading to state-of-the-art performance on several benchmarks by using a single type of descriptors.
IEEE Transactions on Pattern Analysis and Machine IntelligenceGraph Embedding and Extensions: A General Framework for Dimensionality Reduction
2,863 Citations2006Shuicheng Yan, Dong Xu +4 more
Communications on Pure and Applied MathematicsFor most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution
2,541 Citations2006David L. Donoho
The techniques include the use of random proportional embeddings and almost‐spherical sections in Banach space theory, and deviation bounds for the eigenvalues of random Wishart matrices.
IEEE Transactions on Pattern Analysis and Machine IntelligenceAcquiring linear subspaces for face recognition under variable lighting
2,422 Citations2005Kuang-Chih Lee, J. Ho +1 more
This paper shows how to arrange physical lighting so that the acquired images of each object can be directly used as the basis vectors of a low-dimensional linear space and that this subspace is close to those acquired by the other methods.
IEEE Transactions on Pattern Analysis and Machine IntelligenceA database for handwritten text recognition research
2,237 Citations1994J.J. Hull
An image database for handwritten text recognition research is described that contains digital images of approximately 5000 city names, 5000 state names, 10000 ZIP Codes, and 50000 alphanumeric characters to overcome the limitations of earlier databases.
SIAM ReviewFrom Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
2,212 Citations2009Alfred M. Bruckstein⋆, David L. Donoho +1 more
The aim of this paper is to introduce a few key notions and applications connected to sparsity, targeting newcomers interested in either the mathematical aspects of this area or its applications.
Applied Physics Letters10.1162/15324430152748236
1,869 Citations2000
It is demonstrated that by exploiting a probabilistic Bayesian learning framework, the 'relevance vector machine' (RVM) can derive accurate prediction models which typically utilise dramatically fewer basis functions than a comparable SVM while offering a number of additional advantages.
IEEE Transactions on Image ProcessingSparse Representation for Color Image Restoration
1,721 Citations2007Julien Mairal, Michael Elad +1 more
This work puts forward ways for handling nonhomogeneous noise and missing information, paving the way to state-of-the-art results in applications such as color image denoising, demosaicing, and inpainting, as demonstrated in this paper.
Non-local sparse models for image restoration
1,695 Citations2009Julien Mairal, Francis Bach +3 more
Experimental results in image denoising and demosaicking tasks with synthetic and real noise show that the proposed method outperforms the state of the art, making it possible to effectively restore raw images from digital cameras at a reasonable speed and memory cost.
IEEE Transactions on Pattern Analysis and Machine IntelligenceLambertian reflectance and linear subspaces
1,568 Citations2003Ronen Basri, David W. Jacobs
Self-taught learning
1,533 Citations2007Rajat Raina, Alexis Battle +3 more
An approach to self-taught learning that uses sparse coding to construct higher-level features using the unlabeled data to form a succinct input representation and significantly improve classification performance.
2009 IEEE Conference on Computer Vision and Pattern RecognitionSparse subspace clustering
1,283 Citations2009Ehsan Elhamifar, Renè Vidal
This work proposes a method based on sparse representation (SR) to cluster data drawn from multiple low-dimensional linear or affine subspaces embedded in a high-dimensional space and applies this method to the problem of segmenting multiple motions in video.
Proceedings of the IEEEComputational Methods for Sparse Solution of Linear Inverse Problems
1,049 Citations2010Joel A. Tropp, Stephen J. Wright
This paper surveys the major practical algorithms for sparse approximation with specific attention to computational issues, to the circumstances in which individual methods tend to perform well, and to the theoretical guarantees available.
IEEE Transactions on Information TheorySparse representations in unions of bases
963 Citations2003Rémi Gribonval, Morten Nielsen
It is proved that the result of Donoho and Huo, concerning the replacement of the /spl lscr//sup 0/ optimization problem with a linear programming problem when searching for sparse representations has an analog for dictionaries that may be highly redundant.
SIAM Journal on OptimizationFixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
897 Citations2008Elaine Hale, Wotao Yin +1 more
The structure of optimal solution sets is studied, finite convergence for important quantities is proved, and $q$-linear convergence rates for the fixed-point algorithm applied to problems with $f(x)$ convex, but not necessarily strictly convex are established.
IEEE Transactions on Pattern Analysis and Machine IntelligenceSparse multinomial logistic regression: fast algorithms and generalization bounds
884 Citations2005Balaji Krishnapuram, Lawrence Carin +2 more
This paper introduces a true multiclass formulation based on multinomial logistic regression and derives fast exact algorithms for learning sparse multiclass classifiers that scale favorably in both the number of training samples and the feature dimensionality, making them applicable even to large data sets in high-dimensional feature spaces.
IEEE Transactions on Signal ProcessingOptimized Projections for Compressed Sensing
841 Citations2007Michael Elad
This paper considers the optimization of compressed sensing projections, and targets an average measure of the mutual coherence of the effective dictionary, and shows that this leads to better CS reconstruction performance.
IEEE Transactions on Information TheoryFast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
835 Citations2008David L. Donoho, Yaakov Tsaig
The Homotopy method is applied to the underdetermined lscr1-minimization problem min parxpar1 subject to y=Ax and is shown to run much more rapidly than general-purpose LP solvers when sufficient sparsity is present, implying that homotopy may be used to rapidly decode error-correcting codes in a stylized communication system with a computational budget constraint.
Analyzing appearance and contour based methods for object categorization
805 Citations2003Bastian Leibe, Bernt Schiele
A new database specifically tailored to the task of object categorization is presented, which contains high-resolution color images of 80 objects from 8 different categories and is used to analyze the performance of several appearance and contour based methods.
Learning spatially localized, parts-based representation
780 Citations2005S.Z. Li, Xin Hou +2 more
A novel method, called local non-negative matrix factorization (LNMF), for learning spatially localized, parts-based subspace representation of visual patterns, which gives a set of bases which not only allows a non-subtractive representation of images but also manifests localized features.
arXiv (Cornell University)Supervised Dictionary Learning
734 Citations2008Julien Mairal, Jean Ponce +3 more
A novel sparse representation for signals belonging to different classes in terms of a shared dictionary and discriminative class models is proposed, with results on standard handwritten digit and texture classification tasks.
Discriminative learned dictionaries for local image analysis
724 Citations2008Julien Mairal, Francis Bach +3 more
This article proposes an energy formulation with both sparse reconstruction and class discrimination components, jointly optimized during dictionary learning, for local image discrimination tasks, and paves the way for a novel scene analysis and recognition framework based on simultaneously learning discriminative and reconstructive dictionaries.
IEEE Transactions on Image ProcessingLearning with $\ell ^{1}$-graph for image analysis
609 Citations2010Bin Cheng, Shuicheng Yan +3 more
Compared with the conventional k -nearest-neighbor graph and ¿-ball graph, the ¿1-graph possesses the advantages: greater robustness to data noise, (2) automatic sparsity, and (3) adaptive neighborhood for individual datum.
IEEE Transactions on Image ProcessingLearning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization
577 Citations2009Julio M. Duarte‐Carvajalino, Guillermo Sapiro
A framework for the joint design and optimization, from a set of training images, of the nonparametric dictionary and the sensing matrix is introduced and it is shown that this joint optimization outperforms both the use of random sensing matrices and those matrices that are optimized independently of the learning of the dictionary.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE<title>A new compressive imaging camera architecture using optical-domain compression</title>
502 Citations2006Dharmpal Takhar, Jason N. Laska +6 more
A new camera architecture is developed that employs a digital micromirror array to perform optical calculations of linear projections of an image onto pseudorandom binary patterns that can be adapted to image at wavelengths that are currently impossible with conventional CCD and CMOS imagers.
Proceedings - International Conference on Image ProcessingColor Image Denoising via Sparse 3D Collaborative Filtering with Grouping Constraint in Luminance-Chrominance Space
475 Citations2007Kostadin Dabov, Alessandro Foi +2 more
The results demonstrate the effectiveness of the proposed grouping constraint and show that the developed denoising algorithm achieves state-of-the-art performance in terms of both peak signal-to-noise ratio and visual quality.
Multiscale Modeling and SimulationLearning Multiscale Sparse Representations for Image and Video Restoration
455 Citations2008Julien Mairal, Guillermo Sapiro +1 more
IEEE Transactions on Information TheoryDense Error Correction Via $\ell^1$-Minimization
314 Citations2010John Wright, Yi Ma
It is proved that for highly correlated dictionaries A, any non-negative, sufficiently sparse signal x can be recovered by solving an ℓ1-minimization problem, and suggests that accurate and efficient recovery of sparse signals is possible even with nearly 100% of the observations corrupted.
Lecture notes in computer scienceCompressive Sensing for Background Subtraction
312 Citations2008Volkan Cevher, Aswin C. Sankaranarayanan +4 more
A method to directly recover background subtracted images using CS and its applications in some communication constrained multi-camera computer vision problems is described and its approach is suitable for image coding in communication constrained problems.
Journal of Visual Communication and Image RepresentationCompression of facial images using the K-SVD algorithm
308 Citations2008Ori Bryt, Michael Elad
This work proposes a new method for compressing facial images, based on the K-SVD algorithm, and presents this new method, analyze its results and compare it to several competing compression techniques.
Infoscience (Ecole Polytechnique Fédérale de Lausanne)Bayesian Inference and Optimal Design for the Sparse Linear Model
293 Citations2008Matthias Seeger
2009 IEEE Conference on Computer Vision and Pattern RecognitionBlind motion deblurring from a single image using sparse approximation
269 Citations2009Jian‐Feng Cai, Hui Ji +2 more
Without requiring any prior information of the blur kernel as the input, the proposed approach is able to recover high-quality images from given blurred images and the new sparsity constraints under tight frame systems enable the application of a fast algorithm called linearized Bregman iteration to efficiently solve the proposed minimization problem.
Semi-supervised Learning by Sparse Representation
268 Citations2009Shuicheng Yan, Huan Wang
This paper proposes a semi-supervised learning framework based on `1 graph to utilize both labeled and unlabeled data for inference on a graph and demonstrates the superiority of this framework over the counterparts based on traditional graphs.
IEEE Transactions on Pattern Analysis and Machine IntelligenceUnsupervised, information-theoretic, adaptive image filtering for image restoration
265 Citations2006Suyash P. Awate, Ross Whitaker
A novel unsupervised, information-theoretic, adaptive filter that improves the predictability of pixel intensities from their neighborhoods by decreasing their joint entropy and can thereby restore a wide spectrum of images.
Transfer learning for image classification with sparse prototype representations
255 Citations2008Ariadna Quattoni, Michael Collins +1 more
The results show that when only few examples are available for training a target topic, leveraging knowledge learnt from other topics can significantly improve performance.
Motion segmentation via robust subspace separation in the presence of outlying, incomplete, or corrupted trajectories
220 Citations2008Shankar Rao, Roberto Tron +2 more
A robust subspace separation scheme that can deal with all of these practical issues in a unified framework and draw strong connections between lossy compression, rank minimization, and sparse representation is developed.
IEEE Transactions on Pattern Analysis and Machine IntelligenceEffective representation using ICA for face recognition robust to local distortion and partial occlusion
215 Citations2005Jongsun Kim, Jongmoo Choi +2 more
This work proposes an effective part-based local representation method named locally salient ICA (LS-ICA) method for face recognition that is robust to local distortion and partial occlusion and compares it with other part- based representations such as LNMF (localized nonnegative matrix factorization) and LFA (local feature analysis).
2009 IEEE Conference on Computer Vision and Pattern RecognitionMulti-label sparse coding for automatic image annotation
213 Citations2009Changhu Wang, Shuicheng Yan +2 more
Extensive image annotation experiments on the Corel5k and Corel30k databases both show the superior performance of the proposed multi-label sparse coding framework over the state-of-the-art algorithms.
Journal of Ambient Intelligence and Smart EnvironmentsDistributed recognition of human actions using wearable motion sensor networks
209 Citations2009Allen Y. Yang, Roozbeh Jafari +2 more
A distributed recognition framework to classify continuous human actions using a low-bandwidth wearable motion sensor network, called distributed sparsity classifier (DSC), validates the robustness of the distributed recognitionframework on an unreliable wireless network and demonstrates the ability of DSC to conserve sensor energy for communication while preserve accurate global classification.
Face recognition with contiguous occlusion using markov random fields
200 Citations2009Zihan Zhou, Andrew Wagner +3 more
This work shows how a Markov Random Field model for spatial continuity of the occlusion can be integrated into the computation of a sparse representation of the test image with respect to the training images and efficiently and reliably identifies the corrupted regions and excludes them from the sparse representation.
Lecture notes in computer scienceDiscriminative Sparse Image Models for Class-Specific Edge Detection and Image Interpretation
193 Citations2008Julien Mairal, Marius Leordeanu +3 more
A multiscale method to minimize least-squares reconstruction errors and discriminative cost functions under ?
2009 IEEE Conference on Computer Vision and Pattern RecognitionTowards a practical face recognition system: Robust registration and illumination by sparse representation
185 Citations2009Andrew Wagner, John Wright +3 more
It is shown that the proposed simple and practical face recognition system can efficiently and effectively recognize faces under a variety of realistic conditions, using only frontal images under the proposed illuminations as training.
Uncertainty in Artificial IntelligenceShift-invariant sparse coding for audio classification
159 Citations2007Roger Grosse, Rajat Raina +2 more
This paper presents an efficient algorithm for learning SISC bases, and shows that SISC's learned high-level representations of speech and music provide useful features for classification tasks within those domains.
Journal of Mathematical Imaging and VisionSparse Modeling of Textures
158 Citations2008Gabriel Peyré
A generative model for textures that uses a local sparse description of the image content that enforces the sparsity of the expansion of local texture patches on adapted atomic elements is presented.
Frame based signal compression using method of optimal directions (MOD)
137 Citations2003Kjersti Engan, S.O. Aase +1 more
This paper uses frames designed by MOD in a multiframe compression (MFC) scheme to apply to ECG signals, and demonstrates improved rate-distortion performance by 1-4 dB, and that variable sized frames perform better than fixed sized frames.
IEEE Transactions on Signal ProcessingDictionary Preconditioning for Greedy Algorithms
135 Citations2008Karin Schnass, Pierre Vandergheynst
An alteration of greedy algorithms like thresholding or (orthogonal) matching pursuit which improves their performance in finding sparse signal representations in redundant dictionaries while maintaining the same complexity is presented.
Sparse Representations for Image Classification: Learning Discriminative and Reconstructive Non-Parametric Dictionaries
134 Citations2008Fernando Rodríguez, Guillermo Sapiro
A framework for learning optimal dictionaries for simultaneous sparse signal representation and robust class classification is introduced, addressing for the first time the explicit incorporation of both reconstruction and discrimination terms in the non-parametric dictionary learning and sparse coding energy.
The MIT Press eBooksAdaptive Sparseness Using Jeffreys' Prior
130 Citations2002Mário A. T. Figueiredo
This paper introduces a new sparseness inducing prior which does not involve any (hyper) parameters that need to be adjusted or estimated, and performs competitively with the best alternative techniques, both in terms of error rates andSparseness.
Computational Methods for Sparse Solution of Linear Inverse Problems
126 Citations2009Joel A. Tropp, Stephen J. Wright
2009 IEEE Conference on Computer Vision and Pattern RecognitionA compressive sensing approach for expression-invariant face recognition
107 Citations2009Pradeep Nagesh, Baoxin Li
It is shown that substantially low dimensional versions of the training features, such as ones extracted from critically downsampled training images, or low dimensional random projection of original feature images, still have sufficient information for good classification.
2009 IEEE Conference on Computer Vision and Pattern RecognitionExpression-insensitive 3D face recognition using sparse representation
102 Citations2009Xiaoxing Li, Tao Jia +1 more
This work presents a face recognition method based on sparse representation for recognizing 3D face meshes under expressions using low-level geometric features and shows that by choosing higher-ranked features, the recognition rates approach those for neutral faces, without requiring an extensive set of reference faces for each individual.
BioMed Research InternationalSparse Representation for Classification of Tumors Using Gene Expression Data
77 Citations2009Xiyi Hang, Fang‐Xiang Wu
A new method is proposed for cancer diagnosis using gene expression data by casting the classification problem as finding sparse representations of test samples with respect to training samples and the sparse representation is computed by the l1-regularized least square method.
Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern RecognitionRobust estimation of foreground in surveillance videos by sparse error estimation
74 Citations2008Mert Dikmen, Thomas S. Huang
This work provides a novel framework for background subtraction with the added benefit of easy integration of local discriminative information (e.g. gradient, texture, motion field etc.) for improved robustness.
2009 IEEE Conference on Computer Vision and Pattern RecognitionEnforcing integrability by error correction using ℓ<sub>1</sub>-minimization
55 Citations2009Dikpal Reddy, Amit Agrawal +1 more
This paper presents an exhaustive analysis of the properties of ℓ1 solution for gradient field integration using linear algebra and graph analogy, and shows that the solution performs well across all scenarios without the need for any tunable parameter adjustments.
2009 IEEE Conference on Computer Vision and Pattern RecognitionMulti-label sparse coding for automatic image annotation
44 Citations2009Changhu Wang, Shuicheng Yan +2 more
Zenodo (CERN European Organization for Nuclear Research)Using Sparse Representations For Missing Data Imputation In Noise Robust Speech Recognition
40 Citations2008Cranen, Bert, Gemmeke, Jort
A novel imputation technique working on entire words that achieves recognition accuracies of 92% at SNR -5 dB using oracle masks on AURORA-2 as compared to 61% using a conventional frame-based approach.
Sparse representation of cast shadows via &#x2113;1-regularized least squares
33 Citations2009Xue Mei, Haibin Ling +1 more
This paper shows that the set of images produced by a Lambertian scene with cast shadows can be efficiently represented by a sparseSet of images generated by directional light sources, and expresses the problem in an ℓ1-regularized least squares formulation, with nonnegativity constraints.
Applied OpticsFeature-specific structured imaging
23 Citations2006Pawan K. Baheti, Mark A. Neifeld
Compared to the optimal LMMSE postprocessing of a conventional image, feature-specific structured imaging provides a 38% rms error reduction and requires 400 times fewer measurements for a noise standard deviation of sigma = 2 x 10(-3).
University of Minnesota Digital Conservancy (University of Minnesota)Sparse Modeling with Universal Priors and Learned Incoherent Dictionaries
23 Citations2009Ignacio Ramírez, Federico Lecumberry +1 more
Applied OpticsAdaptive feature-specific imaging: a face recognition example
21 Citations2008Pawan K. Baheti, Mark A. Neifeld
The AFSI system exhibits significant improvement compared to SFSI and conventional imaging at low signal-to-noise ratio (SNR) and shows a trade-off between measurement SNR and adaptation advantage, resulting in an optimal value of integration time (equivalent to SNR) per measurement.
Lirias (KU Leuven)Noise robust digit recognition using sparse representations
18 Citations2008Jort F. Gemmeke, Bert Cranen
A novel non-parametric classification method that can handle missing data while simultaneously exploiting the dependencies between the reliable features in an entire word is presented.
Discriminative <i>k</i> -metrics
17 Citations2009Arthur Szlam, Guillermo Sapiro
A modification of the k q-flats framework for pattern classification is introduced, to replace the original reconstruction only energy, which is optimized to obtain the k affine spaces, by a new energy that incorporates discriminative terms.
Automatic parameter setting for iterative shrinkage methods
13 Citations2008Raja Giryes, Michael Elad +1 more
This work considers an iterated shrinkage method that is based on the separable surrogate functions (SSF) idea, which exploits the sparsity of the unknown vector in an appropriate representation, and proposes an alternative, and highly effective method for tuning.
Optics ExpressRandom projections based feature-specific structured imaging
9 Citations2008Pawan K. Baheti, Mark A. Neifeld
A feature-specific imaging system based on the use of structured illumination that shows the feasibility of the proposed approach by using 42% fewer measurements than the object dimensionality is presented.
Distributed compression and fusion of nonnegative sparse signals for multiple-view object recognition
9 Citations2009Allen Y. Yang, Subhransu Maji +3 more
This paper proposes an efficient distributed data compression and fusion scheme to encode and transmit SIFT-based visual histograms in a multi-hop network to perform accurate 3-D object recognition.
…