Linear Scale and Rotation Invariant Matching.

IEEE Trans. Pattern Anal. Mach. Intell.(2011)

引用 57|浏览5
暂无评分
摘要
Matching visual patterns that appear scaled, rotated and deformed with respect to each other is a challenging problem. We propose a linear formulation that simultaneously matches feature points and estimates global geometrical transformation in a constrained linear space. The linear scheme enables search space reduction based on the lower convex hull property so that the problem size is largely decoupled from the original hard combinatorial problem. Our method therefore can be used to solve large scale problems that involve a very large number of candidate feature points. Without using pre-pruning in the search, this method is more robust in dealing with weak features and clutter. We apply the proposed method to action detection and image matching. Our results on a variety of images and videos demonstrate that our method is accurate, efficient, and robust.
更多
查看译文
关键词
feature point,action detection,global geometrical transformation estimation,image matching,shape matching,original hard combinatorial problem,linear scale,rotation invariant matching,linear scheme,convex programming,linear programming,convex hull property,candidate feature point,deformable matching,large scale problem,problem size,challenging problem,feature point matching,linear space,search space reduction,scale and rotation invariant matching,linear scale matching,linear formulation,object matching.,image motion analysis,pattern matching,shape,search space,linear program,visualization,optimization,convex hull
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要