Sciweavers

28 search results - page 3 / 6
» Similarity Measure Computation of Convex Polyhedra Revisited
Sort
View
ICCV
2009
IEEE
14 years 8 months ago
The Self-Aware Matching Measure for Stereo
We revisit stereo matching functions, a topic that is considered well understood, from a different angle. Our goal is to discover a transformation that operates on the cost or s...
Philippos Mordohai

Publication
1763views
14 years 1 days ago
Reranking with Contextual dissimilarity measures from representational Bregman k-means
We present a novel reranking framework for Content Based Image Retrieval (CBIR) systems based on con-textual dissimilarity measures. Our work revisit and extend the method of Perro...
Olivier Schwander, Frank Nielsen
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
13 years 10 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
ICALP
2009
Springer
14 years 3 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
AIMSA
2008
Springer
13 years 10 months ago
Thematic Segment Retrieval Revisited
Documents, especially long ones, may contain very diverse passages related to different topics. Passages Retrieval approaches have shown that, in most cases, there is a great pote...
Sylvain Lamprier, Tassadit Amghar, Bernard Levrat,...