A two-stage minimum spanning tree (MST) based clustering algorithm for 2D deformable registration of time sequenced images

• Published in: 2017 IEEE International Conference on Image Processing (ICIP) pp. 1472 - 1476
• Main Authors: Saha, Baidya Nath, Ray, Nilanjan, McArdle, Sara, Ley, Klaus
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.09.2017
• Subjects: Clustering algorithms; Distortion; Entropy; graph clustering; Image registration; Image sequences; Microscopic image registration; Microscopy; minimum spanning tree; time sequence imaging; Two dimensional displays
• ISSN: 2381-8549
• DOI: 10.1109/ICIP.2017.8296526

Significant cardiac and respiratory motion of the living subject, occasional spells of defocus, drifts in the field of view, and long image sequences make the registration of in-vivo microscopy image sequences used in atherosclerosis study an onerous task. In this study we developed and implemented a novel Minimum Spanning Tree (MST)-based clustering method for image sequence registration that first constructs a minimum spanning tree for the input image sequence. The spanning tree re-orders the images in such a way where poor quality images appear at the end of the sequence. Then the spanning tree is clustered into several groups based on the similarity of the images. Subsequently deformable registration is conducted locally within the group with respect to the local anchor image selected automatically from the images in the group. After that coarse registration is performed to find the global anchor and then a deformable registration is performed globally to incorporate larger drift and distortion. Two-stage deformable registration incrementally incorporates larger drifts and distortions present in the longer sequence. Our algorithm involves very few tuning parameters, the optimal value of these parameters can be easily learned from data. Our method outperforms other methods on microscopy image sequences of mouse arteries.