To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Self-similarity matrix

From Wikipedia, the free encyclopedia

In data analysis, the self-similarity matrix is a graphical representation of similar sequences in a data series.

Similarity can be explained by different measures, like spatial distance (distance matrix), correlation, or comparison of local histograms or spectral properties (e.g. IXEGRAM[1]). This technique is also applied for the search of a given pattern in a long data series as in gene matching.[citation needed] A similarity plot can be the starting point for dot plots or recurrence plots.

Definition

To construct a self-similarity matrix, one first transforms a data series into an ordered sequence of feature vectors , where each vector describes the relevant features of a data series in a given local interval. Then the self-similarity matrix is formed by computing the similarity of pairs of feature vectors

where is a function measuring the similarity of the two vectors, for instance, the inner product . Then similar segments of feature vectors will show up as path of high similarity along diagonals of the matrix.[2] Similarity plots are used for action recognition that is invariant to point of view [3] and for audio segmentation using spectral clustering of the self-similarity matrix.[4]

Example

Similarity plot, a variant of recurrence plot, obtained for different views of human actions are shown to produce similar patterns.[5]

See also

References

  1. ^ M. A. Casey; A. Westner (July 2000). "Separation of mixed audio sources by independent subspace analysis" (PDF). Proc. Int. Comput. Music Conf. Retrieved 2013-11-19.
  2. ^ Müller, Meinard; Michael Clausen (2007). "Transposition-invariant self-similarity matrices" (PDF). Proceedings of the 8th International Conference on Music Information Retrieval (ISMIR 2007): 47–50. Retrieved 2013-11-19.
  3. ^ I.N. Junejo; E. Dexter; I. Laptev; Patrick Pérez (2008). "Cross-View Action Recognition from Temporal Self-similarities". Computer Vision – ECCV 2008. Lecture Notes in Computer Science. Vol. 5303. pp. 293–306. CiteSeerX 10.1.1.405.1518. doi:10.1007/978-3-540-88688-4_22. ISBN 978-3-540-88685-3.
  4. ^ Dubnov, Shlomo; Ted Apel (2004). "Audio segmentation by singular value clustering". Proceedings of Computer Music Conference (ICMC 2004). CiteSeerX 10.1.1.324.4298.
  5. ^ Cross-View Action Recognition from Temporal Self-Similarities (2008), I. Junejo, E. Dexter, I. Laptev, and Patrick Pérez)

Further reading

External links

This page was last edited on 24 August 2023, at 07:01
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.