Hostname: page-component-5b777bbd6c-gtgcz Total loading time: 0 Render date: 2025-06-17T09:57:00.228Z Has data issue: false hasContentIssue false
  • English
  • Français

Algorithms for simple object reconstruction using the largest possible object approach*

Published online by Cambridge University Press:  09 March 2009

Edward T. Lee  and
Fred Y. Wu
Edward T. Lee
Affiliation:
Department of Electrical and Computer Engineering, Florida International University, University Park Campus, Miami, Florida 33199 (USA).
Fred Y. Wu
Affiliation:
Department of Electrical and Computer Engineering, University of Miami, P.O. Box 248294, Coral Gables, Florida 33124 (USA).
Get access Rights & Permissions [Opens in a new window]

Summary

Recently, three-dimensional motion analysis and shape recovery have attracted growing attention as promising avenues of approach to image understanding, object reconstruction as well as computer vision for robotic Systems. The image generation problem and the model generation problem are presented. More specifically, the inputs to the image generator are an old image, object model, motion specification, and hidden line and hidden surface algorithms. The output is a new image. Since the object model is given, the top-down approach is usually used. On the other hand, for the model generation problem, the input is an image sequence while the output is an object model. Since the object model is not given, and bottom-up approach is usually used.

In this paper, the largest possible object approach is proposed and the advantages of this approach are stated. They are:

1. This approach may be applicable to objects with planar surfaces as well as nonplanar surfaces.

2. This approach may be applicable to the case that there are more than one face change per frame.

3. This approach may be applicable when the camera is moving.

4. This approach may be applicable when the object is measured by several measuring stations.

By using this approach, algorithms for simple object reconstruction given a sequence of pictures are presented together with illustrative examples. The relevance and importance of this work are discussed.

The results of this paper may have useful applications in object reconstruction, pictorial data reduction and computer vision for robotic Systems.

Type
Article
Information
Robotica , Volume 10 , Issue 4 , July 1992 , pp. 377 - 381
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Young, T.Y. and Gunasekaran, S., “A Regional Approach to Tracking 3D Motion in an Image Sequence” In: Advances in Computer Vision and Image Processing 3, 63–99 (1988).Google Scholar
2.Fairhurst, M.C., Computer Vision for Robotic Systems An Introduction (Prentice Hall International, (UK) Ltd., Hemel Hempstead, Hertfordshire, 1988).Google Scholar
3.Lee, E.T., “Pictorial Knowledge Representation Using Pictorial Semantic Networks” Robotica 6, Part 2, 155–160 (1988).CrossRefGoogle Scholar
4.Lee, E.T. et al. , “Pictorial Knowledge and Space Object Surveillance and Identification” In: Advances in Artificial Intelligence Research, (Fishman, M.B., Ed.,) (Jai Press Inc., Greenwich, CN, 1989) pp. 309–345.Google Scholar
5.Lee, E.T., Chu, P. and Wu, C. Peng, “Applications of Entity-Relationship Model to Picture Description” Robotica 5, Part 3, 231–234 (1987).CrossRefGoogle Scholar
6.Lee, E.T., “Relationship Hierarchy for Picture Representation Using Entity-Relationship Diagrams”, Kybernetes 17, No. 3, pp. 45–51 (1988).CrossRefGoogle Scholar
7.Lee, E.T. and Chu, P., “Two Dimensional Grammars for Generating Squares and Rhombuses”, Kybernetes 16, 121–123 (1987).CrossRefGoogle Scholar
8.Lee, E.T. et al. , “Generating Rectangles Using Two-Dimensional Grammars with Time and Space Complexity Analyses” International Journal Pattern Recognition and Artificial Intelligence 3, No. 3, 321–332 (09, 1989). Also in the book entitled Array Grammars, Patterns and Recognizers (P. S. P. Wang. Ed.) (World Scientific Publishing Co., Singapore, 1989) pp. 43–54.CrossRefGoogle Scholar
9.Lee, E.T., “On Two-Dimensional Programmed Grammars” Robotics 3, 427–43 (1987).CrossRefGoogle Scholar
10.Lee, E.T., Pan, Y.J. and Chu, P., “An Algorithm for Region Filling Using Two-Dimensional Grammars” Int. J. Intell. Systems 2, 255–263 (1987).Google Scholar
11.Lee, E.T., “On Average Turnaround Time”, Kybernetes 19, No. 1, 46–58 (1990).CrossRefGoogle Scholar
12.Lee, E.T. and Harjardi, S., “Volume/Surface Octree Generation and Applications”, In: Advances in Artificial Intelligence Research (Fishman, M. B., Ed.) (Jai Press Inc., Greenwich, CN, 1989) pp. 251–264.Google Scholar
13.Lee, E.T., “Space Object Surveillance and Identification”, Policy Analysis and Information Systems 3, No. 1, 171–185 (1979).Google Scholar
14.Gagliardi, R.M., Satellite Communications (Van Nostrand Reinhold, New York, NY, 1991).Google Scholar
15.Lee, E.T., “Algorithms for Multitarget Ambiguity Removal After Coincidence Detection” IEEE Trans. Aerospace and Electronic Systems AES-12, No. 3, 397–401 (05, 1976).Google Scholar
16.Lee, Edward T., “Pictorial Data Compression Techniques”, In: 1991 Navy Data Compression Conference ProceedingsSnowbird, Utah, pp. XII–1, to XII–4 (04 11, 1991).Google Scholar