Papers
Topics
Authors
Recent
2000 character limit reached

Phase Locking Value revisited: teaching new tricks to an old dog

Published 22 Oct 2017 in eess.SP, nlin.CD, physics.data-an, and q-bio.NC | (1710.08037v3)

Abstract: Despite the increase in calculation power in the last decades, the estimation of brain connectivity is still a tedious task. The high computational cost of the algorithms escalates with the square of the number of signals evaluated, usually in the range of thousands. In this work we propose a re-formulation of a widely used algorithm that allows the estimation of whole brain connectivity in much smaller times. We start from the original implementation of Phase Locking Value (PLV) and re-formulated it in a highly computational efficient way. Besides, this formulation stresses its strong similarity with coherence, which we used to introduce two new metrics insensitive to zero lag synchronization, the imaginary part of PLV (iPLV) and its corrected counterpart (ciPLV). The new implementation of PLV avoids some highly CPU-expensive operations, and achieved a 100-fold speedup over the original algorithm. The new derived metrics were highly robust in the presence of volume conduction. ciPLV, in particular, proved capable of ignoring zero-lag connectivity, while correctly estimating nonzero-lag connectivity. Our implementation of PLV makes it possible to calculate whole-brain connectivity in much shorter times. The results of the simulations using ciPLV suggest that this metric is ideal to measure synchronization in the presence of volume conduction or source leakage effects.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.