{"title":"Analysing the structure of medical images with morphological size distributions","authors":"S. Behrens, J. Dengler","doi":"10.1109/ICPR.1990.118235","DOIUrl":"https://doi.org/10.1109/ICPR.1990.118235","url":null,"abstract":"The morphological size distribution is introduced as a general concept for analyzing structures in binary as well as in grey-value images. The morphological transformation can be used to treat light and dark structures separately. Thus, it is possible to describe the objects in a configuration and the spaces between or convex and concave parts in analyzing the shape. Examples are given which demonstrate that, using the size distribution, it is possible to characterize texture, shape, and configuration.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116761984","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":"Document image processing based on enhanced border following algorithm","authors":"M. Yamada, K. Hasuike","doi":"10.1109/ICPR.1990.119360","DOIUrl":"https://doi.org/10.1109/ICPR.1990.119360","url":null,"abstract":"An enhanced border-following algorithm and its application to document image processing is presented. Various kinds of components (characters, text lines, text blocks, figures, tables, etc.) in a document image can be flexibly segmented and extracted with a variable-size mask for border following instead of the conventional 3*3-size mask. An automatic document image structuring process to construct a multimedia document and a raster/geometric conversion method for the segmented graphic parts of the image. such as diagrams and tables, are discussed.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117107919","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":"Drawing image understanding framework using state transition models","authors":"S. Satoh, M. Sakauchi","doi":"10.1109/ICPR.1990.118152","DOIUrl":"https://doi.org/10.1109/ICPR.1990.118152","url":null,"abstract":"A flexible drawing understanding system with state transition models is proposed. The drawing processor AI-Mudams (written in C) is used as the token extractor in the embodiment discussed. Given drawing images are converted efficiently to suitable geometrical primitives, such as contour vectors, core vectors, dots loops, or, in some cases, primitives with semantics (road line, or house etc.). The understanding system kernel is implemented in Prolog, and the geometrical evaluator is also prepared in C for checking basic geometrical situations, including shape, geometrical relations, and allocations. This understanding kernel accepts the individual state transition rules corresponding to individual drawing images and recognition targets and realizes understanding in the form of bottom-up and top-down state transition. Experiments on different types of drawings reveal that the framework is flexible and effective for various kinds of drawing image.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"2482 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126149179","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 survey of image processing LSIs in Japan","authors":"T. Fukushima","doi":"10.1109/ICPR.1990.119389","DOIUrl":"https://doi.org/10.1109/ICPR.1990.119389","url":null,"abstract":"The author reviews image processing LSI ICs which were developed in Japan during the 1980s. Forty devices are covered and classified into five categories: the fully parallel processor, the partially parallel processor, the digital signal processor specialized for image processing, the functional processor, and the neutral network processor.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126829727","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}
N. Narasimhamurthi, R. Srinivasan, M. Shridhar, M. Ahmadi
{"title":"Shape determination from intensity images-a new algorithm","authors":"N. Narasimhamurthi, R. Srinivasan, M. Shridhar, M. Ahmadi","doi":"10.1109/ICPR.1990.118116","DOIUrl":"https://doi.org/10.1109/ICPR.1990.118116","url":null,"abstract":"A novel algorithm for the determination of surface shapes from intensity measurements is presented. The proposed model allows the estimation of the normals at any point on the surface and of the depth at any point in the image plane along the viewer (camera) direction. Simple shape descriptors for characterizing most developable surfaces are derived. It is shown that the principal curvatures of the surface are simply eigenvalues of the restriction of the shape matrix to the tangent space. The proposed algorithm allows incorporation of prior information obtained from stereopsis and other vision processes. Tests with intensity images have shown the algorithm to be convergent, robust, and accurate.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115255350","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}
Toon Gijbels, L. V. Eycken, A. Oosterlinck, S. Note, F. Catthoor
{"title":"An ASIC-architecture for VLSI-implementation of the RBN-algorithm","authors":"Toon Gijbels, L. V. Eycken, A. Oosterlinck, S. Note, F. Catthoor","doi":"10.1109/ICPR.1990.119391","DOIUrl":"https://doi.org/10.1109/ICPR.1990.119391","url":null,"abstract":"An optimized recursive binary nesting (RBN) algorithm for coding true color documents is presented. The RBN compression in which algorithm is a segmentation algorithm in which a picture is subdivided into regions with equal properties and for each region only the relevant information for the human eye is kept. Thus, the compressed image consists of segmentation information and the information of the picture behavior in those regions. The picture is subsampled on a quadtree based lattice (segmentation information). The inner pixels are approximated with the use of four lattice corner pixels (pictorial behavior). The subdivision in blocks has to be a function of the image contents. The size of the initial blocks is 65*65. Each pixel in the block is approximated as a weighted average of the four corner pixels (bilinear interpolation). The efficient VLSI architecture used to implement the algorithm is termed the lowly multiplexed cooperating data-path style. Several other designs under consideration are briefly reviewed.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115328534","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":"Inferring shape from contour for curved surfaces","authors":"F. Ulupinar, R. Nevatia","doi":"10.1109/ICPR.1990.118080","DOIUrl":"https://doi.org/10.1109/ICPR.1990.118080","url":null,"abstract":"A technique based on analysis of symmetries in an image is proposed for inferring the 3-D shapes of surfaces of objects in it. This technique is analyzed and applied to zero-Gaussian-curvature surfaces. The method consists of deriving a number of constraints based on a few simple assumptions. The combination of constraints to give unique (or few) solutions is discussed. Experimental results on selected scenes are given and are shown to conform well with human perception.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115567158","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":"Fast tree classifiers","authors":"Youngtae Park, J. Sklansky","doi":"10.1109/ICPR.1990.118192","DOIUrl":"https://doi.org/10.1109/ICPR.1990.118192","url":null,"abstract":"An automated method is presented for the design of linear tree classifiers, i.e. tree classifiers in which a decision based on a linear sum of features is carried out at each node. The method exploits the discriminability of Tomek links joining opposed pairs of data points in multidimensional feature space to produce a hierarchically structured piecewise linear decision function. The corresponding decision surface is optimized by a gradient descent that maximizes the number of Tomek links cut by each linear segment of the decision surface, followed by training each node's linear decision segment on the data associated with that node. Experiments on real data obtained from character images suggest that the accuracy of the tree classifier designed by this scheme is comparable to those of the k-NN classifiers and the tree classifier of J.K. Mui and K.S. Fu (1980), while providing much greater decision speeds, and that the tradeoff between the speed and the accuracy in pattern classification can be controlled by bounding the number of features to be used at each node of the tree.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116068168","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 3-D objects in needle maps","authors":"Xiaoyi Jiang, H. Bunke","doi":"10.1109/ICPR.1990.118102","DOIUrl":"https://doi.org/10.1109/ICPR.1990.118102","url":null,"abstract":"A model-based system for the recognition of 3-D overlapping convex objects with planar and curved surfaces from the needle map of a scene is presented. The recognition is based on tree search and EGI (extended Gaussian image) matching. A set of constraints is proposed to effectively limit search space, and several heuristics are introduced to enhance the tree search and EGI matching. Moreover, all information needed for the recognition method is automatically generated from CAD models.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116091155","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":"Architecture-independent global image processing","authors":"J. Webb","doi":"10.1109/ICPR.1990.119443","DOIUrl":"https://doi.org/10.1109/ICPR.1990.119443","url":null,"abstract":"A specialized language, called Adapt, for local and global image processing on parallel processors is presented. Adapt is based on a split and merge model. The input image is split into sections, which are processed separately on different processors, and the results are merged using a function written by the user. This model is quite general; any image processing operation that can be computed from top to bottom or from bottom to top on an image can be computed with it. The use of Adapt is illustrated with several programs for important global operations, including histogram, Hough transform, minimum bounding rectangle, and connected components. A preliminary implementation of Adapt exists on the Carnegie Mellon Warp machine. Performance figures from this implementation are provided. A description of how Adapt can be implemented on other architectures is given.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122560856","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}