Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Approximation algorithms for the metric labeling problem via a new linear programming formulation
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
EigenTracking: Robust Matching and Tracking of Articulated Objects Using a View-Based Representation
ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
The Softassign Procrustes Matching Algorithm
IPMI '97 Proceedings of the 15th International Conference on Information Processing in Medical Imaging
Multi-camera Scene Reconstruction via Graph Cuts
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Finding Deformable Shapes Using Loopy Belief Propagation
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Real-Time Motion Analysis with Linear-Programming
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Stereo Matching Using Belief Propagation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Global optimization using embedded graphs
Global optimization using embedded graphs
Efficient Belief Propagation for Early Vision
International Journal of Computer Vision
Adaptive view-based appearance models
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
IEEE Transactions on Information Theory
Matching by Linear Programming and Successive Convexification
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Method for Moving Object Extraction and Tracking Based on the Exclusive Block Matching
PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
| Hi-index | 0.00 |
In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric is involved. The unique feature of the proposed scheme is that we use a much smaller set of basis labels to represent the label space. In a coarse to fine manner, the approximation improves during iteration. The proposed scheme behaves very differently from other methods in which the label space is kept constant in the solution process, and is well suited for very large label set matching problems. Based on the proposed matching scheme, we develop a robust multi-template tracking method. We also increase the efficiency of the template searching by a Markov model. The proposed tracking method uses a small number of graph templates and is able to deal with cases in which objects change appearance drastically due to change of aspect or object deformation.