Rapid Relevance Feedback Strategy Based on Distributed CBIR System

Author(s):  
Jianxin Liao ◽  
baoran li ◽  
Jingyu Wang ◽  
Qi Qi ◽  
Tonghong Li

This article describes the capability of online data storage which has been enhanced by the emergence of cloud datacenter development. Distributed Hash Table (DHT) based image retrieval system using locality sensitive hash (LSH) has provided an efficient way to set up distributed Content Based Image Retrieval (CBIR) frameworks. However, with the fixed LSH function adopted, LSH and other codebook-based distributed retrieval systems are facing the problem of flexibility, and also are difficult to satisfy the user's demand. In this article, LRFMIR is proposed to introduce semantic search into DHT based CBIR system. LRFMIR is established on a DHT based network, where a flexible result truncating strategy is employed to fuse provided results by using multiple features measurements. Experiments show that LRFMIR provides a higher accuracy and recall rate than single feature employed retrieval systems, and possesses good load balancing and query efficiency performance.

Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1031
Author(s):  
Maryam Nasri ◽  
Herbert L. Ginn ◽  
Mehrdad Moallem

This paper presents the implementation of an agent-based architecture suitable for the coordination of power electronic converters in stand-alone microgrids. To this end, a publish-subscribe agent architecture was utilized as a distributed microgrid control platform. Over a distributed hash table (DHT) searching overlay, the publish-subscribe architecture was identified based on a numerical analysis as a scalable agent-based technology for the distributed real-time coordination of power converters in microgrids. The developed framework was set up to deploy power-sharing distributed optimization algorithms while keeping a deterministic time period of a few tens of milliseconds for a system with tens of converters and when multiple events might happen concurrently. Several agents participate in supervisory control to regulate optimum power-sharing for the converters. To test the design, a notional shipboard system, including several converters, was used as a case study. Results of implementing the agent-based publish-subscribe control system using the Java Agent Development Framework (JADE) are presented.


Author(s):  
Anca Doloc-Mihu

Navigation and interaction are essential features for an interface that is built as a help tool for analyzing large image databases. A tool for actively searching for information in large image databases is called an Image Retrieval System, or its more advanced version is called an Adaptive Image Retrieval System (AIRS). In an Adaptive Image Retrieval System (AIRS) the user-system interaction is built through an interface that allows the relevance feedback process to take place. In this chapter, the author identifies two types of users for an AIRS: a user who seeks images whom the author refers to as an end-user, and a user who designs and researches the collection and the retrieval systems whom the author refers to as a researcher-user. In this context, she describes a new interactive multiple views interface for an AIRS (Doloc-Mihu, 2007), in which each view illustrates the relationships between the images from the collection by using visual attributes (colors, shapes, proximities). With such views, the interface allows the user (both end-user and researcher-user) a more effective interaction with the system, which, further, helps during the analysis of the image collection. The author‘s qualitative evaluation of these multiple views in AIRS shows that each view has its own limitations and benefits. However, together, the views offer complementary information that helps the user in improving his or her search effectiveness.


Author(s):  
PAWAN JAIN ◽  
S. N. MERCHANT

Most of the content-based image retrieval systems require a distance computation of feature vectors for each candidate image in the image database. This exhaustive search is highly time-consuming and inefficient. This limits the usefulness of such system. Thus there is a growing need for a fast image retrieval system. Multiresolution data-structure algorithm provides a good solution to the above problem. In this paper we propose a wavelet-based multiresolution data-structure algorithm. Wavelet-based multiresolution data-structure further reduce the number of computation by around 50%. In the proposed approach we reuse the information obtained at lower resolution levels to calculate the distance at a higher resolution level. Apart from this, the proposed structure saves memory overheads by about 50% over multiresolution data-structure algorithm. The proposed algorithm can be easily combined with other algorithms for performance enhancement.4 In this paper we use the proposed technique to match luminance histogram for image retrieval. Fuzzy histograms enhances performance by considering the similarity between neighboring bins. We have extended the proposed approach to fuzzy histograms for better performance.


2018 ◽  
Vol 28 (3) ◽  
pp. 166 ◽  
Author(s):  
Methaq Talib GAATA ◽  
Fadya Fouad Hantoosh

