• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.883-884
• /
• 2008

This paper presents a method for classification of underwater transient signals using, which employs a binary image pattern of the mel-frequency cepstral coefficients(MFCC) as a feature vector and a neural network as a classifier. A feature vector is obtained by taking DCT and 1-bit quantization for the square matrix of the MFCC sequences. The classifier is a feed-forward neural network having one hidden layer and one output layer, and a back propagation algorithm is used to update the weighting vector of each layer. Experimental results with some underwater transient signals demonstrate that the proposed method is very promising for classification of underwater transient signals.

• Speech Sciences
• /
• v.14 no.2
• /
• pp.127-135
• /
• 2007

Feature vectors of speech are generally extracted from whole frequency domain. The inherent character of a speaker is located in the low band or high band frequency. However, if the speech is corrupted by narrowband noise with concentrated energy, speaker verification performance is reduced as the individual characteristic is removed. In this paper, we propose a PCA Covariance Model based on the multiband to extract the robust feature vectors against the narrowband noise. First, we divide the overall frequency band into several subbands. Second, the correlation of feature vectors extracted independently from each subband is removed by PCA. The distance obtained from each subband has different distribution. To normalize against the different distribution, we moved the value into the normalized distribution through the mapping function. Finally, the represented value applying the weighting function is used for speaker verification. In the experiments, the proposed method shows better performance of the speaker verification and reduces the computation.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.228-242
• /
• 2005

The projected clustering seeks to find clusters in different subspaces within a high dimensional dataset. We propose an algorithm to discover near optimal projected clusters without user specified parameters such as the number of output clusters and the average cardinality of subspaces of projected clusters. The objective function of the algorithm computes projected energy, quality, and the number of outliers in each process of clustering. In order to minimize the projected energy and to maximize the quality in clustering, we start to find best subspace of each cluster on the density of input points by comparing standard deviations of the full dimension. The weighting factor for each dimension of the subspace is used to get id of probable error in measuring projected distances. Our extensive experiments show that our algorithm discovers projected clusters accurately and it is scalable to large volume of data sets.

• Journal of the Korean Society for information Management
• /
• v.29 no.2
• /
• pp.205-224
• /
• 2012

One of the limitations of BOW method is that each term is recognized only by its form, failing to represent the term's meaning or thematic background. To overcome the limitation, different profiles for each term were defined by thematic categories depending on contextual characteristics. In this study, a specific term was used as a classification feature based on its meaning or thematic background through the process of comparing the context in those profiles with the occurrences in an actual document. The experiment was conducted in three phases; term weighting, ensemble classifier implementation, and feature selection. The classification performance was enhanced in all the phases with the ensemble classifier showing the highest performance score. Also, the outcome showed that the proposed method was effective in reducing the performance bias caused by the total number of learning documents.

• Journal of Korea Multimedia Society
• /
• v.18 no.4
• /
• pp.443-451
• /
• 2015

In this paper we suggest a new two-wheelers detection algorithm using uniform local binary pattern weighting value for projection vectors. The first, we calculate feature vectors using projection method which has robustness for rotation invariant and reducing dimensionality for each cell from origin image. The second, we applied new weighting values which are calculated by the modified local binary pattern showing the fast compute and simple to implement. This paper applied the Adaboost algorithm to make a strong classification from weak classification. In this experiment, we can get the result that the detection rate of the proposed method is higher than that of the traditional method.

• Journal of the military operations research society of Korea
• /
• v.30 no.1
• /
• pp.1-14
• /
• 2004

In this paper, we propose a new data-mining-based methodology for military occupational specialty assignment. The proposed methodology consists of two phases, feature selection and man-power assignment. In the first phase, the k-means partitioning algorithm and the optimal variable weighting algorithm are used to determine attribute weights. We address limitations of the optimal variable weighting algorithm and suggest a quadratic programming model that can handle categorical variables and non-contributory trivial variables. In the second phase, we present an integer programming model to deal with a man-power assignment problem. In the model, constraints on demand-supply requirements and training capacity are considered. Moreover, the attribute weights obtained in the first phase for each specialty are used to measure dissimilarity. Results of a computational experiment using real-world data are provided along with some analysis.

• The Journal of the Acoustical Society of Korea
• /
• v.3 no.1
• /
• pp.25-35
• /
• 1984

This paper analysis the Dynamic Time Warping algorithms for time normalization of speech pattern and discusses the Dynamic Programming algorithm for spoken Korean isolated digits recognition. In the DP matching, feature vectors of the reference and test pattern are consisted of first three formant frequencies extracted by power spectrum density estimation algorithm of the ARMA model. The major differences in the various DTW algorithms include the global path constrains, the local continuity constraints on the path, and the distance weighting/normalization used to give the overall minimum distance. The performance criterias to evaluate these DP algorithms are memory requirement, speed of implementation, and recognition accuracy.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.875-883
• /
• 2010

In this paper, we present a secure biometric hashing scheme for face recognition by random fusion of global and local features. The Fourier-Mellin transform and Radon transform are adopted respectively to form specialized representation of global and local features, due to their invariance to geometric operations. The final biometric hash is securely generated by random weighting sum of both feature sets. A fourfold key is involved in our algorithm to ensure the security and privacy of biometric templates. The proposed biometric hash can be revocable and replaced by using a new key. Moreover, the attacker cannot obtain any information about the original biometric template without knowing the secret key. The experimental results confirm that our scheme has a satisfactory accuracy performance in terms of EER.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.909-910
• /
• 2008

For evaluating the performance of some codecs, many researchers have study and develop new objective video quality assessments. However, it's not sufficient for evaluating the temporal feature of video data yet, which is a distinguishable and representative characteristic when compared with other multimedia. This paper propose the method to apply the weight to SSIM (Structural SIMilarity) according to the cognitive psychological feature. And, we presented that the performance of objective video quality assessment applied the weight to SSIM by using the proposed method is superior to one of original SSIM.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.1
• /
• pp.39-48
• /
• 1998

본 논문에서는 은닉 마르코프 모델에 기반한 음성인식에 있어서 특징 파라미터의 인식 성능에 미치는 영향의 차이를 인식 시스템에 반영하여 인식성능을 향상시키기 위한 방 법을 제안하였다. 특징 파라미터별 가중치를 유도하기 위해서 우선 상태별 특징 파라미터의 인식율에 대한 기여도를 가중치로 변환하고, 이를 특징 파라미터 각각의 상태에서의 출력확 률에 곱하여 상태별 출력확률을 재 추정하게 된다. 실험결과, "가변가중"방법이 "고정가중" 방법에 비해서 단어 인식의 경우 3.3%, 그리고 문장 인식율의 경우 5.3%의 성능향상을 보 임으로써 상태별 특징 파라미터의 가중이 인식 성능 향상에 유효함을 알 수 있었다.