🔬

Signal Processing

1
Open Unknowns
18
Cross-Domain Bridges
9
Active Hypotheses

Cross-Domain Bridges

Bridge Compressed-sensing theory connects sparse recovery guarantees to accelerated MRI protocol design.

Fields: Computer Vision, Radiology, Signal Processing

Speculative analogy: Restricted-measurement sparse recovery theory can guide MRI acquisition schedules that preserve clinically relevant structure at lower scan times....

Bridge Compressed sensing x Sparse signal recovery — underdetermined systems and L1 minimization

Fields: Computer Science, Mathematics, Signal Processing

Compressed sensing proves that a sparse signal in R^n can be exactly recovered from O(k log n) random linear measurements (far fewer than n) by L1 minimization; this connects the restricted isometry p...

Bridge Delay-embedding reconstructions can transfer from nonlinear dynamics to ICU deterioration early-warning indicators.

Fields: Dynamical Systems, Critical Care, Signal Processing

Speculative analogy: Delay-embedding reconstructions can transfer from nonlinear dynamics to ICU deterioration early-warning indicators....

Bridge Fourier transform x Signal processing — frequency domain as dual representation

Fields: Mathematics, Computer Science, Signal Processing

The discrete Fourier transform (DFT) and its fast algorithm (FFT) provide an exact dual representation of any finite signal in the frequency domain; the convolution theorem (multiplication in frequenc...

Bridge Stochastic resonance x Signal detection — noise-enhanced threshold crossing

Fields: Physics, Neuroscience, Signal Processing

Stochastic resonance — where adding noise to a subthreshold signal improves detection — is the physical mechanism behind mechanoreceptor hair cell bundle noise and neural population coding; the optima...

Bridge Compressed sensing (Candès-Romberg-Tao, Donoho 2006) proves that k-sparse signals in ℝⁿ can be exactly recovered from m = O(k log n/k) random linear measurements via ℓ₁ minimisation — far fewer than the n measurements required by the Shannon-Nyquist theorem — creating a mathematical foundation for sub-Nyquist sampling that has revolutionised MRI, radar, and high-dimensional statistics.

Fields: Mathematics, Computer Science, Statistics, Signal Processing, Applied Mathematics

The Shannon-Nyquist sampling theorem states that a band-limited signal must be sampled at twice the highest frequency to allow perfect reconstruction. For a signal with n degrees of freedom, n measure...

Bridge Discrete convolution — diagonalized by the discrete Fourier transform via the convolution theorem — is the algebraic backbone of convolutional neural networks’ local translation-equivariant layers.

Fields: Mathematics, Computer Science, Signal Processing, Machine Learning

The convolution theorem states that convolution becomes pointwise multiplication in the Fourier domain (with appropriate boundary conditions). CNNs implement spatial convolution with learned kernels, ...

Bridge Mallat's multiresolution analysis and Daubechies compactly-supported wavelets provide an O(N) fast wavelet transform achieving near-optimal signal compression, with JPEG-2000 using 9/7 biorthogonal wavelets for 40:1 compression and Donoho-Johnstone wavelet shrinkage achieving minimax-optimal denoising over Sobolev function classes.

Fields: Mathematics, Engineering, Signal Processing, Harmonic Analysis, Image Processing, Statistics

Wavelets provide a multi-resolution analysis (MRA) of signals: a nested sequence of approximation spaces V_j ⊂ V_{j+1} ⊂ L²(ℝ) with scaling function φ and wavelet ψ satisfying ⟨ψ(·-k), ψ(·-l)⟩ = δ_{kl...

Bridge Persistent homology of RR-interval dynamics provides topology-based early warning for arrhythmia transitions.

Fields: Mathematics, Medicine, Signal Processing, Topology

Topological summaries of sliding-window cardiac time-series can capture state-transition structure missed by threshold statistics. This extends established TDA disease-subtyping ideas into real-time r...

Bridge Fourier Analysis and Wave Mechanics — decomposition of functions into sinusoidal components connects PDE solutions, signal processing, and quantum uncertainty

Fields: Mathematics, Physics, Signal Processing, Quantum Mechanics, Applied Mathematics

The Fourier transform F(ω) = ∫f(t)e^{-iωt}dt decomposes any square-integrable function into sinusoidal components, establishing a bijective correspondence between the time domain and frequency domain....

Bridge Brain-computer interfaces decode motor intentions from cortical population activity using linear decoders (Wiener filter) and Kalman state-space models — Fisher information in the neural population code sets the fundamental accuracy bound, connecting information theory to neural prosthetics engineering.

Fields: Neuroscience, Engineering, Neural Engineering, Information Theory, Signal Processing

BCIs decode intended movement from neural population activity recorded by electrode arrays. Linear decoding: ŷ = Wx + b where x ∈ R^N is the spike rate vector from N neurons, y is decoded kinematics (...

Bridge Kalman filtering — recursive Bayesian state estimation for linear-Gaussian dynamics — maps onto neural circuits that combine a forward prediction with a sensory correction, motivating tractable experimental tests in perception and motor control.

Fields: Neuroscience, Engineering, Signal Processing, Computational Neuroscience

The Kalman filter alternates prediction using a dynamics model with an innovation update weighted by the Kalman gain, minimizing mean-squared estimation error under Gaussian assumptions. Canonical neu...

Bridge Multi-electrode array spike sorting — extracting individual neuron activity from high-density recordings — is a dimensionality reduction problem whose solution reveals that neural population activity lives on a low-dimensional manifold embedded in high-dimensional firing-rate space.

Fields: Systems Neuroscience, Signal Processing, Machine Learning, Dimensionality Reduction, Computational Neuroscience

Modern Neuropixels probes record from 384–960 electrodes simultaneously, capturing spikes from hundreds of neurons. Spike sorting — attributing voltage deflections to individual neurons — proceeds as:...

Bridge Bat echolocation uses frequency-modulated (FM) calls that are mathematically equivalent to FM pulse compression in radar/SONAR engineering: the linear frequency sweep creates a time-bandwidth product that enables range resolution far exceeding a simple tone pulse, and the auditory system computes the ambiguity function implicitly to localize prey.

Fields: Neuroscience, Signal Processing, Sensory Biology

An FM chirp s(t) = A·cos(2π(f₀t + ½μt²)) (μ = chirp rate, BW = μ·T) has pulse compression ratio PCR = BW·T >> 1, giving range resolution δr = c/(2·BW) while retaining high energy (SNR = A²T/(2N₀)) fro...

Bridge Brain-computer interfaces achieve maximum information transfer rate when neural population activity is decoded using optimal Bayesian filters, connecting neuroscience spike train statistics to the signal processing framework of Kalman filtering and Fisher information bounds.

Fields: Neuroscience, Signal Processing, Information Theory

The problem of decoding motor intent from neural population activity is an optimal state estimation problem: spike trains from N neurons encode a low-dimensional movement state x(t) with Fisher inform...

Bridge Spike sorting — decomposing extracellular recordings into contributions from individual neurons — is mathematically identical to blind source separation (ICA/cocktail party problem), with Bayesian spike sorters implementing probabilistic mixture models over waveform shapes and interspike interval statistics.

Fields: Neuroscience, Statistics, Signal Processing, Machine Learning, Electrophysiology

EXTRACELLULAR RECORDING MIXING MODEL: A recording electrode at position x measures a weighted sum of spike waveforms from N nearby neurons: y(t) = Σᵢ Aᵢ · sᵢ(t) + noise where Aᵢ = mixing matrix en...

Bridge Seismic signal detection uses matched filtering and cross-correlation from signal processing theory: a template waveform from a known event is cross-correlated with continuous seismic recordings to detect repeating earthquakes at signal-to-noise ratios far below the detection threshold of traditional STA/LTA methods.

Fields: Seismology, Signal Processing, Geophysics

The matched filter is the optimal linear filter for detecting a known signal s(t) in white Gaussian noise: h(t) = s(T-t) (time-reversed template). The output cross-correlation C(τ) = ∫s(t)·x(t+τ)dt ac...

Bridge Phase-retrieval alternating-projection methods map onto cryo-EM orientation and reconstruction inference loops.

Fields: Signal Processing, Structural Biology, Mathematics

Speculative analogy: Phase-retrieval alternating-projection methods map onto cryo-EM orientation and reconstruction inference loops....

Open Unknowns (1)

Unknown How can brain-computer interface decoders adapt to non-stationary neural signals (caused by learning, electrode drift, and day-to-day variability) without requiring lengthy daily recalibration? u-bci-non-stationarity-adaptation

Active Hypotheses

Hypothesis Adaptive k-space schedules maintain diagnosis-level MRI performance better than fixed undersampling at equal acceleration. high
Hypothesis Transferred methods from `b-phase-retrieval-x-cryoem-orientation-inference` improve target outcomes versus domain-specific baselines at matched cost. high
Hypothesis The information transfer rate of state-of-the-art intracortical BCIs is within a factor of 3 of the Fisher information bound set by the recorded neural population, and the primary limitation is non-stationarity rather than suboptimal decoding, predicting that adaptive decoders that track neural tuning drift will outperform fixed decoders by 2-3x in chronic implant conditions. high
Hypothesis Compressed sensing MRI with undersampling by factor 10× (acquiring 10% of k-space measurements required by Nyquist) achieves diagnostic image quality equivalent to fully-sampled MRI for cardiac, neurological, and musculoskeletal indications when the image reconstruction uses ℓ₁-wavelet minimisation, as validated in randomised controlled clinical trials. high
Hypothesis Sub-Nyquist MRI using compressed sensing achieves 4x-8x scan time reduction by exploiting sparsity of MRI images in the Fourier (k-space) basis high
Hypothesis Deep neural networks implicitly implement compressed sensing by learning measurement matrices that satisfy the RIP for the natural signal manifold, explaining their sample efficiency relative to classical sparse recovery medium
Hypothesis Graph neural networks that incorporate spectral graph Fourier transforms will outperform spatial message-passing GNNs on tasks requiring long-range frequency-dependent features, due to the ability to apply frequency-selective filters to graph signals medium
Hypothesis The spontaneous firing rate of primary auditory nerve fibers is within a factor of 2 of the stochastic resonance optimum predicted by the ratio of detection threshold sound pressure to hair cell thermal noise, across at least 5 mammalian species. medium
Hypothesis Natural images lie in a Besov space B^s_{1,1}(ℝ²) with s ≈ 1, and wavelet thresholding achieves the optimal minimax reconstruction rate n^(-2s/(2s+2)) = n^(-1/2) for this function class, explaining why JPEG-2000 wavelet compression outperforms JPEG-DCT by a constant factor at all compression ratios rather than only at low quality. medium

Know something about Signal Processing? Contribute an unknown or hypothesis →

Generated 2026-05-10 · USDR Dashboard