Search NASA⌕ Search

SEARCH · Search NASA

Results for “unsupervised segmentation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Unsupervised Segmentation Of Polarimetric SAR Data

Method of unsupervised segmentation of polarimetric synthetic-aperture-radar (SAR) image data into classes involves selection of classes on basis of multidimensional fuzzy clustering of logarithms of parameters of polarimetric covariance matrix. Data in each class represent parts of image wherein polarimetric SAR backscattering characteristics of terrain regarded as homogeneous. Desirable to have each class represent type of terrain, sea ice, or ocean surface distinguishable from other types via backscattering characteristics. Unsupervised classification does not require training areas, is nearly automated computerized process, and provides nonsubjective selection of image classes naturally well separated by radar.

Rignot, Eric J.↗
NASA NTRS1992

Unsupervised segmentation of polarimetric SAR data using the covariance matrix

A method for unsupervised segmentation of polarimetric synthetic aperture radar (SAR) data into classes of homogeneous microwave polarimetric backscatter characteristics is presented. Classes of polarimetric backscatter are selected on the basis of a multidimensional fuzzy clustering of the logarithm of the parameters composing the polarimetric covariance matrix. The clustering procedure uses both polarimetric amplitude and phase information, is adapted to the presence of image speckle, and does not require an arbitrary weighting of the different polarimetric channels; it also provides a partitioning of each data sample used for clustering into multiple clusters. Given the classes of polarimetric backscatter, the entire image is classified using a maximum a posteriori polarimetric classifier. Four-look polarimetric SAR complex data of lava flows and of sea ice acquired by the NASA/JPL airborne polarimetric radar (AIRSAR) are segmented using this technique. The results are discussed and compared with those obtained using supervised techniques.

Rignot, Eric J. M.↗
NASA NTRS1991

Unsupervised segmentation of polarimetric SAR data using the covariance matrix

An unsupervised selection of polarimetric features useful for the segmentation and analysis of polarimetric synthetic aperture radar (SAR) data is presented. The technique is based on multidimensional clustering of the parameters composing the polarimetric covariance matrix of the data. Clustering is performed on the logarithm of these quantities. Once the polarimetric cluster centers have been determined, segmentation of the polarimetric data into regions is performed using a maximum likelihood polarimetric classifier. Segmentation maps are further improved using a Markov random field to describe the statistics of the regions and computing the maximum of the product of the local conditional densities. Examples with real polarimetric SAR imagery are given to illustrate the potential of this method.

Rignot, Eric↗
DOE OSTI2026

Unsupervised Segmentation and Clustering Workflow for Efficient Processing of 4D-STEM and 5D-STEM Data

Four-dimensional scanning transmission electron microscopy (4D-STEM) enables mapping of diffraction information with nanometer-scale spatial resolution, offering detailed insight into local structure, orientation, and strain. However, as data dimensionality and sampling density increase, particularly for in situ scanning diffraction experiments (5D-STEM), robust segmentation of structurally consistent behavior across sequential measurements becomes essential for efficient and physically meaningful analysis. Here, we introduce a clustering framework that identifies crystallographically distinct domains from 4D-STEM datasets. By using local diffraction-pattern similarity as a metric, the method extracts closed contours delineating spatially contiguous regions. This approach produces cluster-averaged diffraction patterns that improve signal quality while reducing data volume by orders of magnitude, enabling rapid and accurate orientation, phase, and strain mapping. We demonstrate the applicability of this approach to in situ liquid-cell 4D-STEM data of gold nanoparticle growth. Our method provides a scalable and generalizable route for spatially coherent segmentation, data compression, and quantitative structure–strain mapping across diverse 4D-STEM modalities. The full analysis code and example workflows are publicly available to support reproducibility and reuse.

4D-STEM↗
NASA NTRS2013

Metric Learning to Enhance Hyperspectral Image Segmentation

