dc.contributor.author |
Vaudrey, Tobi |
en |
dc.contributor.author |
Gruber, Daniel |
en |
dc.contributor.author |
Wedel, Andreas |
en |
dc.contributor.author |
Klappstein, Jens |
en |
dc.date.accessioned |
2008-12-11T22:30:06Z |
en |
dc.date.available |
2008-12-11T22:30:06Z |
en |
dc.date.issued |
2008 |
en |
dc.identifier.citation |
Multimedia Imaging Report 10 (2008) |
en |
dc.identifier.issn |
1178-5789 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3256 |
en |
dc.description |
You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original MI_tech website http://www.mi.auckland.ac.nz/index.php?option=com_content&view=article&id=91&Itemid=76 . All other rights are reserved by the author(s). |
en |
dc.description.abstract |
Applying real-time segmentation is a major issue when processing
every frame of image sequences. In this paper, we propose a
modi cation of the well known graph-cut algorithm to improve speed
for discrete segmentation. Our algorithm yields real-time segmentation,
using graph-cut, by performing a single cut on an image with regions of
di erent resolutions, combining space-time pyramids and narrow bands.
This is especially suitable for image sequences, as segment borders in one
image are re ned in the next image. The fast computation time allows
one to use information contained in every image frame of an input image
stream at 20 Hz, on a standard PC. The algorithm is applied to traf-
c scenes, using a monocular camera installed in a moving vehicle. Our
results show the segmentation of moving objects with similar results to
standard graph-cut, but with improved speed. |
en |
dc.publisher |
Computer Science Department, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
MI-tech Report Series |
en |
dc.rights |
Copyright Computer Science Department, The University of Auckland. You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original CITR web site under terms that include this permission. All other rights are reserved by the author(s). |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.mi.auckland.ac.nz/tech-reports/MItech-TR-10.pdf |
en |
dc.title |
Space-Time Multi-Resolution Banded Graph-Cut for Fast Segmentation. (Technical Report) |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |