• Information and Communications Magazine
• /
• v.11 no.12
• /
• pp.71-93
• /
• 1994

본고에서는 멀티미디어 정보통신 서비스를 일반사용자에게 제공하기 위하여 제공될 각 종 단말기들의 기본적인 아키텍쳐와 그를 구성하는 핵심 모듈들을 살펴보고, 각 종 단말기들이 서로 호환성을 가지고 동작하기 위하여 필요한 코덱의 표준화와 망과의 접속문제 특히 ATM과의 접속문제를 알아본다. 멀티미디어 정보통신 서비스용 단말기 아키텍쳐를 살펴보고, ISDN 단말기, B-ISDN 단말기, 대화형 멀티미디어 정보검색용 단말기 구조를 설명한다. 단말기의 핵심을 이루는 오디오-비쥬얼 코덱과 코덱의 표준 알고리즘인 MPEG 알고리즘, 특히 MPEG-2와 각종 서비스 질에 맞추기 위한 MPEG-2 확장형 알고리즘을 살펴본다. 그리고 ATM 망에서 MPEG-2 비트스트림을 수용하기 위한 방법에 대하여 AAL 관점에서 살펴보고, 오디오-비쥬얼 코덱이 가지는 큰 문제점 중의 하나인 지연문제에 대하여 알아본다. 멀티미디어 서비스를 위한 각 종 응용물들을 일반사용자가 손쉽게 배워서 사용토록 할 수 있는 사용자 인터페이스를 단말기에서 제공하기 위하여 고려해야 될 사항과 해결해야 할 문제점들에 대하여 살펴본다.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.1
• /
• pp.29-40
• /
• 2008

With the spread of mobile devices and advances in communication techknowledges, the needs of application which uses the movement patterns of moving objects in history trajectory data of moving objects gets Increasing. Especially, to design public transportation route or road network of the new city, we can use the similar patterns in the trajectories of moving objects that move on the spatial network such as road and railway. In this paper, we propose a spatio-temporal similar trajectory search algorithm for moving objects on road network. For this, we define a spatio-temporal similarity measure based on the real road network distance and propose a grid-based index structure for similar trajectory search. Finally, we analyze the performance of the proposed similar trajectory search algorithm in order to show its efficiency.

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

The Internet users want to get real-time services for various multi-media applications. Network traffic rate has been rapidly increased, and data amounts that the Internet has to carry have been exponentially increased. A packet is the basic unit in transferring data at the Internet, and packet classification is one of the most challenging functionalities that routers should perform at wire-speed. Among various known packet classification algorithms, area-based quad-trie (AQT) algorithm is one of the efficient algorithms which can lookup five header fields simultaneously. As a representative space decomposition algorithm, the AQT requires a small amount of memory in storing classification rules, but it does not provide high-speed classification performance. In this paper, we propose a new packet classification algorithm by applying a binary search for the codewords of the AQT to overcome the issue of the AQT. Throughout simulation, it is shown that the proposed algorithm provides a better performance than the AQT in the number of rule comparisons with each input packet.

• Journal of Internet Computing and Services
• /
• v.16 no.6
• /
• pp.23-30
• /
• 2015

As BigData is issued, many applications that operate based on the results of data analysis have been developed, typically applications are products recommend service of e-commerce application service system, search service on the search engine service and friend list recommend system of social network service. In this paper, we suggests a decision frequent pattern tree that is combined the origin frequent pattern tree that is mining similar pattern to appear in the data set of the existing data mining techniques and decision tree based on the theory of computer science. The decision frequent pattern tree algorithm improves about problem of frequent pattern tree that have to make some a lot's pattern so it is to hard to analyze about data. We also proposes to model for a Mapredue framework that is a programming model to help to operate in distributed environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.532-535
• /
• 2008

The requirement of Digital Culture Content(Movie, Music, Animation, Digital TV, Exhibition and etc.) is increasing so variety and quantity of content is also increasing. The Movie what majority of the digital Content is developing of technology and data. In the result, the efficient retrieval service has required and user want to use a recommendation engine and semantic retrieval methods through the recommendation system. Therefore, this paper will suggest analysing trait element of digital content data, building of retrieval technology, analysing and retrieval technology base on KANSEI vocabulary and etc. For the these, we made a extraction technology of trait element based on semantics and KANSEI processing algorithm based on color information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.5
• /
• pp.385-393
• /
• 2013

In the past decade, a paradigm shift from machine-centered to human-centered and from technology-driven to user-driven has been witnessed. Consequently, Social search is getting more social and Social Network Service (SNS) is a popular Web service to connect and/or find friends, and the tendency of users interests often affects his/her who have similar interests. If we can track users' preferences in certain boundaries in terms of Web search and/or knowledge sharing, we can find more relevant information for users. In this paper, we propose a novel Topic Sensitive_Social Relationship Rank (TS_SRR) algorithm. We propose enhanced Web searching idea by finding similar and credible users in a Social Network incorporating social information in Web search. The Social Relation Rank between users are Social Relation Value, that is, for a different topics, a different subset of the above attributes is used to measure the Social Relation Rank. We observe that a user has a certain common interest with his/her credible friends in a Social Network, then focus on the problem of identifying users who have similar interests and high credibility, and sharing their search experiences. Thus, the proposed algorithm can make social search improve one step forward.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.1078-1081
• /
• 2010

