• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.889-898
• /
• 1997

Most general content-based image retrieval techniques use color and texture as retrieval indices. Spatial information is not used to color histogram and color pair based on color retrieval techniques. This paper proposes the selection of a set of representative in the duplicated color histogram, the analysis of spatial information of the selected colors and the image retrieval process based on the duplicated color histogram and spatial information. Two color historgrams for background and object are used in order to decide on color selection in the duplicated color histogram. Spatial information is obtained using a maximum entropy discretization. A retrieval process applies to duplicated color histogram and spatial to retrieve input images and relevant images. As the result of experiment of the image retrieval, improved color his togram and spatial information method hs increased the retrieval effectiveness more the color histogram method and color pair method.

• Journal of the Korean Society for information Management
• /
• v.32 no.3
• /
• pp.277-293
• /
• 2015

This study examined the relative retrieval effectiveness after relevance feedback between two systems (Title/Abstract and Full-text) using four different sets of relevance judgment. Four relevance levels (not relevant, marginally relevant, relevant, highly relevant) are also used, each of which is determined by referees giving a relevance score to documents. This study also investigated how much the average precision was improved after relevance feedback when "marginally relevant" documents are included in the relevant class with the Title/Abstract system, and with the Full-text retrieval system as well. It is found that the Title/Abstract system benefited from relevance feedback with the marginally relevant documents. In case of the Title/Abstract system, the higher percentage of improvement was consistently obtained when including the marginally relevant documents in the relevance class, however the result was vice versa in case of the Full-text retrieval system. It implied that the marginally relevant documents in the relevant class had caused noises in the Full-text retrieval system.

• Journal of Internet Computing and Services
• /
• v.2 no.1
• /
• pp.49-61
• /
• 2001

Internet has been becoming widely popular and making rapid progress and network technologies is showing extension in data transmission speeds. Rapid and convenient multimedia services supplied with high quality and high speed are being needed, This paper treats of the design and implement method of clip-based video retrieval system on the world-wide-web environments. The implemented system consists of the content-based indexing system supporting convenient services for video contents providers and the web-based retrieval system in order to make it easy and various information retrieval for users on the world-wide-web. Three important methods were used in the content-based indexing system. Key frame extracting method by dividing video data, clip file creation method by clustering related information and video database build method by using clip unit, In web-based retrieval system, retrieval method by using a key word, two dimension browsing method of key frame and real-time display method of the clip were used. As a result. the proposed methodologies showed a usefulness of video content providing. and provided an easy method for searching intented video content.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2612-2633
• /
• 2020

Due to the explosive growth of multimedia speech data, how to protect the privacy of speech data and how to efficiently retrieve speech data have become a hot spot for researchers in recent years. In this paper, we proposed an encrypted speech retrieval scheme based on long short-term memory (LSTM) neural network and deep hashing. This scheme not only achieves efficient retrieval of massive speech in cloud environment, but also effectively avoids the risk of sensitive information leakage. Firstly, a novel speech encryption algorithm based on 4D quadratic autonomous hyperchaotic system is proposed to realize the privacy and security of speech data in the cloud. Secondly, the integrated LSTM network model and deep hashing algorithm are used to extract high-level features of speech data. It is used to solve the high dimensional and temporality problems of speech data, and increase the retrieval efficiency and retrieval accuracy of the proposed scheme. Finally, the normalized Hamming distance algorithm is used to achieve matching. Compared with the existing algorithms, the proposed scheme has good discrimination and robustness and it has high recall, precision and retrieval efficiency under various content preserving operations. Meanwhile, the proposed speech encryption algorithm has high key space and can effectively resist exhaustive attacks.

• Journal of Information Science Theory and Practice
• /
• v.1 no.3
• /
• pp.12-32
• /
• 2013

The paper introduces the research area of interactive information retrieval (IIR) from a historical point of view. Further, the focus here is on evaluation, because much research in IR deals with IR evaluation methodology due to the core research interest in IR performance, system interaction and satisfaction with retrieved information. In order to position IIR evaluation, the Cranfield model and the series of tests that led to the Cranfield model are outlined. Three iconic user-oriented studies and projects that all have contributed to how IIR is perceived and understood today are presented: The MEDLARS test, the Book House fiction retrieval system, and the OKAPI project. On this basis the call for alternative IIR evaluation approaches motivated by the three revolutions (the cognitive, the relevance, and the interactive revolutions) put forward by Robertson & Hancock-Beaulieu (1992) is presented. As a response to this call the 'IIR evaluation model' by Borlund (e.g., 2003a) is introduced. The objective of the IIR evaluation model is to facilitate IIR evaluation as close as possible to actual information searching and IR processes, though still in a relatively controlled evaluation environment, in which the test instrument of a simulated work task situation plays a central part.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.3
• /
• pp.30-38
• /
• 2016

Shuttle-Based Storage/Retrieval System (SBS/RS) is relatively new to industry. The system is in the category of Automated Storage/Retrieval System (AS/RS), but it is different in that the SBS/RS uses shuttles as Storage/Retrieval (SR) machine instead using a stacker crane. The shuttles are assigned to each tier on multi-tier system and operated for pick-up or drop-off order. Since the system can handle multiple orders simultaneously, it can provide much higher throughput than that of general AS/RS with single stocker crane. Thus, this new system is well fit to recent tendency of increasing small quantity batch production and orders. One of the drawback of this system is that it needs a lot of investment to set up. The efficient operation of the system would be one of the critical matters to increase economic efficiency of capital investment. In this study, we focused on the dwell point policy for shuttles to find efficient way of operating the system. There are four basic policies for the dwell point and we had simulation-based experiment for two different scenarios based on the speed of the shuttle and inter-arrival time of the loads coming to the system combined with four different policies. As it was mentioned above, this SBS/RS relatively new to the field and there is no such experiment shown on previous research and the study of dwell point policy for this SBS/RS could provide the direct comparison of each policy with different hardware specification; the capability of the system. The policy that achieves most efficient operation among the given environment is proposed and the usability of the system is discussed.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.763-765
• /
• 2005

In the area of remote sensing, an immense number of images are continuously generated by various remote sensing systems. These images must then be managed by a database system efficient storage and retrieval. There are many types of image database systems, among which the content-based image retrieval (CBIR) system is the most advanced. CBIR utilizes the metadata of images including the feature data for indexing and searching images. Therefore, the performance of image retrieval is significantly affected by the storage method of the image metadata. There are many features of images such as color, texture, and shape. We mainly consider the shape feature because shape can be identified in any remote sensing while color does not always necessarily appear in some remote sensing. In this paper, we propose a metadata representation and storage method for image search based on shape features. First, we extend MPEG-7 to describe the shape features which are not defined in the MPEG-7 standard. Second, we design a storage schema for storing images and their metadata in a relational database system. Then, we propose an efficient storage method for managing the shape feature data using a Wavelet technique. Finally, we provide the performance results of our proposed storage method.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.29-36
• /
• 2006

In this paper, we present a leaf image retrieval system that represents and retrieves leaf images based on their shape. For more effective representation of leaf images, we improved an existing MPP algorithm. Also, in order to reduce the response time, we proposed a new dynamic matching algorithm at basically revises the Nearest Neighbor search. The system provides users with an interface for uploading query images or tools to generate queries based on shape features and retrieves images based on their similarity. For convenience, users are allowed to easily query images by sketching leaf shape or leaf arrangement on the web. In the experiment, we constructed an image database of Korean native plants and measured the system performance by counting the number of similar images retrieved for queries.

• Journal of Korea Multimedia Society
• /
• v.1 no.2
• /
• pp.162-172
• /
• 1998

In this paper, we implement a gigabyte Hangul text retrieval engine HMG(Hangul MG) which is based on the English text retrieval engine MG(Managing Gigabytes) and the Hangul lexical analyzer HAM(Hangul Analysis Module). To support Hangul information, we use the KSC 5601 code in the database construction and query processing stages. The lexical analyzer, parser, and index construction module of the MG system are modified to support Hangul information. To show the usefulness of HMG system, we implemented a NOD(Novel On Demand) system supporting the retrieval of Hangul novels on the WWW. The proposed system HMG can be utilized in the construction of massive full-text information retrieval systems supporting Hangul.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.1103-1111
• /
• 2003

Information retrieval system with indexing system matching single keyword is simple and popular. But with single keyword matching it is very hard to represent the exact meaning of documents and the set of documents from retrieval is very large, therefore it can't satisfy the user of the information retrieval systems. This paper proposes a phrase-based indexing system based on the phrase, the larger syntax unit than a single keyword. Web documents include lots of syntactic errors, the natural language parser with high Quality cannot be expected in Web. Partial trees, even not a full tree, from fully bottom-up parsing is still useful for extracting phrases, and they are much more discriminative than single keyword for index. It helps the information retrieval system enhance the efficiency and reduce the processing overhead.