Hyperspectral data processing. Algorithm design and analysis
DOI10.1002/9781118269787zbMATH Open1272.94002OpenAlexW3195212285MaRDI QIDQ4912975FDOQ4912975
Authors: Chein-I Chang 
Publication date: 2 April 2013
Full work available at URL: https://doi.org/10.1002/9781118269787
Recommendations
- An introduction to hyperspectral image data modeling
- On endmember identification in hyperspectral images without pure pixels: a comparison of algorithms
- Efficient detection in hyperspectral imagery
- Parametric target detection algorithm based on ISLIM for hyperspectral imaging
- Spectral mixture analysis: Linear and semi-parametric full and iterated partial unmixing in multi- and hyperspectral image data
pattern classificationhyperspectral datahyperspectral imagereceiver operating characteristictarget classificationmultispectral datahyperspectral signal processing
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cited In (21)
- Real-time progressive hyperspectral image processing. Endmember finding and anomaly detection
- Hyperspectral unmixing by the alternating direction method of multipliers
- Simulation of hyperspectral earth imaging data
- A comparative analysis of kernel subspace target detectors for hyperspectral imagery
- Statistical analysis of hyper-spectral data: a non-Gaussian approach
- Quantization of hyperspectral image manifold using probabilistic distances
- Title not available (Why is that?)
- Spectral derivative feature coding for hyperspectral signature analysis
- Parametric target detection algorithm based on ISLIM for hyperspectral imaging
- Hypercomplex models of multichannel images
- An information-theoretic approach to spectral variability, similarity, and discrimination for hyperspectral image analysis
- Efficient detection in hyperspectral imagery
- On endmember identification in hyperspectral images without pure pixels: a comparison of algorithms
- An introduction to hyperspectral image data modeling
- Construction of fast and robust N-FINDR algorithm
- Plugin procedure in segmentation and application to hyperspectral image segmentation
- Dimensionality reduction of hyperspectral imagery data for feature classification
- Ordering on the probability simplex of endmembers for hyperspectral morphological image processing
- Harnessing inequality
- Hyperspectral Image Analysis
- Template matching via \(l_1\) minimization and its application to hyperspectral data
Uses Software
This page was built for publication: Hyperspectral data processing. Algorithm design and analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4912975)
