CN102509273A - Tumor segmentation method based on homogeneous pieces and fuzzy measure of breast ultrasound image - Google Patents

Tumor segmentation method based on homogeneous pieces and fuzzy measure of breast ultrasound image Download PDF

Info

Publication number
CN102509273A
CN102509273A CN2011103715869A CN201110371586A CN102509273A CN 102509273 A CN102509273 A CN 102509273A CN 2011103715869 A CN2011103715869 A CN 2011103715869A CN 201110371586 A CN201110371586 A CN 201110371586A CN 102509273 A CN102509273 A CN 102509273A
Authority
CN
China
Prior art keywords
pixel
theta
sigma
neighborhood
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.)
Granted
Application number
CN2011103715869A
Other languages
Chinese (zh)
Other versions
CN102509273B (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.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
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 University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN 201110371586 priority Critical patent/CN102509273B/en
Publication of CN102509273A publication Critical patent/CN102509273A/en
Application granted granted Critical
Publication of CN102509273B publication Critical patent/CN102509273B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Image Analysis (AREA)
  • Ultra Sonic Daignosis Equipment (AREA)

Abstract

The invention discloses a tumor segmentation method based on homogeneous pieces and fuzzy measure a breast ultrasound image, which comprises the following steps: (1), inputting the breast ultrasound image to be segmented; (2), margin detection for the image to be segmented; (3), defining the homogeneous piece; (4), defining a weighting function, considering the homogeneous pieces of each image pixel point as a fuzzy set, defining the fuzzy measure for measuring the diversity of the fuzzy set based on the margin information, the texture information and the space information, and defining the weighting function; and (5), achieving tumor segmentation. The invention has the advantages that (1), through defining the homogeneous pieces, the problem of selecting among the neighborhood windows in a traditional method is solved, the accuracy of the area statistics information is ensured, and the segmentation precision is improved; and (2), through the fuzzy measure and the homogeneous pieces, the weighting function is defined, the partial image misclassification is basically eliminated, the precision of the breast tumor segmentation is improved, and the favorable robustness is demonstrated at the same time.

Description

Lesion segmentation approach based on the breast ultrasound image of homogeneity sheet and fuzzy mearue
Technical field
The present invention relates to the Medical Ultrasound Image Processing technical field, particularly relate to a kind of lesion segmentation approach of the breast ultrasound image based on homogeneity sheet and fuzzy mearue.
Background technology
Breast cancer is one of modal malignant tumour of women, and its M & M accounts for the first place in women's diseases.Early stage diagnosis and treatment are the keys that improves the survival rates of breast cancer.Ultrasonic examination with its do not have wound, do not have special contraindication, repeatable strong, characteristics such as cost are widely used in the auxiliary detection of tumor of breast.Yet its accuracy often depends on doctor's clinical experience, has very strong subjectivity.In order to improve the objectivity of diagnosis, press for the development computer-aided diagnosis system in the clinical practice.
It is the important component part of computer-aided diagnosis system that ultrasonoscopy is cut apart.Yet, remain a pendent global problem cutting apart automatically of ultrasonoscopy so far owing to the existence of speckle noise, the pseudo-shadow of decay in the ultrasonoscopy makes.Particularly have under the characteristic situation such as similar gray scale or texture, very easily produce serious mistake branch phenomenon, caused bigger obstacle for cutting apart automatically of ultrasonoscopy at tumour and normal surrounding tissue.
Be a good selection semi-automatic the cutting apart of ultrasonoscopy.Movable contour model (Snake) is to use semi-automatic partition method the most widely.Along with the development of Level Set Method, the researcher has proposed the movable contour model based on level set, reaches the purpose of cutting apart through curve evolvement.Wherein geodesic line active contour (GAC) model is typical representative, and the GAC model has accurate edge positioning, the algorithm stability advantage of higher.But this model only utilizes the gradient information of image, receives noise effect easily, is difficult to be partitioned into the homogeneous region in the ill-defined image.And when the object in the image had the border of recessed, the GAC model possibly make the evolution curve stop at a certain local minimum state of value, and was not consistent with the border of object.
Belaid is with substituting gradient information with gray scale and the irrelevant phase information of grey scale change in theory; Level set partitioning algorithm (Belaid A., Boukerroui D., et al based on phase place were proposed in 2011; Phase-Based Level Set Segmentation of Ultrasound Images.TransactionInformation Technology in Biomedicine; 2011,15 (1): 138-147), solved the pseudo-shadow problem in the ultrasonoscopy to a certain extent.Yet, cut apart for the tangible galactophore image of textural characteristics and can not obtain desirable segmentation result because its CONSIDERING EDGE information is not only utilized texture information and spatial information simultaneously.
Normalized Cut (NCut) method is one of important for image segmentation, and the advantage of NCut method is to have embodied well the part of image and the marriage relation of the overall situation, has avoided not having and has cut apart partially.Utilize NCut method research ultrasonoscopy segmentation problem; Through setting up suitable weighted graph; Can in the definition of weighting function, introduce various image feature informations (like area information, marginal information and prior imformation etc.); Adopt the various thoughts of cutting apart, can obtain segmentation result accurately, so in the cutting apart of natural image and MRI medical image, be used widely.Yu and Shi have proposed improved based on NCut method (Yu S.; Shi J..Segmentationgiven partial grouping constraints.IEEE Transactions on Pattern Analysisand Machine Intelligence; 2004,26 (2): 173-183).This algorithm makes destination object under a spot of interactive operation through introducing part cluster priori (such as significant characteristics of image and target location), can from background, separate effectively, has also utilized sampling policy to reduce computation burden simultaneously.This method has obtained better segmentation effect at natural image, has caused widely to pay close attention to.But the NCut method is cut apart for the breast ultrasound image, and there be limited evidence currently of is seen relevant report.Simultaneously; Said method is directly applied to second-rate ultrasonoscopy mainly have following problem in cutting apart: how (1) selects suitable neighborhood; Even if it is suitable that the neighborhood window size is selected; Fixedly neighborhood possibly crossed over different tissue regions, thereby is difficult to guarantee the homogeney of neighborhood of pixels, finally causes pixel to be divided by mistake.(2) how to define the better weight of ultrasonoscopy segmentation performance still unresolved.(3) how to guarantee lesion segmentation result's robustness.
Summary of the invention
To above-mentioned prior art; The technical matters that the present invention will solve is a definition homogeneity sheet; And define weighting function on this basis based on homogeneity sheet and fuzzy mearue, and a kind of tumour automatic division method of breast ultrasound image is proposed, it has improved the wrong phenomenon of dividing of breast ultrasound image local; Avoid the decaying influence of pseudo-shadow improves segmentation precision and robustness simultaneously.
In order to solve the problems of the technologies described above, the present invention adopts following technical scheme: a kind of lesion segmentation approach of the breast ultrasound image based on homogeneity sheet and fuzzy mearue comprises the steps:
(1) input breast ultrasound image to be split;
(2) treat split image and carry out rim detection, comprising:
(2.1) adopt the breast ultrasound image texture features of importing in filter set and the clustering algorithm extraction step (1), generate the texture primitive characteristic image;
(2.2) through fuzzy mearue the multiple information of each image slices vegetarian refreshments is combined definition rim detection function; Calculate the edge energy of each pixel, generate initial edge figure, and carry out edge optimization; Finally obtain the outline map of original image, thereby accomplish rim detection;
(3) definition homogeneity sheet; Utilize the outline map that generates in the step (2) to be each image pixel definition homogeneity sheet, said homogeneity sheet is a kind of neighborhood that reflects the neighbor similarity relation; The structure of homogeneity sheet comprises the steps:
(3.1) be that search window is confirmed at the center with the current pixel point;
(3.2) the alligatoring stage: figure goes up the straight line of crossing all directions of current point in this search window of scanning on the edge of; If the edge energy value of pixel is less than given threshold value on certain direction straight line; Think that then this pixel is candidate's homologous pints, otherwise, with its eliminating and stop the scanning of this direction straight line;
(3.3) elaboration phase: for candidate's homologous pints; Further take micronization processes to judge whether it is real homologous pints; Then the remaining pixel that is not excluded is considered to the member in this homogeneity sheet in the current search window, and exists with the form of probability;
(4) definition weighting function; The homogeneity sheet of each image slices vegetarian refreshments in the step (3) is regarded as a fuzzy set, on this basis, defines a fuzzy mearue that is used for weighing the fuzzy set diversity, and define weighting function with it according to marginal information, texture information and spatial information;
(5) lesion segmentation; Adopt the weighting function of step (4) definition, the similarity between calculating pixel is to make up the weight matrix of entire image; With the coarse position information of tumour as prior imformation; Simultaneously ultrasonoscopy is carried out random sampling and reduce computation complexity, upgrade weight matrix, the partition problem that has most of scheming is become restricted minimization problem according to prior imformation of introducing and Sampling Strategies; At last; Carry out interior inserting through the weighting of the sample point adjacent and estimate, obtain estimation, thereby realize cutting apart tumour to the breast ultrasound image segmentation with non-sample point.
Further, in the said step (2.1), filter set comprises one group of odd even wave filter and one group of DOG wave filter, and the odd even wave filter is to 1 yardstick and 0 °; 22.5 °, 45 °, 67.5 °, 90 °; 112.5 °, 135 °, the input picture of 157.5 ° of 8 directions carries out convolutional filtering; The DOG wave filter carries out convolutional filtering to the input picture of 1 yardstick, and the filter response of each pixel is one group of high dimension vector, through clustering algorithm the high dimension vector of all pixels in the image is carried out cluster; Each cluster centre is one type of texture primitive, and each pixel of input picture is endowed the label of an affiliated texture primitive type, then generates the texture primitive characteristic image.
Further, the rim detection function described in the step (2.2) is: E ( p , θ t ) = Σ k = 1 K | E k L ( p , θ t ) - E k R ( p , θ t ) | + ( E k L ( p , θ t ) - E k R ( p , θ t ) ) 2 E k L ( p , θ t ) + E k R ( p , θ t )
K representes texture primitive classification number, is being the center with pixel p, and radius is in the circular neighborhood of R, along θ tDiameter on the direction is divided into left and right neighborhood with this neighborhood,
Figure BDA0000110706570000041
Figure BDA0000110706570000042
Be respectively this and put in the left neighborhood and the energy in the right neighborhood, wherein: E k L ( p , θ t ) = μ η p L ( k ) × d k L ( p , θ t ) , E k R ( p , θ t ) = μ η p R ( k ) × d k R ( p , θ t ) , μ η p L ( k ) , μ η p R ( k ) Belong to the degree of membership of k class texture primitive with the interior pixel of right neighborhood in the left neighborhood of remarked pixel point p respectively, and satisfy constraint condition Σ k = 1 K μ η p L ( k ) = 1 , Σ k = 1 K μ η p R ( k ) = 1 ; d k L ( p , θ t ) , d k R ( p , θ t ) Be illustrated respectively in θ tOn the direction, in the pixel p neighborhood left with it with right neighborhood in the similarity of the pixel that belongs to k class texture primitive,
Membership?
Figure BDA00001107065700000411
Figure BDA00001107065700000412
function expression is:
μ η p L ( k ) = Σ i ∈ L p δ ( T ( p i ) - k ) | L p | , μ η p R ( k ) = Σ i ∈ R p δ ( T ( p i ) - k ) | L p |
L wherein p, R pRepresent the set of all pixels in left neighborhood and the right neighborhood respectively, | ● | the gesture of expression set, p iBe any pixel in pixel p left side neighborhood or the right neighborhood, T (p i) be p iThe texture primitive category label, δ (g) is a Kronecker ' s delta function, if i.e. T (p i)=k is δ (T (p then i)-k)=1, otherwise δ (T (p i)-k)=0;
Similarity?
Figure BDA00001107065700000415
Figure BDA00001107065700000416
function expression is:
d k L ( p , θ t ) = | OE ( p , θ t ) - m k L ( p , θ t ) | , d k R ( p , θ t ) = | OE ( p , θ t ) - m k R ( p , θ t ) |
OE (p, θ wherein t) be that pixel p is at θ tOriented energy intensity on the direction, expression formula does
Figure BDA00001107065700000419
I is an input picture,
Figure BDA00001107065700000420
With
Figure BDA00001107065700000421
Be respectively that direction is θ tEven symmetry and odd symmetry wave filter;
Figure BDA00001107065700000422
Figure BDA00001107065700000423
Be respectively at θ tOn the direction, mean direction energy intensity in pixel p left side neighborhood and the right neighborhood,
The average energy intensity direction?
Figure BDA00001107065700000424
and?
Figure BDA00001107065700000425
The expression is:
m k L ( p , θ t ) = Σ i ∈ L p OE ( p i , θ t ) δ ( T ( p i ) - k ) Σ i ∈ L p δ ( T ( p i ) - k ) ,
m k R ( p , θ t ) = Σ i ∈ R p OE ( p i , θ t ) δ ( T ( p i ) - k ) Σ i ∈ R p δ ( T ( p i ) - k ) .
Further, said clustering algorithm is the K-Means algorithm.
Further, the search window described in the said step (3.1) confirm comprise the steps: that (x y) is the center, defines the search window that size is (2R+1) * (2R+1) a: N with the position of the pixel p on the outline map in image p(i, j)=wherein, R is the height and the width of search window, and the borderline pixel of search window is divided into two parts for x-R≤i≤x+R, y-R≤j≤y+R}, wherein, a 1 1 ( x - R , y + 1 ) , a 2 1 ( x - R , y ) , . . . , a 4 R + 2 1 ( x + R , y ) Represent the pixel of window edge the first half, a 1 2 ( x - R , y ) , a 2 2 ( x - R , y + 1 ) , . . . , a 4 R + 2 2 ( x + R , y - 1 ) Represent the pixel of window edge the latter half, the pixel of the first half traveled through in the direction of the clock, to the latter half pixel by traversal counterclockwise;
The alligatoring stage described in the said step (3.2) comprises the steps; The pixel of the first half and the latter half is chosen three continuous consecutive point respectively
Figure BDA0000110706570000054
Figure BDA0000110706570000055
Figure BDA0000110706570000056
Obtain corresponding three lines with central point respectively
Figure BDA0000110706570000057
Figure BDA0000110706570000058
Figure BDA0000110706570000059
The center line of certain direction in the point by point scanning search window then
Figure BDA00001107065700000510
When running into net point p j, calculate E Max(p, p j) value:
E max ( p , p j ) = max t ∈ L ( p , p j ) E * ( t )
Wherein, L (p, p j) be to a p from a p jThe set of all net points, E *(t) edge energy that obtains for the rim detection function calculation; If E Max(p, p j)≤τ sets up, and then thinks p jBe candidate's homologous pints, and continue scanning center's line; Otherwise, think p jNot candidate's homologous pints, and finish the scanning of center line;
Elaboration phase described in the said step (3.3) comprises the steps: for candidate's homologous pints p jCarry out micronization processes, judge that according to the angle difference judgment criterion whether it is homologous pints, at first representes corresponding straight line, then pp with vector form jAnd pa iBetween angle θ J, iBe defined as:
θ j , i = ∠ ( pp → j , pa → i ) = arccos ( pp → j ) T pa → i | | pp → j | | · | | pa → i | |
Similarly, can calculate pp jAnd pa k(k=i-1, the angle theta between i+1) J, i-1And θ I, i+1, in order to get rid of the false homologous pints in candidate's homologous pints, define a kind of angle difference judgment criterion:
Figure BDA0000110706570000061
The then remaining some p that is not excluded jBe exactly homogeneity sheet Ω pIn the point.
Further, the weighting function in the step (4) is:
Figure 211121114155
π wherein p, π qBe respectively homogeneity sheet Ω pAnd Ω qFuzzy set, r, σ are constant, d (π p, π q) be to be defined in two fuzzy mearues on the fuzzy set, expression formula is following:
d ( π p , π q ) = Σ k = K λ k μ π p ( k ) + ( 1 - λ k ) μ π q ( k ) - min ( μ π p ( k ) , μ π q ( k ) )
Wherein, K representes texture primitive classification number; Fuzzy set π pAnd π qBe defined as respectively π p = { ( k , μ π p ( k ) ) , k = 1,2 , . . . , K } , π q = { ( k , μ π q ( k ) ) , k = 1,2 , . . . , K } ; μ π p ( k ) , μ π q ( k ) Represent homogeneity sheet Ω respectively pAnd Ω qIn pixel belong to k (degree of membership of 1≤k≤K) type of texture primitive be defined as
μ π p ( k ) = Σ j ∈ Ω p m ( p , p j ) δ ( T ( p j ) - k ) Σ j ∈ Ω p m ( p , p j ) , μ π q ( k ) = Σ j ∈ Ω q m ( q , q j ) δ ( T ( q j ) - k ) Σ j ∈ Ω q m ( q , q j )
δ in the formula (g) is a Kronecker ' s delta function, m (p, p j) be pixel p in the step (3) jRefuse degree of receiving, λ kBe homogeneity sheet Ω pAnd Ω qBetween the regulation and control coefficient, its formula is:
λ k = H k ( p ) H k ( p ) + H k ( q )
H in the formula k(p) and H k(q) represent Ω respectively pAnd Ω qIn belong to k (1≤k≤K) type of total number of pixels of texture primitive.
Compared with prior art, the present invention has following beneficial effect:
(1) the present invention adopts fixedly neighborhood, but utilizes outline map to define a kind of dynamic neighborhood, i.e. homogeneity sheet; This homogeneity sheet can change according to different regional area situation adaptively; Has the uneven ability of the gray scale of processing; Because the homogeneity sheet has neighborhood homogeney and neighborhood adaptivity, like this, both solved the difficult problem that the neighborhood window is selected in the classic method; Guarantee the accuracy of regional statistical information again, helped improving the precision of cutting apart simultaneously.
(2) the present invention adopts that fixedly neighborhood and Euclidean distance are estimated the definition weighting function; But adopt fuzzy mearue and homogeneity sheet; Defined a new weighting function; The modification of weighting function makes the present invention eliminate the wrong phenomenon of dividing of image local basically, has improved the precision that tumor of breast is cut apart, and also makes it show good robustness simultaneously.
Description of drawings
Fig. 1 is the breast ultrasound image lesion segmentation approach structured flowchart based on homogeneity sheet and fuzzy mearue;
Fig. 2 is the edge detection results synoptic diagram;
Fig. 3 is homogeneity sheet structure and synoptic diagram as a result;
Fig. 4 is that the present invention is to a width of cloth breast ultrasound malignant tumour image segmentation result and existing two kinds of method segmentation result comparison diagrams;
Fig. 5 is that the present invention is to a width of cloth breast ultrasound malignant tumour image segmentation result and existing two kinds of method segmentation result comparison diagrams;
Fig. 6 is that the present invention is to a width of cloth breast ultrasound benign tumour image segmentation result and existing two kinds of method segmentation result comparison diagrams;
Fig. 7 repeats to cut apart 50 times robust performance curve map to a width of cloth breast ultrasound image for the present invention and existing method;
Fig. 8 repeats to cut apart 10 times figure as a result for existing method to a width of cloth breast ultrasound image;
Fig. 9 repeats to cut apart 10 times figure as a result for the present invention to a width of cloth breast ultrasound image.
Embodiment
To combine accompanying drawing and embodiment that the present invention is done further description below.
Referring to Fig. 1, the lesion segmentation approach of the breast ultrasound image based on homogeneity sheet and fuzzy mearue of the present invention may further comprise the steps:
Step 1 is imported breast ultrasound image to be split, shown in Fig. 2 (a).
Step 2 is treated split image and is carried out rim detection, obtains the edge energy value, generates outline map.The detailed process that realizes this step is following:
(2a) at first use one group of strange, even wave filter (to 1 yardstick, 0 °, 22.5 °; 45 °, 67.5 °, 90 °; 112.5 °, 135 ° and 157.5 ° of 8 directions) and one group of DOG wave filter (to 1 yardstick) respectively input picture is carried out convolutional filtering, the filter response of each pixel is one group of high dimension vector; High dimension vector to all pixels in the image carries out the K-means cluster, and each cluster centre is represented one type of texture primitive, and each pixel of input picture is endowed the label of an affiliated texture primitive type; Then generate the texture primitive characteristic image, shown in Fig. 2 (b), K representes texture primitive classification number (following all same); Decide as the case may be, get K=16 in this experiment;
(2b) obtain the edge energy of each pixel through the rim detection function calculation, the equationof structure of rim detection function is:
E ( p , θ t ) = Σ k = 1 K | E k L ( p , θ t ) - E k R ( p , θ t ) | + ( E k L ( p , θ t ) - E k R ( p , θ t ) ) 2 E k L ( p , θ t ) + E k R ( p , θ t )
Be the center with pixel p, radius is in the circular neighborhood of R (getting R=5 in this experiment), along θ tDiameter on the direction is divided into left and right neighborhood with this neighborhood,
Figure BDA0000110706570000082
Figure BDA0000110706570000083
Be respectively this and put in the left neighborhood and the energy in the right neighborhood, function expression does E k L ( p , θ t ) = μ η p L ( k ) × d k L ( p , θ t ) , E k R ( p , θ t ) = μ η p R ( k ) × d k R ( p , θ t ) . μ η p L ( k ) , μ η p R ( k ) Belong to the degree of membership of k class texture primitive with the interior pixel of right neighborhood in the left neighborhood of remarked pixel point p respectively, and satisfy constraint condition
Figure BDA0000110706570000089
The degree of membership computing formula does μ η p L ( k ) = ( Σ i ∈ L p δ ( T ( p i ) - k ) ) / | L p | , μ η p R ( k ) = ( Σ i ∈ R p δ ( T ( p i ) - k ) ) / | R p | , L p, R pRepresent the set of all pixels in left neighborhood and the right neighborhood respectively, | ● | the gesture of expression set, p iBe any pixel in pixel p left side neighborhood or the right neighborhood, T (p i) be pixel p among Fig. 2 (b) iThe texture primitive category label, δ (g) is a Kronecker ' s delta function, if i.e. T (p i)=k is δ (T (p then i)-k)=1, otherwise δ (T (p i)-k)=0;
Figure BDA00001107065700000812
Figure BDA00001107065700000813
Be illustrated respectively in θ tOn the direction, belong to the similarity of the pixel of k class texture primitive in the pixel p neighborhood left with it and in the right neighborhood, computing formula does d k L ( p , θ t ) = | OE ( p , θ t ) - m k L ( p , θ t ) | , d k R ( p , θ t ) = | OE ( p , θ t ) - m k R ( p , θ t ) | , OE (p, θ t) be that pixel p is at θ tOriented energy intensity on the direction, expression formula does
Figure BDA00001107065700000816
I is an input picture,
Figure BDA00001107065700000817
With
Figure BDA00001107065700000818
Be respectively that direction is θ tEven symmetry and odd symmetry wave filter, the even symmetry wave filter is the second order local derviation of Gaussian function, the odd symmetry wave filter is its corresponding Hilbert transform.
Figure BDA00001107065700000819
Figure BDA00001107065700000820
Be respectively at θ tOn the direction, belong to the mean direction energy intensity of the pixel of k class texture primitive in pixel p left side neighborhood and the right neighborhood, calculation expression does m k L ( p , θ t ) = Σ i ∈ L p OE ( p i , θ t ) δ ( T ( p i ) - k ) Σ i ∈ L p δ ( T ( p i ) - k ) ,
m k R ( p , θ t ) = Σ i ∈ R p OE ( p i , θ t ) δ ( T ( p i ) - k ) Σ i ∈ R p δ ( T ( p i ) - k ) .
After (2c) the rim detection function E of application construction obtains the edge energy of 8 different directions; Use optimization method (Martin D. again; Fowlkes C.; Malik J.Learning to detect natural imageboundaries using local brightness.color and texture cues.IEEETransactions on Pattern Analysis and Machine Intelligence, 2004,26 (5): 530-549) carry out edge optimization; The rule of taking the victor to obtain entirely at last obtains the optimal edge energy; I.e. t=1; 2; L, 8.The optimal edge energy of each pixel is called outline map as the resulting image of gray scale, and shown in Fig. 2 (c), gray-scale value bigger (promptly white more) might be marginal point more among the figure.
Step 3, adopting the outline map in the step 2 is each pixel definition homogeneity sheet.
(x, y), Fig. 3 (a) is depicted as its homogeneity sheet organigram to any pixel p.Rectangle is represented search window among the figure, and the curve that does not exceed rectangle frame is represented arbitrary curve.The borderline pixel of search window is divided into two parts: the line that has clockwise arrow is represented the pixel of window edge the first half, is designated as a 1 1 ( x - R , y + 1 ) , a 2 1 ( x - R , y ) , . . . , a 4 R + 2 1 ( x + R , y ) , The line that has counterclockwise arrow is represented the pixel of window edge the latter half, is designated as a 1 2 ( x - R , y ) , a 2 2 ( x - R , y + 1 ) , . . . , a 4 R + 2 2 ( x + R , y - 1 ) . Pixel to the first half travels through in the direction of the clock, and the latter half pixel is by counterclockwise traveling through.
The basic process of homogeneity sheet structure is:
(3a) confirming of search window: (x y) is the center, confirms that size is the search window N of (2R+1) * (2R+1) with the pixel p on the outline map p, R=10 in the experiment.
(3b) the alligatoring stage: to search window N pThe first half pixel, at first choose three continuous adjacent accounting for
Figure BDA0000110706570000096
Obtain corresponding three lines with central point
Figure BDA0000110706570000097
Point by point scanning center line then
Figure BDA0000110706570000098
When running into net point p j, calculate E Max(p, p j) value:
Figure BDA0000110706570000101
L (p, p j) be to a p from a p jThe set of all net points, E *(t) edge energy for calculating among the step 2c; Then to E Max(p, p j) value is carried out threshold decision, if E Max(p, p j)≤τ sets up, and thinks that then this net point is candidate's homologous pints, and continues scanning center's line; Otherwise, think p jNot candidate's homologous pints, and finish the scanning of center line.τ decides as the case may be, gets τ=0.24 in this instance.
(3c) elaboration phase: for candidate's homologous pints p jCarry out micronization processes, judge according to the angle difference judgment criterion whether it is homologous pints, to reach the purpose of discarding the dross and selecting the essential.At first represent corresponding straight line, then straight line pp with vector form jWith Between angle θ J, iBe defined as
Figure BDA0000110706570000103
Similarly, can obtain pp respectively jWith
Figure BDA0000110706570000104
Angle theta J, i-1And pp jWith
Figure BDA0000110706570000105
Angle theta J, i+1Utilize three angles that obtain, judge p jThe condition that whether is homologous pints is:
Figure BDA0000110706570000106
After passing through micronization processes like this, the remaining some p that is not excluded jBe exactly homogeneity sheet Ω pIn point, and with it to refuse degree of receiving 1-E Max(p, p j) charge to homogeneity sheet Ω pIn.
(3d) to search window N pThe latter half pixel takes the method identical with the first half pixel to seek homologous pints, finally accomplishes homogeneity sheet Ω pStructure.Shown in Fig. 3 (b), square frame is represented search window among the figure, and white portion is represented the homogeneity sheet of smooth region pixel, and the black region in the square frame is represented the homogeneity sheet of non-flat area pixel point.
Step 4, definition is based on the weighting function of homogeneity sheet and fuzzy mearue.
Traditional based on the NCut method adopt Euclidean distance and fixedly neighborhood define weighting function, but for noise image, as the tumor of breast image cut apart and improper.In the present invention, adopt the homogeneity sheet to substitute fixedly neighborhood and represent with fuzzy set, the fuzzy mearue with two fuzzy set diversities of measurement of redetermination replaces Euclidean distance on this basis, to define weighting function.If π p, π qBe respectively the homogeneity sheet Ω of pixel p and q pAnd Ω qFuzzy set, we just can define pixel to (p, the weighting function between q):
W ( p , q ) = exp ( - ( d ( &pi; p , &pi; q ) ) / &sigma; ) if | | X ( p ) - X ( q ) | | 2 < r 0 otherwise
Wherein r gets constant 8 for connecting radius in the experiment.σ decides according to actual conditions, gets constant σ=0.06 in this instance.D (π p, π q) be to be defined in two fuzzy set π pAnd π qOn fuzzy mearue, expression formula is following:
d ( &pi; p , &pi; q ) = &Sigma; k = K &lambda; k &mu; &pi; p ( k ) + ( 1 - &lambda; k ) &mu; &pi; q ( k ) - min ( &mu; &pi; p ( k ) , &mu; &pi; q ( k ) )
Fuzzy set π wherein pAnd π qBe defined as respectively &pi; p = { ( k , &mu; &pi; p ( k ) ) , k = 1,2 , . . . , K } , &pi; q = { ( k , &mu; &pi; q ( k ) ) , k = 1,2 , . . . , K } ; &mu; &pi; p ( k ) , &mu; &pi; q ( k ) Represent that respectively homogeneity sheet Ω is little pAnd Ω qIn pixel belong to k (degree of membership of 1≤k≤K) type of texture primitive, computing formula be respectively &mu; &pi; p ( k ) = &Sigma; j &Element; &Omega; p m ( p , p j ) &delta; ( T ( p j ) - k ) &Sigma; j &Element; &Omega; p m ( p , p j ) With &mu; &pi; q ( k ) = &Sigma; j &Element; &Omega; q m ( q , q j ) &delta; ( T ( q j ) - k ) &Sigma; j &Element; &Omega; q m ( q , q j ) , M (p, p j) and m (q, q j) be the degree of receiving of refusing that calculates among the step 3c.λ kBe Ω pAnd Ω qBetween the regulation and control coefficient, its formulate does
Figure BDA0000110706570000119
H k(p) and H k(q) represent Ω respectively pAnd Ω qIn belong to k (1≤k≤K) type of total number of pixels of texture primitive.
Step 5, lesion segmentation.
Represent the image as a cum rights non-directed graph G=(W), V is the set on summit for V, E, and E is the set that connects the limit on summit, and it is the weight matrix that element constitutes by weight that W is one, promptly W={W (p, q) }.The result that NCut is cut apart A, B} satisfies following formula:
NCut ( A , B ) = cut ( A , B ) asso ( A , V ) + cut ( A , B ) asso ( B , V )
cut ( A , B ) = &Sigma; p &Element; A , q &Element; B W ( p , q ) , asso ( A , V ) = &Sigma; p &Element; A , q &Element; V W ( p , q )
(A B) solves the optimal dividing problem, in fact can be according to L=D through in global scope, minimizing NCut -1/2WD 1/2Proper vector confirm segmentation result.
In order to be partitioned into tumor region exactly, can reduce computation burden again, further utilized prior imformation (being the rough position of tumour) and sampling policy here.Lesion segmentation simply is described below:
(5a) doctor through the selected area-of-interest that comprises tumour of mouse (region of interest, ROI), the background area of image is appointed as in the zone that RO I is outer, and with this as prior imformation, the weight between pixel is set to 1 in the background area again;
(5b) image is carried out random sampling reducing computation complexity, sampling rate lower usually (all number of pixels 1% or lower), we are taken as 1.5% here.If all sample points in the order set C presentation video background area then produce | C|-1 constraint condition.Suppose M=[M 1, M t... M | C|-1], each constraint condition M wherein tBe the vector of N * 1, it has two nonzero elements, M t(i)=1, M t(j)=-1, i, j ∈ C, thus the partition problem that has most that will scheme becomes restricted minimization problem,
Figure BDA0000110706570000121
Wherein W is the weight matrix that calculates according to the weighting function in the step 4, and to weigh the similarity between sample point, D is a diagonal matrix, and D (p, p)=∑ qW (p, q), Q=D -1W, X are the division matrixes of N * 2, and N is all sample point numbers, X=[X 1, X 2], X wherein lFor scale-of-two indication vector, if i belongs to A, X [i, 1]=1 then, otherwise, X [i, 1]=0.If i belongs to B, X [i, 2]=1 then, otherwise, X [i, 2]=0.The concrete method for solving of restricted minimization problem can be with reference to the improvement NCut algorithm of Yu.et al proposition.
(5c) after finding the solution restricted minimization problem and obtaining the pairing proper vector of sample point; Carrying out interior inserting through the weighting of the sample point adjacent with non-sample point estimates; Obtain non-sample and put pairing proper vector; This two-part proper vector is combined to carry out the K-means cluster, and cluster class number is 2.So far, just all accomplished lesion segmentation, the visible Fig. 4 (e) of final segmentation result to the breast ultrasound image.
Effect of the present invention can further specify through following experiment:
1. experiment condition
Hardware platform is: Intel (R) Pentium (R) 1CPU 2.80GHz, Windows XP Professional.
Software platform is: Matlab7.0 and Visual C++6.0.
2. experiment content and result
The present invention comes from clinical breast ultrasound evaluate image (malignant tumour 19 examples to 50; Benign tumour 31 examples) study; With proposed by the invention based on homogeneity sheet (Homogeneous Patch; HP) and fuzzy mearue (Fuzzy metric, (Phase-Based Level Set PBLS) compares with the improvement NCut method (being designated hereinafter simply as interactive NCut) that Yu.et al proposes for algorithm FM) (HP-FM) and existing level set dividing method based on phase place.
2.1 qualitative analysis
Fig. 4, Fig. 5 and Fig. 6 are one group of instance.
Fig. 4 (a) has shown that one has irregularly shaped; Local feature similar malignant breast tumor, Fig. 4 (b) is the segmentation result of PBLS algorithm, Fig. 4 (c) is the segmentation result of interactive NCut method; Fig. 4 (d) is the segmentation result of method of the present invention, and Fig. 4 (e) is manual segmentation result.Can be known that by Fig. 4 the PBLS algorithm has only utilized marginal information, not consider texture information and spatial information, the external force catching range is limited and can not converge to the depression boundary.Interactive NCut method is not considered the statistical information of regional area, so the local error in recessed zone is cut apart seriously.The present invention has considered the statistical information of regional area through utilizing homogeneity sheet and fuzzy mearue, therefore can obtain desirable segmentation result, has avoided local error to cut apart basically.
Fig. 5 (a) shown one irregularly shaped, have the malignant breast tumor of serious rear echo attenuation,
Fig. 5 (b) is the segmentation result of PBLS algorithm, and Fig. 5 (c) is the segmentation result of interactive NCut method, and Fig. 5 (d) is the segmentation result of method of the present invention, and Fig. 5 (e) is manual segmentation result.Can know that by Fig. 5 the rim detection in the PBLS algorithm is the basis with the phase information, because in fact phase information is not irrelevant with grey scale change, thus cause the failure of rim detection, and then cause the PBLS algorithm to produce a not satisfied segmentation result.Interactive NCut method is only utilized the gradient information of image, because the edge in the breast ultrasound image is not desirable step edges, is difficult to cut apart the serious breast ultrasound image of the pseudo-shadow of decay.And these two kinds of methods all do not consider the statistical information of local neighborhood, and statistical information is very favorable for the uneven ultrasonoscopy of gray scale.The present invention has fully utilized edge and area information through structure homogeneity sheet, the influence of the pseudo-shadow of having avoided effectively decaying, and the segmentation result that obtains has subjective vision effect preferably.
Fig. 6 (a) has shown a mammary gland benign tumor with regular shape, and Fig. 6 (b) is the segmentation result of PBLS algorithm, and Fig. 6 (c) is the segmentation result of interactive NCut method, and Fig. 6 (d) is the segmentation result of method of the present invention, and Fig. 6 (e) is manual segmentation result.Can know that by Fig. 6 PBLS algorithm and interactive NCut method are not considered textural characteristics, so the tangible breast ultrasound image of textural characteristics is difficult to obtain correct segmentation effect.HP-FM algorithm of the present invention has taken into full account textural characteristics, therefore Fig. 6 (a) is had desirable segmentation effect.
These several groups of instances have fully proved the validity of method of the present invention.
2.2 quantitative test
Except that the subjective vision effect, the similarity measurement of the tumor region that three kinds of different dividing methods are cut apart and the tumor region of expert's Freehandhand-drawing system is estimated the profile extraction effect.Suppose A aBe the segmentation result tag set of algorithm, A mBe the tag set that manual standard is cut apart, then similarity measurement SI definition is as follows:
SI = | A m I A a | | A m U A a |
The SI value is big more, and it is good more to cut apart overall performance.SI=1 is that mate fully in the zone that manual zone of cutting apart and doctor are cut apart.
The PBLS algorithm is respectively aforesaid three width of cloth tumor image similarity measurements: 83.39%, 81.75%, 81.55%.Interactive NCut dividing method is respectively the similarity measurement of this three width of cloth image: 83.46%, 75.50%, 77.18%.HP-FM algorithm of the present invention is respectively the similarity measurement result of this three width of cloth image: 88.88%, 89.96%, 88.22%.
The PBLS algorithm, the average similarity tolerance that interactive NCut algorithm and HP-FM algorithm of the present invention are cut apart 50 clinical breast ultrasound images is respectively 85.89%, 78.99%, 88.2%.Can know that from above analysis the HP-FM algorithm that the present invention proposes can obtain better segmentation performance.
2.3 robust analysis
Under the identical situation of sampling rate; Through changing random sample; And with the segmentation result of HP-FM algorithm of the present invention and interactive algorithm and manual segmentation result be goldstandard relatively; We can obtain about average minimum Eustachian distance (average minimum Euclide distance, curve map AD), as shown in Figure 7.In addition,, selected the segmentation result of 10 interactive NCut algorithms and HP-FM algorithm of the present invention, be shown in Fig. 8 (a)-(j) and Fig. 9 (a)-(j) respectively for ease of visual observation.From Fig. 7,8,9 is visible, and HP-FM algorithm of the present invention is insensitive to random sample, cut apart to have provided identical segmentation result, and interactive NCut method is responsive that segmentation result changes along with the variation of sample point at every turn.This mainly is because method of the present invention has adopted homogeneity sheet and fuzzy mearue definition weight; At first the feature difference between the homogeneity sheet than the feature difference between pixel more remarkable with have more robustness; Secondly fuzzy mearue is than Euclidean distance robust more, so overcome sensitive question.Under the situation that the identical but random sample of random sample number changes, the present invention has guaranteed good stability and repeatable.We may safely draw the conclusion by experimental result, and the present invention is more suitable for cutting apart in ultrasonoscopy.
Can explain by above emulation experiment; To cutting apart of clinical breast ultrasound image; There is certain advantage in the present invention; Overcome existing PBLS and interactive NCut method is applied in the deficiency on the breast ultrasound image, and though be qualitative analysis also, quantitative test or robust analysis, the present invention all is superior to existing P BLS and interactive NCut method.
In sum, the segmentation effect that the present invention is directed to clinical breast ultrasound image obviously is superior to existing P BLS and the interactive NCut method segmentation effect to clinical breast ultrasound image.

