• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.55-62
• /
• 2021

In this paper, we propose a human-content interface that allows users to quickly and efficiently search data through friction-based scrolling with ROI(Regions of interests). Our approach, conceived from the behavior of finding information or content of interest to users, efficiently calculates ROI for a given content. Based on the kernel developed by conceiving from GMM(Gaussian mixture model), information is searched by moving the screen smoothly and quickly to the location of the information of interest to the user. In this paper, linear interpolation is applied to make one softer inertia, and this is applied to scrolls. As a result, unlike the existing approach in which information is searched according to the user's input, our method can more easily and intuitively find information or content that the user is interested in through friction-based scrolling. For this reason, the user can save search time.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2776-2785
• /
• 1998

An image retrieval system based on image content is a key issue for building and managing large multimedia database, such as art galleries and museums, trademarks and copyrights, and picture archiving and communication system. Therefore, the interest on the subject of content-based image retrieval has been greatly increased for the last few years. This paper proposes a feature-based image retrieval technique which uses a compound feature vector representing both of color and shape of an image. Color information for the feature vector is obtained using the algebraic moment of each pixel of an image based on the property of regional color distribution. Shape information for the feature vector is obtained using the Improved Moment Invariant(IMI) which reduces the quantity of computation and increases retrieval efficiency. In the preprocessing phase for extracting shape feature, we transform a color image into a gray image. Since we make use of the modified DCT algorithm, it is implemented easily and can extract contour in real time. As an experiment, we have compared our method with previous methods using a database consisting of 150 automobile images, and the results of the experiment have shown that our method has the better performance on retrieval effectiveness.

• Smart Media Journal
• /
• v.8 no.2
• /
• pp.86-93
• /
• 2019

The purpose of this study is to develop walk score application GUI in a smart device for improving user convenience. This study uses the walk score dataset of Seoul City developed in previous studies. Application GUI consists of five parts: address input window and search button, detail information (address, latitude, longitude, walk score), window switching and input window for a number of data, data input window, and menu button. For verifying application GUI, this study uses 12 locations (sets of address, latitude, longitude, and walk score) near Gangnam Station and Myungdong Station in Seoul in several scenarios. First, this study checks if the application has been implemented with address and keyword search options. Then, new data insertion and file output operations are evaluated. The application system developed in this study operated properly in all scenarios. This walk score application can be a useful device in our daily lives.

• Korean Journal of Cognitive Science
• /
• v.10 no.1
• /
• pp.67-78
• /
• 1999

Information providers on WWW have been rapidly increasing, and they provide a vast amount of information in various fields, Because of this reason, it becomes hard for users to get the information they want. Although there are several search engines that help users with the keyword matching methods, it is not easy to find suitable keywords. In order to solve these problems with a specific domain, we propose an intelligent information agent(HHA-la : HongIk Information Agent) that converts user's q queries to forms including related domain words in order to represent user's intention as much as it can and provides the necessary information of the domain to users. HHA-la h has an ontological knowledge base of animal domain, supplies necessary information for queries from users and other agents, and provides relevant web page information. One of system components is a WebDB which indexes web pages relevant to the animal domain. The system also supplies new operators by which users can represent their thought more clearly, and has a learning mechanism using accumulated results and user feedback to behave more intelligently, We implement the system and show the effectiveness of the information agent by presenting experiment results in this paper.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.205-209
• /
• 2006

무선 네트워크의 기술 발달과 이동기기들의 많은 보급에 따라 GIS, LBS 등의 위치기반 서비스 등이 널리 사용되고 있다. 이러한 서비스를 수행하기위하여 방대한 양의 이동 객체들의 효율적인 관리, 검색에 대한 연구가 많이 이루어지고 있으며 이동 객체들의 특성과 사용목적에 따라 다양한 연구결과가 제시되고 있다. 본 논문에서는 시간에 따라 다양한 속도와 방향으로 이동하는 다차원 이동 공간 데이터를 위한 효율적인 색인 기법을 제시한다. 제안된 방법은 KDB-Tree와 QSF-Tree에 기반을 두고 있으며 색인 구조의 검색 성능을 향상시키기 위한 분할, 갱신 방법을 제시하여 시간에 따라 현재 속도와 방향이 다양하게 변화하는 데이터를 신속히 데이터를 색인하고 영역 질의 뿐만 아니라 미래 예측 질의에 대하여 현재 보유한 데이터 정보를 기반으로 미래 예측 결과를 신속히 산출할 수 있도록 한다.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.719-724
• /
• 2007

