• ETRI Journal
• /
• v.24 no.1
• /
• pp.23-30
• /
• 2002

MPEG-7 Visual Standard specifies a set of descriptors that can be used to measure similarity in images or video. Among them, the Edge Histogram Descriptor describes edge distribution with a histogram based on local edge distribution in an image. Since the Edge Histogram Descriptor recommended for the MPEG-7 standard represents only local edge distribution in the image, the matching performance for image retrieval may not be satisfactory. This paper proposes the use of global and semi-local edge histograms generated directly from the local histogram bins to increase the matching performance. Then, the global, semi-global, and local histograms of images are combined to measure the image similarity and are compared with the MPEG-7 descriptor of the local-only histogram. Since we exploit the absolute location of the edge in the image as well as its global composition, the proposed matching method can retrieve semantically similar images. Experiments on MPEG-7 test images show that the proposed method yields better retrieval performance by an amount of 0.04 in ANMRR, which shows a significant difference in visual inspection.

• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.509-516
• /
• 2004

Semantic interpretation of image is incomplete without some mechanism for understanding semantic content that is not directly visible. For this reason, human assisted content-annotation through natural language is an attachment of textual description to image. However, keyword-based retrieval is in the level of syntactic pattern matching. In other words, dissimilarity computation among terms is usually done by using string matching not concept matching. In this paper, we propose a method for computerized semantic similarity calculation In WordNet space. We consider the edge, depth, link type and density as well as existence of common ancestors. Also, we have introduced method that applied similarity measurement on semantic image retrieval. To combine wi#h the low level features, we use the spatial color distribution model. When tested on a image set of Microsoft's 'Design Gallery Line', proposed method outperforms other approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7C
• /
• pp.719-725
• /
• 2003

The content-based image retrieval system extracts features of color, shape and texture from raw images, and builds the database with those features in the indexing process. The search in the whole retrieval system is defined as a process which finds images that have large similarity to query image using the feature database. This paper proposes a new two-stage search method in the content-based image retrieval system. The method is that the features are condensed and stored by the property of Cauchy-Schwartz inequality in order to reduce the similarity computation time which takes a mostly response time from entering a query to getting retrieval results. By the extensive computer simulations, we have observed that the proposed two-stage search method successfully reduces the similarity computation time while maintaining the same retrieval relevance as the conventional exhaustive search method. We also have observed that the method is more effective as the number of images and dimensions of the feature space increase.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.127-135
• /
• 2009

This paper presents a new technique for corner shape based object retrieval from a database. The proposed feature matrix consists of values obtained through a neighborhood operation of detected corners. This results in a significant small size feature matrix compared to the algorithms using color features and thus is computationally very efficient. The corners have been extracted by finding the intersections of the detected lines found using Hough transform. As the affine transformations preserve the co-linearity of points on a line and their intersection properties, the resulting corner features for image retrieval are robust to affine transformations. Furthermore, the corner features are invariant to noise. It is considered that the proposed algorithm will produce good results in combination with other algorithms in a way of incremental verification for similarity.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.2
• /
• pp.100-104
• /
• 2006

Fuzzy techniques can be applied in many domains of computer vision community. The definition of an adequate similarity measure for measuring the similarity between fuzzy sets is of great importance in the field of image processing, image retrieval and pattern recognition. This paper proposes a new class of the similarity measures. The properties, sensitivity and effectiveness of the proposed measures are investigated and tested on real data. Experimental results show that these similarity measures can provide a useful way for measuring the similarity between fuzzy sets.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.122-130
• /
• 2009

The paper presents an algorithm which uses code vectors to represent comer geometry information for searching the similar images from a database. The comers have been extracted by finding the intersections of the detected lines found using Hough transform. Taking the comer as the center coordinate, the angles of the intersecting lines are determined and are represented using code vectors. A code book has been used to code each comer geometry information and indexes to the code book are generated. For similarity measurement, the histogram of the code book indexes is used. This result in a significant small size feature matrix compared to the algorithms using color features. Experimental results show that use of code vectors is computationally efficient in similarity measurement and the comers being noise invariant produce good results in noisy environments.

• Journal of Korea Multimedia Society
• /
• v.6 no.4
• /
• pp.746-752
• /
• 2003

In this paper, we proposed an image retrieval system with a simple and effective relevance feedback, called RAP(Reward and Punishment) algorithm. First, color and texture features were extracted from the images. Next, the extracted feature values were used for image retrieval in various forms. We applied the relevance feedback to the initial retrieved images from the image retrieval system, and compared its result with that of the conventional system. In the experiment using the test image database of 16 class 512 images, the proposed system showed the better retrieval performance of about 10∼l7 % than that of the conventional INRIA system in each relevance feedback step.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.134-144
• /
• 2003

Spatial relationships among objects are one of the important ingredients for expressing constraints of an image in image or multimedia retrieval systems. In this paper, we propose a unified image retrieval scheme using spatial relationships among objects and their features. The proposed scheme is especially effective in computing similarity between query image and images in the database. Also, objects and their spatial relationships are captured and annotated in XML. It could give better precision and flexibility in retrieving images from database. Finally, we have implemented a prototype system for retrieving images based on proposed technique and showed some of the experiment results.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.1-7
• /
• 2002

In this paper, when users choose a query image, we implemented a content-based image retrieval system that users can simply choose and extract a object region of query wanted with not only a whole image but various objects in it. Histogram is obtained by improved HSV transformations from query image and then candidate images are retrieved rapidly by a 1st similarity measure with histogram intersection using representative colors of query image. And finally retrieved images are extracted since 2nd similarity measure with banded autocorrelogram is performed so that recall and precision are improved by combining two retrieval methods that can make up for respective weak points. Moreover images in the database are indexed automatically within feature library that makes possible to retrieve images rapidly.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.1-8
• /
• 2003

Various methods have been studying to maintain and apply the multimedia inform abruptly increasing over all social fields, in recent years. For retrieval of still images, we is implemented content-based image retrieval system in this paper that make possible to retrieve similar objects from image database after segmenting query object from background if user request query. Query image is processed median filtering to remove noise first and then object edge is detected it by canny edge detection. And query object is segmented from background by using convex hull. Similarity value can be obtained by means of histogram intersection with database image after securing color histogram from segmented image. Also segmented image is processed gray convert and wavelet transform to extract spacial gray distribution and texture feature. After that, Similarity value can be obtained by means of banded autocorrelogram and energy. Final similar image can be retrieved by adding upper similarity values that it make possible to not only robust in background but also better correct object retrieval by using object segmentation method.