Difference between revisions of "Interpolation methods used in MIPAV"
m (Created page with 'This article is '''a stub'''. It needs improvement. '''See also:''' Optimized automatic registration 3D Category:Help:Stub') |
m |
||
| Line 1: | Line 1: | ||
This article is '''a stub'''. It needs improvement. | This article is '''a stub'''. It needs improvement. | ||
| + | |||
| + | The registration and transformation algorithms implemented in MIPAV resampes images (if needed) using an interpolation scheme, where anisotropic voxels (or pixels for 2D images) are resampled into isotropic 1 mm cubic voxels. New voxel values are computed using a weighted combination of existing voxel values within a defined neighborhood of the new voxel location. The following interpolation methods are available in this implementation of the registration technique, including Bilinear, Trilinear, B-spline 3-rd order, B-spline 4-th order, Cubic Lagrangian, Quintic Lagrangian, Heptic Lagrangian, and Windowed sinc. | ||
| + | |||
| + | |||
| + | == Bilinear Interpolation == | ||
| + | |||
| + | Bilinear interpolation considers the closest 2x2 neighborhood of known pixel values surrounding the unknown pixel. It then takes a weighted average of these 4 pixels to arrive at its final interpolated value. This results in smoother looking images. | ||
'''See also:''' [[Optimized automatic registration 3D]] | '''See also:''' [[Optimized automatic registration 3D]] | ||
[[Category:Help:Stub]] | [[Category:Help:Stub]] | ||
Revision as of 19:20, 7 May 2012
This article is a stub. It needs improvement.
The registration and transformation algorithms implemented in MIPAV resampes images (if needed) using an interpolation scheme, where anisotropic voxels (or pixels for 2D images) are resampled into isotropic 1 mm cubic voxels. New voxel values are computed using a weighted combination of existing voxel values within a defined neighborhood of the new voxel location. The following interpolation methods are available in this implementation of the registration technique, including Bilinear, Trilinear, B-spline 3-rd order, B-spline 4-th order, Cubic Lagrangian, Quintic Lagrangian, Heptic Lagrangian, and Windowed sinc.
Bilinear Interpolation
Bilinear interpolation considers the closest 2x2 neighborhood of known pixel values surrounding the unknown pixel. It then takes a weighted average of these 4 pixels to arrive at its final interpolated value. This results in smoother looking images.
See also: Optimized automatic registration 3D
