• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.737-747
• /
• 2019

Shape description is an important and fundamental issue in content-based image retrieval (CBIR), and a number of shape description methods have been reported in the literature. For shape description, both global information and local contour variations play important roles. In this paper a new included-angular ternary pattern (IATP) based shape descriptor is proposed for shape image retrieval. For each point on the shape contour, IATP is derived from its neighbor points, and IATP has good properties for shape description. IATP is intrinsically invariant to rotation, translation and scaling. To enhance the description capability, multiscale IATP histogram is presented to describe both local and global information of shape. Then multiscale IATP histogram is combined with included-angular histogram for efficient shape retrieval. In the matching stage, cosine distance is used to measure shape features' similarity. Image retrieval experiments are conducted on the standard MPEG-7 shape database and Swedish leaf database. And the shape image retrieval performance of the proposed method is compared with other shape descriptors using the standard evaluation method. The experimental results of shape retrieval indicate that the proposed method reaches higher precision at the same recall value compared with other description method.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.381-392
• /
• 2002

This paper deals with the problem of shape-based retrieval in time-series databases. The shape-based retrieval is defined as the operation that searches for the (sub)sequences whose shapes are similar to that of a given query sequence regardless of their actual element values. In this paper, we propose an effective and efficient approach for shape-based retrieval of subsequences. We first introduce a new similarity model for shape-based retrieval that supports various combinations of transformations such as shifting, scaling, moving average, and time warping. For efficient processing of the shape-based retrieval based on the similarity model, we also propose the indexing and query processing methods. To verify the superiority of our approach, we perform extensive experiments with the real-world S&P 500 stock data. The results reveal that our approach successfully finds all the subsequences that have the shapes similar to that of the query sequence, and also achieves significant speedup up to around 66 times compared with the sequential scan method.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.505-517
• /
• 2023

Color, texture, and shape act as important information for images in human recognition. For content-based image retrieval, many studies have combined color, texture, and shape features to improve the retrieval performance. However, there have not been many powerful methods for combining all color, texture, and shape features. This study proposes a content-based image retrieval method that uses the combined local and global features of color, texture, and shape. The color features are extracted from the color autocorrelogram; the texture features are extracted from the magnitude of a complete local binary pattern and the Gabor local correlation revealing local image characteristics; and the shape features are extracted from singular value decomposition that reflects global image characteristics. In this work, an experiment is performed to compare the proposed method with those that use our partial features and some existing techniques. The results show an average precision that is 19.60% higher than those of existing methods and 9.09% higher than those of recent ones. In conclusion, our proposed method is superior over other methods in terms of retrieval performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.6
• /
• pp.280-298
• /
• 2008

For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.29-36
• /
• 2006

In this paper, we present a leaf image retrieval system that represents and retrieves leaf images based on their shape. For more effective representation of leaf images, we improved an existing MPP algorithm. Also, in order to reduce the response time, we proposed a new dynamic matching algorithm at basically revises the Nearest Neighbor search. The system provides users with an interface for uploading query images or tools to generate queries based on shape features and retrieves images based on their similarity. For convenience, users are allowed to easily query images by sketching leaf shape or leaf arrangement on the web. In the experiment, we constructed an image database of Korean native plants and measured the system performance by counting the number of similar images retrieved for queries.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.4
• /
• pp.9-16
• /
• 2002

Content based Image retrieval methods in the multimedia information retrievals use primary visual features such as color, texture and shape. Color and texture generally are used as features of the image retrieval systems. But these systems may produce errors in similar image retrieval because two images with different shapes can represent very different contents. Therefore, the use of shape describing features is essential in an efficient content based image retrieval system. In this paper, after the global features filtering process by the boundary of objects, we have created a better shape similarity image retrieval system by a histogram of shape information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3149-3165
• /
• 2013

Content based image retrieval is increasingly gaining popularity among image repository systems as images are a big source of digital communication and information sharing. Identification of image content is done through feature extraction which is the key operation for a successful content based image retrieval system. In this paper content based image retrieval system has been developed by adopting a strategy of combining multiple features of shape, color and relevance feedback. Shape is served as a primary operation to identify images whereas color and relevance feedback have been used as supporting features to make the system more efficient and accurate. Shape features are estimated through second derivative, least square polynomial and shapes coding methods. Color is estimated through max-min mean of neighborhood intensities. A new technique has been introduced for relevance feedback without bothering the user.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3806-3825
• /
• 2016

This paper brings out a neoteric frame of reference for visual semantic based 3d video search and retrieval applications. Newfangled 3D retrieval application spotlight on shape analysis like object matching, classification and retrieval not only sticking up entirely with video retrieval. In this ambit, we delve into 3D-CBVR (Content Based Video Retrieval) concept for the first time. For this purpose we intent to hitch on BOVW and Mapreduce in 3D framework. Here, we tried to coalesce shape, color and texture for feature extraction. For this purpose, we have used combination of geometric & topological features for shape and 3D co-occurrence matrix for color and texture. After thriving extraction of local descriptors, TB-PCT (Threshold Based- Predictive Clustering Tree) algorithm is used to generate visual codebook. Further, matching is performed using soft weighting scheme with L₂ distance function. As a final step, retrieved results are ranked according to the Index value and produce results .In order to handle prodigious amount of data and Efficacious retrieval, we have incorporated HDFS in our Intellection. Using 3D video dataset, we fiture the performance of our proposed system which can pan out that the proposed work gives meticulous result and also reduce the time intricacy.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.763-765
• /
• 2005

In the area of remote sensing, an immense number of images are continuously generated by various remote sensing systems. These images must then be managed by a database system efficient storage and retrieval. There are many types of image database systems, among which the content-based image retrieval (CBIR) system is the most advanced. CBIR utilizes the metadata of images including the feature data for indexing and searching images. Therefore, the performance of image retrieval is significantly affected by the storage method of the image metadata. There are many features of images such as color, texture, and shape. We mainly consider the shape feature because shape can be identified in any remote sensing while color does not always necessarily appear in some remote sensing. In this paper, we propose a metadata representation and storage method for image search based on shape features. First, we extend MPEG-7 to describe the shape features which are not defined in the MPEG-7 standard. Second, we design a storage schema for storing images and their metadata in a relational database system. Then, we propose an efficient storage method for managing the shape feature data using a Wavelet technique. Finally, we provide the performance results of our proposed storage method.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1013-1020
• /
• 2005

This paper presents an effective and robust leaf image retrieval system based on shape feature. Specifically, we propose an improved MPP algorithm for more effective representation of leaf images and show a new dynamic matching algorithm that basically revises the Nearest Neighbor search to reduce the matching time. In particular, both leaf shape and leaf arrangement can be sketched in the query for better accuracy and efficiency. In the experiment, we compare our proposed method with other methods including Centroid Contour Distance(CCD), Fourier Descriptor, Curvature Scale Space Descriptor(CSSD), Moment Invariants, and MPP. Experimental results on one thousand leaf images show that our approach achieves a better performance than other methods.