Estimation of discrete curvature based on chain-code pairing and digital straightness

Authors:
Shyamosree Pal;Partha Bhowmick
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India;Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India
Venue:
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Year:
2009

Citing 7
Cited 0

On the Detection of Dominant Points on Digital Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital curvature estimation

CVGIP: Image Understanding
Digital Geometry: Geometric Methods for Digital Picture Analysis

Digital Geometry: Geometric Methods for Digital Picture Analysis
Apparent ridges for line drawing

ACM SIGGRAPH 2007 papers
Algebraic point set surfaces

ACM SIGGRAPH 2007 papers
Digital Straight Line Segments

IEEE Transactions on Computers
Curvature-based stroke rendering

The Visual Computer: International Journal of Computer Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Estimation of discrete curvature is a challenging problem, since a mere replacement of functional derivatives by numerical differences fails to produce the desired result. Several algorithms have been proposed so far, which are mostly based on the concepts of real geometry and hence are computationally expensive. The existing measure of k-curvature, though easy to compute, is crippled with some unwanted syndromes arising out of improper consideration of chain codes. Hence, an improved algorithm for estimating k-curvature is proposed, which is marked by its inherent simplicity and computational attractiveness, and produces the expected estimate, whether the concerned point has an extreme (high or low) curvature or the concerned segment has a constant or changing curvature. Examples and experimental results demonstrate the fitness and effectiveness of the proposed technique for digital curves of arbitrary shapes.