Average Normalized Modified Retrieval Rank Research Articles

Remote Sensing Image Retrieval Based on 3D-Local Ternary Pattern (LTP) Features and Non-subsampled Shearlet Transform (NSST) Domain Statistical Features

With the increasing popularity of high-resolution remote sensing images, the remote sensing image retrieval (RSIR) has always been a topic of major issue. A combined, global non-subsampled shearlet transform (NSST)-domain statistical features (NSSTds) and local three dimensional local ternary pattern (3D-LTP) features, is proposed for high-resolution remote sensing images. We model the NSST image coefficients of detail subbands using 2-state laplacian mixture (LM) distribution and its three parameters are estimated using Expectation-Maximization (EM) algorithm. We also calculate the statistical parameters such as subband kurtosis and skewness from detail subbands along with mean and standard deviation calculated from approximation subband, and concatenate all of them with the 2-state LM parameters to describe the global features of the image. The various properties of NSST such as multiscale, localization and flexible directional sensitivity make it a suitable choice to provide an effective approximation of an image. In order to extract the dense local features, a new 3D-LTP is proposed where dimension reduction is performed via selection of ‘uniform’ patterns. The 3D-LTP is calculated from spatial RGB planes of the input image. The proposed inter-channel 3D-LTP not only exploits the local texture information but the color information is captured too. Finally, a fused feature representation (NSSTds-3DLTP) is proposed using new global (NSSTds) and local (3D-LTP) features to enhance the discriminativeness of features. The retrieval performance of proposed NSSTds-3DLTP features are tested on three challenging remote sensing image datasets such as WHU-RS19, Aerial Image Dataset (AID) and PatternNet in terms of mean average precision (MAP), average normalized modified retrieval rank (ANMRR) and precision-recall (P-R) graph. The experimental results are encouraging and the NSSTds-3DLTP features leads to superior retrieval performance compared to many well known existing descriptors such as Gabor RGB, Granulometry, local binary pattern (LBP), Fisher vector (FV), vector of locally aggregated descriptors (VLAD) and median robust extended local binary pattern (MRELBP). For WHU-RS19 dataset, in terms of {MAP,ANMRR}, the NSSTds-3DLTP improves upon Gabor RGB, Granulometry, LBP, FV, VLAD and MRELBP descriptors by {41.93%,20.87%}, {92.30%,32.68%}, {86.14%,31.97%}, {18.18%,15.22%}, {8.96%,19.60%} and {15.60%,13.26%}, respectively. For AID, in terms of {MAP,ANMRR}, the NSSTds-3DLTP improves upon Gabor RGB, Granulometry, LBP, FV, VLAD and MRELBP descriptors by {152.60%,22.06%}, {226.65%,25.08%}, {185.03%,23.33%}, {80.06%,12.16%}, {50.58%,10.49%} and {62.34%,3.24%}, respectively. For PatternNet, the NSSTds-3DLTP respectively improves upon Gabor RGB, Granulometry, LBP, FV, VLAD and MRELBP descriptors by {32.79%, 10.34%}, {141.30%, 24.72%}, {17.47%,10.34%}, {83.20%,19.07%}, {21.56%,3.60%}, and {19.30%,0.48%} in terms of {MAP,ANMRR}. The moderate dimensionality of simple NSSTds-3DLTP allows the system to run in real-time.

Content-based image retrieval using feature-fusion of GroupNormalized-Inception-Darknet-53 features and handcraft features

This paper proposed an efficient image retrieval framework by feature-fusion of high-level features from the improved version of DarkNet-53, named GroupNormalized-Inception-Darknet-53 (GN-Inception-Darknet-53), and handcraft features extracted from both RGB and HSI color models. To extract the more detailed features of an image, we augmented one inception layer, which includes 1 × 1, 3 × 3, and 5 × 5 kernels in place of an existing 3 × 3 kernel. To make the normalization process of the proposed model less dependent on batch size, Group Normalization (GN) layer is used instead of Batch Normalization (BN). A modified version of dot-diffused block truncation coding (DDBTC) is used to extract handcraft features in RGB color space. For HSI color space, interchannel voting between hue, saturation, and intensity components is used as color feature. To extract shape features histogram of orientated gradient (HOG) is applied on RGB color space. To evaluate the efficiency of our proposed method, Average Precision Rate (APR), Average Recall Rate (ARR), F-Measure, Average Normalized Modified Retrieval Rank (ANMRR), and Total Minimum Retrieval Epoch (TMRE) are calculated for Corel-1 K, Corel-5 K, Corel-10 K, VisTex, Stex & Color Brodatz datasets. In all datasets, the proposed method shows the best results for all the instances with a minimum average improvement of 7.02%.

