EUVIMEDEUVIMED entdecken
Crossref

Disentangled Noisy Correspondence Learning

Zhuohang Dang, Minnan Luo, Jihong Wang, Chengyou Jia, Haochen Han, Herun Wan, Guang Dai, Xiaojun Chang, Jingdong Wang

IEEE Transactions on Image Processing · 2025 · 34 · 2602-2615

DOI: 10.1109/tip.2025.3559457 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Image Processing, 2025. Verfasst von Zhuohang Dang und 8 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 80 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Shaanxi Province, Key Research and Development Project in Shaanxi Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China
  • Natural Science Foundation of Shaanxi Province
  • Key Research and Development Project in Shaanxi Province
  • Project of China Knowledge Center for Engineering Science and Technology
  • Project of Chinese academy of engineering “The Online and Offline Mixed Educational Service System for ‘The Belt and Road’ Training in MOOC China", and the K.…

Zitieren

APA

Dang, Z., Luo, M., Wang, J., Jia, C., Han, H., Wan, H., Dai, G., Chang, X., & Wang, J. (2025). Disentangled Noisy Correspondence Learning. IEEE Transactions on Image Processing, 34, 2602-2615. https://doi.org/10.1109/tip.2025.3559457

Vancouver

Dang Z, Luo M, Wang J, Jia C, Han H, Wan H, et al. Disentangled Noisy Correspondence Learning. IEEE Transactions on Image Processing. 2025;34:2602-2615. doi:10.1109/tip.2025.3559457

BibTeX
@article{Dang2025,
  author = {Dang, Zhuohang and Luo, Minnan and Wang, Jihong and Jia, Chengyou and Han, Haochen and Wan, Herun and Dai, Guang and Chang, Xiaojun and Wang, Jingdong},
  title = {Disentangled Noisy Correspondence Learning},
  journal = {IEEE Transactions on Image Processing},
  year = {2025},
  volume = {34},
  pages = {2602--2615},
  doi = {10.1109/tip.2025.3559457}
}
Kostenlos starten →