Exact Inference in Graphical Models: is There More to it? (2009)
McAuley, Julian J., Caetano, Tiberio S.
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treewidth of the graph,...
Robust Near-Isometric Matching via Structured Learning of Graphical Models (2009)
Julian J. Mcauley, Tibério S. Caetano, Alexander J. Smola
Models for near-rigid shape matching are typically based on distance-related features, in order to infer matches that are consistent with the isometric assumption. However, real shapes from image...
Robust Near-Isometric Matching via Structured Learning of Graphical Models (2008)
McAuley, Julian J., Caetano, Tiberio S., Smola, Alex J.
Models for near-rigid shape matching are typically based on distance-related features, in order to infer matches that are consistent with the isometric assumption. However, real shapes from image...
Graph Rigidity, Cyclic Belief Propagation and Point Pattern Matching (2008)
McAuley, Julian J, Caetano, Tiberio S, Barbosa, Marconi S
A recent paper [1] 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...
Robust Near-Isometric Matching via Structured Learning of Graphical Models (2008)
McAuley, Julian J., Caetano, Tiberio S., Smola, Alexander J.
Models for near-rigid shape matching are typically based on distance-related features, in order to infer matches that are consistent with the isometric assumption. However, real shapes from image...
Learning Graph Matching (2008)
Caetano, Tiberio S., McAuley, Julian J., Cheng, Li, Le, Quoc V., Smola, Alex J.
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...
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching (2007)
McAuley, Julian J., Caetano, Tiberio S., Barbosa, Marconi S.
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...
The rich-club phenomenon across complex network hierarchies (2007)
McAuley, Julian J., Costa, Luciano Da Fontoura, Caetano, Tiberio S.
The so-called rich-club phenomenon in a complex network is characterized when nodes of higher degree (hubs) are better connected among themselves than are nodes with smaller degree. The presence of...
Learning high-order MRF priors of color images (2006)
Julian J. Mcauley, Tibério S. Caetano, Alex J. Smola, Matthias O. Franz
In this paper, we use large neighborhood Markov random fields to learn rich prior models of color images. Our approach extends the monochromatic Fields of Experts model (Roth & Black, 2005a) to...