Invariant Recognition of Hand-Drawn Pictograms Using HMMs with a Rotating Feature Extraction

Size: px
Start display at page:

Download "Invariant Recognition of Hand-Drawn Pictograms Using HMMs with a Rotating Feature Extraction"

Transcription

1 Invariant Recognition of Hand-Drawn Pictograms Using HMMs with a Rotating Feature Extraction Stefan Müller, Gerhard Rigoll, Andreas Kosmala and Denis Mazurenok Department of Computer Science, Faculty of Electrical Engineering Gerhard-Mercator-University Duisburg, Germany In this paper, we present a new feature extraction technique and a novel Hidden Markov Model (HMM) based classifier for the rotation, translation and scale invariant recognition of handdrawn pictograms. The feature extraction is performed by taking a fixed dimensional vector along the radius of a circle surrounding the pictogram. Within the HMM-framework these features are used to classify the pictogram and to estimate the rotation angle of the pattern using the segmentation power of the Markov Models. Three variations of the classifier design are presented, giving the option to choose between recognition with preferred rotation angles and fully rotation invariant recognition. The proposed techniques show high recognition rates up to 99.5% on two large pictogram databases consisting of 20 classes, where significant shape variations occur within each class due to differences in how each element is drawn. In order to obtain a detailed evaluation of our methods, experimental results for conventional approaches utilizing moments and neural nets are given in comparison. The techniques can be easily adapted to handle grey scale or colour images and we demonstrate this by showing some results of our experimental image retrieval by user sketch system which serves also as an example for future applications. 1 Introduction Invariant recognition of patterns is considered a highly complex and difficult task and has many applications such as e.g. optical character recognition (OCR), target identification and industrial part identification. Many suggestions to solve this task have been made (an overview is given in ) ranging from invariant feature extraction methods like moments and integral transforms to invariant classifiers such as special neural networks. This paper deals with the invariant recognition of hand-written pictograms or sketches, a task which involves additional challenges due to the well-known varieties in handwriting of even one single person. Two publications which addressed the task before share a subset of the classes in our database as well as the use of HMMs with us. He and Kundu described a method to recognize closed shapes with a combined HMM and autoregressive (AR) model. They used a database consisting of eight classes, which are part of our 20 class database, shown in Fig. 1. Due to their proposed features which consist of radii from the centre of gravity to the shape boundary, they are limited to classify shapes rather than unconstrained pictograms such as the classes 10, 11 or 13 in Fig. 1. He and Kundu use HMMs to classify the patterns. The desired rotation invariance is implemented as a preprocessing step prior to the feature extraction, by rotating all shapes to the same orientation. In a first step, the pattern is rotated by aligning the so called elongation axis to a given -axis. As stated in the paper, this method does not always yield the most similar radii sequence for the shapes of the same class. Thus, a second processing step based on a minimum radius point quantity especially for classes with symmetry properties (e.g. Class 8 1

2 ; ; Class 1 Class 2 Class 3 Class Class 5 Class 6 Class 7 Class 8 Class 9 Class 10 Class 11 Class 12 Class 13 Class 1 Class 15 Class 16 Class 17 Class 18 Class 19 Class 20 Figure 1: Sample pictograms and sketches from our 20 class database. in Fig. 1) has been introduced. After the above steps, a third preprocessing step is needed, whenever the shape has a two-way ambiguity like Class 1 in Fig. 1. Hence, this is a rather complicated procedure. Lee and Lovell carried out experiments on the same eight class closed shape task. Like He and Kundu they use the preprocessing steps to rotate the patterns prior to the feature extraction. The features itself are again the radii from the centre of gravity to the shape boundary. The major difference of their approach is that the classification technique is based on a vector quantizer (VQ) instead of HMMs. In our approach, we propose a novel feature extraction method combined with an HMM classifier. Instead of using a complicated procedure based on rules and three different processing steps we make use of the HMM segmentation abilities to perform rotation invariant recognition. 2 Introduction to Hidden Markov Models (HMMs) Hidden Markov Models are finite stochastic automata which have been successfully applied to continuous speech and online handwriting recognition. Fig. 2 shows a continuous three state HMM with transition probabilities and output probability density functions (pdfs), where denotes the actual state at time, is a distinct state and denotes an observation vector. The pdf of state is usually given by a finite Gaussian mixture of the form "!$# %'& %+*, - %,/.0 % (1) )( where % is the mixture coefficient for the 1 th mixture and *, - %,.0 % is a multivariate ( Gaussian density with mean vector - % and covariance matrix.0 %. An HMM 23,., with N states is fully described by the N 5 N-dimensional transition matrix., the N-dimensional output pdf vector and the initial state distribution vector which consists of the probabilities 6 78 & 9 :. After the model 2 has been trained using the Baum-Welch-Algorithm, feature sequences <,==:=,?> can be scored according to (2) 2

3 ; ; ; a 11 a 22 a 33 a 12 a 23 s s s b b b Usually the likelihood 7 Figure 2: Continuous linear Hidden Markov Model 2 is estimated by the Viterbi algorithm, which is an,:==:=, >. During the recog- approximation based on the most likely state sequence nition step unknown patterns can be classified by the following Maximum-Likelihood (ML) decision: p arg p ' G2 p (3) This classifies a given observation sequence to class p. A very detailed explanation of the HMM-framework is given by Rabiner in. For our rotation invariant recognition, it is important to note that HMMs can be connected to form larger units from single models (e.g. in continuous speech, word models can be built from phones which are represented by single HMMs). The detailed description of our system is given in the next sections, starting with the feature extraction. 3 New Feature Extraction Method The new feature extraction is illustrated in Fig. 3. Our method is applicable to rather unconstrained pictograms or sketches and is not limited to closed contour shapes. The pattern is transformed into a vector sequence,=:==:,?> by dividing a surrounding circle into T rectangular stripes and each stripe into N blocks. For each block the percentage of black pixels is calculated. Thus, the sequence has a length of T observations and each observation consists of an N dimensional vector. The first vector is always the one corresponding to the stripe at the twelve o clock position, further feature vectors are taken clockwise. The centre of the circle is placed at the so called centre of gravity (COG) and the length of the stripes is equal to the distance between the COG and the maximum radius point. This kind of feature extraction has been proven to be translation and scale invariant by our experiments. Additionally, this technique can be adapted to the use of grey scale or colour images and can be applied together with the rotation invariant classifier to the task of rotation invariant image retrieval. Note that for the embedded training and for the recognition the feature sequence is presented twice, as described in the next section. Novel Rotation Invariant Modeling The basic idea of the novel rotation invariant HMM classifier is to present the feature sequence, generated as described in Sec. 3, twice and to use the combined seg- 3

4 mentation and classification abilities of the HMM recognizer to align the sequence (,=:==:,?>,?>,:===, > ) to models describing a part of the pictogram, then the pictogram itself and finally the remaining part of the pictogram. The two incomplete parts of the pictogram can be modeled either by a so called filler model or by a dublicated and modified pictogram HMM. This idea is illustrated in Fig., where a pictogram from Class 13 is given and the segmentation into samples belonging to the HMMs filler and Class 13 is shown. During decoding, the features extracted in T-1 T HMM filler HMM Class 13 HMM filler T stripes per 360 N blocks per stripe surrounding circle [ 0.00, 0.08, 0.11, 0.00, 0.10 ] Figure 3: Proposed rotating feature extraction Figure : Alignment of the pictogram and filler HMMs to the twice presented feature sequence circular direction along the dashed line are expected to be emitted by the first filler model, whereas the dotted line indicates the features of the complete pictogram, while the features extracted along the dash-dotted line will be aligned against the final filler model. It can be seen in the figure, that once the alignment to the Markov Models has been found, the rotation angle is given by the number of frames which have been aligned to the first or second filler model. This combination of angle estimation and classification during the recognition process is much more elegant than the complicated preprocessing steps presented in. The structure of the Markov Models, starting with the original idea and followed by variations thereof, is presented in the next sections..1 Filler Modeling The first approach for modeling rotated pictograms is by surrounding the unrotated pictogram HMM by filler HMMs which have been initially trained on the first half of the feature sequence (,=:==, > ) of all classes. The Baum-Welch reestimation scheme can be used for the embedded training of the concatenated HMMs, shown in

5 Fig. 5. In the figure, there is an additional model, consisting of two HMMs which are trained on Class p, which is used for the unrotated pattern. Hence, if one of these two models produces the Maximum Likelihood output for a given feature sequence, the pictogram is classified to Class p. In our experiments we used quite small filler HMM filler HMM filler Figure 5: Two models representing a single pictogram class. The upper HMM is for modeling unrotated, the model below is for rotated pictograms. HMMs (3 5 states) which leads to a short decoding time. Due to the presentation of a finite training set, the filler models prefer the rotation angles seen during training. This is desired in some cases, for example to recognize slightly rotated versions of handwritten digits like 6 and 9. To build a totally invariant recognition scheme, we invented the modeling based on a modification of the initial state and the exit distribution..2 Modeling with Modified Initial State and Exit Distributions An alternative approach for rotation invariant Markov modeling is to combine the model for unrotated pictograms with two basically identical models but modified initial state and exit distributions. This is shown in Fig. 6. The components of the initial state distribution vector are all set to n where n denotes the dimension of as well as the number of HMM states. This guarantees the invariant recognition without preferring any rotation angles. The exit transitions are modified in a similar way, which means that every state in the third HMM can be the final one if the end of a feature sequence is reached. This is different from the HMMs introduced in Sec..1, where the Markov Model has to be in the final state, once the end of the feature sequence is reached. The proposed modeling technique can be used as a postprocessing step after the training of the HMMs according to Sec..1 has been performed. In that pre post Figure 6: Method 2 uses models with three identical HMMs but modified initial state and exit distributions. 5

6 case, the filler models are removed after training and the structure in Fig. 6 is build from. Alternatively, the structure can be trained directly, but in this case the initial state distribution vector would be changed and preferred rotation angles would occur. The decoding using this modeling is slower compared to the one which uses the filler HMMs because the higher number of states is computationally more expensive than the use of more Markov Models. Again the rotation angle can be derived from the alignment of the three HMMs (see also Fig. )..3 Cyclic Permutation of States The third proposed modeling technique uses a much higher number of models per class than the ones described above. For each class, the trained model is duplicated n times, where n denotes the number of states. Thereafter, the states of the models are permutated in such a way, that each state becomes the entry state once and also the last state in a different model (cyclic permutation). The other states are arranged as indicated in Fig. 7. Thus we get n models for each class and we only have to present the feature sequence once. Therefore, the rotation angle cannot be estimated n n-1 1 n-1 n 1... n n Figure 7: Cyclic permutation of HMM-states Figure 8: Five unrotated and five rotated pictograms, taken from Class 9 of the stm database. as shown previously, but is indicated by the configuration of the Markov Model with the Maximum Likelihood for the observation probability (i.e. the model at the top of Fig. 7 corresponds to, the model below to n where n denotes the number of states, etc.). Hence, the angle estimation of this approach is less accurate compared to those of the methods introduced above. This is due to the angle quantization of n which is larger than the quantization based on the frame alignment. We used this method only as a postprocessing step after the training procedure described in Sec..1 has been applied. This results in an invariant recognition without any preferred rotation angles, like the proposed method in Sec..2. It is also possible to train these models directly, but there is a more complex labeling required, compared to the other proposed classifier, because one has to label on the HMM level. Due to the large 6

7 number of models in this approach, the Viterbi-decoding is much slower compared to the other methods. To speed up this decoding process, the states in the models of the same class can be tied so that the time needed for calculating output probabilities is reduced drastically. 5 Experiments and Results To verify the proposed rotation invariant recognition approaches, we carried out a number of experiments on two large pictogram databases. After a short description of these databases, recognition results will be given and compared with recognition accuracies achieved using invariant features such as geometric and Zernike moments together with a neural net classifier. Finally we present our experimental image retrieval by user sketch system which serves as an example for future applications. 5.1 Database Our databases have been built by two different persons, denoted as stm and dib in the following. Both consist of 10 unrotated and 20 rotated hand-drawn pictograms for each of the 20 classes introduced in Fig. 1. These drawings were taken as two-level bitmap files from a digitizer board. The 20 rotated pictograms are split into a test and training set, consisting of 10 samples each. To demonstrate the large intraclass variance and the amount of contour perturbation, ten examples of Class 9 from the stm database are shown in Fig. 8. The results in the following section are given for both databases. 5.2 Results and Comparison with Moment Invariants In the experiments, we used 30 state HMMs and five state filler models, each state probability density function consisted of four mixtures. Features were extracted using 36 stripes and five blocks per stripe. The recognition results are given in Tab. 1, separated for the stm and the dib database. In the first row, the results for the modeling technique presented in Sec..1 are shown. The next two rows present the recognition rates for the HMMs with modified entry state distributions (Sec..2) separated in results for using this technique as a postprocessing step and for embedded training of these modified models. Thereafter, the recognition rates for method 3 are given in row. The two separated rows show results for the approaches presented in Sec..2 and Sec..3, respectively, this time for experiments done without an embedded training step. This means that no rotated pictogram patterns are presented during training. The models are simply trained using unrotated patterns and modified according to the proposed methods thereafter. Overall the experiments with the proposed techniques show very good results with high recognition rates, comparable to those presented in, but performed on databases with more than twice as much classes. When using the modified entry state distribution approach during embedded training, the recognition performance is weak compared to the other proposed methods. This is due to an overfitting problem resulting from a finite number of training patterns causing the 7

