• Journal of Korea Multimedia Society
• /
• v.10 no.6
• /
• pp.707-715
• /
• 2007

The need for content-based retrieval from visual media, such as image and video data, is ever increasing rapidly in many applications, such as electronic art museums, internet shopping malls, internet search engines, and medical information systems. In our previous research, we proposed an architecture, called the HERMES, which is a Web Service-enabled visual media retrieval framework. In this paper, we propose the Web Service workflows that are employed in the HERMES. We describe how we designed the workflows for service registration and query processing in the framework. We especially explain how metadata and ontology can be utilized to realize more intelligent content-based retrieval on visual media data.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.894-897
• /
• 2000

In this paper, we present a content-based image retrieval method that is less sensitive to some rotations and translations of an image by using the fuzzy region segmentation. The algorithm retrieves similar images from a database using the two features of color and color spatial information. To index images, we use the average coordinates of color distribution to obtain the spatial information of each segmented region. Furthermore, we also propose the alternative to the ripple phenomenon, which is occurred in the conventional fuzzy region segmentation algorithm.

• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.228-237
• /
• 2010

Although conventional index structures provide various nearest-neighbor search algorithms for high-dimensional data, there are additional requirements to increase search performances as well as to support index scalability for large scale data. To support these requirements, we propose a distributed high-dimensional indexing structure based on cluster systems, called a Distributed Vector Approximation-tree (DVA-tree), which is a two-level structure consisting of a hybrid spill-tree and VA-files. We also describe the algorithms used for constructing the DVA-tree over multiple machines and performing distributed k-nearest neighbors (NN) searches. To evaluate the performance of the DVA-tree, we conduct an experimental study using both real and synthetic datasets. The results show that our proposed method contributes to significant performance advantages over existing index structures on difference kinds of datasets.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.219-230
• /
• 2002

One of the most important functions digital libraries need to offer is to help users find necessary information in a distributed environment in the most efficient and effective manner. In order to meet the goal, it is desirable to link scattered pieces of information and present them as a logically coherent whole when the user wants it, so that he or she doesn't need to know their physical location. The virtual document is an integrated document that the total or part of the physical documents stored in a specific repository are linked dynamically. Our MIRAGE-III digital library system provides a content-based retrieval of physical documents and the virtual documents in XML. This system provides a retrieval of partial documents, attributes and hierarchical structures and linked-documents based in structured documents like XML or SGML. In this paper we describe a methodology of design and implementation of the query processor and retrieval server in the MIRAGE-III digital library system.

• Journal of the Korean Professional Engineers Association
• /
• v.30 no.6
• /
• pp.59-67
• /
• 1997

As Information society evolves, there is a growing need that substitutes agents for users to do the given Jobs in distributed computing environments. Agents can retrieve and browse the diverse information via Internet, as the users request, and can deal with the complicated routine jobs on behalf of users with timeliness and efficiency. Especially, mobile agent can support the paradigm for distributed application programs in Internet environments. This is suitable to jump-to-jump model without any hesitations because agent moves. Agents can be applied to various applications, but we restrict it to market information retrieval in this paper. On recognizing a query about merchandise information by an user, agent by itself retrieves the corresponding information by navigating the Internet and informs the result to the user. In this paper, we review the mobile agent configuration to do this kind of work, propose the system architecture based on this review. By using this system, users can be free from complicated routine jobs and pursue his/her wishes to promote ones welfare.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.846-848
• /
• 2009

The interest in the access and integration of distributed massive data resources has increased recently. This paper presents the Advanced Collection Manager(CM) service with OGSA-DAI component which can access and integrate the distributed data resources. The Advanced CM service supports the data resource of various types. And it can provide the query, updating, transforming and delivering data via cooperating with other services in Grid Information Retrieval(Grid-IR or GIR) System. As a result, it can access and manage the data resource more flexible and efficient.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2005.08a
• /
• pp.279-284
• /
• 2005

본 연구는 분산자원 활용을 위한 Z39.50 프로토콜, ZING SRW/SRU 프로토콜, OAI 프로토콜, ZING Update 프로토콜의 개발 배경, 특징을 살펴보고, 검색과 갱신 각 기능별로 프로토콜을 비교·분석하였다. 본 연구는 분산자원을 활용하려는 도서관 및 정보서비스기관에 기초 정보를 제공하고, 각 기관에서 분산자원을 이용하여 구축하고자 하는 서비스의 대상, 종류, 환경에 적합한 프로토콜을 선택할 수 있도록 하기 위함이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.484-486
• /
• 2002

본 논문은 여러 컬렉션에 대해 검색을 수행하는 분산 검색시스템에서 질의어가 들어 왔을 때 질의어에 적합한 컬렉션을 자동으로 선택할 수 있도록 하는 컬렉션 선택 모델과 브로커 구조를 제안하였다. 각 컬렉션마다 과거 질의에 대해 검색된 결과 문서들을 색인하여 인접단어를 고려한 불완전 인텍스를 생성한다. 이러한 불완전 인덱스를 이 용하여 컬렉션 선택하는 모델을 TREC 문서집합과 SMART 시스템을 이용하여 구현하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.133-135
• /
• 2002

본 논문에서는 여러 가지 분산통합 검색 방법 중 학습을 이용한 분산통합 검색 시스템을 설계한다. 분산통합 검색시스템의 여러 가지 이슈 중 결과통합 문제에 주안점을 두었으며, 설계목적은 다양한 학습방법을 적용한 검색 결과 통합 실험을 위함이다. 이러한 목적을 달성하기 위하여 확장성을 고려한 모듈화를 통한 설계를 적용하여 다양한 실험과 향후 컬렉션 선택모듈, 질의변환 모들도 삽입이 가능하도록 설계하였다.

• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1329-1338
• /
• 2004

The purpose of data mining is to extract multi-dimensional information from a large database. The only information that we can extract from a large database is the column name, data type or simple comments included in the columns of database tables. With such unstructured and scarce information, it is very difficult and time taking to collect and to cleanse data by analyzing the purpose, characteristic and schema of the column during the data preparation step. In order to solve this problem, we propose solutions for reducing the time spent data preparation step in a relational database environment in this paper. That is, we propose useful elements to be considered during the data preparation step and then these elements are organized to constitute MDR(Metadata Registry) which is becoming the international standard of ISO/IEC : ll179. Finally, we propose a XML-based distributed MDR retrieval system that is convertible among heterogeneous systems and heterogeneous DBMSS.