19 search results - page 1 / 4 » Probabilistic Subgraph Matching Based on Convex Relaxation |
EMMCVPR
2005
Springer
13 years 10 months ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
ISDA
2009
IEEE
13 years 11 months ago
2009
IEEE
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
TIT
2010
12 years 11 months ago
2010
This paper considers recovery of jointly sparse multichannel signals from incomplete measurements. Several approaches have been developed to recover the unknown sparse vectors from...
CVPR
2006
IEEE
14 years 6 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
ICPR
2006
IEEE
14 years 5 months ago
2006
IEEE
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...