Abstract – Content-based search provides an important tool for users to consume the ever-growing digital media repositories. However, since communication between digital products takes place in a public network, the necessity of security for digital images becomes vital. Hence, the design of secure content-based image retrieval system is becoming an increasingly demanding task as never before. This paper, presents a mechanism that addresses the secure CBIR as a novel improvement and application for the image retrieval. The proposed system consists of six phases briefly described as follows: first, feature extraction phase, which produces the low-level quantitative description of the image (color and texture) that allows the computation of similarity measures, the definition of the ordering of the images, and the indexing of the search processes. Second, indexing for search process phase, hash table and bloom filter were employed for classification. Third, feature encryption phase, where content protection is performed using a method developed by us (including Chaotic Logistic Map). Fourth,  image encryption phase, as security mechanism for CBIR, we combine two research fields in computer science, CBIR and image cryptography, which grow up to meet the trends of security and speed in current computer sciences, chaos and stream cipher systems were applied as an image encryption system. Fifth, the retrieval phase, which provides a subset of images answering the query based on the similarity between images computed over the feature vector extracted from each image. Finally, Relevance feedback phase, a technique that attempts to capture the user’s needs through iterative feedback. Although the system proved its efficiency in search performance (with 88% of average precision), security strength, and computational complexity, it does not mean the optimal system is designed, since some weakness points still can be found that are suggested to be improved as a future work.


2020 ◽  
Vol 63 (10) ◽  
pp. 1524-1536
Author(s):  
Bin Yu ◽  
Xiaofeng Li ◽  
He Zhao

Abstract The inability to scale is one of the most concerning problems looming in blockchain systems, where every node has to store all contents of the ledger database locally, leading to centralization and higher operation costs. In this paper, we propose a model named virtual block group (VBG), which aims at addressing the node storage scalability problem. Adopting the VBG model, each node only needs to store part of block data and saves the VBG storage index to distributed hash table by taking block data as a resource, thus improving the query efficiency of block data. With the incentive mechanism of block data storage, and the storage verification and audit mechanism of block data, the security and reliability of block data storage can be ensured. The analysis and calculation show that this model saves hard drive storage space of the node to a greater extent with a shorter time of requesting block data, in the premise of ensuring secure and reliable block data. Compared to other technologies such as sharding, our model does not change the consensus mechanism or the network topology and retains the reliability and security of the original blockchain system.


The development of automatic trademark image retrieval systems becomes a necessity because of the increasing number of registered trademarks in all countries. The goal is to protect the registered trademarks from counterfeiting and infringement. This paper introduces a trademark image retrieval system using indexing techniques. The proposed system is described by giving an overview about its architecture and describing in details all its components. The goal is to allow researchers and developers in image retrieval to build their own trademark retrieval system using the indexing techniques. Each part of the proposed system is considered as a component that can be improved or replaced. The reader can have a clear idea on: (1) the type of visual features to extract from the trademark images, (2) the indexing technique that can be used to organize the extracted features and speed-up the search and (3) how to perform a similar search for a new trademark image. The proposed system has been evaluated using several global features and the best performance is obtained when using Zernike moments coefficients with order 12.


Author(s):  
Shamik Sural ◽  
A. Vadivel ◽  
A.K. Majumdar

