惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
G
Google Developers Blog
Hugging Face - Blog
Hugging Face - Blog
博客园 - 【当耐特】
S
SegmentFault 最新的问题
宝玉的分享
宝玉的分享
博客园 - Franky
博客园_首页
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
WordPress大学
WordPress大学
有赞技术团队
有赞技术团队
月光博客
月光博客
博客园 - 聂微东
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
小众软件
小众软件
Microsoft Security Blog
Microsoft Security Blog
Last Week in AI
Last Week in AI
Vercel News
Vercel News
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
爱范儿
爱范儿
J
Java Code Geeks
博客园 - 叶小钗
Engineering at Meta
Engineering at Meta
阮一峰的网络日志
阮一峰的网络日志

eess.SP updates on arXiv.org

ECG-biometrics-bench: A Unified Framework for Reproducible Benchmarking of ECG Biometrics Physiology-Aware Masked Cross-Modal Reconstruction for Biosignal Representation Learning Towards Improving Speaker Distance Estimation through Generative Impulse Response Augmentation Federated Learning with Hypergradient-based Online Update of Aggregation Weights Soft Graph Diffusion Transformer for MIMO Detection SPLICE: Latent Diffusion over JEPA Embeddings for Conformal Time-Series Inpainting Sequential Inference for Gaussian Processes: A Signal Processing Perspective Statistical Channel Fingerprint Construction for Massive MIMO: A Unified Tensor Learning Framework Recent Advances in mm-Wave and Sub-THz/THz Oscillators for FutureG Technologies Cross-Subject Generalization for EEG Decoding: A Survey of Deep Learning Methods Super-resolution Multi-signal Direction-of-Arrival Estimation by Hankel-structured Sensing and Decomposition Hankel and Toeplitz Rank-1 Decomposition of Arbitrary Matrices with Applications to Signal Direction-of-Arrival Estimation Adaptive Transform Coding for Semantic Compression EdgeSpike: Spiking Neural Networks for Low-Power Autonomous Sensing in Edge IoT Architectures Sparse Graph Learning from Sparse Data via Fiedler Number Maximization A Deep Learning Model for Battery State Prediction towards Intelligent Energy Management Transfer Learning for Tonal Noise Prediction in VRF Units Using Thermodynamic and Vibration Signals EVT-Based Generative AI for Tail-Aware Channel Estimation Monitoring exposure-length variations in submarine power cables using distributed fiber-optic sensing BandRouteNet: An Adaptive Band Routing Neural Network for EEG Artifact Removal Phase-Separated Complex Hilbert PCA on Markerless 3D Pose Estimation Data: A Global Phase Network and Its Extension to a Continuous Field on the Body Surface Selective Correlation Based Knowledge Distillation for Ground Reaction Force Estimation Deep Learning-Enabled Dissolved Oxygen Sensing in Biofouling Environments for Ocean Monitoring Speech Enhancement Based on Drifting Models Robust and Clinically Reliable EEG Biomarkers: A Cross Population Framework for Generalizable Parkinson's Disease Detection An AI-Based Supervisory Measurement Integrity Validation Layer for Cyber-Resilient AC/DC Protection in Inverter-Based Microgrids Explainable AI in Speaker Recognition -- Making Latent Representations Understandable Time-Localized Parametric Decomposition of Respiratory Airflow for Sub-Breath Analysis NAKUL-Med: Spectral-Graph State Space Models with Dynamics Kernels for Medical Signals An Algorithm for On-Sensor Agnostic Detection of Changes in Human Activity for Ultra-Low-Power Applications
Near-Optimal Coded Apertures for Imaging via Nazarov's Th...
Ganesh Ajjanagadde, Christos Thrampoulidis, Adam Yedidia, Gregor · 2018-10-31 · via eess.SP updates on arXiv.org

We characterize the fundamental limits of coded aperture imaging systems up to universal constants by drawing upon a theorem of Nazarov regarding Fourier transforms. Our work is performed under a simple propagation and sensor model that accounts for thermal and shot noise, scene correlation, and exposure time. Focusing on mean square error as a measure of linear reconstruction quality, we show that appropriate application of a theorem of Nazarov leads to essentially optimal coded apertures, up to a constant multiplicative factor in exposure time. Additionally, we develop a heuristically efficient algorithm to generate such patterns that explicitly takes into account scene correlations. This algorithm finds apertures that correspond to local optima of a certain potential on the hypercube, yet are guaranteed to be tight. Finally, for i.i.d. scenes, we show improvements upon prior work by using spectrally flat sequences with bias. The development focuses on 1D apertures for conceptual clarity; the natural generalizations to 2D are also discussed.