Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2204.04092

Dynamic super-resolution in particle tracking problems

Ping Liu·Habib Ammari
View original source ↗Read source document ↗Export metadata ↓

Abstract

Particle tracking in biological imaging is concerned with reconstructing the trajectories, locations, or velocities of the targeting particles. The standard approach of particle tracking consists of two steps: first reconstructing statically the source locations in each time step, and second applying tracking techniques to obtain the trajectories and velocities. In contrast, the dynamic reconstruction seeks to simultaneously recover the source locations and velocities from all frames, which enjoys certain advantages. In this paper, we provide a rigorous mathematical analysis for the resolution limit of reconstructing source number, locations, and velocities by general dynamical reconstruction in particle tracking problems, by which we demonstrate the possibility of achieving super-resolution for the dynamic reconstruction. We show that when the location-velocity pairs of the particles are separated beyond certain distances (the resolution limits), the number of particles and the location-velocity pair can be stably recovered. The resolution limits are related to the cut-off frequency of the imaging system, signal-to-noise ratio, and the sparsity of the source. By these estimates, we also derive a stability result for a sparsity-promoting dynamic reconstruction. In addition, we further show that the reconstruction of velocities has a better resolution limit which improves constantly as the particles moving. This result is derived by an observation that the inherent cut-off frequency for the velocity recovery can be viewed as the total observation time multiplies the cut-off frequency of the imaging system, which may lead to a better resolution limit as compared to the one for each diffraction-limited frame. It is anticipated that this observation can inspire new reconstruction algorithms that improve the resolution of particle tracking in practice.

Explore related subjects

eess.SPcs.CV

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ping Liu, Habib Ammari. 2022-04-08. Dynamic super-resolution in particle tracking problems. https://arxiv.org/abs/2204.04092

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Programmable Unitary RF Networks for Narrowband Hybrid Beamforming

Conventional hybrid beamforming architectures are compared with one another and with the fully-digital architecture under the same radiated antenna power. However, the physically relevant power budget is the power supplied by the RF chains to the passive analog beamforming network, which then transfers it to the antenna ports. Some architectures, such as fully-connected architectures, can divert part of this power to terminated ports even under ideal passive-component assumptions, thereby delivering less power to the antenna ports than that supplied by the RF chains. Other architectures, such as partially connected architecture, transfer all RF-chain power to the antenna ports but have restricted beamforming flexibility and therefore do not attain the fully-digital sum-rate optimum in general. Motivated by this RF-chain injected-power and beamforming flexibility viewpoint, this paper proposes a hybrid beamforming architecture that, under ideal passive-component assumptions: i) transfers all RF-chain injected power to the antenna ports without loss; and ii) with continuous phase control and sufficiently many programmable phase layers, attains the fully-digital sum-rate optimum under the same RF-chain injected-power constraint. The proposed hybrid beamforming architecture uses a programmable unitary analog beamforming network realized by interlacing fixed mixing layers with programmable diagonal phase-shifting layers. We compare this architecture with fully-connected, partially connected, and Butler/DFT beam-selection baselines under ideal passive-component assumptions and show numerically that none of these baselines attains the fully-digital sum-rate optimum under the same RF-chain injected-power constraint. Finally, we compare the different architectures when component losses are taken into account and illustrate the balance between beamforming flexibility and accumulated losses.

eess.SP↗
arXiv2026

Revolutionizing 6G Wireless Networks with RISs: Enhancements in Sensing and Communications

Reconfigurable intelligent surfaces (RISs) have emerged as one of the most promising technologies for the next-generation wireless networks, offering advantages such as cost efficiency, low power consumption, flexible deployment, and large effective aperture. Extensive studies have demonstrated the capabilities of RISs to enhance communication performance, including coverage extension, sum-rate improvement, interference suppression, security enhancement, etc. As 6G networks continue to evolve, wireless sensing is expected to play a pivotal role alongside communication. Undoubtedly, RISs possess great potential to enable seamless integration of sensing and communication by supporting both passive and active sensing paradigms. This paper explores how RISs can revolutionize wireless networks by enhancing both communication and sensing capabilities. Specifically, we highlight the fundamental principles, potential applications, and future trends of RIS-assisted integrated sensing and communication (ISAC), anticipating that RIS-enabled ISAC will become a key enabler in the upcoming 6G era.

eess.SP↗
arXiv2026

Protocol Data Unit Header Decoding and Payload Coding Recovery in the Starlink Ku-Band Downlink

Existing Starlink downlink studies describe synchronization, pilots, and predictable waveform elements, but these descriptions do not establish how received header bits specify payload allocations and channel coding. Using 18 frames from one continuous complex-baseband capture spanning approximately 24 ms, we identify two protocol data unit (PDU) header regions in each frame and decode their contents after receiver correction and reference-phase removal. We recover the headers' terminated rate-1/3 convolutional code with constraint length seven and an eight-bit cyclic redundancy check over the concatenated information words. The decoded bits support a conditional 20-bit layout of modulation and coding scheme (MCS) index--length pairs, linking format labels and quantities to subsequent payload regions. Predicted allocation endpoints agree with signal-based estimates in 16 of 18 frames and differ by at most two symbols in the remaining frames. We further recover modulation mappings and equivalent quasi-cyclic low-density parity-check coding relations for several payload formats, including rate-1/2 and rate-5/8 families. Fixed generators predict 78,848, 9,984, and 811,008 parity bits for formats 5, 9, and 21 without disagreement on codewords excluded from their generator fitting. Cross-modulation tests support shared encoders. Formats 28 and 37 have verified shortened cores, with 256 and 384 additional bits unexplained, while format 68 remains unresolved.

eess.SP↗