Fully-Connected CRFs with Non-Parametric Pairwise Potential
Conditional Random Fields (CRFs) are used for diverse tasks, ranging from image denoising to object recognition. For images, they are commonly defined as a graph with nodes corresponding to individual pixels and pairwise links that connect nodes to their immediate neighbors. Recent work has shown that fully-connected CRFs, where each node is connected to every other node, can be solved efficiently under the restriction that the pairwise term is a Gaussian kernel over a Euclidean feature space. In this paper, we generalize the pairwise terms to a non-linear dissimilarity measure that is not required to be a distance metric. To this end, we propose a density estimation technique to derive conditional pairwise potentials in a nonparametric manner. We then use an efficient embedding technique to estimate an approximate Euclidean feature space for these potentials, in which the pairwise term can still be expressed as a Gaussian kernel. We demonstrate that the use of non-parametric models for the pairwise interactions, conditioned on the input data, greatly increases expressive power whilst maintaining efficient inference.
Code (0)
등록된 구현이 없습니다.
Tasks
DenoisingDensity EstimationImage DenoisingObject RecognitionSimilar Papers 제목 키워드 기반
Efficient Inference in Fully Connected CRFs with Gaussian Edge Potentials
Most state-of-the-art techniques for multi-class image segmentation and labeling use conditional random fields defined over pixels or image regions. While region-level models often feature dense pairwise connectivity, pi…
Image SegmentationSegmentationSemantic SegmentationStructured Learning of Tree Potentials in CRF for Image Segmentation
We propose a new approach to image segmentation, which exploits the advantages of both conditional random fields (CRFs) and decision trees. In the literature, the potential functions of CRFs are mostly defined as a linea…
Image SegmentationSemantic SegmentationNeW CRFs: Neural Window Fully-connected CRFs for Monocular Depth Estimation
Estimating the accurate depth from a single image is challenging since it is inherently ambiguous and ill-posed. While recent works design increasingly complicated and powerful networks to directly regress the depth map,…
DecoderDepth EstimationDepth PredictionMonocular Depth EstimationNeural Window Fully-Connected CRFs for Monocular Depth Estimation
Estimating the accurate depth from a single image is challenging since it is inherently ambiguous and ill-posed. While recent works design increasingly complicated and powerful networks to directly regress the depth …
DecoderDepth EstimationMonocular Depth EstimationEfficient SDP Inference for Fully-connected CRFs Based on Low-rank Decomposition
Conditional Random Fields (CRF) have been widely used in a variety of computer vision tasks. Conventional CRFs typically define edges on neighboring image pixels, resulting in a sparse graph such that efficient inference…