0% found this document useful (0 votes)
10 views4 pages

Computer Vision Question Bank

The document outlines the syllabus for the Computer Vision course (BCS613B) at Sai Vidya Institute of Technology for the academic year 2024-25. It includes detailed questions and topics to be covered across five modules, focusing on various aspects of computer vision, image processing, and related techniques. The course is taught by Dr. Ramesh Wadawadagi and Prof. H S Poornima Gowda.

Uploaded by

Suhas P R
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
0% found this document useful (0 votes)
10 views4 pages

Computer Vision Question Bank

The document outlines the syllabus for the Computer Vision course (BCS613B) at Sai Vidya Institute of Technology for the academic year 2024-25. It includes detailed questions and topics to be covered across five modules, focusing on various aspects of computer vision, image processing, and related techniques. The course is taught by Dr. Ramesh Wadawadagi and Prof. H S Poornima Gowda.

Uploaded by

Suhas P R
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/ 4

®

Sri Sai Vidya Vikas Shikshana Samithi

SAI VIDYA INSTITUTE OF TECHNOLOGY


Approved by AICTE, New Delhi, Affiliated to VTU, Recognized by Govt. of Karnataka.
Accredited by NBA, New Delhi (CSE, ECE, ISE), NAAC – “A” Grade
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
RAJANUKUNTE, BENGALURU – 560 064, KARNATAKA
Phone: 080-28468191/96/97/98 * E-mail: hodcse@saividya.ac.in * URL www.saividya.ac.in

SUBJECT TITLE Computer Vision


SUBJECT TYPE PE
SUBJECT CODE BCS613B
ACADEMIC YEAR 2024-25 (EVEN SEMESTER) BATCH 2022-2026
SCHEME 2022
SEMESTER VI
FACULTY NAME and Dr. Ramesh Wadawadagi, Associate Professor
DESIGNATION Prof. H S Poornima Gowda, Assistant Professor

Q. No. Questions Marks


Module 1
1 Define Computer Vision. Why is vision so difficult? Provide six real-world 10
examples of computer vision and explain.
2 Explain photometric image formation. Discuss its important effects. 10
3 Explain in detail the Bidirectional Reflectance Distribution Function(BRDF). 08
4 With a neat diagram explain the Image sensing pipeline and its important effects. 10
Or
With a neat diagram explain the working of digital camera.
5 Explain the three important point operations used in image processing. 06
6 What is image histogram? Explain the important steps involved in computing 06
Histogram equalization of a given image.
7 Compute the histogram equalization of the following input image. 08

8 Briefly explain the concept of linear filters. 10


9 Explain the following linear filters with its applications 10
1. Box filter
2. Bilinear filter
3. Gaussian filter
4. Sobel filter
5. Corner detection
Module 2
1 Explain the following non-linear filters with its applications: 10
1. Median filter
2. Weighted median filter
3. Bilateral filter
4. Guided image filtering
2 Explain the following morphological operations on binary images. 10
1. Erosion
2. Dilation
3. Majority
4. Opening
5. Closing
3 Compute the distance transform for the following input images using city block 06
distance metric.

0 0 0 0 1 0 0
0 0 1 1 1 0 0
0 1 1 1 1 1 0
0 1 1 1 1 1 0
0 1 1 1 0 0 0
0 0 1 0 0 0 0
0 0 0 0 0 0 0
4 Explain fast Fourier transform. Discuss its applications in image processing. 10
5 Explain discrete cosine transform. Discuss its applications in image processing. 06
6 What is image pyramid? Explain different image interpolation kernels with 10
examples.
7 For the given input image, compute the image interpolation using the following 10
techniques:
10 20
30 40

1. Nearest neighbour interpolation


2. Linear interpolation
8 Explain Gaussian pyramid with example. 06
9 Explain Laplacian of Gaussian pyramid with example. 06
10 Explain wavelet transform with necessary diagrams. 06
11 Explain forward and inverse warping techniques. Discuss its limitations. 08
12 Discuss mesh-based warping technique. 06
13 Explain the algorithm for feature-based morphing. 06
Module 3
1 Explain the image degradation/restoration process model. 06
2 Explain image restoration using spatial filtering techniques. 10
3 Illustrate adaptive local noise reduction filter with a suitable example. 10
4 Describe the following filters for image restoration. 6x2=12
1. Adaptive mean filtering
2. Notch filtering
5 Explain the fundamentals of image segmentation with examples. 06
6 Describe point and line detection techniques used in segmentation. 08
7 Explain different types of edge models. Discuss their properties. 06
8 Explain the basic principles of edge detection. Discuss different types of filters 10
used in edge detection.
9 Explain basic global thresholding algorithm with a suitable example. 08
10 Describe segmentation by region growing with a suitable example. 08
11 Describe region splitting and merging with a suitable example. 08
Module 4
1 Explain different color models with necessary mathematical formulation. 12
OR
Explain the following Color Models:
10
i) The RGB Color Model
ii) The CMY and CMYK Color Models
OR
Describe the process of RGB to HSI conversions with mathematical equations. 8
2 Explain Intensity slicing and Color coding technique for pseudo image processing. 6
OR
Discuss different techniques used in pseudo image processing.
10
3 Explain color transformation techniques applied to different color models. 10
4 Briefly explain the following: 10
1. Color Complements
2. Color Slicing
5 Illustrate Color image smoothing and sharpening with suitable examples. 10
6 Explain how segmentation is performed in different color models. 10
7 Discuss the formulation of edge detection in color images. 8
8 Describe different noise models used in color images. 6
Module 5
1 Explain the following morphological operations: 10
1. Erosion and Dilation
2. Opening and Closing
2 Describe Hit Or Miss transform for shape detecting. 8
3 Explain the following morphological algorithms with examples: (Any Two) 10
1. Boundary extraction
2. Hole filling
3. Extraction of color components
4. Convex hull
5. Skeletons
6. Pruning
4 Explain boundary-following algorithm for boundary detection. 8
5 Explain with an example Freeman Chain Codes for boundary detection. 8
6 Explain with an example Slope Chain Codes for boundary detection. 8
7 Outline on pattern vectors and structural patterns. 10
8 Describe pattern classification by prototype matching. 10

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