In the field of Image Processing, Butterworth Highpass Filter (BHPF) is used for image sharpening in the frequency domain. Image Sharpening is a technique to enhance the fine details and highlight the edges in a digital image. It removes low-frequency components from an image and preserves high-frequency components.
This Butterworth highpass filter is the reverse operation of the Butterworth lowpass filter. It can be determined using the relation- where, is the transfer function of the highpass filter and is the transfer function of the corresponding lowpass filter.
The transfer function of BHPF of order is defined as-
- is a positive constant. BHPF passes all the frequencies greater than value without attenuation and cuts off all the frequencies less than it.
- This is the transition point between H(u, v) = 1 and H(u, v) = 0, so this is termed as cutoff frequency. But instead of making a sharp cut-off (like, Ideal Highpass Filter (IHPF)), it introduces a smooth transition from 0 to 1 to reduce ringing artifacts.
- is the Euclidean Distance from any point (u, v) to the origin of the frequency plane, i.e,
Step 1: Input – Read an image
Step 2: Saving the size of the input image in pixels
Step 3: Get the Fourier Transform of the input_image
Step 4: Assign the order and cut-off frequency
Step 5: Designing filter: Butterworth High Pass Filter
Step 6: Convolution between the Fourier Transformed input image and the filtering mask
Step 7: Take Inverse Fourier Transform of the convoluted image
Step 8: Display the resultant image as output
Implementation in MATLAB:
Input Image –
Note: The result of BHPF is much smoother than IHPF. Here, the boundaries are much less distorted, even for the smallest value of cutoff frequency. The transition into higher values of cutoff frequencies is much smoother with the BHPF.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.