Fisher kernel

Add links
Source: Wikipedia, the free encyclopedia.

In statistical classification, the Fisher kernel, named after Ronald Fisher, is a function that measures the similarity of two objects on the basis of sets of measurements for each object and a statistical model. In a classification procedure, the class for a new object (whose real class is unknown) can be estimated by minimising, across classes, an average of the Fisher kernel distance from the new object to each known member of the given class.

The Fisher kernel was introduced in 1998.[1] It combines the advantages of generative statistical models (like the hidden Markov model) and those of discriminative methods (like support vector machines):

  • generative models can process data of variable length (adding or removing data is well-supported)
  • discriminative methods can have flexible criteria and yield better results.

Derivation

Fisher score

The Fisher kernel makes use of the Fisher

score
, defined as

with θ being a set (vector) of parameters. The function taking θ to log P(X|θ) is the

log-likelihood
of the probabilistic model.

Fisher kernel

The Fisher kernel is defined as

with being the Fisher information matrix.

Applications

Information retrieval

The Fisher kernel is the kernel for a generative probabilistic model. As such, it constitutes a bridge between generative and probabilistic models of documents.

Naive Bayes and probabilistic latent semantic analysis
.

Image classification and retrieval

The Fisher kernel can also be applied to image representation for classification or retrieval problems. Currently, the most popular

bag-of-visual-words representation suffers from sparsity and high dimensionality. The Fisher kernel can result in a compact and dense representation, which is more desirable for image classification[4] and retrieval[5][6]
problems.

The Fisher Vector (FV), a special, approximate, and improved case of the general Fisher kernel,[7] is an image representation obtained by pooling local image features. The FV encoding stores the mean and the covariance deviation vectors per component k of the Gaussian-Mixture-Model (GMM) and each element of the local feature descriptors together. In a systematic comparison, FV outperformed all compared encoding methods (Bag of Visual Words (BoW), Kernel Codebook encoding (KCB), Locality Constrained Linear Coding (LLC), Vector of Locally Aggregated Descriptors (VLAD)) showing that the encoding of second order information (aka codeword covariances) indeed benefits classification performance.[8]

See also

Notes and references

  1. ^
    ISBN 978-0-262-11245-1 PS, Citeseer
  2. ^ Cyril Goutte, Eric Gaussier, Nicola Cancedda, Hervé Dejean (2004))"Generative vs Discriminative Approaches to Entity Recognition from Label-Deficient Data" JADT 2004, 7èmes journées internationales analyse statistique des données textuelles, Louvain-la-Neuve, Belgium, 10-12 mars 2004
  3. ^ Charles Elkan (2005). Deriving TF-IDF as a fisher kernel (PDF). SPIRE. Archived from the original (PDF) on December 20, 2013.
  4. ^ Florent Perronnin and Christopher Dance (2007), “Fisher Kernels on Visual Vocabularies for Image Categorization”
  5. ^ Herve Jegou et al. (2010), “Aggregating local descriptors into a compact image representation”
  6. ^ A.P. Twinanda et al. (2014), “Fisher Kernel Based Task Boundary Retrieval in Laparoscopic Database with Single Video Query”
  7. ^ "VLFeat - Documentation > C API". www.vlfeat.org. Retrieved 2017-03-04.
  8. PMID 28234999
    .
Retrieved from "https://en.wikipedia.org/w/index.php?title=Fisher_kernel&oldid=1220530450"