Unsupervised hyperspectral image segmentation can reveal spatial trends that show the physical structure of the scene to an analyst. They highlight borders and reveal areas of homogeneity and change. Segmentations are independently helpful for object recognition, and assist with automated production of symbolic maps. Additionally, a good segmentation can dramatically reduce the number of effective spectra in an image, enabling analyses that would otherwise be computationally prohibitive. Specifically, using an over-segmentation of the image instead of individual pixels can reduce noise and potentially improve the results of statistical post-analysis. In this innovation, a metric learning approach is presented to improve the performance of unsupervised hyperspectral image segmentation. The prototype demonstrations attempt a superpixel segmentation in which the image is conservatively over-segmented; that is, the single surface features may be split into multiple segments, but each individual segment, or superpixel, is ensured to have homogenous mineralogy.

Thompson, David R.↗
NASA NTRS2008

Parallel Implementation of the Recursive Approximation of an Unsupervised Hierarchical Segmentation Algorithm

The hierarchical image segmentation algorithm (referred to as HSEG) is a hybrid of hierarchical step-wise optimization (HSWO) and constrained spectral clustering that produces a hierarchical set of image segmentations. HSWO is an iterative approach to region grooving segmentation in which the optimal image segmentation is found at N(sub R) regions, given a segmentation at N(sub R+1) regions. HSEG's addition of constrained spectral clustering makes it a computationally intensive algorithm, for all but, the smallest of images. To counteract this, a computationally efficient recursive approximation of HSEG (called RHSEG) has been devised. Further improvements in processing speed are obtained through a parallel implementation of RHSEG. This chapter describes this parallel implementation and demonstrates its computational efficiency on a Landsat Thematic Mapper test scene.

Tilton, James C.↗
NASA NTRS1992

A comparison of neural network and fuzzy clustering techniques in segmenting magnetic resonance images of the brain

Magnetic resonance (MR) brain section images are segmented and then synthetically colored to give visual representations of the original data with three approaches: the literal and approximate fuzzy c-means unsupervised clustering algorithms and a supervised computational neural network, a dynamic multilayered perception trained with the cascade correlation learning algorithm. Initial clinical results are presented on both normal volunteers and selected patients with brain tumors surrounded by edema. Supervised and unsupervised segmentation techniques provide broadly similar results. Unsupervised fuzzy algorithms were visually observed to show better segmentation when compared with raw image data for volunteer studies. However, for a more complex segmentation problem with tumor/edema or cerebrospinal fluid boundary, where the tissues have similar MR relaxation behavior, inconsistency in rating among experts was observed.

Hall, Lawrence O.↗
DOE OSTI2018

Ambient occlusion – A powerful algorithm to segment shell and skeletal intrapores in computed tomography data

During the last decades, X-ray (micro-)computed tomography has gained increasing attention for the description of porous skeletal and shell structures of various organism groups. However, their quantitative analysis is often hampered by the difficulty to discriminate cavities and pores within the object from the surrounding region.Herein, we test the ambient occlusion (AO) algorithm and newly implemented optimisations for the segmentation of cavities (implemented in the software Amira). The segmentation accuracy is evaluated as a function of (i) changes in the ray length input variable, and (ii) the usage of AO (scalar) field and other AO-derived (scalar) fields. The results clearly indicate that the AO field itself outperforms all other AO-derived fields in terms of segmentation accuracy and robustness against variations in the ray length input variable. The newly implemented optimisations improved the AO field-based segmentation only slightly, while the segmentations based on the AO-derived fields improved considerably.Additionally, we evaluated the potential of the AO field and AO-derived fields for the separation and classification of cavities as well as skeletal structures by comparing them with commonly used distance-map-based segmentations. For this, we tested the zooid separation within a bryozoan colony, the stereom classification of an ophiuroid tooth, the separation of bioerosion traces within a marble block and the calice (central cavity)-pore separation within a dendrophyllid coral. The obtained results clearly indicate that the ideal input field depends on the three-dimensional morphology of the object of interest The segmentations based on the AO-derived fields often provided cavity separations and skeleton classifications that at were superior to or impossible to obtain with commonly used distance-map-based segmentations. The combined usage of various AO-derived fields by supervisd or unsupervised segmentation algorithms might provide a promising target for future research to further improve the results for this kind of high-end data segmentation and classification. Furthermore, the application of the developed segmentation algorithm is not restricted to X-ray (micro-)computed tomographic data but may potentially be useful for the segmentation of 3D volume data from other sources.

