{"title":"Invariant fitting of planar objects by primitives","authors":"K. Voss, H. Süße","doi":"10.1109/ICPR.1996.546078","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546078","url":null,"abstract":"The determination of invariant characteristics is an important problem in pattern recognition. Many invariants are known which have been obtained by the method of normalization. In this paper, we introduce a new approach of fitting planar objects by primitives using the method of normalization (for instance: fitting by lines, triangles, rectangles, circles, ellipses, super-quadrics, etc.). Objects and primitives are described by features, for example, by moments. The main advantage is that the normalization process provides us with a canonical frame of the object and the primitive. Therefore, the fit is invariant with respect to the transformation used. By this new method, an analytical fitting of nonanalytical objects can be achieved, for example, fitting by polygons. Furthermore, the numerical effort can be reduced drastically by normalizing of the object and the primitive.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130025989","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}
R. Watzel, K. Braun, A. Hess, W. Zuschratter, H. Scheich
{"title":"Restoration of dendrites and spines with the objective of topologically correct segmentation","authors":"R. Watzel, K. Braun, A. Hess, W. Zuschratter, H. Scheich","doi":"10.1109/ICPR.1996.546870","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546870","url":null,"abstract":"In many biomedical applications, typically a specimen marked with a coloring is to be segmented from its environment which is unmarked. Although this is a binary mapping in nature, it is not an easy task if the size of the specimen lies in the range of the optical resolution of the sampling equipment, because intermediate signal values can be caused by the distance to an object as well as by the size of the object itself. This ambiguity can cause topological errors in the segmentation result. We study operators designed to segment thin objects from their background. These operators decide on the basis of the differential geometric properties of the 3D grayscale image function. Their capabilities and drawbacks are discussed by the example of the observation of neural dendrites and spines by confocal laser scan microscopy.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125683497","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":"Finding map correspondence using geometric models","authors":"J. D. Knecht, K. Schutte","doi":"10.1109/ICPR.1996.546924","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546924","url":null,"abstract":"The problem is to find the correspondence between a digital and a scanned map. The digital map is assumed to be geometrically correct. The hand drawn, scanned mapped is not geometrically correct, but contains information not present in the digital map. The proposed procedure is to analyze the scanned map with the ROCKI system. The output consists of distinct objects, among which houses play an important role. These houses are used to find the correspondence with the digital map. Typical abstractions and drawing errors are circumvented by an inexact matching procedure. It is shown that, based on the expected noise model, the exact match can be found using least squares estimation (LSE).","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128880816","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":"Recognition by recall","authors":"Jian Kang Wu","doi":"10.1109/ICPR.1996.547252","DOIUrl":"https://doi.org/10.1109/ICPR.1996.547252","url":null,"abstract":"Recognition is a major capability of human being and animals. In the discipline of pattern recognition, research has been carried out extensively on recognition by classification. As a matter of fact, most of the time, human perform recognition tasks by recall. This paper describes the framework of recognition by recall. The definitions are given from the perspective of content-based retrieval. The approach and preliminary results are also presented.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126950755","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 modulus constraint: a new constraint self-calibration","authors":"M. Pollefeys, L. Gool, A. Oosterlinck","doi":"10.1109/ICPR.1996.546047","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546047","url":null,"abstract":"To obtain a Euclidean reconstruction from images the cameras have to be calibrated. In recent years different approaches have been proposed to avoid explicit calibration. The problem with these methods is that several parameters have to be retrieved at once. Because of the non-linearity of the equations this is not an easy task and the methods often fail to converge. In the's paper a stratified approach is proposed which allows to first retrieve the affine calibration of the camera using the modulus constraint. Having the affine calibration it is easy to upgrade to Euclidean. The important advantage of this method is that only three parameters have to be evaluated at first. From a practical point of view, the major gain is that an affine reconstruction is obtained from arbitrary sequences of views, whereas so far affine reconstruction has been based on pairs of views with a pure translation in between. A short illustration of another application is also given. Once the affine calibration is known, the constraint can be used to retrieve the Euclidean calibration in the presence of a variable focal length.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130524786","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 and effective texture classification approach using a new notion in wavelet theory","authors":"Jian-feng Liu, J. C. Lee","doi":"10.1109/ICPR.1996.547190","DOIUrl":"https://doi.org/10.1109/ICPR.1996.547190","url":null,"abstract":"This paper presents a novel multiresolution approach to the classification of textures using wavelets. The approach uses an overcomplete wavelet decomposition, called wavelet-frames, which yields the descriptions of both translation invariance and stability. In order to adapt it to the quasi-periodic properly of textures, we first detect the channels containing dominant information, and then zoom it into these frequency channels for further decomposition. For classification efficiency, we develop a progressive texture classification algorithm, in which the classification process terminates once a suitably chosen discrimination criterion is met. Experiments show that with a minimum number of wavelet frame decompositions and iterations, our proposed approach achieves a 100% correct classification rate on all the texture types tested. It outperforms many of the existing approaches in terms of classification excellence and computational efficiency, and hence appears attractive for real-time applications involving texture-based video/image classification.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130609478","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 shape distance by complete and stable invariant descriptors for contour tracking","authors":"A. Mokadem, M. Daoudi, F. Ghorbel","doi":"10.1109/ICPR.1996.546000","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546000","url":null,"abstract":"We consider the problem of comparing geometric objects in order to determine the extent to which one object resembles another. Invariant feature families are presented. A complete and stable set of invariant features has been applied to define all invariant distance in the shapes space. This distance allows us to detect and follow moving objects in a dynamic scene. In order to evaluate the performance of such a metric, experimental results are given.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130643225","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}
C. Shekhar, S. Kuttikkad, R. Chellappa, M. Thonnat
{"title":"Knowledge-based integration of IU algorithms","authors":"C. Shekhar, S. Kuttikkad, R. Chellappa, M. Thonnat","doi":"10.1109/ICPR.1996.547635","DOIUrl":"https://doi.org/10.1109/ICPR.1996.547635","url":null,"abstract":"This paper deals with the integration of image understanding (IU) programs using a knowledge-based approach. The basic concepts of program integration are discussed, and a simple problem-solving model for program integration is outlined. Two types of reasoning, planning and execution control, are identified. A system developed using this model, called OCAPI (Optimizing, Controlling and Automating the Processing of Images), is introduced. OCAPI is an AI environment in which the reasoning used by the IU specialist is formally represented using frames and production rules. An example of the application developed using OCAPI is presented, and the advantages and shortcomings of this approach are discussed.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130776372","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":"Cubical singular simplex model for 3D objects and fast computation of homology groups","authors":"J. Chao, J. Nakayama","doi":"10.1109/ICPR.1996.547259","DOIUrl":"https://doi.org/10.1109/ICPR.1996.547259","url":null,"abstract":"This paper proposes a new simplex model for 3D objects: a cubical singular simplex model instead of the traditional triangularization simplex model. An extended Kohonen mapping is then presented as an efficient learning rule of the model. Based on this model, one can derive a pyramid structure for multi-resolution hierarchy, which is not possible for triangularization simplex. Besides, a fast algorithm is shown to calculate the homology groups of the objects as topological invariants from the proposed model.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"499 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132970526","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":"Ribbon-based motion analysis of human body movements","authors":"I. Chang, Chung-Lin Huang","doi":"10.1109/ICPR.1996.546985","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546985","url":null,"abstract":"This paper introduces a ribbon-based motion analysis approach to describe human body movements. Here, we assume that there are no markers on human body. We develop a system to extract the moving ribbons (extremities) by processing the difference between current image frame and reference image frame. By analyzing the moving ribbons on the key frames, we may produce the motion parameter curves for each joint on the ribbon. These curves may not be continuous due to ribbon-torso occlusion, and both the interpolation and extrapolation processes can be used to predict the missing parts.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132086302","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}