Space-Efficient Algorithm for Image Rotation
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 2008-09-01
著者
-
ASANO Tetsuo
School of Information Science, JAIST
-
Motoki Mitsuo
School Of Information Science Jaist
-
BITOU Shinnya
Imaging Engineering Div., Products Group, PFU Limited
-
USUI Nobuaki
Imaging Engineering Div., Products Group, PFU Limited
-
Bitou Shinnya
Imaging Engineering Div. Products Group Pfu Limited
-
Asano Tetsuo
School Of Information Science Jaist
-
Usui Nobuaki
Imaging Engineering Div. Products Group Pfu Limited
関連論文
- Voronoi Diagrams with Respect to Criteria on Vision Information
- Space-Efficient Algorithm for Image Rotation
- Constant-Work-Space Image Scan with a Given Angle
- Inserting Points Uniformly at Every Instance
- On Detecting Digital Line Components in a Binary Image
- Digital Curve Approximation with Length Evaluation
- Topological Walk Revisited(Special Section on Discrete Mathematics and Its Applications)
- A Linear Time Algorithm for Binary Fingerprint Image Denoising Using Distance Transform
- Digital Halftoning Algorithm Based on Random Space-Filling Curve
- Arranging Fewest Possible Probes to Detect a Hidden Object with Industrial Application
- Digital Halftoning: Algorithm Engineering Challenges
- Algorithmic Evaluation of Line Detection Problem
- Halftoning Through Optimization of Restored Images : A New Approach with Hardware Acceleration
- NP-completeness of generalized Kaboozle
- A Small-Space Algorithm for Removing Small Connected Components from a Binary Image