Constant-Work-Space Image Scan with a Given Angle
スポンサーリンク
概要
- 論文の詳細を見る
In this paper we present a linear-time constant-memory algorithm for scanning a rotated grid image. The algorithm transforms the grid data into a stream data where the pixels are output in the increasing order of the distances to the line y=ax giving the rotated axis. We first deal with the special case where the slope a of the rotated axis is a quotient number of two small integers, then extend the method to the general case where the slope is an arbitrary real number.
著者
関連論文
- 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