1992
DOI: 10.1016/1049-9652(92)90080-h
|View full text |Cite
|
Sign up to set email alerts
|

High-accuracy rotation of images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
43
0
2

Year Published

1995
1995
2021
2021

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 56 publications
(45 citation statements)
references
References 2 publications
0
43
0
2
Order By: Relevance
“…A frequently used alternative approach to study the performance of interpolation kernels for the purpose of applying geometrical transformations, is to apply these transfor-mations to a number of test-images, followed by the inverse transformation so as to bring the images back in their original position [6,13,28,33,38]. Ideally, the forward-backward transformed images should be identical to their respective originals, so that a quantitative performance measure can be based on the grey-value differences between the images.…”
Section: Discussion Of Evaluation Strategiesmentioning
confidence: 99%
See 1 more Smart Citation
“…A frequently used alternative approach to study the performance of interpolation kernels for the purpose of applying geometrical transformations, is to apply these transfor-mations to a number of test-images, followed by the inverse transformation so as to bring the images back in their original position [6,13,28,33,38]. Ideally, the forward-backward transformed images should be identical to their respective originals, so that a quantitative performance measure can be based on the grey-value differences between the images.…”
Section: Discussion Of Evaluation Strategiesmentioning
confidence: 99%
“…In the evaluation, we restricted ourselves to the class of kernels for which n and m are related by n = 2m − 1. This is a rather broad class, which includes the linear interpolation kernel (6) and all of the Lagrange interpolation kernels described in the previous subsection. It also includes the quadratic piecewise polynomial kernel due to Dodgson [7].…”
Section: Generalized Convolution Kernelsmentioning
confidence: 99%
“…For our system, we chose the latter solution of a hardware rotator. Different approaches for the rotation algorithm have been investigated, rotation using distortion matrices [6], trilinear interpolation [5], and Gaussian interpolation masks [15]. For the last method, the gray value of the voxel v in the rotated coordinate system is interpolated by the gray values of its 8 neighbors v r ' in the original coordinate system.…”
Section: Lutmentioning
confidence: 99%
“…A threeshear decomposition of a 2D image rotation was introduced independently by Paeth [11] and Tanaka et al [15]. A straightforward extension of this method to 3D was proposed by Schroeder and Salem [14], also by Danielsson and Hammerin [4]. From the initially obtained nine shear decomposition sequence, they managed to merge two neighboring shears into a single shear, resulting in an eight-shear decomposition.…”
Section: Introductionmentioning
confidence: 99%
“…From the initially obtained nine shear decomposition sequence, they managed to merge two neighboring shears into a single shear, resulting in an eight-shear decomposition. Schroeder and Salem [4] have implemented the eight-pass rotation on CM-2. The first attempt of directly performing decomposition on 3D rotation was taken by Wittenbrink and Somani [19] and recently by Toffoli and Quick [16].…”
Section: Introductionmentioning
confidence: 99%