🏆 Finalist — NIH Data Sharing Index (“S-Index”) Challenge
Demo corpus. Scores are computed on a select set of biomedical paper/datasets and may be inaccurate for papers outside this corpus — DataRank relies on network effects that improve with scale. We aim to expand this into a fully open resource pending additional funding.

Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

IEEE Transactions on Pattern Analysis and Machine Intelligence(1984)10.1109/tpami.1984.4767596Source: DataRank Database

Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images is a research paper published in IEEE Transactions on Pattern Analysis and Machine Intelligence (1984). On theSindex it has a DataRank of 1.5. It has been cited 17,949 times.

N/A
1.5DataRank · unranked
1.5
17949 citations · base score 9.8
Cite:
datarank_citation_only_1hop_v6· scope data_onlyMethodology

Abstract

We make an analogy between images and statistical mechanics systems. Pixel gray levels and the presence and orientation of edges are viewed as states of atoms or molecules in a lattice-like physical system. The assignment of an energy function in the physical system determines its Gibbs distribution. Because of the Gibbs distribution, Markov random field (MRF) equivalence, this assignment also determines an MRF image model. The energy function is a more convenient and natural mechanism for embodying picture attributes than are the local characteristics of the MRF. For a range of degradation mechanisms, including blurring, nonlinear deformations, and multiplicative or additive noise, the posterior distribution is an MRF with a structure akin to the image model. By the analogy, the posterior distribution defines another (imaginary) physical system. Gradual temperature reduction in the physical system isolates low energy states (``annealing''), or what is the same thing, the most probable states under the Gibbs distribution. The analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations. The result is a highly parallel ``relaxation'' algorithm for MAP estimation. We establish convergence properties of the algorithm and we experiment with some simple pictures, for which good restorations are obtained at low signal-to-noise ratios.

Data sources & pipeline
Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring
Enrichment:Pending

FAIR Checklist

Context only (not used in score)
Findable (1/2)
  • Has DOI
Accessible (0/2)
    Interoperable (0/2)
      Reusable (0/3)

        FAIR checklist signals are shown for context only and do not affect DataRank scoring.

        DataRank Breakdown

        Base Score 100%Citation Network 0%

        Base Score Contribution

        1.5

        From this paper's citation signal

        Citation Network Contribution

        0

        Citation network not refreshed for this result

        This paper's DataRank is currently driven only by its base citation score. Citation network data was not refreshed for this result.

        Learn more about DataRank methodology →
        Why this DataRank?

        DataRank blends this paper's own citation count with the influence of the papers that cite it. Here, roughly 100% comes from its base citations and 0% from the citation network.

        Base score B(p)
        log1p(citation_count) — grows sub-linearly, so a paper with 1,000 citations is not 10× a paper with 100.
        Network N(p)
        Σ over citers of log1p(Cq) ÷ max(outdegreeq, 1). Being cited by a highly-cited paper with few references counts most.
        Damping factor d = 0.85
        DataRank = (1−d)·B(p) + d·N(p) — the two cards above are each already multiplied by their share.
        Self-citations excluded
        Citers sharing any OpenAlex author ID with this paper are filtered out before the network sum.

        Citers are pulled from OpenAlex sorted by cited_by_count:descand capped per paper, so when the cap binds we keep the highest-signal references and the score is reproducible across reruns.

        Read the full methodology →

        Authors (2)

        Donald Geman,Stuart Geman