IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/568034.html
   My bibliography  Save this article

Self-Similarity Based Corresponding-Point Extraction from Weakly Textured Stereo Pairs

Author

Listed:
  • Min Mao
  • Kuang-Rong Hao
  • Yong-Sheng Ding

Abstract

For the areas of low textured in image pairs, there is nearly no point that can be detected by traditional methods. The information in these areas will not be extracted by classical interest-point detectors. In this paper, a novel weakly textured point detection method is presented. The points with weakly textured characteristic are detected by the symmetry concept. The proposed approach considers the gray variability of the weakly textured local regions. The detection mechanism can be separated into three steps: region-similarity computation, candidate point searching, and refinement of weakly textured point set. The mechanism of radius scale selection and texture strength conception are used in the second step and the third step, respectively. The matching algorithm based on sparse representation (SRM) is used for matching the detected points in different images. The results obtained on image sets with different objects show high robustness of the method to background and intraclass variations as well as to different photometric and geometric transformations; the points detected by this method are also the complement of points detected by classical detectors from the literature. And we also verify the efficacy of SRM by comparing with classical algorithms under the occlusion and corruption situations for matching the weakly textured points. Experiments demonstrate the effectiveness of the proposed weakly textured point detection algorithm.

Suggested Citation

  • Min Mao & Kuang-Rong Hao & Yong-Sheng Ding, 2014. "Self-Similarity Based Corresponding-Point Extraction from Weakly Textured Stereo Pairs," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-20, September.
  • Handle: RePEc:hin:jnlmpe:568034
    DOI: 10.1155/2014/568034
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/568034.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2014/568034.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/568034?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:568034. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.