CN109949307B - Image segmentation method based on principal component analysis - Google Patents

Image segmentation method based on principal component analysis Download PDF

Info

Publication number
CN109949307B
CN109949307B CN201910143931.XA CN201910143931A CN109949307B CN 109949307 B CN109949307 B CN 109949307B CN 201910143931 A CN201910143931 A CN 201910143931A CN 109949307 B CN109949307 B CN 109949307B
Authority
CN
China
Prior art keywords
focus
voxels
matrix
data
image
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910143931.XA
Other languages
Chinese (zh)
Other versions
CN109949307A (en
Inventor
贺建峰
童丽榕
王绍波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Kunming University of Science and Technology
Original Assignee
Kunming University of Science and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Kunming University of Science and Technology filed Critical Kunming University of Science and Technology
Priority to CN201910143931.XA priority Critical patent/CN109949307B/en
Publication of CN109949307A publication Critical patent/CN109949307A/en
Application granted granted Critical
Publication of CN109949307B publication Critical patent/CN109949307B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention relates to an image segmentation method based on principal component analysis, and belongs to the technical field of biomedicine. The invention avoids inconsistent sketching results caused by subjectivity, experience deficiency and the like of doctors. The manual segmentation of lesions not only requires specialized anatomical knowledge, but also is very energy-intensive, and the segmentation with manual participation has subjectivity and has a certain influence on the segmentation result. The model which has completed the study through the training set can effectively liberate the hands of doctors, and the focus segmented by the model can provide visual diagnosis reference for the doctors, so that the focus does not need to be marked manually, and much energy and time are saved.

Description

Image segmentation method based on principal component analysis
Technical Field
The invention relates to an image segmentation method based on principal component analysis, and belongs to the technical field of biomedicine.
Background
Image segmentation is the division of an image into meaningful parts according to some uniformity (or consistency) principle, such that each part meets some consistency requirement, and the merging of any two adjacent parts breaks the consistency. The segmentation of an image can in many cases be attributed to classification problems of the pixels of the image.
In magnetic resonance imaging images, the boundaries of the intracranial tissues are extremely complex and irregular, which poses serious challenges to conventional segmentation algorithms. The manual segmentation of lesions not only requires specialized anatomical knowledge, but also is very energy-intensive, and the segmentation with manual participation has subjectivity and has a certain influence on the segmentation result.
Disclosure of Invention
The invention provides an image segmentation method based on principal component analysis, which is used for marking focus voxels and non-focus voxels in magnetic resonance imaging and obtaining segmented images of focus voxels only.
The technical scheme of the invention is as follows: a method of image segmentation based on principal component analysis, the method comprising the steps of:
s1, downloading a magnetic resonance imaging sequence data set, selecting a three-dimensional image containing focus voxels in the magnetic resonance imaging sequence data set to perform fault, obtaining a plurality of fault images containing focus voxels, forming a data set by the plurality of fault images containing focus voxels, and taking the data set containing focus voxels as a training set;
s2, voxels in a tomographic image containing focus voxels in the training set can be divided into focus voxels and non-focus voxels, the data dimension of the voxels is reduced by utilizing principal component analysis, and the focus and non-focus in the magnetic resonance imaging sequence data are classified by utilizing the distance measure as a classification basis;
s3, reading a group of unknown data from a magnetic resonance imaging sequence data set as a test group, classifying the test group image containing focus voxels by using a constructed classification model, dividing the voxels in the image into focus and non-focus according to a distance threshold, respectively marking focus voxels and non-focus voxels by using 1 and 0 to obtain a binarized image, and removing the voxels with the value of 0 to obtain a segmented image with focus voxels;
s4, reading in 'real data' corresponding to the data of the corresponding test group, namely, segmenting a magnetic resonance imaging image of an accurate focus voxel, analyzing a segmented image obtained through a model according to segmentation performance evaluation parameters, and storing an evaluation result into an Excel table for analysis.
The step S2 specifically includes the following steps:
1) Extracting a data matrix: for the images in a training set data set, extracting gray values of all focus and non-focus voxels and forming two corresponding vectors, which are marked as x and x'; because the whole training set data set contains N pictures, a non-focus voxel data matrix G with N x M dimensions can be obtained x And a focus voxel data matrix L x The method comprises the steps of carrying out a first treatment on the surface of the Where M is the number of focus voxels, here assuming that the number of focus voxels and the number of non-focus voxels are the sameM numbers are the same;
2) Data matrix centralization: before principal component analysis, the data matrix needs to be centered, and the data matrix G x And L x Respectively calculating column mean and column variance of each matrix, subtracting corresponding column mean from each data matrix, and dividing by corresponding column variance to obtain data matrix G x And L x Is at the origin position;
3) Principal component analysis dimension reduction: assuming a is a matrix of M x N, then a=uΣv is decomposed by singular values T Will get U, sigma, V T Three matrices; wherein U is a square matrix of M, and is a matrix composed of eigenvectors of the matrix A; Σ is a diagonal matrix of m×n, the elements on the diagonal of which are called eigenvalues; v (V) T The transpose of V is a matrix of N x N whose columns can be considered as a set of basis vectors representing the vector direction of the principal component; the feature vector corresponding to the largest feature value represents the data matrix G x 、L x The maximum covariance exists in the principal component direction, namely the maximum covariance exists in the projection of a low-dimensional coordinate system, and the feature vector corresponding to the feature value with the large front I term is reserved to approximately describe the matrix;
4) Data matrix basis conversion: to transform data matrix G x 、L x So that they have a lower dimension, the first 99% of the eigenvectors obtained can be used with the data matrix G x 、L x Multiplying; because of the data matrix G x ,L x The eigenvectors of (a) are not necessarily the same, the data matrix G x ,L x Performing a secondary transformation such that they are projected onto the same basis;
5) Classifying according to the distance: after obtaining the focus and non-focus data matrix under the condition of the same base, respectively calculating the distances from the value of the new data on the base to all values in the non-focus matrix and the focus matrix, averaging the two groups of distances, and observing which group has smaller average value: if the average value of the distances from the new data to the set of non-lesion matrices is smaller, classifying it as non-lesion; and vice versa classifies it as a lesion.
The beneficial effects of the invention are as follows: the invention avoids inconsistent sketching results caused by subjectivity, experience deficiency and the like of doctors. The manual segmentation of lesions not only requires specialized anatomical knowledge, but also is very energy-intensive, and the segmentation with manual participation has subjectivity and has a certain influence on the segmentation result. The model which has completed the study through the training set can effectively liberate the hands of doctors, and the focus segmented by the model can provide visual diagnosis reference for the doctors, so that the focus does not need to be marked manually, and much energy and time are saved.
Drawings
FIG. 1 is a general flow chart of the present invention;
FIG. 2 is a PD weight map, T1 weight map and T2 weight map of a 97 th slice in a magnetic resonance imaging image of a test set selected as test images;
FIG. 3 is a binarized segmented image of a set of unknown focus-containing voxels of the magnetic resonance imaging image obtained by a model;
fig. 4 is a "true data" image corresponding to a lesion image of a test group, the exact lesion location and size having been marked on the image.
Detailed Description
Example 1: as shown in fig. 1-4, a method for image segmentation based on principal component analysis, the method steps being as follows (flow chart is shown in fig. 1):
s1, downloading a magnetic resonance imaging sequence data set, selecting a three-dimensional image containing focus voxels in the magnetic resonance imaging sequence data set to perform fault, obtaining a plurality of fault images containing focus voxels, forming a data set by the plurality of fault images containing focus voxels, and taking the data set containing focus voxels as a training set;
s2, voxels in a tomographic image containing focus voxels in the training set can be divided into focus voxels and non-focus voxels, the data dimension of the voxels is reduced by utilizing principal component analysis, and the focus and non-focus in the magnetic resonance imaging sequence data are classified by utilizing the distance measure as a classification basis;
to classify a nuclear magnetic imaging image into a lesion and a non-lesion, the main idea is to measure which of the two classes of the lesion and the non-lesion has a smaller distance from new data by using a distance measure. However, direct subtraction of the gray values of the images takes into account redundant information of the high-dimensional data, and has a negative influence on the classification effect. To address this problem, principal component analysis may be utilized to reduce the data dimension of the data, thereby reducing redundant information of the data. The step S2 specifically includes the following steps:
1) Extracting a data matrix: for the images in a training set data set, extracting gray values of all focus and non-focus voxels and forming two corresponding vectors, which are marked as x and x'; because the whole training set data set contains N pictures, a non-focus voxel data matrix G with N x M dimensions can be obtained x And a focus voxel data matrix L x The method comprises the steps of carrying out a first treatment on the surface of the Wherein M is the number of focus voxels, and the number of focus voxels is assumed to be the same as the number of non-focus voxels, and M is all the number;
2) Data matrix centralization: before principal component analysis, the data matrix needs to be centered, and the data matrix G x And L x Respectively calculating column mean and column variance of each matrix, subtracting corresponding column mean from each data matrix, and dividing by corresponding column variance to obtain data matrix G x And L x Is at the origin position;
3) Principal component analysis dimension reduction: the purpose of the principal component analysis algorithm is to transform the data from high to low dimensions and to match the transformed data as much as possible with the original data. This is done because it is considered that voxel data points are high-dimensional data, often containing redundant information. If the classification is made directly using the distance of these data points to a lesion or non-lesion, it is likely that poor results will be obtained. In principle component analysis, it is common practice to find a low-dimensional coordinate system such that the projection distance of each data point in the raw data matrix to this coordinate system is minimized. This is equivalent to the maximum covariance of the projection of the raw data matrix in the low-dimensional coordinate system. This can be achieved generally by singular value decomposition. Let A be oneM x N, then a=uΣv by singular value decomposition T Will get U, sigma, V T Three matrices; wherein U is a square matrix of M, and is a matrix composed of eigenvectors of the matrix A; Σ is a diagonal matrix of m×n, the elements on the diagonal of which are called eigenvalues; v (V) T The transpose of V is a matrix of N x N whose columns can be considered as a set of basis vectors representing the vector direction of the principal component; the feature vector (principal component direction) corresponding to the largest feature value represents the data matrix G x 、L x There is a maximum covariance in this direction, i.e. the projection in the low-dimensional coordinate system, the eigenvalues are arranged from large to small in the matrix Σ and the decrease is particularly fast, and in many cases the sum of the first 10% or even 1% of the eigenvalues accounts for more than 99% of the sum of all eigenvalues. The matrix can be approximately described with respect to eigenvectors corresponding to eigenvalues that are large for the previous I term. In this experiment, the first 99% of feature vectors were retained.
4) Data matrix basis conversion: to transform data matrix G x 、L x So that they have a lower dimension, the first 99% of the eigenvectors obtained can be used with the data matrix G x 、L x Multiplication (this is the first transformation); however, because of the data matrix G x ,L x Not necessarily identical, they may be projected onto different new bases if transformed separately. In the case where the projected bases are different, comparison of distances cannot be performed; therefore, the data matrix G is required x ,L x Performing a secondary transformation (i.e., normalizing the variance of the eigenvectors in the first transformation to 1, finding a new eigenvector, multiplying the new eigenvector by a multiplication) so that they are projected onto the same basis;
5) Classifying according to the distance: after obtaining the focus and non-focus data matrix under the condition of the same base, respectively calculating the distances from the value of the new data on the base to all values in the non-focus matrix and the focus matrix, averaging the two groups of distances, and observing which group has smaller average value: if the average value of the distances from the new data to the set of non-lesion matrices is smaller, classifying it as non-lesion; and vice versa classifies it as a lesion.
S3, reading a group of unknown data from a magnetic resonance imaging sequence data set as a test group, classifying the test group image containing focus voxels by using a constructed classification model, dividing the voxels in the image into focus and non-focus according to a distance threshold, respectively marking focus voxels and non-focus voxels by using 1 and 0 to obtain a binarized image, and removing the voxels with the value of 0 to obtain a segmented image with focus voxels;
s4, reading in 'real data' corresponding to the data of the corresponding test group, namely, segmenting a magnetic resonance imaging image of an accurate focus voxel, analyzing the segmented image obtained through the model according to segmentation performance evaluation parameters such as a Dice similarity coefficient (Dice similarity coefficient, DSC), sensitivity (Sens), specificity (Spec) and accuracy (Acc), and storing an evaluation result in an Excel table for analysis. The calculation formula of these four parameters is as follows:
wherein TP is true positive (true positive), TN is true negative (true negative), FP is false positive (false positive), and FN is false negative (false negative).
The Dice similarity coefficient is a common similarity measure, and other performance evaluation parameters frequently matched with the Dice similarity coefficient are sensitivity, specificity and accuracy. Taking 97 faults as an example, the calculated performance parameters are as follows:
DSC=0.7746,Sens=0.8221,Spec=0.9987,Acc=0.9980
among them, DSC is an index most commonly used for evaluating a lesion segmentation method, and it reflects more the segmentation result and the difference in the position of the true lesion, and its value may be from 0 to 1.DSC equal to 0 indicates that the two parts are not overlapped, and DSC equal to 1 indicates that the two parts are completely matched, and the result is better when the DSC is more than or equal to 0.7. Sens is 0.8221, which indicates that the lesion segmentation result can reach about 82%. From the calculation formulas of the parameters Spec and Acc, since TN (true negative) therein relates to a broad area of varying size, the values of Spec and Acc are prone to optimistic and have little significance as image segmentation performance parameters. Although both Spec and Acc calculated values are greater than 0.99, there is not much reference value for performance evaluation.
According to experimental results, the main component analysis has a certain feasibility when applied to focus segmentation, and although the segmentation effect of the method applied to clinical medical images is not as good as that of a simulation image, the segmentation result can reach an ideal state on the basis of adding training data and improving an algorithm.
The data of the model constructed by the invention adopts simulated human craniocerebral magnetic resonance imaging (Magnetic Resonance Imaging, MRI) sequence data from BrainWeb (http:// brainWeb. Bic. Mni. Mcgill. Ca/brainWeb /). The brain web database is a simulated brain database (Simulated brain database, SBD) established by the university of montreal neuroscience study, canada, and aims to provide a solution platform for computing biologically generated data obtained consistently in vitro. The magnetic resonance imaging modes have Proton Density (PD) weighting, T1 weighting and T2 weighting. The data containing focus images in the magnetic resonance imaging sequence data set is used as a training set to enable a model to learn, and the purpose is to find the relevance of focuses and non-focuses in the images in terms of feature vectors. The "learned" model is used to image segment the test set data in the unknown magnetic resonance imaging sequence dataset. The segmentation results of the test group are compared with corresponding "real data" (i.e., gold standard images) provided by the brain web site, and four performance parameters, namely, dice similarity coefficient (Dice similarity coefficient, DSC), sensitivity (Sens), specificity (Spec), and accuracy (Acc), are calculated to evaluate the performance of the segmentation algorithm.
While the present invention has been described in detail with reference to the drawings, the present invention is not limited to the above embodiments, and various changes can be made without departing from the spirit of the present invention within the knowledge of those skilled in the art.

Claims (1)

1. A method of image segmentation based on principal component analysis, characterized by: the method comprises the following steps:
s1, downloading a magnetic resonance imaging sequence data set, selecting a three-dimensional image containing focus voxels in the magnetic resonance imaging sequence data set to perform fault, obtaining a plurality of fault images containing focus voxels, forming a data set by the plurality of fault images containing focus voxels, and taking the data set containing focus voxels as a training set;
s2, voxels in a tomographic image containing focus voxels in the training set can be divided into focus voxels and non-focus voxels, the data dimension of the voxels is reduced by utilizing principal component analysis, and the focus and non-focus in the magnetic resonance imaging sequence data are classified by utilizing the distance measure as a classification basis;
s3, reading a group of unknown data from a magnetic resonance imaging sequence data set as a test group, classifying the test group image containing focus voxels by using a constructed classification model, dividing the voxels in the image into focus and non-focus according to a distance threshold, respectively marking focus voxels and non-focus voxels by using 1 and 0 to obtain a binarized image, and removing the voxels with the value of 0 to obtain a segmented image with focus voxels;
s4, reading in a gold standard image corresponding to the real data of the corresponding test group data, namely, a magnetic resonance imaging image of the segmented accurate focus voxels, analyzing the segmented image obtained by the model according to the segmentation performance evaluation parameters, and storing the evaluation result into an Excel table for analysis;
the step S2 specifically includes the following steps:
1) Extracting a data matrix: for the images in a training set data set, extracting gray values of all focus and non-focus voxels and forming two corresponding vectors, which are marked as x and x'; because the whole training set data set contains N pictures, a non-focus voxel data matrix G with N x M dimensions can be obtained x And a focus voxel data matrix L x The method comprises the steps of carrying out a first treatment on the surface of the Wherein M is the number of focus voxels, and the number of focus voxels is assumed to be the same as the number of non-focus voxels, and M is all the number;
2) Data matrix centralization: before principal component analysis, the data matrix needs to be centered, and the data matrix G x And L x Respectively calculating column mean and column variance of each matrix, subtracting corresponding column mean from each data matrix, and dividing by corresponding column variance to obtain data matrix G x And L x Is at the origin position;
3) Principal component analysis dimension reduction: assuming a is a matrix of M x N, then a=uΣv is decomposed by singular values T Will get U, sigma, V T Three matrices; wherein U is a square matrix of M, and is a matrix composed of eigenvectors of the matrix A; Σ is a diagonal matrix of m×n, the elements on the diagonal of which are called eigenvalues; v (V) T The transpose of V is a matrix of N x N whose columns can be considered as a set of basis vectors representing the vector direction of the principal component; the feature vector corresponding to the largest feature value represents the data matrix G x 、L x The maximum covariance exists in the principal component direction, namely the maximum covariance exists in the projection of a low-dimensional coordinate system, and the feature vector corresponding to the feature value with the large front I term is reserved to approximately describe the matrix; wherein I represents the total number of terms of the feature vector corresponding to the feature value reserved for approximating the description matrix;
4) Data matrix basis conversion: to transform data matrix G x 、L x Is such that itHaving a lower dimension, can utilize the first 99% of the feature vectors obtained and the data matrix G x 、L x Multiplying; because of the data matrix G x ,L x The eigenvectors of (a) are not necessarily the same, the data matrix G x ,L x Performing a secondary transformation such that they are projected onto the same basis;
5) Classifying according to the distance: after obtaining the focus and non-focus data matrix under the condition of the same base, respectively calculating the distances from the value of the new data on the base to all values in the non-focus matrix and the focus matrix, averaging the two groups of distances, and observing which group has smaller average value: if the average value of the distances from the new data to the set of non-lesion matrices is smaller, classifying it as non-lesion; and vice versa classifies it as a lesion.
CN201910143931.XA 2019-02-27 2019-02-27 Image segmentation method based on principal component analysis Active CN109949307B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910143931.XA CN109949307B (en) 2019-02-27 2019-02-27 Image segmentation method based on principal component analysis

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910143931.XA CN109949307B (en) 2019-02-27 2019-02-27 Image segmentation method based on principal component analysis

