Chinese Journal of Quantum Electronics, Volume. 32, Issue 3, 283(2015)

Medical image registration algorithm based on sparse random projection and SIFT transform

Sa YANG1、* and Zhishuo ZHENG1,2
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • show less

    Scale-ivariant feature transform (SIFT) has defects in computational complexity of its key point descriptor computing stage and in the high dimensionality of the key point feature vectors. To speed up the computation, a SIFT based on compressive sensing algorithm was proposed. By the sparse feature representation methods of compressive sensing theory, the feature vector of SIFT was extracted and the high-dimensional gradient derivative was decreased to low-dimensional sparse feature vector. Accordingly, Euclidean distance was introduced to compute the similarity and dissimilarity between feature vectors used for image registration and Best-Bin-First (BBF) data structure was used to avoid exhaustion. The experimental results show that the proposed algorithm has better performance than the standard SIFT algorithm while registering the affine transformation medical images. Comparing with the current modified SIFT algorithms, the real-time performance of the proposed algorithm is improved obviously.

    Tools

    Get Citation

    Copy Citation Text

    YANG Sa, ZHENG Zhishuo. Medical image registration algorithm based on sparse random projection and SIFT transform[J]. Chinese Journal of Quantum Electronics, 2015, 32(3): 283

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category:

    Received: Jan. 14, 2015

    Accepted: --

    Published Online: May. 29, 2015

    The Author Email: Sa YANG (yangsa@gdei.edu.cn)

    DOI:10.3969/j.issn.1007-5461. 2015.03.005

    Topics