{"title":"Recovering the shape of polyhedra using line-drawing analysis and complex reflectance models","authors":"I. Shimshoni, J. Ponce","doi":"10.1109/CVPR.1994.323875","DOIUrl":"https://doi.org/10.1109/CVPR.1994.323875","url":null,"abstract":"Following Sugihara, we represent the geometric constraints imposed by the line-drawing of a polyhedron as a set of linear equalities and inequalities. Unlike him, we explicitly take into account the uncertainty in vertex position. This allows us to circumvent the superstrictness of the constraints without deleting any of them. For a given error bound, deciding whether a line-drawing is the correct projection of a polyhedron is reduced to linear programming, and 3D shape recovery is reduced to optimization under linear constraints. Our method can be used for recovering the shape of polyhedral objects whose reflectance can be modelled accurately. We have implemented if for the Lambertian model and the Lambertian model with interreflections. We present results obtained using real images.<<ETX>>","PeriodicalId":160667,"journal":{"name":"1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131029155","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":"Obstacle detection analysis","authors":"Philippe Bobet, C. Schmid","doi":"10.1109/CVPR.1994.323901","DOIUrl":"https://doi.org/10.1109/CVPR.1994.323901","url":null,"abstract":"This paper analyses the influence of the stereo camera parameters on an existing obstacle detection technique. A theoretical model is derived and evaluated for the concepts of resolution and stability. Resolution is the minimum height that an obstacle must have in order to be detected. Stability is defined as the sensitivity of detection to errors in the camera parameters. It can be seen that detection is very sensitive to some of the parameters and that there is no clear tradeoff between resolution and stability. We derive a stereo head configuration to give stable results and show how the parameters should be adapted in the context of an active vision system. Experiments confirm the theoretical results.<<ETX>>","PeriodicalId":160667,"journal":{"name":"1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127378926","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":"Focused image recovery from two defocused images recorded with different camera settings","authors":"M. Subbarao, Tse-Chung Wei, G. Surya","doi":"10.1109/CVPR.1994.323899","DOIUrl":"https://doi.org/10.1109/CVPR.1994.323899","url":null,"abstract":"Two new methods are presented for recovering the focused image of an object from only two blurred images recorded with different camera parameter settings. First a blur parameter /spl sigma/ is estimated using one of our two recently proposed depth-from-defocus methods. Then one of the two blurred images is deconvolved to recover the focused image. The first method requires only the knowledge of /spl sigma/ of the camera's point spread function (PSF). It is based on a new spatial domain convolution/deconvolution transform. The second method requires full knowledge of the form of the PSF and is estimated using step edges. The focused image is obtained through deconvolution in the Fourier Domain using the Wiener filter. For both methods, results of experiments on actual defocused images recorded by a CCD camera are presented. The first method requires less computation and gives satisfactory results for up to medium levels of blur. The second method gives good results for up to relatively high levels of blur.<<ETX>>","PeriodicalId":160667,"journal":{"name":"1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127795720","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":"Deformable models with parameter functions: application to heart-wall modeling","authors":"Jinah Park, Dimitris N. Metaxas, A. Young","doi":"10.1109/CVPR.1994.323863","DOIUrl":"https://doi.org/10.1109/CVPR.1994.323863","url":null,"abstract":"This paper develops a new class of physics-based deformable models which can deform both globally and locally. Their global parameters are functions allowing the definition of new parameterized primitives and parameterized global deformations. These new global parameter functions improve the accuracy of shape description through the use of a few intuitive parameters such as functional bending and twisting. Using a physics-based approach we convert these geometric models into deformable models that deform due to forces exerted from the data-points so as to conform to the given dataset. We present an experiment involving the extraction of shape and motion of the Left Ventricle (LV) of a heart from MRI-SPAMM data based on a few global parameter functions.<<ETX>>","PeriodicalId":160667,"journal":{"name":"1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122376076","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":"X-Y separable pyramid steerable scalable kernels","authors":"Doug Shy, P. Perona","doi":"10.1109/CVPR.1994.323835","DOIUrl":"https://doi.org/10.1109/CVPR.1994.323835","url":null,"abstract":"A new method for generating X-Y separable, steerable, scalable approximations of filter kernels is proposed which is based on a generalization of the singular value decomposition (SVD) to three dimensions. This \"pseudo-SVD\" improves upon a previous scheme due to Perona (1992) in that it reduces convolution time and storage requirements. An adaptation of the pseudo-SVD is proposed to generate steerable and scalable kernels which are suitable for use with a Laplacian pyramid. The properties of this method are illustrated experimentally in generating steerable and scalable approximations to an early vision edge-detection kernel.<<ETX>>","PeriodicalId":160667,"journal":{"name":"1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122394767","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":"VISIPLAN: a hierarchical planning framework for composing biomedical image analysis processes","authors":"L. Gong, C. Kulikowski","doi":"10.1109/CVPR.1994.323886","DOIUrl":"https://doi.org/10.1109/CVPR.1994.323886","url":null,"abstract":"This paper presents a new knowledge-based approach to the composition of biomedical image analysis processes. A prototype system has been developed that provides the imaging domain expert with the tools needed to formulate, specify and experiment with the design of analysis strategies. The system has been tested in the area of MR image analysis with promising results.<<ETX>>","PeriodicalId":160667,"journal":{"name":"1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123914521","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":"Representation and computation of the spatial environment for indoor navigation","authors":"Dongsung Kim, R. Nevatia","doi":"10.1109/CVPR.1994.323869","DOIUrl":"https://doi.org/10.1109/CVPR.1994.323869","url":null,"abstract":"We introduce a spatial representation, s-map, for an indoor navigation robot. The s-map represents the locations of obstacles in a planar domain, where obstacles are defined as any objects that can block movement of the robot. In building the s-map, the viewing triangle constraint and the stability constraint are introduced for efficient verification of vertical surfaces. These verified vertical surfaces and 3-D segments of obstacles smaller than a robot, are mapped to the s-map by simply dropping height information. Thus, the s-map is made directly from 3-D segments with simple verification, and represents obstacles in a planar domain so that it becomes a navigable map for the robot without further processing. In addition to efficient map building, the s-map represents the environment more realistically and completely. Furthermore, the s-map converts many navigation problems in 3-D, such as map fusion and path planning, into 2-D ones. We present the analysis of the s-map in terms of complexity and reliability, and discuss its pros and cons. Moreover, we show the results of the s-maps for indoor environments.<<ETX>>","PeriodicalId":160667,"journal":{"name":"1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128610011","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":"Extraction of 3D shape from optic flow: a geometric approach","authors":"T. Dijkstra, P. Snoeren, C. Gielen","doi":"10.1109/CVPR.1994.323820","DOIUrl":"https://doi.org/10.1109/CVPR.1994.323820","url":null,"abstract":"Several 3D shape measures are derived directly from the velocity field generated by a rigid curved surface patch under perspective projection. We use invariance under rotation of the image plane to decompose the velocity field into differential invariants. From a combination of these invariants, we construct an approximation to the absolute value of the shape index, to the curvature, and to the principal direction. We show the effect of these approximations to be small for a 6/spl deg/ field-of-view.<<ETX>>","PeriodicalId":160667,"journal":{"name":"1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","volume":"196 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114104288","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}
M. Berthod, H. Shekarforoush, M. Werman, J. Zerubia
{"title":"Reconstruction of high resolution 3D visual information","authors":"M. Berthod, H. Shekarforoush, M. Werman, J. Zerubia","doi":"10.1109/CVPR.1994.323784","DOIUrl":"https://doi.org/10.1109/CVPR.1994.323784","url":null,"abstract":"Given a set of low resolution camera images, it is possible to reconstruct high resolution luminance and depth information, specially if the relative displacements of the image frames are known. We propose iterative algorithms for recovering hash resolution albedo and depth maps that require no a priori knowledge of the scene, and therefore do not depend on other methods, as regards boundary and initial conditions. The problem of surface reconstruction has been formulated as one of expectation maximization (EM) and has been tackled in a probabilistic framework using Markov random fields (MRF). As for the depth map, our method directly recovers surface heights without refering to surface orientations, while increasing the resolution by camera jittering. Conventional statistical models have been coupled with geometrical techniques to construct a general model of the world and the imaging process.<<ETX>>","PeriodicalId":160667,"journal":{"name":"1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114672867","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}
Christopher E. Smith, S. Brandt, N. Papanikolopoulos
{"title":"Controlled active exploration of uncalibrated environments","authors":"Christopher E. Smith, S. Brandt, N. Papanikolopoulos","doi":"10.1109/CVPR.1994.323900","DOIUrl":"https://doi.org/10.1109/CVPR.1994.323900","url":null,"abstract":"Flexible operation of a robotic agent in an uncalibrated environment requires the ability to recover unknown or partially known parameters of the workspace through sensing. Of the sensors available to a robotic agent, visual sensors provide information that is richer and more complete than other sensors. In this paper we present robust techniques for the derivation of depth from feature points on a target's surface and for the accurate and high-speed tracking of moving targets. We use these techniques in a system that operates with little or no a priori knowledge of the object- and camera-related parameters to robustly determine such object-related parameters as velocity and depth. Such determination of extrinsic environmental parameters is essential for performing higher level tasks such as inspection, exploration, tracking, grasping, and collision-free motion planning. For both applications, we use the Minnesota Robotic Visual Tracker (a single visual sensor mounted on the end-effector of a robotic manipulator combined with a real-time vision system) to automatically select feature points on surfaces, to derive an estimate of the environmental parameter in question, and to supply a control vector based upon these estimates to guide the manipulator.<<ETX>>","PeriodicalId":160667,"journal":{"name":"1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125277704","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}