Sciweavers

275 search results - page 42 / 55
» Localization from Incomplete Noisy Distance Measurements
Sort
View
CACM
2010
161views more  CACM 2010»
13 years 6 months ago
Efficiently searching for similar images
As it becomes increasingly viable to capture, store, and share large amounts of image and video data, automatic image analysis is crucial to managing visual information. Many prob...
Kristen Grauman
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 7 months ago
Sparse Recovery by Non-convex Optimization -- Instance Optimality
In this note, we address the theoretical properties of p, a class of compressed sensing decoders that rely on p minimization with p (0, 1) to recover estimates of sparse and compr...
Rayan Saab, Özgür Yilmaz
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 2 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
MP
2011
13 years 2 months ago
Statistical ranking and combinatorial Hodge theory
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye