CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2011 vol.33 Issue No.07 - July
Issue No.07 - July (2011 vol.33)
Hao Jiang , Boston College, Chestnut Hill
Stella X. Yu , Boston College, Chestnut Hill
David R. Martin , Google Inc., Mountain View
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 prepruning 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.
Scale and rotation invariant matching, deformable matching, linear programming, action detection, shape matching, object matching.
Hao Jiang, Stella X. Yu, David R. Martin, "Linear Scale and Rotation Invariant Matching", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.33, no. 7, pp. 1339-1355, July 2011, doi:10.1109/TPAMI.2010.212