Conference Paper

Large-scale Outdoor Scene Classification by Boosting a Set of Highly Discriminative and Low Redundant Graphlets.

DOI: 10.1109/ICDMW.2011.108 Conference: Data Mining Workshops (ICDMW), 2011 IEEE 11th International Conference on, Vancouver, BC, Canada, December 11, 2011
Source: DBLP

ABSTRACT Large-scale outdoor scene classification is an important issue in multimedia information retrieval. In this paper, we propose an efficient scene classification model by integrating outdoor scene image's local features into a set of highly discriminative and less redundant graph lets (i.e., small connected sub graph). Firstly, each outdoor scene image is segmented into a number of regions in terms of its color intensity distribution. And a region adjacency graph (RAG) is defined to encode the geometric property and color intensity distribution of outdoor scene image. Then, the frequent sub-structures are mined statistically from the RAGs corresponding to the training outdoor scene images. And a selecting process is carried out to obtain a set of sub-structures from the frequent ones towards being highly discriminative and low redundant. And these selected sub-structures are used as templates to extract the corresponding graph lets. Finally, we integrate these extracted graph lets by a multi-class boosting strategy for outdoor scene classification. The experimental results on the challenging SUN~\cite{sun} data set and the LHI~\cite{lotus} data set validate the effectiveness of our approach.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a method for recognizing scene categories based on approximate global geometric correspondence. This technique works by partitioning the image into increasingly fine sub-regions and computing histograms of local features found inside each sub-region. The resulting "spatial pyramid" is a simple and computationally efficient extension of an orderless bag-of-features image representation, and it shows significantly improved performance on challenging scene categorization tasks. Specifically, our proposed method exceeds the state of the art on the Caltech-101 database and achieves high accuracy on a large database of fifteen natural scene categories. The spatial pyramid framework also offers insights into the success of several recently proposed image descriptions, including Torralba’s "gist" and Lowe’s SIFT descriptors.
    Computer Vision and Pattern Recognition, 2006 IEEE Computer Society Conference on; 02/2006
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the respective graphs, leveraging the natural structure of images while remaining robust to the associated segmentation process uncertainty. Indeed, output from morphological segmentation is often represented by a labelled graph, each vertex corresponding to a segmented region, with edges joining neighboring regions. However, such image representations have mostly remained underused for learning tasks, partly because of the observed instability of the segmentation process and the inherent hardness of inexact graph matching with uncertain graphs. Our kernels count common virtual substructures amongst images, which enables to perform efficient supervised classification of natural images with a support vector machine. Moreover, the kernel machinery allows us to take advantage of recent advances in kernel-based learning: (i) semi-supervised learning reduces the required number of labelled images, while (ii) multiple kernel learning algorithms efficiently select the most relevant similarity measures between images within our family.
    Computer Vision and Pattern Recognition, 2007. CVPR '07. IEEE Conference on; 07/2007
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Region based features are getting popular due to their higher descriptive power relative to other features. How- ever, real world images exhibit changes in image segments capturing the same scene part taken at different time, un- der different lighting conditions, from different viewpoints, etc. Segmentation algorithms reect these changes, and thus segmentations exhibit poor repeatability. In this paper we address the problem of matching regions of similar ob- jects under unstable segmentations. Merging and splitting of regions makes it difcult to nd such correspondences using one-to-one matching algorithms. We present partial region matching as a solution to this problem. We assume that the high contrast, dominant contours of an object are fairly repeatable, and use them to compute partial match- ing cost (PMC) between regions. Region correspondences are obtained under region adjacency constraints encoded by Region Adjacency Graph (RAG). We integrate PMC in a many-to-one label assignment framework for matching RAGs, and solve it using belief propagation. We show that our algorithm can match images of similar objects across unstable image segmentations. We also compare the perfor- mance of our algorithm with that of the standard one-to-one matching algorithm on three motion sequences. We con- clude that our partial region matching approach is robust under segmentation irrepeatabilities.
    2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 24-26 June 2008, Anchorage, Alaska, USA; 01/2008