Jump to content

Babel function

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Citation bot (talk | contribs) at 22:01, 3 June 2021 (Alter: template type. Add: s2cid, doi, pages, issue, volume, journal. | Use this bot. Report bugs. | Suggested by Abductive | Category:All articles that are too technical | #UCB_Category 2674/2865). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Babel function (also known as cumulative coherence) measures the maximum total coherence between a fixed atom and a collection of other atoms in a dictionary. The Babel function was conceived of in the context of signals for which there exists a sparse representation consisting of atoms or columns of a redundant dictionary matrix, A.

Definition and formulation

The Babel function of a dictionary with normalized columns is a real-valued function that is defined as

where are the columns (atoms) of the dictionary .[1][2]

Special case

When p=1, the babel function is the mutual coherence.

Pratical Applications

Li and Lin have used the Babel function to aid in creating effective dictionaries for Machine Learning applications.[3]

References

  1. ^ Joel A. Tropp (2004). "Greed is good: Algorithmic results for sparse approximation" (PDF). IEEE Trans. Inform. Theory. 50 (10): 2231–2242. CiteSeerX 10.1.1.84.5256. doi:10.1109/TIT.2004.834793. S2CID 675692.
  2. ^ Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise
  3. ^ Huan Li and Zhouchen Lin. "Construction of Incoherent Dictionaries via Direct Babel Function Minimization" (PDF).

See also