Sciweavers

178 search results - page 34 / 36
» LSMR: An iterative algorithm for sparse least-squares proble...
Sort
View
CVPR
2011
IEEE
12 years 11 months ago
Topologically-Robust 3D Shape Matching Based on Diffusion Geometry and Seed Growing
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...
Avinash Sharma, Radu Horaud, Jan Cech, Edmond Boye...
MM
2010
ACM
177views Multimedia» more  MM 2010»
13 years 7 months ago
Image tag refinement towards low-rank, content-tag prior and error sparsity
The vast user-provided image tags on the popular photo sharing websites may greatly facilitate image retrieval and management. However, these tags are often imprecise and/or incom...
Guangyu Zhu, Shuicheng Yan, Yi Ma
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
13 years 5 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
ICIP
2007
IEEE
14 years 9 months ago
Compressed Sensing Image Reconstruction Via Recursive Spatially Adaptive Filtering
We introduce a new approach to image reconstruction from highly incomplete data. The available data are assumed to be a small collection of spectral coef?cients of an arbitrary li...
Karen O. Egiazarian, Alessandro Foi, Vladimir Katk...
CIMAGING
2009
120views Hardware» more  CIMAGING 2009»
13 years 8 months ago
Dantzig selector homotopy with dynamic measurements
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
Muhammad Salman Asif, Justin K. Romberg