Linear dependency modeling for feature fusion

Andy J.H. Ma*, Pong Chi YUEN

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference contributionpeer-review

14 Citations (Scopus)

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.

Original languageEnglish
Title of host publication2011 International Conference on Computer Vision, ICCV 2011
Pages2041-2048
Number of pages8
DOIs
Publication statusPublished - 2011
Event2011 IEEE International Conference on Computer Vision, ICCV 2011 - Barcelona, Spain
Duration: 6 Nov 201113 Nov 2011

Publication series

NameProceedings of the IEEE International Conference on Computer Vision

Conference

Conference2011 IEEE International Conference on Computer Vision, ICCV 2011
Country/TerritorySpain
CityBarcelona
Period6/11/1113/11/11

Scopus Subject Areas

  • Software
  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'Linear dependency modeling for feature fusion'. Together they form a unique fingerprint.

Cite this