Elsevier

Pattern Recognition

Volume 31, Issue 6, 30 June 1998, Pages 727-741
Pattern Recognition

Recognizing 3-D objects by using a Hopfield-style optimization algorithm for matching patch-based descriptions

https://doi.org/10.1016/S0031-3203(97)00105-2Get rights and content

Abstract

A new method is proposed for recognizing 3-D objects by using a Hopfield-style optimization algorithm based on matching patch-based image and model descriptions. To obtain the image descriptions, range images are employed to extract reliable high-level patch features. In the optimization process, the objective function is a Liapunov function which encodes a set of geometric constraints on the descriptions. The optimization is implemented in a Hopfield network with its interconnections encoding the imposed unary, binary and bounding edge constraints. At first, the paper makes an explanation on a new pre-processing method for deriving the required image description. It then presents the structure of the used Hopfield network that is able to recognize multiple model objects all at the same time. Experimental results based on synthetic or real range images are also reported.

Introduction

Recognition of 3-D curved objects is one of serious problems to be solved for machines to understand complex scenes in real environments.[1] According to a common and dominating view in the machine vision community, we can usually divide an on-line recognition process into the following two consecutive stages:2, 3 (1) image description for extracting image features from sensor data; and (2) scene interpretation for fulfilling the recognition task on the basis of a model database (model-base). In such a model-based approach, the recognition is accomplished finally by matching the image descriptions with the object models to reason about the object occurrences and determine the poses (locations and orientations) of the objects in 3-D space.

A prominent characteristic of the model-based approach is its robustness in addressing diversity both of the objects to be recognized and the circumstances surrounding them. By exploiting the a prior model knowledge, we can reduce uncertainties due to object occlusion and errors built up during the pre-processing stage. At the same time, however, there still exist other difficulties we face in constructing systems useful and reliable in practical applications. Two typical ones are: (1) how to derive the image description if many complex objects appear in the image in any poses, overlapping and touching each other; and (2) how to establish the image-and-model correspondence efficiently when a large model base has to be taken into account.

In the paper, we propose a new object recognition method for solving the above two problems by using range images as input data. The central idea is to transform the image-and-model matching problem into a Hopfield-style optimization process.[4] The objective function to be optimized is defined as a Liapunov function that encodes a set of geometric constraints on the features employed in describing the model objects. It is minimized subsequently in an asynchronous Hopfield network with its synaptic interconnection weights encoding the imposed constraints and the neuron states corresponding to the mutual compatibility of image and model feature pairs.

To deal with their 3-D nature, we represent curved objects in terms of their spatial boundary patches. A patch-based description is derived from a range image by a pre-processing procedure which segments the image into isolated patches, determine their types and poses, and extract further more relational features. After that, a Hopfield network is formed with its synaptic weights encoding the unary, binary, and bounding edge similarity of all pairs of image and model patches. It then begins to evolve dynamically until reaching a stable state, which suggests a reasonable global interpretation of the image under consideration. We have made some experiments using synthetic or real images and obtained encouraging results on the practical applicability of the method.

There have been a number of papers that reported researches similar with ours each in a certain aspect. A brief review on the related work is given in the next section. Our method, however, has the following new and important contributions:

  • 1.

    (1) We developed a systematic approach to the object recognition problem, starting from pre-processing of raw image data. The proposed image description method is effective for range images and has bceen practically applied for processing and analyzing real complex images.

  • 2.

    (2) The Hopfield network used here for matching patch-based image and model descriptions has some new features that have not been mentioned thus far in the vision literature. In particular, it exploited successfully the negative evidence of patches between different models for the purpose of enforcing uniqueness constraints on the patch compatibility. For the reason, we not only improved the reliability of the recognition of single objects but also succeeded in recognizing multiple objects simultaneously from a complicated object pile.

Moreover, although it is designed for range images as the immediate input, the method can also be extended with minor modifications for other types of 3-D data, such as needle images.[5] It is also possible to extend it to scene descriptions including such 2-D features as vertices and edges.

The paper is organized as follows: Section 2gives a preliminary statement on the problem of object recognition using patch-based descriptions and then introduce some related work. Section 3presents the method of deriving the patch-based image description from dense range data. Section 4explains the detailed Hopfield-style optimization algorithm used for matching the image and model descriptions. In Section 5we show some experimental results, and in Section 6, we make several concluding remarks and point out open problems.

Section snippets

Patch-based recognition

