• Journal of Digital Contents Society
• /
• v.18 no.5
• /
• pp.811-820
• /
• 2017

For content-based audio retrieval which is one of main functions in audio service, the techniques for extracting fingerprints from the audio source, storing and indexing them in a database are widely used. However, if the fingerprints of new audio sources are continually inserted into the database, there is a problem that space efficiency as well as audio retrieval performance are gradually deteriorated. Therefore, there is a need for techniques to support efficient expansion of audio database without periodic reorganization of the database that would increase the system operation cost. In this paper, we design a content-based audio retrieval system that solves this problem by using MapReduce and NoSQL database in a cluster computing environment based on the Shazam's fingerprinting algorithm, and evaluate its performance through a detailed set of experiments using real world audio data.

• Journal of the Institute of Convergence Signal Processing
• /
• v.16 no.1
• /
• pp.22-28
• /
• 2015

In this paper, a service system which shows linked video clips from the static images extracted from newspapers, magazines, photo albums and etc in an augmented reality. First, the system uses SURF algorithm to extract features from the original photos printed in the media and stores them with the linked video clips. Next, when a photo is taken by using a camera from mobile devices such as smart phones, the system extracts features in real time, search a linked video clip matching the original image, and shows it on the smart phone in an augmented reality. The proposed system is applied to Android smart phone devices and the test results verify that the proposed system operates not only on normal photos but also on partially damaged photos.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.163-169
• /
• 2004

In this paper, a conventional key exchange method simply performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. Proposed handover method shows reduced handover processing time than conventional method since it can reduce CRL retrieval time. Also, we compared proposed authentication structure and conventional algorithm. and simulation results show that proposed authentication method outperforms conventional algorithm in all environment regardless of call arrival rate. queue service rate. queue size.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.153-156
• /
• 2011

최근 많은 관심을 받고 있는 증강현실 위치기반 서비스와 같이 사용자의 한정된 시야각이 존재하는 상황에서 사용자가 원하는 데이터를 효과적으로 제공하기 위하여 본 논문에서는 새로운 위치기반 질의인 시야 최근접 질의 (VFNN: View Field Nearest Neighbor Queries)를 소개한다. VFNN 질의는 사용자의 시야각내에 위치하는 가장 가까운 데이터를 검색한다. 본 논문에서 제안하는 VFNN 질의 처리 알고리즘은 가장 널리 활용되고 있는 공간 데이터 색인 구조인 $R^*$-tree를 사용한다. 특히, 질의 점과 MBR 사이의 최소거리인 MINDIST뿐만 아니라, 질의 점과 MBR 사이의 최대 각, 최소 각을 정의한다. 이를 활용하여 $R^*$-tree 탐색 시 질의 결과 값을 포함하지 않는 노드들을 연산에서 제외함으로써 질의 처리의 효율성을 향상시킨다. 마지막으로 실험을 통하여 VFNN 질의 처리 알고리즘의 성능을 평가한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.526-528
• /
• 2004

메타데이타에 대한 접근이 특정 디렉토리에 집중되며 메타데이타 연산마다 다른 계산량을 가지는 클러스터 파일 시스템의 특성상 메타데이타 서버 간 부하의 불균형과 과부하가 발생한다. 따라서 클러스터 파일 시스템의 성능을 결정짓는 중요 요소인 메타데이타 서비스의 성능을 위해서는 메타데이타 서버들의 과부하 상황에 대처할 수 있는 합리적인 부하 분산 기법이 필수적이다. 메타데이타 공간을 분할하여 담당영역만을 관리하는 비대칭 메타데이타 서버를 위해 본 눈문은 클라이언트 요청의 내용을 분석하여 담당 메타데이타 서버를 결정하고 해당 연산의 종류에 따라 단순 검색, 메타데이타 중복 저장(replication), 또는 메타데이타에 대한 로깅(logging)을 수행하는 내용 기반의 부하 분산 알고리즘을 제시하였다.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.131-143
• /
• 2007

The current trends in information technology and intelligent systems use data mining techniques to discover patterns and extract rules from distributed databases. In distributed environment, the extracted rules from data mining techniques can be used in dynamic replications, adaptive load balancing and other schemes. However, transmission of large data through the system can cause errors and unreliable results. This paper proposes the intelligent distributed platform based on dynamic group binding using mobile agents which addresses the use of intelligence in distributed environment. The proposed grouping service implements classification scheme of objects. Data compressor agent and data miner agent extracts rules and compresses data, respectively, from the service node databases. The proposed algorithm performs preprocessing where it merges the less frequent dataset using neuro-fuzzy classifier before sending the data. Object group classification, data mining the service node database, data compression method, and rule extraction were simulated. Result of experiments in efficient data compression and reliable rule extraction shows that the proposed algorithm has better performance compared to other methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.3
• /
• pp.11-21
• /
• 2010

To aim at improving performance and reflecting user's needs of retrieval, the number of researches has been actively conducted in recent year as the quantity of information and generation of the web pages exceedingly increase. One of alternative approaches can be a tagging system. It makes users be able to provide a representation of metadata including writings, pictures, and movies etc. called tag and be convenient in use of retrieval of internet resources. Tags similar to keywords play a critical role in maintaining target pages. However, they still needs time consuming labors to annotate tags, which sometimes are found to be a hinderance caused by overuse of tagging. In this paper, we present an automatic tagging scheme for a solution of current tagging system conveying drawbacks and inconveniences. To realize the approach, face recognition-based tagging system on SNS is proposed by building a face area detection procedure, linear-based classification and boosting algorithm. The proposed novel approach of tagging service can increase possibilities that utilized SNS more efficiently. Experimental results and performance analysis are shown as well.

• Journal of Korea Multimedia Society
• /
• v.16 no.4
• /
• pp.453-463
• /
• 2013

In this paper, we present an effective method and a system for the music summarization which automatically extract the chorus portion of a piece of music. A music summary technology is very useful for browsing a song or generating a sample music for an online music service. To develop the solution, conventional automatic music summarization methods use a 2-dimensional similarity matrix, statistical models, or clustering techniques. But our proposed method extracts the music summary by calculating BER(Bit Error Rate) between audio fingerprint blocks which are extracted from a song. But we could directly use an enormous audio fingerprint database which was already saved for a music retrieval solution. This shows the possibility of developing a various of new algorithms and solutions using the audio fingerprint database. In addition, experiments show that the proposed method captures the chorus of a song more effectively than a conventional method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2919-2925
• /
• 2014

Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1339-1342
• /
• 2001

통신 및 네트웍 사용자의 증가와 실시간 처리를 요하는 멀티미디어 데이터 서비스의 증가로 인해 네트웍 트래픽의 증가, 서비스 품질 저하 및 접속 속도의 감소를 초래하게 되었다. 이러한 문제를 해결하기 위하여 기존 라우터 보다 용량이 크면서 한계를 극복할 수 있는 장비가 검토 중에 있으며 또한 라우터의 총량확장에 따른 테이블의 크기 증가와 효율적인 경로 선택을 위한 검색 시간 증가를 초래하게 되므로 라우팅 테이블의 구성방식에 대한 연구는 매우 중요하다. 본 논문은 Zebra 라는 TCP/IP 기반의 라우팅 프로토콜을 관리하는 프리 소프트웨어를 이용하여 라우팅 테이블의 구조와 구성방식에 대하여 분석하며 비교 알고리즘의 구현 및 성능 비교와 평가를 통하여 그 정당성을 검증한다.