Binary Partition Trees-Based Spectral-Spatial Permutation Ordering

DOI10.1007/978-3-319-18720-4_37zbMath1445.68268OpenAlexW2281572315MaRDI QIDQ2946831

Miguel A. Veganzones, Guillaume Tochon, Mauro Dalla~Mura, Jocelyn Chanussot

Publication date: 18 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18720-4_37

zbMATH Keywords

permutationsorderinglattice theorymathematical morphologybinary partition treesspectral spatial analysis

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Complete lattices, completions (06B23)

Related Items (1)

Mathematical morphology based on stochastic permutation orderings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Why mathematical morphology needs complete lattices
• Decomposition of mappings between complete lattices by mathematical morphology. I: General lattices
• A comparative study on multivariate mathematical morphology
• Lattice Theory: Foundation
• Hyperspectral Image Segmentation Using a New Spectral Unmixing-Based Binary Partition Tree Representation
• Region Merging Techniques Using Information Theory Statistical Measures
• Supervised Ordering in ${\rm I}\!{\rm R}^p$: Application to Morphological Processing of Hyperspectral Images
• Hyperspectral Image Representation and Processing With Binary Partition Trees

This page was built for publication: Binary Partition Trees-Based Spectral-Spatial Permutation Ordering