Evolving content-driven superpixels for accurate image representation
Evolving content-driven superpixels for accurate image representation
A novel approach to superpixel generation is presented that aims to reconcile image information with superpixel coverage. It is described as content-driven as the number of superpixels in any given area is dictated by the underlying image properties. By using a combination of well-established computer vision techniques, superpixels are grown and subsequently divided on detecting simple image variation. It is designed to have no direct control over the number of superpixels as this can lead to errors. The algorithm is subject to performance metrics on the Berkeley Segmentation Dataset including: explained variation; mode label analysis, as well as a measure of oversegmentation. The results show that this new algorithm can reduce the superpixel oversegmentation and retain comparable performance in all other metrics. The algorithm is shown to be stable with respect to initialisation, with little variation across performance metrics on a set of random initialisations.
978-3-642-24027-0
192-201
Lowe, Richard
d597842e-560d-44a0-bade-dee08ce57677
Nixon, Mark S.
2b5b9804-5a81-462a-82e6-92ee5fa74e12
2011
Lowe, Richard
d597842e-560d-44a0-bade-dee08ce57677
Nixon, Mark S.
2b5b9804-5a81-462a-82e6-92ee5fa74e12
Lowe, Richard and Nixon, Mark S.
(2011)
Evolving content-driven superpixels for accurate image representation.
ISVC'11 Proceedings of the 7th International Conference on Advances in Visual Computing - Volume Part I.
.
(doi:10.1007/978-3-642-24028-7_18).
Record type:
Conference or Workshop Item
(Paper)
Abstract
A novel approach to superpixel generation is presented that aims to reconcile image information with superpixel coverage. It is described as content-driven as the number of superpixels in any given area is dictated by the underlying image properties. By using a combination of well-established computer vision techniques, superpixels are grown and subsequently divided on detecting simple image variation. It is designed to have no direct control over the number of superpixels as this can lead to errors. The algorithm is subject to performance metrics on the Berkeley Segmentation Dataset including: explained variation; mode label analysis, as well as a measure of oversegmentation. The results show that this new algorithm can reduce the superpixel oversegmentation and retain comparable performance in all other metrics. The algorithm is shown to be stable with respect to initialisation, with little variation across performance metrics on a set of random initialisations.
Text
lowe isvc 2011 pdf.pdf
- Version of Record
Restricted to Repository staff only
Request a copy
More information
Published date: 2011
Venue - Dates:
ISVC'11 Proceedings of the 7th International Conference on Advances in Visual Computing - Volume Part I, 2011-01-01
Organisations:
Vision, Learning and Control
Identifiers
Local EPrints ID: 363318
URI: http://eprints.soton.ac.uk/id/eprint/363318
ISBN: 978-3-642-24027-0
PURE UUID: 1f205681-d572-4ccc-a667-8ad73566d2e9
Catalogue record
Date deposited: 20 Mar 2014 17:02
Last modified: 15 Mar 2024 02:35
Export record
Altmetrics
Contributors
Author:
Richard Lowe
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
