• Title/Summary/Keyword: Recognition algorithm

Search Result 3,543, Processing Time 0.025 seconds

Development of an image processing algorithm for the recognition of car types and number plates (차종, 번호판 위치 및 자동차 번호판 인식을 위한 영상처리 알고리즘개발)

  • 김희식;이평원;김영재
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.1718-1721
    • /
    • 1997
  • An image processing algorithm is developed in order to recognize the type of cars, the position of a number plate and the characters on the plate. to recognize the type of cars, comparison of two images is used. One has a car image, the other is just a background image without car. After that recognition, a vertical line filter is used to find the location of the plate. Finally the simularity mehod is used to recognize the numbers on plates.

  • PDF

Two-Dimensional Partial Shape Recognition Using Interrelation Vector (상호관계 벡터를 이용한 이차원의 가려진 물체인식)

  • ;Zeungnam Bien
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.7
    • /
    • pp.108-118
    • /
    • 1994
  • By using a concept of interrelation vector between line segments a new algorithm for partial shape recognition of two-dimensional objects is introduced. The interrelation vector which is invariant under translation rotation and scaling of a pair of line segments is used as a feature information for polygonal shape recognition. Several useful properties of the interrelation vector are also derived in relation to efficient partial shape recognition. The proposed algorithm requires only small space of storage and is shown to be computationally simple and efficient.

  • PDF

A Study of ECG Pattern Classification of Using Syntactic Pattern Recognition (신택틱 패턴 인식 알고리즘에 의한 심전도 신호의 패턴 분류에 관한 연구)

  • 남승우;이명호
    • Journal of Biomedical Engineering Research
    • /
    • v.12 no.4
    • /
    • pp.267-276
    • /
    • 1991
  • This paper describes syntactic pattern recognition algorithm for pattern recognition and diagnostic parameter extraction of ECG signal. ECG signal which is represented linguistic string is evaluated by pattern grammar and its interpreter-LALR(1) parser for pattern recognition. The proposed pattern grammar performs syntactic analysis and semantic evaluation simultaneously. The performance of proposed algorithm has been evaluated using CSE database.

  • PDF

The Pattern Recognition Methods for Emotion Recognition with Speech Signal (음성신호를 이용한 감성인식에서의 패턴인식 방법)

  • Park Chang-Hyun;Sim Kwee-Bo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.3
    • /
    • pp.284-288
    • /
    • 2006
  • In this paper, we apply several pattern recognition algorithms to emotion recognition system with speech signal and compare the results. Firstly, we need emotional speech databases. Also, speech features for emotion recognition is determined on the database analysis step. Secondly, recognition algorithms are applied to these speech features. The algorithms we try are artificial neural network, Bayesian learning, Principal Component Analysis, LBG algorithm. Thereafter, the performance gap of these methods is presented on the experiment result section. Truly, emotion recognition technique is not mature. That is, the emotion feature selection, relevant classification method selection, all these problems are disputable. So, we wish this paper to be a reference for the disputes.

The Pattern Recognition Methods for Emotion Recognition with Speech Signal (음성신호를 이용한 감성인식에서의 패턴인식 방법)

  • Park Chang-Hyeon;Sim Gwi-Bo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2006.05a
    • /
    • pp.347-350
    • /
    • 2006
  • In this paper, we apply several pattern recognition algorithms to emotion recognition system with speech signal and compare the results. Firstly, we need emotional speech databases. Also, speech features for emotion recognition is determined on the database analysis step. Secondly, recognition algorithms are applied to these speech features. The algorithms we try are artificial neural network, Bayesian learning, Principal Component Analysis, LBG algorithm. Thereafter, the performance gap of these methods is presented on the experiment result section. Truly, emotion recognition technique is not mature. That is, the emotion feature selection, relevant classification method selection, all these problems are disputable. So, we wish this paper to be a reference for the disputes.

  • PDF

Face Recognition Based on PCA on Wavelet Subband of Average-Half-Face

  • Satone, M.P.;Kharate, G.K.
    • Journal of Information Processing Systems
    • /
    • v.8 no.3
    • /
    • pp.483-494
    • /
    • 2012
  • Many recent events, such as terrorist attacks, exposed defects in most sophisticated security systems. Therefore, it is necessary to improve security data systems based on the body or behavioral characteristics, often called biometrics. Together with the growing interest in the development of human and computer interface and biometric identification, human face recognition has become an active research area. Face recognition appears to offer several advantages over other biometric methods. Nowadays, Principal Component Analysis (PCA) has been widely adopted for the face recognition algorithm. Yet still, PCA has limitations such as poor discriminatory power and large computational load. This paper proposes a novel algorithm for face recognition using a mid band frequency component of partial information which is used for PCA representation. Because the human face has even symmetry, half of a face is sufficient for face recognition. This partial information saves storage and computation time. In comparison with the traditional use of PCA, the proposed method gives better recognition accuracy and discriminatory power. Furthermore, the proposed method reduces the computational load and storage significantly.

