18th International Conference on Pattern Recognition (ICPR'06) 2006
DOI: 10.1109/icpr.2006.1088
|View full text |Cite
|
Sign up to set email alerts
|

Subpixel Alignment of MRI Data Under Cartesian and Log-Polar Sampling

Abstract: Magnetic resonance imaging (MRI) allows numerous Fourier domain sampling schemes such as Cartesian and non-Cartesian trajectories (e.g. Polar, circular, and spherical

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 7 publications
0
12
0
Order By: Relevance
“…By multiplying the complexities and the probabilities in table (I) and summing them up, the average performance of the worst case for evaluating d N −k inew is found to be O(log(L)). By following a similar analysis and examining (22), one can find that the complexity for evaluating A N −k inew is O(log(L)) as well. Also, by examining (25) one can find that complexity for evaluating d N −k inew after a non-integer shift is O(log(L + 2 h )), where h is the number of levels added to achieve the shift.…”
Section: Complexity Analysismentioning
confidence: 98%
See 1 more Smart Citation
“…By multiplying the complexities and the probabilities in table (I) and summing them up, the average performance of the worst case for evaluating d N −k inew is found to be O(log(L)). By following a similar analysis and examining (22), one can find that the complexity for evaluating A N −k inew is O(log(L)) as well. Also, by examining (25) one can find that complexity for evaluating d N −k inew after a non-integer shift is O(log(L + 2 h )), where h is the number of levels added to achieve the shift.…”
Section: Complexity Analysismentioning
confidence: 98%
“…In this section we explain in further detail the complexity of evaluating d N −k inew using equation (13), A N −k inew using equation (22) and d N −k inew using equation (25). By examining (13), it is easy to verify that the complexity of evaluating d N −k inew can be expressed by the difference of the bounds of the two sums in the equation, that is O(i 3 − i 1 ).…”
Section: Complexity Analysismentioning
confidence: 99%
“…In the scope of this paper, we assume that the registration between images are known a priori or has been estimated. Translational shifts can be estimated using one of the methods by [13], [15]- [17], [38], [41], [42], [77], [101]. Even though the equations derived in Section III are for subpixel shifts, we apply the proposed SRIR method to the intersection area of any given shift, which may include an integer part, as well.…”
Section: B Proposed Methodsmentioning
confidence: 99%
“…The problem is often exacerbated by issues such as image quality, noise, and drastic appearance changes caused by viewpoint variations. Although, preprocessing steps such as image enhancement [32]- [34], [46], [69], [93], [107]- [109], [111]- [117], [120], [121], [123], and registration [6], [18], [19], [21], [23]- [26], [29], [30], [56]- [61], [63], [64], [110], [118], [119] may help in tackling some of the challenges, viewpoint variations remain by and large challenging.…”
Section: Introductionmentioning
confidence: 99%