• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.305-312
• /
• 2001

Recently, high-dimensional index structures have been required for similarity search in such database applications s multimedia database and data warehousing. In this paper, we propose a new cell-based signature tree, called CS-tree, which supports efficient storage and retrieval on high-dimensional feature vectors. The proposed CS-tree partitions a high-dimensional feature space into a group of cells and represents a feature vector as its corresponding cell signature. By using cell signatures rather than real feature vectors, it is possible to reduce the height of our CS-tree, leading to efficient retrieval performance. In addition, we present a similarity search algorithm for efficiently pruning the search space based on cells. Finally, we compare the performance of our CS-tree with that of the X-tree being considered as an efficient high-dimensional index structure, in terms of insertion time, retrieval time for a k-nearest neighbor query, and storage overhead. It is shown from experimental results that our CS-tree is better on retrieval performance than the X-tree.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.113-118
• /
• 2002

This paper presents a cluster-based image retrieval method. It retrieves images from a related cluster after classifying images into clusters using RAGMD, a clustering technique. When images are retrieved, first they are retrieved not from the whole image database one by one but from the similar cluster, a similar small image group with a query image. So it gives us retrieval-time reduction, keeping almost the same precision with the exhaustive retrieval. In the experiment using an image database consisting of about 2,400 real images, it shows that the proposed method is about 18 times faster than 7he exhaustive method with almost same precision and it can retrieve more similar images which belong to the same class with a query image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.7
• /
• pp.1701-1707
• /
• 2010

This study is intended for implementing the system environment that can help integrate and retrieve various types of data in real-time by providing semantic interoperability among distributed heterogeneous information systems. The semantic interoperability is made possible by providing a TMDR(Topicmaps Metadata Registry), a set of ontologies. TMDR, which has been made by combining MDR(MetaData Registry) and TopicMaps and storing them in the database, is able to generate distributed query and provide efficient knowledge. MDR is a metadata management technique for distributed data management. TopicMaps is an ontology representation technique that takes into consideration the hierarchy and association for accessing knowledge data. We have created TMDR, a kind of ontology, that is fit for any system and able to detect and resolve semantic conflicts on the level of data and schema. With this system we propose a query-processing technique to integrate and access heterogeneous information sources. Unlike existing retrieval methods this makes possible efficient retrieval and reasoning by providing association focusing on subjects.

• Journal of Intelligence and Information Systems
• /
• v.16 no.4
• /
• pp.21-41
• /
• 2010

This paper proposes a system that can serve users with appropriate search results through real time filtering, and implemented adaptive user profiling based personalized information retrieval system(PIRS) using users' implicit feedbacks in order to deal with the problem of existing search systems such as Google or MSN that does not satisfy various user' personal search needs. One of the reasons that existing search systems hard to satisfy various user' personal needs is that it is not easy to recognize users' search intentions because of the uncertainty of search intentions. The uncertainty of search intentions means that users may want to different search results using the same query. For example, when a user inputs "java" query, the user may want to be retrieved "java" results as a computer programming language, a coffee of java, or a island of Indonesia. In other words, this uncertainty is due to ambiguity of search queries. Moreover, if the number of the used words for a query is fewer, this uncertainty will be more increased. Real-time filtering for search results returns only those results that belong to user-selected domain for a given query. Although it looks similar to a general directory search, it is different in that the search is executed for all web documents rather than sites, and each document in the search results is classified into the given domain in real time. By applying information filtering using real time directory classifying technology for search results to personalization, the number of delivering results to users is effectively decreased, and the satisfaction for the results is improved. In this paper, a user preference profile has a hierarchical structure, and consists of domains, used queries, and selected documents. Because the hierarchy structure of user preference profile can apply the context when users perfomed search, the structure is able to deal with the uncertainty of user intentions, when search is carried out, the intention may differ according to the context such as time or place for the same query. Furthermore, this structure is able to more effectively track web documents search behaviors of a user for each domain, and timely recognize the changes of user intentions. An IP address of each device was used to identify each user, and the user preference profile is continuously updated based on the observed user behaviors for search results. Also, we measured user satisfaction for search results by observing the user behaviors for the selected search result. Our proposed system automatically recognizes user preferences by using implicit feedbacks from users such as staying time on the selected search result and the exit condition from the page, and dynamically updates their preferences. Whenever search is performed by a user, our system finds the user preference profile for the given IP address, and if the file is not exist then a new user preference profile is created in the server, otherwise the file is updated with the transmitted information. If the file is not exist in the server, the system provides Google' results to users, and the reflection value is increased/decreased whenever user search. We carried out some experiments to evaluate the performance of adaptive user preference profile technique and real time filtering, and the results are satisfactory. According to our experimental results, participants are satisfied with average 4.7 documents in the top 10 search list by using adaptive user preference profile technique with real time filtering, and this result shows that our method outperforms Google's by 23.2%.

• Journal of the Korean earth science society
• /
• v.31 no.5
• /
• pp.465-474
• /
• 2010

Real-time rainfall monitoring is of great practical importance over the highly populated Indochina area, which is prone to natural disasters, in particular in association with rainfall. With the goal of d etermining near real-time half-hourlyrain estimates from satellite, the three-layer, artificial neural networks (ANN) approach was used to train the brightness temperatures at 6.7, 11, and $12-{\mu}m$ channels of the Japanese geostationary satellite MTSAT against passive microwavebased rain rates from Tropical Rainfall Measuring Mission (TRMM) Microwave Imager (TMI) and TRMM Precipitation Radar (PR) data for the June-September 2005 period. The developed model was applied to the MTSAT data for the June-September 2006 period. The results demonstrate that the developed algorithm is comparable to the PERSIANN (Precipitation Estimation from Remotely Sensed Information using Artificial Neural Networks) results and can be used for flood monitoring across the Indochina area on a half-hourly time scale.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.2
• /
• pp.51-57
• /
• 2006

This study is concerned with image information management system for small scale hospital. We intended to developing image management system which is used of the existing analog devices such as medical camera, supersonic analyser, endoscope etc. We developed a video in interface board based USB 2.0 for handling image in real time. It is capable of transmitting image input signal like as NTSC, PAL to personal computer through USB 2.0. The developed the board of 40 speeds compared with the exiting system based USB 1.0. Especially the developed system is very helpful for small hospital like as dental clinic, because it is easy and convenient to manage image information without expert. So it will provide reduction of time and cost for handling image information(collecting, saving, retrieval, transmitting image).

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

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.2 s.308
• /
• pp.1-11
• /
• 2006

In this paper, we propose the novel video retrieval algorithm using non-parametric based motion classification in the shot-based video indexing structure. The proposed system firstly gets the key frame and motion information from each shot segmented by scene change detection method, and then extracts visual features and non-parametric based motion information from them. Finally, we construct real-time retrieval system supporting similarity comparison of these spatio-temporal features. After the normalized motion vector fields is created from MPEG compressed stream, the extraction of non-parametric based motion feature is effectively achieved by discretizing each normalized motion vectors into various angle bins, and considering a mean, a variance, and a direction of these bins. We use the edge-based spatial descriptor to extract the visual feature in key frames. Experimental evidence shows that our algorithm outperforms other video retrieval methods for image indexing and retrieval. To index the feature vectors, we use R*-tree structures.

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

• ETRI Journal
• /
• v.28 no.4
• /
• pp.509-512
• /
• 2006

In a real environment, sound recordings are commonly distorted by channel and background noise, and the performance of audio identification is mainly degraded by them. Recently, Philips introduced a robust and efficient audio fingerprinting scheme applying a differential (high-pass filtering) to the frequency-time sequence of the perceptual filter-bank energies. In practice, however, the robustness of the audio fingerprinting scheme is still important in a real environment. In this letter, we introduce alternatives to the frequency-temporal filtering combination for an extension method of Philips' audio fingerprinting scheme to achieve robustness to channel and background noise under the conditions of a real situation. Our experimental results show that the proposed filtering combination improves noise robustness in audio identification.