ArticleSensors (Basel, Switzerland)2020
Efficient Unsupervised Classification of Hyperspectral Images Using Voronoi Diagrams and Strong Patterns.
Article in Sensors (Basel, Switzerland), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
Abstract
Hyperspectral images (HSIs) are a powerful tool to classify the elements from an area of interest by their spectral signature. In this paper, we propose an efficient method to classify hyperspectral data using Voronoi diagrams and strong patterns in the absence of ground truth. HSI processing consumes a great deal of computing resources because HSIs are represented by large amounts of data. We propose a heuristic method that starts by applying Parafac decomposition for reduction and to construct the abundances matrix. Furthermore, the representative nodes from the abundances map are searched for. A multi-partition of these nodes is found, and based on this, strong patterns are obtained. Then, based on the hierarchical clustering of strong patterns, an optimum partition is found. After strong patterns are labeled, we construct the Voronoi diagram to extend the classification to the entire HSI.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.