Image Retrieval by Integrating Global Correlation of Color and Intensity Histograms with Local Texture Features

Research on Content-Based Image Retrieval is being done to improvise existing methods. Most of the techniques that were proposed use color and texture features independently. In this paper, to get the correspondence between color and texture, we use congruence on Hue, Saturation, and Intensity by using inter-channel voting. Gray Level Co-occurrence Matrix (GLCM) on Diagonally Symmetric Pattern is computed to get texture features of an image. The similarity metrics between two images is computed using congruence and GLCM. To measure the performance; Average Precision Rate (APR), Average Recall Rate (ARR), F-measure, Average Normalized Modified Retrieval Rank (ANMRR) are calculated. In addition to these parameters, one more parameter has been proposed: Total Minimum Retrieval Epoch (TMRE) to calculate the average number of images to be traversed for each query image to get all the images of that category. To validate the performance of the proposed method, it has been applied to six image databases: Corel-1 K, Corel-5 K, Corel-10 K, VisTex, STex, and Color Brodatz. The results of most of the databases show significant improvement.

An Efficient Retrieval Technique for Trademarks Based on the Fuzzy Inference System

The existing trademark image retrieval (TIR) approaches mostly use complex image features, the integration of multi features, a tree structure, etc. to enable highly accurate retrieval. However, there is the heavy computational burden for complex image features and maximum similarity subtree isomorphism (MSSI) measurement. This paper aims to provide an efficient solution for TIR in real-time applications, especially in measuring the similarity between multi-object trademark images. In particular, we propose a novel algorithm for tree similarity measurement based on the fuzzy inference system (FIS) to improve retrieval efficiency. Furthermore, the integration of global and local geometric descriptors is used to enable accurate retrieval. The global descriptor is computed by employing the Hu moments, while the local descriptors are generated by using a tree structure based on the five geometric features: convexity, eccentricity, compactness, circle variance, and elliptic variance. During the retrieval process, the similarity coefficient between the query and the database image is obtained from the similarity of the global and local descriptors. The proposed technique is evaluated using 1800 trademark images, including 12 different classes and 416 trademark images. Additionally, the three common indices, the precision/recall rate, the Bull’s eye score, and the average normalized modified retrieval rank (ANMRR) are used as the performance indices. The experimental results show that the proposed technique is superior to the other two competitive approaches. It shows 19.43% and 26.78% precision/recall improvement, 19.56% and 30.58% improvement in the average Bull’s eye score, and 0.167 and 0.236 improvement in the ANMRR score, respectively, for the 416 query images. It can be concluded from the experimental analysis that the proposed technique not only provides reliable retrieval results but also improves the retrieval efficiency by 151 times in the retrieval process.

Improving Performance of Image Retrieval Based on Fuzzy Colour Histograms by Using Hybrid Colour Model and Genetic Algorithm

A hybrid colour model is a colour descriptor formed by combining channels from several different colour models. Although rarely used in computer graphics applications due to redundancy, hybrid colour models may be of interest for the Content-Based Image Retrieval (CBIR). Best features of each colour model can be combined to obtain optimal retrieval performance. This paper evaluates several approaches to the construction of a hybrid colour model that is used to construct a fuzzy colour histogram of image as a compact feature for retrieval. By evaluating each channel separately, a colour model named HSY is proposed. Various parameters of fuzzy histogram are further improved using Genetic algorithm (GA). Using standard data sets and the Average Normalized Modified Retrieval Rank (ANMRR) as a metric for retrieval performance, it is shown that this novel approach can give an improved retrieval performance.

Mean Normalized Retrieval Order (MNRO): a new content-based image retrieval performance measure

The results of a content based image retrieval system can be evaluated by several performance measures, each one employing different evaluation criteria. Many of the methods used in the field of information retrieval have been adopted for use in image retrieval systems. This paper reviews the most widely used performance measures for retrieval evaluation with particular emphasis on the assumptions made during their design. More specifically, it focuses on the design principles of the commonly used Mean Average Precision (MAP) and Average Normalized Modified Retrieval Rank (ANMRR), pinpointing their limitations. It also proposes a new performance measure for image retrieval systems, the Mean Normalized Retrieval Order (MNRO), whose effectiveness is demonstrated through a wide range of experiments. Initial experiments were conducted on artificially produced query trials and evaluations. Experiments on a large database demonstrate the ability of MNRO to take into account the generality of the queries during the retrieval procedure. Furthermore, the results of a case study show that the proposed performance measure is closer to human evaluations, in comparison to MAP and ANMRR. Lastly, in order to encourage researchers and practitioners to use the proposed performance measure, we present the experimental results produced by a large number of state of the art descriptors applied on three well-known benchmarking databases.

An Automatic Recommendation Scheme of TV Program Contents for (IP)TV Personalization

Due to the rapid increase of contents available under the convergence of broadcasting and Internet, efficient access to personally preferred contents has become an important issue. In this paper, an automatic recommendation scheme based on collaborative filtering is presented for intelligent personalization of (IP)TV services. The proposed scheme does not require TV viewers (users) to make explicit ratings on their watched TV program contents. Instead, it implicitly infers the users' interests on the watched TV program contents. For the recommendation of user preferred TV program contents, our proposed recommendation scheme first clusters TV users into similar groups based on their preferences on the content genres from the user's watching history of TV program contents. For the personalized recommendation of TV program contents to an active user, a candidate set of preferred TV program contents is obtained via collaborative filtering for the group to which the active user belongs. The candidate TV programs for recommendation are then ranked by a proposed novel ranking model. Finally, a set of top- N ranked TV program contents is recommended to the active user. The experimental results show that the proposed TV program recommendation scheme yields about 77% of average precision accuracy and 0.135 value of ANMRR (Average Normalized Modified Retrieval Rank) with top five recommendations for 1,509 people.

ACCURATE IMAGE RETRIEVAL BASED ON COMPACT COMPOSITE DESCRIPTORS AND RELEVANCE FEEDBACK INFORMATION

In this paper a new set of descriptors appropriate for image indexing and retrieval is proposed. The proposed descriptors address the tremendously increased need for efficient content-based image retrieval (CBIR) in many application areas such as the Internet, biomedicine, commerce and education. These applications commonly store image information in large image databases where the image information cannot be accessed or used unless the database is organized to allow efficient storage, browsing and retrieval. To be applicable in the design of large image databases, the proposed descriptors are compact, with the smallest requiring only 23 bytes per image. The proposed descriptors' structure combines color and texture information which are extracted using fuzzy approaches. To evaluate the performance of the proposed descriptors, the objective Average Normalized Modified Retrieval Rank (ANMRR) is used. Experiments conducted on five benchmarking image databases demonstrate the effectiveness of the proposed descriptors in outperforming other state-of-the-art descriptors. Also, a Auto Relevance Feedback (ARF) technique is introduced which is based on the proposed descriptors. This technique readjusts the initial retrieval results based on user preferences improving the retrieval score significantly. An online demo of the image retrieval system img(Anaktisi) that implements the proposed descriptors can be found at .

Evaluation of relevance feedback schemes in content-based in retrieval systems

Multimedia content modeling, i.e., identification of semantically meaningful entities, is an arduous task mainly due to the fact that (a) humans perceive the content using high-level concepts and (b) the subjectivity of human perception, which often interprets the same content in a different way at different times. For this reason, an efficient content management system has to be adapted to current user's information needs and preferences through an on-line learning strategy based on users’ interaction. One adaptive learning strategy is relevance feedback, originally developed in traditional text-based information retrieval systems. In this way, the user interacts with the system to provide information about the relevance of the content, which is then fed back to the system to update its performance. In this paper, we evaluate and investigate three main types of relevance feedback algorithms; the Euclidean, the query point movements and the correlation-based approaches. In the first case, we examine heuristic and optimal techniques which are based either on the weighted or the generalized Euclidean distance. In the second case, we survey single and multipoint query movement schemes. As far as the third type is concerned, two different ways for parametrizing the normalized cross-correlation similarity metric are proposed. The first scales only the elements of the query feature vector and called query-scaling strategy, while the second scales both the query and the selected samples (query-sample scaling strategy). All the examined algorithms are evaluated using both subjective and objective criteria. Subjective evaluation is performed by depicting the best retrieved images as response of the system to a user's query. Instead, objective evaluation is obtained using standard criteria, such as the precision–recall curve and the average normalized modified retrieval rank (ANMRR). Furthermore, a newly objective criterion, called average normalized similarity metric distance is introduced which exploits the difference among the actual and ideal similarity measure among all best retrievals. Discussions and comparisons of all the aforementioned relevance feedback algorithms are presented.

