2D RF-based non-rigid image registration for cardiac motion estimation: Comparison against block matching

Author(s):  
Bidisha Chakraborty ◽  
Zhi Liu ◽  
Brecht Heyde ◽  
Jianwen Luo ◽  
Jan D'hooge
2021 ◽  
Vol 205 ◽  
pp. 106085
Author(s):  
Monire Sheikh Hosseini ◽  
Mahammad Hassan Moradi ◽  
Mahdi Tabassian ◽  
Jan D'hooge

2007 ◽  
Author(s):  
D. Loeckx ◽  
J. Ector ◽  
F. Maes ◽  
J. D'hooge ◽  
D. Vandermeulen ◽  
...  

2021 ◽  
pp. 14-24
Author(s):  
Jiazhen Pan ◽  
Daniel Rueckert ◽  
Thomas Küstner ◽  
Kerstin Hammernik

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Hadi Wiputra ◽  
Wei Xuan Chan ◽  
Yoke Yin Foo ◽  
Sheldon Ho ◽  
Choon Hwai Yap

Abstract Accurate cardiac motion estimation from medical images such as ultrasound is important for clinical evaluation. We present a novel regularisation layer for cardiac motion estimation that will be applied after image registration and demonstrate its effectiveness. The regularisation utilises a spatio-temporal model of motion, b-splines of Fourier, to fit to displacement fields from pairwise image registration. In the process, it enforces spatial and temporal smoothness and consistency, cyclic nature of cardiac motion, and better adherence to the stroke volume of the heart. Flexibility is further given for inclusion of any set of registration displacement fields. The approach gave high accuracy. When applied to human adult Ultrasound data from a Cardiac Motion Analysis Challenge (CMAC), the proposed method is found to have 10% lower tracking error over CMAC participants. Satisfactory cardiac motion estimation is also demonstrated on other data sets, including human fetal echocardiography, chick embryonic heart ultrasound images, and zebrafish embryonic microscope images, with the average Dice coefficient between estimation motion and manual segmentation at 0.82–0.87. The approach of performing regularisation as an add-on layer after the completion of image registration is thus a viable option for cardiac motion estimation that can still have good accuracy. Since motion estimation algorithms are complex, dividing up regularisation and registration can simplify the process and provide flexibility. Further, owing to a large variety of existing registration algorithms, such an approach that is usable on any algorithm may be useful.


Author(s):  
Coert Metz ◽  
Nora Baka ◽  
Hortense Kirisli ◽  
Michiel Schaap ◽  
Theo van Walsum ◽  
...  

2011 ◽  
Vol 145 ◽  
pp. 277-281
Author(s):  
Vaci Istanda ◽  
Tsong Yi Chen ◽  
Wan Chun Lee ◽  
Yuan Chen Liu ◽  
Wen Yen Chen

As the development of network learning, video compression is important for both data transmission and storage, especially in a digit channel. In this paper, we present the return prediction search (RPS) algorithm for block motion estimation. The proposed algorithm exploits the temporal correlation and characteristic of returning origin to obtain one or two predictive motion vector and selects one motion vector, which presents better result, to be the initial search center. In addition, we utilize the center-biased block matching algorithms to refine the final motion vector. Moreover, we used adaptive threshold technique to reduce the computational complexity in motion estimation. Experimental results show that RPS algorithm combined with 4SS, BBGDS, and UCBDS effectively improves the performance in terms of mean-square error measure with less average searching points. On the other hand, accelerated RPS (ARPS) algorithm takes only 38% of the searching computations than 3SS algorithm, and the reconstruction image quality of the ARPS algorithm is superior to 3SS algorithm about 0.30dB in average overall test sequences. In addition, we create an asynchronous learning environment which provides students and instructors flexibility in learning and teaching activities. The purpose of this web site is to teach and display our researchable results. Therefore, we believe this web site is one of the keys to help the modern student achieve mastery of complex Motion Estimation.


Sign in / Sign up

Export Citation Format

Share Document