Sorry, you need to enable JavaScript to visit this website.

facebooktwittermailshare

A Two-Stage Minimum Spanning Tree (MST) based Clustering Algorithm for 2D Deformable Registration of Time Sequenced Images

Abstract: 

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.

up
0 users have voted:

Paper Details

Authors:
Nilanjan Ray, Sara McArdle, and Klaus Ley
Submitted On:
11 September 2017 - 3:35pm
Short Link:
Type:
Presentation Slides
Event:
Presenter's Name:
Shrimanti Ghosh
Paper Code:
ICIP1701
Document Year:
2017
Cite

Document Files

ICIP2017_Registration.pdf

(24 downloads)

Subscribe

[1] Nilanjan Ray, Sara McArdle, and Klaus Ley, "A Two-Stage Minimum Spanning Tree (MST) based Clustering Algorithm for 2D Deformable Registration of Time Sequenced Images", IEEE SigPort, 2017. [Online]. Available: http://sigport.org/1916. Accessed: Nov. 24, 2017.
@article{1916-17,
url = {http://sigport.org/1916},
author = {Nilanjan Ray; Sara McArdle; and Klaus Ley },
publisher = {IEEE SigPort},
title = {A Two-Stage Minimum Spanning Tree (MST) based Clustering Algorithm for 2D Deformable Registration of Time Sequenced Images},
year = {2017} }
TY - EJOUR
T1 - A Two-Stage Minimum Spanning Tree (MST) based Clustering Algorithm for 2D Deformable Registration of Time Sequenced Images
AU - Nilanjan Ray; Sara McArdle; and Klaus Ley
PY - 2017
PB - IEEE SigPort
UR - http://sigport.org/1916
ER -
Nilanjan Ray, Sara McArdle, and Klaus Ley. (2017). A Two-Stage Minimum Spanning Tree (MST) based Clustering Algorithm for 2D Deformable Registration of Time Sequenced Images. IEEE SigPort. http://sigport.org/1916
Nilanjan Ray, Sara McArdle, and Klaus Ley, 2017. A Two-Stage Minimum Spanning Tree (MST) based Clustering Algorithm for 2D Deformable Registration of Time Sequenced Images. Available at: http://sigport.org/1916.
Nilanjan Ray, Sara McArdle, and Klaus Ley. (2017). "A Two-Stage Minimum Spanning Tree (MST) based Clustering Algorithm for 2D Deformable Registration of Time Sequenced Images." Web.
1. Nilanjan Ray, Sara McArdle, and Klaus Ley. A Two-Stage Minimum Spanning Tree (MST) based Clustering Algorithm for 2D Deformable Registration of Time Sequenced Images [Internet]. IEEE SigPort; 2017. Available from : http://sigport.org/1916