Graph-based Smoothing

Graph-Based Smoothing is a spatial smoothing technique that utilizes graph structures to model relationships among spatial units, where the smoothing process is performed by leveraging the graph’s topological properties to propagate information from neighboring nodes, thereby reducing noise while preserving spatial coherence.

14

Publications

1.6K

Citations

54

Authors

32

Institutions

Publications per year

2017–2026

7

Authors

54

  1. JS
    James Sharpnack

    University of California, Davis, United States

    2 publications · 47 citations

    2

    h-index

  2. PL
    Peng Li

    Wuhan University, China

    2 publications · 1.1K citations

    2

    h-index

  3. WL
    Wei Li

    University of Electronic Science and Technology of China, China

    2 publications · 1.1K citations

    2

    h-index

  4. YL
    Yankai Lin

    Tsinghua University, China

    2 publications · 1.1K citations

    2

    h-index

  5. DC
    Deli Chen

    The University of Melbourne, Australia

    2 publications · 1.1K citations

    2

    h-index

1–5 of 54

Venues

  1. arXiv (Cornell University)

    Repository · 2 publications · 110 citations

    2

    h-index

  2. IEEE Transactions on Medical Imaging

    2 publications · 129 citations

    2

    h-index

  3. Neural Information Processing Systems

    Conference · 1 publications · 58 citations

    1

    h-index

  4. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 1 publications · 993 citations

    1

    h-index

  5. IEEE Geoscience and Remote Sensing Letters

    GRSL · 1 publications · 22 citations

    1

    h-index

1–5