Sciweavers

512 search results - page 34 / 103
» Randomness and Geometric Features in Computer Vision
Sort
View
ACCV
2009
Springer
14 years 2 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
ECCV
2006
Springer
14 years 9 months ago
Discovering Texture Regularity as a Higher-Order Correspondence Problem
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
James Hays, Marius Leordeanu, Alexei A. Efros, Yan...
ICPR
2008
IEEE
14 years 8 months ago
Change detection based on adaptive Markov Random Fields
Usually changes in remote sensing images go along with the appearance or disappearance of some edges. In addition, pixels located along the edges are likely to weakly influenced b...
Chunlei Huo, Hanqing Lu, Jian Cheng, Keming Chen, ...
CVPR
2005
IEEE
14 years 9 months ago
Discriminative Learning of Markov Random Fields for Segmentation of 3D Scan Data
We address the problem of segmenting 3D scan data into objects or object classes. Our segmentation framework is based on a subclass of Markov Random Fields (MRFs) which support ef...
Dragomir Anguelov, Benjamin Taskar, Vassil Chatalb...
ALGOSENSORS
2007
Springer
14 years 1 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...