• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.1
• /
• pp.116-125
• /
• 2002

This paper presented a method of extracting shape information from a clipart image and then measured the similarity between clipart images using the extracted shape information. The results indicated that the outlines of the extracted clipart images were clearer that those of the original images. Previous methods of extracting shape information could be classified into outline-based methods and region-based methods. Included in the former category, the proposed method expressed the convex and concave aspects of an outline using the ratio of a rectangle. Accordingly, the proposed method was superior in expressing shape information than previous outline-based feature methods.

• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.447-458
• /
• 2011

This study presents a comprehensive solution to the collection management, which is based on the model for Cultural Objects (CCO). The developed system manages and spreads the collections that are safeguarded in museums and galleries more easily by using IT. In particular, we present our approach for a non-structured search and recovery of the objects based on the annotation of artwork images. In this methodology, we have introduced a faceted search used as a framework for multi-classification and for exploring/browsing complex information bases in a guided, yet unconstrained way, through a visual interface.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.496-512
• /
• 2007

In this paper, we propose a novel JPEG-2000 compressed image retrieval system using feature vector extracted through partial entropy decoding. Main idea of the proposed method is to utilize the context information that is generated during entropy encoding/decoding. In the framework of JPEG-2000, the context of a current coefficient is determined depending on the pattern of the significance and/or the sign of its neighbors in three bit-plane coding passes and four coding modes. The contexts provide a model for estimating the probability of each symbol to be coded. And they can efficiently describe texture images which have different pattern because they represent the local property of images. In addition, our system can directly search the images in the JPEG-2000 compressed domain without full decompression. Therefore, our proposed scheme can accelerate the work of retrieving images. We create various distortion and similarity image databases using MIT VisTex texture images for simulation. we evaluate the proposed algorithm comparing with the previous ones. Through simulations, we demonstrate that our method achieves good performance in terms of the retrieval accuracy as well as the computational complexity.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.12
• /
• pp.224-231
• /
• 2013

Defining the concept of prominent audio content as the most informative audio content from the users' perspective within a given unstructured audio segment, we propose a simple but robust intensity-based attack/release pattern features to detect the prominent audio content. We also propose a web-based annotation procedure to retrieve users' subjective perception and annotated 18 hours of video clips across various genres, such as cartoon, movie, news, etc. The experiments with a linear classification method whose models are trained for speech, music, and sound effect demonstrate promising - but varying across the genres of programs - results (e.g., 86.7% weighted accuracy for speech-oriented talk shows and 49.3% weighted accuracy for {action movies}).

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.1-14
• /
• 2010

With the rapid growth of 3D content industry fields, 3D content-based hashing (or hash function) has been required to apply to authentication, trust and retrieval of 3D content. A content hash can be a random variable for compact representation of content. But 3D content-based hashing has been not researched yet, compared with 2D content-based hashing such as image and video. This paper develops a robust 3D content-based hashing based on key-dependent 3D surface feature. The proposed hashing uses the block surface coefficient using shape coordinate of 3D SSD and curvedness for 3D surface feature and generates a binary hash by a permutation key and a random key. Experimental results verified that the proposed hashing has the robustness against geometry and topology attacks and has the uniqueness of hash in each model and key.

• Journal of the Korean Society for information Management
• /
• v.37 no.2
• /
• pp.225-249
• /
• 2020

The purpose of this study is to identify and systematize various facet elements required by users in fiction search situations from book tags to improve the fiction search environment. Based on the Ranganathan's PMEST formula, the basic facet system of the fiction was defined as 1) the personality that forms the fiction material, 2) the content and external characteristics that compose the fiction, 3) the reader interaction with books, 4) spatial information related to fiction and reading activities, and 5) time information related to fiction and reading activities. Out of approximately 310,000 tags assigned to 7,174 fiction, 3,730 core tags were selected and content-analyzed. As a result, various attributes were systematized around the top 25 categories of the fiction facets. The results of this study can be applied to facet navigation of OPAC and fiction DB in the future.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.8
• /
• pp.1117-1122
• /
• 2001

Recently, issues on the internet searching of image information through various multimedia databases have drawn an tremendous attention and several researches on image information retrieval methods are on progress. By incorporating wavelet transform and correlation matrixes, we propose a novel and highly efficient feature vector extraction algorithm that has an capability of a robust similarity matching. The simulation results have yielded a faster and highly accurate candidate image retrieval performance in comparison to those of the conventional algorithms. Such an improved performance can be obtained because the used feature vectors were compressed to 256：1 while the correlation matrixes are incorporated to provide a fuel information for the better matching.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.29-34
• /
• 2000

This paper presents a new indexing technique, for the fast content-based image browsing and retrieval in a database. By applying the rosette pattern that has more sample lines in the vicinity of center than those m the outer parts, we can get global gray distribution features as well as local positional information. These features are transformed into histogram and used as database indices. From the simulation results, the proposed method clearly shows the validity and the efficiency in respect of memory space as well as a good retrieval performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.325-330
• /
• 2000

Recent progress on computer and related technology, especially including communication network, multimedia information processing and communication service technology. accelerates the entrance of information society. Especially, WWW brought the information crisis in its demand and size on the communication network, by making it easy to develop information service, like electronic (internet) news, electronic conference, multimedia information retrieval, and so on, on the internet. Due to this change, DBMS should provide efficient ways to store andmanage various types of Multimedia data and to model complex information structures. In order to satisfy these requirements, there have been man researches on architecture of multimedia DBMS, content-based retrieval for multimedia information, tertiary storage system for huge multimedia data, multimedia information modeling,

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.1
• /
• pp.33-38
• /
• 2001

In this paper, we present an image retrieval system using shape features. The preprocessing to gain shape feature includes edge extraction using chain code. The shape features consist of center of mass, standard deviation, ratio of major axis and minor axis length. The similarity is estimated as comparing the features of query image with the features of images in database. Thus, the candidates of images are retrieved according to the order of similarity. The result of an experimentation is dullness for scale, rotation and translation. We evaluate the performance of shape features for image retrieval on a database with over 170 images. The Recall and the Precision is each 0.72 and 0.83 in the result of average experiment. So the proposed method is presented useful method.