Learning With Partial and Noisy Correspondence in Graph Matching.

Lin Y, Yang M, Hu P, Lv J, Chen H, Peng X

Open source

DOI
10.1109/tpami.2026.3670236
Published
2026 Jul
Container
IEEE transactions on pattern analysis and machine intelligence
Publisher
Not recorded
Open access
unknown

Credibility signals

limited evidence Score 43/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1109/tpami.2026.3670236,
  title = {Learning With Partial and Noisy Correspondence in Graph Matching.},
  author = {Lin Y and Yang M and Hu P and Lv J and Chen H and Peng X},
  year = {2026},
  journal = {IEEE transactions on pattern analysis and machine intelligence},
  doi = {10.1109/tpami.2026.3670236},
  url = {https://doi.org/10.1109/tpami.2026.3670236}
}

RIS

TY  - JOUR
TI  - Learning With Partial and Noisy Correspondence in Graph Matching.
AU  - Lin Y
AU  - Yang M
AU  - Hu P
AU  - Lv J
AU  - Chen H
AU  - Peng X
PY  - 2026
JO  - IEEE transactions on pattern analysis and machine intelligence
DO  - 10.1109/tpami.2026.3670236
UR  - https://doi.org/10.1109/tpami.2026.3670236
ER  - 

APA

Y, L., M, Y., P, H., J, L., H, C., & X, P. (2026). Learning With Partial and Noisy Correspondence in Graph Matching.. IEEE transactions on pattern analysis and machine intelligence. https://doi.org/10.1109/tpami.2026.3670236

Source records