Scalable data parallel object recognition using geometric hashing on CM-5

Presents scalable parallel algorithms for object recognition using geometric hashing. We define an abstract model of the CM-5 computer. We develop a load balancing technique that results in scalable processor-time optimal algorithms for performing a probe on the CM-5 model. Given a model of a CM-5 with P processor nodes and a set S of feature points in a scene, a probe of the recognition phase can be performed in O(|V(S)|)/P) time, where V(S) is the set of votes cast by feature points in S. This algorithm is scalable in the range 1/spl les/P/spl lesspl radic/[|V(S)|/log|V(S)|]. These results do not assume any distributions of hash bin lengths or scene points. The implementations developed in this paper require a number of processors which is independent of the size of the model database and which is scalable with the machine size.<<ETX>>

[1]  Gerard Medioni,et al.  Object recognition using geometric hashing on the Connection Machine , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[2]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[3]  Haim J. Wolfson,et al.  Model-Based Object Recognition by Geometric Hashing , 1990, ECCV.

[4]  William Grimson,et al.  Object recognition by computer - the role of geometric constraints , 1991 .

[5]  Viktor K. Prasanna,et al.  Scalable Data Parallel Implementations of Object Recognition Using Geometric Hashing , 1994, J. Parallel Distributed Comput..

[6]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.

[7]  Viktor K. Prasanna,et al.  Low level vision processing on connection machine CM-5 , 1993, 1993 Computer Architectures for Machine Perception.

[8]  Yehezkel Lamdan,et al.  Geometric Hashing: A General And Efficient Model-based Recognition Scheme , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[9]  Robert A. Hummel,et al.  Massively parallel model matching: geometric hashing on the Connection Machine , 1992, Computer.

[10]  W. Daniel Hillis,et al.  The Network Architecture of the Connection Machine CM-5 , 1996, J. Parallel Distributed Comput..

[11]  Viktor K. Prasanna,et al.  Scalable parallel implementations of perceptual grouping on connection machine CM-5 , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 2 - Conference B: Computer Vision & Image Processing. (Cat. No.94CH3440-5).