Generalized Nonlinear Relevance Feedback for Interactive Content-Based Retrieval and Organization

In this paper, a novel relevance feedback algorithm is proposed for improving the performance of interactive content-based retrieval systems. The algorithm recursively estimates the similarity measure, which is used for data ranking in description environments where similarity-based queries are applied, using a set of relevant/irrelevant samples feedback by the user to the system so that the adjusted response is a better approximation of the current user's information needs and preferences. In particular, using concepts of functional analysis, the similarity measure is expressed as a parametric form of known monotone increasing functional components. Then, the contribution of each functional component to the similarity measure is estimated through a recursive and efficient on-line learning algorithm so that: 1) the current user's needs and preferences, as indicated by a set of selected relevant/irrelevant samples, are satisfied as much as possible, while simultaneously 2) a minimal modification of the already estimated similarity measure is accomplished. Experimental results on a large real-life database using objective evaluation criteria, such as the precision-recall curve and the average normalized modified retrieval rank (ANMRR), indicate that the proposed scheme outperforms the compared ones. In addition, the proposed algorithm requires low computational complexity and it can be implemented in a recursive way.

Re-ranking algorithm using post-retrieval clustering for content-based image retrieval

In this paper, we propose a re-ranking algorithm using post-retrieval clustering for content-based image retrieval (CBIR). In conventional CBIR systems, it is often observed that images visually dissimilar to a query image are ranked high in retrieval results. To remedy this problem, we utilize the similarity relationship of the retrieved results via post-retrieval clustering. In the first step of our method, images are retrieved using visual features such as color histogram. Next, the retrieved images are analyzed using hierarchical agglomerative clustering methods (HACM) and the rank of the results is adjusted according to the distance of a cluster from a query. In addition, we analyze the effects of clustering methods, query-cluster similarity functions, and weighting factors in the proposed method. We conducted a number of experiments using several clustering methods and cluster parameters. Experimental results show that the proposed method achieves an improvement of retrieval effectiveness of over 10% on average in the average normalized modified retrieval rank (ANMRR) measure.

Image retrieval using bdip and bvlc moments

We propose two new texture features, block difference of inverse probabilities (BDIP) and block variation of local correlation coefficients (BVLC), for content-based image retrieval (CBIR) and then present an image retrieval method based on the combination of BDIP and BVLC moments. BDIP uses local probabilities in image blocks to measure an image's local brightness variations well. BVLC uses variations of local correlation coefficients in image blocks to measure local texture smoothness of an image well. Experimental results show that the presented retrieval method yields about 12% better performance in precision versus recall and about 0.13 in average normalized modified retrieval rank (ANMRR) than the method using wavelet moments.

VIDEO CONTENT REPRESENTATION FOR SHOT RETRIEVAL AND SCENE EXTRACTION

In this paper, we present a novel scheme on video content representation by exploring the spatio-temporal information. A pseudo-object-based shot representation containing more semantics is proposed to measure shot similarity and force competition approach is proposed to group shots into scene based on content coherences between shots. Two content descriptors, color objects: Dominant Color Histograms (DCH) and Spatial Structure Histograms (SSH), are introduced. To represent temporal content variations, a shot can be segmented into several subshots that are of coherent content, and shot similarity measure is formulated as subshot similarity measure that serves to shot retrieval. With this shot representation, scene structure can be extracted by analyzing the splitting and merging force competitions at each shot boundary. Experimental results on real-world sports video prove that our proposed approach for video shot retrievals achieve the best performance on the average recall (AR) and average normalized modified retrieval rank (ANMRR), and Experiment on MPEG-7 test videos achieves promising results by the proposed scene extraction algorithm.