Sciweavers

616 search results - page 9 / 124
» Local Feature Matching Using Entropic Graphs
Sort
View
ICMCS
2008
IEEE
165views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Graph cuts by using local texture features of wavelet coefficient for image segmentation
This paper proposes an approach to image segmentation using Iterated Graph Cuts based on local texture features of wavelet coefficient. Using Multiresolution Analysis based on Ha...
Keita Fukuda, Tetsuya Takiguchi, Yasuo Ariki
ICPR
2008
IEEE
14 years 2 months ago
Effective scene matching with local feature representatives
Scene matching measures the similarity of scenes in photos and is of central importance in applications where we have to properly organize large amount of digital photos by scene ...
Shugao Ma, Weiqiang Wang, Qingming Huang, Shuqiang...
ICPR
2010
IEEE
14 years 2 months ago
A Graph Matching Algorithm using Data-Driven Markov Chain Monte Carlo Sampling
We propose a novel stochastic graph matching algorithm based on data-driven Markov Chain Monte Carlo (DDMCMC) sampling technique. The algorithm explores the solution space efficien...
Jungmin Lee, Minsu Cho, Kyoung Mu Lee
ICIP
2009
IEEE
14 years 8 months ago
Exploiting Local Structure For Tracking Plant Cells In Noisy Images
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
CVPR
2012
IEEE
11 years 10 months ago
Robust non-rigid registration of 2D and 3D graphs
We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...
Eduard Serradell, Przemyslaw Glowacki, Jan Kybic, ...