• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.586-589
• /
• 2013

In this paper, the proposed scheme is STBC system combined with convolutional code to ensure the reliability of data transmission for a high rate wireless communication. In addition, this scheme uses a modified viterbi algorithm in order to get a high system gain when data is transmitted. Because we combine STBC and comvolutional code, the proposed scheme can get a diversity gain of STBC and coding gain of convolutional code at the same time. Unlike existing viterbi docoding algorithm using Hamming distance in order to calculate branch matrix, the modified viterbi algorithm uses Euclidean distance value between received symbol and reference symbol. To analyze the system proposed, it was simulated by changing the constraint length of the convolutional code and the number of transmit and receive antennas of STBC.

• Journal of Information Management
• /
• v.40 no.2
• /
• pp.95-115
• /
• 2009

Author resolution is to disambiguate same-name author occurrences into real individuals. For this, pair-wise author similarities are computed for author name entities, and then clustering is performed. So far, many studies have employed hierarchical clustering techniques for author disambiguation. However, various hierarchical clustering methods have not been sufficiently investigated. This study covers an empirical evaluation and analysis of hierarchical clustering applied to Korean author resolution, using multiple distance functions such as Dice coefficient, Cosine similarity, Euclidean distance, Jaccard coefficient, Pearson correlation coefficient.

• The Korean Journal of Applied Statistics
• /
• v.20 no.3
• /
• pp.459-473
• /
• 2007

In this paper, we suggest a spatial regression model to predict AADT. Although Euclidian distances between one monitoring site and its neighboring sites were usually used in the many analysis, we consider the shortest travel path between monitoring sites to predict AADT for unmonitoring site using spatial regression model. We used universal Kriging method for prediction and found that the overall predictive capability of the spatial regression model based on shortest travel path is better than that of the model based on multiple regression by cross validation.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.4
• /
• pp.217-221
• /
• 2013

Recently, researches for methods of generating binary feature descriptors have been actively done. Since matching of binary feature descriptors uses Hamming distance which is based on bit operations, it is much more efficient than that of previous general feature descriptors which uses Euclidean distance based on real number operations. However, since increase in the number of features linearly drops matching speed, in applications such as object tracking where real-time applicability is a must, there has been an increasing demand for methods of further improving the matching speed of binary feature descriptors. In this regard, this paper proposes a method that improves the matching speed greatly while maintaining the matching accuracy by splitting high dimensional binary feature descriptors to several low dimensional ones and sequentially analyzing their partial Hamming distances. To evaluate the efficiency of the proposed method, experiments of comparison with previous matching methods are conducted. In addition, this paper discusses schemes of generating binary feature descriptors for maximizing the performance of the proposed method. Based on the analysis on the performance of several generation schemes, we try to find out the most effective scheme.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.6
• /
• pp.622-627
• /
• 2014

This paper proposes a new method which improves recognition rate on the gait recognition system using wavelet transform, linear discriminant analysis and genetic algorithm. We use wavelet transform to obtain the four sub-bands from the gait energy image. In order to extract feature data from sub-bands, we use linear discriminant analysis. Distance values between training data and four sub-band data are calculated and four weights which are calculated by genetic algorithm is assigned at each sub-band distance. Based on a new fusion distance value, we conducted recognition experiments using k-nearest neighbors algorithm. Experimental results show that the proposed weight fusion method has higher recognition rate than conventional method.

• Journal of Digital Contents Society
• /
• v.13 no.3
• /
• pp.317-324
• /
• 2012

Recently, coordination task of similarity between national R&D programs is emphasized on view from the R&D investment efficiency. But the previous similarity search method like text-based similarity search which using keyword of R&D projects has reached the limit due to deviation of document's quality. For the solve the limitations of text-based similarity search using the keyword extraction, in this study, utilization of R&D project's technical classification will be discussed as a new similarity search method when analyzed of similarity between national R&D programs. To this end, extracts the Science and Technology Standard Classification of R & D projects which are collected when national R&D Survey & analysis, and creates peculiar vector model of each R&D programs. Verify a reliability of this study by calculate the cosine-based and Euclidean distance-based similarity and compare with calculated the text-based similarity.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.11
• /
• pp.1307-1314
• /
• 2015

This study proposed a more stable robust recognition algorithm which detects faces reliably even in cases where there are changes in lighting and angle of view, as well it satisfies efficiency in calculation and detection performance. The algorithm proposed detects the face area alone after normalization through pre-processing and obtains a feature vector using (PCA). Also, by applying the feature vector obtained for SVM, face areas can be tested. After the testing, the feature vector is applied to LDA and using Euclidean distance in the 2nd dimension, the final analysis and matching is performed. The algorithm proposed in this study could increase the stability and accuracy of recognition rates and as a large amount of calculation was not necessary due to the use of two dimensions, real-time recognition was possible.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.3
• /
• pp.47-53
• /
• 2002

In this paper, we proposed a content-based video search method using the eigen value of key frame and intensity component. We divided the video stream into shot units to extract key frame representing each shot, and get the intensity distribution of the shot from the database generated by using ECA(Eigen Component Analysis). The generated codebook, their index value for each key frame, and the intensity values were used for database. The query image is utilized to find video stream that has the most similar frame by using the euclidean distance measure among the codewords in the codebook. The experimental results showed that the proposed algorithm is superior to any other methols in the search outcome since it makes use of eigen value and intensity elements, and reduces the processing time etc.

• Spatial Information Research
• /
• v.20 no.4
• /
• pp.93-101
• /
• 2012

Due to complexity of indoor space, the demand of Location Based Services (LBS) in indoor space is increasing as well as outdoor. However, it includes privacy problems of exposing personal location. Location K-anonymity technology is a method to solve the privacy problems with cloaking their locations by Anonymized Spatial Region(ASR). It guarantees K users within a region containing the location of a given user. However previous researches have dealt the problems based on Euclidean distance in outdoor space, and cannot be applied in indoor space where there are constraints of movement such as walls. For this reason, we propose in this paper a K-anonymity for cloaking indoor location in consideration of structures and representation of indoor space. The basic concept of our approach is to introduce a hierarchical structure as ASR for including K-1 users for cloaking their locations. We also proposed a cost model by K and attributes of hierarchical structure to analyze the performance of the method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.425-430
• /
• 2015

This paper is a study to improve the classification efficiency of rotating objects by using deep neural networks to which a deep learning algorithm was applied. For the classification experiment of rotating objects, COIL-20 is used as data and total 3 types of classifiers are compared and analyzed. 3 types of classifiers used in the study include PCA classifier to derive a feature value while reducing the dimension of data by using Principal Component Analysis and classify by using euclidean distance, MLP classifier of the way of reducing the error energy by using error back-propagation algorithm and finally, deep learning applied DBN classifier of the way of increasing the probability of observing learning data through pre-training and reducing the error energy through fine-tuning. In order to identify the structure-specific error rate of the deep neural networks, the experiment is carried out while changing the number of hidden layers and number of hidden neurons. The classifier using DBN showed the lowest error rate. Its structure of deep neural networks with 2 hidden layers showed a high recognition rate by moving parameters to a location helpful for recognition.