CN106023138A - Global probability fiber tracking method based on spherical convolution - Google Patents

Global probability fiber tracking method based on spherical convolution Download PDF

Info

Publication number
CN106023138A
CN106023138A CN201610292345.8A CN201610292345A CN106023138A CN 106023138 A CN106023138 A CN 106023138A CN 201610292345 A CN201610292345 A CN 201610292345A CN 106023138 A CN106023138 A CN 106023138A
Authority
CN
China
Prior art keywords
fiber
probability
phi
path
convolution
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.)
Granted
Application number
CN201610292345.8A
Other languages
Chinese (zh)
Other versions
CN106023138B (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.)
Yuenaoyunfu Medical Information Technology Zhejiang Co ltd
Original Assignee
Zhejiang University of Technology ZJUT
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 Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201610292345.8A priority Critical patent/CN106023138B/en
Publication of CN106023138A publication Critical patent/CN106023138A/en
Application granted granted Critical
Publication of CN106023138B publication Critical patent/CN106023138B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00Image analysis
    • G06T7/0002Inspection of images, e.g. flaw detection
    • G06T7/0012Biomedical image inspection
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00Indexing scheme for image analysis or image enhancement
    • G06T2207/10Image acquisition modality
    • G06T2207/10072Tomographic images
    • G06T2207/10088Magnetic resonance imaging [MRI]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00Indexing scheme for image analysis or image enhancement
    • G06T2207/30Subject of image; Context of image processing
    • G06T2207/30004Biomedical image processing
    • G06T2207/30016Brain

