Computer Science ›› 2017, Vol. 44 ›› Issue (1): 314-320.doi: 10.11896/j.issn.1002-137X.2017.01.058

Previous Articles    

Hippocampus Segmentation Based on Spare Coding and Orientation-Scale Descriptor

LIU Ying, ZHANG Ming-hui, YANG Wei, LU Zhen-tai, FENG Qian-jin and SU Yu-sheng   

  • Online:2018-11-13 Published:2018-11-13

Abstract: As hippocampus is associated with neurodegenerative diseases,a lot of researchers have proposed many me-thods to segment hippocampus,but the irregularity and the boundary vaguely make the high precise of hippocampus segmentation more difficulty.We proposed a novel algorithm called SCOSD to increase the accuracy of hippocampus segmentation.Motivated by abundant existing dictionary-based methods,SCOSD uses orientation-scale descriptor(OSD) to describe the pixel feature.The OSD contains not only intensity information,such as texture and gradient information,but also the geometrical information.The advantage of OSD is that it reduces the inhomogeneity among different images while containing several low-dimension features.SCOSD method has four steps.Firstly,the orientation-scale descriptors are extracted and dictionaries for each target voxel are constructed.Secondly,corresponding dictionary is used to represent the orientation-scale descriptor of the target voxel approximately and the sparse coefficients can be obtained simultaneous.Thirdly,the label and coefficients of the dictionary are fused to make voxels.Finally,threshold the fusion value to get the finally label.Experiments based on competition data of medical image computing and computer assisted intervention(MICCAI) demonstrate that SCOSD has higher segmentation precise than other algorithms such as Simple,Major Voting,Staple,Collate.

Key words: Hippocampus segmentation, Orientation-Scale descriptor,Spare coding,Hippocampus label fusim,Dictionary

[1] TAN P Y,CHEN J H,LI P,et al.Improving Threshold Seg-mentation in 3D Reconstruction of Mandible CT Image[J].2015,46(3):458-462.
[2] JIANG H,HE B,FANG D,et al.A region growing vessel segmentation algorithm based on spectrum information[J].Comput Math Methods Med,2013(6),743870.
[3] ASHRAF A B,GAVENONIS S,DAYE D,et al.A multichannel Markov random field approach for automated segmentation of breast cancer tumor in DCE-MRI data using kinetic observation model[J].Med Image Comput Comput Assist Interv,2011,14(pt3):546-553.
[4] MENDEZ C A,SUMMERS P,MENEGAZ G.Multiview Cluster Ensembles for Multimodal MRI Segmentation[J].International Journal of Imaging Systems & Technology,2015,25(1):56-67.
[5] LI C,HUANG R,DING Z,et al.A level set method for image segmentation in the presence of intensity inhomogeneities with application to MRI[J].IEEE Trans Image Process,2011,20(7):2007-2016.
[6] PARK S H,GAO Y,SHEN D.Multi-atlas based segmentation editing with interaction-guided patch selection and label fusion[J].IEEE Trans on Bio-medical Engineering,2015,3(6):1208-1219 .
[7] TONG T,WOLZ R,WANG Z,et al.Discriminative dictionary learning for abdominal multi-organ segmentation[J].Med Image Anal,2015,23(1):92-104.
[8] ALJABAR P,HECKEMANN R A,HAMMERS A,et al.Multi-atlas based segmentation of brain images:atlas selection and its effect on accuracy[J].Neuroimage,2009,46(3):726-738.
[9] TONG T,WOLZ R,COUPE P,et al.Segmentation of MR images via discriminative dictionary learning and sparse coding:application to hippocampus labeling[J].Neuroimage,2013,76:11-23.
[10] BAI W,SHI W,LEDIG C,et al.Multi-atlas segmentation with augmented features for cardiac MR images[J].Med Image Anal,2015,19(1):98-109.
[11] ROY S,CARASS A,PRINCE J L,et al.Subject Specific Sparse Dictionary Learning for Atlas based Brain MRI Segmentation[C]∥ Machine Learning in Medical Image.Springer InternationalPublishing,2014.
[12] GRAMFORT A,POUPON C,DESCOTEAUX M.Denoisingand fast diffusion imaging with physically constrained sparse dictionary learning[J].Med Image Anal,2014,18(1):36-49.
[13] DONOHO D L.Compressed sensing[J].IEEE T Inform Theory,2006,52(4):1289-1306.

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .