- Email: [email protected]
Abstracts of papers accepted for publication
COMPUTER VISION, GRAPHICS,AND IMAGEPROCESSING40, 398-399 (1987)
Abstracts of Papers Accepted for Publication PAPERS The Grammar oI Dimensions in Machine Drawings. DOV DoRI AND AMIR PNU~I.1. Faculty of Mathematics, Department of Computer Science, The Weizmaun Institute of Science, Rehovot 76100, Israel, Received August 25, 1986; revised July 29, 1987.
Dimensioning is an important constituent in machine drawings. Recognition of dimensions in machine drawings is a prerequisite for the development of a machine drawing understanding system (MDUS), which is a special class of image understanding systems (IUSs). The approach proposed in this work is a syntactic analysis of the dimensions, which are represented by undirected, labeled graphs called "webs." Utilizing the conventions of web grammar, a set of web rewriting rules is established, which specify how all the possible dimension-sets can be generated and detected. The recognition process starts by detecting arrows using statistical methods. The location and orientation of the arrows together with rewriting rules of the dimensioning grammar are used to detect the rest of the components and the tree structure of the corresponding dimension set.
Approximation of Displacement Fields Using Wauefront Region Growing. BIR BHANU AND WILHELM BURGER. Department of Computer Science, University of Utah, Salt Lake City, Utah 84112. Received July 10, 1986; accepted August 10, 1987. This paper presents a novel approach for the computation of displacement fields along contours which correspond to moving homogeneous regions in an image sequence. Individual frames of the image sequence are treated one at a time by performing segmentation and 2D motion analysis simultaneously. For the first frame, an original segmentation of the image into disjoint regions is assumed to be given in the form of pixel markings and the properties of these regions. The analysis of each new frame consists of ( a ) finding the new segmentation and (b) a set of displacement vectors that link corresponding points on the original and the new contour. The new region is assumed to overlap with the original region, such that their intersection is not empty. After finding the intersection, wavefront region growing is applied to obtain the new region and to compute a set of tentative displacement vectors. The final approximation is found by using a relaxation-type algorithm which "rotates" the mapping between the original and the new boundary until a con'espondence with minimum deformation is found. The proposed algorithm is simple and lends itself to parallel implementation. Various examples are presented to illustrate the approach.
Region Filling with the Use of the Discrete Green Theorem. GREGORY Y. TANG. Department of Computer Science and Information Engineering, National Taiwan University, Republic of China. BRIAN LIEN. Department of Electrical Engineering, National Taiwan University, Republic of China. Received August 22, 1986; accepted September 2, 1987.
A method for filling a region whose boundary is represented by the Freeman code is presented. The method makes use of the discrete Green theorem. There is no application limitation on the proposed method. This method can als0 be generalized to cover a wider range of problems where the boundary is not limited to be in the form of the Freeman code, as long as the boundary to be represented is in sequence. The method is applied in an image cut-and-paste program. Comparison of the proposed method and some existing methods is also provided. 398 0734-189X/87 $3.00 Copyright 9 1987 by AcademicPress, Inc. All rights of reproduction in any form reserved.
ABSTRACTS OF PAPERS ACCEPTED FOR PUBLICATION
399
SURVEY ROLANDT. CHIN. Electrical and Computer Engineering Department, University of Wisconsin, Madison, Wisconsin 53706. Received March 16, 1987; accepted September 3, 1987.
Automated Visual Inspectiom. 1981 to 198Z
This bibliography lists journal publications, conference papers, research technical reports, and articles from trade journals on automated visual inspection for industry which were published during the years from 1981 to 1987. More than 600 references are included. References are organized into 13 categories according to subject matter. The categories are (1) books, (2) conferences and workshops, (3) general discussions and surveys, (4) inspection of printed circuit patterns, (5) inspection of solder joints, (6) inspection of microcircuit photomasks, (7) inspection of integrated circuits and hybrids, (8) inspection of other electrical and electronics components, (9) surface inspection, (10) X-ray inspection, (11) other inspection applications, (12) system components, and (13) inspection algorithms. References listed in each category are arranged in chronological order. The purpose is primarily to provide a complete bibliography for those interested in automated visual inspection. Some general observations have been made for the above areas of activity summarizing the advances that have taken place and the problems that remain to be solved.
NOTE Some Algorithms for Approximating Convolutions. DIANNEP. O'LEARY. Mathematical Analysis Division, National Bureau of Standards, Galthersburg, Maryland 20899 and Computer Science Department and Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland 20742. Received July 9, 1986; accepted September 3, 1987. This paper presents some algorithms for approximating two-dimensional convolution operators of size n X n, n odd, by a product, or sum of products, of 3 x 3 convolutions. Inaccuracies resulting from the approximation as well as from fixed point computation are discussed and examples are given.
Abstracts of Papers Accepted for Publication PAPERS The Grammar oI Dimensions in Machine Drawings. DOV DoRI AND AMIR PNU~I.1. Faculty of Mathematics, Department of Computer Science, The Weizmaun Institute of Science, Rehovot 76100, Israel, Received August 25, 1986; revised July 29, 1987.
Dimensioning is an important constituent in machine drawings. Recognition of dimensions in machine drawings is a prerequisite for the development of a machine drawing understanding system (MDUS), which is a special class of image understanding systems (IUSs). The approach proposed in this work is a syntactic analysis of the dimensions, which are represented by undirected, labeled graphs called "webs." Utilizing the conventions of web grammar, a set of web rewriting rules is established, which specify how all the possible dimension-sets can be generated and detected. The recognition process starts by detecting arrows using statistical methods. The location and orientation of the arrows together with rewriting rules of the dimensioning grammar are used to detect the rest of the components and the tree structure of the corresponding dimension set.
Approximation of Displacement Fields Using Wauefront Region Growing. BIR BHANU AND WILHELM BURGER. Department of Computer Science, University of Utah, Salt Lake City, Utah 84112. Received July 10, 1986; accepted August 10, 1987. This paper presents a novel approach for the computation of displacement fields along contours which correspond to moving homogeneous regions in an image sequence. Individual frames of the image sequence are treated one at a time by performing segmentation and 2D motion analysis simultaneously. For the first frame, an original segmentation of the image into disjoint regions is assumed to be given in the form of pixel markings and the properties of these regions. The analysis of each new frame consists of ( a ) finding the new segmentation and (b) a set of displacement vectors that link corresponding points on the original and the new contour. The new region is assumed to overlap with the original region, such that their intersection is not empty. After finding the intersection, wavefront region growing is applied to obtain the new region and to compute a set of tentative displacement vectors. The final approximation is found by using a relaxation-type algorithm which "rotates" the mapping between the original and the new boundary until a con'espondence with minimum deformation is found. The proposed algorithm is simple and lends itself to parallel implementation. Various examples are presented to illustrate the approach.
Region Filling with the Use of the Discrete Green Theorem. GREGORY Y. TANG. Department of Computer Science and Information Engineering, National Taiwan University, Republic of China. BRIAN LIEN. Department of Electrical Engineering, National Taiwan University, Republic of China. Received August 22, 1986; accepted September 2, 1987.
A method for filling a region whose boundary is represented by the Freeman code is presented. The method makes use of the discrete Green theorem. There is no application limitation on the proposed method. This method can als0 be generalized to cover a wider range of problems where the boundary is not limited to be in the form of the Freeman code, as long as the boundary to be represented is in sequence. The method is applied in an image cut-and-paste program. Comparison of the proposed method and some existing methods is also provided. 398 0734-189X/87 $3.00 Copyright 9 1987 by AcademicPress, Inc. All rights of reproduction in any form reserved.
ABSTRACTS OF PAPERS ACCEPTED FOR PUBLICATION
399
SURVEY ROLANDT. CHIN. Electrical and Computer Engineering Department, University of Wisconsin, Madison, Wisconsin 53706. Received March 16, 1987; accepted September 3, 1987.
Automated Visual Inspectiom. 1981 to 198Z
This bibliography lists journal publications, conference papers, research technical reports, and articles from trade journals on automated visual inspection for industry which were published during the years from 1981 to 1987. More than 600 references are included. References are organized into 13 categories according to subject matter. The categories are (1) books, (2) conferences and workshops, (3) general discussions and surveys, (4) inspection of printed circuit patterns, (5) inspection of solder joints, (6) inspection of microcircuit photomasks, (7) inspection of integrated circuits and hybrids, (8) inspection of other electrical and electronics components, (9) surface inspection, (10) X-ray inspection, (11) other inspection applications, (12) system components, and (13) inspection algorithms. References listed in each category are arranged in chronological order. The purpose is primarily to provide a complete bibliography for those interested in automated visual inspection. Some general observations have been made for the above areas of activity summarizing the advances that have taken place and the problems that remain to be solved.
NOTE Some Algorithms for Approximating Convolutions. DIANNEP. O'LEARY. Mathematical Analysis Division, National Bureau of Standards, Galthersburg, Maryland 20899 and Computer Science Department and Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland 20742. Received July 9, 1986; accepted September 3, 1987. This paper presents some algorithms for approximating two-dimensional convolution operators of size n X n, n odd, by a product, or sum of products, of 3 x 3 convolutions. Inaccuracies resulting from the approximation as well as from fixed point computation are discussed and examples are given.