Topic
Markov random field
About: Markov random field is a research topic. Over the lifetime, 5669 publications have been published within this topic receiving 179568 citations. The topic is also known as: MRF.
Papers published on a yearly basis
Papers
More filters
••
01 Jan 2016
42 citations
••
TL;DR: In this article, two classification approaches were investigated for the mapping of tropical forests from Landsat-TM data of a region north of Manaus in the Brazilian state of Amazonas.
Abstract: Two classification approaches were investigated for the mapping of tropical forests from Landsat-TM data of a region north of Manaus in the Brazilian state of Amazonas. These incorporated textural information and made use of fuzzy approaches to classification. In eleven class classifications the texture-based classifiers (based on a Markov random field model) consistently provided higher classification accuracies than conventional per-pixel maximum likelihood and minimum distance classifications, indicating that they are more able to characterize accurately several regenerating forest classes. Measures of the strength of class memberships derived from three classification algorithms (based on the probability density function, a posteriori probability and the Mahalanobis distance) could be used to derive fuzzy image classifications and be used in post-classification processing. The latter, involving either the summation of class memberships over a local neighbourhood or the application of homogene...
42 citations
•
25 Oct 2006TL;DR: In this article, a Markov Random Field (MRF)-based technique is described for performing clustering of images characterized by poor or limited data, which is a statistical classification model that labels the image pixels based on the description of their statistical and contextual information.
Abstract: A Markov Random Field (MRF)-based technique is described for performing clustering of images characterized by poor or limited data. The proposed method is a statistical classification model that labels the image pixels based on the description of their statistical and contextual information. Apart from evaluating the pixel statistics that originate from the definition of the K-means clustering scheme, the model expands the analysis by the description of the spatial dependence between pixels and their labels (context), hence leading to the reduction of the inhomogeneity of the segmentation output with respect to the result of pure K-means clustering.
42 citations
••
TL;DR: This work proposes a new method for error concealment of shape information in MPEG-4 video bit streams that are transmitted over error prone channels that employs a MAP estimator with a Markov random field as the image a priori model.
Abstract: We propose a new method for error concealment of shape information in MPEG-4 video bit streams that are transmitted over error prone channels. The proposed method employs a MAP estimator with a Markov random field (MRF) as the image a priori model. The MRF is designed for binary shape information and its parameters are adapted based on the information of neighboring blocks. Our experimental results show that the proposed concealment method restores missing shape blocks with high accuracy. Compared to the median filtering method, our method restores 20% more missing shape data, with a much greater subjective improvement. The proposed algorithm requires a relatively small number of integer multiplications and additions and simple logic operations, making it suitable for real-time implementations.
42 citations
••
06 Sep 2014TL;DR: This work adapts keypoint detectors to better suit the needs of graph-based matching, and achieves better graph constraints by exploiting more information from their keypoints, and proposes a method to identify many mismatches a posteriori based on Left-Right Consistency.
Abstract: An error occurs in graph-based keypoint matching when keypoints in two different images are matched by an algorithm but do not correspond to the same physical point. Most previous methods acquire keypoints in a black-box manner, and focus on developing better algorithms to match the provided points. However to study the complete performance of a matching system one has to study errors through the whole matching pipeline, from keypoint detection, candidate selection to graph optimisation. We show that in the full pipeline there are six different types of errors that cause mismatches. We then present a matching framework designed to reduce these errors. We achieve this by adapting keypoint detectors to better suit the needs of graph-based matching, and achieve better graph constraints by exploiting more information from their keypoints. Our framework is applicable in general images and can handle clutter and motion discontinuities. We also propose a method to identify many mismatches a posteriori based on Left-Right Consistency inspired by stereo matching due to the asymmetric way we detect keypoints and define the graph.
42 citations