A SVD BASED IMAGE COMPLEXITY MEASURE

David Gustavsson, Kim Steenstrup Pedersen, Mads Nielsen

2009

Abstract

Images are composed of geometric structures and texture, and different image processing tools - such as denoising, segmentation and registration - are suitable for different types of image contents. Characterization of the image content in terms of geometric structure and texture is an important problem that one is often faced with. We propose a patch based complexity measure, based on how well the patch can be approximated using singular value decomposition. As such the image complexity is determined by the complexity of the patches. The concept is demonstrated on sequences from the newly collected DIKU Multi-Scale image database.

Paper Citation

in Harvard Style

Gustavsson D., Steenstrup Pedersen K. and Nielsen M. (2009). A SVD BASED IMAGE COMPLEXITY MEASURE . In Proceedings of the Fourth International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP, (VISIGRAPP 2009) ISBN 978-989-8111-69-2, pages 34-39. DOI: 10.5220/0001785400340039

in Bibtex Style

@conference{visapp09,
author={David Gustavsson and Kim Steenstrup Pedersen and Mads Nielsen},
title={A SVD BASED IMAGE COMPLEXITY MEASURE},
booktitle={Proceedings of the Fourth International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP, (VISIGRAPP 2009)},
year={2009},
pages={34-39},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001785400340039},
isbn={978-989-8111-69-2},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP, (VISIGRAPP 2009)
TI - A SVD BASED IMAGE COMPLEXITY MEASURE
SN - 978-989-8111-69-2
AU - Gustavsson D.
AU - Steenstrup Pedersen K.
AU - Nielsen M.
PY - 2009
SP - 34
EP - 39
DO - 10.5220/0001785400340039