Sciweavers

347 search results - page 52 / 70
» Using Spanning Graphs for Efficient Image Registration
Sort
View
ICIAP
1999
ACM
14 years 7 days ago
Bayesian Graph Edit Distance
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
Richard Myers, Richard C. Wilson, Edwin R. Hancock
CVPR
2009
IEEE
15 years 3 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ICCV
2009
IEEE
1234views Computer Vision» more  ICCV 2009»
15 years 28 days ago
Human Pose Estimation Using Consistent Max-Covering
We propose a novel consistent max-covering scheme for human pose estimation. Consistent max-covering formulates pose estimation as the covering of body part polygons on an objec...
Hao Jiang
CVPR
2008
IEEE
14 years 10 months ago
3D model matching with Viewpoint-Invariant Patches (VIP)
The robust alignment of images and scenes seen from widely different viewpoints is an important challenge for camera and scene reconstruction. This paper introduces a novel class ...
Changchang Wu, Brian Clipp, Xiaowei Li, Jan-Michae...
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 8 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry