Show simple item record

dc.contributor.authorChen, Billyen_US
dc.contributor.authorSen, Pradeepen_US
dc.contributor.editorKaterina Mania and Eric Reinharden_US
dc.date.accessioned2015-07-13T09:52:39Z
dc.date.available2015-07-13T09:52:39Z
dc.date.issued2008en_US
dc.identifier.urihttp://dx.doi.org/10.2312/egs.20081022en_US
dc.description.abstractWe present a technique for summarizing a video into a short segment, while preserving the important events in the original. While many techniques remove whole frames from the video stream when condensing it, we observe that these deleted frames need not come from a single time step. More generally, deleted frames are 'sheets' through the space-time volume. This leads to an algorithm whereby sheets are incrementally carved from the video cube to shorten the length of a video. The problem of finding these sheets is formulated as a min-cut problem, whose solution can be mapped to a sheet.We show results by creating short, viewable summaries of long video sequences.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleVideo Carvingen_US
dc.description.seriesinformationEurographics 2008 - Short Papersen_US
dc.description.sectionheadersComputational Photography and Image-Based Renderingen_US
dc.identifier.doi10.2312/egs.20081022en_US
dc.identifier.pages63-66en_US


Files in this item

Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record