• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 1998년도 가을 학술발표논문집 Vol.25 No.2 (2)
• /
• pp.482-484
• /
• 1998

Abstract : Multimedia data now one of the widely used information in all the fields as the fast developments of computer techniques have been made. Traditional database systems based on textual information have limitations when applied to multimedia information. This is because simple textual descriptions are ambiguous and inadequate for searching multimedia information for multimedia databases and digital libraries. Thus, especially for image data, which is one of the important multimedia information types, which can retrieve and browse image data on the basis of pictorial queries. Therefore, this paper presents an efficient method for describing texture information in image data.

• Asia pacific journal of information systems
• /
• 제11권2호
• /
• pp.181-203
• /
• 2001

As the Internet is used extensively, multimedia information becomes more prevailing and accessible. However, legacy decision support systems rarely mention how to put such multimedia contents into practical use for decision making and support. In particular, no proposals have yet been made on how to integrate the decision technologies and multimedia databases in model management systems. Hence, the aim of this paper is to propose a new model management method to integrating decision technologies and an image database management system to create a multimedia decision support. For this purpose, extended ARG and structured modeling techniques are adopted, to represent image contents and mathematical models respectively. A web-based prototype system is presented to illustrate the feasibility and usability of the methodology.

• Journal of Information Processing Systems
• /
• 제9권2호
• /
• pp.315-332
• /
• 2013

This paper presents an approach for improving the use of VP-tree in video indexing and searching. A vantage-point tree or VP-tree is one of the metric space-based indexing methods used in multimedia database searches and data retrieval. Instead of relying on the Euclidean distance as a measure of search space, the proposed approach focuses on the trigonometric inequality for compressing the search range, which thus, improves the search performance. A test result of using 10,000 video files shows that this method reduced the search time by 5-12%, as compared to the existing method that uses the AESA algorithm.

• 한국데이타베이스학회:학술대회논문집
• /
• 한국데이타베이스학회 1997년도 International Conference MULTIMEDIA DATABASES on INTERNET
• /
• pp.129-136
• /
• 1997

The Multimedia Press System is an integrated tool for electronic archiving and evaluating articles and documents from all types of media. It may be used by the following departments of a company, a government agency or other organisations in their work with the media and publications: 1. press and/or public relations 2. information and/or documentation 3. internal relations 4. investor relations 5. marketing and advertising 6. economics. It may also be used in 7. independent agencies for public relations and advertising and in 8. media-archives of publishing houses and broadcasting stations.(omitted)

• 한국컴퓨터산업학회논문지
• /
• 제5권9호
• /
• pp.1025-1030
• /
• 2004

멀티미디어 데이타베이스 시스템에서 k-최대근접질의는 매우 빈번히 발생하며, 다른유형의 공간질의에 비하여 처리비용이 많이 요구된다. K-최대근접질의의 처리비용을 최적화하기 위해서는 색인에서 검색되는 노드의 수와 연산시간을 최소화할 수 있어야한다. 본 논문에서는 최적검색거리[1]의 연산시간을 줄일 수 있는 새로운 검색거리를 제안하고 그 특성을 보인다.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2008년도 제39차 동계학술발표논문집 16권2호
• /
• pp.313-320
• /
• 2009

본 논문은 옥내 이동객체 데이터베이스의 갱신 전략을 제안한다. 제안하는 방법은 최근의 일련의 측정치에 칼만 필터를 적용하여 이동객체의 속도를 예측하고, 예측한 속도를 최근 측정치에 적용하여 현재 위치를 추정한다. 그리고 현재 위치로 추정된 값과 현재 실측값의 차이가 일정 거리 이하이면 실측값을 전송하지 않는다. 제안하는 방법의 효율성을 검증하기 위하여 실험 공간을 실제로 걸어가면서 측정한 일련의 측정치에 제안하는 방안을 적용하여 전송을 절약하는 비율과 이로 인한 오차의 증가율을 분석한다.

• 한국멀티미디어학회논문지
• /
• 제8권1호
• /
• pp.101-110
• /
• 2005

최근 들어 하드웨어 키보드가 제한적인 모바일 단말기에서 소프트웨어 키보드가 광범위하게 사용되고 있다 본 연구에서는 데이터베이스 분석을 통해 최적의 키보드 공간을 생성하여 최소의 입력 단계로 원하는 입력이 가능한 새로운 소프트웨어 키보드 입력 방법을 제시하였다. 제안된 소프트웨어 키보드는 입력 가능한 모든 단어를 분석하여 각각의 입력 단계에 따라 동적으로 생성된다. 이때 최소한의 키 버튼만을 도시함으로써 키 버튼 선택 영역을 최소화하고 키 입력 실수를 방지한다. 또한 입력 가능한 단어들의 수가 제한적일 때 후입력 자동 완성 기능을 제공함으로써 키 버튼 선택 횟수를 최소화할 수 있다.

• 한국멀티미디어학회논문지
• /
• 제6권4호
• /
• pp.601-609
• /
• 2003

In wireless mobile networks, the service area is partitioned into several registration areas (RAs). Every RA is associated with a mobility database called Visitor Location Register (VLR). The VLR is used to achieve the location management of the mobile terminals. When a mobile terminal enters a new RA, the VLR stores the current location information of the mobile terminal before serving any mobile services. At that time, if the VLR is full, the registration procedure fails, and the system can not deliver services to the mobile user under the existing cellular technology To resolve this problem, we propose a VLR overflow control scheme considering mobility of mobile users to accomodate incoming users during VLR overflow. The performance of the proposed scheme is evaluated by an analytic model in terms of costs for the location search and the location update, and compared with those of the overflow control scheme proposed by Lin[1].

• Genomics & Informatics
• /
• 제4권4호
• /
• pp.173-181
• /
• 2006

Pattern finding is one of the important tasks in a protein or DNA sequence analysis. Alignment is the widely used technique for finding patterns in sequence analysis. BLAST (Basic Local Alignment Search Tool) is one of the most popularly used tools in bio-informatics to explore available DNA or protein sequence databases. BLAST may generate a huge output for a large sequence data that contains various sequence patterns. However, BLAST does not provide a tool to summarize and analyze the patterns or matched alignments in the BLAST output file. BLAST lacks of general and robust parsing tools to extract the essential information out from its output. This paper presents a pattern summary system which is a powerful and comprehensive tool for discovering pattern structures in huge amount of sequence data in the BLAST. The pattern summary system can identify clusters of patterns, extract the cluster pattern sequences from the subject database of BLAST, and display the clusters graphically to show the distribution of clusters in the subject database.

• 한국멀티미디어학회논문지
• /
• 제20권2호
• /
• pp.344-351
• /
• 2017

In this paper, we propose the obstacle database management module for obstacle estimation and clustering. The proposed G-eye manager system can create customized walking route for blind people using the UI manager and verify the coordinates of the path. Especially, G-eye management system designed a regional information module. The regional information module can improve the loading speed of the obstacle data by classifying the local information by clustering the coordinates of the obstacle. In this paper, we evaluate the reliability of the walking route generated from the obstacle map. We obtain the coordinate value of the path avoiding the virtual obstacle from the proposed system and analyze the error rate of the path avoiding the obstacle according to the size of the obstacle. And we analyze the correlation between obstacle size and route by classifying virtual obstacles into sizes.