The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
PAMPAS: real-valued graphical models for computer vision
Abstract
Probabilistic models have been adopted for many computer vision applications, however inference in high-dimensional spaces remains problematic. As the state-space of a model grows, the dependencies between the dimensions lead to an exponential growth in computation when performing inference. Many common computer vision problems naturally map onto the graphical model framework; the representation is a graph where each node contains a portion of the state-space and there is an edge between two nodes only if they are not independent conditional on the other nodes in the graph. When this graph is sparsely connected, belief propagation algorithms can turn an exponential inference computation into one, which is linear in the size of the graph. However belief propagation is only applicable when the variables in the nodes are discrete-valued or jointly represented by a single multivariate Gaussian distribution, and this rules out many computer vision applications. This paper combines belief propagation with ideas from particle filtering; the resulting algorithm performs inference on graphs containing both cycles and continuous-valued latent variables with general conditional probability distributions. Such graphical models have wide applicability in the computer vision domain and we test the algorithm on example problems of low-level edge linking and locating jointed structures in clutter.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
CONDENSATION—Conditional Density Propagation for Visual Tracking
Isard, M., & Blake, A. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008078328650 · Cited by 4,886
Self-citationHierarchical Bayesian inference in the visual cortex
Lee, T. S., & Mumford, D. (2003) · Journal of the Optical Society of America A · doi:10.1364/josaa.20.001434 · Cited by 1,473 · cited 1×
“In fact, researchers in the biological vision domain have recently proposed a hierarchical probabilistic structure to model human vision which maps closely onto our algorithmic framework [17].”
BackgroundStochastic completion fields: A neural model of illusory contour shape and salience.
Williams, L. R., & Jacobs, D. W. (1997) · Neural Computation · doi:10.1162/neco.1997.9.4.837 · Cited by 331
Cited by
Hierarchical Bayesian inference in the visual cortex
Lee, T. S., & Mumford, D. (2003) · Journal of the Optical Society of America A · doi:10.1364/josaa.20.001434 · Cited by 1,473
Nonparametric belief propagation for self-localization of sensor networks
Ihler, A. T., Fisher, J. W., Moses, R. L., & Willsky, A. S. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.843548 · Cited by 537
Nonparametric belief propagation
Sudderth, E. B., Ihler, A. T., Freeman, W. T., & Willsky, A. S. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211409 · Cited by 413
Sigal, L., Bhatia, S., Roth, S., Black, M. J., & Isard, M. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315063 · Cited by 391
Self-citation50 Years of object recognition: Directions forward
Andreopoulos, A., & Tsotsos, J. K. (2013) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2013.04.005 · Cited by 347
Metadata
- Authors
- Isard, M.
- Venue
- 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.
- Publisher
- IEEE Comput. Soc
- Published
- 2003-11-04
- Pages
- I-613-I-620
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2108190040
- Cited by
- 192
- References
- 3
- FWCI
- 17.68
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: PAMPAS: real-valued graphical models for computer vision. https://app.cochat.ai/papers/10.1109/cvpr.2003.1211410
- The paper
- Isard, M. (2003). PAMPAS: real-valued graphical models for computer vision. 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. https://doi.org/10.1109/cvpr.2003.1211410
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.