Sciweavers

85 search results - page 2 / 17
» A DC Programming Approach for Sparse Eigenvalue Problem
Sort
View

Publication
433views
14 years 1 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
NIPS
2004
13 years 6 months ago
A Direct Formulation for Sparse PCA Using Semidefinite Programming
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
Alexandre d'Aspremont, Laurent El Ghaoui, Michael ...
SIAMJO
2008
93views more  SIAMJO 2008»
13 years 5 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
CVPR
2010
IEEE
14 years 1 months ago
Specular Surface Reconstruction from Sparse Reflection Correspondences
We present a practical approach for surface reconstruction of smooth mirror-like objects using sparse reflection correspondences (RCs). Assuming finite object motion with a fix...
Aswin Sankaranarayanan, Ashok Veeraraghavan, Oncel...
CGF
2008
101views more  CGF 2008»
13 years 5 months ago
Spectral Conformal Parameterization
We present a spectral approach to automatically and efficiently obtain discrete free-boundary conformal parameterizations of triangle mesh patches, without the common artifacts du...
Patrick Mullen, Yiying Tong, Pierre Alliez, Mathie...