Bipartite Graph Matching for Keyframe Summary Evaluation
A keyframe summary, or "static storyboard", is a collection of frames from a video designed to summarise its semantic content. Many algorithms have been proposed to extract such summaries automatically. How best to evaluate these outputs is an important but little-discussed question. We re...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2017-12 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Gunn, Iain A D Kuncheva, Ludmila I Yousefi, Paria |
| description | A keyframe summary, or "static storyboard", is a collection of frames from a video designed to summarise its semantic content. Many algorithms have been proposed to extract such summaries automatically. How best to evaluate these outputs is an important but little-discussed question. We review the current methods for matching frames between two summaries in the formalism of graph theory. Our analysis revealed different behaviours of these methods, which we illustrate with a number of case studies. Based on the results, we recommend a greedy matching algorithm due to Kannappan et al. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2076891537</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2076891537</sourcerecordid><originalsourceid>FETCH-proquest_journals_20768915373</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwcMosSCwqySxJVXAvSizIUPBNLEnOyMxLV0jLL1LwTq1MK0rMTVUILs3NTSyqVHAtS8wpTSzJzM_jYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4IwNzMwtLQ1Njc2PiVAEAPyE2Hw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2076891537</pqid></control><display><type>article</type><title>Bipartite Graph Matching for Keyframe Summary Evaluation</title><source>Free E- Journals</source><creator>Gunn, Iain A D ; Kuncheva, Ludmila I ; Yousefi, Paria</creator><creatorcontrib>Gunn, Iain A D ; Kuncheva, Ludmila I ; Yousefi, Paria</creatorcontrib><description>A keyframe summary, or "static storyboard", is a collection of frames from a video designed to summarise its semantic content. Many algorithms have been proposed to extract such summaries automatically. How best to evaluate these outputs is an important but little-discussed question. We review the current methods for matching frames between two summaries in the formalism of graph theory. Our analysis revealed different behaviours of these methods, which we illustrate with a number of case studies. Based on the results, we recommend a greedy matching algorithm due to Kannappan et al.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Case studies ; Graph matching ; Graph theory ; Greedy algorithms ; Summaries</subject><ispartof>arXiv.org, 2017-12</ispartof><rights>2017. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Gunn, Iain A D</creatorcontrib><creatorcontrib>Kuncheva, Ludmila I</creatorcontrib><creatorcontrib>Yousefi, Paria</creatorcontrib><title>Bipartite Graph Matching for Keyframe Summary Evaluation</title><title>arXiv.org</title><description>A keyframe summary, or "static storyboard", is a collection of frames from a video designed to summarise its semantic content. Many algorithms have been proposed to extract such summaries automatically. How best to evaluate these outputs is an important but little-discussed question. We review the current methods for matching frames between two summaries in the formalism of graph theory. Our analysis revealed different behaviours of these methods, which we illustrate with a number of case studies. Based on the results, we recommend a greedy matching algorithm due to Kannappan et al.</description><subject>Case studies</subject><subject>Graph matching</subject><subject>Graph theory</subject><subject>Greedy algorithms</subject><subject>Summaries</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwcMosSCwqySxJVXAvSizIUPBNLEnOyMxLV0jLL1LwTq1MK0rMTVUILs3NTSyqVHAtS8wpTSzJzM_jYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4IwNzMwtLQ1Njc2PiVAEAPyE2Hw</recordid><startdate>20171219</startdate><enddate>20171219</enddate><creator>Gunn, Iain A D</creator><creator>Kuncheva, Ludmila I</creator><creator>Yousefi, Paria</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PIMPY</scope><scope>PKEHL</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20171219</creationdate><title>Bipartite Graph Matching for Keyframe Summary Evaluation</title><author>Gunn, Iain A D ; Kuncheva, Ludmila I ; Yousefi, Paria</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20768915373</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Case studies</topic><topic>Graph matching</topic><topic>Graph theory</topic><topic>Greedy algorithms</topic><topic>Summaries</topic><toplevel>online_resources</toplevel><creatorcontrib>Gunn, Iain A D</creatorcontrib><creatorcontrib>Kuncheva, Ludmila I</creatorcontrib><creatorcontrib>Yousefi, Paria</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied & Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gunn, Iain A D</au><au>Kuncheva, Ludmila I</au><au>Yousefi, Paria</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Bipartite Graph Matching for Keyframe Summary Evaluation</atitle><jtitle>arXiv.org</jtitle><date>2017-12-19</date><risdate>2017</risdate><eissn>2331-8422</eissn><abstract>A keyframe summary, or "static storyboard", is a collection of frames from a video designed to summarise its semantic content. Many algorithms have been proposed to extract such summaries automatically. How best to evaluate these outputs is an important but little-discussed question. We review the current methods for matching frames between two summaries in the formalism of graph theory. Our analysis revealed different behaviours of these methods, which we illustrate with a number of case studies. Based on the results, we recommend a greedy matching algorithm due to Kannappan et al.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2017-12 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_2076891537 |
| source | Free E- Journals |
| subjects | Case studies Graph matching Graph theory Greedy algorithms Summaries |
| title | Bipartite Graph Matching for Keyframe Summary Evaluation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-15T08%3A48%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Bipartite%20Graph%20Matching%20for%20Keyframe%20Summary%20Evaluation&rft.jtitle=arXiv.org&rft.au=Gunn,%20Iain%20A%20D&rft.date=2017-12-19&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2076891537%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2076891537&rft_id=info:pmid/&rfr_iscdi=true |