Reeb graphs through local binary patterns

DOI10.1007/978-3-319-18224-7_6zbMATH Open1437.68161OpenAlexW946321104MaRDI QIDQ3300149FDOQ3300149

Authors: Ines Janusch, Walter G. Kropatsch 

Publication date: 27 July 2020

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18224-7_6

Recommendations

• Robust computations of Reeb graphs in 2-D binary images
• Reeb graphs for shape analysis and applications
• Reeb graphs of piecewise linear functions
• Reeb graphs: approximation and persistence
• Reeb graphs, approximation and persistence

zbMATH Keywords

image segmentationcritical pointsshape representationlocal binary patternslocal featuresReeb graphs

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Persistent homology and applications, topological data analysis (55N31) Computing methodologies for image processing (68U10) Relations of low-dimensional topology with graph theory (57M15)

Cites Work

• Efficient algorithms for computing Reeb graphs
• Computer Vision - ECCV 2004
• Medial Axis Transformation of a Planar Shape
• Reeb graphs for shape analysis and applications
• Lectures on Morse theory, old and new
• Numerical Geometry of Non-Rigid Shapes
• Title not available (Why is that?)

Cited In (6)

• Reeb graph based segmentation of articulated components of 3D digital objects
• Shape understanding by contour-driven retiling
• Robust computations of Reeb graphs in 2-D binary images
• Title not available (Why is that?)
• On the space between critical points
• Shape classification according to LBP persistence of critical points

This page was built for publication: Reeb graphs through local binary patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300149)