TY - GEN
T1 - A two-stage minimum spanning tree (MST) based clustering algorithm for 2D deformable registration of time sequenced images
AU - Saha, Baidya Nath
AU - Ray, Nilanjan
AU - McArdle, Sara
AU - Ley, Klaus
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - 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.
AB - 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.
KW - Graph clustering
KW - Microscopic image registration
KW - Minimum spanning tree
KW - Time sequence imaging
UR - http://www.scopus.com/inward/record.url?scp=85045318327&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85045318327&partnerID=8YFLogxK
U2 - 10.1109/ICIP.2017.8296526
DO - 10.1109/ICIP.2017.8296526
M3 - Conference contribution
AN - SCOPUS:85045318327
T3 - Proceedings - International Conference on Image Processing, ICIP
SP - 1472
EP - 1476
BT - 2017 IEEE International Conference on Image Processing, ICIP 2017 - Proceedings
PB - IEEE Computer Society
T2 - 24th IEEE International Conference on Image Processing, ICIP 2017
Y2 - 17 September 2017 through 20 September 2017
ER -