{"title":"Motion-model-based boundary extraction","authors":"Hongche Liu, T. Hong, M. Herman, R. Chellappa","doi":"10.1109/ISCV.1995.477065","DOIUrl":"https://doi.org/10.1109/ISCV.1995.477065","url":null,"abstract":"Motion boundary extraction and optical flow computation are two subproblems of the motion recovery problem that cannot be solved independently of one another. We present a local, non-iterative algorithm that extracts motion boundaries and computes optical flow simultaneously. This is achieved by modeling a 3-D image intensity block with a general motion model that presumes locally coherent motion. Local motion coherence, which is measured by the fitness of the motion model, is the criterion we use to determine whether motion should be estimated. If not, then motion boundaries should be located. The motion boundary extraction algorithm is evaluated quantitatively and qualitatively against other existing algorithms in a scheme originally developed for edge detection.","PeriodicalId":160040,"journal":{"name":"Proceedings of International Symposium on Computer Vision - ISCV","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124425484","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":"3D motion representations in visual servo control","authors":"Cornelia Fermuller, LoongFah Cheong, Y. Aloimonos","doi":"10.1109/ISCV.1995.476978","DOIUrl":"https://doi.org/10.1109/ISCV.1995.476978","url":null,"abstract":"A new approach to visual servoing and vision-guided robotics is introduced. This approach uses visual information for autonomous behavior. It amounts to using robust, global spatiotemporal representations easily extracted from the dynamic imagery. Specifically, the geometrical patterns of normal flows are used as the input to the servo mechanism. It is shown that the positions of these patterns are related to the three dimensional motion parameters. By locating the positions of these patterns, we can solve a variety of navigational problems with little computational effort.","PeriodicalId":160040,"journal":{"name":"Proceedings of International Symposium on Computer Vision - ISCV","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116964358","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 functionality","authors":"Zoran Duric, J. Fayman, E. Rivlin","doi":"10.1109/ISCV.1995.477009","DOIUrl":"https://doi.org/10.1109/ISCV.1995.477009","url":null,"abstract":"We look into a new area of function recognition: determining the function of an object from its motion. Given a sequence of images of a known object performing some function, we attempt to determine what that function is. We show that the motion of an object, when combined with information about the object and its normal uses, provides us with strong constraints on possible functions that the object might be performing.","PeriodicalId":160040,"journal":{"name":"Proceedings of International Symposium on Computer Vision - ISCV","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126047760","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":"Understanding people pointing: the Perseus system","authors":"Roger E. Kahn, Michi, J. Swain","doi":"10.1109/ISCV.1995.477062","DOIUrl":"https://doi.org/10.1109/ISCV.1995.477062","url":null,"abstract":"We present Perseus, a purposive visual system used by our robot, CHIP, to locate objects being pointed at by people. Perseus uses knowledge about the task and environment at all levels of processing to more accurately and efficiently perform visual tasks.","PeriodicalId":160040,"journal":{"name":"Proceedings of International Symposium on Computer Vision - ISCV","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126104999","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":"Figure-ground segmentation using Tabu search","authors":"M. Stricker, A. Leonardis","doi":"10.1109/ISCV.1995.477068","DOIUrl":"https://doi.org/10.1109/ISCV.1995.477068","url":null,"abstract":"Many computer vision problems, such as figure-ground segmentation, simultaneous fitting of curves, selection of an optimal set of geometric primitives, can be formulated naturally as discrete optimization problems. The statement of these problems is relatively easy, but to find techniques that efficiently solve them constitutes a major challenge. In this paper the authors focus on figure-ground segmentation. The authors present a Tabu search strategy which is able to solve the discrete optimization problem associated with figure-ground segmentation in a very efficient way. The resulting deterministic algorithm outperforms the currently fastest known algorithm to solve this problem (mean field annealing) by two orders of magnitude in speed and in addition it consistently finds better optima.","PeriodicalId":160040,"journal":{"name":"Proceedings of International Symposium on Computer Vision - ISCV","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121917264","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":"Building wide area 2-D site models from high resolution fully polarimetric synthetic aperture radar images","authors":"S. Kuttikkad, R. Chellappa","doi":"10.1109/ISCV.1995.477033","DOIUrl":"https://doi.org/10.1109/ISCV.1995.477033","url":null,"abstract":"Wide area site models are useful for delineating regions of interest and assisting in tasks like monitoring and change detection. They are also useful in registering a newly acquired image to an existing one of the same site, or to a map. This paper presents a complete algorithm for building an approximate 2-D wide-area site model from high resolution, polarimetric Synthetic Aperture Radar (SAR) data. A three stage algorithm-involving detection of possible targets, statistical segmentation of the data into homogeneous regions, and validation of segmentation results-is used for this task. Constant False Alarm Rate (CFAR) detectors are used for target detection, while maximum likelihood labeling is used for initial segmentation. Knowledge of the sensor heading and other geometric cues are used to refine the initial segmentation and to extract man-made objects like buildings, and their shadows, as well as roads, from these images.","PeriodicalId":160040,"journal":{"name":"Proceedings of International Symposium on Computer Vision - ISCV","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129169783","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 of deformable object structure and motion for autonomous manipulation using relative elasticity","authors":"Philip Smith, N. Nandhakumar, A. Ramadorai","doi":"10.1109/ISCV.1995.477001","DOIUrl":"https://doi.org/10.1109/ISCV.1995.477001","url":null,"abstract":"Even though most natural and many man made objects move in a nonrigid manner, the majority of the research in computer vision has focused on recovering motion and structure of rigid objects due to the underconstrained and complex nature of deformable transformations. A novel image based model for the representation of nonrigid structure and motion based on relative elasticity is discussed which provides both sectional and global motion information and requires no knowledge of physical parameters, allowing it to overcome many of the limitations of existing deformable models. The usefulness of this new representation is demonstrated for autonomous manipulation of nonrigid objects.","PeriodicalId":160040,"journal":{"name":"Proceedings of International Symposium on Computer Vision - ISCV","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120931563","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":"Digital geometric invariance and shape representation","authors":"A. Gross, Longin Jan Latecki","doi":"10.1109/ISCV.1995.476988","DOIUrl":"https://doi.org/10.1109/ISCV.1995.476988","url":null,"abstract":"In this paper, we present conditions which guarantee that a realistic digitization process preserves the qualitative differential geometry of the object boundary, such as convexity and inflection. This is possible since very few digital boundary patterns are shown to be realizable, and each such digital pattern has a well-defined geometric interpretation with respect to tangent direction. Using the set of realizable boundary patterns, we can recover geometric properties of the digitized object boundary, such as convexity and inflection. In addition, since all the realizable patterns are known, any other pattern can be labeled as either noise or a boundary discontinuity. Since each of these patterns has a well-defined tangent span, an adjacency graph can be generated from the patterns and this graph can be used to recursively generate the set of all possible digital boundary curves. The digitization process used in this paper is equivalent to setting a very low threshold value on the sensor output.","PeriodicalId":160040,"journal":{"name":"Proceedings of International Symposium on Computer Vision - ISCV","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114873684","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":"Describing motion for recognition","authors":"J. Little, J. Boyd","doi":"10.1109/ISCV.1995.477007","DOIUrl":"https://doi.org/10.1109/ISCV.1995.477007","url":null,"abstract":"Our goal is to describe motion of a moving human figure in order to recognize individuals by variation in the characteristics of the motion description. We begin with a short sequence of images of a moving figure, taken by a static camera, and derive dense optical flow data for the sequence. We determine a range of scale-independent features of each how image as a whole, ranging from the motion of the centroid of the moving points (assuming a static background), to the integral of the torque relative to the centroid. We then analyze the periodic structure of these sequences. All elements are multiples of the fundamental period of the gait, but they differ in phase. The phase is time-invariant, since it is independent of the sampling period. We show that there are several regularities in the phase differences of the signals. Moreover, some scalar measures of the signals may be useful in recognition. The representation is model-free, and therefore could be used to characterize the motion of other non-rigid bodies.","PeriodicalId":160040,"journal":{"name":"Proceedings of International Symposium on Computer Vision - ISCV","volume":"88 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127999309","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":"Reduction of rank-reduced orientation-from-color problem with many unknown lights to two-image known-illuminant photometric stereo","authors":"M. S. Drew","doi":"10.1109/ISCV.1995.477038","DOIUrl":"https://doi.org/10.1109/ISCV.1995.477038","url":null,"abstract":"How does shape from shading proceed when two or more differently colored light sources are present? For a uniformly colored Lambertian surface illuminated by a collection of point or extended light sources or inter reflections, with unknown directions and strengths, illumination varies spectrally with orientation from the surface. If light varies enough in color and direction, then surface orientation can be recovered by a kind of photometric stereo, but with a single image and many unknown lights. RGB values lie on an ellipsoid in color and the strengths and directions of three effective \"lights\" can be recovered from regression and by additional constraints derived from three estimates of light source tilt. However, it is quite likely that illumination color does not vary enough. In that case RGB points fill a planar 2D ellipse in color space. We give a result for the ellipse boundary that enables one to recover the strengths and angle between two effective lights producing the 2D shading. We then show that equations for the tilts of the linearly related three effective lights in 3D give an additional three independent constraints. Solving yields lights in 2D and hence in 3D as well. Thus the rank 2 orientation from color problem reduces to known light 2 image photometric stereo. Robust methods are used throughout.","PeriodicalId":160040,"journal":{"name":"Proceedings of International Symposium on Computer Vision - ISCV","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121440322","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}