8 Table 1: Recognition accuracy achieved in the experiments. method see also stm dib average filler modeling only Sec % 98.5% 99.0% filler modeling + modified Sec % 98.5% 99.0% modified only Sec % 92.5% 95.0% filler modeling + permutation Sec % 99.5% 99.5% modified without Sec % 95.0% 95.8% embedded training permutation without Sec % 98.5% 98.0% embedded training entry state distribution vector to have components other than n, which we already mentioned in Sec..2. The other approaches perform very well, with the permutation method performing slightly better. However, this is the computational most expensive method having the additional disadvantage of a less accurate estimation of the rotation angle. As mentioned in Sec..3, state tying can be used to reduce the computational costs, but this technique can also be combined with the other approaches (e.g. many states in HMMs representing the classes 2, 3, 5 or 6 can be tied due to symmetry). In order to obtain a detailed evaluation of our proposed methods, we also used conventional approaches utilizing invariant features and neural networks, to classify the pictograms of our databases. Translation, rotation and scale invariant features based on geometric moments have been introduced by Hu in. Discrete geometric moments of a pattern, of order are given by the 9!! 1, () However, these moments are not translation invariant and thus central moments were defined (5) where, are the coordinates of the COG. So called normalized moments can be defined (6) which are also scale invariant. From a nonlinear combination of these functions up to order three Hu derived seven moment invariants which are also translation, scale and also rotation invariant. These Hu invariants are listed e.g. in. Later Li derived 52 moment invariants using normalized moments up to order nine. Other sets of moments have been used including Legendre, complex and Zernike moments. In it is shown that Zernike moments and geometric moments are related by! "! #$! % F '&)(& &! * * % &,+ 8 %.-0/ 132 / / 1 25 * * 67 6 % % (7)

9 5 Table 2: Recognition accuracies achieved using moment invariants and a neural network classifier method stm dib average 9 moment invariants (Hu) 52.0% 6.5% 9.25% 52 moment invariants (Li) 99.0% 99.0% 99.0% Zernike moments 99.5% 96.5% 98.0% where are the complex Zernike moments, + and. 5 * * 6 is given by * * 6 6 G G G/ / /, We carried out experiments on our pictogram databases using the seven Hu moments, 52 Li moments and Zernike moments as invariant features together with a neural network classifier (MLP with a single hidden layer). The recognition accuracies are presented in Tab. 2. Overall, the results achieved using the moment invariants are slightly worse compared to those presented in Tab. 1 and additionally no angle estimation is given during the classification step. 5.3 Experimental Image Retrieval by User Sketch System The recognition rates presented in the rows five and six of Tab. 1 show that the use of the proposed methods for image retrieval tasks, with no rotated training data being available, is feasible. To demonstrate that the proposed methods can be adapted easily to natural images, we built an experimental image retrieval system, where queries can be formulated by user sketches. The feature extraction of the sketches and the binarized images is performed as described in Sec. 3. Hidden Markov Models with modified initial state and exit distributions as shown in Fig. 6 have been built for every element of the image database. After presenting the features of the sketch to the HMMs, the scores calculated according to Eq. 2 are used as a measure of the similarity between the database element and the sketch. Fig. 9 shows some results achieved with our system, where in every row the query sketch is shown first, followed by those three images with the highest similarity score. However, for improved results on a recognition or retrieval task on natural images, the features should include colour information. 6 Summary and Conclusions We presented a new feature extraction method and a novel HMM classifier applicable to the invariant recognition of rotated hand-drawn pictograms or sketches. Features are extracted by dividing a circle, which surrounds the pictogram, into rectangular stripes and by calculating for each stripe a vector of grey values. Three different approaches for the invariant classification using HMMs are presented. These three methods have in common that the rotation angle can be derived from the alignment 9 (8)

10 Figure 9: Query sketches and retrieved images of the features to the Markov Models. Furthermore, depending on the configuration of the HMMs, preferred angles or unconstrained rotation invariance can be achieved. Recognition rates up to 99.5% on two separate databases of hand-drawn pictograms for 20 classes are presented. We believe that our approach has several advantages compared to standard algorithms used for invariant recognition. Among these is the possibility of a simple feature extraction (as compared to the computation of most invariant features) and an efficient decoding leading to real-time capabilities even for large databases. The proposed recognition approach can easily be adapted to recognition or retrieval tasks on natural images. In this case, the use of colour fits naturally into the HMM framework, where the relation between observation vector components derived from different colours can be expressed by the covariance matrix of the Gaussian mixture. References 1. J. Wood, Invariant Pattern Recognition: A Review, Pattern Recognition, Vol. 29, No. 1, 1996, pp Y. He, A. Kundu, 2-D Shape Classification Using Hidden Markov Model, IEEE Transactions on PAMI, Vol. 13, No. 11, 1991, pp S. Lee, B. Lovell, Modelling and Classification of Shapes in Two-Dimensions Using Vector Quantisation,Proc. IEEE-ICASSP, 199, pp. V11 V1.. L.R. Rabiner, A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition, Proc. IEEE, Vol. 77, No. 2, Feb. 1989, pp M. K. Hu, Visual pattern recognition by moment invariants, IEEE Transactions on Information Theory, Vol. 8, 1962, pp Y. Li, Reforming the Theory of Invariant Moments for Pattern Recognition, Pattern Recognition, Vol. 25, No. 7, 1992, pp C.-H. Teh, R. T. Chin, On Image Analysis by the Methods of Moments, IEEE Transactions on PAMI, Vol. 10, No., 1988, pp

HMM-Based Handwritten Amharic Word Recognition with Feature Concatenation

HMM-Based Handwritten Amharic Word Recognition with Feature Concatenation 009 10th International Conference on Document Analysis and Recognition HMM-Based Handwritten Amharic Word Recognition with Feature Concatenation Yaregal Assabie and Josef Bigun School of Information Science,

More information

A Visualization Tool to Improve the Performance of a Classifier Based on Hidden Markov Models

A Visualization Tool to Improve the Performance of a Classifier Based on Hidden Markov Models A Visualization Tool to Improve the Performance of a Classifier Based on Hidden Markov Models Gleidson Pegoretti da Silva, Masaki Nakagawa Department of Computer and Information Sciences Tokyo University

More information

Building Multi Script OCR for Brahmi Scripts: Selection of Efficient Features

Building Multi Script OCR for Brahmi Scripts: Selection of Efficient Features Building Multi Script OCR for Brahmi Scripts: Selection of Efficient Features Md. Abul Hasnat Center for Research on Bangla Language Processing (CRBLP) Center for Research on Bangla Language Processing

More information

Skill. Robot/ Controller

Skill. Robot/ Controller Skill Acquisition from Human Demonstration Using a Hidden Markov Model G. E. Hovland, P. Sikka and B. J. McCarragher Department of Engineering Faculty of Engineering and Information Technology The Australian

More information

CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS

CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS CHAPTER 4 CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS 4.1 Introduction Optical character recognition is one of

More information

An Introduction to Pattern Recognition

An Introduction to Pattern Recognition An Introduction to Pattern Recognition Speaker : Wei lun Chao Advisor : Prof. Jian-jiun Ding DISP Lab Graduate Institute of Communication Engineering 1 Abstract Not a new research field Wide range included

More information

Time series, HMMs, Kalman Filters

