IEEE Geoscience and Remote Sensing Letters · 2023 · 31 citations · 19 references
ComputingEarth SciencesGeoinformaticsBuilding StructuresFacade EngineeringRemote SensingFacade GeometryImage SegmentationPoint Cloud ProcessingRadar Signal Processing3D Building SegmentationBuilding ExtractionBuilding FacadesBuilding MorphologyBuilt-up Area ExtractionClusteringPoint Cloud SegmentationSynthetic Aperture Radar Image Analysis
Tomographic Synthetic Aperture Radar (TomoSAR) has three-dimensional imaging capability. Never- theless, its building structure is full of considerable noise and wrong targets owing to the baseline distribution and the algorithm restrictions. Accordingly, efficiently extracting and segmenting buildings from SAR point clouds with huge data is a critical issue. According to the characteristics of building facade point clouds, the KD-Tree-based Euclidean clustering is introduced as a fast-clustering method for better extracting and segmenting individual building facades. At first, a simple morphological filter (SMRF) is utilized to identify the ground and non-ground point clouds. The building facades are then extracted from the non-ground point clouds based on density information. Subsequently, the KD-Tree-based Euclidean clustering method denoises the building facades and segments them into individual facades. Finally, a second Euclidean clustering is performed for each of these facades to denoise them again. Experimental results indicate that the presented approach can prepare accurate and efficient extraction and segmentation results for complex urban scenes.
19
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
Marius Muja, David Lowe · 2009 · 2.6K citations · Full text
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Sunil Arya, David M. Mount, Nathan S. Netanyahu et al. · Journal of the ACM · 1998 · 2.3K citations · Full text
Optimised KD-trees for fast image descriptor matching
Chanop Silpa-Anan, Richard Hartley · 2008 · 678 citations