โ Scribed by Carlo Braccini; Giuseppe Marino
No coin nor oath required. For personal study only.
An algorithm is presented for the implementation of fast geometrical manipulations of digital images, It is based on an extension to pictorial images of digital straight-line representation and it requires only simple and fast integer arithmetic operations (such as add and compare). The algorithm can perform rotations, scale changes, and the full affine transformation. Moreover, a particular nonlinear mapping based on an extension of the affine transformation is presented, along with some processing examples.
๐ SIMILAR VOLUMES
## Abstract The algorithms of affine, bilinear, projective, polynomial, and piecewise polynomial transformations of the raster image are suggested. Application of various iterative procedures allows us to reduce considerably the execution time of these transformations in comparison with the program
This paper proposes a new image watermarking scheme which is robust to RST attacks with cropping by improving Fourier-Mellin transform based watermarking (FMW). The proposed scheme reorders and modifies function blocks of FMW for improvement of realization and performance. Unlike FMW, our method use
A fast algorithm for identifying clusters of intense pixels in digitized two-dimensional images is described. Measurements show a decrease by several orders of magnitude over times required by an algorithm by Stoddard.