Time series, HMMs, Kalman Filters Classic HMM tutorial see class website: *L. R. Rabiner, "A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition," Proc. of the IEEE, Vol.77, No.2, pp.257--286, 1989. Time series,

More information

The Method of User s Identification Using the Fusion of Wavelet Transform and Hidden Markov Models

The Method of User s Identification Using the Fusion of Wavelet Transform and Hidden Markov Models The Method of User s Identification Using the Fusion of Wavelet Transform and Hidden Markov Models Janusz Bobulski Czȩstochowa University of Technology, Institute of Computer and Information Sciences,

More information

HOUGH TRANSFORM CS 6350 C V

HOUGH TRANSFORM CS 6350 C V HOUGH TRANSFORM CS 6350 C V HOUGH TRANSFORM The problem: Given a set of points in 2-D, find if a sub-set of these points, fall on a LINE. Hough Transform One powerful global method for detecting edges

More information

One Dim~nsional Representation Of Two Dimensional Information For HMM Based Handwritten Recognition

One Dim~nsional Representation Of Two Dimensional Information For HMM Based Handwritten Recognition One Dim~nsional Representation Of Two Dimensional Information For HMM Based Handwritten Recognition Nafiz Arica Dept. of Computer Engineering, Middle East Technical University, Ankara,Turkey nafiz@ceng.metu.edu.

More information

Digital Image Processing

