Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Deconvolution01:20

Deconvolution

582
Deconvolution, also known as inverse filtering, is the process of extracting the impulse response from known input and output signals. This technique is vital in scenarios where the system's characteristics are unknown, and they must be inferred from the observable signals.
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...
582
Imaging Studies for Cardiovascular System VI: Calcium -Scoring CT01:25

Imaging Studies for Cardiovascular System VI: Calcium -Scoring CT

476
Calcium-Scoring CT ScanA calcium-scoring CT scan, also known as coronary artery calcium (CAC) scan, detects calcium deposits in the coronary arteries. This test assesses the risk of coronary artery disease (CAD), which can lead to cardiovascular events such as angina, heart failure, and sudden cardiac arrest.A calcium-scoring CT scan is generally recommended for individuals at intermediate risk of CAD without symptoms. It includes:Men aged 40-75 and women aged 50-75: Especially those with a...
476
Fast Fourier Transform01:10

Fast Fourier Transform

936
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
936
How Data are Classified: Categorical Data01:11

How Data are Classified: Categorical Data

44.2K
A variable, usually notated by capital letters such as X and Y, is a characteristic or measurement that can be determined for each member of a population. Data are the actual values of variables. They may be numbers, or they may be words. Datum is a single value.
Data are classified based on whether they are measurable or not. Categorical data cannot be measured; instead, it can be divided into categories. For example, if Y denotes a person's party affiliation, some examples of Y include...
44.2K
How Data are Classified: Numerical Data00:59

How Data are Classified: Numerical Data

37.7K
Data that are countable or measurable in specific units are called numerical or quantitative data. Quantitative data are always numbers. Quantitative data are the result of counting or measuring the attributes of a population. Amount of money, pulse rate, weight, number of people living in a town, and number of students who opt for statistics are examples of quantitative data.
Quantitative data may be either discrete or continuous. All quantitative data that take on only specific numerical...
37.7K
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

750
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
750

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Prefrontal to ventral tegmental area dynamics drive contingency degradation.

Nature·2026
Same author

Long-read transcriptome analysis using IsoRanker for identifying pathogenic variants in Mendelian conditions.

medRxiv : the preprint server for health sciences·2025
Same author

Efficient Likelihood-Based Temporal Changepoint Detection in Spatio-Temporal Processes.

Statistics and computing·2025
Same author

A haplotype-resolved view of human gene regulation.

bioRxiv : the preprint server for biology·2025
Same author

Bioprinted platform for parallelized screening of engineered microtissues in vivo.

Cell stem cell·2025
Same author

Cross-validation for training and testing co-occurrence network inference algorithms.

BMC bioinformatics·2025
Same journal

A Bayesian functional concurrent zero-inflated Dirichlet-multinomial regression model with application to infant microbiome.

Biostatistics (Oxford, England)·2026
Same journal

Towards optimal environmental policies: policy learning under arbitrary bipartite network interference.

Biostatistics (Oxford, England)·2026
Same journal

Multilevel functional quantile principal component analysis.

Biostatistics (Oxford, England)·2026
Same journal

Adaptive transfer learning for time-to-event modeling with applications in disease risk assessment.

Biostatistics (Oxford, England)·2026
Same journal

High-dimensional test for one-sided hypotheses.

Biostatistics (Oxford, England)·2026
Same journal

NBSR: a Negative Binomial Softmax Regression model for microRNA-seq data analysis.

Biostatistics (Oxford, England)·2026
See all related articles

Related Experiment Video

Updated: Jan 29, 2026

Analysis of SEC-SAXS data via EFA deconvolution and Scatter
10:59

Analysis of SEC-SAXS data via EFA deconvolution and Scatter

Published on: January 28, 2021

9.9K

Fast nonconvex deconvolution of calcium imaging data.

Sean W Jewell1, Toby Dylan Hocking2, Paul Fearnhead3

  • 1Department of Statistics, University of Washington, Seattle, WA 98195, USA.

Biostatistics (Oxford, England)
|February 13, 2019
PubMed
Summary
This summary is machine-generated.

This study introduces a fast algorithm for deconvolving calcium imaging data to accurately identify individual neuron spikes. The method significantly speeds up analysis of neural activity, enabling more precise neuroscience research.

Keywords:
Calcium imagingChangepoint detectionNeuroscienceNonconvex optimization

More Related Videos

Measuring Fast Calcium Fluxes in Cardiomyocytes
12:10

Measuring Fast Calcium Fluxes in Cardiomyocytes

Published on: November 29, 2011

15.8K
Single-Cell Calcium Imaging for Studying the Activation of Calcium Ion Channels
07:17

Single-Cell Calcium Imaging for Studying the Activation of Calcium Ion Channels

Published on: December 13, 2024

1.8K

Related Experiment Videos

Last Updated: Jan 29, 2026

Analysis of SEC-SAXS data via EFA deconvolution and Scatter
10:59

Analysis of SEC-SAXS data via EFA deconvolution and Scatter

Published on: January 28, 2021

9.9K
Measuring Fast Calcium Fluxes in Cardiomyocytes
12:10

Measuring Fast Calcium Fluxes in Cardiomyocytes

Published on: November 29, 2011

15.8K
Single-Cell Calcium Imaging for Studying the Activation of Calcium Ion Channels
07:17

Single-Cell Calcium Imaging for Studying the Activation of Calcium Ion Channels

Published on: December 13, 2024

1.8K

Area of Science:

  • Neuroscience
  • Computational Biology
  • Data Science

Background:

  • Calcium imaging allows simultaneous recording from large neuron populations.
  • Accurate spike detection from calcium data is crucial for neuroscience research.
  • Existing deconvolution methods can be computationally intensive.

Purpose of the Study:

  • To develop a faster algorithm for spike deconvolution from calcium imaging data.
  • To accurately estimate neuron spike rates and precise spike times.
  • To provide a robust method for analyzing neural activity.

Main Methods:

  • Focuses on a formulation based on L0 optimization for spike train inference.
  • Developed a significantly faster algorithm for deconvolution.
  • Incorporated a modification to prevent negative spike predictions.

Main Results:

  • The algorithm can deconvolve fluorescence traces of 100,000 timesteps in under a second.
  • Demonstrated performance on benchmark calcium imaging datasets.
  • The method was successfully applied in a major neuroscience publication.

Conclusions:

  • The new algorithm offers a substantial speed improvement for spike deconvolution.
  • This advancement facilitates more efficient and accurate analysis of neural activity.
  • Publicly available implementations in C++, R, and Python will aid widespread adoption.