{"title":"An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition","authors":"Wenjie Cai, S. Uchida, H. Sakoe","doi":"10.1109/ICPR.2006.241","DOIUrl":"https://doi.org/10.1109/ICPR.2006.241","url":null,"abstract":"This paper investigates improvements of an online handwriting stroke-order analysis algorithm - cube search, based on cube graph stroke-order generation model and dynamic programming (DP). By dividing character into radicals, the model is decomposed into intra-radical graphs and an inter-radical graph. This decomposition considerably reduces the time complexity of stroke-order search DP. Experimental results showed an significant improvements in operational speed. Additionally, recognition accuracy was also improved by prohibiting unnatural stroke-order","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"24 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123699614","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}
Alahari Karteek, Satya Lahari Putrevu, C. V. Jawahar
{"title":"Learning Mixtures of Offline and Online features for Handwritten Stroke Recognition","authors":"Alahari Karteek, Satya Lahari Putrevu, C. V. Jawahar","doi":"10.1109/ICPR.2006.752","DOIUrl":"https://doi.org/10.1109/ICPR.2006.752","url":null,"abstract":"In this paper we propose a novel scheme to combine offline and online features of handwritten strokes. The state-of-the-art methods in handwritten stroke recognition have used a pre-determined combination of these features, which is not optimal in all situations. The proposed model addresses this issue by learning mixtures of offline and online characteristics from a set of exemplars. Each stroke is represented as a probabilistic sequence of substrokes with varying compositions of these features. The model adapts to any stroke and chooses the feature composition that best characterizes it. The superiority of the method is demonstrated on handwritten numeral and character strokes","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123774965","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 Generalization Performance of Learning Machine Based on Phi-mixing Sequence","authors":"Bin Zou, Luoqing Li","doi":"10.1109/ICPR.2006.1118","DOIUrl":"https://doi.org/10.1109/ICPR.2006.1118","url":null,"abstract":"The generalization performance is the important property of learning machines. It has been shown previously by Vapnik, Cucker and Smale that, the empirical risks of learning machine based on i.i.d. sequence must uniformly converge to their expected risks as the number of samples approaches infinity. This paper extends the results to the case where the i.i.d. sequence is replaced by phi-mixing sequence. We establish the rate of uniform convergence of learning machine by using Bernstein's inequality for phi-mixing sequence, and estimate the sample error of learning machine. In the end, we compare these bounds with known results","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"8 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125300259","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}
F. Gayubo, Jose Luis Navarro Gonzalez, Eusebio de la Fuente López, F. M. Trespaderne, J. Perán
{"title":"On-line machine vision system for detect split defects in sheet-metal forming processes","authors":"F. Gayubo, Jose Luis Navarro Gonzalez, Eusebio de la Fuente López, F. M. Trespaderne, J. Perán","doi":"10.1109/ICPR.2006.902","DOIUrl":"https://doi.org/10.1109/ICPR.2006.902","url":null,"abstract":"In this paper, we present an automatic system designed for detect the presence of split defects in sheet-metal forming processes. The image acquisition system includes basically a CCD progressive camera and a diffuse illumination system mounted on the end-effector of a 6-dof robot. The inspection-robot displaces the image acquisition system over the pieces proceeding from the sheet-metal forming line. The recognition, positioning and the later inspection are realized as the pieces are moving on a conveyor belt. To realize the inspection, the acquired images are restored using a Markov random field model. Defect detection is carried out using a valley detection algorithm. To realize the recognition and to determine the precise position, we have used an appearance-based method, based on a principal component analysis (PCA)","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125399364","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":"Real-time Sound Source Localization Based on Audiovisual Frequency Integration","authors":"Tokuo Tsuji, Kenichi Yamamoto, I. Ishii","doi":"10.1109/ICPR.2006.967","DOIUrl":"https://doi.org/10.1109/ICPR.2006.967","url":null,"abstract":"We propose a pixelwise sound source localization algorithm based on audiovisual frequency integration. The localization is realized by detecting the common vibration dynamics of sound sources in the audio and the brightness signal. In order to detect the common vibration dynamics, temporal correlation values between the two signals are calculated in the algorithm. Several experimental results are shown for vibrated objects, and the pixelwise sound source localization images are obtained","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125403008","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 New Affine Invariant Curve Normalization Technique Using Independent Component Analysis","authors":"Sait Sener, M. Unel","doi":"10.1109/ICPR.2006.111","DOIUrl":"https://doi.org/10.1109/ICPR.2006.111","url":null,"abstract":"A new affine invariant curve normalization method using independent component analysis (ICA) is presented. First, principal component analysis (PCA) is used for translation, scale and shear normalization. ICA and the third order moments are then employed for rotation and reflection normalization. It is shown that all affine transformed versions of an object have a unique or canonical representation. Experiments are conducted to asses the robustness of our approach. Proposed normalization technique can be used as a pre-processing for object modeling and recognition","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125496959","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":"Flag Guided Integration of Multiple Registered Range Images","authors":"Hong Zhou, Yonghuai Liu","doi":"10.1109/ICPR.2006.580","DOIUrl":"https://doi.org/10.1109/ICPR.2006.580","url":null,"abstract":"Integration of multiple registered range images finds applications in numerous areas. While most existing integration algorithms detect corresponding points between neighbouring views based on interpoint distances, we define in this paper corresponding area for each point and then carry out geometrical, rigidity, and orientation tests for the same purpose, not only reflecting the scanning nature of sampling resolution, but also the geometry of object surface. To more accurately fuse corresponding points, while most existing algorithms consider the confidence of points, we consider an accumulative fusion scheme of confidences, reflecting the number of times of observation. The fused points are finally triangulated using the improved Delaunay triangulation method, guaranteeing a watertight surface. A comparative study based on real images shows that the proposed algorithm is accurate and efficient and is able to compensate both the accumulative registration errors and imaging noise","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125557091","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 of Musically Similar Polyphonic Music","authors":"Michael Chan, John Potter","doi":"10.1109/ICPR.2006.973","DOIUrl":"https://doi.org/10.1109/ICPR.2006.973","url":null,"abstract":"When are two pieces of music similar? Others have tackled this problem either by considering the acoustic signals of musical performances, or by looking at features of a symbolic rendition of the piece, either as MIDI data or as some direct representation of the music score. This paper presents a new approach to assessing the similarity of polymorphic music segments by combining a feature-driven clustering approach with one that measures the contrapuntal similarity of the segments. On a composer classification task, our techniques achieved almost 80% accuracy when applied to a large database of short music segments from four classical composers. This is a significant improvement to other work on composer classification based on melodic themes","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126720235","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":"Concurrent Stereo under Photometric Image Distortions","authors":"G. Gimel'farb, Jiang Li, John Morris, P. Delmas","doi":"10.1109/ICPR.2006.401","DOIUrl":"https://doi.org/10.1109/ICPR.2006.401","url":null,"abstract":"We have improved our concurrent stereo matching (CSM) algorithm, which abandons the search for 'best' matches and determine matches that lie within admissible ranges using a noise model. We estimate photometric deviations between corresponding regions of stereo pairs with photometric transformations and mismatched or occluded regions. We allow for global, disparity dependent contrast and offset (gain and dark noise) distortions as well as multiple outliers. Noise is estimated for each pixel at each disparity level and the CSM framework applied. Outliers are eliminated with a statistical model and likely matching volumes identified. Then, starting in the foreground, the volumes are explored to select mutually consistent optical surfaces. Finally, local, not global, surface continuity and visibility constraints are applied to generate a disparity map. This approach compares well with other matching algorithms: the more realistic matching model allows for signal contrast and offset variations over the whole image","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116386041","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":"Image template matching using Mutual Information and NP-Windows","authors":"N. Dowson, R. Bowden, T. Kadir","doi":"10.1109/ICPR.2006.691","DOIUrl":"https://doi.org/10.1109/ICPR.2006.691","url":null,"abstract":"A non-parametric (NP) sampling method is introduced for obtaining the joint distribution of a pair of images. This method based on NP windowing and is equivalent to sampling the images at infinite resolution. Unlike existing methods, arbitrary selection of kernels is not required and the spatial structure of images is used. NP windowing is applied to a registration application where the mutual information (MI) between a reference image and a warped template is maximised with respect to the warp parameters. In comparisons against the current state of the art MI registration methods NP windowing yielded excellent results with lower bias and improved convergence rates","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"613 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116397911","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}