• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.27-33
• /
• 2002

There are two significant drawbacks in triple image indexing; one is that is cannot support concept-based image retrieval and the other is that it fails to allow disjunctive labeling of images. To remedy the drawbacks, we propose a new technique supporting a concept-based retrieval against images indexed by indefinite fuzzy triples (I-fuzzy triples). The I-fuzzy triples allow not only a disjunctive image labeling, but also a concept-based matching against images labeled disjunctively. The disjunctive labeling is based on the expended closed world assumption and the concept-based image retrieval is based on fuzzy matching. In this paper, we also propose a concept-based query evaluation against the image database to extract desired answers with the degree of certainty $\alpha$$\in$[1,0].

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.720-732
• /
• 1996

Spatial match retrieval methods for iconic image databases recognize an image document as several icon symbols. Therefore the iconic symbols are used as primary keys to index the image document. When a user requires content-based retrieval ofimages, a spatial match retrieval method converts a query image into iconic symbols and then retrieves relevant images by accessing stored images. In order to support content-based image retrieval efficiently, we, in this paper, propose spatial match retrieval methods using signatures for iconic image databases. For this, we design new index representations of two-dimensional iconic images and explain implemented system.. In addition, we compare the conventional 9-DLT and our two-dimensional image retrieval method in terms of retrieval precision and recall ratio. We show that our method is more efficient than the conventional method.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.3
• /
• pp.103-109
• /
• 2011

With the growing popularity of digital video applications, those areas of the efficient transmit, storage management, and search technology for video data are emerging as an important core technology. To be an effective video indexing system, users need to be able to find the video segments that they want. Unfortunately, video data is difficult to manage because of its unstructured data type and large volume with linear forms. This paper proposes a shot verification using visual rhythm and video retrieval system. The shot verification is designed to detect a segment from video easily and quickly, known as shot boundaries, just by changing the visual rhythm without playing the image. Therefore, this can decrease the false detected shots and generate the unidentified shots and key frames. The retrieval system is constructed in terms of visual descriptor from the list of MPEG-7. The effectiveness of the proposed shot verification process and video retrieval system is demonstrated.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.687-694
• /
• 2003

According to the rapid increase of multimedia data quantity recently, various means of video data search has been desired. In order to process video data effectively, it is required that the content information of video data is loaded in database and semantic-based retrieval method can be available for various query of users. Currently existent contents-based video retrieval systems search by single method such as annotation-based or feature-based retrieval, and show low search efficiency and requires many efforts of system administrator or annotator form less perfect automatic processing. In this paper, we propose semantic-based video retrieval system which support semantic retrieval of various users by feature-based retrieval and annotation-based retrieval of massive video data. By user's fundamental query and selection of image for key frame that extracted from query, the agent gives the detail shape for annotation of extracted key frame. Also, key frame selected by user become query image and searches the most similar key frame through feature based retrieval method that propose. Therefore, we design the system that can heighten retrieval efficiency of video data through semantic-based retrieval.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.1-10
• /
• 2007

This paper proposes a new indexing mechanism for MPEG-7 visual descriptors, especially Dominant Color and Contour Shape descriptors, that guarantees an efficient similarity search for the multimedia database whose visual meta-data are represented with MPEG-7. Since the similarity metric used in the Dominant Color descriptor is based on Gaussian mixture model, the descriptor itself could be transform into a color histogram in which the distribution of the color values follows the Gauss distribution. Then, the transformed Dominant Color descriptor (i.e., the color histogram) is indexed in the proposed indexing mechanism. For the indexing of Contour Shape descriptor, we have used a two-pass algorithm. That is, in the first pass, since the similarity of two shapes could be roughly measured with the global parameters such as eccentricity and circularity used in Contour shape descriptor, the dissimilar image objects could be excluded with these global parameters first. Then, the similarities between the query and remaining image objects are measured with the peak parameters of Contour Shape descriptor. This two-pass approach helps to reduce the computational resources to measure the similarity of image objects using Contour Shape descriptor. This paper also proposes two integration schemes of visual descriptors for an efficient retrieval of multimedia database. The one is to use the weight of descriptor as a yardstick to determine the number of selected similar image objects with respect to that descriptor, and the other is to use the weight as the degree of importance of the descriptor in the global similarity measurement. Experimental results show that the proposed indexing and integration schemes produce a remarkable speed-up comparing to the exact similarity search, although there are some losses in the accuracy because of the approximated computation in indexing. The proposed schemes could be used to build a multimedia database represented in MPEG-7 that guarantees an efficient retrieval.

• Journal of Information Management
• /
• v.40 no.2
• /
• pp.71-94
• /
• 2009

Indexing images using traditional indexing methods like taxonomy is not always efficient because of its visual content. This study examined how to apply folksonomies to image retrieval. To do this, first, we developed a category model for image tags found in Flickr. The model includes five categories and seventeen subcategories. Second, in order to evaluate the usefulness of the model to represent the various image tags as well as to investigate the end-user tagging behavior, three researchers classified the sampled image tags(141 most popular tags, 105 tags on three individual tag clouds and 3,848 image tags assigned on 156 images) according to the model. Finally, based on the research results, we proposed three methods for efficient image retrieval: extending folksonomies by combining them with ontologies; improving image retrieval efficiency using visual content and folksonomies; and updating taxonomy using folksonomies.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.2
• /
• pp.60-70
• /
• 2000

As a result of remarkable developments in computer technology, the image retrieval system that can efficiently retrieve image data becomes a core technology of information-oriented society. In this paper, we implemented the Hierarchical Image Retrieval System for content-based image data retrieval. At the first level, to get color information, with improving the indexing method using color distribution characteristic suggested by Striker et al., i.e. the indexing method considering local color distribution characteristics, the system roughly classifies images through the improved method. At the second level, the system finally retrieves the most similar image from the image queried by the user using the shape information about the image groups classified at the first level. To extract the shape information, we use the Improved Moment Invariants(IMI) that manipulates only the pixels on the edges of objects in order to overcome two main problems of the existing Moment Invariant methods large amount of processing and rotation sensitiveness which can frequently be seen in the Directive Histogram Intersection technique suggested by Jain et al. Experiments have been conducted on 300 automobile images And we could obtain the more improved results through the comparative test with other methods.

• Journal of Broadcast Engineering
• /
• v.7 no.3
• /
• pp.262-270
• /
• 2002

Although most image indexing schemes ate based on global image features, they have limited discrimination capability because they cannot capture local variations of the image. In this paper, we propose a new region-based image retrieval system that can extract important regions in the image using salient point extraction and image segmentation techniques. Our experimental results show that color and texture information in the region provide a significantly improved retrieval performances compared to the global feature extraction methods.

• Proceedings of the Korea Database Society Conference
• /
• 1997.10a
• /
• pp.24-48
• /
• 1997

. Supported byㆍDARPA′s image Understanding (IU) program under "Video Retrieval Based on Language and image Analysis" project.DARPA′s Computer Assisted Education and Training Initiative program (CAETI)ㆍObjective: Develop practical systems for automatic understanding and indexing of video sequences using both audio and video tracks(omitted)