This paper presents a new high-speed three-dimensional (3-D) object recognition system based on two-dimensional (2-D) chain code matching. An observed 3-D object is precisely represented by a 2-D chain code sequence from the discrete surface points of the 3-D object, so that any complex objects can be recognized precisely. Moreover, the normalization procedures such as translation, rotation of 3-D objects except scale changes can be preformed systematically and regularly regardless of the complexity of the shape of 3-D objects, because almost all the normalization procedures of 3-D objects are included in the 2-D chain code matching procedure. As a result, the additional normalization procedure becomes only the processing time for scale changes which can be performed easily by normalizing the length of the chain code sequence. In addition, the fast Fourier transformation (FFT) is applicable to 2-D chain code matching which calculates cross correlation between an input object and a reference model, so that very fast recognition is performed. In fact, it is demonstrated that the total recognition time of a 3-D object is estimated at 5.35 (sec) using the 28.5-MIPS SPARC workstation.
|Number of pages
|IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
|Published - 1993 Jun