← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
分类依据题名和摘要中的方法词与领域语境，不使用期刊名称猜测研究方向。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
关注这篇论文的作者
原文摘要
Digital deconvolution concerns the restoration of an underlying discrete signal from a blurred noisy observation sequence. The problem can be formulated in a Bayesian framework. As is usual in the Bayesian context, the computation of relevant posterior quantities is the major challenge. Previous work made substantial progress toward making this computation feasible, most notably through the Gibbs sampling approach of Chen and Li and the sequential importance sampling approach of Liu and Chen. Yet, there is room for improvement, because both global Monte Carlo strategies can be very slow to reach the target distribution. We propose two new sampling strategies for efficient restoration of digital signals. The key idea is to use inverse filtering to transform the posterior integration into a problem that is substantially more local than the direct formulation, leading to stable Monte Carlo procedures that are very fast to converge. In the final section, we consider extensions to the case of blind deconvolution, where the filter coefficients are unknown and must be estimated as the signal is being restored.