default search action
Computer Vision, Graphics, and Image Processing, Volume 22
Volume 22, Number 1, April 1983
- Ellen C. Hildreth:
The detection of intensity changes by computer and biological vision systems. 1-27 - Robert M. Haralick:
Ridges and valleys on digital images. 28-38 - W. Eric L. Grimson:
An implementation of a computational theory of visual surface interpolation. 39-69 - Michael Brady, Berthold K. P. Horn:
Rotationally symmetric operators for surface interpolation. 70-94 - Dana H. Ballard, O. A. Kimball:
Rigid body motion from depth and optical flow. 95-115 - Daryl T. Lawton:
Processing translational motion sequences. 116-144 - Steven A. Shafer, Takeo Kanade:
Using shadows in finding surface orientations. 145-176 - Hsien-Che Lee, King-Sun Fu:
3-D shape from contour and selective confirmation. 177-193 - Julian R. Ullmann:
An investigation of occlusion in one dimension. 194-203 - Samuel M. Goldwasser, Donald E. Troxel:
Page composition of continuous tone imagery. Comput. Vis. Graph. Image Process. 22(1): 204 (1983) - Charles Nash, Narendra Ahuja:
Octree representations of moving objects. Comput. Vis. Graph. Image Process. 22(1): 204 (1983) - Carlo Arcelli, Gabriella Sanniti di Baja:
An approach to figure decomposition using width information. Comput. Vis. Graph. Image Process. 22(1): 204 (1983) - William I. Grosky:
Towards a data model for integrated pictorial databases. Comput. Vis. Graph. Image Process. 22(1): 205 (1983) - A. R. Gourlay:
Gray scale simulation on a color display. Comput. Vis. Graph. Image Process. 22(1): 205 (1983) - Ken-ichi Kanatani:
Errors of the incremental method for curves. Comput. Vis. Graph. Image Process. 22(1): 205 (1983)
Volume 22, Number 2, May 1983
- D. T. Lee:
Visibility of a simple polygon. 207-221 - Ramon F. Sarraga:
Algebraic methods for intersections of quadric surfaces in GMSOLID. 222-238 - K. Prazdny:
On the information in optical flows. 239-259 - John M. Einbu:
Nonlinear reduction of data. 260-267 - Zenon Kulpa:
More about areas and perimeters of quantized objects. 268-276 - Seymour Shlien:
Segmentation of digital curves using linguistic techniques. 277-286 - Ronald Lumia, Linda G. Shapiro, Oscar A. Zuniga:
A new connected components algorithm for virtual memory computers. 287-300 - Virginio Cantoni, Stefano Levialdi:
Matching the task to an image processing architecture. 301-309 - Jia-Qi Fang, Thomas S. Huang:
Solving three-dimensional small-rotation motion equations: Uniqueness, algorithms, and numerical results. Comput. Vis. Graph. Image Process. 22(2): 310 (1983) - Leonard A. Ferrari, Jack Sklansky:
A fast recursive algorithm for binary valued two-dimensional filters. Comput. Vis. Graph. Image Process. 22(2): 310 (1983) - D. F. Watson, G. M. Philip:
Systematic triangulations. Comput. Vis. Graph. Image Process. 22(2): 310 (1983) - Katsushi Inoue, Itsuo Takanami, Akira Nakamura:
Connected pictures are not recognizable by deterministic two-dimensional on-line tessellation acceptors. Comput. Vis. Graph. Image Process. 22(2): 310-311 (1983) - Akira Nakamura, Kunio Aizawa:
Digital circles. Comput. Vis. Graph. Image Process. 22(2): 311 (1983) - Michael S. Landy, Yoav Cohen:
A UNIX*-based image processing system. Comput. Vis. Graph. Image Process. 22(2): 311 (1983)
Volume 22, Number 3, June 1983
- Charles W. Therrien:
An estimation-theoretic approach to terrain image segmentation. 313-326 - W. Randolph Franklin:
Rays - New representation for polygons and polyhedra. 327-338 - Azriel Rosenfeld:
Picture processing: 1982. 339-377 - Robert M. Haralick:
An interpretation for probabilistic relaxation. 388-395 - Amar Mitiche, Jake K. Aggarwal:
Contour registration by shape-specific points for shape matching. 396-408 - John A. Stuller, Clare D. McGillem:
Correction of a statement inDigital picture processing. 409
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.