Parallel coordination of image operators based on shared-memory architecture

Several types of parallelism that may be exploited in vision algorithms based on a state-space search are identified. A method called the V* algorithm, which generates the successors of a state in parallel, is presented. In machine vision, this part of the search process is very expensive, and thus V* permits substantial speedup. An experimental evaluation of V* which is based on a simulation of a character-recognition algorithm is presented. The simulation runs on a Sequent Balance 21000, using 16 out of 20 processors.<
>