The likelihood models used in probabilistic visual tracking applications are often complex non-linear and/or nonGaussian functions, leading to analytically intractable inference. ...
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
? Robust feature matching across different views of the same scene taken by two cameras with wide baseline and arbitrary rotation is still an open problem. Matching based on appear...
Classifying high-dimensional numerical data is a very challenging problem. In high dimensional feature spaces, the performance of supervised learning methods suffer from the curse...