Landscapes

  • Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Nuclear Medicine, Radiotherapy & Molecular Imaging (AREA)
  • Radiology & Medical Imaging (AREA)
  • Health & Medical Sciences (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Image Analysis (AREA)
  • Complex Calculations (AREA)

Abstract

The invention provides a global probability fiber tracking method based on spherical convolution. The method comprises the steps that fiber orientation distribution on a unit sphere is calculated through the convolution of a diffusion signal and a response function; the original fiber orientation distribution fODF is replaced by a spherical Gaussian kernel method to acquire a group of new fODF; global probability fiber tracking based on a group tracking algorithm is carried out to acquire prior probability and observation density, and then posterior distribution is calculated; on the basis of the posterior distribution, the sum and average of global fiber functions are calculated; a tracking start point is established to start tracking; and a relatively accurate fiber structure is acquired by choosing the best direction. The global probability fiber tracking method based on spherical convolution effectively considers local fiber orientation distribution and has high precision.

Description

A kind of global probability fiber tracking method based on spherical convolution
Technical field
The present invention relates to the medical imaging under computer graphics, neuroanatomy field, especially a kind of fiber tracking Method.
Background technology
Fibre straighteness is to obtain neuromechanism and dissect unique work of link information based on DWI molding Tool;It estimates possible fiber path by the diffusion directions following the tracks of local tensors orientation;Fiber path is with a complex web Nerve fibre bundle in the form performance human brain of network chart, and by its investigation nuerological pathology and sick crowd;Actual card Bright, in definitiveness tracking technique, fiber path remains variation, it is impossible to pseudo-at noise, division, head movement and image The uncertainty of track is reconstructed under the influence of shadow;In order to overcome these to limit, fibre straighteness method is developed to quantify Uncertainty with visualization with fiber path;Research worker began to use some fine angular resolution diffusion imaging methods in recent years Realize probabilistic algorithm.
Summary of the invention
In order to overcome the deficiency that local fiber distribution of orientations, precision are relatively low that cannot consider of existing fiber tracking mode, this Based on spherical convolution the global probability fiber tracking that invention provides a kind of effective consideration local fiber distribution of orientations, precision is higher Method.
The technical solution adopted for the present invention to solve the technical problems is:
A kind of global probability fiber tracking method based on spherical convolution, comprises the steps:
1) diffusion model is estimated
By solving a linear system and reclaiming sphere gaussian kernel problem estimation spherical convolution SD, S (g)/S0With N number of ladder Degree direction g approximation is by the convolution of receptance functionAnd the fiber orientation distribution in unit sphereRepresent:
S ( g ) / S 0 = F ( x ^ ) ⊗ R ( g , x ^ ) - - - ( 1 )
Wherein,Being sample convolution direction, definition receptance function is:
R ( g , x ^ ) = e - δ ( g · x ^ ) 2 - - - ( 2 )
δ is the product of diffusion time and diffusion coefficient, therefore by S (g)/S0WithObtain fiber orientation distributionEstimate by minimizing following energy:
E = Σ i = 1 N ( S ( g ) / S 0 - Σ j = i M e - δ ( g · x ^ ) 2 F j x ^ ( x ^ ) ) 2 - - - ( 3 )
It is expressed as a linear system by non-negative least square method;It is jth fiber orientation distribution, passes through ball It is each that face gaussian kernel method substitutes the humorous recovery of ballTo regainIn:
f ( x ^ ) = F ( x ^ ) · G ( g , x ^ ) - - - ( 4 )
Wherein,σ is width parameter;
2) whole world probability fiber tracking, process is as follows:
From x on the c of path0To xnGlobal cost function at the effect lower aprons of α be:
E ( c ( x 0 → x n ) ) = α Σ i - 1 n p ( v i , x i ) - - - ( 5 )
Cost function p (vi,xi) it is xiPoint selection direction viProbability;For each step, direction viIt is from probability density letter Number p (vi|vi-1, Φ) and sampling obtains, and it is to be represented by a Bayesian frame:
p ( v i | v i - 1 , Φ ) = p ( Φ | v i ) p ( v i | v i - 1 ) p ( Φ ) - - - ( 6 )
Wherein, Φ is the observed value of one group of three-dimensional diffusion weighted imaging volume, and p (Φ) is a fixed standard of this system The factor, distribution p (vi|vi-1) be defined as priori conditions and obtained by a simple component cloth;Observing and nursing p (Φ | vi) generation For in formula (4)
p ( Φ | v i ) = f ( x ^ ) - - - ( 7 )
After priori and observation density are all calculated, Posterior distrbutionp p (vi|vi-1, Φ) drawn by formula (5);Finally, Use MCMC technology from p (vi|vi-1, Φ) and draw the random sample of machine direction;Definition EsumAnd EaveAs from a-quadrant to B Two of region measurements connect, and represent summation and the meansigma methods of whole world fiber function respectively:
E s u m ( c ( x 0 ∈ A → x n ∈ B ) ) = α Σ i = 0 n p ( v i | v i - 1 , Φ ) E a v e ( c ( x 0 ∈ A → x n ∈ B ) ) = α n + 1 Σ i = 0 n p ( v i | v i - 1 , Φ ) - - - ( 8 )
EaveRepresent the quantity of point, for every fiber average probability, EaveRepresent the meansigma methods in path, but it is likely to answer For too high EsumValue and mistake indicate some short or dead paths, and EsumExplicitly indicating that the summation in path, positive is relevant Property may come from some irrational paths;So needing two global measurings to be used for selecting optimal path;
2) group's track algorithm, process is as follows:
Distribute m particle in starting point on one path and elapse propagation over time;At step number t-1 i.e. viAnd x (t-1)i (t-1), under i=1....m and step-length α, order propagates, at next step, the function that granule is previous step, it may be assumed that
v i ( t ) = v i ( t - 1 ) + v i L ( t ) , i f k = 1 v f i ( t ) , i f k > 1 - - - ( 9 )
xi(t+1)=xi(t)+αvi(t), i=1 ..., m (10)
Refer to local fiber be oriented in step t from formula (6) andSampled representation whole world fibre orientation;It is Adaptive value according to all particles is selected: for each iteration k, k is parameter, and d top fibers descending is stored asWithD is parameter;According to EsumAnd EaveThe two is rung The measurement answered, therefore optimal fiber fk:
f k ( f ( 1 ) , f ( 2 ) , ... f ( p ) ) = f k s u m ∩ f k a v e - - - ( 11 )
WithRepresenting summation and the meansigma methods of optimal fiber respectively, p is coefficient;All of voxel x1,2,...,mEvery Individual fiber fkIt is stored in archive Γ:
Γ = { x 1 ( v 1 1 , v 1 2 , ... , v 1 n ) , x 2 ( v 2 1 , v 2 2 , ... , v 2 n ) , ... , x m ( v m 1 , v m 2 , ... , v m n ) } - - - ( 12 )
Wherein, m > 0, n > 0,It it is n the path fibre orientation through voxel x;N=0 represents this voxel in formula (12) In be unnecessary whileIt is suitable;Assume that a particle propagation is by currently putting xiIt is v with the vector before iti-1, one Good orientation viIt is then and vi-1Lowest difference fromObtaining, formula is i.e.
The technology of the present invention is contemplated that: first with the fiber in the convolutional calculation unit sphere of diffusion signal and receptance function Distribution of orientations, then replace original fODF by sphere gaussian kernel method, obtain one group of new fODF.
Global probability fiber tracking based on group's track algorithm, after obtaining prior probability and observation density, calculates posteriority Distribution;Summation and the meansigma methods of whole world fiber function it is calculated on the basis of learning Posterior distrbutionp.Set up tracking initiation point Start to follow the tracks of, by selecting optimum orientation to obtain relatively accurate fibre structure.
Beneficial effects of the present invention is mainly manifested in: effectively consider that local fiber distribution of orientations, precision are higher;The side of cooperation Formula obtains optimal fibre structure.
Detailed description of the invention
The invention will be further described below.
A kind of global probability fiber tracking method based on spherical convolution, comprises the steps:
1) diffusion model is estimated
By solving a linear system and reclaiming sphere gaussian kernel problem estimation spherical convolution SD, S (g)/S0With N number of ladder Degree direction g can approximate by the convolution of receptance functionAnd the fiber orientation distribution fODF in unit sphere,Table Show:
S ( g ) / S 0 = F ( x ^ ) ⊗ R ( g , x ^ ) - - - ( 1 )
Wherein,Being sample convolution direction, definition receptance function is:
R ( g , x ^ ) = e - δ ( g · x ^ ) 2 - - - ( 2 )
δ is the product of diffusion time and diffusion coefficient, therefore by S (g)/S0WithObtain fiber orientation distribution FODF,Estimate by minimizing following energy:
E = Σ i = 1 N ( S ( g ) / S 0 - Σ j = i M e - δ ( g · x ^ ) 2 F j x ^ ( x ^ ) ) 2 - - - ( 3 )
It is expressed as a linear system by non-negative least square method;It is jth fiber orientation distribution fODF, Last in order to prevent the sensitivity to noise, substitute the humorous recovery of ball by sphere gaussian kernel method eachTo regaining 'sIn:
f ( x ^ ) = F ( x ^ ) · G ( g , x ^ ) - - - ( 4 )
Wherein,σ is width parameter, and this numerical value structure is for preventing from merging deficiency Or angular resolution reduces.
2) whole world probability fiber tracking, process is as follows:
From x on the c of path0To xnGlobal cost function at the effect lower aprons of α be:
E ( c ( x 0 → x n ) ) = α Σ i = 1 n p ( v i , x i ) - - - ( 5 )
Cost function p (vi,xi) it is xiPoint selection direction viProbability;For each step, direction viIt is from probability density letter Number p (vi|vi-1, Φ) and sampling obtains, and it is to be represented by a Bayesian frame:
p ( v i | v i - 1 , Φ ) = p ( Φ | v i ) p ( v i | v i - 1 ) p ( Φ ) - - - ( 6 )
Wherein, Φ is the observed value of one group of three-dimensional diffusion weighted imaging volume, and p (Φ) is a fixed standard of this system The factor, distribution p (vi|vi-1) be defined as priori conditions and obtained by a simple component cloth;Observing and nursing p (Φ | vi) generation For in formula (4)
p ( Φ | v i ) = f ( x ^ ) - - - ( 7 )
After priori and observation density are all calculated, Posterior distrbutionp p (vi|vi-1, Φ) drawn by formula (5);Finally, Use MCMC technology from p (vi|vi-1, Φ) and draw the random sample of machine direction;Definition EsumAnd EaveAs from a-quadrant to B Two of region measurements connect, and represent summation and the meansigma methods of whole world fiber function respectively:
E s u m ( c ( x 0 ∈ A → x n ∈ B ) ) = α Σ i = 0 n p ( v i | v i - 1 , Φ ) E a v e ( c ( x 0 ∈ A → x n ∈ B ) ) = α n + 1 Σ i = 0 n p ( v i | v i - 1 , Φ ) - - - ( 8 )
EaveRepresent the quantity of point, for every fiber average probability, EaveRepresent the meansigma methods in path, but it is likely to answer For too high EsumValue and mistake indicate some short or dead paths, and EsumExplicitly indicating that the summation in path, positive is relevant Property may come from some irrational paths;So needing two global measurings to be used for selecting optimal path;
2) group's track algorithm, process is as follows:
Distribute m particle in starting point on one path and elapse propagation over time;At step number t-1 i.e. viAnd x (t-1)i (t-1), under i=1....m and step-length α, order propagates, at next step, the function that granule is previous step, it may be assumed that
v i ( t ) = v i ( t - 1 ) + v i L ( t ) , i f k = 1 v f i ( t ) , i f k > 1 - - - ( 9 )
xi(t+1)=xi(t)+αvi(t), i=1 ..., m (10)
Refer to local fiber be oriented in step t from formula (6) andSampled representation whole world fibre orientation;It is Adaptive value according to all particles is selected: for each iteration k, k is parameter, and d top fibers descending is stored asWithD is parameter;According to EsumAnd EaveThe two is rung The measurement answered, therefore optimal fiber fk:
f k ( f ( 1 ) , f ( 2 ) , ... f ( p ) ) = f k s u m ∩ f k a v e - - - ( 11 )
WithRepresenting summation and the meansigma methods of optimal fiber respectively, p is coefficient;All of voxel x1,2,...,mEvery Individual fiber fkIt is stored in archive Γ:
Γ = { x 1 ( v 1 1 , v 1 2 , ... , v 1 n ) , x 2 ( v 2 1 , v 2 2 , ... , v 2 n ) , ... , x m ( v m 1 , v m 2 , ... , v m n ) } - - - ( 12 )
Wherein, m > 0, n > 0,It it is n the path fibre orientation through voxel x;N=0 represents this voxel in formula (12) In be unnecessary whileIt is suitable;Assume that a particle propagation is by currently putting xiIt is v with the vector before iti-1, one Good orientation viIt is then and vi-1Lowest difference fromObtaining, formula is i.e.

