• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.362-370
• /
• 2001

In this paper, we proposed multispectral image compression method using CIP (classified inter-channel prediction) and SVQ (selective vector quantization) in wavelet domain. First, multispectral image is wavelet transformed and classified into one of three classes considering reflection characteristics of the subband with the lowest resolution. Then, for a reference channel which has the highest correlation and the same resolution with other channels, the variable VQ is performed in the classified intra-channel to remove spatial redundancy. For other channels, the CIP is performed to remove spectral redundancy. Finally, the prediction error is reduced by performing SVQ. Experiments are carried out on a multispectral image. The results show that the proposed method reduce the bit rate at higher reconstructed image quality and improve the compression efficiency compared to conventional methods. Index Terms-Multispectral image compression, wavelet transform, classfied inter-channel prediction, selective vetor quantization, subband with lowest resolution.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.79-84
• /
• 2015

In a distribution of digital image, there is a serious problem that is a distribution of the altered image by a forger. For the problem solution, this paper proposes a median filtering (MF) image forensic decision algorithm using a feature vector according to the pixel value's gradients. In the proposed algorithm, AR (Autoregressive) coefficients are computed from pixel value' gradients of original image then 1th~6th order coefficients to be six feature vector. And the reconstructed image is produced by the solution of Poisson's equation with the gradients. From the difference image between original and its reconstructed image, four feature vector (Average value, Max. value and the coordinate i,j of Max. value) is extracted. Subsequently, Two kinds of the feature vector combined to 10 Dim. feature vector that is used in the learning of a SVM (Support Vector Machine) classification for MF (Median Filtering) detector of the altered image. On the proposed algorithm of the median filtering detection, compare to MFR (Median Filter Residual) scheme that had the same 10 Dim. feature vectors, the performance is excellent at Unaltered, Averaging filtering ($3{\times}3$) and JPEG (QF=90) images, and less at Gaussian filtering ($3{\times}3$) image. However, in the measured performances of all items, AUC (Area Under Curve) by the sensitivity and 1-specificity is approached to 1. Thus, it is confirmed that the grade evaluation of the proposed algorithm is 'Excellent (A)'.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.4
• /
• pp.95-103
• /
• 2009

In this paper, a generation method of transmit and receive beamforming vectors based on base station cooperation is proposed which maximizes the user SINR in mobile cellular multi-user MIMO systems. There are two main sources of interference which deteriorate the performance of the system, i.e. the inter-user interference caused by the usage of the same radio resource for multiple users in the system, and the inter-cluster interference from neighboring base stations which are not participating in cooperative transmission. The proposed scheme cancels out the inter-user interference by using the block diagonalization(BD) method, and mitigate the inter-cluster interference by using optimal transmit and receive beamforming vectors based on optimal combining(OC) with the statistic information of inter-cluster interference. We perform computer simulations to verify the performance of the proposed scheme, and compare the result to the conventional performance obtained from utilizing the receiver side information only or utilizing the information from neither sides. The performance evaluations are conducted not only over the independent MIMO channels, but over correlated MIMO channels to demonstrate the robustness of the proposed scheme over the channels with correlation among antennas.

• The Journal of Society for e-Business Studies
• /
• v.24 no.2
• /
• pp.1-14
• /
• 2019

Because of the characteristics of game software, it is important to quickly identify and reflect users' needs into game software after its launch. However, most sites such as the Google Play Store, where users can download games and post reviews, provide only very limited and ambiguous classification categories for game reviews. Therefore, in this paper, we develop an automatic classification system for game reviews that categorizes reviews into categories that are clearer and more useful for game providers. The developed system converts words in reviews into vectors using word2vec, which is a representative word embedding model, and classifies reviews into the most relevant categories by measuring the similarity between those vectors and each category. Especially, in order to choose the best similarity measure that directly affects the classification performance of the system, we have compared the performance of three representative similarity measures, the Euclidean similarity, cosine similarity, and the extended Jaccard similarity, in a real environment. Furthermore, to allow a review to be classified into multiple categories, we use a threshold-based multi-category classification method. Through experiments on real reviews collected from Google Play Store, we have confirmed that the system achieved up to 95% accuracy.

• Annual Conference on Human and Language Technology
• /
• 1996.10a
• /
• pp.424-429
• /
• 1996

