Hardware Acceleration of CBIR System with FPGA-Based Platform

In content based image retrieval (CBIR) process, every image has been represented in a compact set of local visual features i.e. color, texture, and/or shape of images. This set of local visual features is known as feature vector. In the CBIR process, feature vectors of images have been used to represent or to identify similar images in adequate way. As a result, feature vector construction has always been considered as an important issue since it must reflect proper image semantics using minimal amount of data. The proposed CBIR scheme is based on the combination of color and texture features. In this work initially, we have converted the given RGB image into HSV color image. Subsequently, we have considered H (hue), S (saturation), and V (intensity) components for extraction of visual image features. The texture features have been extracted from the V component of the image using 2D dual-tree complex wavelet transform (2D DT-CWT) where it analyzes the textural patterns in six different directions i.e. ±15\(^{\circ }\), ±45\(^{\circ }\), and ±75\(^{\circ }\). At the same time, we have computed the probability histograms of H and S components of the image respectively and subsequently those are divided into non-uniform bins based on cumulative probability for extraction of color based features. So, in this work both the color and texture features have been extracted simultaneously. Finally, the obtained features have been concatenated to attain the final feature vector and same is considered in image retrieval process. We have tested the novelty and performance of the proposed work in two Corel, two objects, and, a texture image datasets. The experimental results reveal the acceptable retrieval performances for different types of datasets.

The performance and effectiveness of CBIR scheme are directly associated with construction of small dimensional as well as salient image features respectively. So, in this paper, we have carried out the image retrieval process with small dimensional salient Image components or features as compare to the original image size and the imaze retrieval accuracy has been improved due to the consideration of local information rather than global information of Image data. Initially, the Image data is exploited in block level by discrete cosine transformation (DCT) and subsequently, some significant DCT coefficients are selected from each block as salient image components. However, all the DCT coefficients are not equally important in terms of visual perception and their dimension is also not negligible even in Image retrieval process. Later, selected AC coefficients are divided into four different groups. Later, some statistical parameters are computed from each group. Each statistical value is placed at a particular matrix. So, from each group, the number of matrices constructed is equal to the number of statistical parameters evaluated and one more matrix for DC coefficients is considered. Further, for construction of small dimensional feature vectors, gray level co-occurrence matrix (GLCM) is employed on all constructed matrices to derive the feature vector for a color component. The same procedure is employed on all three components and all feature vectors are combined toaether to form the final feature vector. The proposed CBIR structure is tested on three standard Image database i.e. Corel-lK, GHIM-10K and Olivia database and the experimental results demonstrate satisfactorily image retrieval and performance outperform other state-of-art schemes in many instances with respect to their precision values.

Research in content-based image retrieval (CBIR) today is a lively discipline and expanding in breadth. Content-based image retrieval is a computer vision technique to the image retrieval problem of searching for digital images in huge databases. Weather forecasting, data mining, remote sensing, medical imaging, education, crime prevention and management of earth resources are a few domains where content-based image retrieval technique is in huge demand. To improve visual similarity search and image retrieval process in content-based image retrieval many studies have been conducted and methods developed in recent years, but there are a few issues that need to be addressed. This paper explores the current practices in content-based image retrieval and their effectiveness.

The exploding number of computational models produced by Systems Biologists over the last years is an invitation to structure and exploit this new wealth of information. Researchers would like to trace models relevant to specific scientific questions, to explore their biological content, to align and combine them, and to match them with experimental data. To automate these processes, it is essential to consider semantic annotations, which describe their biological meaning. As a prerequisite for a wide range of computational methods, we propose general and flexible similarity measures for Systems Biology models computed from semantic annotations. By using these measures and a large extensible ontology, we implement a platform that can retrieve, cluster, and align Systems Biology models and experimental data sets. At present, its major application is the search for relevant models in the BioModels Database, starting from initial models, data sets, or lists of biological concepts. Beyond similarity searches, the representation of models by semantic feature vectors may pave the way for visualisation, exploration, and statistical analysis of large collections of models and corresponding data.

This paper proposes an efficient indexing structure for CBMR (Content-Based Multimedia Retrieval), called HBI (Hierarchical Bitmap Index), in which each object is represented as a bitmap of size 2 · d · l bits, where d is the number of dimensions of object's feature vector and l is the number of bitmaps. In this bitmap representation, the feature (or attribute) value of object at each dimension is represented with a set of two bits each of which indicates whether it is relatively high ('11'), low ('00'), or neither ('01') compared to the feature values of other objects at a hierarchical organized interval. Using these compact representations of feature vectors, a lot of irrelevant objects could be quickly filtered-out by a couple of simple XOR operations, and it helps to reduce the filtering process of similarity search in high-dimensional data space. It also presents an optimization algorithm, called FQD (Filtering by Query Difference), for the similarity search with relevance feedback that reuses the previously calculated distances between the original query and all objects in the database when filtering the irrelevant objects in the successive search with modified query. It helps to further reduce the search time of CBMR with relevance feedback. Experimental results show that the similarity search using HBI is about 2 ~ 3 times faster than VA-File while guaranteeing the exact solutions, and FQD for relevance feedback helps to further reduce the elapsed time of successive similarity search compared to the one for the first search.