Computed tomography, Micro-computed tomography, Po↗
NASA NTRS2000

Bayesian Fusion of Color and Texture Segmentations

In many applications one would like to use information from both color and texture features in order to segment an image. We propose a novel technique to combine "soft" segmentations computed for two or more features independently. Our algorithm merges models according to a mean entropy criterion, and allows to choose the appropriate number of classes for the final grouping. This technique also allows to improve the quality of supervised classification based on one feature (e.g. color) by merging information from unsupervised segmentation based on another feature (e.g., texture.)

Manduchi, Roberto↗
DOE OSTI2024

GraphEM

An unsupervised segmentation method for structural analysis of Scanning Transmission Electron Microscopy (STEM) images

Pope, Jenna↗
NASA NTRS1994

Unsupervised texture image segmentation by improved neural network ART2

We here propose a segmentation algorithm of texture image for a computer vision system on a space robot. An improved adaptive resonance theory (ART2) for analog input patterns is adapted to classify the image based on a set of texture image features extracted by a fast spatial gray level dependence method (SGLDM). The nonlinear thresholding functions in input layer of the neural network have been constructed by two parts: firstly, to reduce the effects of image noises on the features, a set of sigmoid functions is chosen depending on the types of the feature; secondly, to enhance the contrast of the features, we adopt fuzzy mapping functions. The cluster number in output layer can be increased by an autogrowing mechanism constantly when a new pattern happens. Experimental results and original or segmented pictures are shown, including the comparison between this approach and K-means algorithm. The system written in C language is performed on a SUN-4/330 sparc-station with an image board IT-150 and a CCD camera.

Wang, Zhiling↗
NASA NTRS2011

Metric Learning for Hyperspectral Image Segmentation

We present a metric learning approach to improve the performance of unsupervised hyperspectral image segmentation. Unsupervised spatial segmentation can assist both user visualization and automatic recognition of surface features. Analysts can use spatially-continuous segments to decrease noise levels and/or localize feature boundaries. However, existing segmentation methods use tasks-agnostic measures of similarity. Here we learn task-specific similarity measures from training data, improving segment fidelity to classes of interest. Multiclass Linear Discriminate Analysis produces a linear transform that optimally separates a labeled set of training classes. The defines a distance metric that generalized to a new scenes, enabling graph-based segmentation that emphasizes key spectral features. We describe tests based on data from the Compact Reconnaissance Imaging Spectrometer (CRISM) in which learned metrics improve segment homogeneity with respect to mineralogical classes.

