Visual clues that are helpful in computer vision include __________ a) color and motion b) depth and texture c) height and weight d) color and motion, depth and texture

Visual clues that are helpful in computer vision include __________

a) color and motion

b) depth and texture

c) height and weight

d) color and motion, depth and texture
by

1 Answer

Answer :

d) color and motion, depth and texture
by

Related questions

Visual clues that are helpful in computer vision include __________ a) color and motion b) depth and texture c) height and weight d) color and motion, depth and texture

Description : Visual clues that are helpful in computer vision include __________ a) color and motion b) depth and texture c) height and weight d) color and motion, depth and texture

Last Answer : d) color and motion, depth and texture

What can be represented by using histograms or empirical frequency distributions? a) Words b) Color c) Texture d) Both Color & Texture

Description : What can be represented by using histograms or empirical frequency distributions? a) Words b) Color c) Texture d) Both Color & Texture

Last Answer : d) Both Color & Texture

Which are recognized by vision? a) Objects b) Activities c) Motion d) Both Objects & Activities

Description : Which are recognized by vision? a) Objects b) Activities c) Motion d) Both Objects & Activities

Last Answer : d) Both Objects & Activities

A computer vision technique that relies on image templates is __________ a) edge detection b) binocular vision c) model-based vision d) robot vision

Description : A computer vision technique that relies on image templates is __________ a) edge detection b) binocular vision c) model-based vision d) robot vision

Last Answer : c) model-based vision

Area(s) in the visual cortex involved in colour vision include: a. V1 b. V2 c. V3 d. V8

Description : Area(s) in the visual cortex involved in colour vision include: a. V1 b. V2 c. V3 d. V8

Last Answer : V8

Structures involved in colour vision include: a. parvocellular pathway b. superficial layer 4C of visual cortex c. superior collliculi d. geniculate layers 1-2

Description : Structures involved in colour vision include: a. parvocellular pathway b. superficial layer 4C of visual cortex c. superior collliculi d. geniculate layers 1-2

Last Answer : parvocellular pathway

Decision support programs are designed to help managers make __________ a) budget projections b) visual presentations c) business decisions d) vacation schedules

Description : Decision support programs are designed to help managers make __________ a) budget projections b) visual presentations c) business decisions d) vacation schedules

Last Answer : c) business decisions

Decision support programs are designed to help managers make __________ a) budget projections b) visual presentations c) business decisions d) vacation schedules

Description : Decision support programs are designed to help managers make __________ a) budget projections b) visual presentations c) business decisions d) vacation schedules

Last Answer : c) business decisions

Some of the major packaging considerations that marketers take into account include cost, consumer safety, size, shape, color, texture, graphics, consistency in package designs, environmental responsibilities, and A)type of branding supplier. B)competitor's packaging. C)level of demand. D)needs of middlemen. E)stimulated demand.

Description : Some of the major packaging considerations that marketers take into account include cost, consumer safety, size, shape, color, texture, graphics, consistency in package designs, environmental responsibilities, ... competitor's packaging. C)level of demand. D)needs of middlemen. E)stimulated demand.

Last Answer : D)needs of middlemen.

Programming a robot by physically moving it through the trajectory you want it to follow be called __________ a) contact sensing control b) continuous-path control c) robot vision control d) pick-and-place control

Description : Programming a robot by physically moving it through the trajectory you want it to follow be called __________ a) contact sensing control b) continuous-path control c) robot vision control d) pick-and-place control

Last Answer : b) continuous-path control

True statements about the pupil include: a. it is controlled mainly by the autonomic system b. miosis increases the depth of focus for near vision c. a change in the pupil diameter from 2 to 8 mm increases the amount of light entering the eye by 16- fold d. all above

Description : True statements about the pupil include: a. it is controlled mainly by the autonomic system b. miosis increases the depth of focus for near vision c. a change in the pupil diameter from 2 to 8 mm increases the amount of light entering the eye by 16- fold d. all above

Last Answer : all above

If you switch on the anti-collision light in IMC, what are the likely effects? a. Depth perception increases b. You can suffer from dizziness and disorientation c. You can suffer from Color Illusion d. Binocular vision is affected

Description : If you switch on the anti-collision light in IMC, what are the likely effects? a. Depth perception increases b. You can suffer from dizziness and disorientation c. You can suffer from Color Illusion d. Binocular vision is affected

Last Answer : b. You can suffer from dizziness and disorientation

If you switch on the anti-collision light in IMC, what are the likely effects? a. Depth perception increases b. You can suffer from dizziness and disorientation c. You can suffer from Color Illusion d. Binocular vision is affected

Description : If you switch on the anti-collision light in IMC, what are the likely effects? a. Depth perception increases b. You can suffer from dizziness and disorientation c. You can suffer from Color Illusion d. Binocular vision is affected

Last Answer : b. You can suffer from dizziness and disorientation

Though local search algorithms are not systematic, key advantages would include __________ a) Less memory b) More time c) Finds a solution in large infinite space d) Less memory & Finds a solution in large infinite space

Description : Though local search algorithms are not systematic, key advantages would include __________ a) Less memory b) More time c) Finds a solution in large infinite space d) Less memory & Finds a solution in large infinite space

Last Answer : d) Less memory & Finds a solution in large infinite space

The hardware features of LISP machines generally include __________ a) large memory and a high-speed processor b) letter-quality printers and 8-inch disk drives c) a mouse and a specialized keyboard d) large memory and a high-speed processor & a mouse and a specialized keyboard

Description : The hardware features of LISP machines generally include __________ a) large memory and a high-speed processor b) letter-quality printers and 8-inch disk drives c) a mouse and a specialized keyboard d) large memory and a high-speed processor & a mouse and a specialized keyboard

Last Answer : d) large memory and a high-speed processor & a mouse and a specialized keyboard

What enables people to recognize people, animals and inanimate objects reliably? a) Speech b) Vision c) Hear d) Perception

Description : What enables people to recognize people, animals and inanimate objects reliably? a) Speech b) Vision c) Hear d) Perception

Last Answer : b) Vision

Programming a robot by physically moving it through the trajectory you want it to follow is called _____________ a) contact sensing control b) continuous-path control c) robot vision control d) pick-and-place control

Description : Programming a robot by physically moving it through the trajectory you want it to follow is called _____________ a) contact sensing control b) continuous-path control c) robot vision control d) pick-and-place control

Last Answer : b) continuous-path control

Which of the following is not a factor affecting Soil Water Availability? a) A Soil Texture b) B Nature of crop grown c) C Organic Matter d) D Salt content E Soil depth

Description : Which of the following is not a factor affecting Soil Water Availability? a) A Soil Texture b) B Nature of crop grown c) C Organic Matter d) D Salt content E Soil depth

Last Answer : b) B Nature of crop grown

Addition of __________ in steel is helpful in increasing the depth of hardness. (A) Chromium (B) Sulphur (C) Vanadium (D) Tungsten

Description : Addition of __________ in steel is helpful in increasing the depth of hardness. (A) Chromium (B) Sulphur (C) Vanadium (D) Tungsten

Last Answer : (A) Chromium

Which of the basic parts of a robot unit would include the computer circuitry that could be programmed to determine what the robot would do? a) sensor b) controller c) arm d) end effector

Description : Which of the basic parts of a robot unit would include the computer circuitry that could be programmed to determine what the robot would do? a) sensor b) controller c) arm d) end effector

Last Answer : b) controller

Diminished range of motion, loss of flexibility, stiffness, and loss of height are history and physical findings associated with agerelated changes of the a) joints. History and physical findings associated with age-related changes of the joints include diminished range of motion, loss of flexibility, stiffness, and loss of height.

Description : Diminished range of motion, loss of flexibility, stiffness, and loss of height are history and physical findings associated with agerelated changes of the a) joints. History and physical ... resolves with rest, crepitus, joint swelling/enlargement, and degenerative joint disease (osteoarthritis).

Last Answer : a) joints. History and physical findings associated with age-related changes of the joints include diminished range of motion, loss of flexibility, stiffness, and loss of height.

I will be describing a chemical element. Try to identify it with the fewest number of clues. This chemical element is the most abundant of the rare-earth group. The element is a silver-gray metal which oxidizes readily at room temperature and is an important factor in color television tubes. The atomic number of this element is 58. What is this element?

Description : I will be describing a chemical element. Try to identify it with the fewest number of clues. This chemical element is the most abundant of the rare-earth group. The element is a silver-gray metal ... factor in color television tubes. The atomic number of this element is 58. What is this element?

Last Answer : ANSWER: CERIUM (Ce)

Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Last Answer : b) Hidden markov model

Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Description : Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Last Answer : a) Forward state-space search

Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Description : Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Last Answer : d) Unify algorithm

Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Description : Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Last Answer : a) Depth-first search algorithm

Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Description : Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Last Answer : b) Depth-first search

To which depth does the alpha-beta pruning can be applied? a) 10 states b) 8 States c) 6 States d) Any depth

Description : To which depth does the alpha-beta pruning can be applied? a) 10 states b) 8 States c) 6 States d) Any depth

Last Answer : d) Any depth

Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Description : Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Last Answer : c) Alpha-beta pruning

Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Description : Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Last Answer : b) State-space search

Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Description : Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Last Answer : b) Depth-first search algorithm

The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

Description : The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

Last Answer : b) Backtrack search

A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Description : A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Last Answer : c) Best-First-Search

Which search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search

Description : Which search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search

Last Answer : d) A* search

Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned

Description : Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned

Last Answer : c) Metalevel state space

Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

Description : Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Recursive best-first search

Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Description : Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Best-first search

Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search

Description : Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search

Last Answer : a) Informed search

Depth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest d) Minimum cost

Description : Depth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest d) Minimum cost

Last Answer : c) Deepest

The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

Description : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

Last Answer : a) O(bd+1) and O(bd+1)

Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

Description : Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

Last Answer : d) All of the mentioned

Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Description : Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Last Answer : b) Depth-first search

Which search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search

Description : Which search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search

Last Answer : a) Depth-limited search

What is the space complexity of Depth-first search? a) O(b) b) O(bl) c) O(m) d) O(bm)

Description : What is the space complexity of Depth-first search? a) O(b) b) O(bl) c) O(m) d) O(bm)

Last Answer : d) O(bm)

Which search is implemented with an empty first-in-first-out queue? a) Depth-first search b) Breadth-first search c) Bidirectional search d) None of the mentioned

Description : Which search is implemented with an empty first-in-first-out queue? a) Depth-first search b) Breadth-first search c) Bidirectional search d) None of the mentioned

Last Answer : b) Breadth-first search

Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Linear Search d) Optimal search

Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Linear Search d) Optimal search

Last Answer : a) Depth-First Search

The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling Salesman problem c) Map coloring problem d) Depth first search traversal on a given map represented as a graph

Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph

Last Answer : b) Travelling Salesman problem

Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search

Description : Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search

Last Answer : b) Online search

Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Optimal search d) Linear Search

Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Optimal search d) Linear Search

Last Answer : a) Depth-First Search

Write the time & space complexity associated with depth limited search.

Description : Write the time & space complexity associated with depth limited search.

Last Answer : Time complexity =O (bd) ,  b-branching factor,  d-depth of tree Space complexity=o (bl)