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

推荐订阅源

WordPress大学
WordPress大学
博客园 - 司徒正美
I
InfoQ
宝玉的分享
宝玉的分享
G
Google Developers Blog
J
Java Code Geeks
Martin Fowler
Martin Fowler
The GitHub Blog
The GitHub Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
罗磊的独立博客
腾讯CDC
F
Fortinet All Blogs
A
About on SuperTechFans
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Recent Announcements
Recent Announcements
Last Week in AI
Last Week in AI
B
Blog RSS Feed
博客园 - 聂微东
D
DataBreaches.Net
Hugging Face - Blog
Hugging Face - Blog
The Cloudflare Blog
L
LangChain Blog
Microsoft Azure Blog
Microsoft Azure Blog
aimingoo的专栏
aimingoo的专栏

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
Shannon information storage in noisy phase-modulated frin...
Manuel Servin, Moises Padilla · 2017-08-23 · via cs.IT updates on arXiv.org

Optical phase-modulated fringe-patterns are usually digitized with XxY pixels and 8 bits/pixel (or higher) gray-levels. The digitized 8 bits/pixel are raw-data bits, not Shannon information bits. Here we show that noisy fringe-patterns store much less Shannon information than the capacity of the digitizing camera. This means that high signal-to-noise ratio (S/N) cameras may waste to noise most bits/pixel. For example one would not use smartphone cameras for high quality phase-metrology, because of their lower (S/N) images. However smartphones digitize high-resolution (12 megapixel) images, and as we show here, the information storage of an image depends on its bandwidth and its (S/N). The standard formalism for measuring information are the Shannon-entropy H, and the Shannon capacity theorem (SCT). According to SCT, low (S/N) images may be compensated with a larger fringe-bandwidth to obtain high-information phase measurements. So broad bandwidth fringes may give high quality phase, in spite of digitizing low (S/N) fringe images. Most real-life images are redundant, they have smooth zones where the pixel-value do not change much, and data compression algorithms are paramount for image transmission/storage. Shannon's capacity theorem is used to gauge competing image compression algorithms. Here we show that phase-modulated phase-shifted fringes are highly correlated, and as a consequence, phase-shifting algorithms (PSAs) may be used as fringe-data compressors. Therefore a PSA may compress a large number of phase-shifted fringes into a single complex-valued image. This is important in spaceborne optical/RADAR phase-telemetry where downlink is severely limited by huge distance and low-power downlink. That is, instead of transmitting M phase-shifted fringes, one only transmit the phase-demodulated signal as compressed sensing data.