Further results on dissimilarity spaces for hyperspectral images RF-CBIR

Content-Based Image Retrieval (CBIR) systems are powerful search tools in image databases that have been little applied to hyperspectral images. Relevance feedback (RF) is an iterative process that uses machine learning techniques and user's feedback to improve the CBIR systems performance. We pursued to expand previous research in hyperspectral CBIR systems built on dissimilarity functions defined either on spectral and spatial features extracted by spectral unmixing techniques, or on dictionaries extracted by dictionary-based compressors. These dissimilarity functions were not suitable for direct application in common machine learning techniques. We propose to use a RF general approach based on dissimilarity spaces which is more appropriate for the application of machine learning algorithms to the hyperspectral RF-CBIR. We validate the proposed RF method for hyperspectral CBIR systems over a real hyperspectral dataset.Comment: In Pattern Recognition Letters (2013

Consumer perceptions of co-branding alliances: Organizational dissimilarity signals and brand fit

This study explores how consumers evaluate co-branding alliances between dissimilar partner firms. Customers are well aware that different firms are behind a co-branded product and observe the partner firms’ characteristics. Drawing on signaling theory, we assert that consumers use organizational characteristics as signals in their assessment of brand fit and for their purchasing decisions. Some organizational signals are beyond the control of the co-branding partners or at least they cannot alter them on short notice. We use a quasi-experimental design and test how co-branding partner dissimilarity affects brand fit perception. The results show that co-branding partner dissimilarity in terms of firm size, industry scope, and country-of-origin image negatively affects brand fit perception. Firm age dissimilarity does not exert significant influence. Because brand fit generally fosters a benevolent consumer attitude towards a co-branding alliance, the findings suggest that high partner dissimilarity may reduce overall co-branding alliance performance

Dissimilarity measures for content-based image retrieval

Dissimilarity measurement plays a crucial role in content-based image retrieval. In this paper, 16 core dissimilarity measures are introduced and evaluated. We carry out a systematic performance comparison on three image collections, Corel, Getty and Trecvid2003, with 7 different feature spaces. Two search scenarios are considered: single image queries based on the vector space model, and multi-image queries based on k-nearest neighbours search. A number of observations are drawn, which will lay a foundation for developing more effective image search technologies

Approximate Matching in ACSM Dissimilarity Measure

AbstractThe paper introduces a new patch-based dissimilarity measure for image comparison employing an approximation strategy. It extends the Average Common Sub-matrix measure computing the exact dissimilarity among images. In the exact method, dissimilarity between two images is obtained by considering the average area of the biggest square sub-matrices in common between the images, by exact match of the extracted sub-matrices pixel by pixel. As an extension, the proposed dissimilarity measure computes an approximate match between the sub-matrices, which is obtained by omitting a controlled number of pixels at a given column offset inside the sub-matrices. The proposed dissimilarity measure is extensively compared with other well-known approximate methods for image comparison in the state-of-the-art. Experiments demonstrate the superiority of the proposed approximate measure in terms of execution time with respect to the exact method, and in terms of retrieval precision with respect to the other state-of-the-art methods

Entropy-based 2D image dissimilarity measure

Traditional histogram or statistics based 2D image similarity/dissimilarity metrics fail to handle conjugate pair of black and white images, due to the lack of spatial information in the measurement. Recently proposed Compression-based Dissimilarity Measure (CDM) [1] based on the concept of Kolmogorov complexity has provided a different paradise for similarity measurement. However, without a clear definition how to “concatenate” two 2D images, CDM has difficulties to directly apply with 2D images. In this thesis, an entropy -based 2D image dissimilarity measure is proposed within the same Kolmogorov complexity paradise. The spatial relationship between images is embedded in our metric, and the actual compression of images is not needed once the entropy values are obtained. The proposed metric has been tested for scene change detection application, and encouraging results are presented here

Geometry-Aware Neighborhood Search for Learning Local Models for Image Reconstruction

Local learning of sparse image models has proven to be very effective to solve inverse problems in many computer vision applications. To learn such models, the data samples are often clustered using the K-means algorithm with the Euclidean distance as a dissimilarity metric. However, the Euclidean distance may not always be a good dissimilarity measure for comparing data samples lying on a manifold. In this paper, we propose two algorithms for determining a local subset of training samples from which a good local model can be computed for reconstructing a given input test sample, where we take into account the underlying geometry of the data. The first algorithm, called Adaptive Geometry-driven Nearest Neighbor search (AGNN), is an adaptive scheme which can be seen as an out-of-sample extension of the replicator graph clustering method for local model learning. The second method, called Geometry-driven Overlapping Clusters (GOC), is a less complex nonadaptive alternative for training subset selection. The proposed AGNN and GOC methods are evaluated in image super-resolution, deblurring and denoising applications and shown to outperform spectral clustering, soft clustering, and geodesic distance based subset selection in most settings.Comment: 15 pages, 10 figures and 5 table

Boundary Extraction in Images Using Hierarchical Clustering-based Segmentation

Hierarchical organization is one of the main characteristics of human segmentation. A human subject segments a natural image by identifying physical objects and marking their boundaries up to a certain level of detail [1]. Hierarchical clustering based segmentation (HCS) process mimics this capability of the human vision. The HCS process automatically generates a hierarchy of segmented images. The hierarchy represents the continuous merging of similar, spatially adjacent or disjoint, regions as the allowable threshold value of dissimilarity between regions, for merging, is gradually increased. HCS process is unsupervised and is completely data driven. This ensures that the segmentation process can be applied to any image, without any prior information about the image data and without any need for prior training of the segmentation process with the relevant image data. The implementation details of HCS process have been described elsewhere in the author's work [2]. The purpose of the current study is to demonstrate the performance of the HCS process in outlining boundaries in images and its possible application in processing medical images. [1] P. Arbelaez. Boundary Extraction in Natural Images Using Ultrametric Contour Maps. Proceedings 5th IEEE Workshop on Perceptual Organization in Computer Vision (POCV'06). June 2006. New York, USA. [2] A. N. Selvan. Highlighting Dissimilarity in Medical Images Using Hierarchical Clustering Based Segmentation (HCS). M. Phil. dissertation, Faculty of Arts Computing Engineering and Sciences Sheffield Hallam Univ., Sheffield, UK, 2007.</p

Design and Implementation of Fake Currency Detection System

In recent years, a lot of illegal counterfeiting rings manufacture and sell fake coins and at the same time fake note currency is printed as well, which have caused great loss and damage to the society. Thus it is imperative to be able to detect fake currency. We propose a new approach to detect fake Indian notes using their images. A currency image is represented in the dissimilarity space, which is a vector space constructed by comparing the image with a set of prototypes. Each dimension measures the dissimilarity between the image under consideration and a prototype. In order to obtain the dissimilarity between two images, the local key points on each image are detected and described. Based on the characteristics of the currency, the matched key points between the two images can be identified in an efficient manner. A post processing procedure is further proposed to remove mismatched key points. Due to the limited number of fake currency in real life, SVM is conducted for fake currency detection, so only genuine currency are needed to train the classifier