Sciweavers

81 search results - page 9 / 17
» Efficient Shape Matching Via Graph Cuts
Sort
View
CVIU
2011
12 years 10 months ago
Graph attribute embedding via Riemannian submersion learning
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...
Haifeng Zhao, Antonio Robles-Kelly, Jun Zhou, Jian...
CVPR
2000
IEEE
14 years 8 months ago
Robust and Efficient Skeletal Graphs
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi
CVPR
2005
IEEE
14 years 8 months ago
OBJ CUT
In this paper we present a principled Bayesian method for detecting and segmenting instances of a particular object category within an image, providing a coherent methodology for ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
CVGIP
2008
108views more  CVGIP 2008»
13 years 6 months ago
Efficient texture synthesis using strict Wang Tiles
Wang Tiles are constructed from four texture samples, arranged so they can always match a choice of other tiles at two edges. Because they are precomputed, Wang Tiles are a very e...
Xinyu Zhang, Young J. Kim
HLK
2003
IEEE
14 years 3 hour ago
Pose-Based Clustering in Action Sequences
A method is presented for automatically extracting key frames from an image sequence. The sequence is divided into clusters of frames with similar appearance, and the most central...
Gareth Loy, Josephine Sullivan, Stefan Carlsson