Revision Qs Flashcards
To make fine details more visible you would..
Use negation
To pick out a particular intensity you would…
use grey level slicing
To reduce salt and pepper noise you would….
Use median filtering
Why is median filtering so good for salt and pepper noise?
target pixel gets median value so unlikely to replace noise with more noise or a good pixel with noise
To reduce gaussian noise you would…
Use gaussian filtering
To blur an image but preserve edge detail you would…
Use gaussian filtering
To enhance edges in a smooth image you would…
Use an unsharp mask
How would you detect strong edges with 2nd order derivatives?
Using a Laplacian filter
To increase brightness you would…
Use bias (shift intensity)
To increase contrast you would…
Use gain (contrast stretching)
To reduce all pixel values above a certain level to white and the rest to black, you would..
Use thresholding
To make text easily stand out against the background you would…
Use thresholding
To correct an image that looks washed out due to non linear lighting effects you would…
Use gamma correction
To sharpen an image slightly without introducing much noise you would…
Use an unsharp mask
To reduce small random noise evenly across an image, you would….
Use a mean or gaussian filter (gaussian would preserve your edges more)
From an intensity frequency graph, how would you calculate PDF?
freq / number of pixels - this is just probability
How do you calculate CDF from PDF in a table?
Starting at the smallest intensity, you add a running sum of PDFs. The first CDF will equal its PDF and the last will be 1
What is the histogram equalisation formula?
Equalised pixel output =
round( (CDF - CDFmin) x (L - 1)/(1 - CDFmin) )
What does binariasation mean?
Thresholding an image so it only contains two colours, typically black and white
What is Otsu thresholding?
A method that determines the threshold using the images bimodal histogram
When is Otsu thresholding appropriate?
On an image with a bimodal histogram, e.g. a peak of light pixels and a peak of dark pixels
How is the threshold found for Otsu?
By minimising a weighted sum of the variations from the two histogram regions to ensure the threshold is splitting them evenly
When is unimodal thresholding appropraite?
For histograms with one peak, e.g. an image with a lot of dark pixels or a lot of light pixels
How is the threshold found in unimodal thresholding?
A line is drawn on the histogram from the highest peak to the lowest bin, and then the bin is selected who’s peak is furthest from the line