IEICE TRANSACTIONS on Fundamentals
Space-Efficient Algorithm for Image Rotation
Summary :
This paper presents an algorithm for rotating a subimage in place without using any extra working array. Due to this constraint, we have to overwrite pixel values by interpolated values. Key ideas are local reliability test which determines whether interpolation at a pixel is carried out correctly without using interpolated values, and lazy interpolation which stores interpolated values in a region which is never used for output images and then fills in interpolated values after safety is guaranteed. It is shown that linear interpolation is always safely implemented. An extension to cubic interpolation is also discussed.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.9 pp.2341-2348
- Publication Date
- 2008/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e91-a.9.2341
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tetsuo ASANO, Shinnya BITOU, Mitsuo MOTOKI, Nobuaki USUI, "Space-Efficient Algorithm for Image Rotation" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 9, pp. 2341-2348, September 2008, doi: 10.1093/ietfec/e91-a.9.2341.
Abstract: This paper presents an algorithm for rotating a subimage in place without using any extra working array. Due to this constraint, we have to overwrite pixel values by interpolated values. Key ideas are local reliability test which determines whether interpolation at a pixel is carried out correctly without using interpolated values, and lazy interpolation which stores interpolated values in a region which is never used for output images and then fills in interpolated values after safety is guaranteed. It is shown that linear interpolation is always safely implemented. An extension to cubic interpolation is also discussed.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.9.2341/_p
Copy
@ARTICLE{e91-a_9_2341,
author={Tetsuo ASANO, Shinnya BITOU, Mitsuo MOTOKI, Nobuaki USUI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Space-Efficient Algorithm for Image Rotation},
year={2008},
volume={E91-A},
number={9},
pages={2341-2348},
abstract={This paper presents an algorithm for rotating a subimage in place without using any extra working array. Due to this constraint, we have to overwrite pixel values by interpolated values. Key ideas are local reliability test which determines whether interpolation at a pixel is carried out correctly without using interpolated values, and lazy interpolation which stores interpolated values in a region which is never used for output images and then fills in interpolated values after safety is guaranteed. It is shown that linear interpolation is always safely implemented. An extension to cubic interpolation is also discussed.},
keywords={},
doi={10.1093/ietfec/e91-a.9.2341},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Space-Efficient Algorithm for Image Rotation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2341
EP - 2348
AU - Tetsuo ASANO
AU - Shinnya BITOU
AU - Mitsuo MOTOKI
AU - Nobuaki USUI
PY - 2008
DO - 10.1093/ietfec/e91-a.9.2341
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2008
AB - This paper presents an algorithm for rotating a subimage in place without using any extra working array. Due to this constraint, we have to overwrite pixel values by interpolated values. Key ideas are local reliability test which determines whether interpolation at a pixel is carried out correctly without using interpolated values, and lazy interpolation which stores interpolated values in a region which is never used for output images and then fills in interpolated values after safety is guaranteed. It is shown that linear interpolation is always safely implemented. An extension to cubic interpolation is also discussed.
ER -
English