Digital Image Processing Digital Image Processing Part 9: Representation and Description AASS Learning Systems Lab, Dep. Teknik Room T1209 (Fr, 11-12 o'clock) achim.lilienthal@oru.se Course Book Chapter 11 2011-05-17 Contents

More information

Hidden Markov Model for Sequential Data

Hidden Markov Model for Sequential Data Hidden Markov Model for Sequential Data Dr.-Ing. Michelle Karg mekarg@uwaterloo.ca Electrical and Computer Engineering Cheriton School of Computer Science Sequential Data Measurement of time series: Example:

More information

ModelStructureSelection&TrainingAlgorithmsfor an HMMGesture Recognition System

ModelStructureSelection&TrainingAlgorithmsfor an HMMGesture Recognition System ModelStructureSelection&TrainingAlgorithmsfor an HMMGesture Recognition System Nianjun Liu, Brian C. Lovell, Peter J. Kootsookos, and Richard I.A. Davis Intelligent Real-Time Imaging and Sensing (IRIS)

More information

MORPHOLOGICAL BOUNDARY BASED SHAPE REPRESENTATION SCHEMES ON MOMENT INVARIANTS FOR CLASSIFICATION OF TEXTURES

MORPHOLOGICAL BOUNDARY BASED SHAPE REPRESENTATION SCHEMES ON MOMENT INVARIANTS FOR CLASSIFICATION OF TEXTURES International Journal of Computer Science and Communication Vol. 3, No. 1, January-June 2012, pp. 125-130 MORPHOLOGICAL BOUNDARY BASED SHAPE REPRESENTATION SCHEMES ON MOMENT INVARIANTS FOR CLASSIFICATION

More information

ECE521: Week 11, Lecture March 2017: HMM learning/inference. With thanks to Russ Salakhutdinov

ECE521: Week 11, Lecture March 2017: HMM learning/inference. With thanks to Russ Salakhutdinov ECE521: Week 11, Lecture 20 27 March 2017: HMM learning/inference With thanks to Russ Salakhutdinov Examples of other perspectives Murphy 17.4 End of Russell & Norvig 15.2 (Artificial Intelligence: A Modern

More information

Online Feature Extraction Technique for Optical Character Recognition System

Online Feature Extraction Technique for Optical Character Recognition System Online Feature Extraction Technique for Optical Character Recognition System Khairun Saddami 1,2, Khairul Munadi 1,2,3 and Fitri Arnia 1,2,3,* 1 Doctoral Program of Engineering, Faculty of Engineering,

More information

Multi prototype fuzzy pattern matching for handwritten character recognition

Multi prototype fuzzy pattern matching for handwritten character recognition Multi prototype fuzzy pattern matching for handwritten character recognition MILIND E. RANE, DHABE P. S AND J. B. PATIL Dept. of Electronics and Computer, R.C. Patel Institute of Technology, Shirpur, Dist.

More information

Handwritten Gurumukhi Character Recognition by using Recurrent Neural Network

Handwritten Gurumukhi Character Recognition by using Recurrent Neural Network 139 Handwritten Gurumukhi Character Recognition by using Recurrent Neural Network Harmit Kaur 1, Simpel Rani 2 1 M. Tech. Research Scholar (Department of Computer Science & Engineering), Yadavindra College

More information

Identifying Layout Classes for Mathematical Symbols Using Layout Context

Identifying Layout Classes for Mathematical Symbols Using Layout Context Rochester Institute of Technology RIT Scholar Works Articles 2009 Identifying Layout Classes for Mathematical Symbols Using Layout Context Ling Ouyang Rochester Institute of Technology Richard Zanibbi

More information

Fully Automatic Methodology for Human Action Recognition Incorporating Dynamic Information

Fully Automatic Methodology for Human Action Recognition Incorporating Dynamic Information Fully Automatic Methodology for Human Action Recognition Incorporating Dynamic Information Ana González, Marcos Ortega Hortas, and Manuel G. Penedo University of A Coruña, VARPA group, A Coruña 15071,

More information

Pattern Recognition. Kjell Elenius. Speech, Music and Hearing KTH. March 29, 2007 Speech recognition

Pattern Recognition. Kjell Elenius. Speech, Music and Hearing KTH. March 29, 2007 Speech recognition Pattern Recognition Kjell Elenius Speech, Music and Hearing KTH March 29, 2007 Speech recognition 2007 1 Ch 4. Pattern Recognition 1(3) Bayes Decision Theory Minimum-Error-Rate Decision Rules Discriminant

More information

CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS

CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS B.Vanajakshi Department of Electronics & Communications Engg. Assoc.prof. Sri Viveka Institute of Technology Vijayawada, India E-mail:

More information

Handwritten Script Recognition at Block Level

Handwritten Script Recognition at Block Level Chapter 4 Handwritten Script Recognition at Block Level -------------------------------------------------------------------------------------------------------------------------- Optical character recognition

More information

Constraints in Particle Swarm Optimization of Hidden Markov Models

Constraints in Particle Swarm Optimization of Hidden Markov Models Constraints in Particle Swarm Optimization of Hidden Markov Models Martin Macaš, Daniel Novák, and Lenka Lhotská Czech Technical University, Faculty of Electrical Engineering, Dep. of Cybernetics, Prague,

More information

On-line handwriting recognition using Chain Code representation

On-line handwriting recognition using Chain Code representation On-line handwriting recognition using Chain Code representation Final project by Michal Shemesh shemeshm at cs dot bgu dot ac dot il Introduction Background When one preparing a first draft, concentrating

More information

Face recognition using Singular Value Decomposition and Hidden Markov Models

Face recognition using Singular Value Decomposition and Hidden Markov Models Face recognition using Singular Value Decomposition and Hidden Markov Models PETYA DINKOVA 1, PETIA GEORGIEVA 2, MARIOFANNA MILANOVA 3 1 Technical University of Sofia, Bulgaria 2 DETI, University of Aveiro,

More information

Introduction to HTK Toolkit

Introduction to HTK Toolkit Introduction to HTK Toolkit Berlin Chen 2003 Reference: - The HTK Book, Version 3.2 Outline An Overview of HTK HTK Processing Stages Data Preparation Tools Training Tools Testing Tools Analysis Tools Homework:

More information

Some questions of consensus building using co-association

Some questions of consensus building using co-association Some questions of consensus building using co-association VITALIY TAYANOV Polish-Japanese High School of Computer Technics Aleja Legionow, 4190, Bytom POLAND vtayanov@yahoo.com Abstract: In this paper

More information

OCR For Handwritten Marathi Script

OCR For Handwritten Marathi Script International Journal of Scientific & Engineering Research Volume 3, Issue 8, August-2012 1 OCR For Handwritten Marathi Script Mrs.Vinaya. S. Tapkir 1, Mrs.Sushma.D.Shelke 2 1 Maharashtra Academy Of Engineering,

More information

Object Recognition Robust under Translation, Rotation and Scaling in Application of Image Retrieval

Object Recognition Robust under Translation, Rotation and Scaling in Application of Image Retrieval Object Recognition Robust under Translation, Rotation and Scaling in Application of Image Retrieval Sanun Srisuky, Rerkchai Fooprateepsiri? and Sahatsawat Waraklang? yadvanced Machine Intelligence Research

More information

Effect of Initial HMM Choices in Multiple Sequence Training for Gesture Recognition

Effect of Initial HMM Choices in Multiple Sequence Training for Gesture Recognition Effect of Initial HMM Choices in Multiple Sequence Training for Gesture Recognition Nianjun Liu, Richard I.A. Davis, Brian C. Lovell and Peter J. Kootsookos Intelligent Real-Time Imaging and Sensing (IRIS)

More information

Linear Discriminant Analysis in Ottoman Alphabet Character Recognition

Linear Discriminant Analysis in Ottoman Alphabet Character Recognition Linear Discriminant Analysis in Ottoman Alphabet Character Recognition ZEYNEB KURT, H. IREM TURKMEN, M. ELIF KARSLIGIL Department of Computer Engineering, Yildiz Technical University, 34349 Besiktas /

More information

A Comparison of Sequence-Trained Deep Neural Networks and Recurrent Neural Networks Optical Modeling For Handwriting Recognition

A Comparison of Sequence-Trained Deep Neural Networks and Recurrent Neural Networks Optical Modeling For Handwriting Recognition A Comparison of Sequence-Trained Deep Neural Networks and Recurrent Neural Networks Optical Modeling For Handwriting Recognition Théodore Bluche, Hermann Ney, Christopher Kermorvant SLSP 14, Grenoble October

More information

Ergodic Hidden Markov Models for Workload Characterization Problems

Ergodic Hidden Markov Models for Workload Characterization Problems Ergodic Hidden Markov Models for Workload Characterization Problems Alfredo Cuzzocrea DIA Dept., University of Trieste and ICAR-CNR, Italy alfredo.cuzzocrea@dia.units.it Enzo Mumolo DIA Dept., University

More information

Comparing Natural and Synthetic Training Data for Off-line Cursive Handwriting Recognition

Comparing Natural and Synthetic Training Data for Off-line Cursive Handwriting Recognition Comparing Natural and Synthetic Training Data for Off-line Cursive Handwriting Recognition Tamás Varga and Horst Bunke Institut für Informatik und angewandte Mathematik, Universität Bern Neubrückstrasse

More information

Recognition of Unconstrained Malayalam Handwritten Numeral

Recognition of Unconstrained Malayalam Handwritten Numeral Recognition of Unconstrained Malayalam Handwritten Numeral U. Pal, S. Kundu, Y. Ali, H. Islam and N. Tripathy C VPR Unit, Indian Statistical Institute, Kolkata-108, India Email: umapada@isical.ac.in Abstract

More information

Chapter 3. Speech segmentation. 3.1 Preprocessing

Chapter 3. Speech segmentation. 3.1 Preprocessing , as done in this dissertation, refers to the process of determining the boundaries between phonemes in the speech signal. No higher-level lexical information is used to accomplish this. This chapter presents

More information

Determination of 3-D Image Viewpoint Using Modified Nearest Feature Line Method in Its Eigenspace Domain

Determination of 3-D Image Viewpoint Using Modified Nearest Feature Line Method in Its Eigenspace Domain Determination of 3-D Image Viewpoint Using Modified Nearest Feature Line Method in Its Eigenspace Domain LINA +, BENYAMIN KUSUMOPUTRO ++ + Faculty of Information Technology Tarumanagara University Jl.

More information

Indian Multi-Script Full Pin-code String Recognition for Postal Automation

Indian Multi-Script Full Pin-code String Recognition for Postal Automation 2009 10th International Conference on Document Analysis and Recognition Indian Multi-Script Full Pin-code String Recognition for Postal Automation U. Pal 1, R. K. Roy 1, K. Roy 2 and F. Kimura 3 1 Computer

More information

Evaluation of Model-Based Condition Monitoring Systems in Industrial Application Cases

Evaluation of Model-Based Condition Monitoring Systems in Industrial Application Cases Evaluation of Model-Based Condition Monitoring Systems in Industrial Application Cases S. Windmann 1, J. Eickmeyer 1, F. Jungbluth 1, J. Badinger 2, and O. Niggemann 1,2 1 Fraunhofer Application Center

More information

Speech Recognition Lecture 8: Acoustic Models. Eugene Weinstein Google, NYU Courant Institute Slide Credit: Mehryar Mohri

Speech Recognition Lecture 8: Acoustic Models. Eugene Weinstein Google, NYU Courant Institute Slide Credit: Mehryar Mohri Speech Recognition Lecture 8: Acoustic Models. Eugene Weinstein Google, NYU Courant Institute eugenew@cs.nyu.edu Slide Credit: Mehryar Mohri Speech Recognition Components Acoustic and pronunciation model:

More information

CS 543: Final Project Report Texture Classification using 2-D Noncausal HMMs

CS 543: Final Project Report Texture Classification using 2-D Noncausal HMMs CS 543: Final Project Report Texture Classification using 2-D Noncausal HMMs Felix Wang fywang2 John Wieting wieting2 Introduction We implement a texture classification algorithm using 2-D Noncausal Hidden

More information

Shape Classification Using Regional Descriptors and Tangent Function

Shape Classification Using Regional Descriptors and Tangent Function Shape Classification Using Regional Descriptors and Tangent Function Meetal Kalantri meetalkalantri4@gmail.com Rahul Dhuture Amit Fulsunge Abstract In this paper three novel hybrid regional descriptor

More information

LECTURE 6 TEXT PROCESSING

LECTURE 6 TEXT PROCESSING SCIENTIFIC DATA COMPUTING 1 MTAT.08.042 LECTURE 6 TEXT PROCESSING Prepared by: Amnir Hadachi Institute of Computer Science, University of Tartu amnir.hadachi@ut.ee OUTLINE Aims Character Typology OCR systems

More information

A Document Image Analysis System on Parallel Processors

A Document Image Analysis System on Parallel Processors A Document Image Analysis System on Parallel Processors Shamik Sural, CMC Ltd. 28 Camac Street, Calcutta 700 016, India. P.K.Das, Dept. of CSE. Jadavpur University, Calcutta 700 032, India. Abstract This

More information

NOVATEUR PUBLICATIONS INTERNATIONAL JOURNAL OF INNOVATIONS IN ENGINEERING RESEARCH AND TECHNOLOGY [IJIERT] ISSN: VOLUME 2, ISSUE 1 JAN-2015

NOVATEUR PUBLICATIONS INTERNATIONAL JOURNAL OF INNOVATIONS IN ENGINEERING RESEARCH AND TECHNOLOGY [IJIERT] ISSN: VOLUME 2, ISSUE 1 JAN-2015 Offline Handwritten Signature Verification using Neural Network Pallavi V. Hatkar Department of Electronics Engineering, TKIET Warana, India Prof.B.T.Salokhe Department of Electronics Engineering, TKIET

More information

Assignment 2. Unsupervised & Probabilistic Learning. Maneesh Sahani Due: Monday Nov 5, 2018

Assignment 2. Unsupervised & Probabilistic Learning. Maneesh Sahani Due: Monday Nov 5, 2018 Assignment 2 Unsupervised & Probabilistic Learning Maneesh Sahani Due: Monday Nov 5, 2018 Note: Assignments are due at 11:00 AM (the start of lecture) on the date above. he usual College late assignments

More information

Feature scaling in support vector data description

Feature scaling in support vector data description Feature scaling in support vector data description P. Juszczak, D.M.J. Tax, R.P.W. Duin Pattern Recognition Group, Department of Applied Physics, Faculty of Applied Sciences, Delft University of Technology,

More information

WHAT YOU SHOULD LEARN

WHAT YOU SHOULD LEARN GRAPHS OF EQUATIONS WHAT YOU SHOULD LEARN Sketch graphs of equations. Find x- and y-intercepts of graphs of equations. Use symmetry to sketch graphs of equations. Find equations of and sketch graphs of

More information

Rotation and Scaling Image Using PCA

Rotation and Scaling Image Using PCA wwwccsenetorg/cis Computer and Information Science Vol 5, No 1; January 12 Rotation and Scaling Image Using PCA Hawrra Hassan Abass Electrical & Electronics Dept, Engineering College Kerbela University,

More information

Handwritten Hindi Numerals Recognition System

Handwritten Hindi Numerals Recognition System CS365 Project Report Handwritten Hindi Numerals Recognition System Submitted by: Akarshan Sarkar Kritika Singh Project Mentor: Prof. Amitabha Mukerjee 1 Abstract In this project, we consider the problem

More information

Recognition of online captured, handwritten Tamil words on Android

Recognition of online captured, handwritten Tamil words on Android Recognition of online captured, handwritten Tamil words on Android A G Ramakrishnan and Bhargava Urala K Medical Intelligence and Language Engineering (MILE) Laboratory, Dept. of Electrical Engineering,

More information

HAND-GESTURE BASED FILM RESTORATION

HAND-GESTURE BASED FILM RESTORATION HAND-GESTURE BASED FILM RESTORATION Attila Licsár University of Veszprém, Department of Image Processing and Neurocomputing,H-8200 Veszprém, Egyetem u. 0, Hungary Email: licsara@freemail.hu Tamás Szirányi

More information

The Curse of Dimensionality

The Curse of Dimensionality The Curse of Dimensionality ACAS 2002 p1/66 Curse of Dimensionality The basic idea of the curse of dimensionality is that high dimensional data is difficult to work with for several reasons: Adding more

More information

Lecture 11: Classification

Lecture 11: Classification Lecture 11: Classification 1 2009-04-28 Patrik Malm Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University 2 Reading instructions Chapters for this lecture 12.1 12.2 in

More information

Segmentation free Bangla OCR using HMM: Training and Recognition

Segmentation free Bangla OCR using HMM: Training and Recognition Segmentation free Bangla OCR using HMM: Training and Recognition Md. Abul Hasnat, S.M. Murtoza Habib, Mumit Khan BRAC University, Bangladesh mhasnat@gmail.com, murtoza@gmail.com, mumit@bracuniversity.ac.bd

More information

Journal of Asian Scientific Research FEATURES COMPOSITION FOR PROFICIENT AND REAL TIME RETRIEVAL IN CBIR SYSTEM. Tohid Sedghi

Journal of Asian Scientific Research FEATURES COMPOSITION FOR PROFICIENT AND REAL TIME RETRIEVAL IN CBIR SYSTEM. Tohid Sedghi Journal of Asian Scientific Research, 013, 3(1):68-74 Journal of Asian Scientific Research journal homepage: http://aessweb.com/journal-detail.php?id=5003 FEATURES COMPOSTON FOR PROFCENT AND REAL TME RETREVAL

More information

CS 231A Computer Vision (Winter 2014) Problem Set 3

CS 231A Computer Vision (Winter 2014) Problem Set 3 CS 231A Computer Vision (Winter 2014) Problem Set 3 Due: Feb. 18 th, 2015 (11:59pm) 1 Single Object Recognition Via SIFT (45 points) In his 2004 SIFT paper, David Lowe demonstrates impressive object recognition

More information

CIS 520, Machine Learning, Fall 2015: Assignment 7 Due: Mon, Nov 16, :59pm, PDF to Canvas [100 points]

CIS 520, Machine Learning, Fall 2015: Assignment 7 Due: Mon, Nov 16, :59pm, PDF to Canvas [100 points] CIS 520, Machine Learning, Fall 2015: Assignment 7 Due: Mon, Nov 16, 2015. 11:59pm, PDF to Canvas [100 points] Instructions. Please write up your responses to the following problems clearly and concisely.

More information

IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 10, NO. 6, NOVEMBER Inverting Feedforward Neural Networks Using Linear and Nonlinear Programming

IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 10, NO. 6, NOVEMBER Inverting Feedforward Neural Networks Using Linear and Nonlinear Programming IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 10, NO. 6, NOVEMBER 1999 1271 Inverting Feedforward Neural Networks Using Linear and Nonlinear Programming Bao-Liang Lu, Member, IEEE, Hajime Kita, and Yoshikazu

More information

DSW Feature Based Hidden Marcov Model: An Application on Object Identification

DSW Feature Based Hidden Marcov Model: An Application on Object Identification DSW Feature Based Hidden Marcov Model: An Application on Obect Identification Zheng Liang 1, Wang Taiqing 1, Wang Shengin 1 and Ding Xiaoqing 1 1 State Key Laboratory of Intelligent Technology and Systems

More information

Application of Geometry Rectification to Deformed Characters Recognition Liqun Wang1, a * and Honghui Fan2

Application of Geometry Rectification to Deformed Characters Recognition Liqun Wang1, a * and Honghui Fan2 6th International Conference on Electronic, Mechanical, Information and Management (EMIM 2016) Application of Geometry Rectification to Deformed Characters Liqun Wang1, a * and Honghui Fan2 1 School of

More information

Classification. Vladimir Curic. Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University

Classification. Vladimir Curic. Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University Classification Vladimir Curic Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University Outline An overview on classification Basics of classification How to choose appropriate

More information

application of learning vector quantization algorithms. In Proceedings of the International Joint Conference on

application of learning vector quantization algorithms. In Proceedings of the International Joint Conference on [5] Teuvo Kohonen. The Self-Organizing Map. In Proceedings of the IEEE, pages 1464{1480, 1990. [6] Teuvo Kohonen, Jari Kangas, Jorma Laaksonen, and Kari Torkkola. LVQPAK: A program package for the correct

More information

Dynamic Time Warping

Dynamic Time Warping Centre for Vision Speech & Signal Processing University of Surrey, Guildford GU2 7XH. Dynamic Time Warping Dr Philip Jackson Acoustic features Distance measures Pattern matching Distortion penalties DTW

More information

HIDDEN MARKOV MODELS AND SEQUENCE ALIGNMENT

HIDDEN MARKOV MODELS AND SEQUENCE ALIGNMENT HIDDEN MARKOV MODELS AND SEQUENCE ALIGNMENT - Swarbhanu Chatterjee. Hidden Markov models are a sophisticated and flexible statistical tool for the study of protein models. Using HMMs to analyze proteins

More information

HMM Classifier for Human Activity Recognition

HMM Classifier for Human Activity Recognition HMM Classifier for Human Activity Recognition MS. Kanchan Gaikwad Department of Computer, MGM College of Engineering, Kamothe, Panvel. kanchan.gawande@gmail.com Mr.Vaibhav Narawade (ME IT) vnarawade@gmail.com

More information

NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION

NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION * Prof. Dr. Ban Ahmed Mitras ** Ammar Saad Abdul-Jabbar * Dept. of Operation Research & Intelligent Techniques ** Dept. of Mathematics. College

More information

A Two-stage Scheme for Dynamic Hand Gesture Recognition

A Two-stage Scheme for Dynamic Hand Gesture Recognition A Two-stage Scheme for Dynamic Hand Gesture Recognition James P. Mammen, Subhasis Chaudhuri and Tushar Agrawal (james,sc,tush)@ee.iitb.ac.in Department of Electrical Engg. Indian Institute of Technology,

More information

Deep Generative Models Variational Autoencoders

Deep Generative Models Variational Autoencoders Deep Generative Models Variational Autoencoders Sudeshna Sarkar 5 April 2017 Generative Nets Generative models that represent probability distributions over multiple variables in some way. Directed Generative

More information

Package HMMCont. February 19, 2015

Package HMMCont. February 19, 2015 Type Package Package HMMCont February 19, 2015 Title Hidden Markov Model for Continuous Observations Processes Version 1.0 Date 2014-02-11 Author Maintainer The package includes

More information

Figure (5) Kohonen Self-Organized Map

Figure (5) Kohonen Self-Organized Map 2- KOHONEN SELF-ORGANIZING MAPS (SOM) - The self-organizing neural networks assume a topological structure among the cluster units. - There are m cluster units, arranged in a one- or two-dimensional array;

More information

IDIAP. Martigny - Valais - Suisse IDIAP

IDIAP. Martigny - Valais - Suisse IDIAP R E S E A R C H R E P O R T IDIAP Martigny - Valais - Suisse Off-Line Cursive Script Recognition Based on Continuous Density HMM Alessandro Vinciarelli a IDIAP RR 99-25 Juergen Luettin a IDIAP December

More information

Latent Variable Models and Expectation Maximization

Latent Variable Models and Expectation Maximization Latent Variable Models and Expectation Maximization Oliver Schulte - CMPT 726 Bishop PRML Ch. 9 2 4 6 8 1 12 14 16 18 2 4 6 8 1 12 14 16 18 5 1 15 2 25 5 1 15 2 25 2 4 6 8 1 12 14 2 4 6 8 1 12 14 5 1 15

More information

Speech User Interface for Information Retrieval

Speech User Interface for Information Retrieval Speech User Interface for Information Retrieval Urmila Shrawankar Dept. of Information Technology Govt. Polytechnic Institute, Nagpur Sadar, Nagpur 440001 (INDIA) urmilas@rediffmail.com Cell : +919422803996

More information

Locating 1-D Bar Codes in DCT-Domain

Locating 1-D Bar Codes in DCT-Domain Edith Cowan University Research Online ECU Publications Pre. 2011 2006 Locating 1-D Bar Codes in DCT-Domain Alexander Tropf Edith Cowan University Douglas Chai Edith Cowan University 10.1109/ICASSP.2006.1660449

More information

CS 223B Computer Vision Problem Set 3

CS 223B Computer Vision Problem Set 3 CS 223B Computer Vision Problem Set 3 Due: Feb. 22 nd, 2011 1 Probabilistic Recursion for Tracking In this problem you will derive a method for tracking a point of interest through a sequence of images.

More information

242 KHEDR & AWAD, Mat. Sci. Res. India, Vol. 8(2), (2011), y 2

242 KHEDR & AWAD, Mat. Sci. Res. India, Vol. 8(2), (2011), y 2 Material Science Research India Vol. 8(), 4-45 () Study of Fourier Descriptors and it s Laplace Transform for Image Recognition WAEL M. KHEDR and QAMAR A. AWAD Department of Mathematical, Faculty of Science,

More information

Handwritten Text Recognition

Handwritten Text Recognition Handwritten Text Recognition M.J. Castro-Bleda, S. España-Boquera, F. Zamora-Martínez Universidad Politécnica de Valencia Spain Avignon, 9 December 2010 Text recognition () Avignon Avignon, 9 December

More information

Face Recognition with Local Binary Patterns

Face Recognition with Local Binary Patterns Face Recognition with Local Binary Patterns Bachelor Assignment B.K. Julsing University of Twente Department of Electrical Engineering, Mathematics & Computer Science (EEMCS) Signals & Systems Group (SAS)

More information

Improving Time Series Classification Using Hidden Markov Models

Improving Time Series Classification Using Hidden Markov Models Improving Time Series Classification Using Hidden Markov Models Bilal Esmael Arghad Arnaout Rudolf K. Fruhwirth Gerhard Thonhauser University of Leoben TDE GmbH TDE GmbH University of Leoben Leoben, Austria

More information

A Computer Vision System for Graphical Pattern Recognition and Semantic Object Detection

A Computer Vision System for Graphical Pattern Recognition and Semantic Object Detection A Computer Vision System for Graphical Pattern Recognition and Semantic Object Detection Tudor Barbu Institute of Computer Science, Iaşi, Romania Abstract We have focused on a set of problems related to

More information

Boundary descriptors. Representation REPRESENTATION & DESCRIPTION. Descriptors. Moore boundary tracking

Boundary descriptors. Representation REPRESENTATION & DESCRIPTION. Descriptors. Moore boundary tracking Representation REPRESENTATION & DESCRIPTION After image segmentation the resulting collection of regions is usually represented and described in a form suitable for higher level processing. Most important

More information

Equation to LaTeX. Abhinav Rastogi, Sevy Harris. I. Introduction. Segmentation.

Equation to LaTeX. Abhinav Rastogi, Sevy Harris. I. Introduction. Segmentation. Equation to LaTeX Abhinav Rastogi, Sevy Harris {arastogi,sharris5}@stanford.edu I. Introduction Copying equations from a pdf file to a LaTeX document can be time consuming because there is no easy way

More information

From Gaze to Focus of Attention

From Gaze to Focus of Attention From Gaze to Focus of Attention Rainer Stiefelhagen, Michael Finke, Jie Yang, Alex Waibel stiefel@ira.uka.de, finkem@cs.cmu.edu, yang+@cs.cmu.edu, ahw@cs.cmu.edu Interactive Systems Laboratories University

More information

Combining HMMs for the recognition of noisy printed characters

Combining HMMs for the recognition of noisy printed characters Combining HMMs for the recognition of noisy printed characters A. J. Elms and J. Illingworth Department of Electronic and Electrical Engineering University of Surrey Guildford, GU2 5XH, U.K. Abstract In

More information

6. Applications - Text recognition in videos - Semantic video analysis

6. Applications - Text recognition in videos - Semantic video analysis 6. Applications - Text recognition in videos - Semantic video analysis Stephan Kopf 1 Motivation Goal: Segmentation and classification of characters Only few significant features are visible in these simple

More information

Machine Learning A W 1sst KU. b) [1 P] Give an example for a probability distributions P (A, B, C) that disproves

Machine Learning A W 1sst KU. b) [1 P] Give an example for a probability distributions P (A, B, C) that disproves Machine Learning A 708.064 11W 1sst KU Exercises Problems marked with * are optional. 1 Conditional Independence I [2 P] a) [1 P] Give an example for a probability distribution P (A, B, C) that disproves

More information

Locating Salient Object Features

Locating Salient Object Features Locating Salient Object Features K.N.Walker, T.F.Cootes and C.J.Taylor Dept. Medical Biophysics, Manchester University, UK knw@sv1.smb.man.ac.uk Abstract We present a method for locating salient object

More information

Revised Sheet Metal Simulation, J.E. Akin, Rice University

Revised Sheet Metal Simulation, J.E. Akin, Rice University Revised Sheet Metal Simulation, J.E. Akin, Rice University A SolidWorks simulation tutorial is just intended to illustrate where to find various icons that you would need in a real engineering analysis.

More information

Chapter 4. The Classification of Species and Colors of Finished Wooden Parts Using RBFNs

Chapter 4. The Classification of Species and Colors of Finished Wooden Parts Using RBFNs Chapter 4. The Classification of Species and Colors of Finished Wooden Parts Using RBFNs 4.1 Introduction In Chapter 1, an introduction was given to the species and color classification problem of kitchen

More information

Recognition Rate. 90 S 90 W 90 R Segment Length T

Recognition Rate. 90 S 90 W 90 R Segment Length T Human Action Recognition By Sequence of Movelet Codewords Xiaolin Feng y Pietro Perona yz y California Institute of Technology, 36-93, Pasadena, CA 925, USA z Universit a dipadova, Italy fxlfeng,peronag@vision.caltech.edu

More information

CONTENT analysis of video is to find meaningful structures

CONTENT analysis of video is to find meaningful structures 1576 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 18, NO. 11, NOVEMBER 2008 An ICA Mixture Hidden Markov Model for Video Content Analysis Jian Zhou, Member, IEEE, and Xiao-Ping

More information

An Adaptive Eigenshape Model

An Adaptive Eigenshape Model An Adaptive Eigenshape Model Adam Baumberg and David Hogg School of Computer Studies University of Leeds, Leeds LS2 9JT, U.K. amb@scs.leeds.ac.uk Abstract There has been a great deal of recent interest

More information

Robust Face Recognition via Sparse Representation Authors: John Wright, Allen Y. Yang, Arvind Ganesh, S. Shankar Sastry, and Yi Ma

Robust Face Recognition via Sparse Representation Authors: John Wright, Allen Y. Yang, Arvind Ganesh, S. Shankar Sastry, and Yi Ma Robust Face Recognition via Sparse Representation Authors: John Wright, Allen Y. Yang, Arvind Ganesh, S. Shankar Sastry, and Yi Ma Presented by Hu Han Jan. 30 2014 For CSE 902 by Prof. Anil K. Jain: Selected

More information

CHAPTER 6 PERCEPTUAL ORGANIZATION BASED ON TEMPORAL DYNAMICS

CHAPTER 6 PERCEPTUAL ORGANIZATION BASED ON TEMPORAL DYNAMICS CHAPTER 6 PERCEPTUAL ORGANIZATION BASED ON TEMPORAL DYNAMICS This chapter presents a computational model for perceptual organization. A figure-ground segregation network is proposed based on a novel boundary

More information

CHAPTER 2 TEXTURE CLASSIFICATION METHODS GRAY LEVEL CO-OCCURRENCE MATRIX AND TEXTURE UNIT

CHAPTER 2 TEXTURE CLASSIFICATION METHODS GRAY LEVEL CO-OCCURRENCE MATRIX AND TEXTURE UNIT CHAPTER 2 TEXTURE CLASSIFICATION METHODS GRAY LEVEL CO-OCCURRENCE MATRIX AND TEXTURE UNIT 2.1 BRIEF OUTLINE The classification of digital imagery is to extract useful thematic information which is one

More information

Det De e t cting abnormal event n s Jaechul Kim

Det De e t cting abnormal event n s Jaechul Kim Detecting abnormal events Jaechul Kim Purpose Introduce general methodologies used in abnormality detection Deal with technical details of selected papers Abnormal events Easy to verify, but hard to describe

More information

MRT based Adaptive Transform Coder with Classified Vector Quantization (MATC-CVQ)

MRT based Adaptive Transform Coder with Classified Vector Quantization (MATC-CVQ) 5 MRT based Adaptive Transform Coder with Classified Vector Quantization (MATC-CVQ) Contents 5.1 Introduction.128 5.2 Vector Quantization in MRT Domain Using Isometric Transformations and Scaling.130 5.2.1

More information

Cursive Handwriting Recognition System Using Feature Extraction and Artificial Neural Network

Cursive Handwriting Recognition System Using Feature Extraction and Artificial Neural Network Cursive Handwriting Recognition System Using Feature Extraction and Artificial Neural Network Utkarsh Dwivedi 1, Pranjal Rajput 2, Manish Kumar Sharma 3 1UG Scholar, Dept. of CSE, GCET, Greater Noida,

More information