Abstract

In image recognition, how to select informative features from the feature space is a very significant task. Relief algorithm is considered as one of the most successful methods for evaluating the quality of features. In this paper, it firstly provides a valid proof which demonstrates a blind selection problem in the previous Relief algorithm. And then this paper proposes an adaptive Relief (A-Relief) algorithm to alleviate the deficiencies of Relief by dividing the instance set adaptively. Lastly, it uses grey level co- occurrence matrix (GLCM) to extract text features and applies A- Relief algorithm to classify these features. The experimental results illustrate A-Relief algorithm proposed in this paper can improve the accuracy of the classification effectively and solve the blind selection problem. Index Terms - adaptive Relief algorithm, feature selection, image recognition, GLCM.

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 call

Disclaimer: 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.