• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.376-379
• /
• 2008

This paper presents an image retrieval algorithm based on feature vector using color of histogram refinement for a faster and more efficient search in the process of content based image retrieval. First, we segment each of R, G, and B images from RGB color image and extract their respective histograms. Secondly, these histograms of individual R, G and B are divided into sixteen of bins each. Finally, we extract the maximum pixel values in each bins' histogram, which are calculated, compared and analyzed, Now, we can perform image retrieval technique using these maximum pixel value. Hence, the proposed algorithm of this paper effectively extracts features by comparing input and database images, making features from R, G and B into a feature vector table, and prove a batter searching performance than the current algorithm that uses histogram matching and ranks, only.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9C
• /
• pp.930-938
• /
• 2005

We propose a content-based image retrieval(CBIR) method based on an efncient combination of a color feature and multiresolution texture features. As a color feature, a HSV autocorrelograrn is chosen which is blown to measure spatial correlation of colors well. As texture features, BDIP and BVLC moments are chosen which is hewn to measure local intensity variations well and measure local texture smoothness well, respectively. The texture features are obtained in a wavelet pyramid of the luminance component of a color image. The extracted features are combined for efficient similarity computation by the normalization depending on their dimensions and standard deviation vectors. Experimental results show that the proposed method yielded average $8\%\;and\;11\%$ better performance in precision vs. recall than the method using BDIPBVLC moments and the method using color autocorrelograrn, respectively and yielded at least $10\%$ better performance than the methods using wavelet moments, CSD, color histogram. Specially, the proposed method shows an excellent performance over the other methods in image DBs contained images of various resolutions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.203-208
• /
• 2006

The management of image information settles as an important field with the advent of multimedia age and we are in need of the effective retrieval method to manage systematically image information. This paper has complemented the problem caused by the absence of space information that is a weak point of the existing color histogram method by assigning regions of features, and raised accuracy by adding texture and shape information. And existing methods using multiple features have problems that the retrieval process is embarrassed because each weight is set up manually. So we has solved these problems by assignment of weight applying fuzzy integral. As a result of experimenting with 1,000 color images, the proposed method showed better precision and recall than the existing method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.6 no.5
• /
• pp.367-372
• /
• 2005

In this paper, we proposed a method of content-based image retrieval using variable region. Content-based image retrieval uses color histogram for the most part. But the existing color histogram methods have a disadvantage that it reduces accuracy because of quantization error and absence of spatial information. In order to overcome this, we convert color information to HSV space, quantize hue factor being pure color information, and calculate histogram of the factor. On the other hand, to solve the problem of the absence of spatial information, we select object region in consideration of color feature and region correlation. It maintains the size of region in the selected object region. But non-object region is integrated in one region. After of selection variable region, we retrieve using color feature. As the result of experimentation, the proposed method improves 10$\%$ in average of precision.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.57-64
• /
• 2002

Few studies have been systematically pursued on a multimedia data mining in despite of the overwhelming amounts of multimedia data by the development of computer capacity, storage technology and Internet. Based on the preliminary image processing and content-based image retrieval technology, this paper presents the methods for discovering association rules from recurrent items with spatial relationships in huge data repositories. Furthermore, multimedia mining algorithm is proposed to find implicit association rules among objects of which content-based descriptors such as color, texture, shape and etc. are recurrent and of which descriptors have spatial relationships. The algorithm with recurrent items in images shows high efficiency to find set of frequent items as compared to the Apriori algorithm. The multimedia association-rules algorithm is specially effective when the collection of images is homogeneous and it can be applied to many multimedia-related application fields.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.4 s.304
• /
• pp.95-102
• /
• 2005

In this paper, we propose a user friendly object-based image retrieval system using the interaction between cortex and hippocampus. Most existing ways of queries in content-based image retrieval rely on query by example or query by sketch. But these methods of queries are not adequate to needs of people's various queries because they are not easy for people to use and restrict. We propose a method of automatic color object extraction using CSB tree map(Color and Spatial based Binary をn map). Extracted objects were transformed to bit stream representing information such as color, size and location by region labelling algorithm and they are learned by the hippocampal neural network using the interplay between cortex and hippocampus. The cells of exciting at peculiar features in brain generate the special sign when people recognize some patterns. The existing neural networks treat each attribute of features evenly. Proposed hippocampal neural network makes an adaptive fast content-based image retrieval system using excitatory learning method that forwards important features to long-term memories and inhibitory teaming method that forwards unimportant features to short-term memories controlled by impression.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.49-56
• /
• 2014

This thesis proposes CBIRS/TB method that uses a tablet's color distribution information and form distinctive in content-based search. CBIRS/TB can avoid misuses and improper tablet uses by conducting content-based search in commonly prescribed tablets. The existing FE-CBIRS system is limited to recognizing only the image of color and shape of the tablet, that leads to applying insufficient form-specific information. While CBIRS/TB utilizes average, standard deviation, hue and saturation of each tablets in color, brightness, and contrast, FE-CBIRS has partial-sphere application problem; only applying the typical color of the tablet. Also, in case of the shape-specific-information, Invariant Moment is mainly used for the extracted partial-spheres. This causes delayed processing time and accuracy problems. Therefore, to improve this setback, this thesis indexed color-specific-information of the extracted images into categorized classification for improved search speed and accuracy.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.281-289
• /
• 2002

Few studies have been systematically pursued on a multimedia data mining in despite of the over-whelming amounts of multimedia data by the development of computer capacity, storage technology and Internet. Based on the preliminary image processing and content-based image retrieval technology, this paper presents the methods for discovering association rules from recurrent items with spatial relationships in huge data repositories. Furthermore, multimedia mining algorithm is proposed to find implicit association rules among objects of which content-based descriptors such as color, texture, shape and etc. are recurrent and of which descriptors have spatial relationships. The algorithm with recurrent items in images shows high efficiency to find set of frequent items as compared to the Apriori algorithm. The multimedia association-rules algorithm is specially effective when the collection of images is homogeneous and it can be applied to many multimedia-related application fields.

• The KIPS Transactions:PartB
• /
• v.13B no.1 s.104
• /
• pp.47-52
• /
• 2006

This paper proposes a method of content-based image retrieval using region feature vector in order to overcome disadvantages of existing color histogram methods. The color histogram methods have a weak point that reduces accuracy because of quantization error, and more. In order to solve this, we convert color information to HSV space and quantize hue factor being purecolor information and calculate histogram and then use thus for retrieval feature that is robust in brightness, movement, and rotation. Also we solve an insufficient part that is the most serious problem in color histogram methods by dividing an image into sixteen regions and then comparing each region. We improve accuracy by edge and DC of DCT transformation. As a result of experimenting with 1,000 color images, the proposed method has showed better precision than the existing methods.

• The KIPS Transactions:PartB
• /
• v.11B no.5
• /
• pp.581-586
• /
• 2004

In this paper, we proposed a content-based image retrieval using a color feature for central region and its optimized comparing bin method. Human's visual characteristic is influenced by existent of central object. So we supposed that object is centrally located in image and then we extract color feature at central region. When the background of image is simple, the retrieval result can be bad affected by major color of background. Our method overcome this drawback as a result of the human visual characteristic. After we transform Image into HSV color space, we extract color feature from the quantized image with 16 level. The experimental results showed that the method using the eight high rank bin is better than using the 16 bin The case which extracts the feature with image's central region was superior compare with the case which extracts the feature with the whole image about 5%.