Sciweavers

619 search results - page 24 / 124
» Random Bichromatic Matchings
Sort
View
ECCV
2002
Springer
14 years 10 months ago
Stereo Matching Using Belief Propagation
In this paper, we formulate the stereo matching problem as a Markov network consisting of three coupled Markov random fields (MRF's). These three MRF's model a smooth fie...
Jian Sun, Heung-Yeung Shum, Nanning Zheng
ACIVS
2009
Springer
14 years 3 months ago
Comparing Feature Matching for Object Categorization in Video Surveillance
In this paper we consider an object categorization system using local HMAX features. Two feature matching techniques are compared: the MAX technique, originally proposed in the HMA...
Rob G. J. Wijnhoven, Peter H. N. de With
CORR
2011
Springer
148views Education» more  CORR 2011»
13 years 3 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport
ICPR
2002
IEEE
14 years 10 months ago
Probabilistic Models for Generating, Modelling and Matching Image Categories
In this paper we present a probabilistic and continuous framework for supervised image category modelling and matching as well as unsupervised clustering of image space into image...
Hayit Greenspan, Shiri Gordon, Jacob Goldberger
RSA
2002
87views more  RSA 2002»
13 years 8 months ago
Inexpensive d-dimensional matchings
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz