Probability Engine · CSC413

Image Processing (BSc CSIT, CSC413): the questions likely to come

87 analyzed questions from 8 past papers (2074-2082), grouped by syllabus unit — each with its probability, how often it's been asked, and where to study the answer.

8
Papers analyzed
2074-2082
87
Analyzed questions
across 7 syllabus units
5
Very likely units
high-probability topics
4
Units = 80% of marks
study these first
Model answers for this subject are being written. Every question links to its original paper so you can study from the source meanwhile.
Pick a unit
U2 · Q1/23 · 208210 marks
Intensity Transformations and Spatial Filtering

Distinguish between high frequency emphasis filter and Laplacian filter. Find the output of the following image using histogram equalization, where number of possible gray levels is 8.

3 3 3 3 3

2 3 4 3 2

2 4 4 4 2

2 3 4 3 2

3 3 3 3 3

19%
Occasional to appearAppeared in 1 of the last 1 board papers
Seen in
How well do you know this?rating moves you on
MODEL ANSWERU2 · 10 marks

High-Frequency Emphasis Filter vs Laplacian Filter

AspectHigh-Frequency Emphasis FilterLaplacian Filter
DomainMainly frequency domainMainly spatial domain (a mask)
DefinitionHhfe(u,v)=a+bHhp(u,v)H_{hfe}(u,v)=a+b\,H_{hp}(u,v) where HhpH_{hp} is a high-pass filter, a0a\ge 0, b>ab>a2f=2fx2+2fy2\nabla^2 f=\dfrac{\partial^2 f}{\partial x^2}+\dfrac{\partial^2 f}{\partial y^2}, a second-order derivative
IdeaAdds back a fraction of the original so low frequencies (background) are not lost while high frequencies (edges) are boostedProduces only the edge/detail map; must be added to the original for sharpening: g=f2fg=f-\nabla^2 f
EffectSharpens and preserves overall tonality/brightnessStrongly highlights edges but darkens flat regions if used alone
OrderBuilt on a high-pass responsePure second-derivative operator
OutputEnhanced image with detail emphasizedEdge image (zero in flat areas)

In short, the high-frequency emphasis filter is essentially a high-pass filter with an added offset so the result is not a bare edge map, whereas the Laplacian is an isotropic second-derivative operator whose raw output is an edge map that is normally combined with the original for sharpening.

Histogram Equalization (L=8L=8)

Input image (5×55\times5):

3 3 3 3 3
2 3 4 3 2
2 4 4 4 2
2 3 4 3 2
3 3 3 3 3

Total pixels MN=25MN = 25, levels L=8L=8 so the scaling factor is L1=7L-1=7.

Step 1 – Histogram (count of each gray level):

rkr_knkn_k
26
314
45

(All other levels 0, 1, 5, 6, 7 have count 0.)

Step 2 – PDF, CDF and transformation sk=round[(L1)CDF]s_k=\text{round}\big[(L-1)\,\text{CDF}\big]:

rkr_knkn_kpr=nk/25p_r=n_k/25CDF(L1)(L-1)\cdotCDFsks_k
260.240.241.682
3140.560.805.606
450.201.007.007

Step 3 – Mapping: 22,  36,  472\to2,\; 3\to6,\; 4\to7.

Output (equalized) image:

6 6 6 6 6
2 6 7 6 2
2 7 7 7 2
2 6 7 6 2
6 6 6 6 6

The original values were clustered in {2,3,4}\{2,3,4\}; after equalization they are spread across {2,6,7}\{2,6,7\}, increasing the global contrast.

AI-generated answer · unverifiedView in 2082 paper →
U2 · Question 1 of 23
Question Priority · U2ranked by appearance likelihood — study top-down

Intensity Transformations and Spatial Filtering

Analyzed next22%
1
★ TOP PICK

Distinguish between high frequency emphasis filter and Laplacian filter. Find the output of the following image using histogram equalization, where number of possible gray levels is 8.

3 3 3 3 3

2 3 4 3 2

2 4 4 4 2

2 3 4 3 2

3 3 3 3 3

10 marksSEEN IN
19%
2

What is histogram processing? Explain histogram equalization and histogram specification with mathematical formulation and an example.

10 marksSEEN IN
16%
3

Explain image enhancement techniques in the spatial and frequency domains with suitable examples and their comparative advantages.

10 marksSEEN IN
15%
4

What is histogram equalization? Perform histogram equalization on a given 3-bit image with the listed gray-level distribution and show all steps.

10 marksSEEN IN
13%
5

Define histogram of an image and explain its uses.

5 marksSEEN IN
17%
6

Explain the histogram equalization process briefly.

5 marksSEEN IN
15%
7

Explain power-law (gamma) transformation.

5 marksSEEN IN
22%
8

Explain image enhancement in the spatial domain. Discuss point processing techniques (negative, log, power-law) and histogram processing.

10 marksSEEN IN
11%
9

Define clipping and contrast stretching. Compute Hadamard transform of the data sequence {1, 2, 0, 3}.

5 marksSEEN IN
19%
10

Explain log transformation and its use.

5 marksSEEN IN
16%
11

What is convolution in spatial filtering?

5 marksSEEN IN
16%
12

What is the difference between brightness and contrast?

5 marksSEEN IN
13%
13

Explain bit-plane slicing.

5 marksSEEN IN
13%
14

Explain the different types of filters used in image processing.

5 marksSEEN IN
12%
15

What is the difference between smoothing and sharpening?

5 marksSEEN IN
12%
16

Explain image negatives and their application.

5 marksSEEN IN
12%
17

What is image sharpening? Which filters are used?

5 marksSEEN IN
11%
18

Explain contrast stretching.

5 marksSEEN IN
9%
19

What is histogram specification (matching)?

5 marksSEEN IN
9%
20

Differentiate between mean filter and median filter.

5 marksSEEN IN
9%
21

What is image enhancement? Differentiate between spatial and frequency domain enhancement.

5 marksSEEN IN
8%
22

Explain the concept of a histogram of an image.

5 marksSEEN IN
8%
23

What is a low-pass filter? How is it used for smoothing?

5 marksSEEN IN
8%
03The mock

Sit a probable paper

A full mock exam built from the most likely questions, mirroring the real paper's structure. Every slot is a real past question.

Most Probable Paper

Mirrors the real structure · 60 marks · based on 8 past papers

Section A: Long Answer QuestionsAttempt any TWO questions.
  1. 1.

    What is image segmentation? Explain adaptive thresholding and the region split-and-merge technique with examples.

    [10 marks]
    Image SegmentationVery likelyfrom 2078 paper →

    This question has recurred in 2 of 8 years; so far only in internal assessments, not the board; and its topic (Image Segmentation) appears in 100% of years.

  2. 2.

    Distinguish between high frequency emphasis filter and Laplacian filter. Find the output of the following image using histogram equalization, where number of possible gray levels is 8.

    3 3 3 3 3

    2 3 4 3 2

    2 4 4 4 2

    2 3 4 3 2

    3 3 3 3 3

    [10 marks]
    Intensity Transformations and Spatial FilteringVery likelyfrom 2082 paper →

    Asked once (2082); so far only in internal assessments, not the board; and its topic (Intensity Transformations and Spatial Filtering) appears in 100% of years.

  3. 3.

    What is histogram processing? Explain histogram equalization and histogram specification with mathematical formulation and an example.

    [10 marks]
    Intensity Transformations and Spatial FilteringVery likelyfrom 2081 paper →

    Asked once (2081); so far only in internal assessments, not the board; and its topic (Intensity Transformations and Spatial Filtering) appears in 100% of years.

Section B: Short Answer QuestionsAttempt any EIGHT questions.
  1. 1.

    Explain the properties of the 2D DFT.

    [5 marks]
    Filtering in the Frequency DomainVery likelyfrom 2080 paper →

    This question has recurred in 4 of 8 years; so far only in internal assessments, not the board; and its topic (Filtering in the Frequency Domain) appears in 100% of years.

  2. 2.

    Define histogram of an image and explain its uses.

    [5 marks]
    Intensity Transformations and Spatial FilteringVery likelyfrom 2078 paper →

    This question has recurred in 2 of 8 years; so far only in internal assessments, not the board; and its topic (Intensity Transformations and Spatial Filtering) appears in 100% of years.

  3. 3.

    Explain the histogram equalization process briefly.

    [5 marks]
    Intensity Transformations and Spatial FilteringVery likelyfrom 2077 paper →

    This question has recurred in 2 of 8 years; so far only in internal assessments, not the board; and its topic (Intensity Transformations and Spatial Filtering) appears in 100% of years.

  4. 4.

    Explain power-law (gamma) transformation.

    [5 marks]
    Intensity Transformations and Spatial FilteringVery likelyfrom 2080 paper →

    This question has recurred in 2 of 8 years; so far only in internal assessments, not the board; and its topic (Intensity Transformations and Spatial Filtering) appears in 100% of years.

  5. 5.

    Explain dilation and erosion with examples.

    [5 marks]
    Image SegmentationVery likelyfrom 2081 paper →

    This question has recurred in 2 of 8 years; so far only in internal assessments, not the board; and its topic (Image Segmentation) appears in 100% of years.

  6. 6.

    Distinguish between forward and inverse transform. Define pixel coding, run length and bit plane.

    [5 marks]
    Image CompressionVery likelyfrom 2082 paper →

    This question has recurred in 2 of 8 years; so far only in internal assessments, not the board; and its topic (Image Compression) appears in 100% of years.

  7. 7.

    Define clipping and contrast stretching. Compute Hadamard transform of the data sequence {1, 2, 0, 3}.

    [5 marks]
    Intensity Transformations and Spatial FilteringVery likelyfrom 2082 paper →

    Asked once (2082); so far only in internal assessments, not the board; and its topic (Intensity Transformations and Spatial Filtering) appears in 100% of years.

  8. 8.

    Explain log transformation and its use.

    [5 marks]
    Intensity Transformations and Spatial FilteringVery likelyfrom 2081 paper →

    Asked once (2081); so far only in internal assessments, not the board; and its topic (Intensity Transformations and Spatial Filtering) appears in 100% of years.

  9. 9.

    What is convolution in spatial filtering?

    [5 marks]
    Intensity Transformations and Spatial FilteringVery likelyfrom 2081 paper →

    Asked once (2081); so far only in internal assessments, not the board; and its topic (Intensity Transformations and Spatial Filtering) appears in 100% of years.

04The receipts

Behind the numbers

The raw evidence the predictions are computed from: marks per unit per year, syllabus weights, trends, and coverage.

Show the heatmap, topic table and coverage analysis

The receipt: marks per unit, per year

Each row is a syllabus unit, each column an exam year, each cell the marks that unit earned that year. Click any cell to see the actual questions behind it.

Marks:nonefew → many
2074
2075
2077
2078
2079
2080
2081
2082
Total
U2Intensity Transformations and Spatial Filtering
165
U7Image Segmentation
145
U3Filtering in the Frequency Domain
120
U6Image Compression
65
U1Introduction
60
U4Image Restoration and Reconstruction
30
U5Color Image Processing
15
#Syllabus unitProbabilityAppearedAvg marksSyllabus weightExam vs syllabusTrendQuestions
1U2Intensity Transformations and Spatial FilteringVery likely100%20.620%9 lecture hrsOver-examinedexam 28% · syllabus 20%Fading3 recurring23 total
2U7Image SegmentationVery likely100%18.19%4 lecture hrsOver-examinedexam 24% · syllabus 9%Rising2 recurring23 total
3U3Filtering in the Frequency DomainVery likely100%1520%9 lecture hrsBalancedexam 20% · syllabus 20%Steady1 recurring13 total
4U6Image CompressionVery likely100%8.111%5 lecture hrsBalancedexam 11% · syllabus 11%Fading1 recurring11 total
5U1IntroductionVery likely88%8.611%5 lecture hrsBalancedexam 10% · syllabus 11%Steadynone repeat9 total
6U4Image Restoration and ReconstructionPossible50%7.518%8 lecture hrsUnder-examinedexam 5% · syllabus 18%Steadynone repeat5 total
7U5Color Image ProcessingPossible38%511%5 lecture hrsUnder-examinedexam 2% · syllabus 11%Steadynone repeat3 total

Study smart, not hard

Drag the slider: studying the top 4 units in priority order covers ~82% of all observed marks.

  1. ~80% line

Lecture time vs exam marks

Where the exam pays more than the curriculum spends: ● lectures vs ● exam marks, as a share of the whole course. A long teal-leading bar = high-yield unit.

U2Intensity Transformations and Spatial Filtering
20% of lectures → 28% of markshigh yield
U7Image Segmentation
9% of lectures → 24% of markshigh yield
U3Filtering in the Frequency Domain
20% of lectures → 20% of marks
U6Image Compression
11% of lectures → 11% of marks
U1Introduction
11% of lectures → 10% of marks
U4Image Restoration and Reconstruction
18% of lectures → 5% of markslow yield
U5Color Image Processing
11% of lectures → 2% of markslow yield

Topics are the official CSC413 syllabus units. Predictions are data-driven probabilities computed from 8 past papers (2074-2082) by mapping each real question to its syllabus unit. They indicate what has historically been likely, not guaranteed questions. Always study the full syllabus.