Discrete Geometry for Computer Imagery

DOI10.1007/b135490zbMath1118.68705OpenAlexW4232609270MaRDI QIDQ5316532

Anne Vialard, François de Vieilleville, Jacques-Olivier Lachaud

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/b135490

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (13)

Sparse convolution-based digital derivatives, fast estimation for noisy signals and approximation results ⋮ Curvature estimation along noisy digital contours by approximate global optimization ⋮ Adaptive and optimal difference operators in image processing ⋮ Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators ⋮ Analysis of noisy digital contours with adaptive tangential cover ⋮ Tangential cover for 3D irregular noisy digital curves ⋮ Convergence of binomial-based derivative estimation for \(C^{2}\) noisy discretized curves ⋮ A trend-based segmentation method and the support vector regression for financial time series forecasting ⋮ Feature controlled adaptive difference operators ⋮ Binomial Convolutions and Derivatives Estimation from Noisy Discretizations ⋮ Optimal Difference Operator Selection ⋮ Digitization scheme that assures faithful reconstruction of plane figures ⋮ Convergence of Binomial-Based Derivative Estimation for C 2 Noisy Discretized Curves

This page was built for publication: Discrete Geometry for Computer Imagery