Related Experiment Video
Updated: Dec 20, 2025

09:39
Successful In vivo Calcium Imaging with a Head-Mount Miniaturized Microscope in the Amygdala of Freely Behaving Mouse
Published on: August 26, 2020
12.1K
Exact box-counting and temporal sampling algorithms for fractal dimension estimation with applications to animal
1Department of Pharmacology and Physiology, Georgetown University Medical Center, Washington, 20007, D.C., USA.
Summary
We developed new algorithms to measure animal movement complexity using fractal dimension (FD). Mutations in the schizophrenia-associated gene Dysbindin significantly increase FD in Drosophila larvae, indicating motor function impairments.
Area of Science:
- Quantitative Biology
- Biophysics
- Computational Neuroscience
Background:
- Fractal dimension (FD) quantifies complexity in natural systems.
- Assessing animal movement complexity is crucial for understanding behavior and disease.
- Existing methods for FD estimation may lack accuracy with high-resolution movement data.
Purpose of the Study:
- To develop novel algorithms for accurate fractal dimension estimation of animal movement.
- To introduce methods for handling spatial and temporal sampling in movement data.
- To investigate the impact of the Dysbindin gene on movement complexity in Drosophila larvae.
Main Methods:
- Developed an oversampling technique using linear interpolation for movement paths.
- Introduced an exact box-counting algorithm for piecewise linear paths.
- Proposed a temporal sampling method for calculating FD in the temporal domain.
- Employed dual total least squares for optimal scale selection in FD comparisons.
Main Results:
- The novel algorithms provide accurate FD estimations for animal movement.
- The study identified significant increases in FD for Drosophila larvae with Dysbindin mutations.
- FD was shown to be a sensitive metric for detecting motor function alterations.
Conclusions:
- Fractal dimension is a robust metric for quantifying animal movement complexity.
- Dysbindin gene mutations are associated with increased movement complexity, suggesting motor impairments.
- The developed algorithms enhance the application of FD analysis in behavioral studies.
Related Concept Videos
Sampling Theorem
1.2K
In signal processing, the analysis of continuous-time signals, denoted as x(t), often involves sampling techniques to convert these signals into discrete-time signals. This process is essential for digital representation and manipulation. A critical component in sampling is the train of impulses, characterized by the sampling interval and the sampling frequency. The relationship between these parameters and the original signal's properties dictates the success of the sampling process.
1.2K
Downsampling
526
When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
526
Discrete-Time Fourier Series
570
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
570

