To improve the performance of pixel-wise classification results for remotely sensed imagery, several contextual classification schemes have been proposed that aim at avoiding classification noise by local averaging. These algorithms, however, bear the serious disadvantage of smoothing the segment boundaries and producing rounded segments that hardly match the true shapes. The authors present a novel contextual classification algorithm that overcomes these shortcomings. Using a hierarchical approach for generating a triangular mesh, it decomposes the image into a set of polygons that, in our application, represent individual land-cover types. Compared to classical contextual classification approaches, this method has the advantage of generating output that matches the intuitively expected type of segmentation. Besides, it achieves excellent classification results.
Contextual classification by entropy-based polygonization
01.01.2001
863602 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Contextual Classification by Entropy-Based Polygonization
British Library Conference Proceedings | 2001
|Wheel flat can cause or exacerbate wheel polygonization
Taylor & Francis Verlag | 2020
|Dominant point detection by reverse polygonization of digital curves
British Library Online Contents | 2008
|Direct and Robust Voxelization and Polygonization of Free-Form CSG Solids
British Library Conference Proceedings | 2002
|Spatial Entropy: A Tool for Controlling Contextual Classification Convergence
British Library Conference Proceedings | 1994
|