{"title":"Qualitative estimations of range and motion using spatio-temporal textural images","authors":"Zhigang Zhu, Guangyou Xu, Dingji Shi","doi":"10.1109/ICPR.1994.576425","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576425","url":null,"abstract":"In this paper we model the problem of structure from motion as the range estimation with known motion. First, we approximate the motion within a reasonable time interval as a 3D translation and thus some image transformations are applied to convert an arbitrary motion to a 1D translation. Then we analyse the epipolar plane image in the Fourier domain to avoid the feature extraction and correspondence problems. Experimental results with real scene images have shown the efficiency and robustness of the approach.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"5 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":"129329035","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 new approach to qualitative stereo","authors":"Y. Hel-Or, S. Edelman","doi":"10.1109/ICPR.1994.576287","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576287","url":null,"abstract":"Nonmetric multidimensional scaling (MDS) is a family of algorithms that allow one to derive a quantitative representation of data from a set of qualitative measurements which must satisfy certain simple constraints. As a tool for vision, MDS combines the advantages of both qualitative and classical approaches, by relying, on the one hand, on an ordinal-scale input representation, and by supporting, on the other hand, the extraction of metric information. The present paper illustrates an application of MDS to the recovery of depth from the rank order of binocular disparity differences for a set of points. Our results indicate that multidimensional scaling constitutes a promising approach to the integration of biological and computational insights into the problem of depth perception.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"18 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":"123751293","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":"Multiresolution attention and associative memory systems for time-varying imagery","authors":"Vicente Concepcion, H. Wechsler","doi":"10.1109/ICPR.1994.576464","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576464","url":null,"abstract":"This paper describes a vision system that integrates attention and recognition systems using active (where and what to sense) and selective (how to control the stream of computation) perception. Both time-varying imagery input and recognition memory are organized as pyramids and a uniform indexing and classification interface is established. The tools discussed in this paper include the use of: (1) scale-space representation using wavelet pyramids; (2) hierarchical, localized, and robust indexing and classification of the feature models using distributed associative memory; and (3) adaptive saccade and zoom strategies guided by saliency in determining focus of attention to locate and identify target objects.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"185 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":"127292269","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":"Location estimation of cylinders from a 2-D image","authors":"O. Wink, A. Smeulders, D. Koelma","doi":"10.1109/ICPR.1994.576401","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576401","url":null,"abstract":"This paper describes an approach to estimate the location from a cylinder considering both diffuse and specular models of reflection. Given the proper orientation of the cylinder, the Marquardt-Levenberg method from computational mathematics is used to estimate the parameters in the models based on several intensity profiles perpendicular to the cylinders orientation. While the nonphysical axis of the cylinder is used to determine its position, radius lighting direction and other reflectance parameters are also estimated. Experimental results for both synthesised and real images show that the method is robust with respect to noise.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"18 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":"116416507","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":"Optimal polygonal approximation of digital curves","authors":"Arie Pikaz, I. Dinstein","doi":"10.1109/ICPR.1994.576378","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576378","url":null,"abstract":"An algorithm for optimal polygonal approximation is presented. Given a value for the maximal allowed distance between the approximation and the curve, the algorithm finds an approximation with the minimal number of vertices. The city-block metric is used to measure the distance between the approximation and the curve. The algorithm worst case complexity is O(n/sup 2/) where n is the number of points in the curve. This complexity is attractive compared to the complexity of other algorithms for optimal approximations. An efficient and optimal solution for the case of closed curves where no initial point is given, is also presented.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"31 Suppl 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":"116358752","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":"Partial matching of 3-D objects in CAD/CAM systems","authors":"E. Cohen, H. Wolfson","doi":"10.1109/ICPR.1994.576332","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576332","url":null,"abstract":"This application presents an algorithm for model-based partial recognition of CAD/CAM objects in 3-D space. Its main goal is to serve as an industrial application in robotic aided production lines and to facilitate the programming of process robots. Hence, a special emphasis is given to its practical capabilities. The recognition algorithm is invariant to the 3-D similarity transformation: rotation (& reflection), translation and scale. The objects can be represented as wireframes, solids or surfaces. The algorithm is based on the geometric hashing method and exploits specific CAD/CAM geometric constraints.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"157 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":"124396251","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":"The horoptor and active cyclotorsion","authors":"M. Jenkin, John K. Tsotsos, G. Dudek","doi":"10.1109/ICPR.1994.576412","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576412","url":null,"abstract":"When a particular 3D point is fixated by a robotic stereo system different portions of the world are brought into interocular alignment. This region is known as the horoptor. Purposeful modifications to the binocular geometry can be used to bring different regions of three-space closer to the horoptor: camera pan and tilt define the rough structure of the horoptor, while camera torsion can be used to change its local shape. Theoretical and empirical results suggest that for binocular vision tasks: 1) it is important to understand the region of three space that contains the horoptor curve; and 2) it is possible to control this shape in an active way so as to simplify certain binocular tasks.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"38 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":"127589119","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":"On the direct determination of epipoles: a case study in algebraic methods for geometric problems","authors":"Q. Luong, O. Faugeras","doi":"10.1109/ICPR.1994.576265","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576265","url":null,"abstract":"Studies experimentally the problem of computing the position of the epipoles in a pair of uncalibrated images. The approach, which is based on the definition of the epipolar transformation, exploits algebraic constraints obtained from point correspondences and provides a direct solution in which only the epipoles are involved. This is in opposition with the methods based on the computation of the fundamental matrix. In order to obtain a robust solution, three families of methods are successively considered: the first one uses statistics on closed-form solutions provided by the so-called Sturm method, the second one finds the intersection of plane cubics by deterministic procedures, and the third one is based on non-linear minimizations of a difference of cross-ratios. The authors discuss the shortcomings of each of these and show, using numerous experimental comparisons, that a drastic improvement can be obtained.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"2012 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":"127384058","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":"Recognizing volumetric objects in the presence of uncertainty","authors":"T. Arbel, P. Whaite, F. Ferrie","doi":"10.1109/ICPR.1994.576328","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576328","url":null,"abstract":"This paper describes a new framework for parametric shape recognition. The key result is a method for generating classifiers in the form of conditional probability densities for recognizing an unknown from a set of reference models. The authors' procedure is automatic. Off-line, it invokes an autonomous process to estimate reference model parameters and their statistics. On-line, during measurement, it combines these with a priori context-dependent information, as well as the parameters and statistics estimated for an unknown object, into a conditional probability density function, which represents the belief that the unknown is a particular reference model. The paper also describes the implementation of this procedure in a system for automatically generating and recognizing 3-D part-oriented models. The authors show that recognition performance is near perfect for cases in which complete surface information is accessible to the algorithm, and that it falls off gracefully when only partial information is available. This leads to the possibility of an active recognition strategy in which the belief measures associated with each classification can be used as feedback for the acquisition of further evidence as required.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"15 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":"116826445","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":"On shape similarity","authors":"Konstantin Y. Kupeev, H. Wolfson","doi":"10.1109/ICPR.1994.576262","DOIUrl":"https://doi.org/10.1109/ICPR.1994.576262","url":null,"abstract":"An algorithm for the detection of 'perceptual similarity' among planar shapes is suggested. Current state-of-the-art matching algorithms deal mainly with shapes which are similar modulo a well defined geometric transformation. The goal of this paper is to suggest a similarity measure among shapes which 'look similar', such as different fonts of a letter or pictures of different 'perceptually similar' chairs. The essence of the authors' approach consists in the representation of the shapes as special weighted graphs, the vertices of which represent the 'lumps' of the shapes in a given orientation. Then, these graphs are gradually reduced by a 'small leaf' trimming procedure until the resulting graphs are isomorphic. A similarity measure is calculated based on this representation. Since the graphs are orientation dependent, the similarity measure is minimized over all orientations of one of the shapes. Experimental results of pairwise comparisons of a 24 shape database are presented.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"86 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":"134453447","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}