{"title":"Hough transform using slope and curvature as local properties to detect arbitrary 2D shapes","authors":"Siang De Ma, Xing Chen","doi":"10.1109/ICPR.1988.28280","DOIUrl":"https://doi.org/10.1109/ICPR.1988.28280","url":null,"abstract":"A Hough transform algorithm is presented with a complexity of o(mn) instead of o(q/sup 2/mn) or o(qm) as in the Marlin-Faber algorithm or Ballard algorithm. (m and n are the numbers of points on the model's and shape's boundary, respectively, and q is the quantization of the parameter space). This method has been used to detect arbitrary shapes and for recognizing partially occluded parts. It is noted that although the time complexity of the Hough transform is reduced, more computations are needed in image space.<<ETX>>","PeriodicalId":314236,"journal":{"name":"[1988 Proceedings] 9th International Conference on Pattern Recognition","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128548556","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":"Flexible recognition algorithms and flexible OCR system","authors":"Du Jiangchuan, Liu Hiengjian","doi":"10.1109/ICPR.1988.28319","DOIUrl":"https://doi.org/10.1109/ICPR.1988.28319","url":null,"abstract":"An optical handwritten numeral recognition system is presented which uses a G3 facsimile transceiver (fax) as the input device. Flexible recognition algorithms perform raster scanning of the Huffman code produced by the fax only once. The hanger-chain algorithms separate handwritten numerals and obtain the first features at the same time. All the recognition software is coded in Turbo C language. The system recognition speed is from 10 to 100 characters per second, and the recognition rate is from 95% to 99.5% depending on the sample.<<ETX>>","PeriodicalId":314236,"journal":{"name":"[1988 Proceedings] 9th International Conference on Pattern Recognition","volume":"21 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131843732","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":"Algorithms for massively parallel image processing architectures","authors":"J. Sanz, R. Cypher","doi":"10.1109/ICPR.1988.28256","DOIUrl":"https://doi.org/10.1109/ICPR.1988.28256","url":null,"abstract":"The complexity of efficiently programming massively parallel machines is illustrated by presenting a number of algorithms. These algorithms deal with computational geometry, data histogramming, list manipulation, and other problems or operations that arise in computer vision tasks. All of the algorithms presented use a divide-and-conquer strategy, and they all use routines that solve a problem of size M using a machine size N, where M<N. In some of the algorithms, the extra processors are used to perform more than M calculations in parallel. In other algorithms, the extra processors are used to improve the speed of interprocessor communication.<<ETX>>","PeriodicalId":314236,"journal":{"name":"[1988 Proceedings] 9th International Conference on Pattern Recognition","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133494610","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 analysis for generating syntactic structure description","authors":"Y. Tsuji","doi":"10.1109/ICPR.1988.28346","DOIUrl":"https://doi.org/10.1109/ICPR.1988.28346","url":null,"abstract":"A document image analysis is described which automatically converts an input image into a syntactic document tree structure, while simultaneously representing the elements and their relative relations. Top-down image segmentation, using projection profiles, was greatly improved by systematically using a feedback process. As a result, the tree structure, including the blocks and their relative relations, was generated. Both the elements and their relations in the generated tree were finally determined by the bottom-up strategy, based on the general document layout property. Experimental results showed that this proposed method can be appropriately used to automatically describe an input image as a layout structure.<<ETX>>","PeriodicalId":314236,"journal":{"name":"[1988 Proceedings] 9th International Conference on Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130303434","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 pattern matching approach to connected-word recognition for Chinese","authors":"Baosheng Yuan, T. Yu","doi":"10.1109/ICPR.1988.28275","DOIUrl":"https://doi.org/10.1109/ICPR.1988.28275","url":null,"abstract":"A speaker-dependent pattern-matching approach to connected word recognition for Chinese is presented. First, a method of adaptive energy normalization is applied to the speech spectrum, and a sound stimulus parameter is used to compress the normalized spectrum. Then, using a set of isolated word tokens as the reference patterns, a simplified dynamic programming-based matching strategy using a fast dynamic-time-warping alignment procedure is described. Experimental results for the recognition of a Chinese digit string (of unknown variable length from 2 to 5 digits), for two kinds of pronunciation (in standard Chinese and in the way used in telecommunication), are given. The correct string recognition rate is 96.8% and 97.6%, respectively.<<ETX>>","PeriodicalId":314236,"journal":{"name":"[1988 Proceedings] 9th International Conference on Pattern Recognition","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133855934","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":"Qualitative and quantitative matching of solid models and images of 3D objects","authors":"M. Koizumi, F. Tomita","doi":"10.1109/ICPR.1988.28327","DOIUrl":"https://doi.org/10.1109/ICPR.1988.28327","url":null,"abstract":"A model-based vision system which recognizes 3D objects in an image is presented. The procedure is divided into two phases: qualitative and quantitative. First, component primitives of objects are qualitatively detected in the image, so as to invoke efficiently as few candidate object models as necessary from a number of models and to get corresponding points between models and data. Then, a candidate transformation is quantitatively hypothesized for each object by initially matching a few corresponding points in the primitive; the match is tested and adjusted for verification by matching all the points in the model.<<ETX>>","PeriodicalId":314236,"journal":{"name":"[1988 Proceedings] 9th International Conference on Pattern Recognition","volume":"118 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113980704","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":"Automated design of piecewise-linear classifiers of multiple-class data","authors":"Youngtae Park, J. Sklansky","doi":"10.1109/ICPR.1988.28443","DOIUrl":"https://doi.org/10.1109/ICPR.1988.28443","url":null,"abstract":"A method for designing multiple-class piecewise-linear classifiers is described. It involves the cutting or arcs joining pairs of opposed points in d-dimensional space. Such arcs are referred to as links. It is shown how to nearly minimize the number of hyperplanes required to cut all of these links, thereby yielding a near-Bayes-optimal decision surface regardless of the number of classes. The underlying theory is described. This method does not require parameters to be specified by users. Experiments on multiple-class data obtained from ship images show that classifiers designed by this method yield approximately the same error rate as the best k-nearest-neighbor rule, while possessing greater computational efficiency of classification.<<ETX>>","PeriodicalId":314236,"journal":{"name":"[1988 Proceedings] 9th International Conference on Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123944988","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":"Online cursive script recognition using local affine transformation","authors":"T. Wakahara","doi":"10.1109/ICPR.1988.28460","DOIUrl":"https://doi.org/10.1109/ICPR.1988.28460","url":null,"abstract":"The problem of extraction, description, and estimation of handwriting deformation in online character recognition is discussed. First, feature-point correspondence is extracted between an input pattern and a reference pattern by elastic matching and a deformation vector field (DVF) is generated. Second, the DVF is expanded into an infinite series by applying iterative local affine transformations. Finally, the interpattern distance is calculated between the input pattern and the reference pattern superposed by low-order components of local affine transformations. Recognition tests made on cursive kanji character data have revealed the high discrimination ability of this method.<<ETX>>","PeriodicalId":314236,"journal":{"name":"[1988 Proceedings] 9th International Conference on Pattern Recognition","volume":"201-202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127935780","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 rock classification expert system","authors":"Tian Shengfeng, Zhang Qing, Mo Yuanbin","doi":"10.1109/ICPR.1988.28315","DOIUrl":"https://doi.org/10.1109/ICPR.1988.28315","url":null,"abstract":"A system to classify rock mass is described. The knowledge of experts is divided into two parts: the knowledge about the classification according to main parameters, and the knowledge about the evaluation of those parameters. The principle of classification is based on the fuzzy set theory. A scheme that calculates two agendas, or structure sets, plays an important role in the control strategy. This scheme provides a way to parallel a problem-solving method of human experts and raises efficiency.<<ETX>>","PeriodicalId":314236,"journal":{"name":"[1988 Proceedings] 9th International Conference on Pattern Recognition","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121227831","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":"Automatic detection of sister chromatid exchange","authors":"He Liang, Chai Zhen-ming","doi":"10.1109/ICPR.1988.28318","DOIUrl":"https://doi.org/10.1109/ICPR.1988.28318","url":null,"abstract":"Sister chromatid exchange (SCE) is an interchange of genetic material between replication products at homologous loci. Various chemical agents or other environmental physical factors can cause SCE at concentrations insufficient to produce other significant change in chromosome morphology. A method for automatic detection of SCE is presented. By searching for the zero-crossing points in the average integrated optical density ratio, SCEs are detected and located accurately. In a preliminary experiment with 266 chromosomes, a system based on this method has achieved an accuracy of 95.5%. By monitoring and comparing the spontaneous and inductive SCE frequency, one can estimate the nature and degree of the damage the organisms suffered and appraise the short-term and long-term effects on them.<<ETX>>","PeriodicalId":314236,"journal":{"name":"[1988 Proceedings] 9th International Conference on Pattern Recognition","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121398150","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}