Abstract
Abstract The main purpose of this study was to extend an algorithm proposed by Liang and Shi in 2003 for the measurement of similarity in pattern-recognition problems. The third measure of similarity in their algorithm fails to satisfy the necessary criteria, thereby invalidating their claims. In this study we developed two new approaches that satisfy the four axioms associated with the measurement of similarity. We then implemented these measures in a new algorithm and used numerical examples to examine the problem encountered by Liang and Shi. Finally, we evaluated the applicability of the proposed algorithm in a problem involving radar target recognition. Our findings provide a solid foundation for the development of a logical framework with which to select an appropriate measure of similarity for pattern-recognition problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