웹 2.0의 영향으로 인터넷 상에 범람하는 컨텐츠를 이용함에 있어 태깅 시스템은 매우 유연하고 효과적인 분류를 가능케 한다. 대부분의 웹 2.0 사이트에서는 검색된 정보에 해당하는 태그와 연관성이 있는 태그를 나타냄으로써 또 다른 관련 컨텐츠를 이용할 수 있는 서비스를 제공한다. 컨텐츠 사용자에 의해 생성되는 태그는 개인 성향에 따라 동일 컨텐츠에 다양하게 적용될 수 있으며 이로 인해 태그를 이용한 검색은 낮은 정확도를 나타낼 수 있다. 본 논문에서는 태그 선택에 있어 인간 상호작용의 특성을 파악하여 개인이 선호하고, 필요로 하는 컨텐츠에 대한 태그를 추천할 수 있는 태그 가치 측정 알고리즘을 제안한다. 컨텐츠 선택에 있어 의사결정에 영향을 미치는 요인을 식별하고 선호영화 추천 서비스인 MovieLens 사이트의 데이터 셋을 적용하여 태그 추천의 예측 정확도를 비교 평가함으로써 향상된 태그 가치 산정 결과를 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.441-443
• /
• 2011

본 논문은 오디오 특징 분석을 기반으로 한 음악검색 방법에 대한 기술과 연구에 대한 내용이다. 본 연구에서는 크게 3가지의 주요 알고리즘을 이용하여 다 성음에서의 오디오 특징을 추출하고 3가지의 각자 다른 방식의 매칭 알고리즘을 기반으로 한 퓨전 매칭 방식을 제안한다. 오디오 특징으로는 메인 멜로디, 음악 구조를 분석한 세그먼테이션 정보를 이용한다. 본 연구에서 사용된 음악 DB는 음악 포털 서비스에서 제공하는 장르를 기반으로 한 8가지 장르에서 다양한 범위에서 2000곡을 선곡하였다. 오디오 특징 추출을 위한 알고리즘 개발과 매칭 알고리즘 개발을 위하여 음악 DB 2000곡 중 장르의 비율을 고려하여 100곡을 선정하고, 24명으로부터 1200개의 허밍을 녹음하였다. 24명중 3명은 대학에서 음악을 전공하고 나머지는 음악적 교육을 받은 경험이 없는 사람들이다. 1200개의 허밍을 분석한 결과 전체 허밍 중 60%정도가 노래의 시작 부분을 허밍하거나 노래를 불렀고, 30%정도는 하이라이트 부분을 허밍 하였다. 나머지 10%정도는 자신이 가장 자신 있는 부분을 불렀다. 이러한 분석 결과를 기반으로 가장 중요한 부분은 노래가 시작되는 부분에서의 멜로디를 정확하게 찾아내는 것이 무엇보다 중요하다는 것이다. 본 연구에서 검색결과의 평가는 MRR를 이용하여 측정하였다. MIDI DB를 사용한 경우가 다 성음에서 직접 멜로디를 추출한 경우보다 약간 성능이 우수하게 나왔으나 그 차이는 미미했다. 본 연구에서는 개발된 알고리즘을 이용하여 PC상에서 사용할 수 있는 클라이언트 프로그램과 Android app를 개발하였다.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.490-498
• /
• 2010

In the web or not, all academic information have the creator which produces that information. The creator can be individual, organization, institution, or country. Most information consist of the title, author and content. The article among academic information is described by title, author, keywords, abstract, publisher, ISSN(International Standard Serial Number) and etc., and the patent information is consisted some metadata such as invention title, applicant, inventors, agents, application number, claim items etc. Most web-based academic information services provide search functions to user by processing and handling these metadata, and the search function using the author field is important. In this paper, we propose an effective indexing management for person name search, and search techniques using boosting factor and near operation based on phrase search to improve precision rate of search result. And we describe person name retrieval result with another expression name, co-authors and persons in same research field. The approach presented in this paper provides accurate data and additional search results to user efficiently.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.493-498
• /
• 2004

A novel approach for path planning of a polygonal robot is presented. Traditional path planners perform extensive geometric searching to find the optimal path or to prove that there is no solution. The computation required to prove that there is no solution is equivalent to exhaustive search of the motion space, which is typically very expensive. Humans seems to use a set of several different path planning strategies to analyse the situation of the obstacles in the environment, and quickly recognize whether the path-planning problem is easy to solve, hard to solve or has no solution. This human path-planning strategies have motivated the development of the presented algorithm that combines qualitative shape reasoning and exhaustive geometric searching to speed up the path planning process. It has three planning stages consisting of identification of no-solution cases based on an enclosure test, a qualitative reasoning stage, and finally a complete search algorithm in case the previous two stages cannot determine of the existence of a solution path.