Results 221 to 230 of about 25,302 (256)
Some of the next articles are maybe not open access.
1995
Low level processing is performed on regular lattices of images. The set of sites S = {1,..., m} index image pixels in the image plane. The set L contains continuous or discrete labels for the pixels. Therefore the problems fall into categories LP1 and LP2. Most existing MRF vision models are for low level processing.
openaire +1 more source
Low level processing is performed on regular lattices of images. The set of sites S = {1,..., m} index image pixels in the image plane. The set L contains continuous or discrete labels for the pixels. Therefore the problems fall into categories LP1 and LP2. Most existing MRF vision models are for low level processing.
openaire +1 more source
SPIE Proceedings, 2011
Deterministic final polishing of high precision optics using sub-aperture processing with magnetorheological finishing (MRF) is an accepted practice throughout the world. A wide variety of materials can be successfully worked with aqueous (pH 10), magnetorheological (MR) fluids, using magnetic carbonyl iron (CI) and either ceria or nanodiamond ...
openaire +1 more source
Deterministic final polishing of high precision optics using sub-aperture processing with magnetorheological finishing (MRF) is an accepted practice throughout the world. A wide variety of materials can be successfully worked with aqueous (pH 10), magnetorheological (MR) fluids, using magnetic carbonyl iron (CI) and either ceria or nanodiamond ...
openaire +1 more source
Adaptive Features for MRF based Cosegmentation
Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication, 2016Cosegmentation is a problem of specifying common objects from a set of images. The challenge of cosegmentation is addressed in substantial variation of the object's appearance such as shape, color, or scale. In this paper, we propose superpixel-level features which combine both color histogram and dense Sift features, is named SP-dcoSift feature.
Huong Ninh, Guee-Sang Lee
openaire +1 more source
CDC-MRF for Hyperspectral Data Classification
2018This paper presents a new hyperspectral classification algorithm based on convolutional neural network (CNN). A CNN is first used to learn the posterior class distributions using a patch-wise training strategy to better utilize the spatial information.
Yuanyuan Li +4 more
openaire +1 more source
Solving MRF Minimization by Mirror Descent
2012Markov Random Fields (MRF) minimization is a well-known problem in computer vision. We consider the augmented dual of the MRF minimization problem and develop a Mirror Descent algorithm based on weighted Entropy and Euclidean Projection. The augmented dual problem consists of maximizing a non-differentiable objective function subject to simplex and ...
Duy V. N. Luong +3 more
openaire +1 more source
1995
A probabilistic distribution function has two essential elements: the form of the function and the involved parameters. For example, the joint distribution of an MRF is characterized by a Gibbs function with a set of clique potential parameters; and the noise by a zero-mean Gaussian distribution parameterized by a variance.
openaire +1 more source
A probabilistic distribution function has two essential elements: the form of the function and the involved parameters. For example, the joint distribution of an MRF is characterized by a Gibbs function with a set of clique potential parameters; and the noise by a zero-mean Gaussian distribution parameterized by a variance.
openaire +1 more source
Search Space Reduction for MRF Stereo
2008We present an algorithm to reduce per-pixel search ranges for Markov Random Fields-based stereo algorithms. Our algorithm is based on the intuitions that reliably matched pixels need less regularization in the energy minimization and neighboring pixels should have similar disparity search ranges if their pixel values are similar.
Liang Wang 0002 +2 more
openaire +2 more sources
MRF clustering for segmentation of color images
Pattern Recognition Letters, 2002Summary: A segmentation algorithm has been described based on Markov Random Field (MRF) processing. The images are segmented initially by growing regions of similar color values. Then a general framework for refining initial clusters in a feature space using MRF processing is presented and subsequently, the algorithm for MRF processing in the color ...
openaire +3 more sources

