Abstract | ||
---|---|---|
This paper discusses the interest of Binary Partition Trees (BPTs) and the usefulness of graph cuts for low-level processing of PolSAR images. BPTs group pixels to form homogeneous regions, which are hierarchically structured by inclusion in a tree. They provide multiple resolutions of description and easy access to subsets of regions. Once constructed, BPTs can be used for many applications including filtering, segmentation, classification and object detection. Many processing strategies consist in populating the tree with a specific feature and in applying a graph-cut called pruning. Different graph-cuts are discussed and analyzed in the context of PolSAR images for speckle filtering and segmentation. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1109/IGARSS.2014.6946602 | Geoscience and Remote Sensing Symposium |
Keywords | Field | DocType |
geophysical image processing,image classification,image segmentation,radar imaging,radar polarimetry,remote sensing by radar,synthetic aperture radar,trees (mathematics),binary partition trees,graph cuts,image classification,image segmentation,low level PolSAR image processing,object detection,pruning,speckle filtering,Binary Partition Tree,PolSAR,graph-cut,segmentation,speckle noise | Cut,Computer vision,Object detection,Pattern recognition,Speckle pattern,Computer science,Segmentation,Filter (signal processing),Image segmentation,Pixel,Artificial intelligence,Speckle noise | Conference |
ISSN | Citations | PageRank |
2153-6996 | 4 | 0.44 |
References | Authors | |
10 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Philippe Salembier | 1 | 40 | 1.82 |
Samuel Foucher | 2 | 4 | 0.77 |
Carlos López-Martínez | 3 | 294 | 24.70 |