2016 IEEE Statistical Signal Processing Workshop (SSP) 2016
DOI: 10.1109/ssp.2016.7551766
|View full text |Cite
|
Sign up to set email alerts
|

Robust Markov Random Field outlier detection and removal in subsampled images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…We also utilized a probability-based outlier detection algorithm to clean KFD data, similar to the method proposed by McCool et al ( McCool et al, 2016 ). Initially, the KFD was calculated without explicitly checking the data quality.…”
Section: Methodsmentioning
confidence: 99%
“…We also utilized a probability-based outlier detection algorithm to clean KFD data, similar to the method proposed by McCool et al ( McCool et al, 2016 ). Initially, the KFD was calculated without explicitly checking the data quality.…”
Section: Methodsmentioning
confidence: 99%
“…However, the underlying covariance structure needs to consider too many neighbouring points to attain sufficient smoothing, which involves a prohibitive computational load. In order to obtain similar results with a lower computational burden, we propose to exploit the connected-surface structure to define a nearest neighbour Gaussian Markov random field (GMRF), similar to the one used by McCool et al in [31]. First, we alleviate the difficulties induced by the positivity constraint of the intensity values by introducing the following change of variables, which is a standard choice in spatial statistics dealing with Poisson noise (see [39,Chapter 4]) m n = log(r n ) n = 1, .…”
Section: Intensity Prior Modelmentioning
confidence: 99%
“…Moreover, the combination of these two processes implicitly defines a connected-surface structure that is used to efficiently sample the posterior distribution. To promote smoothness between reflectivities of points in the same surface, we define a nearest neighbour Gaussian Markov random field (GMRF) prior model, similar to the one proposed in [31]. Inference about the posterior distribution of points, their marks and the background level is done by an RJ-MCMC algorithm [11,Chapter 9], with carefully tailored moves to obtain high acceptance rates, ensuring better mixing and faster convergence rate.…”
Section: Introductionmentioning
confidence: 99%
“…Outlier/anomaly detection problems can usually be addressed using unsupervised or supervised methods [1]. In unsupervised approaches, the objects/anomalies to be detected are learned from the data by fitting them with suitable distributions without using explicitly-provided labels [2][3][4][5][6][7][8][9][10]. On the other hand, considering supervised approaches, the dataset is usually divided into training and testing sets.…”
Section: Introductionmentioning
confidence: 99%