Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 204

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Distributed fusion in sensor networks

Cetin, M., Lei Chen, Fisher, J.W., Ihler, A.T., Moses, R.L., Wainwright, M.J., Willsky, A.S. · 2006 · IEEE Signal Processing Magazine

Abstract

This paper presents an overview of research conducted to bridge the rich field of graphical models with the emerging field of data fusion for sensor networks. Both theoretical issues and prototyping applications are discussed in addition to suggesting new lines of reasoning.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/msp.2006.1657816

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

  • Factor graphs and the sum-product algorithm

    Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×

    “In our work we have applied a variety of different algorithms to solve this problem, including the sum-product algorithm [21] for the computation of approximate marginals, the max-product algorithm [31] for the computation of approximate MAP estimates, and the TRMP algorithm [31] for the computation of the true MAP es…”
    Method

Show all 1 references

Cited by

See all 204

Metadata

Authors
Cetin, M., Chen, L., Fisher, J. W., Ihler, A. T., Moses, R. L., Wainwright, M. J., & Willsky, A. S.
Venue
IEEE Signal Processing Magazine
Published
2006-07
Volume
23
Issue
4
Pages
42-55
ISSN
1053-5888 (ISSN-L)
OpenAlex
W2103227205
Cited by
204
References
1
FWCI
21.43
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Distributed fusion in sensor networks. https://app.cochat.ai/papers/10.1109/msp.2006.1657816
The paper
Cetin, M., Chen, L., Fisher, J. W., Ihler, A. T., Moses, R. L., Wainwright, M. J., & Willsky, A. S. (2006). Distributed fusion in sensor networks. IEEE Signal Processing Magazine. https://doi.org/10.1109/msp.2006.1657816

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.