Feature Detection Using Curvature Maps and the Min-cut/Max-flow Algorithm
From MaRDI portal
Publication:5757280
DOI10.1007/11802914_43zbMATH Open1160.68623OpenAlexW1490640608MaRDI QIDQ5757280FDOQ5757280
Authors: Timothy D. Gatzke, Cindy M. Grimm
Publication date: 6 September 2007
Published in: Geometric Modeling and Processing - GMP 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11802914_43
Recommendations
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (6)
- Curve-Like Structure Extraction Using Minimal Path Propagation With Backtracking
- Learning diffusion on global graph: a PDE-directed approach for feature detection on geometric shapes
- A complementary topographic feature detection algorithm based on surface curvature for three-dimensional level-set functions
- Keypoints and local descriptors of scalar functions on 2D manifolds
- Feature extraction of 2-manifold using Delaunay triangulation
- Automatic extraction of generic focal features on 3D shapes via random forest regression analysis of geodesics-in-heat
This page was built for publication: Feature Detection Using Curvature Maps and the Min-cut/Max-flow Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757280)