Total Variation Constrained Non-Negative Matrix Factorization for Medical Image Registration

被引:18
作者
Leng, Chengcai [1 ,2 ,3 ]
Zhang, Hai [1 ]
Cai, Guorong [4 ]
Chen, Zhen [5 ]
Basu, Anup [3 ]
机构
[1] Northwest Univ, Sch Math, Xian 710127, Peoples R China
[2] Chinese Acad Sci, Inst Automat, Beijing 100190, Peoples R China
[3] Univ Alberta, Dept Comp Sci, Edmonton, AB T6G 2E8, Canada
[4] Jimei Univ, Coll Comp Engn, Xiamen 361021, Peoples R China
[5] Nanchang Hangkong Univ, Sch Measuring & Opt Engn, Nanchang 330063, Jiangxi, Peoples R China
基金
中国国家自然科学基金; 加拿大自然科学与工程研究理事会;
关键词
Data clustering; dimension reduction; image registration; non-negative matrix factorization (NMF); total variation (TV); POINT SET REGISTRATION; LOW-RANK MATRIX; DIMENSIONALITY REDUCTION; GRAPH; ALGORITHM;
D O I
10.1109/JAS.2021.1003979
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a novel medical image registration algorithm named total variation constrained graph-regularization for non-negative matrix factorization (TV-GNMF). The method utilizes non-negative matrix factorization by total variation constraint and graph regularization. The main contributions of our work are the following. First, total variation is incorporated into NMF to control the diffusion speed. The purpose is to denoise in smooth regions and preserve features or details of the data in edge regions by using a diffusion coefficient based on gradient information. Second, we add graph regularization into NMF to reveal intrinsic geometry and structure information of features to enhance the discrimination power. Third, the multiplicative update rules and proof of convergence of the TV-GNMF algorithm are given. Experiments conducted on datasets show that the proposed TV-GNMF method outperforms other state-of-the-art algorithms.
引用
收藏
页码:1025 / 1037
页数:13
相关论文
共 66 条
  • [1] Belkin M, 2002, ADV NEUR IN, V14, P585
  • [2] A local contrast fusion based 3D Otsu algorithm for multilevel image segmentation
    Bhandari, Ashish Kumar
    Ghosh, Arunangshu
    Kumar, Immadisetty Vinod
    [J]. IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2020, 7 (01) : 200 - 213
  • [3] An eigenspace projection clustering method for inexact graph matching
    Caelli, T
    Kosinov, S
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (04) : 515 - 519
  • [4] Document clustering using locality preserving indexing
    Cai, D
    He, XF
    Han, JW
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (12) : 1624 - 1637
  • [5] Cai D., 2007, AAAI, P528
  • [6] Graph Regularized Nonnegative Matrix Factorization for Data Representation
    Cai, Deng
    He, Xiaofei
    Han, Jiawei
    Huang, Thomas S.
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) : 1548 - 1560
  • [7] A Correntropy-based Affine Iterative Closest Point Algorithm for Robust Point Set Registration
    Chen, Hongchen
    Zhang, Xie
    Du, Shaoyi
    Wu, Zongze
    Zheng, Nanning
    [J]. IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2019, 6 (04) : 981 - 991
  • [8] Non-rigid point set registration via coherent spatial mapping
    Chen, Jun
    Ma, Jiayi
    Yang, Changcai
    Ma, Li
    Zheng, Sheng
    [J]. SIGNAL PROCESSING, 2015, 106 : 62 - 72
  • [9] Chung F. R., 1997, SPECTRAL GRAPH THEOR, V92, DOI DOI 10.1090/CBMS/092
  • [10] MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM
    DEMPSTER, AP
    LAIRD, NM
    RUBIN, DB
    [J]. JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01): : 1 - 38