Elsevier

Signal Processing

Volume 126, September 2016, Pages 180-186
Signal Processing

Cross domain boosting for information fusion in heterogeneous sensor-cyber sources

https://doi.org/10.1016/j.sigpro.2015.04.002Get rights and content

Highlights

  • We propose Cross Domain Boosting (CD-Boost) to fuse information in HSCS.

  • The weighted boosting loss objective of CD-Boost can fuse information by assigning different weights to each source sample.

  • The manifold smoothness regularization of CD-Boost can prevent overfitting and further improve the accuracy.

Abstract

Image classification is an active research area in signal processing and pattern recognition, with extensively academic and industrial applications. Existing image classification methods usually assumes consistent image source for training and testing which, however, seldom holds for practical applications. We define the scenario of images being captured from diverse sources (e.g. Internet, surveillance cameras, and mobile phones) as heterogeneous sensor-cyber sources (HSCS). We indicate that, information fusion in HSCS is able to make full use of the diversity of images, and thus improves the generalization of classifier. A novel algorithm named Cross Domain Boosting (CD-Boost) is proposed to fuse information in HSCS. Our CD-Boost algorithm has two characteristics, weighted loss objective and manifold smoothness regularization. Concretely, the weighted boosting loss objective can fuse information by assigning different weights to each source sample, and the weights are determined by minimizing the difference between the data distribution in HSCS. Furthermore, when the images are scarce, a manifold smoothness regularization can prevent overfitting and further improve the accuracy. The experimental results on real data demonstrate that our algorithm outperforms existing methods.

Introduction

Image classification has long attracted intensive interest in signal processing and pattern recognition, because its results are the basis for web content analysis, image retrieval, human–computer interaction, and biometrics. The first step of training an image classifier is to collect images that are usually captured from heterogeneous sources in real-world scenarios. They are widely obtained from webcam, digital single lens reflex camera, Internet, mobile phone or collected and annotated publicly databases, which are called heterogeneous sensor-cyber sources (HSCS) [1], [2]. Images from HSCS are captured with various hardware settings, under varying illumination and noise conditions, and post-processed with different image techniques. So they have different distributions. Nevertheless, the default assumption in many learning scenarios is that training data and testing data are drawn from the same distribution. If the model is trained and tested on HSCS, a mismatch of image distributions would result in the performance of classifier degradation sharply [3], [4], [5]. We observe that images from HSCS have a diversity characteristic and reside on different feature spaces, and by fusing them, we can obtain a more complete feature space than individual feature space. We therefore propose that training an image classifier utilizing the images from HSCS are able to improve the classifier generalization. The generalization of a classifier is useful in many real-world applications. For example, lab-trained image classifiers based on images downloaded from Internet can be applied into mobile phones in outdoor environment. Traditional methods [6], [7] need lots of training samples captured with mobile phone cameras. On one hand, however, collecting images captured from mobile phone cameras involves tremendous manual work and monetary cost; on the other hand, there are a large amount of readily available images from cyber source. Intuitively, we hope to utilize the images from cyber source to improve the generalization of classifier. Namely, we want to fuse information by utilizing images from cyber source and a small amount of images captured with mobile phone cameras, and the classifier works well on mobile camera images.

Information fusion is key to make full use of the diversity of images from HSCS, and thus improves the generalization of classifier. Many problems arise when fusing information in HSCS. One of these problems is that the same objects appear significantly different across several sources, which is caused by many factors, such as pose, illumination or image resolution. Fig. 1 shows the same set of object classes captured from heterogeneous sources. Although the images from HSCS appear significantly different, the relationship among heterogeneous sources is that these images reside on an intrinsically low dimension manifold in the high dimension feature space [8]. Thus, it is reasonable to believe that information fusion of images from HSCS can improve the generalization of classifier. What we need is a well defined information fusion principle so that make full use of the diversity of images from HSCS.

Fortunately, the above challenge is considered by the techniques of domain adaptation or covariate shift which involve heterogeneous sources, training samples in the source domain and testing samples in the target domain. A fruitful line of work has been proposed for this task [9], [10], [11]. Some have focused on learning adapted classifier parameters by minimizing classification error using a small amount of labeled samples in the target domain [12], [13]. Other methods derive new feature representations [14], [15] or learn a transformation between the features in the various domains [16], [17].

