Linear Dependency Modeling for Feature Fusion

Abstract

This paper addresses the independent assumption issue in fusion process. In the last decade, dependency modeling techniques were developed under a specific distribution of classifiers. This paper proposes a new framework to model the dependency between features without any assumption on feature/classifier distribution. In this paper, we prove that feature dependency can be modeled by a linear combination of the posterior probabilities under some mild assumptions. Based on the linear combination property, two methods, namely Linear Classifier Dependency Modeling (LCDM) and Linear Feature Dependency Modeling (LFDM), are derived and developed for dependency modeling in classifier level and feature level, respectively. The optimal models for LCDM and LFDM are learned by maximizing the margin between the genuine and imposter posterior probabilities. Both synthetic data and real datasets are used for experiments. Experimental results show that LFDM outperforms all existing combination methods.

Cite

Text

Ma and Yuen. "Linear Dependency Modeling for Feature Fusion." IEEE/CVF International Conference on Computer Vision, 2011. doi:10.1109/ICCV.2011.6126477

Markdown

[Ma and Yuen. "Linear Dependency Modeling for Feature Fusion." IEEE/CVF International Conference on Computer Vision, 2011.](https://mlanthology.org/iccv/2011/ma2011iccv-linear/) doi:10.1109/ICCV.2011.6126477

BibTeX

@inproceedings{ma2011iccv-linear,
  title     = {{Linear Dependency Modeling for Feature Fusion}},
  author    = {Ma, Andy Jinhua and Yuen, Pong Chi},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {2011},
  pages     = {2041-2048},
  doi       = {10.1109/ICCV.2011.6126477},
  url       = {https://mlanthology.org/iccv/2011/ma2011iccv-linear/}
}