loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'01) - Volume 2
Contextual Classification by Entropy-Based Polygonization
Kauai, Hawaii
December 08-December 14
ISBN: 0-7695-1272-0
L. Hermes, Rheinische Friedrich-Wilhelms-Universit?t Bonn
J. M. Buhmann, Rheinische Friedrich-Wilhelms-Universit?t Bonn
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. In this contribution, we 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.
Citation:
L. Hermes, J. M. Buhmann, "Contextual Classification by Entropy-Based Polygonization," cvpr, vol. 2, pp.442, 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'01) - Volume 2, 2001
Usage of this product signifies your acceptance of the Terms of Use.