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...
Learning Graph Matching (2008)
Tibério S. Caetano, Li Cheng, Quoc V. Le, Alex J. Smola
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as graphs and pattern...
Learning Graph Matching (2008)
Tibério S. Caetano, Li Cheng, Quoc V. Le, Alex J. Smola
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as graphs and pattern...
Approximating the problem, not the solution: an alternative view of point set matching (2008)
Tibério S. Caetano, Terry Caelli
Abstract. This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representational...
Graphical models and point pattern matching (2006)
Tibério S. Caetano, Terry Caelli, Dale Schuurmans
Abstract—This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a...
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...
‡Instituto de Informática Universidade Federal do Rio Grande do Sul (2004)
Tibério S. Caetano, Terry Caelli, Tibério S. Caetano, Terry Caelli
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler models in which...
Universidade Federal do Rio Grande do Sul (2004)
Tibério S. Caetano, Terry Caelli, Tibério S. Caetano, Terry Caelli
Algorithms for point matching using different distance metrics by
An optimal probabilistic graphical model for point set matching (2004)
Tibério S. Caetano, Terry Caelli
Abstract. We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relations over a...
Performance evaluation of single and multiple-gaussian models for skin color modeling (2002)
Tibério S. Caetano, Sílvia D. Olabarriaga
We present an experimental setup to evaluate the relative performance of single gaussian and mixture of gaussians models for skin color modeling. Firstly, a sample set of 1,120,000 skin pixels from a...
Performance Evaluation of Single and Multiple-Gaussian Models for Skin Color Modeling (2002)
Tib Erio Caetano, Tibério S. Caetano, Sílvia D. Olabarriaga
We present an experimental setup to evaluate the relative performance of single gaussian and mixture of gaussians models for skin color modeling. Firstly, a sample set of 1,120,000 skin pixels from a...