Blur Invariant Template Matching Using Projection onto Convex Sets

0508018 - ÚTIA 2020 RIV CH eng C - Konferenční příspěvek (zahraniční konf.)
Lébl, Matěj - Šroubek, Filip - Kautský, J. - Flusser, Jan
Blur Invariant Template Matching Using Projection onto Convex Sets.
Computer Analysis of Images and Patterns : CAIP 2019 International Workshops, ViMaBi and DL-UAV, Salerno, Italy, September 6, 2019, Proceedings. Cham: Springer, 2019 - (Vento, M.; Percannella, G.; Colantonio, S.; Giorgi, D.; Matuszewski, B.; Kerdegari, H.; Razaak, M.), s. 351-362. Communications in Computer and Information Science, 1089. ISBN 978-3-030-29929-3.
[International Conference on Computer Analysis of Images and Patterns, CAIP 2019 /18./. Salerno (IT), 02.09.2019-06.09.2019]
Grant CEP: GA ČR GA18-07247S
Institucionální podpora: RVO:67985556
Klíčová slova: Blur-invariant distance * Projection operator * Object recognition * Blurred image
Obor OECD: Computer hardware and architecture
http://library.utia.cas.cz/separaty/2019/ZOI/flusser-0508018.pdf

Blur is a common phenomenon in image acquisition that negatively influences recognition rate if blurred images are used as a query in template matching. Various blur-invariant features and measures were proposed in the literature, yet they are often derived under conditions that are difficult to satisfy in practise, for example, images with zero background or periodically repeating images and classes of blur that are closed under convolution.We propose a novel blur-invariant distance that puts no limitation on images and is invariant to any kind of blur as long as the blur has limited support, non-zero values and sums up to one. A template matching algorithm is then derived based on the blur-invariant distance, which projects query images on convex sets constructed around template images. The proposed method is easy to implement, it is robust to noise and blur size, and outperforms other competitors in this area.
Trvalý link: http://hdl.handle.net/11104/0299778