Claims (1)

1. a global probability fiber tracking method based on spherical convolution, it is characterised in that: comprise the steps:
1) diffusion model is estimated
By solving a linear system and reclaiming sphere gaussian kernel problem estimation spherical convolution SD, S (g)/S0With N number of gradient side To g approximation by the convolution of receptance functionAnd the fiber orientation distribution in unit sphereRepresent:
S ( g ) / S 0 = F ( x ^ ) ⊗ R ( g , x ^ ) - - - ( 1 )
Wherein,Being sample convolution direction, definition receptance function is:
R ( g , x ^ ) = e - δ ( g · x ^ ) 2 - - - ( 2 )
D is the product of diffusion time and diffusion coefficient, therefore by S (g)/S0WithObtain fiber orientation distributionLogical Cross and minimize following energy and estimate:
It is expressed as a linear system by non-negative least square method;It is jth fiber orientation distribution, high by sphere It is each that this kernel method substitutes the humorous recovery of ballTo the fODF regainedIn:
f ( x ^ ) = F ( x ^ ) · G ( g , x ^ ) - - - ( 4 )
Wherein,σ is width parameter;
2) whole world probability fiber tracking, process is as follows:
From x on the c of path0To xnGlobal cost function at the effect lower aprons of α be:
E ( c ( x 0 → x n ) ) = α Σ i - 1 n p ( v i , x i ) - - - ( 5 )
Cost function p (vi,xi) it is xiPoint selection direction viProbability;For each step, direction viIt is from probability density function p (vi|vi-1, Φ) and sampling obtains, and it is to be represented by a Bayesian frame:
p ( v i | v i - 1 , Φ ) = p ( Φ | v i ) p ( v i | v i - 1 ) p ( Φ ) - - - ( 6 )
Wherein, Φ is the observed value of one group of three-dimensional diffusion weighted imaging volume, p (Φ) be this system a fixed standard because of Son, distribution p (vi|vi-1) be defined as priori conditions and obtained by a simple component cloth;Observing and nursing p (Φ | vi) replace In formula (4)
p ( Φ | v i ) = f ( x ^ ) - - - ( 7 )
After priori and observation density are all calculated, Posterior distrbutionp p (vi|vi-1, Φ) drawn by formula (5);Finally, use MCMC technology is from p (vi|vi-1, Φ) and draw the random sample of machine direction;Definition EsumAnd EaveAs from a-quadrant to B region Two measurements connect, represent the whole world summation of fiber function and meansigma methods respectively:
E s u m ( c ( x 0 ∈ A → x n ∈ B ) ) = α Σ i = 0 n p ( v i | v i - 1 , Φ ) E a v e ( c ( x 0 ∈ A → x n ∈ B ) ) = α n + 1 Σ i = 0 n p ( v i | v i - 1 , Φ ) - - - ( 8 )
EaveRepresent the quantity of point, for every fiber average probability, EaveRepresent the meansigma methods in path, but it is likely to should be High EsumValue and mistake indicate some short or dead paths, and EsumExplicitly indicating that the summation in path, positive dependency can Can come from some irrational paths;So needing two global measurings to be used for selecting optimal path;
2) group's track algorithm, process is as follows:
Distribute m particle in starting point on one path and elapse propagation over time;At step number t-1 i.e. viAnd x (t-1)i(t- 1), under i=1....m and step-length α, order propagates, at next step, the function that granule is previous step, it may be assumed that
v i ( t ) = v i ( t - 1 ) + v i L ( t ) , i f k = 1 v f i ( t ) , i f k > 1 - - - ( 9 )
xi(t+1)=xi(t)+αvi(t), i=1 ..., m (10)
Refer to local fiber be oriented in step t from formula (6) andSampled representation whole world fibre orientation;It is according to institute The adaptive value having particle is selected: for each iteration k, k is parameter, and d top fibers descending is stored asWithD is parameter;According to EsumAnd EaveThe two is rung The measurement answered, therefore optimal fiber fk:
f k ( f ( 1 ) , f ( 2 ) , ... f ( p ) ) = f k s u m ∩ f k a v e - - - ( 11 )
WithRepresenting summation and the meansigma methods of optimal fiber respectively, p is coefficient;All of voxel x12...mEach fiber fkIt is stored in archive Γ:
Γ = { x 1 ( v 1 1 , v 1 2 , ... , v 1 n ) , x 2 ( v 2 1 , v 2 2 , ... , v 2 n ) , ... , x m ( v m 1 , v m 2 , ... , v m n ) } - - - ( 12 )
Wherein, m > 0, n > 0,It it is n the path fibre orientation through voxel x;N=0 represents this voxel While unnecessaryIt is suitable;Assume that a particle propagation is by currently putting xiIt is v with the vector before iti-1, one optimal Orientation viIt is then and vi-1Lowest difference fromObtaining, formula is i.e.
CN201610292345.8A 2016-05-04 2016-05-04 A kind of global probability fiber tracking method based on spherical convolution Active CN106023138B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610292345.8A CN106023138B (en) 2016-05-04 2016-05-04 A kind of global probability fiber tracking method based on spherical convolution

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610292345.8A CN106023138B (en) 2016-05-04 2016-05-04 A kind of global probability fiber tracking method based on spherical convolution

