Sciweavers

3349 search results - page 622 / 670
» A model for image patch-based algorithms
Sort
View
EDBT
2011
ACM
225views Database» more  EDBT 2011»
14 years 6 months ago
On (not) indexing quadratic form distance by metric access methods
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
Tomás Skopal, Tomás Bartos, Jakub Lo...
CVPR
2009
IEEE
16 years 10 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
ICCV
2009
IEEE
1824views Computer Vision» more  ICCV 2009»
16 years 8 months ago
Beyond the Euclidean distance: Creating effective visual codebooks using the histogram intersection kernel
Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the Euclidean distance to cluster features into visual...
Jianxin Wu, James M. Rehg
ICCV
2009
IEEE
16 years 8 months ago
A Global Perspective on MAP Inference for Low-Level Vision
In recent years the Markov Random Field (MRF) has become the de facto probabilistic model for low-level vision applications. However, in a maximum a posteriori (MAP) framework, ...
Oliver J. Woodford, Carsten Rother, Vladimir Kolmo...
CVPR
2006
IEEE
16 years 5 months ago
Robust Tracking and Stereo Matching under Variable Illumination
Illumination inconsistencies cause serious problems for classical computer vision applications such as tracking and stereo matching. We present a new approach to model illuminatio...
Jingdan Zhang, Leonard McMillan, Jingyi Yu