• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권10호
• /
• pp.5078-5094
• /
• 2019

In recent years, the development of drone technologies has promoted the widespread commercial application of drones. However, the ability of drone to carry explosives and other destructive materials may bring serious threats to public safety. In order to reduce these threats from illegal drones, acoustic feature extraction and classification technologies are introduced for drone sound identification. In this paper, we introduce the acoustic feature vector extraction method of harmonic line association (HLA), and subband power feature extraction based on wavelet packet transform (WPT). We propose a feature vector extraction method based on combined HLA and WPT to extract more sophisticated characteristics of sound. Moreover, to identify drone sounds, support vector machine (SVM) classification with the optimized parameter by genetic algorithm (GA) is employed based on the extracted feature vector. Four drones' sounds and other kinds of sounds existing in outdoor environment are used to evaluate the performance of the proposed method. The experimental results show that with the proposed method, identification probability can achieve up to 100 % in trials, and robustness against noise is also significantly improved.

• 음성과학
• /
• 제13권4호
• /
• pp.177-186
• /
• 2006

In an effort to enhance the quality of feature vector classification and thereby reduce the recognition error rate of the speaker-independent speech recognition, we employ the Mahalanobis distance in the calculation of the similarity measure between feature vectors. It is assumed that the metric matrix of the Mahalanobis distance be diagonal for the sake of cost reduction in memory and time of calculation. We propose that the diagonal elements be given in terms of the variations of the feature vector components. Geometrically, this prescription tends to redistribute the set of data in the shape of a hypersphere in the feature vector space. The idea is applied to the speech recognition by hidden Markov model with fuzzy vector quantization. The result shows that the recognition is improved by an appropriate choice of the relevant adjustable parameter. The Viterbi score difference of the two winners in the recognition test shows that the general behavior is in accord with that of the recognition error rate.

• 한국정밀공학회지
• /
• 제23권3호
• /
• pp.94-101
• /
• 2006

A global path planning method using self-organizing feature map which is a method among a number of neural network is presented. The self-organizing feature map uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are moved toward the input vector On the other hand, the modified method in this research uses a predetermined initial weight vectors of 1-dimensional string and 2-dimensional mesh, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are moved toward the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

• 한국멀티미디어학회논문지
• /
• 제17권10호
• /
• pp.1141-1149
• /
• 2014

Recently, various methods to effectively eliminate the noise are researched in image processing techniques. However, the conventional noise filtering techniques, which remove most of the noise, are less efficient for remained noise detection after filtering due to exploiting no face feature information. In this paper, we proposed a feature vector generation technique in the mouth region by distinguishing and revising the remained noise through gradient correction, when the outline is extracted after performing noise filtering.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권7호
• /
• pp.3475-3496
• /
• 2018

Most of current watermarking algorithms for GIS vector data embed copyright information by means of modifying the coordinate values, which will do harm to its quality and accuracy. To preserve the fidelity of vector line data and protect its copyright at the same time, a lossless watermarking algorithm is proposed based on storage feature in this paper. Firstly, the superiority of embedding watermark based on storage feature is demonstrated theoretically and technically. Then, the basic concepts and operations on storage feature have been defined including length and angle of the polyline feature. In the process of embedding watermark, the watermark information is embedded into directions of polyline feature by the quantitative mechanism, while the positions of embedding watermark are determined by the feature length. Hence, the watermark can be extracted by the same geometric features without original data or watermark. Finally, experiments have been conducted to show that coordinate values remain unchanged after embedding watermark. Moreover, experimental results are presented to illustrate the effectiveness of the method.

• 전자공학회논문지SC
• /
• 제45권6호
• /
• pp.67-76
• /
• 2008

