Image Data Manipulation Flashcards
What is the purpose of digital imaging?
It allows the image to be manipulated to improve the display.
What is a digital image?
It is a two dimensional function; where the x & y coordinates have a corresponding amplitude at any point - called the intensity or grey level.
When the amplitude values are all finite, discrete quantities the image is a digital image.
Each element within the matrix, with its particular location and value, is called a pixel.
What are the two main approaches of image processing?
Spatial & frequency
Describe point operations in image processing.
It is a spatial technique. A new value is calculated for each pixel in the image. Common point operations are: inversion, or contrast enhancement/stretching (such as thresholding, windowing and the DICOM calibration cuvre).
How does image inversion work?
Pixel values will be mirrored around a mean.
If two inverted images are fused, a plain grey image will be created.
How does display windowing work?
A look up table is used to adjust the relationship between pixel and displayed values.
A smaller window width will result in more constrast between similar tissue densities. All pixels with an intensity above/below the window width will be displayed as white/black.
What is image thresholding?
A binary case of windowing the image. A threshold is used to determine whether a pixel is displayed as black or white.
What is contrast stretching in image processing?
Subset of contrast structuring. Taking large range & compressing to see more contrast between different tissue.
It doesn’t have to be a linear function.
Describe local operations in image processing.
It is a spatial technique. Common applications are: windows, filters, kernels, etc.
Define a kernel.
A matrix of pixel weighting factors. It is applied to each pixel in an image using convolution.
What are the steps for image processing convolution?
Centre the kernel on the pixel in question
Multiply the overlying values and add them together
Divide by the sum of the kernel values
This re-normalises the pixel values
Describe global operations in image processing.
This is a frequency technique; it manipulates the image as a whole. The calculations are performed in frequency space, not real space, meaning the calculations are quicker and have less steps.
Other techniques include: histogram analysis and data compression.
Fourier transforms are applied to both the image and the kernel.
Convolution is multiplication in Fourier space.
The transformed image and kernel are multiplied before applying an inverse transform.
The same processing result is achieved.
What is the purpose of image registration?
Allows points on one object to be mapped to the same points on a second object. This is used for aligning images.
Define image registration.
The mathematical operation of aligning two or more image datasets so that similar or complementary information can be transformed onto a common reference.
It is an optimisation problem; aim to optimise the alignment of two images.
Define image fusion.
The process of combining information in two or more image datasets into a more informative display. Accurate image registration is a pre-requisite of image fusion.
(Registration will always occur before fusion. Fusion is an optional additional step.)
What are the 4 requirements of an image registration algorithm?
A metric
A transform
An optimiser
An interpolator
What is the ‘metric’ in terms of image registration algorithms?
The metric is a similarity measure; it is what is desired to be optimised.
The most simple similarity measure is the ‘mean square difference’ - the lower the value, the more similar images are. Another similarity measure is the ‘sum of squared difference’ - this is a subtraction method.
Others: correlation coefficient (multipication), ratio image uniformity (division), or mutual information.
What is the ‘transform’ in terms of image registration algorithms?
The simplest version of a transform is translation in x and y. Images are transformed into spatial coordinates to become compatible, and once complete they are transformed back into images.
Transformation can be rigid (translation = 3 DoF, rotation = 6 DoF), affine (Scaling/shearing = 12 DoF) or deformable (n DoF).
What is the ‘optimiser’ in terms of image registration algorithms?
An optimiser is used to minimise the mean square difference between two images. A mean square difference is calculated for all possible translations, and the lowest value is taken as the optimum registration.
What is the ‘interpolator’ in terms of image registration algorithms?
The spatial moves required for the optimal fit of 2 images may not be whole pixels. Therefore the interpolator interpolates between the overlapping pixels in the spatial coordinates. This occurs during optimisation when the value of the metric is compared at non-pixel positions.
There are various options for interpolation:
Nearest neighbour (Bspline N=0); most simple technique, low quality, The intensity of the voxel nearest in distance is returned.
Linear (Bspline N=1): The returned value is a weighted average of the surrounding voxels, with he distance to each voxel taken as weight.
N-th order B-spline; The higher the order, the better the quality, but also requiring more computation time.
Polynomial (Nth - order)
Define image verification.
process by which the (geometric) accuracy of radiotherapy is assessed.
What is pre-treatment imaging?
compares Reference Images with planned treatment before treatment course is started.