Jawaharlal Nehru Technological University Hyderabad

Jawaharlal Nehru Technological University Hyderabad B.Tech IV COMPUTER VISION Previous Question Paper (July/August - 2022 - R16)

B.Tech | IV | IV-II | R16 | July/August - 2022

Answer PaperPaper Code: 138BHMaximum Marks: 75Time: 3 Hours

Answer any five questions. All questions carry equal marks.

Main

115 marks
a

Explain the fundamental steps in digital image processing which can be applied to images.

8 marks

Answer

JNTU

B.Tech ECE - COMPUTER VISION

IV-II Semester, R16 Regulation

Exam Month-Year: May-2024, Max Marks: 75, Time: 3 Hours

Instructions: Answer all questions. Show your work clearly.

Explain the fundamental steps in digital image processing which can be applied to images.

Marks: 8

  • Digital Image Processing (DIP) is a field that deals with the manipulation and analysis of digital images using computers. It involves transforming an image into a digital format and then performing operations on it to extract useful information or enhance its quality. The fundamental steps in DIP can be broadly categorized as follows:
  • 1. Image Acquisition: This is the first step where an image is captured. It involves the sensor (e.g., CCD, CMOS camera) that converts the light intensity into an electrical signal, which is then digitized. The output of this stage is a digital image, typically represented as a 2D array of pixels.
  • 2. Image Enhancement: This step aims to improve the visual appearance of an image or to highlight certain features for further analysis. Common enhancement techniques include:
    • Point Processing: Operations that modify the intensity of individual pixels based on a mapping function. Examples include brightness adjustment, contrast stretching, and thresholding.
    • Spatial Filtering: Operations that modify pixel values based on the values of their neighbors. This includes smoothing filters (e.g., mean, Gaussian) to reduce noise and sharpening filters (e.g., Laplacian, Sobel) to enhance edges.
    • Color Image Processing: Techniques applied to color images, such as color balancing, color correction, and pseudo-coloring.
  • 3. Image Restoration: This step attempts to remove or reduce known degradations from an image, such as blur caused by motion or out-of-focus optics, or noise introduced during acquisition or transmission. Techniques like inverse filtering, Wiener filtering, and geometric mean filtering are used.
  • 4. Color Image Processing: This involves processing color images. It includes representing colors in different color spaces (e.g., RGB, HSV, YCbCr), color transformations, and color segmentation.
  • 5. Image Segmentation: This is a crucial step where an image is partitioned into multiple segments or regions, each corresponding to a different object or part of an object. Segmentation is often based on pixel properties like intensity, color, or texture, or on spatial relationships between pixels. Common methods include:
    • Thresholding: Separating pixels into regions based on their intensity values.
    • Region-based segmentation: Grouping pixels into regions based on similarity criteria.
    • Edge detection: Identifying pixels that lie on the boundaries of objects.
    • Clustering: Grouping pixels into clusters based on their features.
  • 6. Image Representation and Description: Once an image is segmented into meaningful regions, it needs to be represented in a format suitable for further processing. This involves extracting features that describe the regions or objects. Descriptions can be:
    • Boundary descriptors: Properties of the object's boundary, such as length, curvature, or shape.
    • Region descriptors: Properties of the region itself, such as area, perimeter, texture, or color.
    • Features: More complex characteristics like shape, size, orientation, and texture.
  • 7. Object Recognition: This is the final step where objects are identified based on their descriptions. It involves matching the extracted features with a database of known objects.
  • 8. Image Compression: This step reduces the amount of data required to represent an image, making storage and transmission more efficient. Techniques can be lossless (no information loss) or lossy (some information loss).
b

Discuss in detail about Mathematical Morphology.

7 marks

Answer

JNTU

B.Tech ECE - COMPUTER VISION

IV-II Semester, R16 Regulation

Exam Month-Year: May-2024, Max Marks: 75, Time: 3 Hours

Instructions: Answer all questions. Show your work clearly.

Discuss in detail about Mathematical Morphology.

Marks: 7

Mathematical Morphology is a set of non-linear image processing techniques used to analyze and process the geometric structure of an image. It is based on set theory and uses a structuring element to probe and modify the image. It is particularly useful for tasks like noise removal, shape analysis, segmentation, and feature extraction. The fundamental operations in mathematical morphology are dilation and erosion, which form the basis for more complex operations like opening and closing.
  • Structuring Element (SE): The structuring element is a small binary image (or a template) of a specific shape and size. It is used as a probe to interact with the input image. The shape of the SE is crucial as it determines the nature of the morphological operation. Common shapes include squares, disks, and lines.
  • Dilation: Dilation is an operation that expands or grows the boundaries of foreground objects in an image. For a binary image A and a structuring element B, the dilation of A by B is defined as:
A ⊕ B = { z | Bz ∩ A ≠ ∅ }
where Bz is the translation of B by vector z. In simpler terms, dilation places the origin of the SE at each pixel of the image. If any part of the SE overlaps with a foreground pixel (value 1) in the image, the pixel in the output image corresponding to the origin of the SE is set to 1. Dilation tends to fill small holes and connect broken parts of objects.
  • Erosion: Erosion is an operation that shrinks or erodes the boundaries of foreground objects. For a binary image A and a structuring element B, the erosion of A by B is defined as:
A ⊖ B = { z | Bz ⊆ A }
In simpler terms, erosion places the origin of the SE at each pixel of the image. If the entire SE fits completely within the foreground pixels of the image, the pixel in the output image corresponding to the origin of the SE is set to 1; otherwise, it is set to 0. Erosion tends to remove small objects and thin connections.
  • Opening: Opening is a two-step operation that consists of an erosion followed by a dilation using the same structuring element. It is denoted as A ∘ B.
A ∘ B = (A ⊖ B) ⊕ B
Opening is useful for removing small noise particles (salt noise) and small protrusions from objects without significantly altering the size and shape of larger objects. It essentially smooths the contours of objects.
  • Closing: Closing is the dual operation of opening. It consists of a dilation followed by an erosion using the same structuring element. It is denoted as A • B.
A • B = (A ⊕ B) ⊖ B
Closing is useful for filling small holes (pepper noise) within objects and connecting nearby objects that are separated by small gaps, without significantly altering their size and shape.
  • Applications: Mathematical morphology finds applications in various areas, including:
    • Noise reduction (e.g., removing salt-and-pepper noise).
    • Segmentation of objects.
    • Skeletonization and thinning of objects.
    • Feature extraction (e.g., finding corners, holes).
    • Pattern recognition.
    • Medical imaging analysis.
215 marks
a

What is meant by Thresholding? Explain about Optimal Thresholding in detail.

8 marks

Answer

Sign in to view the complete answer paper.

b

Derive an algorithm for finding the edges of binary picture objects by applying a shrink operation and combining the result with the original image.

7 marks

Answer

Sign in to view the complete answer paper.

315 marks
a

Describe the centroidal profile approach to shape analysis. Obtain a general formula expressing the shape a straight line presents in the centroidal profile.

7 marks

Answer

Sign in to view the complete answer paper.

b

Explain how propagation of a distance function may be carried out using a parallel algorithm. Give in full a simpler algorithm that operates using two sequential passes over the image.

8 marks

Answer

Sign in to view the complete answer paper.

415 marks
a

Outline the (r, θ) graph method for recognition of objects in two dimensions and state its main advantages and limitations. Describe the shape of the (r, θ) graph for an equilateral triangle.

9 marks

Answer

Sign in to view the complete answer paper.

b

Explain in detail about Fourier Descriptors.

6 marks

Answer

Sign in to view the complete answer paper.

515 marks
a

Describe the main stages in the application of the HT to locate objects in digital images. What are the particular advantages offered by the HT technique?

8 marks

Answer

Sign in to view the complete answer paper.

b

Explain how Generalized Hough Transform can be used for Feature Coalition.

7 marks

Answer

Sign in to view the complete answer paper.

615 marks
a

Describe the Hough transform approach to object location. Explain its advantages relative to the centroidal (r, θ) plot approach. Illustrate the answer with reference to location of circles of known radius R.

7 marks

Answer

Sign in to view the complete answer paper.

b

Devise a GHT version of the spatial matched filter for detecting lines of known length L. Show that when used to detect an ideal line of length L, it gives a distributed response of length 2L that peaks at the center of the line.

8 marks

Answer

Sign in to view the complete answer paper.

715 marks
a

Explain how Photometric Stereo increases the information available from surface reflectance variations.

8 marks

Answer

Sign in to view the complete answer paper.

b

Discuss in detail about Spline based motion.

7 marks

Answer

Sign in to view the complete answer paper.

815 marks
a

Explain the recognition of Faces using the techniques of Computer Vision.

8 marks

Answer

Sign in to view the complete answer paper.

b

Describe the method of Separation of Foreground and Background using techniques of Computer Vision.

7 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the solved question paper with answers of COMPUTER VISION from Jawaharlal Nehru Technological University Hyderabad for B.Tech ECE IV IV-II, July/August - 2022, R16.

For the question paper without answers, switch to the Question Paper tab.

Other papers in COMPUTER VISION

Loading Question Papers

Fetching data from database...