Detecting Markov Random Fields Hidden in White Noise
classification
🧮 math.ST
stat.TH
keywords
detectinggaussianhiddenmarkovnoiserandomwhitebounds
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.