HIERARCHICAL MAXIMUM-ENTROPY PARTITIONING IN TEXTURE IMAGE-ANALYSIS

Citation
Cyc. Bie et al., HIERARCHICAL MAXIMUM-ENTROPY PARTITIONING IN TEXTURE IMAGE-ANALYSIS, Pattern recognition letters, 14(5), 1993, pp. 421-429
Citations number
19
Categorie Soggetti
Computer Sciences, Special Topics","Computer Applications & Cybernetics
Journal title
ISSN journal
01678655
Volume
14
Issue
5
Year of publication
1993
Pages
421 - 429
Database
ISI
SICI code
0167-8655(1993)14:5<421:HMPITI>2.0.ZU;2-4
Abstract
This paper presents an effective texture representation which captures the statistics (or distributions) of structural and/or spatial relati ons of grey levels within certain neighborhood in a texture image. The structural and/or spatial relations are captured by various feature e xtraction operators to generate feature images. Then, the joint distri butions of the features which we termed feature frequency matrices (FF M) provide the statistics and representation of the texture image. A p artitioning scheme to 'compress' the FFM such that only relevant infor mation is retained is proposed. The partitioning scheme is based on th e hierarchical maximum entropy discretization scheme which minimizes t he loss of information. The efficacy of the representation is demonstr ated using homogeneous texture images.