English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Large scale blind source separation

Boettcher, A., Brendel, W., & Bethge, M. (2016). Large scale blind source separation. Poster presented at Bernstein Conference 2016, Berlin, Germany.

Item is

Files

show Files

Locators

show
hide
Locator:
Link (Any fulltext)
Description:
-

Creators

show
hide
 Creators:
Boettcher, A, Author
Brendel, W, Author
Bethge, M1, 2, Author              
Affiliations:
1Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497794              
2Research Group Computational Vision and Neuroscience, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497805              

Content

show
hide
Free keywords: -
 Abstract: The quantity and complexity of experimental data being recorded in Neuroscience is increasing quickly. Many traditional data analysis tools do not scale to large datasets and there is an urgent need for accessible high-performance algorithms. To this end we developed and released a flexible Blind Source Separation (BSS) method that is capable of handling high-dimensional data such as 2p imaging recordings and encompasses many traditional methods such as sparse Principal Component Analysis, Independent Component Analysis or Non-Negative Matrix Factorization. More concretely, the algorithm is (1) based on a high-throughput probabilistic formulation, (2) can flexibly incorporate prior information about the sources (e.g. sparsity or non-negativity), (3) employs random-projection PCA to reduce its memory-footprint and can (4) be run on the GPU. We apply the method to a 2p imaging video recorded in a zebrafish, extract regions of interest (such as the position of cells or dendrites) and single-cell calcium traces and then compare with manual labeling. We additionally benchmark the algorithm quantitatively on a composition of a 2p recordings with manually appended cells. On large-scale data the new algorithm can easily be 1-2 orders of magnitude more memory- and run-time efficient then other commonly employed BSS algorithms and can often discover more meaningful sources due to its flexible incorporation of prior information (like the sparse, non-negative responses of single cells with localized ROIs).

Details

show
hide
Language(s):
 Dates: 2016-09-21
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.12751/nncn.bc2016.0110
BibTex Citekey: BoettcherBB2016
 Degree: -

Event

show
hide
Title: Bernstein Conference 2016
Place of Event: Berlin, Germany
Start-/End Date: 2016-09-21 - 2016-09-23

Legal Case

show

Project information

show

Source 1

show
hide
Title: Bernstein Conference 2016
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 118 - 119 Identifier: -