Binary partition trees-based spectral-spatial permutation ordering
From MaRDI portal
Recommendations
Cites work
- A comparative study on multivariate mathematical morphology
- Decomposition of mappings between complete lattices by mathematical morphology. I: General lattices
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 1318029 (Why is no real title available?)
- Hyperspectral Image Representation and Processing With Binary Partition Trees
- Hyperspectral Image Segmentation Using a New Spectral Unmixing-Based Binary Partition Tree Representation
- Lattice Theory: Foundation
- Mathematical morphology.
- Region Merging Techniques Using Information Theory Statistical Measures
- Supervised Ordering in ${\rm I}\!{\rm R}^p$: Application to Morphological Processing of Hyperspectral Images
- Why mathematical morphology needs complete lattices
Cited in
(5)- Mathematical morphology based on stochastic permutation orderings
- Approaches to multivalued mathematical morphology based on uncertain reduced orderings
- Spectral ordering assessment using spectral median filters
- scientific article; zbMATH DE number 1254460 (Why is no real title available?)
- Computing multivalued mathematical morphology on multiband images using algorithms for multicriteria analysis
This page was built for publication: Binary partition trees-based spectral-spatial permutation ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946831)