Publications (2)

Publication Number Publication Date
CN109949307A CN109949307A (en) 2019-06-28
CN109949307B true CN109949307B (en) 2024-01-12

Family

ID=67007747

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910143931.XA Active CN109949307B (en) 2019-02-27 2019-02-27 Image segmentation method based on principal component analysis

Country Status (1)

Country Link
CN (1) CN109949307B (en)

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE69706684D1 (en) * 1996-07-09 2001-10-18 Secr Defence METHOD AND DEVICE FOR IMAGING ARTIFACT REDUCTION
EP2444934A1 (en) * 2010-10-19 2012-04-25 Koninklijke Philips Electronics N.V. Medical imaging system, computer-implemented method, and computer program product for identifying a treated region in a medical image
JPWO2012160970A1 (en) * 2011-05-20 2014-07-31 株式会社日立メディコ Magnetic resonance imaging apparatus and echo signal measurement method
CN106204545A (en) * 2016-06-28 2016-12-07 南方医科大学 A kind of based on region division and the medical science lesion image feature representation method of Fisher vector
CN106887039A (en) * 2017-02-28 2017-06-23 成都金盘电子科大多媒体技术有限公司 The three-D imaging method and system of a kind of organ and focus based on medical image
CN107292858A (en) * 2017-05-22 2017-10-24 昆明理工大学 A kind of multimode medical image fusion method based on low-rank decomposition and rarefaction representation
CN107644420A (en) * 2017-08-31 2018-01-30 西北大学 Blood-vessel image dividing method, MRI system based on central line pick-up
CN108257135A (en) * 2018-02-01 2018-07-06 浙江德尚韵兴图像科技有限公司 The assistant diagnosis system of medical image features is understood based on deep learning method
CN108460771A (en) * 2018-01-17 2018-08-28 昆明理工大学 A kind of carrying out image threshold segmentation method based on two-dimensional empirical mode decomposition and genetic algorithm
CN108846838A (en) * 2018-06-04 2018-11-20 卢龙 A kind of semi-automatic lesion image dividing method of three-dimensional MRI and system
CN108921821A (en) * 2018-06-01 2018-11-30 中国人民解放军战略支援部队信息工程大学 Method of discrimination based on the LASSO mammary cancer armpit lymph gland transfering state returned

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012096882A1 (en) * 2011-01-11 2012-07-19 Rutgers, The State University Of New Jersey Method and apparatus for segmentation and registration of longitudinal images
JP2012160970A (en) * 2011-02-01 2012-08-23 Ntt Electornics Corp Phase modulation device

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE69706684D1 (en) * 1996-07-09 2001-10-18 Secr Defence METHOD AND DEVICE FOR IMAGING ARTIFACT REDUCTION
EP2444934A1 (en) * 2010-10-19 2012-04-25 Koninklijke Philips Electronics N.V. Medical imaging system, computer-implemented method, and computer program product for identifying a treated region in a medical image
JPWO2012160970A1 (en) * 2011-05-20 2014-07-31 株式会社日立メディコ Magnetic resonance imaging apparatus and echo signal measurement method
CN106204545A (en) * 2016-06-28 2016-12-07 南方医科大学 A kind of based on region division and the medical science lesion image feature representation method of Fisher vector
CN106887039A (en) * 2017-02-28 2017-06-23 成都金盘电子科大多媒体技术有限公司 The three-D imaging method and system of a kind of organ and focus based on medical image
CN107292858A (en) * 2017-05-22 2017-10-24 昆明理工大学 A kind of multimode medical image fusion method based on low-rank decomposition and rarefaction representation
CN107644420A (en) * 2017-08-31 2018-01-30 西北大学 Blood-vessel image dividing method, MRI system based on central line pick-up
CN108460771A (en) * 2018-01-17 2018-08-28 昆明理工大学 A kind of carrying out image threshold segmentation method based on two-dimensional empirical mode decomposition and genetic algorithm
CN108257135A (en) * 2018-02-01 2018-07-06 浙江德尚韵兴图像科技有限公司 The assistant diagnosis system of medical image features is understood based on deep learning method
CN108921821A (en) * 2018-06-01 2018-11-30 中国人民解放军战略支援部队信息工程大学 Method of discrimination based on the LASSO mammary cancer armpit lymph gland transfering state returned
CN108846838A (en) * 2018-06-04 2018-11-20 卢龙 A kind of semi-automatic lesion image dividing method of three-dimensional MRI and system

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
L. Gao.Focused ion beam milled CoPt magnetic force microscopy tips for high resolution domain images.《 IEEE Transactions on Magnetics》.2004,2194-2196. *
Shaoping Sun.3D visualization system for medical image based on VTK and OK Series Image Board.《 2011 International Conference on Computer Science and Service System》.2011,951-954. *
宗晓萍 等.采用K-means的脑肿瘤磁共振图像分割与特征提取.《计算机工程与应用》.2019,187-193. *
相艳 等.利用多谱图像分割多发性硬化症病灶的新方法.《生物医学工程学杂志》.2015,330-335. *

