DocumentCode
3378487
Title
Discrete invertible affine transformations
Author
Shizawa, Masahiko
Author_Institution
NTT Corp., Yokosuka, Japan
Volume
ii
fYear
1990
fDate
16-21 Jun 1990
Firstpage
134
Abstract
The theory and algorithm of a general method that constructs one-to-one mappings on an n -dimensional digital lattice are presented. The mapping is constructed so that any given equivolume affine transformation can be approximated. Equivolume affine transformations include translation, reflection, and skew. It is shown that (n 2-1) fundamental skew transformations, n fundamental translations, and some reflective transformations are sufficient to represent arbitrary equivolume affine transformation. One-to-one integer approximation of the fundamental transformations and approximation error propagation rules are described. Minimum error decomposition algorithms for the equivolume affine transformation in n -dimensional space and two-dimensional space are proposed
Keywords
computational geometry; errors; approximation error propagation rules; computational geometry; discrete invertible affine transformations; equivolume affine transformation; minimum error decomposition algorithms; n-dimensional digital lattice; one-to-one mappings; reflection; skew; translation; two-dimensional space; Computer errors; Computer graphics; Computer vision; Extrapolation; Humans; Image processing; Interpolation; Laboratories; Lattices; Solid modeling;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 1990. Proceedings., 10th International Conference on
Conference_Location
Atlantic City, NJ
Print_ISBN
0-8186-2062-5
Type
conf
DOI
10.1109/ICPR.1990.119343
Filename
119343
Link To Document