AKTU Image Processing (BCS057) Question Paper 2025-26

Note: Attempt all Sections. In case of any missing data; choose suitably.

Section A

Q1. Attempt all questions in brief. 0 · 2 × 7 = 14 marks

1. Define image sampling and quantization.
2. What is histogram equalization? 1,
3. Define morphological operations with examples.
4. What is noise in digital images?
5. What is run length encoding?
6. What is image compression?
7. Define Fourier Transform. 1,

Section B

Q2. Attempt any three of the following · 7 × 3 = 21 marks

1. What do you mean by image processing? Explain the steps of image processing with the help of block diagram.
2. Explain histogram specification technique with suitable example.
3. Explain Gaussian low pass filter.
4. Explain region splitting and merging with suitable example.
5. Discuss the need for data compression. Also explain run length encoding algorithm in detail.

Section C

Q3

Attempt any one part of the following · 7 × 1 = 7 marks

1. Differentiate Correlation and Convolution with 1 - D function and a filter example.
2. Perform histogram equalization for an image with gray levels {0,1,2,3}
   having frequencies {4,6,8,2}.
{0, 1, 2, 3} {4, 6, 8, 2}

Q4

Attempt any one part of the following · 7 × 1 = 7 marks

1. Explain homomorphic filtering. Compute the morphological opening of a binary image.
2. Explain region growing segmentation method. Consider the following grayscale image:
   A seed pixel is selected at position (2,2) with intensity value 96 .
   Apply the Region Growing Segmentation method using:
   • Threshold = ±5
   • 4 - connectivity
   Identify all pixels that will be included in the grown region and draw the final segmented regi on mask (1 = region, 0 = non - region).
   Region Growing Segmentation
   Region Growing Segmentation , :

Q5

Attempt any one part of the following · 7 × 1 = 7 marks

1. Construct Huffman codes for symbols with probabilities {0.4, 0.3, 0.2, 0.1} and calculate the average code length for the Huffman tree. {0.4, 0.3, 0.2, 0.1}
2. What is Image Restoration? Draw and explain the basic block diagram of the restoration process.

Q6

Attempt any one part of the following · 7 × 1 = 7 marks

1. Explain edge detection and edge linking. Also differentiate between edge
2. detection and edge linking. Explain mean and order statistic filters with suitable example.

Q7

Attempt any one part of the following · 7 × 1 = 7 marks

1. Explain erosion and dilation with suitable example.
2. Differentiate between JPEG and MPEG standard in detail.

Short on time? See the most repeated AKTU Image Processing questions across all years.

Other years

More AKTU Image Processing papers on LearnAIFast.

This paper is reproduced for study purposes only. Copyright belongs to AKTU. Source: the question paper bank of ABES Institute of Technology, an AKTU-affiliated college. If you own the copyright and want it removed, email learnwithskillnest@gmail.com and we will take it down.