Digital image databases have seen an enormous growth over the last few years. However, since many image collections are poorly indexed or annotated, there is a great need for developing automated, content-based methods that would help users to retrieve images from these databases. In recent times, a lot of attention has been paid to the management of an overwhelming accumulation of rich digital images to support various search strategies. In order to improve the traditional text-based or SQL (Structured Query Language)- based database searches, research has been focused on efficient access to large image databases by the contents of images, such as color, shape, and texture. Content-based image retrieval (CBIR) has become an important research topic that covers a large number of domains like image processing, computer vision, very large databases, and human computer interaction (Smeulders, Worring, Santini, Gupta & Jain, 2000). Several content-based image retrieval systems and methods have recently been developed. QBIC (Query By Image Content) is one of the first image retrieval systems developed at IBM (Niblack et al., 1993). Color, texture, and shape features are combined to represent each image in this system. The VisualSeek system, developed at the Columbia University, is an image retrieval system based on visual features (Chang, Smith, Mandis & Benitez, 1997). The NeTra system is a prototype image retrieval system, which uses color, texture, shape, and spatial location information as features to retrieve similar images (Ma & Manjunath, 1997). Some of the other popular CBIR systems are MARS (Ortega et al., 1998), Blobworld (Carson, Thomas, Belongie, Hellerstein & Malik, 1999), PicToSeek (Gevers & Smeulders, 2000), and SIMPLIcity (Wang, Li & Wiederhold, 2001). An analysis of these systems reveals that all of them give a lot of importance on the image color for retrieval. In fact, color is always considered to be an important attribute, not only in content-based image retrieval systems, but also in a number of other applications like segmentation and video shot analysis. In color-based image retrieval, there are primarily two methods: one based on color layout (Smith & Chang, 1996) and the other based on color histogram (Swain & Ballard, 1991; Wang, 2001). In the color layout approach, two images are matched by their exact color distribution. This means that two images are considered close if they not only have similar color content, but also if they have similar color in approximately the same positions. In the second approach, each image is represented by its color histogram. A histogram is a vector whose components represent a count of the number of pixels having similar colors in the image. Thus, a color histogram may be considered to be a signature extracted from a complete image. Color histograms extracted from different images are indexed and stored in a database. During retrieval, the histogram of a query image is compared with the histogram of each database image using a standard distance metric like the Euclidean distance or the Manhattan distance. Since color histogram is a global feature of an image, the approaches based on color histogram are invariant to translation and rotation, and scale invariant with normalization. Color histograms may be generated using properties of the different color spaces like RGB (Red, Green, and Blue), HSV (Hue, Saturation, and Intensity Value), and others. In this article, we give an overview of the different histogram generation methods using the HSV color space. We first present a brief background of the HSV color space and its characteristics, followed by the histogram generation techniques for various applications.


Author(s):  
Mardhiyah Md Jan ◽  
Nasharuddin Zainal ◽  
Shahrizan Jamaludin

<span lang="EN-US">This paper presents a review of the region of interest-based (ROI) image retrieval techniques. In this study, the techniques, the performance evaluation parameters, and databases used in image retrieval process are being reviewed. A part of an image that is considered important or a selected certain area of the image is what defines a region of interest. Retrieval performance in large databases can be improved with the application of content-based image retrieval systems which deals with the extraction of global and region features of images. The capability of reflecting users' specific interests with greater accuracy has shown to be more effective when using region-based features compared to global features. Segmentation, feature extraction, indexing, and retrieval of an image are the tasks required in retrieving images that contain similar regions as specified in a query. The idea of the region of interest-based image retrieval concepts is presented in this paper and it is expected to accommodate researchers that are working in the region-based image retrieval system field. This paper reviews the work of image retrieval researchers in the span of twenty years. The main goal of this paper is to provide a comprehensive reference source for scholars involved in image retrieval based on ROI.</span>


Author(s):  
Kratika Arora ◽  
Ashwani Kumar Aggarwal

With an ever-increasing use and demand for digital imagery in the areas of medicine, sciences, and engineering, image retrieval is an active research area in image processing and pattern recognition. Content-based image retrieval (CBIR) is a method of finding images from a huge image database according to persons' interests. Content-based here means that the search involves analysis of the actual content present in the image. As the database of images is growing day by day, researchers/scholars are searching for better techniques for retrieval of images with good efficiency.This chapter first gives an overview of the various image retrieval systems. Then, the applications of CBIR in various fields and existing CBIR systems are described. The various image content descriptors and extraction methods are also explained. The main motive of the chapter is to study and compare the features that are used in Content Based Image Retrieval system and conclude on the system that retrieves images from a huge database with good precision and recall.


Author(s):  
Manabu Serata ◽  
◽  
Yutaka Hatakeyama ◽  
Kaoru Hirota

A concept of visual keys is proposed to provide efficient and useful content-based image retrieval systems to users. Visual keys are defined as representative sub-images which are extracted from an image database by using image feature clustering. The proposed system is implemented and is tested on 1,000 images, which are included in the COREL database. Although the system makes use of only 80 sub-images from 8,962 ones extracted from the image database, the performance is kept with 90%. The retrieval time is within 4ms on the proposed system, which has retrieval efficiency like that of text retrieval by being applied text retrieval techniques, and thus the system is expected to provide the services on the WWW.


Sign in / Sign up

Export Citation Format

Share Document