본 논문에는 일반문서를 대상으로 하여 그 문사를 하이퍼텍스트(hypertext)로 자동변환하는 기법을 제안하고자 한다. 자동변환의 과정은 대상 문서에서 키워드(keyword)의 인식, 문서를 노드(node) 단위로 분리, 키워드로부터 노드로의 링크(ink) 생성의 3 단계로 이루어 진다. 기존의 연구에서는 문서에서 노드를 분리하는데 구문적 유사도만을 이용하는데, 본 논문에서는 양질의 하이퍼텍스트를 생성하기 위하여 구문적 유사도(syntactic similarity)뿐만 아니라 의미적 유사도(semantic similarity)를 사용한다. 구문적 유사도는 tf*idf와 벡터 곱(vector product)을 이용하고, 의미적 유사도는 시소러스(thesaurus)와 부분부합(partial match)을 이용하여 계산되어 진다. 또 링크 생성시 잘못된 링크의 생성을 막기 위하여 시소러스를 이용하여 시소러스에 존재하는 용어에 한해서 링크를 생성한다.

• Annual Conference on Human and Language Technology
• /
• 1996.10a
• /
• pp.235-240
• /
• 1996

본 논문에서는 정보 검색에서 사용하는 계층적 클러스터링 기법을 이용하여 용례들을 중심어의 의미에 따라 분류하고자 한다. 분류에 필요한 용례 사이의 유사도는 형태소 사이의 유사도를 이용하여 계산한다. 형태소 사이의 유사도 계산에는 상호 정보, 상호 정보의 유사도, 벡터 유사도 등을 사용한다. 품사 태깅된 17만 코퍼스에서 명사 4개와 동사 4개를 중심어로 사용하여 추출된 용례에 대해서 각 방법의 정확도를 실험한 결과 상호 정보와 상호 정보 유사도를 더한 값을 형태소 사이의 유사도로 사용한 방법이 90.16%의 정확도를 보였다. 제안된 방법에서 사용하는 정보들은 의미 태깅되지 않은 코퍼스에서 추출할 수 있기 때문에, 정보의 획득이 쉬운 장점이 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.7-10
• /
• 2002

본 논문에서는 MPEG-7의 활동도 기술자를 이용한 비디오 기술을 제안한다. 제안한 방법은 압축상태의 비디오 자료에서 직접 움직임 벡터들을 추출, 각 프레임들의 활동도의 강도를 계산하고 프레임의 흐름에 따라 계산된 활동도의 변화량에 대해 퓨리에 변환을 적용하여 얻어진 주파수 성분을 분석하여 활동도의 시간적 분포도를 계산한다. 계산된 강도 및 분포도는 MPEG-7의 표준에 따르기 위해 양자화하여 비디오 요약에 이용한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.634-641
• /
• 2009

The goal of OSIC-series detection methods is to approach the ML performance with feasible complexity. However, since they sometimes suffer from the empty vector problem, they can not achieve the soft-output ML performance or many candidate vectors are required to achieve the soft-output ML performance. In this paper, we propose the novel detection method, which can generate the reliable soft-outputs without suffering from empty vector problem. The proposed detector can approach the near soft-output ML performance as well as hard-output. Further, the complexity study shows that the proposed detection method has the lowest complexity compared to the other detectors having the near ML performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.9
• /
• pp.5446-5451
• /
• 2014

Because there are some mistakes by hand in processing electronic maps using a navigation terminal, this paper proposes an automatic offline recognition for traffic signs, which are considered ingredient navigation information. Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA), which have been used widely in the field of 2D face recognition as computer vision and pattern recognition applications, was used to recognize traffic signs. First, using PCA, a high-dimensional 2D image data was projected to a low-dimensional feature vector. The LDA maximized the between scatter matrix and minimized the within scatter matrix using the low-dimensional feature vector obtained from PCA. The extracted traffic signs under a real-world road environment were recognized successfully with a 92.3% recognition rate using the 40 feature vectors created by the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2A
• /
• pp.113-118
• /
• 2012

In this paper, we propose the removal of search point using motion vector correlation and distance between reference frames in H.264/AVC. We remove the search points in full search method and predictive motion vectors in enhanced predictive zonal search method. Since the probability that the reference frame far from the current frame is selected as the best reference frame is decreased, we apply the weighted average based on distance between the current and reference frame to determine the fianl search range. In general, the size of search range is smaller than initial search range. We reduce motion estimation time using the final search range in full search method. Also, the refinement process is adaptively applied to each reference frame. The proposed methods reduce the computational throughput of full search method by 57.13% and of enhanced predictive zonal search by 14.71% without visible performance degradation.