Graph-Based Representations in Pattern Recognition
From MaRDI portal
Publication:5316446
DOI10.1007/b107037zbMath1119.68522OpenAlexW4255834217MaRDI QIDQ5316446
Publication date: 13 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b107037
SegmentationGraphHypergraphImage ProcessingEdge DetectionImage ModelNeighborhood HypergraphNoise Cancellation
Computing methodologies for image processing (68U10) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)
Related Items (8)
Morphological filtering on hypergraphs ⋮ A reductive approach to hypergraph clustering: an application to image segmentation ⋮ Applying a hypergraph to determine the structure of some finite modules ⋮ Unimodular hypergraph for DNA sequencing: a polynomial time algorithm ⋮ Computing the \(p\)-spectral radii of uniform hypergraphs with applications ⋮ Interactive image segmentation using probabilistic hypergraphs ⋮ Exact recovery in the hypergraph stochastic block model: a spectral algorithm ⋮ Watersheds on Hypergraphs for Data Clustering
This page was built for publication: Graph-Based Representations in Pattern Recognition