{"title":"Pyramid architecture classification tree","authors":"Hiroto Yoshii","doi":"10.1109/ICPR.1996.546839","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546839","url":null,"abstract":"This paper proposes a novel pattern recognition algorithm-the pyramid architecture classification tree (PACT). The learning phase of the recognition system consists of two steps: a pyramid making step and a decision tree making step; all training patterns are preprocessed by the pyramid structure and the results are used for making a decision tree. PACT directly copes with a bitmap array having the two dimensional topology and needs no feature extraction. For evaluation of the performance of PACT, various experiments using a handprint Japanese character database were carried out. The results show that PACT can realize about 50 times faster training speed than that of conventional decision tree classifiers, and classifies patterns in far higher speed than nearest neighbor matching algorithms.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"49 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":"114391669","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":"Range data reconstruction using Fourier slice theorem","authors":"Shih-Schon Lin, C. Fuh","doi":"10.1109/ICPR.1996.546149","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546149","url":null,"abstract":"This paper proposes a new approach to resolve the ambiguity problem in multistriping laser triangulation systems. Our approach is based on the Fourier slice theorem which is briefly described in this paper. This theorem also forms the basis of X-ray CT (computed tomography) reconstruction.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"179 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":"114477042","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}
H. Haruki, T. Horiuchi, Hiromitsu Yamada, Kazuhiko Yamamoto
{"title":"Automatic seal verification using three-dimensional reference seals","authors":"H. Haruki, T. Horiuchi, Hiromitsu Yamada, Kazuhiko Yamamoto","doi":"10.1109/ICPR.1996.546938","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546938","url":null,"abstract":"The most important problem on automatic seal impression verification is to absorb the various impression quality depending on the various affixing conditions. Over the past years, many studies have been made on absorbing the various impression quality using a two-dimensional image as reference and input. But it is difficult to verify each of a large number of input patterns by a sole two-dimensional reference pattern. This paper proposes a seal identification method using a three-dimensional image (range image) as reference. As results of the verification with actual seal impressions, the verification rate is improved from that by using two-dimensional reference impressions.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"457 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":"114867735","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":"Adaptive filter to detect rounded convex regions: iris filter","authors":"H. Kobatake, Masayuki Murakami","doi":"10.1109/ICPR.1996.546846","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546846","url":null,"abstract":"This paper proposes a unique filter, called \"iris filter\", which evaluates the degree of convergence of gradient vectors in the neighborhood of the pixel of interest. The generalized iris filter and its simplified one are given. The degree of convergence is related to the distribution of orientations of gradient vectors. The region of support of the iris filter is controlled so that the degree of convergence of gradient vectors in it becomes maximum. It means that the size and the shape of the region of support changes adaptively according to the distribution pattern of gradient vectors around the pixel of interest. Theoretical analysis using models of a rounded convex region and a semi-cylindrical region is given. It shows that rounded convex regions are mostly enhanced even if their original contrasts to their background are weak and elongated objects are suppressed. However, the filter output is 1//spl pi/ at the boundaries of rounded convex regions and semi-cylindrical ones in spite of their contrast. This absolute value can be used to detect boundaries of those objects. The proposed filter is effective to enhance and detect rounded convex regions with various sizes and contrasts.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"2 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":"116989815","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":"Segmentation of multibeam acoustic imagery in the exploration of the deep sea-bottom","authors":"S. Dugelay, C. Graffigne, J. Augustin","doi":"10.1109/ICPR.1996.546864","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546864","url":null,"abstract":"The new generation of low-frequency echosounders, primarily used for bathymetric purposes, are also able to record acoustic images of the sea floor. Reflected energy, as a function of the incidence angle, is known to be strongly dependent on seabed type, and therefore stands as a potential tool in sea floor characterization. On the other hand, acoustic images of the reflected energy (mosaics), illustrate the variability of the acoustic interface and are invaluable for sea floor cartography. We describe a method of semi-automatic mosaic interpretation where the two different aspects are considered simultaneously. This is achieved by supervised segmentation using a Markov Random Field model where the neighbourhood system and energies have been carefully studied in order to comply to a priori knowledge. We present results obtained with this method, enhancing the possibility of using such a technique for low-frequency echosounders.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"35 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":"116328598","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":"Hidden tree-like quasi-Markov model and generalized technique for a class of image processing problems","authors":"V. Mottl, I. Muchnik, A. Blinov, A. Kopylov","doi":"10.1109/ICPR.1996.546916","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546916","url":null,"abstract":"Four problems of image processing, namely, those of smoothing. texture image segmentation, matching two images of similar structure, and building the local texture orientation map, are considered jointly as problems which can be treated as those of transforming the original image into another function on the image plane. We generalized statistical image processing procedure is aimed at finding a compromise between the local image-dependent information on the values of the hidden function at each pixel and the a priori information expressed in the form of some Markov smoothness constraints. For attaining a higher computation speed, instead of a full unitary prior Markov model of the hidden field, a compromise composite model is used which consists of a set of independent identical tree-like Markov neighborhood graphs.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"19 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":"122039000","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}
Lasse Holmström, P. Koistinen, Jorma T. Laaksonen, E. Oja
{"title":"Neural network and statistical perspectives of classification","authors":"Lasse Holmström, P. Koistinen, Jorma T. Laaksonen, E. Oja","doi":"10.1109/ICPR.1996.547432","DOIUrl":"https://doi.org/10.1109/ICPR.1996.547432","url":null,"abstract":"Pattern classification using neural networks and statistical methods is discussed and a taxonomy based on their underlying mathematical principles is presented. Typical neural network and statistical classifiers are then compared in a case study using handwritten digit data.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"94 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":"122076450","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":"Information theory and face detection","authors":"M. Lew, D. P. Huijsmans","doi":"10.1109/ICPR.1996.547017","DOIUrl":"https://doi.org/10.1109/ICPR.1996.547017","url":null,"abstract":"Face detection in complex environments is an unsolved problem which has fundamental importance to face recognition, model based video coding, content based image retrieval, and human computer interaction. In this paper we model the face detection problem using information theory, and formulate information based measures for detecting faces by maximizing the feature class separation. The underlying principle is that search through an image can be viewed as a reduction of uncertainty in the classification of the image. The face detection algorithm is empirically compared using multiple test sets, which include four face databases from three universities.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"149 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120869459","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":"On feature extraction for limited class problem","authors":"F. Kimura, T. Wakabayashi, Y. Miyake","doi":"10.1109/ICPR.1996.546750","DOIUrl":"https://doi.org/10.1109/ICPR.1996.546750","url":null,"abstract":"The availability of the canonical discriminant analysis to a limited class problem is restricted because the number of extracted features can not be or exceed the number of classes. In order to remove the restriction, a new feature extraction technique FKL is proposed and is tested by handwritten numeral recognition experiment. While the canonical discriminant analysis maximizes the variance ratio (F-ratio), and the principal component analysis (K-L expansion) minimizes the mean square error of dimension reduction, the FKL optimizes both the F-ratio and the mean square error simultaneously. The result of experiment shows that the FKL provides the richest features in discriminating power for the limited class problem when compared with other techniques including the canonical discriminant analysis, the principal component analysis, and the orthonormal discriminant vector method (ODV).","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":"125833865","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":"Sampling density for image analysis","authors":"I. Young","doi":"10.1109/ICPR.1996.547194","DOIUrl":"https://doi.org/10.1109/ICPR.1996.547194","url":null,"abstract":"We show that the convergence of measures for object size to their \"true values\" can be analyzed by looking at the pixels (or voxels) on the border of the object. This leads to results for a proper choice for the sampling density of the asymptotic form CV=/spl sigma//spl mu/=k/spl middot/Q/sup -(N+1/2)/ where Q is the sampling density (pixels per object \"diameter\") and N is the number of spatial dimensions.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"32 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":"126005473","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}