Using self-organizing maps to accelerate similarity search

The extraction of feature vectors of the images is the most important step in image recognition, because it allows a good description of the forms to be recognized. This step is an operation that makes it possible to convert an image into a vector of real or complex values that can serve as a signature for this image. For an accurate recognition system, the used feature vector must be invariant to the three image transformations (translation, rotation and scale), which means that, the descriptor vectors of the image and the transformed image by translation, rotation or scale must be equal. Given the importance of moments and their invariants in pattern recognition and imaging, based on Newton’s binomial and trinomial formulas and the normalized central moments, we construct in this paper four new series of moments for 2D and 3D image recognition, which are invariant to translation, scaling and rotation (TSR): the first is a set of non-orthogonal moment invariants for 2D images (2dMIs), the second is a set of orthogonal moment invariants for 2D images (2dOMIs), the third is a set of non-orthogonal moment invariants for 3D images (3dMIs) and the fourth is a set of orthogonal moment invariants for 3D images (3dOMIs). Using the proposed invariant moments (2dMIs), (2dOMIs), (3dMIs) and (3dOMIs), we construct two types of image descriptor vectors for 2D images and two types for 3D images, which are invariant to translation, rotation and scale. A series of experiments is performed to validate this new set of invariant moments and compare its performance with the existing invariants moments. The obtained results ensure the superiority of the proposed moments over all existing moments in image recognition. Experiments on processing time show that the proposed method is faster than the existing orthogonal invariant moments.

The information changes in image pixel of retrieved records is very common in image process. The image content extraction is containing many parameters to reconstruct the image again for access the information. The intensity level, edge parameters are important parameter to reconstruct the image. The filtering techniques used to retrieve the image from query images. In this research article, the adaptive function kalman filter function performs for image retrieval to get better accuracy and high reliable compared to previous existing method includes Content Based Image Retrieval (CBIR). The kalman filter is incorporated with adaptive feature extraction for transition framework in the fine tuning of kalman gain. The feature vector database analysis provides transparent to choose the images in retrieval function from query images dataset for higher retrieval rate. The virtual connection is activated once in single process for improving reliability of the practice. Besides, this research article encompasses the adaptive updating prediction function in the estimation process. Our proposed framework construct with adaptive state transition Kalman filtering technique to improve retrieval rate. Finally, we achieved 96.2% of retrieval rate in the image retrieval process. We compare the performance measure such as accuracy, reliability and computation time of the process with existing methods.

An overview is given of the various techniques and issues involved in providing indexing support for similarity searching. Similarity searching is a crucial part of retrieval in multimedia databases used for applications such as pattern recognition, image databases, and content-based retrieval. It involves finding objects in a data set S that are similar to a query object q based on some distance measure d which is usually a distance metric. The search process is usually achieved by means of nearest neighbor finding. Existing methods for handling similarity search in this setting fall into one of two classes. The first is based on mapping to a vector space. The vector space is usually of high dimension which requires special handling due to the fact indexing methods do not discriminate well in such spaces. In particular, the query regions often overlap all of the blocks that result from the decomposition of the underlying space. This has led to some special solutions that make use of a sequential scan. An alternative is to use dimension reduction to find a mapping from a high-dimensional space into a low-dimensional space by finding the most discriminating dimensions and then index the data using one of a number of different data structures such as k-d trees, R-trees, quadtrees, etc. The second directly indexes the objects based on distances making use of data structures such as the vp-tree, M-tree, etc.

Information retrieval systems are getting more attention in the era of multimedia technologies such as an image, video, audio and text files. The large numbers of images are challenges in computer systems field to store, manage data effectively and efficiently. The shape retrieval feature of different objects in the image also remains a difficult problem due to distinct angle view of different objects in a scene only; few studies have reported solution to the problem of finding relative locations of ROIs. In this paper, we proposed three methods such as1. Geolocation-based image retrieval (GLBIR), 2.Unsupervised feature technique Principal component analysis (PCA) and 3.multiple region-based image retrieval. The first proposed (GLBIR) method identifies geo location an image using visual attention based mechanism and its color layout descriptors. These features are extracted from geo-location of query image from Flickr database. Our proposed model does not fully semantic understanding of image content, uses visual metrics for example; the proximity ,color contrast, size and nearness to image's boundaries to locate viewer's attention. We analyzed results and compared with state of art CBIR Systems and GLBIR Technique. Our second method to refine images exploiting and fusing by unsupervised feature technique using principal component analysis (PCA). The visually similar images clustering together with analyses image retrieval process and remove outliers initially retrieved image set by PCA. To evaluation our proposed approach, we used thousands of images downloaded from Flickr and CIFAR-10 databases using Flickr public API. Finally, we determinately proposed a system for image retrieval based on region. It provides a user interface for availing to designate the watershed ROI within an input image. During the retrieval of images, regions' feature vectors having codes of region homogeneous to a region of input image are utilized for comparison. Standard datasets are used for evaluation of proposed approach. The experiment demonstrates and effectiveness of the proposed method to achieve higher annotation performance increases accuracy and reduces image retrieval time. We evaluated our proposed approach on images dataset from Flickr and CIFAR-10.

