scholarly journals Generation of Visual Patterns from BoVW for Image Retrieval using modified Similarity Score Fusion

2020 ◽  
Vol 20 (2) ◽  
pp. 101-112 ◽  
Author(s):  
P. ARULMOZHI ◽  
M. ABIRAMI
2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
D. Chandrakala ◽  
S. Sumathi

With the advancement in image capturing device, the image data is being generated in high volumes. The challenging and important problem in image mining is to reveal useful information by grouping the images into meaningful categories. Image retrieval is extensively required in recent decades because CBIR is regarded as one of the most effective ways of accessing visual data. Conventionally, the way of searching the collections of digital image database is by matching keywords with image caption, descriptions and labels. Keyword based searching method provides very high computational complexity and user has to remember the exact keywords used in the image database. Instead, our paper proposes image retrieval system with Artificial Bee Colony optimization algorithm by fusing similarity score based on color and texture features of an image thereby achieving very high classification accuracy and minimum retrieval time. In this scheme, the color is described by color histogram method in HSV space and texture represented by contrast, energy, entropy, correlation and local stationary over the region in an image. The proposed Comprehensive Image Retrieval scheme fuses the color and texture feature based similarity score between query and all the database images. The experimental results show that the proposed method is superior to keywords based retrieval and content based retrieval schemes with individual low-level features of image.


2021 ◽  
Author(s):  
Zihao Liu ◽  
Xiaoyu Wu ◽  
Jiayao Qian ◽  
Zhiyi Zhu

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Nouman Qadeer ◽  
Dongting Hu ◽  
Xiabi Liu ◽  
Shahzad Anwar ◽  
Malik Saad Sultan

In computer vision, image retrieval remained a significant problem and recent resurgent of image retrieval also relies on other postprocessing methods to improve the accuracy instead of solely relying on good feature representation. Our method addressed the shape retrieval of binary images. This paper proposes a new integration scheme to best utilize feature representation along with contextual information. For feature representation we used articulation invariant representation; dynamic programming is then utilized for better shape matching followed by manifold learning based postprocessing modified mutualkNN graph to further improve the similarity score. We conducted extensive experiments on widely used MPEG-7 database of shape images by so-called bulls-eye score with and without normalization of modified mutualkNN graph which clearly indicates the importance of normalization. Finally, our method demonstrated better results compared to other methods. We also computed the computational time with another graph transduction method which clearly shows that our method is computationally very fast. Furthermore, to show consistency of postprocessing method, we also performed experiments on challenging ORL and YALE face datasets and improved baseline results.


Author(s):  
Gerald Schaefer

Image retrieval and image compression have been typically pursued separately. Only little research has been done on a synthesis of the two by allowing image retrieval to be performed directly in the compressed domain of images without the need to uncompress them first. In this chapter the authors show that such compressed domain image retrieval can indeed be done and lead to effective and efficient retrieval performance. They introduce a novel compression algorithm – colour visual pattern image coding (CVPIC) – and present several retrieval algorithms that operate directly on compressed CVPIC data. Their experiments demonstrate that it is not only possible to realise such midstream content access, but also that the presented techniques outperform standard retrieval techniques such as colour histograms and colour correlograms.


Mathematics ◽  
2020 ◽  
Vol 8 (6) ◽  
pp. 1019
Author(s):  
Wentao Ma ◽  
Jiaohua Qin ◽  
Xuyu Xiang ◽  
Yun Tan ◽  
Zhibin He

Recently, searchable encrypted image retrieval in a cloud environment has been widely studied. However, the inappropriate encryption mechanism and single feature description make it hard to achieve the expected effects. Therefore, a major challenge of encrypted image retrieval is how to extract and fuse multiple efficient features to improve performance. Towards this end, this paper proposes a searchable encrypted image retrieval based on multi-feature adaptive late-fusion in a cloud environment. Firstly, the image encryption is completed by designing the encryption function in an RGB color channel, bit plane and pixel position of the image. Secondly, the encrypted images are uploaded to the cloud server and the convolutional neural network (CNN) is fine-tuned to build a semantic feature extractor. Then, low-level features and semantic features are extracted. Finally, the similarity score curves of each feature are calculated, and adaptive late-fusion is performed by the area under the curve. A large number of experiments on public dateset are used to validate the effectiveness of our method.


1974 ◽  
Vol 19 (9) ◽  
pp. 645-646
Author(s):  
JAMES F. Juola
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document