{"title":"Computing depth from out-of-focus blur using a local frequency representation","authors":"Mats Gokstorp","doi":"10.1109/ICPR.1994.576248","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576248","url":null,"abstract":"We present a method to compute depth from the amount of defocus in two images obtained from the same view-point but with different camera parameter settings. The change in defocus (blur) between the two images is proportional to the depth in the scene. We introduce a novel method to estimate the blur using a multiresolution local frequency representation of the input image pair. A confidence measure is used to discriminate between high error and low error blur estimates. Quantitative experimental results are shown for both real and synthetic images.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122685640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A two-dimensional edge detection scheme for general visual processing","authors":"R. J. Qian, Thomas S. Huang","doi":"10.1109/ICPR.1994.576371","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576371","url":null,"abstract":"This paper presents a new two-dimensional (2D) edge detection scheme for general visual processing. The scheme constructs a 2D edge detection functional under the guidance of the Laplacian of Gaussian (LOG) zero crossing contours to detect edges. The detection functional is optimal in terms of signal-to-noise ratio (SNR) and edge localization accuracy (ELA) for detecting edges in 2D images; it also preserves the nice scaling property that is held uniquely by the LOG operator in scale space. The scheme also provides: (1) an edge regularization procedure; (2) an adaptive edge thresholding procedure; and (3) a scale space combining procedure. Experimental results on real images are given in the paper.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129377760","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Geometric invariant of noncoplanar lines in a single view","authors":"A. Sugimoto","doi":"10.1109/ICPR.1994.576255","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576255","url":null,"abstract":"The importance of geometric invariants to many machine vision tasks, such as model-based recognition, has been recognized. A number of studies on geometric invariants in a single view concentrate on coplanar objects: coplanar points, coplanar lines, coplanar conics, etc. Therefore, it is essentially only to 2-D objects that we can apply methods using geometric invariants. This paper presents a study on geometric invariants of noncoplanar objects, i.e., 3-D objects. A new geometric invariant is derived from six lines on three planes in a single view. The condition under which the invariant is nonsingular is also described. In addition, we present some experimental results with real images and find that the values of the invariant over a number of viewpoints remain stable even for noisy images.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116306321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"3-D object recognition using MEGI model from range data","authors":"H. Matsuo, A. Iwata","doi":"10.1109/ICPR.1994.576466","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576466","url":null,"abstract":"Description and recognition of objects is the central considerations of research on computer vision. The key issue is how to represent 3D objects on a machine for recognizing them. Researchers of computer vision commonly employ the extended Gaussian image (EGI) model, but it is not able to express concave objects. In this paper, an MEGI(more EGI) model and coefficient of extended spherical correlation have been proposed. The MEGI model is an, extended EGI modeling which is able to represent concave objects. The extended spherical correlation is a measure for recognizing objects using the MEGI model. It has been demonstrated that this model is able to recognize 3D objects, including concave ones, and to distinguish objects using a part of MEGI from range data.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116335383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ISR3: communication and data storage for an unmanned ground vehicle","authors":"B. Draper, G. Kutlu, E. Riseman, A. Hanson","doi":"10.1109/ICPR.1994.576461","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576461","url":null,"abstract":"Computer vision researchers working in mobile robotics and other real-time domains are forced to confront issues not normally addressed in the computer vision literature. Among these are: communications or how to get data from one process to another; data storage and retrieval (primarily for transient image-based data); and database management for maps, object model and other permanent (typically 3D) data. This paper reviews efforts at CMU, SRI and UMass to build real-time computer vision systems for mobile robotics, and presents a new tool, called ISR3, for communications, data storage/retrieval and database management on the UMass Mobile Perception Laboratory (MPL), a NAVLAB-like autonomous vehicle.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116844562","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Relaxation labeling of Markov random fields","authors":"S. Li, Han Wang, M. Petrou","doi":"10.1109/ICPR.1994.576334","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576334","url":null,"abstract":"Using Markov random field (MRF) theory, a variety of computer vision problems can be modeled in terms of optimization based on the maximum a posteriori (MAP) criterion. The MAP configuration minimizes the energy of a posterior (Gibbs) distribution. When the label set is discrete, the minimization is combinatorial. This paper proposes to use the continuous relaxation labeling (RL) method for the minimization. The RL converts the original NP complete problem into one of polynomial complexity. Annealing may be combined into the RL process to improve the quality (globalness) of RL solutions. Performance comparison among four different RL algorithms is given.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115210608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A robust and stable road model","authors":"S. Richter, D. Wetzel","doi":"10.1109/ICPR.1994.576439","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576439","url":null,"abstract":"In this paper a robust and stable model for road detection and road following in traffic scenes is proposed. Scene analysis consists of an initial phase, in which objects are recognized for the first time, and a phase of object tracking with simultaneous object recognition. Road surface analysis is done by means of an explicit model for the road shape that is adjusted stepwise to image regions. In the tracking phase the adjusted model is used for robust model-based segmentation of the road surface. For a reliable analysis of scenes containing obstacles, the system is equipped with a look-ahead mechanism.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"275 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115248113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
B. Dom, David Steele, D. Petkovic, Lionel Kuhlmann
{"title":"Algorithms for automatic disk head/slider inspection","authors":"B. Dom, David Steele, D. Petkovic, Lionel Kuhlmann","doi":"10.1109/ICPR.1994.576282","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576282","url":null,"abstract":"This paper describes algorithms for automatically inspecting the air-bearing surface (ABS) of disk sliders (heads) for certain types of defects that are global or systematic in the sense that, when they occur, they occur on every slider in a row or, in some cases, on every slider in the entire carrier. These defects are: wrong part, missing rail, geometry error, missing taper, extra taper, misplaced taper, missing poletip and misplaced pole-tip. The inspection system is in production use and has resulted in a significant improvement of the quality of shipped sliders. Here, the associated image-analysis algorithms are described in detail.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115668870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fitting 3-D data using superquadrics and free-form deformations","authors":"É. Bardinet, L. Cohen, N. Ayache","doi":"10.1109/ICPR.1994.576230","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576230","url":null,"abstract":"Recovery of 3D data with simple parametric models has been the subject of many studies over the last ten years. Many have used the notion of superquadrics, introduced for graphics in Barr (1994). It appears however that whilst superquadrics could describe a wide variety of forms, they are too simple to recover and describe complex shapes. This paper describes a two-step method to fit a parametric deformable surface to 3D points. We suppose that a 3D image has been segmented to get a set of 3D points. The first step consists in our version of a superquadric fit with global tapering. We then make use of the technique of free-form deformations, as in computer graphics. We present experimental results with synthetic and real 3D medical images where the original points are laid on an iso-surface.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125792687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An efficient implementation and evaluation of Reid's multiple hypothesis tracking algorithm for visual tracking","authors":"I. Cox, S. L. Hingorani","doi":"10.1109/ICPR.1994.576318","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576318","url":null,"abstract":"An efficient implementation of Reid's multiple hypothesis tracking (MHT) algorithm is presented in which the the k-best hypotheses are determined in polynomial time using an algorithm due to Murty (1968). The MHT algorithm is then applied to several motion sequences. The MHT capabilities of track initiation, termination and continuation are demonstrated. Continuation allows the MHT to function despite temporary occlusion of tracks. Between 50 and 150 corner features are simultaneously tracked in the image plane over a sequence of up to 60 frames. Each corner is tracked using a simple linear Kalman filter and any data association uncertainty is resolved by the MHT. Kalman filter parameter estimation is discussed and experimental results show that the algorithm is robust to errors in the motion model.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128090254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}