Multivariate variable-length sequence data are becoming ubiquitous with the technological advancement in mobile devices and sensor networks. Such data are difficult to compare, visualize, and analyze due to the nonmetric nature of data sequence similarity measures. In this paper, we propose a general manifold learning framework for arbitrary-length multivariate data sequences driven by similarity/distance (parameter) learning in both the original data sequence space and the learned manifold. Our proposed algorithm transforms the data sequences in a nonmetric data sequence space into feature vectors in a manifold that preserves the data sequence space structure. In particular, the feature vectors in the manifold representing similar data sequences remain close to one another and far from the feature points corresponding to dissimilar data sequences. To achieve this objective, we assume a semisupervised setting where we have knowledge about whether some of data sequences are similar or dissimilar, called the instance-level constraints. Using this information, one learns the similarity measure for the data sequence space and the distance measures for the manifold. Moreover, we describe an approach to handle the similarity search problem given user-defined instance level constraints in the learned manifold using a consensus voting scheme. Experimental results on both synthetic data and real tropical cyclone sequence data are presented to demonstrate the feasibility of our manifold learning framework and the robustness of performing similarity search in the learned manifold.

BackgroundAntioxidant proteins are involved in several biological processes and can protect DNA and cells from the damage of free radicals. These proteins regulate the body's oxidative stress and perform a significant role in many antioxidant-based drugs. The current invitro-based medications are costly, time-consuming, and unable to efficiently screen and identify the targeted motif of antioxidant proteins.MethodsIn this model, we proposed an accurate prediction method to discriminate antioxidant proteins namely StackedEnC-AOP. The training sequences are formulation encoded via incorporating a discrete wavelet transform (DWT) into the evolutionary matrix to decompose the PSSM-based images via two levels of DWT to form a Pseudo position-specific scoring matrix (PsePSSM-DWT) based embedded vector. Additionally, the Evolutionary difference formula and composite physiochemical properties methods are also employed to collect the structural and sequential descriptors. Then the combined vector of sequential features, evolutionary descriptors, and physiochemical properties is produced to cover the flaws of individual encoding schemes. To reduce the computational cost of the combined features vector, the optimal features are chosen using Minimum redundancy and maximum relevance (mRMR). The optimal feature vector is trained using a stacking-based ensemble meta-model.ResultsOur developed StackedEnC-AOP method reported a prediction accuracy of 98.40% and an AUC of 0.99 via training sequences. To evaluate model validation, the StackedEnC-AOP training model using an independent set achieved an accuracy of 96.92% and an AUC of 0.98.ConclusionOur proposed StackedEnC-AOP strategy performed significantly better than current computational models with a ~ 5% and ~ 3% improved accuracy via training and independent sets, respectively. The efficacy and consistency of our proposed StackedEnC-AOP make it a valuable tool for data scientists and can execute a key role in research academia and drug design.

With the rapid development of multimedia technology, video fingerprint algorithms need to satisfy robustness and search efficiency, a robust video fingerprint algorithm based on multi feature is proposed. Local color histograms of frame sub-images are used during video fingerprint coarse detection stage, if the matching result is greater than specified threshold, local descriptor SURF points are extracted and Fast-Hessian is used to detect features, feature vectors of SURF descriptors are generated by optic flow fields method during video fingerprint fine detection stage, pixel instantaneous motion speed is extracted as integral video features vector, in order to improve video copy detection speed, directional approximate nearest neighbor matching algorithm is used to match. The experimental results indicate that the proposed method improves robustness and discrimination accuracy compared with the classic local descriptor algorithm while nearly retaining the same detection time, video detection bit error rate is reduced under most kinds of attacks.

Similar image search algorithm is important technique for efficiently search the images of our interests in the large pool of image data. In this paper, we propose an interactive metric learning search system using Linear Discriminant Analysis (LDA). We rank the search result based on the Mahalanobis distance calculated from SIFT feature vectors and use a LDA which enables users to update a search result until the returned results are relevant or satisfied by users. Moreover, we also examine the efficient learning rate and dimension size of feature vector for this model to enhance the search results. The efficiency of our model is confirmed through the intensive experiment using dataset from Caltech-256 which shows that the third updated result's accuracy can be increased by more than 57% from the default result's accuracy using our method.

A novel dissimilarity measure is proposed to perform correspondence image matching for object recognition, image registration and content-based image retrieval. This is a feature-based matching, which supposes image representation (object description) in the form of a set of multi-location descriptor vectors. The proposed measure called intersection matching distance eliminates outlies (false or missing feature points) while transformation-invariantly matching two sets of descriptor vectors. A block-subdivision algorithm for time-efficient image matching is also described.