Publications (2)

Publication Number Publication Date
CN106023138A true CN106023138A (en) 2016-10-12
CN106023138B CN106023138B (en) 2018-10-23

Family

ID=57081890

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610292345.8A Active CN106023138B (en) 2016-05-04 2016-05-04 A kind of global probability fiber tracking method based on spherical convolution

Country Status (1)

Country Link
CN (1) CN106023138B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112489220A (en) * 2020-10-23 2021-03-12 浙江工业大学 Nerve fiber continuous tracking method based on flow field distribution

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6697538B1 (en) * 1999-07-30 2004-02-24 Wisconsin Alumni Research Foundation Apparatus for producing a flattening map of a digitized image for conformally mapping onto a surface and associated method
CN103970929A (en) * 2013-12-23 2014-08-06 浙江工业大学 High-order diffusion tensor mixture sparse imaging method for alba fiber tracking

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6697538B1 (en) * 1999-07-30 2004-02-24 Wisconsin Alumni Research Foundation Apparatus for producing a flattening map of a digitized image for conformally mapping onto a surface and associated method
CN103970929A (en) * 2013-12-23 2014-08-06 浙江工业大学 High-order diffusion tensor mixture sparse imaging method for alba fiber tracking

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
BEN JEURISSEN ET AL: "Probabilistic fiber tracking using the residual bootstrap with constrained spherical deconvolution", 《HUMAN BRAIN MAPPING》 *
赵欣 等: "一种重建脑白质内神经纤维的新算法", 《生物医学工程与临床》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112489220A (en) * 2020-10-23 2021-03-12 浙江工业大学 Nerve fiber continuous tracking method based on flow field distribution

