Convolution-based interpolation for fast, high-quality rotation of images

This paper focuses on the design of fast algorithms for rotating images and preserving high quality. The basis for the approach is a decomposition of a rotation into a sequence of one-dimensional translations. As the accuracy of these operations is critical, we introduce a general theoretical framew...

Description complète

Détails bibliographiques
Publié dans:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 4(1995), 10 vom: 15., Seite 1371-81
Auteur principal: Unser, M (Auteur)
Autres auteurs: Thevenaz, P, Yaroslavsky, L
Format: Article
Langue:English
Publié: 1995
Accès à la collection:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Sujets:Journal Article
LEADER 01000caa a22002652 4500
001 NLM177782366
003 DE-627
005 20250209061715.0
007 tu
008 231223s1995 xx ||||| 00| ||eng c
028 5 2 |a pubmed25n0593.xml 
035 |a (DE-627)NLM177782366 
035 |a (NLM)18291969 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Unser, M  |e verfasserin  |4 aut 
245 1 0 |a Convolution-based interpolation for fast, high-quality rotation of images 
264 1 |c 1995 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 02.10.2012 
500 |a Date Revised 22.02.2008 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a This paper focuses on the design of fast algorithms for rotating images and preserving high quality. The basis for the approach is a decomposition of a rotation into a sequence of one-dimensional translations. As the accuracy of these operations is critical, we introduce a general theoretical framework that addresses their design and performance. We also investigate the issue of optimality and present an improved least-square formulation of the problem. This approach leads to a separable three-pass implementation of a rotation using one-dimensional convolutions only. We provide explicit filter formulas for several continuous signal models including spline and bandlimited representations. Finally, we present rotation experiments and compare the currently standard techniques with the various versions of our algorithm. Our results indicate that the present algorithm in its higher-order versions outperforms all standard high-accuracy methods of which we are aware, both in terms of speed and quality. Its computational complexity increases linearly with the order of accuracy. The best-quality results are obtained with the sine-based algorithm, which can be implemented using simple one-dimensional FFTs 
650 4 |a Journal Article 
700 1 |a Thevenaz, P  |e verfasserin  |4 aut 
700 1 |a Yaroslavsky, L  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 4(1995), 10 vom: 15., Seite 1371-81  |w (DE-627)NLM09821456X  |x 1057-7149  |7 nnns 
773 1 8 |g volume:4  |g year:1995  |g number:10  |g day:15  |g pages:1371-81 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 4  |j 1995  |e 10  |b 15  |h 1371-81