Visual reconstruction
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
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
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Computing Geodesics and Minimal Surfaces via Graph Cuts
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Linear Programming and Network Flows
Linear Programming and Network Flows
Representation and detection of deformable shapes
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Linear programming matching and appearance-adaptive object tracking
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in 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
Efficient MRF deformation model for non-rigid image matching
Computer Vision and Image Understanding
Matching Hierarchies of Deformable Shapes
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
A quadratic programming based cluster correspondence projection algorithm for fast point matching
Computer Vision and Image Understanding
Original paper: Real time feature extraction and Standard Cutting Models fitting in grape leaves
Computers and Electronics in Agriculture
From region based image representation to object discovery and recognition
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Rotation invariant non-rigid shape matching in cluttered scenes
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Retrieval of multiple instances of objects in videos
MMM'12 Proceedings of the 18th international conference on Advances in Multimedia Modeling
Region based on object recognition in 3d scenes
IScIDE'11 Proceedings of the Second Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
Robust point matching revisited: a concave optimization approach
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part II
Finding correspondence from multiple images via sparse and low-rank decomposition
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Patch-based spatio-temporal super-resolution for video with non-rigid motion
Image Communication
A linear programming based method for joint object region matching and labeling
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part II
| Hi-index | 0.14 |
We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. Matching is formulated as metric labeling with L_{1} regularization terms, for which we propose a novel linear programming relaxation method and an efficient successive convexification implementation. The unique feature of the proposed relaxation scheme is that a much smaller set of basis labels is used to represent the original label space. This greatly reduces the size of the searching space. A successive convexification scheme solves the labeling problem in a coarse to fine manner. Importantly, the original cost function is reconvexified at each stage, in the new focus region only, and the focus region is updated so as to refine the searching result. This makes the method well-suited for large label set matching. Experiments demonstrate successful applications of the proposed matching scheme in object detection, motion estimation, and tracking.