Also Published As

Publication number Publication date
CN106023138B (en) 2018-10-23

Similar Documents

Publication Publication Date Title
CN106780569A (en) A kind of human body attitude estimates behavior analysis method
CN106339998A (en) Multi-focus image fusion method based on contrast pyramid transformation
CN102289808B (en) A kind of image co-registration method for evaluating quality and system
CN102204819A (en) Swarm optimization-based alba fiber tracking method
CN106407633A (en) Method and system for estimating ground PM2.5 based on space-time regression Kriging model
CN101558996A (en) Gait recognition method based on orthogonal projection three-dimensional reconstruction of human motion structure
CN103197299A (en) Extraction and quantitative analysis system of weather radar radial wind information
CN109993230A (en) A kind of TSK Fuzzy System Modeling method towards brain function MRI classification
CN103236046A (en) Fractional order adaptive coherent speckle filtering method based on image form fuzzy membership degree
CN103810712B (en) Energy spectrum CT (computerized tomography) image quality evaluation method
CN106157616B (en) A kind of magnitude of traffic flow short-term prediction device
CN110348459A (en) Based on multiple dimensioned quick covering blanket method sonar image fractal characteristic extracting method
CN112419203A (en) Diffusion weighted image compressed sensing recovery method and device based on countermeasure network
CN106023138A (en) Global probability fiber tracking method based on spherical convolution
CN105654061A (en) 3D face dynamic reconstruction method based on estimation compensation
CN112700508B (en) Multi-contrast MRI image reconstruction method based on deep learning
CN104504657B (en) Method and device for de-noising magnetic resonance diffusion tensor
CN106023179A (en) SAR image coastline extracting method based on geometric active contour model
CN105467342B (en) Magnetic resonance multichannel collecting image rebuilding method and device
CN102298768B (en) High-resolution image reconstruction method based on sparse samples
Beach et al. An adaptive approach to decomposing patient-motion tracking data acquired during cardiac SPECT imaging
CN104586394B (en) Method and system for removing magnetic resonance diffusion tensor imaging noise
Hossain et al. Local likelihood disease clustering: development and evaluation
CN101278316B (en) System and method for automatic segmentation of vessels in breast MR sequences
CN110470743A (en) Electricity/ultrasound information fusion double-modal tomography method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20211227

Address after: 310053 2301a, building B, 4760 Jiangnan Avenue, Puyan street, Binjiang District, Hangzhou, Zhejiang

Patentee after: Yuenaoyunfu medical information technology (Zhejiang) Co.,Ltd.

Address before: The city Zhaohui six districts Chao Wang Road Hangzhou City, Zhejiang province 310014 18

Patentee before: ZHEJIANG University OF TECHNOLOGY

TR01 Transfer of patent right