1 / 17

Multiscale Distance Matrix for Fast Plant Leaf Recognition

Multiscale Distance Matrix for Fast Plant Leaf Recognition. Rongxiang Hu, Wei Jia , Haibin ling, and Deshuang Huang. Outline. Introduction Multiscale Distance Matrix Experiments and Discussion Conclusions. Introduction.

colleen-burks
Download Presentation

Multiscale Distance Matrix for Fast Plant Leaf Recognition

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Multiscale Distance Matrix for Fast Plant Leaf Recognition Rongxiang Hu, Wei Jia, Haibin ling, and Deshuang Huang

  2. Outline Introduction Multiscale Distance Matrix Experiments and Discussion Conclusions

  3. Introduction Shape is one of the most important features of an object. It plays a key role in many object recognition tasks, in which objects are easily distinguished by shape rather than other features such as edge, corner, color, and texture. There are usually two critical parts in a shape recognition approach, shape representation and shape matching.

  4. Introduction In this brief, we propose a novel contour-based shape descriptor named Multiscale Distance Matrix (MDM) to capture the geometric structure of a shape while being invariant to translation, rotation, scaling, and bilateral symmetry.

  5. Outline Introduction Method - MultiscaleDistance Matrix Experiments and Discussion Conclusions

  6. Multiscale Distance Matrix

  7. Multiscale Distance Matrix

  8. Outline Introduction Multiscale Distance Matrix Experiments and Discussion Conclusions

  9. Experiments and Discussion Eight samples from the Swedish Leaf data set.

  10. Experiments and Discussion

  11. Experiments and Discussion Eight samples from the Clean Swedish Leaf data set.

  12. Experiments and Discussion

  13. Experiments and Discussion Samples of different species from three subsets of ICL Leaf data set.

  14. Experiments and Discussion

  15. Outline Introduction Multiscale Distance Matrix Experiments and Discussion Conclusions

  16. Conclusions • The proposed method for shape recognition has three additional advantages in comparison with the state-of-the-art approaches. • Significantly fewer parameters to tune. Specifically, only one parameter is needed, i.e., the number of points on the shape contour. • Extremely fast evaluation speed compared with DP-based procedure. • Very easy to implement since it is based only on the distance matrix of the shape.

  17. Conclusions • There are several important issues about the MDM that have to be addressed here. • To compute the MDM, the distance matrix of the shape boundary points are assumed to be known. • The metric selection is critical, and the discriminability highly depends on the metric. • MDM is data-independent while the dimensionality reduction used is data-dependent, so the proposed approach may be limited in shape recognition applications.

More Related