Spatial boundaries of a large percentage of manufactured parts are formed by a small number of primitive surface patches bounded by 3-D edges. The objects can be perfectly represented or well approximated by a set of the patches that are further described with some patch attributes.[6]Fig. 1 gives an illustration of the boundary representation (B-rep) scheme for an simple object. In general, an object M(t) whose surface is composed=of patches P(t)m1,P(t)m2,,P(t)mMt can be represented asM(t)={P

Image segmentation

To describe an image, it is necessary to first segment it to parts that each correspond with a three dimensionally isolated patch. Our segmentation method follows the bottom-up, clustering and merging approach and consists of the following two phases.

Hopfield-style recognition

As stated in earlier discussions, a key step of the object recognition using patch-based descriptions is to search out a subset of image patches that bear the largest similarity with the model patches. This is finally accomplished by using a Hopfield network, which is built from a single layer of neurons with feedback connection from each neuron to others. The weights on the connection are confined to be symmetrical. Generally, a problem to be solved by a Hopfield network can be characterized

Results of experiments

We have applied the above method in a variety of experiments, and results from three of them are given in the following. The first one is based on simulation data to show the improvement of the algorithm when the negative supporting effects of patches on different models are employed. The second uses a simple real range image to illustrate the possibility of the method in practical applications, and the third aims to recognize multiple objects simultaneously in a complex real image.

In the

Conclusion

In this paper, we presented a Hopfield-style object recognition algorithm on the basis of patch-based image and model descriptions. It is an interesting and very important attempt to develop new feature matching methods that can be implemented in parallel algorithms. The matching based on ANNs provides a potential paradigm for designing such algorithms, in particular for dealing with occlusion and other uncertainties underlying in a 3-D recognition task. Our method is based on the classic

Summary

The paper proposes a new model-based approach to recognition of 3-D curved objects from range images including complex objects which may hide or touch each other. Conceptually, the basic idea here is to transform the recognition problem into an optimization process to establish reasonable correspondences between patch-based image and model descriptions. The optimization is then solved by utilizing a Hopfield network with its interconnections encoding a set of geometric and physical constraints

About the Author—HONGBIN ZHA was born in Anhui, China, in 1962. He received the B.E. degree in electrical engineering from Hefei University of Technology, China, in 1983, and the M.S. and Ph.D. degrees in electrical engineering from Kyushu University, Japan, in 1987 and 1990, respectively.

Form 1990 to 1991, he was a Research Associate in the Department of Control Engineering and Science at Kyushu Institute of Technology, Japan. Then, he joined the Department of Computer Science and

References (35)

  • W.E.L. Grimson

    On recognition of curved objects

    IEEE Trans. Pattern Anal. Mach. Intell.

    (1989)
  • T.J. Fan et al.

    Recognizing 3-D objects using surface description

    IEEE Trans. Pattern Anal. Mach. Intell.

    (1989)
  • S.M. Bhandarkar

    A surface feature attributed hypergraph representation for 3-D object recognition

    Int. J. Pattern Recognition Artificial Intell.

    (1995)
  • T. Nagata et al.

    Recognizing and locating a known object from multiple images

    IEEE Trans. Robotics Automat.

    (1991)
  • A. C. Kak and J. L. Edwards, Experimental state of the art in 3D object recognition and location using range data,...
  • C. Dorai and A. K. Jain, COSMOS — a representation scheme for free-form surfaces, Proc. Int. Conf. CV, pp. 1024–1029...
  • R.A. Hummel et al.

    On the foundation of relaxation labeling processes

    IEEE Trans. Pattern Anal. Mach. Intell.

    (1983)
  • Cited by (4)

    About the Author—HONGBIN ZHA was born in Anhui, China, in 1962. He received the B.E. degree in electrical engineering from Hefei University of Technology, China, in 1983, and the M.S. and Ph.D. degrees in electrical engineering from Kyushu University, Japan, in 1987 and 1990, respectively.

    Form 1990 to 1991, he was a Research Associate in the Department of Control Engineering and Science at Kyushu Institute of Technology, Japan. Then, he joined the Department of Computer Science and Communication Engineering, Kyushu University, as an Associate Professor. He is currently an Associate Professor in the Department of Intelligent Systems, Graduate School of Information Science and Electrical Engineering, at Kyushu University. His research interests include computer vision, model generation, neural networks, and sensor-based manipulation.

    Dr. Zha is a member of the Japanese Society of Instrument and Control Eugineers, the Robotics Society of Japan, Information Processing Society of Japan, IEEE, IEEE Computer Society, and IEEE Robotics and Automation Society, etc.

    About the Author—HIDEKI NANAMEGI was born in Kagoshima, Japan, in 1970. He received the B.E. in electrical engineering from Kagoshima University in 1992, the M.E. in electrical engineering from Kyushu University in 1994. He is now working in Asahi Glass Co., Ltd., Chiba, Japan.

    About the Author—TADASHI NAGATA was born in Fukuoka, Japan, in 1932. He received the B.E., M.E., and Ph.D. degrees in electrical engineering from Kyushu University in 1956, 1958, and 1965, respectively.

    From 1959 to 1980 he held various positions in research at the Electrotechnical Laboratory of the Japanese Government, including Chief of the Information and Control Section. From 1980 to 1991 he was a Professor in the Department of Electrical Engineering, Kyushu University, from 1991 to 1996, a Professor of Computer Science and Communication Engineering at the same university. He is currently President of Institute of Systems and Information Technologies/KYUSHU, Fukuoka, Japan. His research interests are robotics, computer vision, and machine intelligence.

    Prof. Nagata is a member of the Robotics Society of Japan, the Japanese Society of Instrument and Control Engineers, and Information Processing Society of Japan, etc.

    View full text