• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.479-484
• /
• 1998

As technology in a computer hardware and software advances, efficient information retrieval from multimedia database gets highly demanded. Recently, it has been actively exploited to retrieve information based on the stored contents. However, most of the methods emphasize on the points which are far from human intuition or emotion. In order to overcome this shortcoming , this paper attempts to apply interactive genetic algorithm to content-based image retrieval. A preliminary result with subjective test shows the usefulness of this approach.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.6_2
• /
• pp.585-592
• /
• 2013

CBIR is an effective tool to search and extract image contents in a large remote sensing image database queried by an operator or end user. However, as imaging principles are different by sensors, their visual representation thus varies among image modality type. Considering images of various modalities archived in the database, image modality difference has to be tackled for the successful CBIR implementation. However, this topic has been seldom dealt with and thus still poses a practical challenge. This study suggests a cross modality CBIR (termed as the CM-CBIR) method that transforms given query feature vector by a supervised procedure in order to link between modalities. This procedure leverages the skill of analyst in training steps after which the transformed query vector is created for the use of searching in target images with different modalities. Current initial results show the potential of the proposed CM-CBIR method by delivering the image content of interest from different modality images. Despite its retrieval capability is outperformed by that of same modality CBIR (abbreviated as the SM-CBIR), the lack of retrieval performance can be compensated by employing the user's relevancy feedback, a conventional technique for retrieval enhancement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.249-268
• /
• 2014

Relevance feedback is an effective tool to bridge the gap between superficial image contents and medically-relevant sense in content-based medical image retrieval. In this paper, we propose an interactive medical image search framework based on pairwise constraint propagation. The basic idea is to obtain pairwise constraints from user feedback and propagate them to the entire image set to reconstruct the similarity matrix, and then rank medical images on this new manifold. In contrast to most of the algorithms that only concern manifold structure, the proposed method integrates pairwise constraint information in a feedback procedure and resolves the small sample size and the asymmetrical training typically in relevance feedback. We also introduce a long-term feedback strategy for our retrieval tasks. Experiments on two medical image datasets indicate the proposed approach can significantly improve the performance of medical image retrieval. The experiments also indicate that the proposed approach outperforms previous relevance feedback models.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.167-172
• /
• 2006

An image retrieval system retrieves and offers same of similar image based on various features of image. This paper present a brand image retrieval system based on color and shape of image. We use the image for a color information by dividing into the area and extracting the area color distribution histogram. We use for the shape information by preprocessing of the boundary extraction, the centroid extraction, angular sampling etc. and calculating of the sum of the distance from the centroid to the boundary, the standard deviation, and the rate of long axis to short axis. We accomplish the retrieval through a similarity measurement by using the color and shape information which is extracted in this way.

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

A knowledge-based image retrieval technique is image searching methods using some features from the queried image. The materials in this study are automobile head lamps. The input data is composed of characters and images which have various pattern. The numbers, special symbols, and general letters are under the category of the character. The image informations are made up of the distribution of pixel data, statistical analysis, and state of pattern which are useful for the knowledge data. In this paper, we implemented a retrieval system for the scientific crime detection at traffic accident using the proposed multi knowledge-based image retrieval technique. The values for the multi knowledge-based image features were extracted from color and gray scale each. With this 22 features, we improved the retrieval efficiency about the color information and pattern information. Visual basic, crystal report and MS access DB were used for this application. We anticipate the efficient scientific detection for the traffic accident and the tracking of suspicious vehicle.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.551-562
• /
• 2000

Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.1 s.307
• /
• pp.27-34
• /
• 2006

In this paper, we propose a combined region-based image retrieval system using EHD(Edge Histogram Descriptor) and CLD(Color Layout Descriptor) of MPEG-7 descriptors. The combined descriptor can efficiently describe edge and color features in terms of sub-image regions. That is, the basic unit for the selection of the region-of-interest (ROI) in the image is the sub-image block of the EHD, which corresponds to 16 (i.e., $4{\times}4)$ non-overlapping image blocks in the image space. This implies that, to have a one-to-one region correspondence between ELE and CLD, we need to take an $8{\times}8$ inverse DCT (IDCT) for the CLD. Experimental results show that the proposed retrieval scheme can be used for image retrieval with the ROI based image retrieval for MPEG-7 indexed images.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.4
• /
• pp.333-337
• /
• 2002

A content-based image retrieval method using color, texture, and shape features is proposed in this paper. A region segmentation technique using PIM(Picture Information Measure) entropy is used for similarity indexing. For segmentation, a color image is first transformed to a gray image and it is divided into n$\times$n non-overlapping blocks. Entropy using PIM is obtained from each block. Adequate variance to perform good segmentation of images in the database is obtained heuristically. As variance increases up to some bound, objects within the image can be easily segmented from the background. Therefore, variance is a good indication for adequate image segmentation. For high variance image, the image is segmented into two regions-high and low entropy regions. In high entropy region, hue-saturation-intensity and canny edge histograms are used for image similarity calculation. For image having lower variance is well represented by global texture information. Experiments show that the proposed method displayed similar images at the average of 4th rank for top-10 retrieval case.

• Journal of Broadcast Engineering
• /
• v.1 no.2
• /
• pp.96-107
• /
• 1996

In case of remote image retrieval via shared network or low speed link in order to make a decision for target image problems such as transmission delay are encountered. In this paper browsing and optimization techniques are proposed for fast retrieval of Image by the multiresolution representation and progressive transmission. The proposed network model was analyzed and evaluated for system's performance improvement. Interactive user-system using several multiresolution representation has shown better performance in transmission delay minimization over the single resolution image retrieval system.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.793-806
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps (SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. The mapping preserves the topology of the feature vectors. The map is called topological feature map. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data. and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. In topological feature map, there are empty nodes in which no image is classified. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.