Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Science and Engineering
      • Science and Engineering Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Science and Engineering
      • Science and Engineering Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Simple stereo matching algorithm for localising keypoints in a restricted search space

      Seabright, Matthew; Streeter, Lee; Cree, Michael J.; Duke, Mike; Tighe, Rachel
      Thumbnail
      Files
      stereo-simple-Seabright.pdf
      Accepted version, 311.3Kb
      DOI
       10.1109/IVCNZ.2018.8634791
      Find in your library  
      Citation
      Export citation
      Seabright, M., Streeter, L. V., Cree, M. J., Duke, M., & Tighe, R. (2018). Simple stereo matching algorithm for localising keypoints in a restricted search space. Presented at the International Conference on Image and Vision Computing New Zealand (IVCNZ), Auckland, New Zealand: IEEE. https://doi.org/10.1109/IVCNZ.2018.8634791
      Permanent Research Commons link: https://hdl.handle.net/10289/12453
      Abstract
      Modern stereo matching algorithms generally rely on matching image features such as colour and texture to find corresponding matches between images. They can provide very good results but be very computationally intensive. However, in cases where the objects to be localised lie approximately on a known plane, a much simpler algorithm can be applied. One such case is localising kiwifruit in modern orchards, as the plants are trained to grow in a planar structure known as a pergola. The proposed algorithm uses tight distance limits (based on orchard geometry) to reduce the search space for matching fruit to a small window. For the majority of kiwifruit, the search window is small enough to contain only one fruit in the adjacent image, giving only a single solution. In cases where there are tightly grouped fruit or false positive fruit detections adjacent to true positive fruit detections, there can be multiple potential matching solutions. To solve these, each potential solution is evaluated based on how closely it conforms to the mean object distance from camera and a solution is selected. On real world test data containing 121 image pairs, the algorithm has a 99.2 % true positive rate. Computation time was 1.97 ms per image pair.
      Date
      2018
      Type
      Conference Contribution
      Publisher
      IEEE
      Rights
      © 2018 IEEE. This is the author's version of the work. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
      Collections
      • Science and Engineering Papers [3121]
      Show full item record  

      Usage

      Downloads, last 12 months
      182
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement