Motion Understanding: Task-Directed Attention and Representations that Link Perception with Action
International Journal of Computer Vision
Visual search for an object in a 3D environment using a mobile robot
Computer Vision and Image Understanding
| Hi-index | 0.00 |
A new proof is presented of Tsotsos'' result [1] that the VISUAL MATCH problem is NP-complete when no (high-level) constraints are imposed on the search space. Like the proof given by Tsotsos, it is based on the polynomial reduction of the NP-complete problem KNAPSACK [2] to VISUAL MATCH. Tsotsos'' proof, however, involves limited-precision real numbers, which introduces an extra degree of complexity to his treatment. The reduction of KNAPSACK to VISUAL MATCH presented here makes no use of limited-precision numbers, leading to a simpler and more direct proof of the result.