In this paper we propose to extend the well known graph cut segmentation framework by learning superpixel relations and use them to weight superpixel-to-superpixel edges in a superpixel graph. Adjacent superpixel-pairs are analyzed to build an object boundary model, able to discriminate between superpixel-pairs belonging to the same object or placed on the edge between the foreground object and the background. Several superpixel-pair features are investigated and exploited to build a non-linear SVM to learn object boundary appearance. The adoption of this modified graph cut enhances the performance of a previously proposed segmentation method on two publicly available datasets, reaching state-of-the-art results.

In this paper we address the task of learning how to segment a particular class of objects, by means of a training set of images and their segmentations. In particular we propose a method to overcome the extremely high training time of a previously proposed solution to this problem, Kernelized Structural Support Vector Machines. We employ a one-class SVM working with joint kernels to robustly learn significant support vectors (representative image-mask pairs) and accordingly weight them to build a suitable energy function for the graph cut framework. We report results obtained on two public datasets and a comparison of training times on different training set sizes.

In this paper we propose a novel image descriptor built by computing the covariance of pixel level features on densely sampled patches and encoding them using their covariance. Appropriate projections to the Euclidean space and feature normalizations are employed in order to provide a strong descriptor usable with linear classifiers. In order to remove border effects, we further enhance the Spatial Pyramid representation with bilinear interpolation. Experimental results conducted on two common datasets for object and texture classification show that the performance of our method is comparable with state of the art techniques, but removing any dataset specific dependency in the feature encoding step.

Common techniques represent images by quantizing local descriptors and summarizing their distribution in a histogram. In this paper we propose to employ a parametric description and compare its capabilities to histogram based approaches. We use the multivariate Gaussian distribution, applied over the SIFT descriptors, extracted with dense sampling on a spatial pyramid. Every distribution is converted to a high-dimensional descriptor, by concatenating the mean vector and the projection of the covariance matrix on the Euclidean space tangent to the Riemannian manifold. Experiments on Caltech-101 and ImageCLEF2011 are performed using the Stochastic Gradient Descent solver, which allows to deal with large scale datasets and high dimensional feature spaces.

With the continuing increase in the number of images collected everyday from different sensors, the automated registration of multisensor/multispectral images has become a very important issue. This is particularly true when pre- and postevent image comparison is concerned: For this particular application, the requirement of obtaining the earliest possible postevent image imposes the use of data potentially possessing significantly different characteristics with respect to the pre-event image. Strongly inhomogeneous image pairs require robust automatic registration techniques, preferably based on resolution-independent feature-based registration. In a previous paper, we proposed a mode-based feature-matching scheme mutated from the computer vision domain and adapted to pre- and postevent feature matching. Some of the weak points highlighted in that first version are addressed in this paper, where a new version of the method is proposed, which exploits a new piece of information, i.e., the adjacency between feature points, generally preserved across the disaster event. Extensive generation of synthetic cases allowed one to obtain significant feedback and, consequently, tune the algorithm. Three real cases of pre- and postevent feature matching on high-resolution satellite images are shown and discussed.