본 논문에서는 광범위한 지역을 감시하기 위해 설치된 여러 대의 카메라로부터 획득된 비디오에 대해 행동을 기반으로 한 비디오 요약 시스템을 제안한다. 제안된 시스템은 시야가 겹쳐지지 않은 다수의 CCTV 카메라를 통해서 촬영한 비디오들을 30분 단위로 나누어 비디오 데이터베이스를 구축하여 시간별, 카메라별 비디오 검색이 가능하다. 또한 비디오에서 키프레임을 추출하여 카메라별, 사람별, 행동별로 비디오를 요약할 수 있도록 하였다. 또한 임계치에 따라 키프레임 검색정도를 조절함으로써 비디오 요약정도를 조절할 수 있다. in. out, stay, left, right, forward, backward와 관련된 11가지 행동을 추출하여 요약된 정보를 가지고 현재 사람의 행동이 어떤 영역에서 어떤 방향으로 움직이고 있는 지에 대한 정보를 보여줌으로써 더 자세히 행동추적을 할 수 있다. 또한 카메라 3대에 대한 전체적인 키프레임에 대한 행동별 통계를 통해서 감시지역의 행동기반 이벤트를 간단히 확인해 볼 수 있다.

• Journal of KIISE:Software and Applications
• /
• v.34 no.12
• /
• pp.1037-1044
• /
• 2007

Recently, we extract the representative melody of the music and index the music to reduce searching time at the content-based music retrieval system. The existing study has used MIDI data to extract a representative melody but it has a weak point that can use only MIDI data. Therefore, this paper proposes a representative melody retrieval method that can be use at all audio file format and uses digital signal processing. First, we use Fast Fourier Transform (FFT) and find the tempo and node for the representative melody retrieval. And we measure the frequency of high value that appears from PCM Data of each node. The point which the high value is gathering most is the starting point of a representative melody and an eight node from the starting point is a representative melody section of the audio data. To verity the performance of the method, we chose a thousand of the song and did the experiment to extract a representative melody from the song. In result, the accuracy of the extractive representative melody was 79.5% among the 737 songs which was found tempo.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.19-22
• /
• 2005

XML은 비즈니스 메시징, 웹사이트 정보 통합, 그리고 카탈로그 통합 등의 분야에서 다양한 데이터를 표현하기 위한 포맷으로 급격하게 성장했다. 그러나 XML 데이터의 형태가 고정되어 있지 않기 때문에 전통적인 질의 방법이 항상 정확한 결과를 보여주지는 않는다. 또한 객체 지향 DBMS가 이 영역에 적합한지의 여부는 아직 명확하지 않다. 따라서 XML 데이터를 효율적으로 검색하기 위해 기존의 관계형 DBMS와 연계하여 구조 유사성을 기반으로 하는 검색 기법이 연구되고 있다. 그 중 문서, 경로, 단어로 구성된 3차원 비트맵 인덱스를 이용한 검색 시스템은 다른 XML 문서 검색 시스템보다 훨씬 빠른 수행 속도를 보여주지만, 3차원의 메모리 구조를 사용하여 많은 저장공간을 필요로 하는 단점이 있다. 본 논문에서는 XML 문서를 저장할 때 경로들 사이의 유사성을 이용하여 XML 데이터의 경로를 통합하는 기법에 대해 소개한다. 이렇게 통합된 경로를 이용하여 생성하는 3차원 비트맵 인덱스는 그 크기가 상당히 줄어들게 되고, 기존의 연구에서 보여주었던 문제점들을 해결하게 되었다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.5
• /
• pp.906-912
• /
• 2009

Offline-based study is proceeding effectively for directly teaching and communication between a learner and a professor. In general virtual education system have been solve this problem using provides search of particular learning domain and auto feedback of relative learning domain after examination. But the learner needs personally select the right document among search result set and interconnected precedence study domain. Therefore, the unskilled learner is difficult of learning progress over against offline-based study. This paper suggests a index mechanism of varied views for helps to learner understand the flow and direction of learning and correlation between units.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.81-90
• /
• 2004

Recently, It has been increased to use a multi-dimensional data in various applications with a rapid growth of the computing environment. In this paper, we propose the vector approximate tree for content-based retrieval of multi-dimensional data. The proposed index structure reduces the depth of tree by storing the many region information in a node because of representing region information using space partition based method and vector approximation method. Also it efficiently handles 'dimensionality curse' that causes a problem of multi-dimensional index structure by assigning the multi-dimensional data space to dynamic bit. And it provides the more correct regions by representing the child region information as the parent region information relatively. We show that our index structure outperforms the existing index structure by various experimental evaluations.