{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/cycle-sum-cycle-consistent-adversarial-lstm","title":"Cycle-SUM: Cycle-consistent Adversarial LSTM Networks for Unsupervised Video Summarization","arxiv_id":"1904.08265","date":"2019-04-17","proceeding":null,"authors":["Li Yuan","Francis EH Tay","Ping Li","Li Zhou","Jiashi Feng"],"abstract":"In this paper, we present a novel unsupervised video summarization model that\nrequires no manual annotation. The proposed model termed Cycle-SUM adopts a new\ncycle-consistent adversarial LSTM architecture that can effectively maximize\nthe information preserving and compactness of the summary video. It consists of\na frame selector and a cycle-consistent learning based evaluator. The selector\nis a bi-direction LSTM network that learns video representations that embed the\nlong-range relationships among video frames. The evaluator defines a learnable\ninformation preserving metric between original video and summary video and\n\"supervises\" the selector to identify the most informative frames to form the\nsummary video. In particular, the evaluator is composed of two generative\nadversarial networks (GANs), in which the forward GAN is learned to reconstruct\noriginal video from summary video while the backward GAN learns to invert the\nprocessing. The consistency between the output of such cycle learning is\nadopted as the information preserving metric for video summarization. We\ndemonstrate the close relation between mutual information maximization and such\ncycle learning procedure. Experiments on two video summarization benchmark\ndatasets validate the state-of-the-art performance and superiority of the\nCycle-SUM model over previous baselines.","url_abs":"http://arxiv.org/abs/1904.08265v1","url_pdf":"http://arxiv.org/pdf/1904.08265v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"unsupervised-video-summarization","task_name":"Unsupervised Video Summarization"},{"task_slug":"video-summarization","task_name":"Video Summarization"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/unsupervised-video-summarization-on-summe","task":"Unsupervised Video Summarization","dataset":"SumMe","model":"Cycle-SUM","rank_in_archive_order":9,"of":10,"metrics":{"F1-score":"41.9"},"uses_additional_data":false},{"leaderboard":"/sota/unsupervised-video-summarization-on-tvsum","task":"Unsupervised Video Summarization","dataset":"TvSum","model":"Cycle-SUM","rank_in_archive_order":8,"of":8,"metrics":{"F1-score":"57.6"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.08265","atlas_url":"https://app.syntology.ai/?focus=1904.08265","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1904.08265"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.08265\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.08265"},"call":"get_concepts_for_paper(arxiv_id=\"1904.08265\")"}],"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"963a2e4c87fedea4f6f76e4596b8175560cd05ec18c6527e8679222b17491b55","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}