Search For:

Displaying 1-4 out of 4 total
Learning Graph Matching
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Tibério S. Caetano, Julian J. McAuley, Li Cheng, Quoc V. Le, Alex J. Smola
Issue Date:June 2009
pp. 1048-1058
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspon...
 
Unified graph matching in Euclidean spaces
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Julian J. McAuley, Teofilo de Campos, Tiberio S. Caetano
Issue Date:June 2010
pp. 1871-1878
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for computer vision. There are several variants of the matching problem, concerned with...
 
Fast Inference with Min-Sum Matrix Product
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Pedro F. Felzenszwalb,Julian J. McAuley
Issue Date:December 2011
pp. 2549-2554
The MAP inference problem in many graphical models can be solved efficiently using a fast algorithm for computing min-sum products of n \times n matrices. The class of models in question includes cyclic and skip-chain models that arise in many applications...
 
Graph Rigidity, Cyclic Belief Propagation, and Point Pattern Matching
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Julian J. McAuley, Tibério S. Caetano, Marconi S. Barbosa
Issue Date:November 2008
pp. 2047-2054
A recent paper \cite{CaeCaeSchBar06} proposed a provably optimal, polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal graphical model. Its fundamental result is that the chordal...
 
 1