Claims (7)

1. the lesion segmentation approach based on the breast ultrasound image of homogeneity sheet and fuzzy mearue is characterized in that this method comprises the steps:
(1) input breast ultrasound image to be split;
(2) treat split image and carry out rim detection, comprising:
(2.1) adopt the breast ultrasound image texture features of importing in filter set and the clustering algorithm extraction step (1), generate the texture primitive characteristic image;
(2.2) through fuzzy mearue the multiple information of each image slices vegetarian refreshments is combined definition rim detection function; Calculate the edge energy of each pixel, generate initial edge figure, and carry out edge optimization; Finally obtain the outline map of original image, thereby accomplish rim detection;
(3) definition homogeneity sheet; Utilize the outline map that generates in the step (2) to be each image pixel definition homogeneity sheet, said homogeneity sheet is a kind of neighborhood that reflects the neighbor similarity relation; The structure of homogeneity sheet comprises the steps:
(3.1) be that search window is confirmed at the center with the current pixel point;
(3.2) the alligatoring stage: figure goes up the straight line of crossing all directions of current point in this search window of scanning on the edge of; If the edge energy value of pixel is less than given threshold value on certain direction straight line; Think that then this pixel is candidate's homologous pints, otherwise, with its eliminating and stop the scanning of this direction straight line;
(3.3) elaboration phase: for candidate's homologous pints; Further take micronization processes to judge whether it is real homologous pints; Then the remaining pixel that is not excluded is considered to the member in this homogeneity sheet in the current search window, and exists with the form of probability;
(4) definition weighting function; The homogeneity sheet of each image slices vegetarian refreshments in the step (3) is regarded as a fuzzy set, on this basis, defines a fuzzy mearue that is used for weighing the fuzzy set diversity, and define weighting function with it according to marginal information, texture information and spatial information;
(5) lesion segmentation; Adopt the weighting function of step (4) definition, the similarity between calculating pixel is to make up the weight matrix of entire image; With the coarse position information of tumour as prior imformation; Simultaneously ultrasonoscopy is carried out random sampling and reduce computation complexity, upgrade weight matrix, the partition problem that has most of scheming is become restricted minimization problem according to prior imformation of introducing and Sampling Strategies; At last; Carry out interior inserting through the weighting of the sample point adjacent and estimate, obtain estimation, thereby realize cutting apart tumour to the breast ultrasound image segmentation with non-sample point.
2. the lesion segmentation approach of the breast ultrasound image based on homogeneity sheet and fuzzy mearue according to claim 1; It is characterized in that: in the said step (2.1); Filter set comprises one group of odd even wave filter and one group of DOG wave filter, and the odd even wave filter is to 1 yardstick and 0 °, 22.5 °, 45 °, 67.5 °, 90 °, 112.5 °, 135 °, 157.5 °, and the input picture of 8 directions carries out convolutional filtering; The DOG wave filter carries out convolutional filtering to the input picture of 1 yardstick; The filter response of each pixel is one group of high dimension vector, through clustering algorithm the high dimension vector of all pixels in the image is carried out cluster, and each cluster centre is one type of texture primitive; Each pixel of input picture is endowed the label of an affiliated texture primitive type, then generates the texture primitive characteristic image.
3. the lesion segmentation approach of the breast ultrasound image based on homogeneity sheet and fuzzy mearue according to claim 1 and 2, it is characterized in that: the rim detection function described in the step (2.2) is: E ( p , &theta; t ) = &Sigma; k = 1 K | E k L ( p , &theta; t ) - E k R ( p , &theta; t ) | + ( E k L ( p , &theta; t ) - E k R ( p , &theta; t ) ) 2 E k L ( p , &theta; t ) + E k R ( p , &theta; t )
K representes texture primitive classification number, is being the center with pixel p, and radius is in the circular neighborhood of R, along θ tDiameter on the direction is divided into left and right neighborhood with this neighborhood,
Figure FDA0000110706560000023
Be respectively this and put in the left neighborhood and the energy in the right neighborhood, wherein: E k L ( p , &theta; t ) = &mu; &eta; p L ( k ) &times; d k L ( p , &theta; t ) , E k R ( p , &theta; t ) = &mu; &eta; p R ( k ) &times; d k R ( p , &theta; t ) , &mu; &eta; p L ( k ) , &mu; &eta; p R ( k ) Belong to the degree of membership of k class texture primitive with the interior pixel of right neighborhood in the left neighborhood of remarked pixel point p respectively, and satisfy constraint condition &Sigma; k = 1 K &mu; &eta; p L ( k ) = 1 , &Sigma; k = 1 K &mu; &eta; p R ( k ) = 1 ; d k L ( p , &theta; t ) , d k R ( p , &theta; t ) Be illustrated respectively in θ tOn the direction, in the pixel p neighborhood left with it with right neighborhood in the similarity of the pixel that belongs to k class texture primitive,
Membership
Figure FDA00001107065600000213
function expression is:
&mu; &eta; p L ( k ) = &Sigma; i &Element; L p &delta; ( T ( p i ) - k ) | L p | , &mu; &eta; p R ( k ) = &Sigma; i &Element; R p &delta; ( T ( p i ) - k ) | L p |
L wherein p, R pRepresent the set of all pixels in left neighborhood and the right neighborhood respectively, | ● | the gesture of expression set, p iBe any pixel in pixel p left side neighborhood or the right neighborhood, T (p i) be p iThe texture primitive category label, δ (g) is a Kronecker ' s delta function, if i.e. T (p i)=k is δ (T (p then i)-k)=1, otherwise δ (T (p i)-k)=0;
Similarity
Figure FDA00001107065600000216
Figure FDA00001107065600000217
function expression is:
d k L ( p , &theta; t ) = | OE ( p , &theta; t ) - m k L ( p , &theta; t ) | , d k R ( p , &theta; t ) = | OE ( p , &theta; t ) - m k R ( p , &theta; t ) |
OE (p, θ wherein t) be that pixel p is at θ tOriented energy intensity on the direction, expression formula does
Figure FDA0000110706560000033
I is an input picture, With
Figure FDA0000110706560000035
Be respectively that direction is θ tEven symmetry and odd symmetry wave filter;
Figure FDA0000110706560000036
Figure FDA0000110706560000037
Be respectively at θ tOn the direction, mean direction energy intensity in pixel p left side neighborhood and the right neighborhood,
The average energy intensity direction
Figure FDA0000110706560000038
and
Figure FDA0000110706560000039
The expression is:
m k L ( p , &theta; t ) = &Sigma; i &Element; L p OE ( p i , &theta; t ) &delta; ( T ( p i ) - k ) &Sigma; i &Element; L p &delta; ( T ( p i ) - k ) ,
m k R ( p , &theta; t ) = &Sigma; i &Element; R p OE ( p i , &theta; t ) &delta; ( T ( p i ) - k ) &Sigma; i &Element; R p &delta; ( T ( p i ) - k ) .
4. the lesion segmentation approach of the breast ultrasound image based on homogeneity sheet and fuzzy mearue according to claim 3, it is characterized in that: said clustering algorithm is the K-Means algorithm.
5. the lesion segmentation approach of the breast ultrasound image based on homogeneity sheet and fuzzy mearue according to claim 3 is characterized in that:
The confirming of search window described in the step (3.1) comprises the steps: that (x y) is the center, defines the search window that size is (2R+1) * (2R+1) a: N with the position of the pixel p on the outline map in image p(i, j)=wherein, R is the height and the width of search window, and the borderline pixel of search window is divided into two parts for x-R≤i≤x+R, y-R≤j≤y+R}, wherein, a 1 1 ( x - R , y + 1 ) , a 2 1 ( x - R , y ) , . . . , a 4 R + 2 1 ( x + R , y ) Represent the pixel of window edge the first half, a 1 2 ( x - R , y ) , a 2 2 ( x - R , y + 1 ) , . . . , a 4 R + 2 2 ( x + R , y - 1 ) Represent the pixel of window edge the latter half, the pixel of the first half traveled through in the direction of the clock, to the latter half pixel by traversal counterclockwise;
The alligatoring stage described in the step (3.2) comprises the steps: the pixel of the first half and the latter half is chosen three continuous consecutive point respectively
Figure FDA00001107065600000314
Figure FDA00001107065600000315
Figure FDA00001107065600000316
Obtain corresponding three lines with central point respectively
Figure FDA00001107065600000317
Figure FDA00001107065600000318
Figure FDA00001107065600000319
The center line of certain direction in the point by point scanning search window then
Figure FDA00001107065600000320
When running into net point p j, calculate E Max(p, p j) value:
E max ( p , p j ) = max t &Element; L ( p , p j ) E * ( t )
Wherein, L (p, p j) be to a p from a p jThe set of all net points, E *(t) edge energy that obtains for the rim detection function calculation; If E Max(p, p j)≤τ sets up, and then thinks p jBe candidate's homologous pints, and continue scanning center's line; Otherwise, think p jNot candidate's homologous pints, and finish the scanning of center line;
Elaboration phase described in the step (3.3) comprises the steps: for candidate's homologous pints p jCarry out micronization processes, judge that according to the angle difference judgment criterion whether it is homologous pints, at first representes corresponding straight line, then pp with vector form jAnd pa iBetween angle θ J, iBe defined as:
&theta; j , i = &angle; ( pp &RightArrow; j , pa &RightArrow; i ) = arccos ( pp &RightArrow; j ) T pa &RightArrow; i | | pp &RightArrow; j | | &CenterDot; | | pa &RightArrow; i | |
Similarly, can calculate pp jAnd pa k(k=i-1, the angle theta between i+1) J, i-1And θ J, i+1, in order to get rid of the false homologous pints in candidate's homologous pints, define a kind of angle difference judgment criterion:
Figure FDA0000110706560000043
The then remaining some p that is not excluded jBe exactly homogeneity sheet Ω pIn the point.
6. the lesion segmentation approach of the breast ultrasound image based on homogeneity sheet and fuzzy mearue according to claim 5, it is characterized in that: the weighting function in the step (4) is:
<math> <mrow> <mi>W</mi> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mi>exp</mi> <mrow> <mo>(</mo> <mo>-</mo> <mrow> <mo>(</mo> <mi>d</mi> <mrow> <mo>(</mo> <msub> <mi>&amp;pi;</mi> <mi>p</mi> </msub> <mo>,</mo> <msub> <mi>&amp;pi;</mi> <mi>q</mi> </msub> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>/</mo> <mi>&amp;sigma;</mi> <mo>)</mo> </mrow> </mtd> <mtd> <mfenced open='' close=''> <mtable> <mtr> <mtd> <mi>if</mi> </mtd> <mtd> <msub> <mrow> <mo>|</mo> <mo>|</mo> <mi>X</mi> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>-</mo> <mi>X</mi> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>|</mo> <mo>|</mo> </mrow> <mn>2</mn> </msub> <mo>&lt;;</mo> <mi>r</mi> </mtd> </mtr> </mtable> </mfenced> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <mi>otherwise</mi> </mtd> </mtr> </mtable> </mfenced> </mrow></math>
π wherein p, π qBe respectively homogeneity sheet Ω pAnd Ω qFuzzy set, r, σ are constant, d (π p, π q) be to be defined in two fuzzy mearues on the fuzzy set, expression formula is following:
d ( &pi; p , &pi; q ) = &Sigma; k = K &lambda; k &mu; &pi; p ( k ) + ( 1 - &lambda; k ) &mu; &pi; q ( k ) - min ( &mu; &pi; p ( k ) , &mu; &pi; q ( k ) )
Wherein, K representes texture primitive classification number; Fuzzy set π pAnd π qBe defined as respectively &pi; p = { ( k , &mu; &pi; p ( k ) ) , k = 1,2 , . . . , K } , &pi; q = { ( k , &mu; &pi; q ( k ) ) , k = 1,2 , . . . , K } ; &mu; &pi; p ( k ) , &mu; &pi; q ( k ) Represent homogeneity sheet Ω respectively pAnd Ω qIn pixel belong to k (degree of membership of 1≤k≤K) type of texture primitive be defined as
&mu; &pi; p ( k ) = &Sigma; j &Element; &Omega; p m ( p , p j ) &delta; ( T ( p j ) - k ) &Sigma; j &Element; &Omega; p m ( p , p j ) , &mu; &pi; q ( k ) = &Sigma; j &Element; &Omega; q m ( q , q j ) &delta; ( T ( q j ) - k ) &Sigma; j &Element; &Omega; q m ( q , q j )
δ in the formula (g) is a Kronecker ' s delta function, m (p, p j) be pixel p in the step (3) jRefuse degree of receiving, λ kBe homogeneity sheet Ω pAnd Ω qBetween the regulation and control coefficient, its formula is:
&lambda; k = H k ( p ) H k ( p ) + H k ( q )
H in the formula k(p) and H k(q) represent Ω respectively pAnd Ω qIn belong to k (1≤k≤K) type of total number of pixels of texture primitive.
7. according to the lesion segmentation approach of claim 4 or 5 or 6 described breast ultrasound images based on homogeneity sheet and fuzzy mearue, it is characterized in that: the second order local derviation that said even symmetry wave filter is a Gaussian function, odd symmetry wave filter are corresponding Hilbert transform.
CN 201110371586 2011-11-21 2011-11-21 Tumor segmentation method based on homogeneous pieces and fuzzy measure of breast ultrasound image Expired - Fee Related CN102509273B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110371586 CN102509273B (en) 2011-11-21 2011-11-21 Tumor segmentation method based on homogeneous pieces and fuzzy measure of breast ultrasound image

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110371586 CN102509273B (en) 2011-11-21 2011-11-21 Tumor segmentation method based on homogeneous pieces and fuzzy measure of breast ultrasound image

Publications (2)

Publication Number Publication Date
CN102509273A true CN102509273A (en) 2012-06-20
CN102509273B CN102509273B (en) 2013-09-04

Family

ID=46221351

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110371586 Expired - Fee Related CN102509273B (en) 2011-11-21 2011-11-21 Tumor segmentation method based on homogeneous pieces and fuzzy measure of breast ultrasound image

Country Status (1)

Country Link
CN (1) CN102509273B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103093474A (en) * 2013-01-28 2013-05-08 电子科技大学 Three-dimensional mammary gland ultrasound image partition method based on homoplasmon and partial energy
CN103942799A (en) * 2014-04-25 2014-07-23 哈尔滨医科大学 Breast ultrasounography image segmentation method and system
CN104091096A (en) * 2014-07-25 2014-10-08 华南农业大学 Gene importance degree tracking method based on fuzzy measure
CN106934216A (en) * 2017-02-16 2017-07-07 山东大学齐鲁医院 Medicine equipment clinical evaluation method based on multiple target
CN108648199A (en) * 2018-05-21 2018-10-12 上海工程技术大学 Ultrasonic phase array NDT image partition methods based on watershed and CV models

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030194119A1 (en) * 2002-04-15 2003-10-16 General Electric Company Semi-automatic segmentation algorithm for pet oncology images
CN1924926A (en) * 2006-09-21 2007-03-07 复旦大学 Two-dimensional blur polymer based ultrasonic image division method
CN101510310A (en) * 2009-02-19 2009-08-19 上海交通大学 Method for segmentation of high resolution remote sensing image based on veins clustering constrain
CN101527047A (en) * 2008-03-05 2009-09-09 深圳迈瑞生物医疗电子股份有限公司 Method and device for detecting tissue boundaries by use of ultrasonic images

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030194119A1 (en) * 2002-04-15 2003-10-16 General Electric Company Semi-automatic segmentation algorithm for pet oncology images
CN1924926A (en) * 2006-09-21 2007-03-07 复旦大学 Two-dimensional blur polymer based ultrasonic image division method
CN101527047A (en) * 2008-03-05 2009-09-09 深圳迈瑞生物医疗电子股份有限公司 Method and device for detecting tissue boundaries by use of ultrasonic images
CN101510310A (en) * 2009-02-19 2009-08-19 上海交通大学 Method for segmentation of high resolution remote sensing image based on veins clustering constrain

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
李彬 等: "基于模糊连接度的多发性硬化症MR图像自动分割算法", 《中国生物医学工程学报》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103093474A (en) * 2013-01-28 2013-05-08 电子科技大学 Three-dimensional mammary gland ultrasound image partition method based on homoplasmon and partial energy
CN103093474B (en) * 2013-01-28 2015-03-25 电子科技大学 Three-dimensional mammary gland ultrasound image partition method based on homoplasmon and partial energy
CN103942799A (en) * 2014-04-25 2014-07-23 哈尔滨医科大学 Breast ultrasounography image segmentation method and system
CN103942799B (en) * 2014-04-25 2017-02-01 哈尔滨医科大学 Breast ultrasounography image segmentation method and system
CN104091096A (en) * 2014-07-25 2014-10-08 华南农业大学 Gene importance degree tracking method based on fuzzy measure
CN106934216A (en) * 2017-02-16 2017-07-07 山东大学齐鲁医院 Medicine equipment clinical evaluation method based on multiple target
CN106934216B (en) * 2017-02-16 2021-09-14 山东大学齐鲁医院 Medical instrument clinical evaluation method based on multiple targets
CN108648199A (en) * 2018-05-21 2018-10-12 上海工程技术大学 Ultrasonic phase array NDT image partition methods based on watershed and CV models
CN108648199B (en) * 2018-05-21 2022-07-19 上海工程技术大学 Ultrasonic phased array NDT image segmentation method based on watershed and CV models

Also Published As

Publication number Publication date
CN102509273B (en) 2013-09-04

Similar Documents

Publication Publication Date Title
CN110287932B (en) Road blocking information extraction method based on deep learning image semantic segmentation
Kovács et al. A self-calibrating approach for the segmentation of retinal vessels by template matching and contour reconstruction
CN103646400B (en) Multi-scale segmentation parameter automatic selecting method in object-oriented remote sensing images analysis
CN100470587C (en) Method for segmenting abdominal organ in medical image
CN104766046B (en) One kind is detected using traffic mark color and shape facility and recognition methods
CN100595789C (en) Two-dimensional blur polymer based ultrasonic image division method
CN105096315B (en) Heterogeneous super-pixel SAR image segmentation method based on Gamma distributions
CN104933709A (en) Automatic random-walk CT lung parenchyma image segmentation method based on prior information
CN101976445B (en) Level set SAR (Synthetic Aperture Radar) image segmentation method by combining edges and regional probability density difference
US10776918B2 (en) Method and device for determining image similarity
CN102509113B (en) Brain tumor MIB-1 index range detection method
CN102800089A (en) Main carotid artery blood vessel extraction and thickness measuring method based on neck ultrasound images
CN102509273B (en) Tumor segmentation method based on homogeneous pieces and fuzzy measure of breast ultrasound image
CN103425986A (en) Breast lump image feature extraction method based on edge neighborhood weighing
CN103345757A (en) Optical image and SAR image automatic registration method within multilevel multi-feature constraint
CN105389811A (en) Multi-modality medical image processing method based on multilevel threshold segmentation
CN102842039B (en) Road image detection method based on Sobel operator
CN103455820A (en) Method and system for detecting and tracking vehicle based on machine vision technology
CN108765427A (en) A kind of prostate image partition method
CN102903102A (en) Non-local-based triple Markov random field synthetic aperture radar (SAR) image segmentation method
CN102110227A (en) Compound method for classifying multiresolution remote sensing images based on context
CN113569724B (en) Road extraction method and system based on attention mechanism and dilation convolution
CN102426699B (en) Level set synthetic aperture radar (SAR) image segmentation method based on edge and regional information
CN103871066A (en) Method for constructing similarity matrix in ultrasound image Ncut segmentation process
CN103093474B (en) Three-dimensional mammary gland ultrasound image partition method based on homoplasmon and partial energy

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130904

Termination date: 20161121