Optimum graph cuts for pruning binary partition trees of polarimetric SAR images
Tipo de documentoArtículo
Fecha de publicación2016-09-01
EditorInstitute of Electrical and Electronics Engineers (IEEE)
Condiciones de accesoAcceso abierto
This paper investigates several optimum graph-cut techniques for pruning binary partition trees (BPTs) and their usefulness for the low-level processing of polarimetric synthetic aperture radar (PolSAR) images. BPTs group pixels to form homogeneous regions, which are hierarchically structured by inclusion in a binary tree. They provide multiple resolutions of description and easy access to subsets of regions. Once constructed, BPTs can be used for a large number of applications. Many of these applications consist in populating the tree with a specific feature and in applying a graph cut called pruning to extract a partition of the space. In this paper, different pruning examples involving the optimization of a global criterion are discussed and analyzed in the context of PolSAR images for segmentation. Through the objective evaluation of the resulting partitions by means of precision-and-recall-for-boundaries curves, the best pruning technique is identified, and the influence of the tree construction on the performances is assessed.
CitaciónSalembier, P., Foucher, S. Optimum graph cuts for pruning binary partition trees of polarimetric SAR images. "IEEE transactions on geoscience and remote sensing", 1 Setembre 2016, vol. 54, núm. 9, p. 5493-5502.
Versión del editorhttp://ieeexplore.ieee.org/document/7480960/