• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.498-508
• /
• 2005

A shape data is used one oi most important feature for image retrieval as data to reflect meaning of image. Especially, structural feature of shape is widely studied because it represents primitive properties of shape and relation information between basic units well. However, most structural features of shape have the problem that it is not able to guarantee an efficient search time because the features are expressed as graph or tree. In order to solve this problem, we generate curvature-based morphological graph, End design key to cluster shapes from this graph. Proposed this graph have contour features and morphological features of a shape. Shape retrieval is accomplished by stages. We reduce a search space through clustering, and determine total similarity value through pattern matching of external curvature. Various experiments show that our approach reduces computational complexity and retrieval cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1902-1911
• /
• 1999

In this paper we present a content-based image retrieval algorithm using the visual feature vectors which describe the spatial characteristics of objects. The proposed technique uses the Gaussian mixture model(GMM) to represent multi-colored objects and the expectation maximization(EM) algorithm is employed to estimate the maximum likelihood(ML) parameters of the model. After image segmentation is performed based on GMM, the shape and color features are extracted from each object using Fourier descriptors and color histograms, respectively. Image retrieval consists of two steps: first, the shape-based query is carried out to find the candidate images whose objects have the similar shapes with the query image and second, the color-based query is followed. The experimental results show that the proposed algorithm is effective in image retrieving by using the spatial and visual features of segmented objects.

• The KIPS Transactions:PartB
• /
• v.8B no.2
• /
• pp.215-222
• /
• 2001

본 논문에서는 새로운 형태 특징값으로서 형태 correlogram을 제안하고 이를 기반으로 한 효과적인 내용기반 영삼검색(content-based image retrieval) 방법을 제시한다. 기존읜 색상 correlogram은 색상 정보에 공간적인 정보를 부여함으로써 영상검색 성능을 향상시켰다. 그러나 이 특징값은 형태 정보를 포함하고 있지 않아서 색상이 다르면서 비슷한 윤곽선 형태를 갖는 물체의 검색에는 좋은 효과를 보이지 못한다.이 문제를 해결하기 위해 예지(edge)들의 correlogram인 형태(shape) correlogram을 제안한다. 색상 correlogram이 색상들의 거리에 따른 상관관계를 나타내는데 반해 형태 correlogram은 에지 각도들의 상관관게를 나타낸다. 형태 correlogram은 gradient 축과 각도 축을 가지는 2차원 특징 벡터(feature vector)로 표현된다. 각 축은 24개 빈(bin)으로 나뉘어져서 총 576개의 원소를 가지게 된다. 또한 본 논문에서는 형태 correlogram의 데이터 크기를 줄이고, 회전에 대해 불변인 특성을 가지게 하기 위해 투영(projected) 형태 correlogram을 제안한다. 실험결과를 통하여 본 논문에서 제안한 형태 correlogram과 투영 형태 correlogram을 사용한 영상검색 방법이 기존의 방법보다 성능면에서 우수함을 입증한다.

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

• KIEE International Transaction on Systems and Control
• /
• v.12D no.1
• /
• pp.7-11
• /
• 2002

In this study, fur the shape-based image retrieval, a method using local differential invariants is proposed. This method calculates the differential invariant feature vector at every feature point extracted by Harris comer point detector. Then through vector quantization using LBG algorithm, all feature vectors are represented by a codebook index. All images are indexed by the histogram of codebook index, and by comparing the histograms the similarity between images is obtained. The proposed method is compared with the existing method by performing experiments for image database including various 1100 trademarks.

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

In recent years automatic image indexing and retrieval have been increasingly studied. However, content-based retrieval techniques for general images are still inadequate for many purposes. The novelty and originality of this thesis are the definition and use of a spatial information model as a contribution to the accuracy and efficiency of image search. In addition, the model is applied to represent color and shape image contents as a vector using the method of image features extraction, which was inspired by the previous work on the study of human visual perception. The indexing scheme using the color, shape and spatial model shows the potential of being applied with the well-developed algorithms of features extraction and image search, like ranking operations. To conclude, user can retrieved more similar images with high precision and fast speed using the proposed system.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.145-156
• /
• 2003

Most of the content-based image retrieval systems focuses on similarity-based retrieval of natural picture images by utilizing color. shape, and texture features. For the neuroscience image databases, we found that retrieving similar images based on global average features is meaningless to pathological researchers. To realize the practical content-based retrieval on images in neuroscience databases, it is essential to represent internal contents or semantics of images in detail. In this paper, we present how to represent image contents and their related concepts to support more useful retrieval on such images. We also describe the operational semantics to support these advanced retrievals by using object-oriented message path expressions. Our schemes are flexible and extensible, enabling users to incrementally add more semantics on image contents for more enhanced content searching.

• Journal of Digital Convergence
• /
• v.15 no.4
• /
• pp.267-273
• /
• 2017

With the development of various devices and communication technologies, the production and distribution of various multimedia contents are increasing exponentially. In order to retrieve multimedia data such as images and videos, an approach different from conventional text-based retrieval is needed. Color and shape are key features used in content-based image retrieval, which quantifies and analyzes various physical features of images and compares them to search for similar images. Color and shape have been used as independent features, but the two features are closely related in terms of cognition. In this paper, a method of describing the spatial distribution of color using a complex color model that projects three-dimensional color information onto two-dimensional complex form is proposed. Experimental results show that the proposed method can efficiently represent the shape of spatial distribution of colors by frequency transforming the complex image and reconstructing it with only a few coefficients in the low frequency.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.869-872
• /
• 2000

Although many content-based image retrieval systems using shape feature have tried to cover rotation-, position- and scale-invariance between images, there have been problems to cover three kinds of variance at the same time. In this paper, we introduce new approach to extract shape feature from image using MBR(Minimum Bounding Rectangle). The proposed method scans image for extracting MBR information and, based on MBR information, compute contour information that consists of 16 points. The extracted information is converted to specific values by normalization and rotation. The proposed method can cover three kinds of invariance at the same time. We implemented our method and carried out experiments. We constructed R*_tree indexing structure, perform k-nearest neighbor search from query image, and demonstrate the capability and usefulness of our method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.4
• /
• pp.363-375
• /
• 2000

In this paper we propose a content-based image retrieval method that can search large image databases efficiently by color, texture, and shape content. Quantized RGB histograms and the dominant triple (hue, saturation, and value), which are extracted from quantized HSV joint histogram in the local image region, are used for representing global/local color information in the image. Entropy and maximum entry from co-occurrence matrices are used for texture information and edge angle histogram is used for representing shape information. Relevance feedback approach, which has coupled proposed features, is used for obtaining better retrieval accuracy. Simulation results illustrate the above method provides 77.5 percent precision rate without relevance feedback and increased precision rate using relevance feedback for overall queries. We also present a new indexing method that supports fast retrieval in large image databases. Tree structures constructed by k-means algorithm, along with the idea of triangle inequality, eliminate candidate images for similarity calculation between query image and each database image. We find that the proposed method reduces calculation up to average 92.9 percent of the images from direct comparison.