Author :
Forchhammer, Søren ; Kim, Chul E.
Author_Institution :
Inst. of Telecommun., Tech. Univ. of Denmark, Lyngby, Denmark
Abstract :
Digital squares are defined and their geometric properties characterized. A linear time algorithm is presented that considers a convex digital region and determines whether or not it is a digital square. The algorithm also determines the range of the values of the parameter set of its preimages. The analysis involves transforming the boundary of a digital region into parameter space of slope and y-intercept
Keywords :
computational complexity; computerised pattern recognition; computerised picture processing; transforms; computerised pattern recognition; convex digital region; coordinate transformation; digital square; geometric properties; linear time algorithm; parameter space; parameter transformation; picture processing; slope; y-intercept;
Conference_Titel :
Pattern Recognition, 1988., 9th International Conference on
Conference_Location :
Rome
Print_ISBN :
0-8186-0878-1
DOI :
10.1109/ICPR.1988.28324