Guassian pdfs Clustering Using a Divergence Measure-based Neural Network (발산거리 기반의 신경망에 의한 가우시안 확률 밀도 함수의 군집화)

  • 박동철;권오현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5C
    • /
    • pp.627-631
    • /
    • 2004
  • An efficient algorithm for clustering of GPDFs(Gaussian Probability Density Functions) in a speech recognition model is proposed in this paper. The proposed algorithm is based on CNN with the divergence as its distance measure and is applied to a speech recognition. The algorithm is compared with conventional Dk-means(Divergence-based k-means) algorithm in CDHMM(Continuous Density Hidden Markov Model). The results show that it can reduce about 31.3% of GPDFs over Dk-means algorithm without suffering any recognition performance. When compared with the case that no clustering is employed and full GPDFs are used, the proposed algorithm can save about 61.8% of GPDFs while preserving the recognition performance.

Incorporating Recognition in Catfish Counting Algorithm Using Artificial Neural Network and Geometry

  • Aliyu, Ibrahim;Gana, Kolo Jonathan;Musa, Aibinu Abiodun;Adegboye, Mutiu Adesina;Lim, Chang Gyoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.12
    • /
    • pp.4866-4888
    • /
    • 2020
  • One major and time-consuming task in fish production is obtaining an accurate estimate of the number of fish produced. In most Nigerian farms, fish counting is performed manually. Digital image processing (DIP) is an inexpensive solution, but its accuracy is affected by noise, overlapping fish, and interfering objects. This study developed a catfish recognition and counting algorithm that introduces detection before counting and consists of six steps: image acquisition, pre-processing, segmentation, feature extraction, recognition, and counting. Images were acquired and pre-processed. The segmentation was performed by applying three methods: image binarization using Otsu thresholding, morphological operations using fill hole, dilation, and opening operations, and boundary segmentation using edge detection. The boundary features were extracted using a chain code algorithm and Fourier descriptors (CH-FD), which were used to train an artificial neural network (ANN) to perform the recognition. The new counting approach, based on the geometry of the fish, was applied to determine the number of fish and was found to be suitable for counting fish of any size and handling overlap. The accuracies of the segmentation algorithm, boundary pixel and Fourier descriptors (BD-FD), and the proposed CH-FD method were 90.34%, 96.6%, and 100% respectively. The proposed counting algorithm demonstrated 100% accuracy.

Developments of Parking Control System Using Color Information and Fuzzy C-menas Algorithm (컬러 정보와 퍼지 C-means 알고리즘을 이용한 주차관리시스템 개발)

  • 김광백;윤홍원;노영욱
    • Journal of Intelligence and Information Systems
    • /
    • v.8 no.1
    • /
    • pp.87-101
    • /
    • 2002
  • In this paper, we proposes the car plate recognition and describe the parking control system using the proposed car plate recognition algorithm. The car plate recognition system using color information and fuzzy c-means algorithm consists of the extraction part of a car plate from a car image and the recognition part of characters in the extracted car plate. This paper eliminates green noise from car image using the mode smoothing and extract plate region using green and white information of RGB color. The codes of extracted plate region is extracted by histogram based approach method and is recognized by fuzzy c-means algorithm. For experimental, we tested 80 car images. We shows that the proposed extraction method is better than that from the color information of RGB and HSI, respectively. So, we can know that the proposed car plate recognition method using fuzzy c-means algorithm was very efficient. We develop the parking control system using the proposed car plate recognition method, which showed performance improvement by the experimental results.

  • PDF

An Adaptive Pruning Threshold Algorithm for the Korean Address Speech Recognition (한국어 주소 음성인식의 고속화를 위한 적응 프루닝 문턱치 알고리즘)

  • 황철준;오세진;김범국;정호열;정현열
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.7
    • /
    • pp.55-62
    • /
    • 2001
  • In this paper, we propose a new adaptative pruning algorithm which effectively reduces the search space during the recognition process. As maximum probabilities between neighbor frames are highly interrelated, an efficient pruning threshold value can be obtained from the maximum probabilities of previous frames. The main idea is to update threshold at the present frame by a combination of previous maximum probability and hypotheses probabilities. As present threshold is obtained in on-going recognition process, the algorithm does not need any pre-experiments to find threshold values even when recognition tasks are changed. In addition, the adaptively selected threshold allows an improvement of recognition speed under different environments. The proposed algorithm has been applied to a Korean Address recognition system. Experimental results show that the proposed algorithm reduces the search space of average 14.4% and 9.14% respectively while preserving the recognition accuracy, compared to the previous method of using fixed pruning threshold values and variable pruning threshold values.

  • PDF