|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2
Efficient Graphical Models for Processing Images
Washington, D.C., USA
June 27-July 02
ISBN: 0-7695-2158-4
| ASCII Text | x | ||
| Marshall F. Tappen, Bryan C. Russell, William T. Freeman, "Efficient Graphical Models for Processing Images," 2012 IEEE Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 673-680, 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2, 2004. | |||
| BibTex | x | ||
| @article{ 10.1109/CVPR.2004.89, author = {Marshall F. Tappen and Bryan C. Russell and William T. Freeman}, title = {Efficient Graphical Models for Processing Images}, journal ={2012 IEEE Conference on Computer Vision and Pattern Recognition}, volume = {2}, year = {2004}, issn = {1063-6919}, pages = {673-680}, doi = {http://doi.ieeecomputersociety.org/10.1109/CVPR.2004.89}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE Conference on Computer Vision and Pattern Recognition TI - Efficient Graphical Models for Processing Images SN - 1063-6919 SP673 EP680 A1 - Marshall F. Tappen, A1 - Bryan C. Russell, A1 - William T. Freeman, PY - 2004 KW - null VL - 2 JA - 2012 IEEE Conference on Computer Vision and Pattern Recognition ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CVPR.2004.89
Graphical models are powerful tools for processing images. However, the large dimensionality of even local image data poses a difficulty: representing the range of possible graphical model node variables with discrete states leads to an overwhelmingly large number of states for the model, often making both exact and approximate inference computationally intractable. We propose a representation that allows a small number of discrete states to represent the large number of possible image values at each pixel or local image patch. Each node in the graph represents the best regression function, chosen from a set of candidate functions, for estimating the unobserved image pixels from the observed samples. This permits a small number of discrete states to summarize the range of possible image values at each point in the image. Belief propagation is then used to find the best regressor to use at each point. To demonstrate the usefulness of this technique, we apply it to two problems: super-resolution and color demosaicing. In both cases, we find our method compares well against other techniques for these problems.
Citation:
Marshall F. Tappen, Bryan C. Russell, William T. Freeman, "Efficient Graphical Models for Processing Images," cvpr, vol. 2, pp.673-680, 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.
