Sciweavers

1728 search results - page 138 / 346
» Image Distance Using Hidden Markov Models
Sort
View
CIVR
2005
Springer
183views Image Analysis» more  CIVR 2005»
14 years 1 months ago
Automated Image Annotation Using Global Features and Robust Nonparametric Density Estimation
This paper describes a simple framework for automatically annotating images using non-parametric models of distributions of image features. We show that under this framework quite ...
Alexei Yavlinsky, Edward Schofield, Stefan M. R&uu...
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
ICCV
2009
IEEE
1824views Computer Vision» more  ICCV 2009»
15 years 26 days 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
ECCV
2002
Springer
14 years 9 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
ICIP
2003
IEEE
14 years 9 months ago
Classification of textures seen from different distances and under varying illumination direction
Changes in the angle of illumination incident upon a 3D surface texture can significantly alter its appearance, implying variations in the image texture. These texture variations ...
Xavier Lladó, Joan Martí, Maria Petr...