CORNER DETECTION WITH MINIMAL EFFORT ON MULTIPLE SCALES

Ernst D. Dickmanns

2008

Abstract

Based on results of fitting linearly shaded blobs to rectangular image regions a new corner detector has been developed. A plane with least sum of errors squared is fit to the intensity distribution within a mask having four mask elements of same rectangular shape and size. Averaged intensity values in these mask elements allow very efficient simultaneous computation of pyramid levels and a new corner criterion at the center of the mask on these levels. The method is intended for real-time application and has thus been designed for minimal computing effort. It nicely fits into the ‘Unified Blob-edge-corner Method’ (UBM) developed recently. Results are given for road scenes.

Paper Citation

in Harvard Style

Dickmanns E. (2008). CORNER DETECTION WITH MINIMAL EFFORT ON MULTIPLE SCALES . In Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2008) ISBN 978-989-8111-21-0, pages 315-320. DOI: 10.5220/0001070703150320

in Bibtex Style

@conference{visapp08,
author={Ernst D. Dickmanns},
title={CORNER DETECTION WITH MINIMAL EFFORT ON MULTIPLE SCALES},
booktitle={Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2008)},
year={2008},
pages={315-320},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001070703150320},
isbn={978-989-8111-21-0},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2008)
TI - CORNER DETECTION WITH MINIMAL EFFORT ON MULTIPLE SCALES
SN - 978-989-8111-21-0
AU - Dickmanns E.
PY - 2008
SP - 315
EP - 320
DO - 10.5220/0001070703150320