A Fast Fourier based Feature Descriptor and a Cascade Nearest Neighbour Search with an Efficient Matching Pipeline for Mosaicing of Microscopy Images


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

Automatic mosaicing is an important image processing application and we propose several improvements and simplifications to the image registration pipeline used in microscopy to automatically construct large images of whole specimen samples from a series of images. First of all we propose a feature descriptor based on the amplitude of a few elements of the Fourier transform, which makes it fast to compute and that can be used for any image matching and registration applications where scale and rotation invariance is not needed. Secondly, we propose a cascade matching approach that will reduce the time for the nearest neighbour search considerably, making it almost independent on feature vector length. Moreover, several improvements are proposed that will speed up the whole matching process. These are: faster interest point detection, a regular sampling strategy and a deterministic false positive removal procedure that finds the transformation. All steps of the improved pipeline are explained and the results comparative experiments are presented.

About the authors

A. Hast

Department of Information Technology

Author for correspondence.
Email: anders.hast@it.uu.se
Sweden, Uppsala

V. A. Sablina

Department of Electronic Computers

Email: anders.hast@it.uu.se
Russian Federation, Ryazan

I.-M. Sintorn

Department of Information Technology; Vironova AB

Email: anders.hast@it.uu.se
Sweden, Uppsala; Stockholm

G. Kylberg

Vironova AB

Email: anders.hast@it.uu.se
Sweden, Stockholm

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2018 Pleiades Publishing, Ltd.