File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

김영근

Kim, Younggeun
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 7219 -
dc.citation.number 6 -
dc.citation.startPage 7208 -
dc.citation.title IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE -
dc.citation.volume 45 -
dc.contributor.author Kim, Young-geun -
dc.contributor.author Lee, Kyungbok -
dc.contributor.author Paik, Myunghee Cho -
dc.date.accessioned 2026-03-05T14:33:00Z -
dc.date.available 2026-03-05T14:33:00Z -
dc.date.created 2026-02-27 -
dc.date.issued 2023-06 -
dc.description.abstract The statistical distance of conditional distributions is an essential element of generating target data given some data as in video prediction. We establish how the statistical distances between two joint distributions are related to those between two conditional distributions for three popular statistical distances: f-divergence, Wasserstein distance, and integral probability metrics. Such characterization plays a crucial role in deriving a tractable form of the objective function to learn a conditional generator. For Wasserstein distance, we show that the distance between joint distributions is an upper bound of the expected distance between conditional distributions, and derive a tractable representation of the upper bound. Based on this theoretical result, we propose a new conditional generator, the conditional Wasserstein generator. Our proposed algorithm can be viewed as an extension of Wasserstein autoencoders (Tolstikhin et al. 2018) to conditional generation or as a Wasserstein counterpart of stochastic video generation (SVG) model by Denton and Fergus (Denton et al. 2018). We apply our algorithm to video prediction and video interpolation. Our experiments demonstrate that the proposed algorithm performs well on benchmark video datasets and produces sharper videos than state-of-the-art methods. -
dc.identifier.bibliographicCitation IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, v.45, no.6, pp.7208 - 7219 -
dc.identifier.doi 10.1109/TPAMI.2022.3220965 -
dc.identifier.issn 0162-8828 -
dc.identifier.scopusid 2-s2.0-85141639795 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/90576 -
dc.identifier.wosid 000982475600041 -
dc.language 영어 -
dc.publisher IEEE COMPUTER SOC -
dc.title Conditional Wasserstein Generator -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.relation.journalWebOfScienceCategory Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic -
dc.relation.journalResearchArea Computer Science; Engineering -
dc.type.docType Article -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor Linear programming -
dc.subject.keywordAuthor Task analysis -
dc.subject.keywordAuthor Probability -
dc.subject.keywordAuthor Upper bound -
dc.subject.keywordAuthor Stochastic processes -
dc.subject.keywordAuthor Generators -
dc.subject.keywordAuthor Data models -
dc.subject.keywordAuthor Conditional generation -
dc.subject.keywordAuthor generative model -
dc.subject.keywordAuthor optimal transport -
dc.subject.keywordAuthor wasserstein distance -
dc.subject.keywordAuthor video interpolation -
dc.subject.keywordAuthor video prediction -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.