跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+479新增论文
+361其中 AI 相关
+64已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 21:56各信源进度 →

统计口径与数据新鲜度

统计 2026-11-16 03:24 — 2026-11-17 03:24(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 21:56库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,827 已收录论文19,941 AI 相关6,922 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v3arXiv:2610.09472

Second-Order Image Characterization with Distortion and Secrecy

Cao Daming

原文摘要

Image characterization relates coding budgets to the probability carried by source cells and their output images. At second order, refining a cell can reveal unavailable information, while a change of reference measure can alter the relevant likelihood fluctuations. We establish image bounds that account for both effects. A finite-block partition theorem bounds the cost of merging component images by the joint conditional information spectrum of their label. It preserves continuous second-order profiles when that cost is negligible on the square-root blocklength scale. For reconstruction constraints, cell-dependent reference measures retain the actual distortion deficits in a single likelihood. A Gaussian evaluation gives matching second-order rates for Heegard--Berger coding with one uninformed decoder in the strict both-active regime, common reconstruction under a joint agreement and distortion criterion, and two-stage refinement with side information absent at the first decoder. A structured binary source illustrates partition stability even when its global density and conditional-divergence deficits are linear in blocklength. Posterior-mass images also sharpen extraction after a public refinement by charging its residual information rather than its alphabet size. These results preserve the joint constraints and the observations available for choosing the local coding experiment.

cs.IT