Scribd
Upload
2 views3 pages

Ca Dip

The document provides answers to exam questions across three sections: multiple choice, short answer, and long answer. It covers topics such as image processing concepts, calculations for image size and quantization, and details on Fourier Transform and morphological operations. Each section is formatted with appropriate detail for exam preparation, including calculations and examples.

Uploaded by

shareassassin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views3 pages

Ca Dip

The document provides answers to exam questions across three sections: multiple choice, short answer, and long answer. It covers topics such as image processing concepts, calculations for image size and quantization, and details on Fourier Transform and morphological operations. Each section is formatted with appropriate detail for exam preparation, including calculations and examples.

Uploaded by

shareassassin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Here are the answers to all the questions in Section A, Section B, and Section C, formatted according to their mark

weightage and with appropriate detail for exams:

Section A – Multiple Choice Questions (1 mark each)

1. What does the term "quantization" refer to in image processing? Answer: C. Reducing the number of intensity levels

2. The size of a digital image is 512 × 512 pixels, with 8 bits per pixel. What is the total size of the image in bytes? Calculation: 512 × 512 = 262144 pixels Each pixel =
8 bits = 1 byte Answer: B. 262144 bytes

3. Which operation is used in morphological image processing to remove small white noises? Answer: D. Opening

4. A high-pass filter is typically used to: Answer: C. Detect edges

5. Which transform is most commonly used for image compression? Answer: C. Discrete Cosine Transform (DCT)**

Section B – Short Answer Type Questions (5 marks each)

6. Image Sampling and Quantization Calculation

Given: Resolution = 256 × 256 Quantization = 4 bits per pixel

a) Total number of pixels = 256 × 256 = 65536 pixels b) Total number of bits = 65536 × 4 = 262144 bits c) Image size in bytes = 262144 ÷ 8 = 32768 bytes (32 KB)

7. Apply 3×3 Sharpening Kernel Using Convolution

Given Kernel (Sharpening Filter):

[ 0 -1 0 ]
[-1 5 -1 ]
[ 0 -1 0 ]

Image Patch:

[60 70 80]
[65 75 85]
[55 65 75]

Convolution (element-wise multiplication and sum):

(0×60) + (-1×70) + (0×80)


+ (-1×65) + (5×75) + (-1×85)
+ (0×55) + (-1×65) + (0×75)

= 0 - 70 + 0
-65 + 375 - 85
0 - 65 + 0

Total = -70 -65 + 375 -85 -65 = **90**

**New Center Pixel Value = 90**

---

### **8. Steps in Image Filtering Using Spatial Mask + Example**

**Steps:**
1. Select a filter mask (e.g., 3×3 edge detection kernel).
2. Place the mask at each pixel location centered around that pixel.
3. Perform element-wise multiplication between mask and image patch.
4. Sum the result and assign to the center pixel in the output image.
5. Repeat for all pixels.

**Example: 3×3 Edge Detection (Sobel X filter):**


[-1 0 1] [-2 0 2] [-1 0 1]

This mask detects vertical edges by highlighting intensity changes in the horizontal direction.

---

## **Section C – Long Answer Type Questions (15 marks each)**

### **9. Image Sampling and Quantization Explained**

**Image size: 256×256 pixels, 8-bit depth**

**a) Image size in bytes:**


= 256 × 256 = 65536 pixels
= 65536 × 8 bits = 524288 bits
= 524288 ÷ 8 = **65536 bytes (64 KB)**

**b) New size if quantized to 4 bits:**


= 65536 × 4 = 262144 bits = **32768 bytes (32 KB)**

**c) Effect of Reducing Bit Depth on Image Quality:**


- Reduces the number of intensity levels (e.g., 8-bit = 256 levels; 4-bit = 16 levels).
- Loss of fine intensity gradations.
- Causes **posterization** (abrupt changes in tone).
- May reduce image realism and introduce visible artifacts.
- However, useful for compression in low-memory applications.

---

### **10. Fourier Transform in Image Processing**

**a) Frequency Domain & Its Significance:**


- In spatial domain: image represented by pixel intensities.
- In frequency domain: image is represented as a sum of sinusoidal patterns.
- Useful for:
- Filtering noise
- Image compression
- Edge detection
- Low frequency = smooth areas, High frequency = edges & details.

**b) Applying 2D Discrete Fourier Transform (DFT):**


- For an image f(x, y), the 2D DFT is:

F(u, v) = ∑∑ f(x, y) × e^(-j2π(ux/M + vy/N))


Where (u,v) are frequency coordinates.
- Converts image from spatial to frequency domain.
- Often implemented using Fast Fourier Transform (FFT) for efficiency.

**c) Role of Magnitude and Phase Spectra:**


- **Magnitude spectrum**: tells us how much of each frequency is present.
- **Phase spectrum**: tells where those frequencies occur (positional info).
- **Both are essential** to reconstruct the original image.
- Using only magnitude → blurry reconstruction.
- Using only phase → retains structure but lacks clarity.

---

### **11. Morphological Operations with Diagrams and Applications**

**a) Basic Operations:**

| Operation | Description |
|----------|-------------|
| **Dilation** | Expands white regions (adds pixels to object boundaries) |
| **Erosion** | Shrinks white regions (removes pixels from object boundaries) |
| **Opening** | Erosion followed by dilation – removes small white noise |
| **Closing** | Dilation followed by erosion – fills small black holes |

**b) Diagrams:**

Input Binary Image: [ 0 0 1 0 0 ] [ 0 1 1 1 0 ] [ 0 0 1 0 0 ]

After Erosion: [ 0 0 0 0 0 ] [ 0 1 1 1 0 ] [ 0 0 0 0 0 ]

After Dilation: [ 0 1 1 1 0 ] [ 1 1 1 1 1 ] [ 0 1 1 1 0 ]

**c) Example – Noise Removal:**


- **Opening** removes small white noise like isolated dots.
- **Closing** fills small black holes in an object.

**Example – Shape Detection:**


- **Erosion** can separate touching objects.
- **Dilation** can connect broken parts.

---

Let me know if you want these compiled into a PDF or if you’d like diagram images included!

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy