Design and Implementation of Parking System Using Feature Extraction and Pattern Recognition Technique

Author(s):  
H. Varun Chand ◽  
J. Karthikeyan
Fractals ◽  
1997 ◽  
Vol 05 (supp01) ◽  
pp. 165-172 ◽  
Author(s):  
G. van de Wouwer ◽  
P. Scheunders ◽  
D. van Dyck ◽  
M. de Bodt ◽  
F. Wuyts ◽  
...  

The performance of a pattern recognition technique is usually determined by the ability of extracting useful features from the available data so as to effectively characterize and discriminate between patterns. We describe a novel method for feature extraction from speech signals. For this purpose, we generate spectrograms, which are time-frequency representations of the original signal. We show that, by considering this spectrogram as a textured image, a wavelet transform can be applied to generate useful features for recognizing the speech signal. This method is used for the classification of voice dysphonia. Its performance is compared with another technique taken from the literature. A recognition accuracy of 98% is achieved for the classification between normal an dysphonic voices.


2019 ◽  
Vol 10 (6) ◽  
pp. 1382-1394
Author(s):  
R. Vijayalakshmi ◽  
V. K. Soma Sekhar Srinivas ◽  
E. Manjoolatha ◽  
G. Rajeswari ◽  
M. Sundaramurthy

1990 ◽  
Vol 41 (3) ◽  
pp. 288-295 ◽  
Author(s):  
Barry K. Lavine ◽  
Robert K. Vander Meer ◽  
Laurence Morel ◽  
Robert W. Gunderson ◽  
Jian Hwa Han ◽  
...  

2013 ◽  
Vol 4 (2) ◽  
pp. 280-294
Author(s):  
Revathi P ◽  
Suresh Babu C ◽  
Purusotham S ◽  
Sundara Murthy M

Many Combinatorial programming problems are NP-hard (Non Linear Polynomial), and we consider one of them called P path minimum distance connectivity from head quarter to the cities. Let there be n cities and the distance matrix D(i, j, k) is given from ithcity to jthcity using kthfacility. There can be an individual factor which influences the distances/cost and that factor is represented as a facility k. We consider m<n cities are in cluster and to connect all the cities in subgroup (cluster) from others by using same facility k. The problem is to find minimum distance to connect all the cities from head quarter (say 1) threw p-paths subject to the above considerations. For this problem we developed a Pattern Recognition Technique based Lexi Search Algorithm, we programmed the proposed algorithm using C. we compared with the existed models and conclude that it suggested for solving the higher dimensional problems.


Sign in / Sign up

Export Citation Format

Share Document