Abstract

AbstractRecently, we have proposed a novel approach of texture analysis that has overcome most of the state-of-art methods. This method considers independent walkers, with a given memory, leaving from each pixel of an image. Each walker moves to one of its neighboring pixels according to the difference of intensity between these pixels, avoiding returning to recent visited pixels. Each generated trajectory, after a transient time, ends in a cycle of pixels (attractor) from where the walker cannot escape. The transient time (t) and cycle period (p) form a joint probability distribution, which contains image pixel organization characteristics. Here, we have generalized the texture based on the deterministic partially self avoiding walk to analyze and classify colored textures. The proposed method is confronted with other methods, and we show that it overcomes them in color texture classification.Keywordspartially self-avoiding deterministic walkstexture analysiscolor images

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.