In this paper, we propose a novel Cross Domain Boosting (CD-Boost) algorithm for information fusion in HSCS. The images from HSCS can be viewed as data drawn from different distributions, and by matching the different distributions, each of the samples can be assigned a weight which represents its probability ratio of belonging to target and source sample distribution. The weight for each sample can help classifier fuse the information of HSCS. This inspires a weighted boosting objective. Furthermore, the lack of sufficient target samples may result in overfitting problem. We therefore design a manifold smoothness regularization item, which enforces the smoothness in local data manifold, into the optimization objective. These two characteristics constitute the proposed CD-Boost algorithm. The proposed algorithm is verified on the images captured from HSCS, and the experimental results clearly demonstrate the effectiveness of the proposed CD-Boost algorithm.

The remainder of this paper is organized as follows: in Section 2, we introduce related work; in Section 3, the CD-Boost algorithm is presented in detail; the experimental results are given in Section 4, and finally in Section 5 we conclude this paper.

Section snippets

Related work

The challenge of information fusion in HSCS can be addressed by domain adaptation or covariate shift which is a fundamental problem in signal processing and machine learning and in related fields. It has been extensively studied in many area, including speech and language processing [18], [19], [20] and computer vision [13], [21], [22], [23], [24]. The target of domain adaptation focuses on how to deal with data sampled from different distributions, thus compensating for their mismatch. One

Cross domain boosting

In this section we will introduce the Cross Domain Boosting (CD-Boost) algorithm, including its formulation, components and solutions. For convenience, we first discuss a two-class problem and the multi-class problem can be handled as a set of two-class problems using one versus all approach.

Experimental results

In this section, we will examine the effectiveness of the proposed CD-Boost algorithm. We begin by introducing the experimental setup, including the database and baselines. Then, we present the parameter setting. Finally, we compare the proposed CD-Boost algorithm with baselines and other excellent methods.

Conclusion

In this paper, we focus on information fusion in HSCS. To fuse information in HSCS, we introduce the Kernel Mean Matching (KMM) method to measure the importance of every source sample toward target sample. In such a way, we design a sample weighted objective for boosting learning so that we can fully explore diversity of images in HSCS. We further add a manifold smoothness regularization to enforce the smoothness in the decision boundary of trained classifiers, in order to further improve the

Acknowledgements

This work is supported by National Natural Science Foundation of China under Grant nos. 61401309 and 61401310, and Doctoral Fund of Tianjin Normal University under Grant nos. 5RL134 and 52XB1405.

References (33)

  • Z. Dong et al.

    An improvement of the penalty decomposition method for sparse approximation

    Signal Process.

    (2015)
  • H. Huo et al.

    Sampling theorems and error estimates for random signals in the linear canonical transform domain

    Signal Process.

    (2015)
  • Q. Liang

    Situation understanding based on heterogeneous sensor networks and human-inspired favor weak fuzzy logic system

    IEEE Syst. J.

    (2011)
  • Q. Liang et al.

    Opportunistic sensing in wireless sensor networks: theory and application

    IEEE Trans. Comput.

    (2014)
  • F. Perronnin, J. Sánchez, Y. Liu, Large-scale image categorization with explicit data embedding, in: IEEE Conference on...
  • A. Torralba, A. Efros, Unbiased look at dataset bias, in: IEEE Conference on Computer Vision and Pattern Recognition,...
  • K. Chatfield, V. Lempitsky, A. Vedaldi, A. Zisserman, The devil is in the details: an evaluation of recent feature...
  • Y. Huang et al.

    Feature coding in image classification: a comprehensive study

    IEEE Trans. Pattern Anal. Mach. Intell.

    (2014)
  • S.Z. Li, X. Hou, H. Zhang, Q. Cheng, Learning spatially localized, parts-based representation, in: IEEE Conference on...
  • S.J. Pan et al.

    A survey on transfer learning

    IEEE Trans. Knowl. Data Eng.

    (2010)
  • M. Karim et al.

    Data embedding in random domain

    Signal Process.

    (2015)
  • J. Yang, R. Yan, A.G. Hauptmann, Cross-domain video concept detection using adaptive svms, in: ACM Multimedia, 2007,...
  • A. Bergamo et al.

    Exploiting weakly-labeled web images to improve object classification: a domain adaptation approach

    Neural Inf. Process. Syst.

    (2010)
  • R. Gopalan, R. Li, R. Chellappa, Domain adaptation for object recognition: an unsupervised approach, in: IEEE...
  • B. Gong, Y. Shi, F. Sha, K. Grauman, Geodesic flow kernel for unsupervised domain adaptation, in: IEEE Conference on...
  • J. Hoffman et al.

    Asymmetric and category invariant feature transformations for domain adaptation

    Int. J. Comput. Vis.

    (2014)
  • View full text