성공적인 상업화를 위해서는 다양한 조명 환경에서 신뢰성 있는 얼굴 인식이 필요하다. 특징 벡터 기반 얼굴 인식에서 특징 벡터를 잘 선택하는 것은 중요하다. 가버 특징 벡터는 다른 특징 벡터보다도 상대적으로 방향, 자세, 조명 등의 영향을 덜 받는 것으로 잘 알려져 있어 얼굴 인식의 특징 벡터로 많이 이용된다. 그러나 조명의 영향에 대해 완전히 독립적이지 못하다. 본 논문에서는 얼굴 이미지의 가버 특징 벡터에 대한 조명 PCA 모델의 구성을 제안하고 이를 이용하여 조명에 독립적인 얼굴 고유의 특성을 나타내는 가버 특징 벡터만을 분리해내고 이를 이용한 얼굴 인식 방법을 제시한다. 가버 특징 벡터 조명 PCA 모델은 가버 특징 벡터공간을 조명 영향 부분공간과 얼굴 고유특성 부분공간의 직교 분해로 구성한다. 얼굴 고유특성 부분공간으로 투영하여 얻어진 가버 특징 벡터는 조명 영향을 분리해 내었기 때문에 이를 이용한 얼굴 인식은 조명에 보다 강인하게 된다. 실험을 통해서 가버 특징 벡터 조명 PCA 모델을 이용한 제안된 얼굴 인식 방식이 다양한 자세에서 조명에 대해 보다 신뢰성 있게 동작함을 확인하였다.

• 대한원격탐사학회지
• /
• 제36권1호
• /
• pp.55-65
• /
• 2020

Image classification needs the spectral similarity comparison between spectral features of each pixel and the representative spectral features of each class. The spectral similarity is obtained by computing the spectral feature vector distance between the pixel and the class. Each spectral feature contributes differently in the image classification depending on the class separability of the spectral feature, which is computed using a suitable vector distance measure such as the Bhattacharyya distance. We propose a method to determine the weight value of each spectral feature in the computation of feature vector distance for the similarity measurement. The weight value is determined by the ratio between each feature separability value to the total separability values of all the spectral features. We created ten spectral features consisting of seven bands of Landsat-8 OLI image and three indices, NDVI, NDWI and NDBI. For three experimental test sites, we obtained the overall accuracies between 95.0% and 97.5% and the kappa coefficients between 90.43% and 94.47%.

• 전자공학회논문지B
• /
• 제31B권6호
• /
• pp.104-110
• /
• 1994

We proposed a high speed feature extraction algorithm and developed a feature vector extraction chip for high speed character recognition. It is hard to implement a high speed OCR by software alone with statistical method . Thus, the whole recognition process is divided into functional steps, then pipeline processed so that high speed processing is possible with temporal parallelism of the steps. In this paper we discuss the feature extraction step of the functional steps. To extract feature vector, a character image is normalized to 40$\times$40 pixels. Then, it is divided into 5$\times$5 subregions and 4x4 subregions to construct 41 overlapped subregions(10x10 pixels). It requires to execute more than 500 commands to extract a feature vector of a subregion by software. The proposed algorithm, however, requires only 10 cycles since it can extract a feature vector of a columm of subregion in one cycle with array structure. Thus, it is possible to process 12.000 characters per second with the proposed algorithm. The chip is implemented using EPLD and the effectiveness is proved by developing an OCR using it.

• Journal of Multimedia Information System
• /
• 제6권2호
• /
• pp.91-98
• /
• 2019

Many researchers have attempted to recognize three-dimensional faces using feature points extracted from two-dimensional facial photographs. However, due to the limit of flat photographs, it is very difficult to recognize faces rotated more than 15 degrees from original feature points extracted from the photographs. As such, it is difficult to create an algorithm to recognize faces in multiple angles. In this paper, it is proposed a new algorithm to recognize three-dimensional face recognition based on feature points extracted from a flat photograph. This method divides into six feature point vector zones on the face. Then, the vector value is compressed and expanded according to the rotation angle of the face to recognize the feature points of the face in a three-dimensional form. For this purpose, the average of the compressibility and the expansion rate of the face data of 100 persons by angle and face zone were obtained, and the face angle was estimated by calculating the distance between the middle of the forehead and the tail of the eye. As a result, very improved recognition performance was obtained at 30 degrees of rotated face angle.

• Journal of Information Processing Systems
• /
• 제8권2호
• /
• pp.301-314
• /
• 2012

In this paper, two new approaches to align English-Arabic sentences in bilingual parallel corpora based on the Multi-Class Support Vector Machine (MSVM) and the Hidden Markov Model (HMM) classifiers are presented. A feature vector is extracted from the text pair that is under consideration. This vector contains text features such as length, punctuation score, and cognate score values. A set of manually prepared training data was assigned to train the Multi-Class Support Vector Machine and Hidden Markov Model. Another set of data was used for testing. The results of the MSVM and HMM outperform the results of the length based approach. Moreover these new approaches are valid for any language pairs and are quite flexible since the feature vector may contain less, more, or different features, such as a lexical matching feature and Hanzi characters in Japanese-Chinese texts, than the ones used in the current research.