• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.145-152
• /
• 2002

As the number of digital images available to users is exponentially growing due to the rapid development of digital technology, content-based image retrieval (CBIR) has been one of the most active research areas. A variety of image retrieval methods have been proposed, where, given an input query image, the images that are similar to the input are retrieved from an image database based on low-level features such as colors and textures. However, most of the existing retrieval methods did not consider the case when an input query image is a part of a whole image in the database due to the high complexity involved in partial matching. In this paper, we present an efficient method for partial image matching by using the histogram distribution relationships between query image and whole image. The proposed approach consists of two steps: the first step prunes the search space and the second step performs block-based retrieval using partial image matching to rank images in candidate set. The experimental results demonstrate the feasibility of the proposed algorithm after assuming that the response tune of the system is very high while retrieving only by using partial image matching without Pruning the search space.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.990-999
• /
• 2007

In this paper, we propose the region-based image retrieval method using JSEG which is a method for unsupervised segmentation of color-texture regions. JSEG is an algorithm that discretizes an image by color classification, makes the J-image by applying a region to window mask, and then segments the image by using a region growing and merging. The segmented image from JSEG is given to a user as the query image, and a user can select a few segmented regions as the query region. After finding the MBR of regions selected by user query and generating the multiple window masks based on the center point of MBR, we extract the feature vectors from selected regions. We use the accumulated histogram as the global descriptor for performance comparison of extracted feature vectors in each method. Our approach fast and accurately supplies the relevant images for the given query, as the feature vectors extracted from specific regions and global regions are simultaneously applied to image retrieval. Experimental evidence suggests that our algorithm outperforms the recent image-based methods for image indexing and retrieval.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.309-314
• /
• 2006

Recently, multimedia DBMS is appeared to be the core technology of the information society to store, manage and retrieve multimedia data efficiently. In this paper, we propose a new method for content based-retrieval system using wavelet transform, energy value to extract automatically feature vector from image data, and suggest an effective retrieval technique through this method. Wavelet transform is widely used in image compression and digital signal analysis, and its coefficient values reflect image feature very well. The correlation in wavelet domain between query image data and the stored data in database is used to calculate similarity. In order to assess the image retrieval performance, a set of hundreds images are run. The method using standard derivation and mean value used for feature vector extraction are compared with that of our method based on energy value. For the simulation results, our energy value method was more effective than the one using standard derivation and mean value.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.906-915
• /
• 2005

In this paper we propose content based image retrieval method using sequential clustering and projection information. Proposed method uses the mean of color in clustered color regions by sequential clustering and the projection information in each clustered color regions, which combines spatial information with color information in images efficiently. The experimental results showed that the proposed method retrieval efficiency improved 11.6 percent over conventional methods. In addition, the proposed method robustly tolerates large changes in appearance and shape caused by changes in viewing positions, camera zooms, etc.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.993-1014
• /
• 2021

This paper proposes a new image retrieval method called the 3D integrated multi-index to fuse SIFT (Scale Invariant Feature Transform) visual words with other features at the indexing level. The advantage of the 3D integrated multi-index is that it can produce finer subdivisions in the search space. Compared with the inverted indices of medium-sized codebook, the proposed method increases time slightly in preprocessing and querying. Particularly, the SIFT, contour and colour features are fused into the integrated multi-index, and the joint cooperation of complementary features significantly reduces the impact of false positive matches, so that effective image retrieval can be achieved. Extensive experiments on five benchmark datasets show that the 3D integrated multi-index significantly improves the retrieval accuracy. While compared with other methods, it requires an acceptable memory usage and query time. Importantly, we show that the 3D integrated multi-index is well complementary to many prior techniques, which make our method compared favorably with the state-of-the-arts.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.9 no.11
• /
• pp.1133-1144
• /
• 2019

Recently, the amount of image on the Internet has rapidly increased, due to the advancement of smart devices and various approaches to effective image retrieval have been researched under these situation. Existing image retrieval methods simply detect the objects in a image and carry out image retrieval based on the label of each object. Therefore, the semantic gap occurs between the image desired by a user and the image obtained from the retrieval result. To reduce the semantic gap in image retrievals, we connect the module for multiple objects classification based on deep learning with the module for human behavior classification. And we combine the connected modules with a behavior ontology. That is to say, we propose an image retrieval system considering the relationship between objects by using the combination of deep learning and behavior ontology. We analyzed the experiment results using walking and running data to take into account dynamic behaviors in images. The proposed method can be extended to the study of automatic annotation generation of images that can improve the accuracy of image retrieval results.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.3 no.1
• /
• pp.8-18
• /
• 2008

In this paper, we propose an efficient algorithm using wavelet transform for still image database retrieval. Especially, it uses only the lowest frequency sub-band in multi-level wavelet transform so that a retrieval system uses a smaller quantity of memory and takes a faster processing time. We extract different textured features, statistical information such as mean, variance and histogram, from low frequency sub-band. Then we measure the distances between the query image and the images in a database in terms of these features. To obtain good retrieval performance, we use the first feature (mean and variance of wavelet coefficients) to filter out most of the unlikely images. The rest of the images are considered to be candidate images. Then we apply the second feature (histogram of wavelet coefficient) to rank all the candidate images. To evaluate the algorithm, we create various distorted image databases using MIT VisTex texture images and PICS natural images. Through simulations, we demonstrate that our method can achieve performance satisfactorily in terms of the retrieval accuracy as well as the both memory requirement and computational complexity. Therefore it is expected to provide good retrieval solution for JPEG-2000 using wavelet transform.

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

Content-based image retrieval(CBIR) is an image data retrieval methodology using characteristic values of image data those are generated by system automatically without any caption or text information. In this paper, we propose a content-based image data retrieval method using shape and color features of image data as characteristic values. For this, we present some image processing techniques used for feature extraction and indexing techniques based on trie and R tree for fast image data retrieval. In our approach, image query result is more reliable because both shape and color features are considered. Also, we how an image database which implemented according to our approaches and sample retrieval results which are selected by our system from 200 sample images, and an analysis about the result by considering the effect of characteristic values of shape and color.

• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.2
• /
• pp.9-15
• /
• 2000

In this paper, we proposed a content-based image retrieval method using color and object's complexity for indexing of image database. Generally, the retrieval methods using color feature can not sufficiently include the spatial information in the image. So they are reduced retrieval efficiency. Then we combined object's complexity which extracted from chain code and the conventional color feature. As a result, experiments shooed that the proposed method which considers the shape feature improved performance in conducting content-based search.

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