• The Journal of Society for e-Business Studies
• /
• v.17 no.4
• /
• pp.209-219
• /
• 2012

Objects such as products, product reviews, and user profiles are important in e-commerce domain. Vector is one of the most widely used object representation scheme. Information of e-commerce objects may be modeled by vectors in which the featured values are assigned to various dimensions. E-commerce objects are in general quantitatively large while some are similar or even same in reality. It Plays, therefore, an important role to measure the similarity between objects. In this paper, we survey the state-of-the -art vector similarity measures. Similarity measures are analyzed to feature the algebraic characteristics and relationship of those, and upon which we classify the related measures accordingly. We then present such features that standard vector similarity measures should convey.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.247-256
• /
• 2004

In this paper, we propose the prediction search algorithm for block matching using the temporal/spatial correlation of the video sequence and the renter-biased property of motion vectors The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate pint in each search region and the predicted motion vector from the neighbour blocks of the current frame. And the searching process after moving the starting point is processed a adaptive search pattern according to the magnitude of motion vector Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 0.75dB as depend on the video sequences and improved about 0.05∼0.34dB on an average except the FS (Full Search) algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.1
• /
• pp.402-410
• /
• 2013

In this paper, we propose a new fast block matching algorithm for block matching using the temporal and spatially correlation of the video sequence and local statistics of neighboring motion vectors. Since the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vectors of neighboring blocks around the same block of the previous frame and the current frame and the predictor candidate point on each division region by binary-tree structure. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast FS(full search) motion estimation and other fast motion estimation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1577-1585
• /
• 1999

In this paper, we propose detection methods for gradual scene changes such as dissolve, pan, and zoom. The proposal method to detect a dissolve region uses scene features based on spatial statistics of the image. The spatial statistics to define shot boundaries are derived from squared means within each local area. We also propose a method of the camera motion detection using four representative motion vectors in the background. Representative motion vectors are derived from macroblock motion vectors which are directly extracted from MPEG streams. To reduce the implementation time, we use DC sequences rather than fully decoded MPEG video. In addition, to detect the gradual scene change region precisely, we use all types of the MPEG frames(I, P, B frame). Simulation results show that the proposed detection methods perform better than existing methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.4 s.304
• /
• pp.119-126
• /
• 2005

We propose a new content-based image retrieval using a representative color histogram and directional pattern histogram that is adaptive to the classification characteristics of the image blocks. In the proposed method the color and pattern feature vectors are extracted according to the characteristics o: the block classification after dividing the image into blocks with a fixed size. First, the divided blocks are classified as either luminance or color blocks depending on the saturation of the block. Thereafter, the color feature vectors are extracted by calculating histograms of the block average luminance co-occurrence for the luminance block and the block average colors for the color blocks. In addition, block directional pattern feature vectors are extracted by calculating histograms after performing the directional gradient classification of the luminance. Experimental results show that the proposed method can outperform the conventional methods as regards the precision and the size of the feature vector dimension.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.295-297
• /
• 2003

본 논문에서는 각 프레임으로부터 추출된 통계적 특성을 이용하여 동영상의 분할방법과 분할된 각 장면에 대한 대표프레임을 추출하는 방법을 제안한다. 제안된 방법은 동영상의 각 프레임에 대하여 다해상도 분석을 실시하여 저주파 부 밴드로부터 히스토그램 특징을 추출하여 급격한 장면전환을 분할하는데 이용하였으며 또한 점진적인 장면전환을 검출하기 위해서는 고주파 부 밴드로부터 계산되는 화소의 분산치를 계산하여 특징벡터로 사용하였다. 실험의 결과를 통하여 제안된 동영상의 분할방법과 대표프레임 추출에 대한 알고리즘들이 동영상 자료의 분석 및 색인을 위한 효율적인 동영상 분할을 가능하게 하며, 차후 내용기반 영상과 비디오의 색인 및 검색을 위한 전처리의 단계로 사용되어질 수 있는 매우 유용한 방법임을 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.835-837
• /
• 2005

최근 얼굴 인식은 사용자의 편의성을 포함한 다양한 장점으로 인하여 생체 인식 시장에서 주요 기술로 대두되고 있다. 그러나 조명 변화에 기인한 얼굴 인식 성능의 저하는 실용화에 걸림돌이 되고 있는 실정이다. 따라서 조명 변화에 따른 얼굴의 외형 변화를 분석하는 연구들이 세계적으로 활발히 진행되고 있다. 그러나 기존 방법들은 다수의 등록 영상이나 조명에 대한 사전 정보가 필요하거나 실시간으로 구현되기 어렵기 때문에 실용 시스템에 적용하기는 어려운 실정이다. 따라서, 본 논문에서는, 여러 조명 영상들로 구성된 학습 데이터를 이용하여, 조명에 대한 정보가 없는 한 장의 입력 영상을 분석하는 방법을 제안한다. 제안된 방법은 SVDD를 이용하여 학습 데이터의 여러 조면 영상들로부터 입력 영상의 조명과 같은 대표영상을 합성하고 이 대표영상들의 선형 조합을 이용하여 입력 영상을 표현한다. 제안 방법의 효율성을 검증하기 위하여 공인 얼굴 데이터베이스들을 이용하여, 기존 방법들과 비교 실험을 수행하였으며, 조명 변화가 큰 영상에서도 안정된 조명 변화의 분석이 가능하였다.

• 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.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.9
• /
• pp.837-843
• /
• 2001

In this work, we propose a new method of extracting and weighting representative keywords(RKs) from a few documents that might interest a user. In order to extract RKs, we first extract candidate terms and them choose a number of terms called initial representative keywords (IRKs) from them through fuzzy inference. Then, by expanding and reweighting IRKs using term co-occurrence similarity, the final RKs are obtained. Performance of our approach is heavily influenced by effectiveness of selection method of IRKs so that we choose fuzzy inference because it is more effective in handling the uncertainty inherent in selecting representative keywords of documents. The problem addressed in this paper can be viewed as the one of calculating center of document vectors. So, to show the usefulness of our approach, we compare with two famous methods - Rocchio and Widrow-Hoff - on a number of documents collections. The result show that our approach outperforms the other approaches.

• The Journal of the Korea Contents Association
• /
• v.7 no.2
• /
• pp.1-10
• /
• 2007

In this paper, we propose a face recognition system using AAM and Gabor feature vectors. EBGM, which is prominent among face recognition algorithms employing Gabor feature vectors, requires localization of facial feature points where Gabor feature vectors are extracted. However, localization of facial feature points employed in EBGM is based on Gator jet similarity and is sensitive to initial points. Wrong localization of facial feature points affects face recognition rate. AAM is known to be successfully applied to localization of facial feature points. In this paper, we propose a facial feature point localization method which first roughly estimate facial feature points using AAM and refine facial feature points using Gabor jet similarity-based localization method with initial points set by the facial feature points estimated from AAM, and propose a face recognition system based on the proposed localization method. It is verified through experiments that the proposed face recognition system using the combined localization performs better than the conventional face recognition system using the Gabor similarity-based localization only like EBGM.