Also Published As

Publication number Publication date
CN109949307A (en) 2019-06-28

Similar Documents

Publication Publication Date Title
Song et al. A modified probabilistic neural network for partial volume segmentation in brain MR image
Akhondi-Asl et al. A logarithmic opinion pool based STAPLE algorithm for the fusion of segmentations with associated reliability weights
Akselrod-Ballin et al. Automatic segmentation and classification of multiple sclerosis in multichannel MRI
Putra et al. Enhanced skin condition prediction through machine learning using dynamic training and testing augmentation
Chavan et al. Detection and classification of brain tumors
Zhang et al. Intelligent scanning: Automated standard plane selection and biometric measurement of early gestational sac in routine ultrasound examination
CN109993230B (en) TSK fuzzy system modeling method for brain function magnetic resonance image classification
Nitzken et al. Improving full-cardiac cycle strain estimation from tagged CMR by accurate modeling of 3D image appearance characteristics
CN101739681B (en) Related prediction model-based method for detecting structural deformation in magnetic resonance image
Hasan et al. Automated screening of MRI brain scanning using grey level statistics
CN103295031B (en) A kind of image object method of counting based on canonical risk minimization
Zhang et al. A supervised texton based approach for automatic segmentation and measurement of the fetal head and femur in 2D ultrasound images
Onal et al. MRI-based segmentation of pubic bone for evaluation of pelvic organ prolapse
CN106204545A (en) A kind of based on region division and the medical science lesion image feature representation method of Fisher vector
Pokrajac et al. Applying spatial distribution analysis techniques to classification of 3D medical images
Taschler et al. Spatial modeling of multiple sclerosis for disease subtype prediction
CN109949307B (en) Image segmentation method based on principal component analysis
Rahim et al. A diffeomorphic mapping based characterization of temporal sequences: application to the pelvic organ dynamics assessment
Cetindag et al. Transfer Learning Methods for Using Textural Features in Histopathological Image Classification
Perez et al. Diffusion weighted imaging of prostate cancer: prediction of cancer using texture features from parametric maps of the monoexponential and kurtosis functions
Mihaylova et al. A brief survey of spleen segmentation in MRI and CT images
Lei et al. Automatic grading of placental maturity based on LIOP and fisher vector
Zhang et al. Graph-based whole body segmentation in fetal MR images
Chen et al. A supervised hybrid classifier for brain tissues and white matter lesions on multispectral MRI
CN115240014B (en) Medical image classification system based on residual error neural network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant