Set D Part B - C - key (1)
Set D Part B - C - key (1)
Course
S.No. PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
Outcome
1 CO1 3 2 - - - - - - - - - - - 2 -
2 CO2 3 2 - 1 - - - - - - - - - 2 -
3 CO3 3 - 2 - 2 - - - - 1 - - - 2 -
4 CO4 3 2 - 1 - - - - - - - - - 2 -
5 CO5 3 - 2 1 2 - - - - 1 - - - 2 -
Part – B
(4 x 5 = 20 Marks)
Answer All 4 Questions
21a Discuss at least two key preprocessing techniques, such 5 L2 1 1 1.3.1
as noise reduction or contrast enhancement, and explain
how they contribute to improving the quality of images
before further analysis or interpretation. Provide
examples to illustrate the impact of these preprocessing
techniques on image outcomes.
Keypoints:
Keypoints:
Keypoints
Pixel Connectivity Overview: Pixel connectivity refers
to the relationship between neighboring pixels in a digital
image. It determines how pixels are connected or
adjacent to each other, influencing various image
processing tasks.
Keypoints:
Sampling Process: Sampling involves selecting discrete
points from a continuous image to create a digital
representation. It determines the spatial resolution of the
digital image.
Quantization Process: Quantization assigns digital
values to the sampled points, representing the intensity or
color information of the image. It determines the
dynamic range and precision of the digital representation.
Keypoints:
RGB Color Model: Represents colors using
combinations of red, green, and blue primary colors.Each
pixel is defined by its intensity levels of red, green, and
blue, typically ranging from 0 to 255.
Keypoints:
Translation: Translation moves an object from one
position to another in a 2D space. Mathematically, a
translation is represented as T(dx, dy), where dx and dy
are the horizontal and vertical distances by which the
object is moved.
Keypoints
Keypoints:
Keypoints:
Understanding 2D DFT:
f(x,y) =
Keypoints:
Kernel:
Repeat for all pixels: Apply steps 1-3 to all pixels in the
image to generate the filtered output.
Output Image:
| 2.111 2.222 2.111 2.222 2.111 |
| 2.222 2.333 2.333 2.333 2.222 |
| 2.333 2.444 2.444 2.444 2.333 |
| 2.222 2.333 2.333 2.333 2.222 |
| 2.111 2.222 2.111 2.222 2.111 |
Output Image:
|1 1 1 1 1|
|1 1 1 1 1|
|1 1 1 1 1|
|1 1 1 1 1|
|1 1 1 1 1|
Maximum Filter: No kernel required. For each pixel,
replace its value with the maximum value in its 3x3
neighborhood.
Output Image:
|5 5 5 5 5|
|5 5 5 5 5|
|5 5 5 5 5|
|5 5 5 5 5|
|5 5 5 5 5|
Key Points:
*Program Indicators are available separately for Computer Science and Engineering in AICTE examination
reforms policy.