The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Texture synthesis via a noncausal nonparametric multiscale Markov random field
Abstract
Our noncausal, nonparametric, multiscale, Markov random field (MRF) model is capable of synthesizing and capturing the characteristics of a wide variety of textures, from the highly structured to the stochastic. We use a multiscale synthesis algorithm incorporating local annealing to obtain larger realizations of texture visually indistinguishable from the training texture.
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
Textons, the elements of texture perception, and their interactions
Julesz, B. (1981) · Nature · doi:10.1038/290091a0 · Cited by 1,703 · cited 1×
“Current texture models such as fractal models, auto-models, autoregressive models, moving average models, autoregressive moving average models, do not realistically reproduce natural textures [9], such as those in the Brodatz album [4].”
Background
Cited by
Fast texture synthesis using tree-structured vector quantization
Wei, L.-Y., & Levoy, M. (2000) · Proceedings of the 27th annual conference on Computer graphics and interactive techniques - SIGGRAPH '00 · doi:10.1145/344779.345009 · Cited by 1,356
Fields of Experts: A Framework for Learning Image Priors
Roth, S., & Black, M. J. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.160 · Cited by 1,039
Robust Higher Order Potentials for Enforcing Label Consistency
Kohli, P., Ladický, L., & Torr, P. H. S. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0202-0 · Cited by 853
Roth, S., & Black, M. J. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0197-6 · Cited by 847
Texture optimization for example-based synthesis
Kwatra, V., Essa, I., Bobick, A., & Kwatra, N. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073263 · Cited by 608
Metadata
- Authors
- Paget, R., & Longstaff, I. D.
- Venue
- IEEE Transactions on Image Processing
- Published
- 1998-06
- Volume
- 7
- Issue
- 6
- Pages
- 925-931
- ISSN
- 1057-7149 (ISSN-L)
- OpenAlex
- W2099835437
- Cited by
- 181
- References
- 1
- FWCI
- 3.61
- Type
- journal article
- 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
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.