Contextual Classification by Entropy-Based Polygonization
Abstract
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.
Cite
Text
Hermes and Buhmann. "Contextual Classification by Entropy-Based Polygonization." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2001. doi:10.1109/CVPR.2001.990995Markdown
[Hermes and Buhmann. "Contextual Classification by Entropy-Based Polygonization." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2001.](https://mlanthology.org/cvpr/2001/hermes2001cvpr-contextual/) doi:10.1109/CVPR.2001.990995BibTeX
@inproceedings{hermes2001cvpr-contextual,
title = {{Contextual Classification by Entropy-Based Polygonization}},
author = {Hermes, Lothar and Buhmann, Joachim M.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2001},
pages = {II:442-447},
doi = {10.1109/CVPR.2001.990995},
url = {https://mlanthology.org/cvpr/2001/hermes2001cvpr-contextual/}
}