Detecting Markov Random Fields Hidden in White Noise
Ery Arias-Castro, S\'ebastien Bubeck, G\'abor Lugosi, Nicolas, Verzelen

TL;DR
This paper addresses the challenge of detecting Gaussian Markov random fields embedded in white noise, providing theoretical bounds and near-optimal detection methods for applications in time series and image analysis.
Contribution
It introduces minimax lower bounds and develops near-optimal tests for detecting hidden Gaussian Markov random fields in noisy environments.
Findings
Derived minimax lower bounds for detection
Proposed near-optimal detection tests
Applicable to time series and image analysis
Abstract
Motivated by change point problems in time series and the detection of textured objects in images, we consider the problem of detecting a piece of a Gaussian Markov random field hidden in white Gaussian noise. We derive minimax lower bounds and propose near-optimal tests.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
