Reeb graphs through local binary patterns

DOI10.1007/978-3-319-18224-7_6MaRDI QIDQ3300149zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

critical pointsimage segmentationlocal binary patternslocal featuresReeb graphsshape representation

Mathematics Subject Classification ID

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

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

Cites work

• Computer Vision - ECCV 2004
• Efficient algorithms for computing Reeb graphs
• scientific article; zbMATH DE number 1744986 (Why is no real title available?)
• Lectures on Morse theory, old and new
• Medial Axis Transformation of a Planar Shape
• Numerical Geometry of Non-Rigid Shapes
• Reeb graphs for shape analysis and applications

Cited in

(6)

• Shape understanding by contour-driven retiling
• Reeb graph based segmentation of articulated components of 3D digital objects
• Robust computations of Reeb graphs in 2-D binary images
• scientific article; zbMATH DE number 2079726 (Why is no real title available?)
• 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)