Advertisement

Nonlinear Statistical Shape Modeling for Ankle Bone Segmentation Using a Novel Kernelized Robust PCA

  • Jingting MaEmail author
  • Anqi Wang
  • Feng Lin
  • Stefan Wesarg
  • Marius Erdt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10433)

Abstract

Statistical shape models (SSMs) are widely employed in medical image segmentation. However, an inferior SSM will degenerate the quality of segmentations. It is challenging to derive an efficient model because: (1) often the training datasets are corrupted by noise and/or artifacts; (2) conventional SSM is not capable to capture nonlinear variabilities of a population of shape. Addressing these challenges, this work aims to create SSMs that are not only robust to abnormal training data but also satisfied with nonlinear distribution. As Robust PCA is an efficient tool to seek a clean low-rank linear subspace, a novel kernelized Robust PCA (KRPCA) is proposed to cope with nonlinear distribution for statistical shape modeling. In evaluation, the built nonlinear model is used in ankle bone segmentation where 9 bones are separately distributed. Evaluation results show that the model built with KRPCA has a significantly higher quality than other state-of-the-art methods.

Keywords

Statistical shape models Corrupted training data Nonlinear distribution Kernelized Robust PCA 

Notes

Acknowledgments

This research is supported by the National Research Foundation, Prime Minister’s Office, Singapore under its International Research Centres in Singapore Funding Initiative.

References

  1. 1.
    Davies, R.H., Twining, C.J., Taylor, C.J.: Statistical Models of Shape: Optimization and Evaluation. Springer, London (2008)zbMATHGoogle Scholar
  2. 2.
    Candès, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(3), 11 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Liu, G., Lin, Z., Yu, Y.: Robust subspace segmentation by low-rank representation. In: Proceedings of the 27th International Conference on Machine Learning (ICML-10), pp. 663–670 (2010)Google Scholar
  4. 4.
    Canyi, L., Lin, Z., Yan, S.: Smoothed low rank and sparse matrix recovery by iteratively reweighted least squares minimization. IEEE Trans. Image Process. 24(2), 646–654 (2015)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Xiao, S., Tan, M., Dong, X., Dong, Z.Y.: Robust kernel low-rank representation. IEEE Trans. Neural Netw. Learn. Syst. 27(11), 2268–2281 (2016)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Lin, W., Wang, Y.: Robust hashing for multi-view data: Jointly learning low-rank kernelized similarity consensus and hash functions. Image Vision Comput. 57, 58–66 (2017)CrossRefGoogle Scholar
  7. 7.
    Lin, Z., Liu, R., Su, Z.: Linearized alternating direction method with adaptive penalty for low-rank representation. In: Advances in neural information processing systems, pp. 612–620 (2011)Google Scholar
  8. 8.
    Wang, Q.: Kernel principal component analysis and its applications in face recognition and active shape models. arXiv preprint arXiv:1207.3538 (2012)
  9. 9.
    Steger, S., Jung, F., Wesarg, S.: Personalized articulated atlas with a dynamic adaptation strategy for bone segmentation in CT or CT/MR head and neck images. In: SPIE Medical Imaging, International Society for Optics and Photonics, p. 90341I (2014)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Jingting Ma
    • 1
    • 2
    Email author
  • Anqi Wang
    • 3
  • Feng Lin
    • 1
  • Stefan Wesarg
    • 3
  • Marius Erdt
    • 1
    • 2
  1. 1.School of Computer Science and EngineeringNanyang Technological UniversitySingaporeSingapore
  2. 2.Fraunhofer IDM@NTUNanyang Technological UniversitySingaporeSingapore
  3. 3.Visual Healthcare TechnologiesFraunhofer IGDDarmstadtGermany

Personalised recommendations