Abstract

A critical shortcoming of determining texture features derived from grey-level co-occurrence matrices (GLCM's) is the excessive computational burden. This paper describes the implementation of a linked-list algorithm to determine co-occurrence texture features far more efficiently. Behavior of common co-occurrence texture features across difference grey-level quantizations is investigated.

Full Text
Paper version not known

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.