ENLARGEMENT OR REDUCTION OF DIGITAL IMAGES WITH MINIMUM LOSS OF INFORMATION

Citation
M. Unser et al., ENLARGEMENT OR REDUCTION OF DIGITAL IMAGES WITH MINIMUM LOSS OF INFORMATION, IEEE transactions on image processing, 4(3), 1995, pp. 247-258
Citations number
29
Categorie Soggetti
Engineering, Eletrical & Electronic
ISSN journal
10577149
Volume
4
Issue
3
Year of publication
1995
Pages
247 - 258
Database
ISI
SICI code
1057-7149(1995)4:3<247:EORODI>2.0.ZU;2-A
Abstract
The purpose of this paper is to derive optimal spline algorithms for t he enlargement or reduction of digital images by arbitrary (noninteger ) scaling factors, In our formulation, the original and rescaled signa ls are each represented by an interpolating polynomial spline of degre e n with step size one and Delta, respectively, The change of scale is achieved by determining the spline with step size Delta that provides the closest approximation of the original signal in the L(2)-norm. We show that this approximation can be computed in three steps: i) a dig ital prefilter that provides the B-spline coefficients of the input si gnal, ii) a resampling using an expansion formula with a modified samp ling kernel that depends explicitly on Delta, and iii) a digital postf ilter that maps the result back into the signal domain, We provide exp licit formulas for n = 0, 1, and 3 and propose solutions for the effic ient implementation of these algorithms, We consider image processing examples and show that the present method compares favorably with stan dard interpolation techniques, Finally, we discuss some properties of this approach and its connection with the classical technique of bandl imiting a signal, which provides the asymptotic limit of our algorithm as the order of the spline tends to infinity.