NPTEL Robotics Week 7 Assignment Answers:- In this post, we have provided the answers to the NPTEL Robotics Week 7. All the answers are provided here on the basis of data available on the internet.
NPTEL Robotics Week 7 Assignment Answers 2022
Q1. In computer vision, which one of the following methods is not associated with preprocessing?
- a. Masking
- b. Neighborhood Averaging
- c. Thresholding
- d. Median Filtering
Answer:- c
Q2. In computer vision, the purpose of using edge detection is to
- a. store image as an array of pixels.
- b. convert analog information of light intensity into digital form.
- c. remove noise from the image.
- d. identify the edge of an object present on a background.
Answer:- d
Q3. Which one of the following statements is FALSE related to computer vision?
- a. The purpose of frame grabbing is to store image as an array of pixels.
- b. Gradient operator is used in thresholding operation.
- c. The purpose of preprocessing is to remove noise from the image.
- d. Chain codes are generally used to represent the boundary of an object.
Answer:- b
Q4. In computer vision, Laplacian operator is utilized for
- a. edge detection
- b. thresholding
- c. frame grabbing
- d. preprocessing
Answer:- a
Q5. Fine motion planning problem is known as
- a. Gross motion planning problem
- b. Compliant motion planning problem
- c. Free space motion planning problem
- d. Trajectory planning problem
Answer:- b
Q6. The purpose of Robot’ s motion planning is
- a. to ensure dynamic balance of the robot.
- b. to ensure kinematic balance of the robot.
- c. to determine the course of actions, while moving from an initial position to final position.
- d. to ensure smooth variation at the robotic joint
Answer:- c
Q7. The motion planning scheme, in which the visible vertices of the static obstacles are connected by a graph is called
- a. Voronoi Diagram
- b. Visibility Graph
- c. Cell Decomposition
- d. Tangent Graph
Answer:- b
Q8. Which one of the following statements is FALSE about traditional methods of robot motion planning?
- a. Tangent graph technique has the highest probability of obtaining the distance optimal path, while solving the find-path problem.
- c. Voronoi diagram represents the locus of points, which are equidistant from at least two of the obstacles and/or field boundaries.
- c. Tangent graph technique is applicable to all the motion planning problems.
- d. Traditional methods of robot motion planning are computationally expensive even for a simple problem.
Answer:- c
Q9. The motion planning scheme, in which the visible vertices of the static obstacles are connected by a graph is called
- a. Voronoi Diagram
- b. Visibility Graph
- c. Cell Decomposition
- d. Tangent Graph
Answer:- d
Q10. Image of an object is represented in digital form by the light intensities at different pixels, as given below.
The pre-processed data corresponding to second row and third column element, that is, 62 obtained by using a 3 x3 mask (as given below) is found to be cqual to
- a) 82
- b) 68
- c)78
- d) 86
Answer:- a
Important Links:-
NPTEL Robotics Week 6 Assignment Answers:- In this post, we have provided the answers to the NPTEL Robotics Week 6. All the answers are provided here on the basis of data available on the internet.