Compact Reconnaissance Imaging Spectrometer (CRISM↗
DOE OSTI2023

Application of unsupervised deep learning to image segmentation and in-situ contact angle measurements in a CO 2 -water-rock system

Rock surface wettability is a critical property that regulates multiphase flows in porous media, which can be quantified using the surface contact angle (CA). X-ray micro-computed tomography (μCT) provides an effective approach to in-situ measurements of surface CAs. However, the CA measurement accuracy depends significantly on the quality of CT image segmentation, which is the clustering of CT pixels into separate phases. Inspired by this, we developed a deep learning (DL)-based CA measurement workflow. Motivated by the recent tremendous progress in unsupervised learning techniques and aiming to avoid expensive manual data annotations, an unsupervised DL pipeline for CT image segmentation was proposed and implemented, which includes unsupervised model training and post-processing. The unsupervised model training was driven by a novel loss function constrained with feature similarity and spatial continuity and implemented by iterative forward and backward paths; the former clustered the pixel-wise feature vectors extracted by convolution neural networks, whereas the latter updated the parameters using gradient descent. An over-segmentation strategy was adopted for model training. The post-processing steps based on agglomerative hierarchical clustering (AHC) were implemented to further merge the over-segmented model output to the desired cluster number, which is intended to improve the efficiency of image segmentation. The developed unsupervised DL pipeline was compared with other commonly-used image segmentation methods using pixel-wise and physics-based evaluation metrics on a synthetic raw-image dataset, which had a known ground truth. The unsupervised DL pipeline showed the best performance. Next, the segmented images were input to an automatic CA measurement tool, and the results were validated by comparisons with manual measurements. The CA values from the manual and automatic measurements showed similar distributions and statistical properties. The automatic measurement demonstrated a wider spectrum because of the much larger number of measurement data points. The primary novelty of the unsupervised DL pipeline developed in this study lies in the novel loss function and the over-segmentation strategy associated with AHC post-processing. Finally, the workflow has been proven an efficient tool for pore-scale wettability characterization, which has a wide range of applications in fundamental studies of multiphase flows in natural porous media, which have critical implications to geological carbon sequestration, hydrocarbon energy recovery, and contaminant transport in groundwater.

42 ENGINEERING↗
DOE OSTI2019

Large Scale Unsupervised Domain Adaptation of Segmentation Networks with Adversarial Learning

Most current state-of-the-art methods for semantic segmentation on remote sensing imagery require large labeled data, which is scarcely available. Due to the distribution shifting phenomenon inherent in remote sensing imagery, the reuse of pre-trained models on new areas of interest rarely yield satisfactory results. In this paper, we approach this problem from an adversarial learning perspective toward unsupervised domain adaptation. The core concept is to infuse fully convolutional neural networks and adversarial networks for semantic segmentation assuming the structures in the scene and objects of interest are similar in two set of images. Models are trained on a source dataset where ground truth is available and adapted to new target dataset iteratively via a adversarial loss on unlabeled samples. We use two real large scale datasets to validate the framework: 1) cross city road extraction and 2) cross country building extraction. The preliminary results show the usefulness of considering adversarial learning for indirect re-use of the pre-trained models. Experimental validation suggests significant benefits over models without adaptation.

Deng, Xueqing↗
NASA NTRS2021

A Method for Landsat and Sentinel 2 (HLS) BRDF Normalization

The Harmonized Landsat/Sentinel-2 (HLS) project aims to generate a seamless surface reflectance product by combining observations from USGS/NASA Landsat-8 and ESA Sentinel-2 remote sensing satellites. These satellites’ sampling characteristics provide nearly constant observation geometry and low illumination variation through the scene. However, the illumination variation throughout the year impacts the surface reflectance by producing higher values for low solar zenith angles and lower reflectance for large zenith angles. In this work, we present a model to derive the bidirectional reflectance distribution function (BRDF) normalization and apply it to the HLS product at 30m spatial resolution. It is based on the BRDF parameters estimated from the MODerate Resolution Imaging Spectroradiometer (MODIS) surface reflectance product (M{O,Y}D09) at 1 km spatial resolution using the VJB method (Vermote et al., 2009). Unsupervised classification (segmentation) of HLS images is used to disaggregate the BRDF parameters to the HLS spatial resolution and to build a BRDF parameters database at HLS scale. We first test the proposed BRDF normalization for different solar zenith angles over two homogeneous sites, in particular one desert and one Peruvian Amazon forest. The proposed method reduces both the correlation with the solar zenith angle and the coefficient of variation (CV) of the reflectance time series in the red and near infrared bands to 4% in forest and keeps a low CV of 3% to 4% for the deserts. Additionally, we assess the impact of the view zenith angle (VZA) in an area of the Brazilian Amazon forest close to the equator, where impact of the angular variation is stronger because it occurs in the principal plane. The directional reflectance shows a strong dependency with the VZA. The current HLS BRDF correction reduces this dependency but still shows an under-correction, especially in the near infrared, while the proposed method shows no dependency with the view angles. We also evaluate the BRDF parameters using field surface albedo measurements as a reference over seven different sites of the US surface radiation budget observing network (SURFRAD) and five sites of the Australian OzFlux network.

Belen Franch↗