|Authors:||Žunić, Joviša||Title:||A characterization of discretized polygonal convex regions by discrete moments||Journal:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||Volume:||2905||First page:||529||Last page:||536||Issue Date:||1-Dec-2003||Rank:||M22||ISBN:||978-3-540-20590-6||ISSN:||0302-9743||DOI:||10.1007/978-3-540-24586-5_65||Abstract:||
For a given planar region P its discretization on a discrete planar point set S consists of the points from S which fall into P. If P is bounded with a convex polygon having n vertices and the number of points from P ∩ S is finite, the obtained discretization of P will be called discrete convex n-gon. In this paper we show that discrete moments having the order up to n characterize uniquely the corresponding discrete convex n-gon if the discretizing set S is fixed. In this way, as an example, the matching of discrete convex n-gons can be done by comparing 1/2 · (n + 1) · (n + 2) discrete moments what can be much efficient than the comparison "point-by-point" since a digital convex n-gon can consist of an arbitrary large number of points.
|Keywords:||Coding | Discrete shape | Moments | Pattern matching||Publisher:||Springer Link|
Show full item record
checked on Oct 2, 2022
checked on Oct 1, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.