IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v232y2014icp624-631.html
   My bibliography  Save this article

Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scale

Author

Listed:
  • Tang, Zhenjun
  • Zhang, Xianquan
  • Yu, Chunqiang
  • He, Dan

Abstract

Point pattern matching is an important topic in computer vision and pattern recognition, and finds many applications such as image registration, motion detection, object tracking and pose estimation. In this paper, we propose an efficient algorithm for determining correspondence between two planar point sets under transform of translation, rotation and scale. This algorithm randomly selects some points of a set and extracts their neighbor points. It views the selected points and their neighbor points as local point patterns, and finds the local matched patterns in the other set. Point pattern matching is finally achieved by counting the unique point number of those local matched point patterns with the same transform parameters. Many experiments are conducted to validate efficiency of the proposed algorithm. Running time comparisons with a well-known point pattern matching algorithm are also done and the results show that the proposed algorithm is faster than the compared algorithm.

Suggested Citation

  • Tang, Zhenjun & Zhang, Xianquan & Yu, Chunqiang & He, Dan, 2014. "Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scale," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 624-631.
    • Handle: RePEc:eee:apmaco:v:232:y:2014:i:c:p:624-631
    DOI: 10.1016/j.amc.2014.01.087
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300314001246
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2014.01.087?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Xiaoyun Wang & Xianquan Zhang, 2012. "Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform," Journal of Applied Mathematics, Hindawi, vol. 2012, pages 1-12, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:232:y:2014:i:c:p:624-631. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.