.png){kind=icon}
返回
Private Filtering for Hidden Markov Models
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2018.2827878.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Consider a hidden Markov model describing a system with two types of states: a monitored state and a private state. The two types of states are dependent and evolve jointly according to a Markov process with a stationary transition probability. It is desired to reveal the monitored states to a receiver but hide the private states. For this purpose, a privacy filter is necessary which suitably perturbs the monitored states before communication with the receiver. Our objective is to design the privacy filter to optimize the tradeoff between the monitoring accuracy and privacy, measured through a time-invariant distortion measure and Shannon's equivocation, respectively. As the optimal privacy filter is difficult to compute using the dynamic programming, we adopt a suboptimal greedy approach through which the privacy filter can be computed efficiently. Here, the greedy approach has the additional advantage of not being restricted to the finite time horizon setups. Simulations show the superiority of the approach compared to a privacy filter which only adds independent noise to the observations.
Keyword:
Hidden Markov models
privacy
dynamic programming
greedy algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
The training of verb production in Broca's aphasia: A multiple‐baseline across‐behaviours study.png)
Aphasiology
AphasiologyIF0
PREAI
分享收藏
Preparation and Characterization of Inclusion Complexes of Poly(propylene glycol) with Cyclodextrins
PREAI
分享收藏
查看更多内容