The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1990 vol.12)
pp: 671-682
ABSTRACT
<p>New splitting-shooting methods are presented for nonlinear transformations T: ( xi , eta ) to (x,y) where x=x( xi , eta ), y=y( xi , eta ). These transformations are important in computer vision, image processing, pattern recognition, and shape transformations in computer graphics. The methods can eliminate superfluous holes or blanks, leading to better images while requiring only modest computer storage and CPU time. The implementation of the proposed algorithms is simple and straightforward. Moreover, these methods can be extended to images with gray levels, to color images, and to three dimensions. They can also be implemented on parallel computers or VLSI circuits. A theoretical analysis proving the convergence of the algorithms and providing error bounds for the resulting images is presented. The complexity of the algorithms is linear. Graphical and numerical experiments are presented to verify the analytical results and to demonstrate the effectiveness of the methods.</p>
INDEX TERMS
computational complexity; nonlinear transformations; digitized patterns; splitting-shooting methods; computer vision; image processing; pattern recognition; computer graphics; gray levels; error bounds; computational complexity; computer graphics; computerised pattern recognition; computerised picture processing
CITATION
Z.C. Li, C.Y. Suen, Y.Y. Tang, "Splitting-Shooting Methods for Nonlinear Transformations of Digitized Patterns", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.12, no. 7, pp. 671-682, July 1990, doi:10.1109/34.56210
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool