Shape Based Image Retrieval using Lower Order Zernike Moments

Author(s):  
G. Sucharitha ◽  
Ranjan K. Senapati

Shape is one of the significant features of Content Based Image Retrieval (CBIR). This paper proposes a strong and successful shape feature, which is based on a set of orthogonal complex moments of images known as Zernike moments. For shape classification Zernike moment (ZM) is the dominant solution. The radial polynomial of Zernike moment produces the number of concentric circles based on the order. As the order increases number of circles will increases, due to this the local information of an image will be ignored. In this paper, we introduced a novel method for radial polynomial where local information of an image given importance. We succeeded to extract the local features and shape features at very a low order of polynomial compared to the state of traditional ZM.The proposed method gives an advantage of a lower order, less complex, and lower dimension feature vector.For more similar images we find that simple  Euclidian distance approximately zero. Proposed method tested on a MPEG-7 CE-1 shape database, Coil-100 databases. Experiments demonstrated that it is outperforming in identifying the shape of an object in the image  and reduced the retrieving time and complexity of calculations.

2019 ◽  
Vol 16 (2(SI)) ◽  
pp. 0504 ◽  
Author(s):  
Abu Bakar Et al.

Zernike Moments has been popularly used in many shape-based image retrieval studies due to its powerful shape representation. However its strength and weaknesses have not been clearly highlighted in the previous studies. Thus, its powerful shape representation could not be fully utilized. In this paper, a method to fully capture the shape representation properties of Zernike Moments is implemented and tested on a single object for binary and grey level images. The proposed method works by determining the boundary of the shape object and then resizing the object shape to the boundary of the image. Three case studies were made. Case 1 is the Zernike Moments implementation on the original shape object image. In Case 2, the centroid of the shape object image in Case 1 is relocated to the center of the image. In Case 3, the proposed method first detect the outer boundary of the shape object and then resizing the object to the boundary of the image. Experimental investigations were made by using two benchmark shape image datasets showed that the proposed method in Case 3 had demonstrated to provide the most superior image retrieval performances as compared to both the Case 1 and Case 2. As a conlusion, to fully capture the powerful shape representation properties of the Zernike moment, a shape object should be resized to the boundary of the image.


Author(s):  
Peter Marvin Müller ◽  
Niklas Kühl ◽  
Martin Siebenborn ◽  
Klaus Deckelnick ◽  
Michael Hinze ◽  
...  

AbstractWe introduce a novel method for the implementation of shape optimization for non-parameterized shapes in fluid dynamics applications, where we propose to use the shape derivative to determine deformation fields with the help of the $$p-$$ p - Laplacian for $$p > 2$$ p > 2 . This approach is closely related to the computation of steepest descent directions of the shape functional in the $$W^{1,\infty }-$$ W 1 , ∞ - topology and refers to the recent publication Deckelnick et al. (A novel $$W^{1,\infty}$$ W 1 , ∞ approach to shape optimisation with Lipschitz domains, 2021), where this idea is proposed. Our approach is demonstrated for shape optimization related to drag-minimal free floating bodies. The method is validated against existing approaches with respect to convergence of the optimization algorithm, the obtained shape, and regarding the quality of the computational grid after large deformations. Our numerical results strongly indicate that shape optimization related to the $$W^{1,\infty }$$ W 1 , ∞ -topology—though numerically more demanding—seems to be superior over the classical approaches invoking Hilbert space methods, concerning the convergence, the obtained shapes and the mesh quality after large deformations, in particular when the optimal shape features sharp corners.


Author(s):  
KEISUKE KAMEYAMA ◽  
SOO-NYOUN KIM ◽  
MICHITERU SUZUKI ◽  
KAZUO TORAICHI ◽  
TAKASHI YAMAMOTO

An improvement to the content-based image retrieval (CBIR) system for kaou images which has been developed by the authors group is introduced. Kaous are handwritten monograms found on old Japanese documents in a Chinese character-like shapes with artistic decorations. Kaous play an important role in the research of historical documents, which involve browsing and comparison of numerous samples. In this work, a novel method of kaou image modeling for CBIR is introduced, which incorporates the shade information of a closed kaou region in addition to the conventionally used contour characteristics. Dissimilarity of query and dictionary images were calculated as a weighted sum of elementary differences in the positions, contour shapes and colors of the component regions. These elementary differences were evaluated using relaxation matching and empirically defined distance functions. In the experiments, a set of 2455 kaou images were used. It was found that apparently similar kaou images could be retrieved by the proposed method, improving the retrieval quality. .


Today is a digital world. Due to the increase in imaging system, digital storage capacity and internetworking technology Content Based Retrieval of Images (CBIR) has become a vibrant research spot. The CBIR systems helps user to browse and retrieve similar kind of images from huge databases and World Wide Web. The Object based Image Retrieval (OBIR) Systems are the extension to the CBIR technique where it retrieves the similar images based on the object properties. So far massive amount of work has been done in this field of research. A plenty of the techniques and algorithms are published in the different papers. This paper provides brief survey on basic and recent approaches and techniques explained in different papers.


With an advent of technologya huge collection of digital images is formed as repositories on world wide web (WWW). The task of searching for similar images in the repository is difficult. In this paper, retrieval of similar images from www is demonstrated with the help of combination of image features as color and shape and then using Siamese neural network which is constructed to the requirement as a novel approach. Here, one-shot learning technique is used to test the Siamese Neural Network model for retrieval performance. Various experiments are conducted with both the methods and results obtained are tabulated. The performance of the system is evaluated with precision parameter and which is found to be high.Also, relative study is made with existing works.


2018 ◽  
Vol 45 (1) ◽  
pp. 117-135 ◽  
Author(s):  
Amna Sarwar ◽  
Zahid Mehmood ◽  
Tanzila Saba ◽  
Khurram Ashfaq Qazi ◽  
Ahmed Adnan ◽  
...  

The advancements in the multimedia technologies result in the growth of the image databases. To retrieve images from such image databases using visual attributes of the images is a challenging task due to the close visual appearance among the visual attributes of these images, which also introduces the issue of the semantic gap. In this article, we recommend a novel method established on the bag-of-words (BoW) model, which perform visual words integration of the local intensity order pattern (LIOP) feature and local binary pattern variance (LBPV) feature to reduce the issue of the semantic gap and enhance the performance of the content-based image retrieval (CBIR). The recommended method uses LIOP and LBPV features to build two smaller size visual vocabularies (one from each feature), which are integrated together to build a larger size of the visual vocabulary, which also contains complementary features of both descriptors. Because for efficient CBIR, the smaller size of the visual vocabulary improves the recall, while the bigger size of the visual vocabulary improves the precision or accuracy of the CBIR. The comparative analysis of the recommended method is performed on three image databases, namely, WANG-1K, WANG-1.5K and Holidays. The experimental analysis of the recommended method on these image databases proves its robust performance as compared with the recent CBIR methods.


2018 ◽  
Author(s):  
P. Sumathy ◽  
P. Shanmugavadivu ◽  
A. Vadivel

Sign in / Sign up

Export Citation Format

Share Document