• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.111-115
• /
• 1998

The Internet today is teemed with not only text data but also other media such as sound, still and moving images in a variety of formats. Unlike text, however, that can be retrieved easily with the help of numerous search engines, there has been few way to access data of other media unless the exact location or the URL is known. Multimedia data in the WWW are contained in or linked via anchors in the hyper-documents. They can most reliably be retrieved by analyzing the binary data content, which is far from being practical yet by the current state of the art. Instead we present another technique of searching based on textual descriptions which are found at or around the multimedia objects. The textual description used in this research includes file name (URL), anchor text and its context, alternative descriptions found in ALT HTML tage. These are actually the clues assumedly relevant to the contents. Although not without a possibility of missing or misinterpreting images and sounds, the description-based search is highly practical in terms of computation. The prototype search engine will soon be deployed to the public service through the prestige search engine, InfoDetective, in Korea.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.306-320
• /
• 2015

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.85-92
• /
• 2005

Recently, query processing techniques for the multi-dimensional data like images have been widely used to perform content-based retrieval of the data . Range query and Nearest neighbor query are widely used multi dimensional queries . This paper Proposes the efficient pruning strategies for k-nearest neighbor query in R-tree variants indexing structures. Pruning strategy is important for the multi-dimensional indexing query processing so that search space can be reduced. We analyzed the Pruning strategies and perform experiments to show overhead and the profit of the strategies. Finally, we propose best use of the strategies.

• The Journal of the Korea Contents Association
• /
• v.6 no.5
• /
• pp.20-28
• /
• 2006

This paper proposes visual-feature extraction for each band in wavelet domain with both spatial frequency features and multi resolution features, and the combination of visual features using fuzzy integral. In addition, it uses color feature expression method taking advantage of the frequency of the same color after color quantization for reducing quantization error, a disadvantage of the existing color histogram intersection method. Also, it is found that the final similarity can be represented in a linear combination of the respective factors(Homogram, color, energy) when each factor is independent one another. With respect to the combination patterns the fuzzy measurement is defined and the fuzzy integral is taken. Experiments are peformed on a database containing 1,000 color images. The proposed method gives better performance than the conventional method in both objective and subjective performance evaluation.

• 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.

• International Journal of Contents
• /
• v.3 no.3
• /
• pp.6-14
• /
• 2007

In this paper, we design and implement a XML Repository System(XRS) that exploits the advantages of DBMSs and IRSs. Our scheme uses BRS to support full text indexing and content-based queries efficiently, and ORACLE to store XML documents, multimedia data, DTD and structure information. We design databases to manage XML documents including audio, video, images as well as text. We employ the non-composition model when storing XML documents into ORACLE. We represent structured information as ETID(Element Type Id), SORD(Sibling ORDer) and SSORD(Same Sibling ORDer). ETID is a unique value assigned to each element of DTD. SORD and SSORD represent an order information between sibling nodes and an order information among the sibling nodes with the same element respectively. In order to show superiority of our XRS, we perform various experiments in terms of the document loading time, document extracting time and contents retrieval time. It is shown through experiments that our XRS outperforms the existing XML document management systems. We also show that it supports various types of queries through performance experiments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.887-890
• /
• 2000

본 연구에서는 내용기반 영상 데이터 검색을 위하여 변환 영역에서 위치 정보와 주파수 정보를 가지는 웨이블릿 성질을 이용하여 영상을 압축한 후에 저주파 성분에 의한 객체들의 특징을 추출하는 방안으로 Vector Quantization 을 이용한 class 별 영상 검색을 제시한다 내용기반 영상 검색의 주요특징들은 색상, 질감, 그리고 영상의 공간적인 특징을 고려한 특징 값 둥이 사용된다. 먼저 검색의 효율성을 높이기 위해 영상을 구성하는 특징 치 중에서 가장 빈도가 많은 class 부터 영상의 유사도를 검색한 후에 다음으로 영상을 구성하는 빈도가 큰 순서대로 DB 내에 저장되어 있는 영상과 비교를 하게 된다. DB내 영상 검색은 빈도수가 우선인 5개의 class를 기준으로 유사도를 측정해서 검색을 이룬다. 이러한 영상의 특징들을 어떻게 결합하고 특징 추출을 하느냐에 따라 검색의 효율성에 영향을 준다. 따라서 본 연구에서는 영상의 위치 정보와 주파수 정보를 가지는 웨이블릿 변환 후 얻어지는 저대역 부밴드에서의 공간적인 특성을 고려한 특징 값을 이용하여 Vector Quantization 알고리즘에 의해 정지영상의 객체 대표 특징들을 마르게 검색하고자 한다. 본 연구에서는 Haar Wavelet과 Vector Quantization 에서 색상과 질감의 가중치를 적용한 후 DB 에 저장된 영상과 유사도를 검색하는 방법을 취하고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1690-1696
• /
• 1999

Video sequence should be hierachically classified for the content-based retrieval. Cut detection algorithm is an essential process to classify shots. It is generally difficult for cut detection algorithms to detect cut points since a current frame is compared with a previous one, because movement of camera or object made adrupt scene change. We reduce ratio of failed cut detection so that compare the difference between frames of predicted cut point and their neighbors. In this paper, first we get predicted cut point, then we judge that the predicted cut point is true point or not. And we extracted DC images in MPEG video sequence for comparison. As a result of experiments. We confirmed that the cut detection ratio of the proposed algorithm is higher than of any other algorithms.

• International Journal of Contents
• /
• v.13 no.4
• /
• pp.70-79
• /
• 2017

Images are an important element in patents and many experts use images to analyze a patent or to check differences between patents. However, there is little research on image analysis for patents partly because image processing is an advanced technology and typically patent images consist of visual parts as well as of text and numbers. This study suggests two methods for using image processing; the Scale Invariant Feature Transform(SIFT) algorithm and Optical Character Recognition(OCR). The first method which works with SIFT uses image feature points. Through feature matching, it can be applied to calculate the similarity between documents containing these images. And in the second method, OCR is used to extract text from the images. By using numbers which are extracted from an image, it is possible to extract the corresponding related text within the text passages. Subsequently, document similarity can be calculated based on the extracted text. Through comparing the suggested methods and an existing method based only on text for calculating the similarity, the feasibility is achieved. Additionally, the correlation between both the similarity measures is low which shows that they capture different aspects of the patent content.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.424-428
• /
• 2004

Study related to a system that saves a n document, and to search is consisting actively and has a lot of cases to have left emphasis in the function that these systems efficiently save a XML document and can search. Also, It has a table or the storage structure which was especially designed in order to save a XML document and can save structure information of a document in addition to contents of a XML document together and can efficiently do content retrieval of a XML document or a structure search with an early base. As for this paper, a design implemented the data which the many different kinds of database that had currently used had with you so that did recycling and shared conversion and this XML file in Web, and output can become a XML format through various interrace.