|
Title:
|
Optimum graph cuts for pruning binary partition trees of polarimetric SAR images
|
|
Author:
|
Salembier Clairon, Philippe Jean; Foucher, Samuel
|
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions; Universitat Politècnica de Catalunya. GPI - Grup de Processament d'Imatge i Vídeo |
|
Abstract:
|
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. |
|
Abstract:
|
Peer Reviewed |
|
Subject(s):
|
-Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Radiocomunicació i exploració electromagnètica::Teledetecció
-Remote sensing
-Binary partition tree (BPT)
-Graph cut
-Polarimetric synthetic aperture radar (SAR) (PolSAR) image processing
-Precision and recall for boundaries
-Segmentation
-Speckle noise
-Tree pruning
-Teledetecció |
|
Rights:
|
|
|
Document type:
|
Article - Submitted version
Article |
|
Published by:
|
Institute of Electrical and Electronics Engineers (IEEE)
|
|
Share:
|
|
