# Feature Extraction of Kidney Tissue Image Based on Ultrasound Image Segmentation

Authors: Jie Lian; Mingyu Zhang; Na Jiang; Wei Bi; Xiaoqiu Dong
Journal: Journal of Healthcare Engineering
 (2021)

---

## Abstract

The kidney tissue image is affected by other interferences in the tissue, which makes it difficult to extract the kidney tissue image features, and it is difficult to judge the lesion characteristics and types by intelligent feature recognition. In order to improve the efficiency and accuracy of feature extraction of kidney tissue images, refer to the ultrasonic heart image for analysis and then apply it to the feature extraction of kidney tissue. This paper proposes a feature extraction method based on ultrasound image segmentation. Moreover, this study combines the optical flow method and the speckle tracking algorithm to select the best image tracking method and optimizes the algorithm speed through the full search method and the two-dimensional log search method. In addition, this study verifies the performance of the method proposed in this paper through comparative experimental research, and this study combines statistical analysis methods to perform data analysis. The research results show that the algorithm proposed in this paper has a certain effect.


---

## Body

## 1. Introduction

Because kidney cancer is not sensitive to radiotherapy, surgery is the first choice for the treatment of localized kidney cancer. In addition to radical nephrectomy surgery, nephron-sparing surgery is increasingly used. With the development of technology, the nephron-sparing operation method has become an effective treatment method for T1a stage (maximum diameter ≤ 4 cm) and some T1b stage (maximum diameter ≤ 7 cm) renal tumors. This surgical method removes the diseased tissue while retaining normal renal units as much as possible, which can improve the patient's quality of life after surgery. When performing this surgical method, it is usually necessary to block the renal aorta to ensure a clear surgical field and accurate removal of tumor tissue [1]. However, the entire kidney was in a state of warm ischemia during the occlusion of the renal aorta. Usually, this ischemic time should be controlled within 30 minutes, otherwise the kidney function will be irreversibly damaged. In 2011, Shao Pengfei of Jiangsu Provincial People's Hospital first proposed the method of partial nephrectomy for renal artery occlusion [2]. When removing a kidney tumor, this method selectively blocks the branch of the renal artery that supplies blood to the tumor area, completes the tumor removal, and repairs the renal parenchyma, which avoids the entire kidney from being in an ischemic state for a long time during the operation. Under the regional ischemic condition of the kidney, the blood supply to most of the kidney area is not affected. Compared with the method of blocking the renal aorta, this method can appropriately relax the restriction of the blocking time and make the wound hemostasis and renal parenchyma suture completed more finely, which is beneficial to the protection of renal function and postoperative recovery and reduces the risk of postoperative complications. However, one of the keys to performing this branching operation of the renal artery is that the anatomical structure of the patient's renal artery, kidney, kidney tumor, and other key tissues needs to be fully and clearly understood before the operation [3].At present, there are still some areas for improvement in the actual clinical implementation of this surgical method. First, the above key information is mainly obtained by visually observing the CT data and its 3D rendering results. Moreover, based on the positional relationship between the kidney, tumor, and each renal artery branch and clinical experience, the doctor finally determines the target artery branch, and the location of the occlusion and formulates the surgical plan. Due to different tumor morphology, different growth locations, and large differences in the anatomical structure of the renal artery and its branches, it is necessary to customize an individual surgical plan for each patient based on full and detailed analysis of the image data of each patient. This method is not only time-consuming but also requires manual calibration by experienced clinical experts. In addition, because there are errors or misjudgments in manual observation, it is easy to cause errors or omissions in target vessel judgment. Moreover, the selection of target arteries and occlusion sites lacks objective and reliable quantitative reference indicators. It is entirely based on personal experience, which may cause irrational selection of occlusion sites, especially in cases where there are multiple blood supply artery branches in renal tumors. Finally, this surgical method is more complicated than the traditional renal aortic occlusion method. The surgeon needs to accurately separate the target blood vessel and locate the occlusion position near the renal hilum where the arteries, veins, and ureters are collected. To this end, the surgeon must have a full and detailed understanding of the kidney, especially the three-dimensional anatomical structure near the renal hilum. However, the image workstations currently in clinical use only provide ordinary three-dimensional volume rendering functions, which have many disadvantages such as time-consuming, unintuitive results, and lack of interactive functions. Moreover, it cannot meet the actual needs of preoperative planning and intraoperative navigation. Preliminary clinical studies have shown that building a three-dimensional kidney model can effectively improve the efficiency and accuracy of this surgical method in preoperative planning and intraoperative positioning [4].In view of the abovementioned various drawbacks and actual needs, it is necessary to design a computer-aided system to complete the automatic operation of the above functions. The system needs to accurately segment the kidney, kidney tumor, and renal artery and its branches by building a three-dimensional kidney model. Moreover, the system needs to build a renal artery vascular tree, estimate the blood supply range of different branch renal artery blood vessels, and then determine the branch of the renal artery that should be blocked according to the regional distribution of renal tumors. Blocking the branches of the renal arteries can ensure a clear surgical field of vision, which facilitates the cutting of renal tumors. Secondly, blocking blood supply to kidney tumors will make the surface of the ischemic area white, which can further confirm the relationship between the ischemic area and the tumor. This double insurance mechanism can further reduce the risk of surgery and increase the success rate.


## 2. Related Work

It is understood that no research on image processing algorithms to solve the above clinical problems has been seen at home and abroad. The research on medical image processing algorithms related to kidney and kidney cancer is much less than the research on image processing algorithms of other human tissues (such as liver, brain, and heart), and the relevant literature was mainly published after 2006. This is related to the clinical use of radical total nephrectomy in kidney cancer and the lack of attention to the kidney and its internal structure. The kidney-related image processing algorithms mainly focus on the segmentation algorithm of normal kidneys in CT and MR images [5]. The literature [6] uses the spine to locate the kidney and then uses the adaptive region growth algorithm to segment the kidney tissue in the two-dimensional CT image. The literature [7] uses graph cut algorithm and geometric model to constrain segmentation of kidney regions in 2D MR images. The literature [8] uses active shape model (ASM) and nonrigid point registration algorithm to segment the kidney region. The literature [9] defines kidney segmentation as the min-cut solving problem of maximum posterior probability estimation in Markov random field. Moreover, it takes the nonparametric shape gray mixed model as the latent variable in the energy equation and obtains the unknown model variable and the segmentation result by solving. The literature [10] uses the level set method based on the constraint of the three-dimensional statistical model of the kidney to segment the kidney region in the three-dimensional CTA data. The literature [11] uses random forest to initially locate the kidney tissue in the data, and then, it used the deformation model to deform according to the generated kidney area probability map and segmented the kidney area in the CTA or CT plain scan image. The literature [12] proposes a method of constructing 4D maps using statistical geometric models to simultaneously segment multiple tissues and organs, including kidneys, in 4D abdominal CT images. The literature [13] proposes a two-step kidney segmentation algorithm based on multitemplate images (multiatlas). The algorithm first uses a low-resolution full-size CT template image of the abdomen to locate the kidney and then uses a high-resolution local kidney template image to accurately segment the kidney region. Most of the above algorithms utilize the shapecharacteristics of normal kidneys, so they are mainly segmented for normal kidney tissue. However, there is currently no relevant report on the segmentation of abnormal kidney tissue including tumors involved in the subject. Due to the presence of tumors, the morphological structure of kidney tissue is significantly different from that of normal kidney tissue, which makes the applicability of the above algorithms, especially those based on shape feature constraints, greatly reduced. In addition, the above algorithm is less concerned with the extraction of the internal structure of renal parenchyma. The interior of the renal parenchyma includes the renal cortex (including the renal column) and the renal medulla. The renal corpuscles with urine filtration function are mainly distributed in the renal cortex, and the segmentation of the renal cortex is of great value for the evaluation of renal function before and after surgery. Literature [14] proposed a fully automatic segmentation algorithm of the renal cortex (excluding the renal column part), which uses the average model of the kidney to locate the kidney and then uses the multisurface detection algorithm to simultaneously extract the outer contour of the kidney and the area of the renal cortex in the image. The algorithm was tested using the right kidney in 17 abdominal CT images. In addition to the kidney segmentation algorithm, other research results have focused on the classification and location of kidney tumors. The literature [15] proposes a semiautomatic algorithm to extract kidney lesions in CT images. This algorithm uses CT plain scan and portal vein CT to enhance the image. First, the seeds are manually selected inside the lesion area, and the level set method is used to extract the contour of the kidney lesion area. Then, the algorithm further calculates feature vectors including morphology and texture features and classifies four different types of lesions using principal component analysis and support vector machines. The coincidence rate between the segmentation result of this method and the result of manual segmentation by the doctor is 0.80. The literature [16] proposes to use the change of the shape characteristics of the kidney region in the CT scan image to detect the diseased region growing outside the kidney. However, because the lesion area and normal tissue area are difficult to distinguish in the CT scan image, this method can only locate the lesion that highlights the growth of the kidney and cannot obtain the accurate boundary of the lesion area. In addition to kidney tumors, more research work has been carried out on segmentation algorithms for CT image liver tumor lesions. In 2008, the MICCAI International Conference held a liver tumor segmentation competition in CT images. However, because the kidney and liver have different image features in CT images, it is difficult to directly use the existing liver tumor segmentation algorithm to extract kidney tumors. In recent years, deep convolutional neural networks have set off a wave of learning in industry and scientific research with their powerful learning capabilities. Moreover, it has continuously made new breakthroughs in the classification, segmentation, and detection of computer vision and surpassed the traditional methods. In terms of segmentation, fully convolutional neural networks (FCN [17]) have opened the door for deep learning in image semantic segmentation. Since then, there have been continuous new and better performance networks, which constantly refresh the record of deep learning in image segmentation. In addition, in terms of medical image segmentation, many excellent networks have also been released [18]. In the research of this subject, it is expected to design a recognition model suitable for ultrasound image segmentation to solve the problem of automatic segmentation of kidney image features.


## 3. Image Processing

### 3.1. Polyphase Level Set

Level set is proposed on the basis of active contour model (ACM), which is widely used in the field of image processing. Multiphase level set is an improvement based on the level set, which divides the image into multiple small areas with different attributes according to the grayscale information and edge intensity information of the image itself. The core idea is to use the level set functionΦ to represent the energy function of each divided region, and the energy function of each Ω1,Ω2,…,Ωn (n is the number of divided regions) region contains a membership function Miϕ (i is the corresponding membership function subscript). Taking the two-phase level set as an example, M1ϕ=Hϕ and M2ϕ=1−Hϕ represent the membership functions of Ω1 and Ω2, respectively, and H is the Heaviside function. The energy function composed of these membership functions achieves the final segmentation effect through continuous iterative evolution. The energy function is expressed by(1)εϕ,c,b=∫∑i=1n∫κy−xx−byci2Miϕxdxdy.Among them,Ix is a gray-scale image function, κy−x is a window function, b is an offset field, which is a parameter of uneven gray scale, and ci is a constant array. This energy function represents the data item. This function and the weighted length term energy function LΦ and the weighted area term energy function RΦ together form a level set equation, which is expressed by(2)Fϕ,c,b=εϕ,c,b+vLϕ+μRϕ.The functionFϕ,c,b iterates to minimize the energy value to achieve the segmentation effect. v and μ are the weighted length term energy function coefficient and the weighted area term energy function coefficient [19].Multiphase level set has a good segmentation effect on images with uneven intensity. The choice of specific phase depends on the properties of the image itself. For the left ventricular ultrasound image, the different echo intensities of the ventricular wall and papillary muscles plus the effect of noise make the image roughly divided into three gray levels, as shown in Figure1(a), that is, the black echoless intensity area, the white myocardial wall area, and the gray papillary muscle and noise area. When different phases are selected, the segmentation results are different. In the case of phase n=2, the area of the ventricular wall with strong echo grayscale and the noise with weak echo grayscale and the area of the papillary muscle is difficult to separate, which greatly interferes with the subsequent binary image processing process and makes the result inaccurate. In the case of n>3, the segmentation result is more refined for the different grayscale intensity regions of the left ventricle image. However, this sacrifices the calculation speed, and it is difficult to meet the timeliness requirements in clinical applications. Based on the comprehensive consideration of segmentation accuracy and time complexity, this paper uses a three-phase level set method, that is, using two level set functions ϕ1 and ϕ2 to represent three membership functions, respectively:(3)M1ϕ1,ϕ2=Hϕ1Hϕ2,M2ϕ1,ϕ2=Hϕ11−Hϕ2,M3ϕ1,ϕ2=1−Hϕ1.Figure 1
Binary image processing. (a) Three-phase level set segmentation results. (b) The results obtained by taking out the white part in (a). (c) Parabolic model. (d) Left ventricular fully filled map. (e) Parabolic sampling. (f) Sampling of the wall boundary.
(a)(b)(c)(d)(e)(f)


### 3.2. Binary Image Processing

Refer to the ultrasonic heart image for analysis, and then, apply it to the feature extraction of kidney tissue. The low signal-to-noise ratio of the ultrasound heart image makes the three-phase level set segmentation result, and the area with the same attribute still contains a lot of noise. The part that appears in the left ventricular cavity is regarded as noise, and the purpose of binary image processing is to remove these noises. At the same time, the left ventricular myocardial wall disconnected area and the hollow area are connected and filled separately to prepare for the next linear fitting [20]. Before binary processing, the white part of the myocardial wall area is first extracted, as shown in Figure 1(b). It can be seen that the three-phase level set has segmented the left ventricular wall and the boundary is clear, and the noise in the cavity and the echo intensity of the myocardial wall are also segmented. In order to remove these noises, a parabola model is established in the heart cavity during the process, as shown in Figure 1(c). Then, all white parts in the parabola are removed. Since the ventricular walls are connected, the number of pixels in the white area where the myocardial wall is connected is relatively large. In this way, white noise with few independent pixels in the image can be removed. Before establishing the parabola, the entire image is opened and closed to avoid removing the independent small noise area and the effective area of the ventricular wall, so as to achieve the effect of denoising while retaining the details of the effective area of the image. The parabolic model here is determined by manually selecting three points. Among them, the vertex is the vertex of the left ventricular contour, and the two bottom points are the intersection points of the mitral valve and the left ventricular contour, respectively. In the process of image filling, the outline image of the left ventricle is sometimes completely closed due to the systole, which makes the left ventricle completely filled. In this paper, a void channel is provided outside the center of the parabola and the image sector to prevent the ventricle from being completely filled. The algorithm in this paper solves the problem of full filling of the left ventricle in Figure 1(d). Figure 1(e) is the sampling of the parabola of Figure 1(c), and Figure 1(f) is the sampling of the wall boundary points based on Figure 1(e) [21].


### 3.3. Curve Fitting

Before using the disc method to determine the volume of the left ventricle, the outline of the left ventricle must be drawn with a curve. The curve here must meet two conditions: firstly, the curve must be continuously closed; secondly, the curve changes smoothly everywhere, and there should be no local “protrusion” or “depression,” which is based on the requirements of the model of the left ventricular smooth contour of the heart. This paper combines the least square method and cubic spline interpolation to fit the left ventricular contour, and the internal contour is divided into four segments. The left and right wall regions are fitted by least squares method, the top of the left ventricle is fitted by cubic spline interpolation, and the bottom of the left ventricle is a straight line connected by the left and right bottom points. Since the middle of the left ventricle and the left atrium are connected areas, the two are separated by a straight line, which is also consistent with the clinical left ventricular model [22].Least squares method finds the best function matching of data by minimizing the sum of squared errors. This method can find unknown data and minimize the sum of squared errors between these data and actual data. The basic formula is(4)∑t=1qΧstβt=yss=1,2,3,…,p.Among them,p and q represent the equation and the number of unknown numbers, respectively, and β is the unknown number. In the image, for the fitting of points, the advantage of the least square method is that the curve fitting results are less affected by individual abnormal points. However, the curve it fits does not necessarily pass through the first two points of the series of points, which makes the use of multiple curves in the left ventricular contour fitting process inconsistent. However, the cubic spline interpolation method is just complementary to the least square method. Its fitting curve passes through the first and the last two points and connects multiple curves using the least square fitting method to form a closed inner contour curve. In this paper, two points with relatively large curvature in the contour of the two walls of the ventricle to the top of the ventricle are selected, and cubic spline interpolation and least squares are used to fit above and below the two points, respectively, to ensure the continuity of the final curve. The main idea of the cubic spline interpolation method is that when some data points x1,x2,…,xr and corresponding values y1,y2,…,yr in the interval u,v are given, the value of the expression of the function in the interval of every two points is obtained. The expression is [23](5)Sx=a1x3+a2x2+a3x+a4.Among them，a1,a2,a3,anda4 are the coefficients and each interval is continuous at the intersection, and its first and second derivatives are continuous at the intersection. After that, the value of Sx can be obtained by a mathematical method. The algorithm proposed in this paper can be represented by Figure 2.Figure 2
Flowchart of segmentation algorithm.


## 3.1. Polyphase Level Set

Level set is proposed on the basis of active contour model (ACM), which is widely used in the field of image processing. Multiphase level set is an improvement based on the level set, which divides the image into multiple small areas with different attributes according to the grayscale information and edge intensity information of the image itself. The core idea is to use the level set functionΦ to represent the energy function of each divided region, and the energy function of each Ω1,Ω2,…,Ωn (n is the number of divided regions) region contains a membership function Miϕ (i is the corresponding membership function subscript). Taking the two-phase level set as an example, M1ϕ=Hϕ and M2ϕ=1−Hϕ represent the membership functions of Ω1 and Ω2, respectively, and H is the Heaviside function. The energy function composed of these membership functions achieves the final segmentation effect through continuous iterative evolution. The energy function is expressed by(1)εϕ,c,b=∫∑i=1n∫κy−xx−byci2Miϕxdxdy.Among them,Ix is a gray-scale image function, κy−x is a window function, b is an offset field, which is a parameter of uneven gray scale, and ci is a constant array. This energy function represents the data item. This function and the weighted length term energy function LΦ and the weighted area term energy function RΦ together form a level set equation, which is expressed by(2)Fϕ,c,b=εϕ,c,b+vLϕ+μRϕ.The functionFϕ,c,b iterates to minimize the energy value to achieve the segmentation effect. v and μ are the weighted length term energy function coefficient and the weighted area term energy function coefficient [19].Multiphase level set has a good segmentation effect on images with uneven intensity. The choice of specific phase depends on the properties of the image itself. For the left ventricular ultrasound image, the different echo intensities of the ventricular wall and papillary muscles plus the effect of noise make the image roughly divided into three gray levels, as shown in Figure1(a), that is, the black echoless intensity area, the white myocardial wall area, and the gray papillary muscle and noise area. When different phases are selected, the segmentation results are different. In the case of phase n=2, the area of the ventricular wall with strong echo grayscale and the noise with weak echo grayscale and the area of the papillary muscle is difficult to separate, which greatly interferes with the subsequent binary image processing process and makes the result inaccurate. In the case of n>3, the segmentation result is more refined for the different grayscale intensity regions of the left ventricle image. However, this sacrifices the calculation speed, and it is difficult to meet the timeliness requirements in clinical applications. Based on the comprehensive consideration of segmentation accuracy and time complexity, this paper uses a three-phase level set method, that is, using two level set functions ϕ1 and ϕ2 to represent three membership functions, respectively:(3)M1ϕ1,ϕ2=Hϕ1Hϕ2,M2ϕ1,ϕ2=Hϕ11−Hϕ2,M3ϕ1,ϕ2=1−Hϕ1.Figure 1
Binary image processing. (a) Three-phase level set segmentation results. (b) The results obtained by taking out the white part in (a). (c) Parabolic model. (d) Left ventricular fully filled map. (e) Parabolic sampling. (f) Sampling of the wall boundary.
(a)(b)(c)(d)(e)(f)


## 3.2. Binary Image Processing

Refer to the ultrasonic heart image for analysis, and then, apply it to the feature extraction of kidney tissue. The low signal-to-noise ratio of the ultrasound heart image makes the three-phase level set segmentation result, and the area with the same attribute still contains a lot of noise. The part that appears in the left ventricular cavity is regarded as noise, and the purpose of binary image processing is to remove these noises. At the same time, the left ventricular myocardial wall disconnected area and the hollow area are connected and filled separately to prepare for the next linear fitting [20]. Before binary processing, the white part of the myocardial wall area is first extracted, as shown in Figure 1(b). It can be seen that the three-phase level set has segmented the left ventricular wall and the boundary is clear, and the noise in the cavity and the echo intensity of the myocardial wall are also segmented. In order to remove these noises, a parabola model is established in the heart cavity during the process, as shown in Figure 1(c). Then, all white parts in the parabola are removed. Since the ventricular walls are connected, the number of pixels in the white area where the myocardial wall is connected is relatively large. In this way, white noise with few independent pixels in the image can be removed. Before establishing the parabola, the entire image is opened and closed to avoid removing the independent small noise area and the effective area of the ventricular wall, so as to achieve the effect of denoising while retaining the details of the effective area of the image. The parabolic model here is determined by manually selecting three points. Among them, the vertex is the vertex of the left ventricular contour, and the two bottom points are the intersection points of the mitral valve and the left ventricular contour, respectively. In the process of image filling, the outline image of the left ventricle is sometimes completely closed due to the systole, which makes the left ventricle completely filled. In this paper, a void channel is provided outside the center of the parabola and the image sector to prevent the ventricle from being completely filled. The algorithm in this paper solves the problem of full filling of the left ventricle in Figure 1(d). Figure 1(e) is the sampling of the parabola of Figure 1(c), and Figure 1(f) is the sampling of the wall boundary points based on Figure 1(e) [21].


## 3.3. Curve Fitting

Before using the disc method to determine the volume of the left ventricle, the outline of the left ventricle must be drawn with a curve. The curve here must meet two conditions: firstly, the curve must be continuously closed; secondly, the curve changes smoothly everywhere, and there should be no local “protrusion” or “depression,” which is based on the requirements of the model of the left ventricular smooth contour of the heart. This paper combines the least square method and cubic spline interpolation to fit the left ventricular contour, and the internal contour is divided into four segments. The left and right wall regions are fitted by least squares method, the top of the left ventricle is fitted by cubic spline interpolation, and the bottom of the left ventricle is a straight line connected by the left and right bottom points. Since the middle of the left ventricle and the left atrium are connected areas, the two are separated by a straight line, which is also consistent with the clinical left ventricular model [22].Least squares method finds the best function matching of data by minimizing the sum of squared errors. This method can find unknown data and minimize the sum of squared errors between these data and actual data. The basic formula is(4)∑t=1qΧstβt=yss=1,2,3,…,p.Among them,p and q represent the equation and the number of unknown numbers, respectively, and β is the unknown number. In the image, for the fitting of points, the advantage of the least square method is that the curve fitting results are less affected by individual abnormal points. However, the curve it fits does not necessarily pass through the first two points of the series of points, which makes the use of multiple curves in the left ventricular contour fitting process inconsistent. However, the cubic spline interpolation method is just complementary to the least square method. Its fitting curve passes through the first and the last two points and connects multiple curves using the least square fitting method to form a closed inner contour curve. In this paper, two points with relatively large curvature in the contour of the two walls of the ventricle to the top of the ventricle are selected, and cubic spline interpolation and least squares are used to fit above and below the two points, respectively, to ensure the continuity of the final curve. The main idea of the cubic spline interpolation method is that when some data points x1,x2,…,xr and corresponding values y1,y2,…,yr in the interval u,v are given, the value of the expression of the function in the interval of every two points is obtained. The expression is [23](5)Sx=a1x3+a2x2+a3x+a4.Among them，a1,a2,a3,anda4 are the coefficients and each interval is continuous at the intersection, and its first and second derivatives are continuous at the intersection. After that, the value of Sx can be obtained by a mathematical method. The algorithm proposed in this paper can be represented by Figure 2.Figure 2
Flowchart of segmentation algorithm.


## 4. Optical Flow Method

Optical flow refers to the change of the brightness mode that the space object shows in the image plane during the movement of the space object. It is generated by the relative motion of the object in space and the imaging plane and contains the motion information of the object, which can be used to reflect the motion of the object. The concept of the optical flow field is derived from the optical flow. The optical flow field is the displacement of the spot and is also the result of the speckle tracking method, which can reflect the instantaneous change of the spot.We assume thatEx,y,t is the brightness of a coordinate point on the image at time t. At time t+dt, the coordinate of this point becomes x+dx,y+dy, the sampling interval between the two images is extremely short, and the value of dt is very small. Moreover, during the change of the two images, the brightness value of the point does not change, namely,(6)Ex,y,t=Ex+dx,y+dy,t+dt.The following result can be obtained by expanding the right side of the above formula with Taylor series:(7)Ex+dx,y+dy,t+dt=Ex,y,t+dx∂E∂x+dy∂E∂y+dt∂E∂t+ε,where ε is the derivative term of the second derivative and above in the Taylor series. We combine formula (6) to transform formula (7), eliminate Ex,y,t on both sides of formula (7), then divide the right term by dt, and make ε approach 0. At this time, we can obtain(8)dxdt∂E∂x+dydt∂E∂y+∂E∂t=0.If in formula (8)(9)∂E∂x=Ex,∂E∂y=Ey,∂E∂t=Et,dxdt=u,dydt=v,then formula (8) can be written as(10)Exu+Eyv+Et=0.Formula (10) is the optical flow constraint equation. Among them, Ex,Ey,andEt is the partial differentiation of the coordinate points on the image in the x, y direction and time t, respectively, and these three values can be directly obtained from the properties of the image itself. The optical flow constraint equation represents the partial differential of the pixel brightness value of the image to the coordinates and time and the optical flow field u,v. However, only the optical flow constraint equation is difficult to find the optical flow field. This problem is known as the aperture effect. To find the optical flow, another set of equations is needed, which is given by some additional constraints. There are many research methods in the related field for solving the aperture effect. The more classic methods are Horn–Schunck method and Lucas–Kanade method.The Horn–Schunck method assumes that the optical flow changes smoothly over the entire image, that is, the optical flow field satisfies both the conditions of optical flow smoothness and optical flow constraints. There are two ways to satisfy the condition of global smoothing. The first is to find the minimum value of the Laplacian square sum of the optical flow in thex and y directions. The formula is(11)∇2u=∂2u∂x2+∂2u∂y2,∇2v=∂2v∂x2+∂2v∂y2.Another method is to obtain the minimum value of the square sum of optical flow gradient. The formula is(12)∂u∂x2+∂u∂y2,∂v∂x2+∂v∂y2.Because noise has too much influence on the result of solving the Laplace square, Horn–Schunck adopts the minimum value method of the square sum of the optical flow gradient in the actual processing process, which can be summarized by(13)min∫∫∂E∂xv+∂E∂yv+∂E∂t2+λ∂u∂x2+∂u∂y2+∂v∂x2∂v∂y2dxdy.Among them,λ is used to control the smoothness, and the smoothness increases with the increase of λ.The Lucas–Kanade method assumes that, in a small image area, each coordinate point has the same optical flow fieldu,v. This method is more effective under nondeformable conditions. This method uses the weighted least squares method to calculate the optical flow constraint equation of each pixel in a small image area Ω while preserving the optical flow constraint equation and then adds the results. The optical flow estimation error is defined as(14)∑x,y∈ΩW2xIxu+Iyv+It,where W (x) is a weight function so that the influence of the central pixel on the result is greater than that of the surrounding pixels. The Lucas–Kanade method is effective when the displacement of the two images of the object is small.These two methods are the most classic methods in optical flow method, and most other algorithms based on optical flow method are optimization and improvement of these two methods. J. Poree proposed a regularized least squares method, which combines optical flow method with Doppler imaging to calculate the time-resolved velocity vector field more accurately. M. Suhling proposed a new optical flow-based method to evaluate the cardiac motion of a two-dimensional echocardiographic sequence. It uses a local affine model to perform spatial local analysis of space velocity and linear model. This method is based on the spot tracking method of the optical flow method and is based on the condition that the optical flow intensity of adjacent frames remains unchanged. This method has high sensitivity to the gray-scale transformation of pixels and can accurately track the detailed features in the image rigid transformation. The disadvantage of the optical flow method is that the algorithm is greatly affected by image noise, and the mismatch rate caused by the nonrigid transformation of the image is high. Moreover, the inherent speckle dissipation of echocardiography will have a great impact on the accuracy of the optical flow method. At this time, the optical flow method often needs to be combined with the assistance of other algorithms to complete the tracking of the spot. Secondly, the calculation of optical flow method is usually very large, which is not conducive to its application in clinical real-time processing.


## 5. Block Matching

The block matching method is a regional matching method. It assumes that the overall gray value of pixels in a certain area in two adjacent frames does not change, and it tracks the spots by searching the area with the highest similarity matching in the two frames. The basic principle of the block matching method is shown in Figure3:Figure 3
Schematic diagram of the block matching method.The block matching method searches for the best similarity module with the same size as the template block in the previous frame in the search window in the current frame. The position of the template block in the previous frame is usually centered on the selected tracking point, and the size determines the spatial velocity resolution of the image, which is usually determined by prior knowledge. The size of the search window in the current frame is related to the video frame rate of the echocardiogram. The template block in the block matching method is composed of a group of pixels instead of one pixel and is relatively insensitive to image noise. By taking advantage of the regional matching method, the displacement of the point can be better matched.The implementation of the block matching method needs to consider three aspects: one is the size of the image template block and the size of the search window, the second is the search strategy for finding the most similar blocks in the image block, and the third is the matching criteria used to match the similarity of the template blocks in two adjacent frames. The search strategy is a search method for searching the similarity module in the search window. The full search strategy has the highest accuracy, but the algorithm takes the most time. The fast search strategy to improve this includes two-dimensional log search method, diamond search method, and three-step search method. The matching criterion is a function used to measure the similarity between template blocks. The commonly used measurement functions include minimum absolute error function, normalized correlation function, minimum mean square error function, and average absolute difference function. Next, the three elements of the block matching method are introduced in detail.


### 5.1. Image Block Size and Search Window

Different image block sizes have an effect on the accuracy and efficiency of the tracking results of the block matching method. Regardless of the block matching method or the optical flow method, one of the problems that must be faced is that, during the movement of the left ventricle, the results of different frames in the imaging will be different. The specific manifestation is that the speckle correlation of echocardiography is reduced. This phenomenon may be caused by heart movement jitter or human breathing. The imaging quality of different ultrasound equipment is also different. However, no matter what the reason is, the lack of image information caused by the decrease in speckle correlation will affect the accuracy of the tracking process, so the ultrasonic speckle during the stable motion is the basis of tracking. If the size of the selected image block is too large, the correlation of the spots will be relatively improved, and the influence of local spot changes and noise on the results is relatively small. However, it is difficult to show subtle changes or sharp changes during exercise. If the size of the selected image block is too small, its effect is just the opposite. The correlation of the spots is reduced, and the noise and subtle spot changes have a greater impact on the accuracy of the results, but it is more sensitive to small changes or violent motion changes. Therefore, the determination of the size of the image block has a great influence on the performance of the tracking result, and it is necessary to obtain suitable parameters based on experience and continuous attempts.The selection of the size of the search window also affects the tracking performance to a certain extent. If the selected window is too large, it may lead to wrong tracking points and increase the amount of calculation. However, if the selected window is too small, the best matching point may not be found. In specific applications, we also need to keep trying to get the best search window size.


### 5.2. Matching Criteria

The matching criterion is a function used to measure the similarity between template blocks. The commonly used methods are mean absolute differences (MAD), normalized cross correlation (NCC), sum of absolute differences (SAD), and sum of squared differences (SSD). The following describes these algorithms:(1)
The average absolute difference algorithm (MAD) is often used in pattern recognition. This method has a simple idea and high matching accuracy and has a wide range of applications in image matching. We assume thatSx,y is a search image block of m×n and Tx,y is a template image of m×n. In the search image block S, the subgraph of M×N is selected and its similarity with the template is calculated. The calculation formula of MAD similarity is as follows:(15)Di,j=1M×N∑s=1M∑t=1NSi+s−1,j+t−1−Ts,t.Among them, the smaller theDi,j value, the higher the similarity.(2)
The normalized product correlation algorithm NCC is to calculate the matching degree between the two modules by using the gray scale of the subpicture and the template image and the normalized correlation measurement formula. The formula is as follows:(16)Ri,j=∑s=1M∑t=1NSi,js,t−ESi,j⋅Ts,t−ET∑s=1M∑t=1NSi,js,t−ESi,j2Ts,t−ET2.Among them,ET and ESi,j represent the average gray value of the template and subpicture at i,j. The larger the result of Ri,j, the higher the similarity. The accuracy of the NCC results is high, but the amount of calculation is large.(3)
The absolute error and algorithm SAD are actually similar to the MAD algorithm. This method makes a little change in the similarity measurement formula, and its formula is(17)Di,j=∑s=1M∑t=1NSi+s−1,j+t−1−Ts,t.Compared with MAD, SAD removes the process of averaging. The smaller the result ofDi,j, the higher the similarity.(4)
The sum of squared errors algorithm SSD is also very similar to the SAD algorithm, and its formula is(18)Di,j=∑s=1M∑t=1NSi+s−1,j+t−1−Ts,t2.The SSD algorithm has one more square operation than the SAD algorithm, which also increases the calculation of the algorithm. The smaller the result ofDi,j, the higher the similarity.After comparing MAD, NCC, SAD, and SSD, it can be seen that the calculation of NCC is much larger than the calculation of the other three methods. It not only involves averaging but also performs square and square root operations. In terms of calculation accuracy, SSD involves the operation of the square root, which is more sensitive to the noise in the image and is easy to mismatch the results. Since MAD and SAD only involve the operation of finding absolute value, there is no square sum. Therefore, both are better in terms of time efficiency and anti-interference to local image noise. Compared with MAD, SAD reduces the division operation, so its calculation efficiency is faster. Bany H. Friemel compares the three matching criteria. Under the two factors of time complexity and accuracy of the comprehensive matching criteria, the data prove that the SAD matching effect is the best. Bohs chose SAD instead of NCC for correlation matching in tissue and blood tracking experiments. The results confirm that SAD has the same tracking accuracy as NCC, and the calculation amount is much smaller than NCC. Through the comparison of the above matching criteria, all the comparative experiments in this paper select SAD as the matching criterion in the block matching method.


### 5.3. Search Strategy

Different search strategies will have an impact on the accuracy and efficiency of the results. Currently, there are many methods that can be used to search for image block locations. The common methods include full search, two-dimensional log search, and three-step search. The following describes some commonly used methods:(1)
The full search method is also called the exhaustive search method. The algorithm searches every position in the search window and finds the tracking point with the highest similarity by comparing the similarity function of each point. Therefore, its accuracy is the highest among all search methods. However, this method requires a large amount of calculation.(2)
The two-dimensional logarithmic search method can be represented by Figure4.The specific steps are as follows.(i)
Step 1: in the current frame, the coordinates of the point to be tracked in the previous frame are set as the center point, as shown in gray ① in Figure4, and the search step is set to half the tracking distance. Then, four search points are found at the four positions above, below, left, and right of the center point, and a total of five points are added to the center point, and these five points are used as the points to be detected in the current frame that need to calculate similarity.(ii)
Step 2: the five points in the current frame are calculated for similarity. If the calculated best point position is four points around the center point, then the best point is taken as the center and the step 1 is repeated to search again. If the calculated best point is the center point, then the algorithm jumps to step 3.(iii)
Step 3: the tracking distance is halved, and the process of step 1 is repeated until the last tracking distance step is 1.(3)
The search method of the diamond search method is shown in Figure5. There are two types of diamond search methods. One is the large diamond search, which has 9 search points, as shown in Figure 6(a), and the other is the small diamond search, which has 5 search points, as shown in Figure 6(b).The specific steps are as follows.(i)
Step 1: in the current frame, the coordinates of the point to be tracked in the previous frame are set as the center point, as shown by gray ① in Figure5. According to the large diamond search mode, 8 points around the center point are found. After that, similarity matching is performed on these 9 points including the center point and the best position among these points is found. If this optimal location point is not the center point, then the algorithm jumps to step 2. However, if this point is the center point, then the algorithm jumps to step 3.(ii)
Step 2: in step 1, the best matching point is taken as the center point, and a large diamond search model is used to find 8 points to be matched around the center point, and similarity matching and comparison are performed on 9 points including the center point. If the best matching point is not the center point, then the algorithm continues to repeat step 2. However, if the best matching point is the center point, then the algorithm jumps to step 3.(iii)
Step 3: the best matching point in the previous step is taken as the center point, and the four diamond points next to the center point are found using the small diamond search mode. After that, similarity matching and comparison are performed on 5 points including the center point, and the best matching block position is found and used as the tracking result in the next frame.(4)
The three-step search method can be represented by Figure7.The specific steps are as follows.(i)
Step 1: in the current frame, the coordinates of the point to be tracked in the previous frame are set as the center point, the search step is set to half of the tracking distance, and the point to be detected is found in 8 points around the center point. After that, the similarity of 9 points including the center point is calculated and the point with the highest similarity is found.(ii)
Step 2: the point with the highest similarity detected in the previous step is taken as the center point, and the search step is set to half of the previous step, and the point to be detected is found in 8 points around the center point. After that, the similarity of 9 points including the center point is calculated and the point with the highest similarity is found.(iii)
Step 3: the point with the highest similarity detected in the previous step is taken as the center point, and the search step is set to half of the previous step, and the point to be detected is found in 8 points around the center point. After that, the similarity of 9 points including the center point is calculated and the point with the highest similarity is found. This point is used as the tracking point for the next frame.Figure 4
Two-dimensional logarithmic search method.Figure 5
Diamond search method.Figure 6
Diamond model. (a) Large diamond search model. (b) Small diamond search model.
(a)(b)Figure 7
Three-step search method.


## 5.1. Image Block Size and Search Window

Different image block sizes have an effect on the accuracy and efficiency of the tracking results of the block matching method. Regardless of the block matching method or the optical flow method, one of the problems that must be faced is that, during the movement of the left ventricle, the results of different frames in the imaging will be different. The specific manifestation is that the speckle correlation of echocardiography is reduced. This phenomenon may be caused by heart movement jitter or human breathing. The imaging quality of different ultrasound equipment is also different. However, no matter what the reason is, the lack of image information caused by the decrease in speckle correlation will affect the accuracy of the tracking process, so the ultrasonic speckle during the stable motion is the basis of tracking. If the size of the selected image block is too large, the correlation of the spots will be relatively improved, and the influence of local spot changes and noise on the results is relatively small. However, it is difficult to show subtle changes or sharp changes during exercise. If the size of the selected image block is too small, its effect is just the opposite. The correlation of the spots is reduced, and the noise and subtle spot changes have a greater impact on the accuracy of the results, but it is more sensitive to small changes or violent motion changes. Therefore, the determination of the size of the image block has a great influence on the performance of the tracking result, and it is necessary to obtain suitable parameters based on experience and continuous attempts.The selection of the size of the search window also affects the tracking performance to a certain extent. If the selected window is too large, it may lead to wrong tracking points and increase the amount of calculation. However, if the selected window is too small, the best matching point may not be found. In specific applications, we also need to keep trying to get the best search window size.


## 5.2. Matching Criteria

The matching criterion is a function used to measure the similarity between template blocks. The commonly used methods are mean absolute differences (MAD), normalized cross correlation (NCC), sum of absolute differences (SAD), and sum of squared differences (SSD). The following describes these algorithms:(1)
The average absolute difference algorithm (MAD) is often used in pattern recognition. This method has a simple idea and high matching accuracy and has a wide range of applications in image matching. We assume thatSx,y is a search image block of m×n and Tx,y is a template image of m×n. In the search image block S, the subgraph of M×N is selected and its similarity with the template is calculated. The calculation formula of MAD similarity is as follows:(15)Di,j=1M×N∑s=1M∑t=1NSi+s−1,j+t−1−Ts,t.Among them, the smaller theDi,j value, the higher the similarity.(2)
The normalized product correlation algorithm NCC is to calculate the matching degree between the two modules by using the gray scale of the subpicture and the template image and the normalized correlation measurement formula. The formula is as follows:(16)Ri,j=∑s=1M∑t=1NSi,js,t−ESi,j⋅Ts,t−ET∑s=1M∑t=1NSi,js,t−ESi,j2Ts,t−ET2.Among them,ET and ESi,j represent the average gray value of the template and subpicture at i,j. The larger the result of Ri,j, the higher the similarity. The accuracy of the NCC results is high, but the amount of calculation is large.(3)
The absolute error and algorithm SAD are actually similar to the MAD algorithm. This method makes a little change in the similarity measurement formula, and its formula is(17)Di,j=∑s=1M∑t=1NSi+s−1,j+t−1−Ts,t.Compared with MAD, SAD removes the process of averaging. The smaller the result ofDi,j, the higher the similarity.(4)
The sum of squared errors algorithm SSD is also very similar to the SAD algorithm, and its formula is(18)Di,j=∑s=1M∑t=1NSi+s−1,j+t−1−Ts,t2.The SSD algorithm has one more square operation than the SAD algorithm, which also increases the calculation of the algorithm. The smaller the result ofDi,j, the higher the similarity.After comparing MAD, NCC, SAD, and SSD, it can be seen that the calculation of NCC is much larger than the calculation of the other three methods. It not only involves averaging but also performs square and square root operations. In terms of calculation accuracy, SSD involves the operation of the square root, which is more sensitive to the noise in the image and is easy to mismatch the results. Since MAD and SAD only involve the operation of finding absolute value, there is no square sum. Therefore, both are better in terms of time efficiency and anti-interference to local image noise. Compared with MAD, SAD reduces the division operation, so its calculation efficiency is faster. Bany H. Friemel compares the three matching criteria. Under the two factors of time complexity and accuracy of the comprehensive matching criteria, the data prove that the SAD matching effect is the best. Bohs chose SAD instead of NCC for correlation matching in tissue and blood tracking experiments. The results confirm that SAD has the same tracking accuracy as NCC, and the calculation amount is much smaller than NCC. Through the comparison of the above matching criteria, all the comparative experiments in this paper select SAD as the matching criterion in the block matching method.


## 5.3. Search Strategy

Different search strategies will have an impact on the accuracy and efficiency of the results. Currently, there are many methods that can be used to search for image block locations. The common methods include full search, two-dimensional log search, and three-step search. The following describes some commonly used methods:(1)
The full search method is also called the exhaustive search method. The algorithm searches every position in the search window and finds the tracking point with the highest similarity by comparing the similarity function of each point. Therefore, its accuracy is the highest among all search methods. However, this method requires a large amount of calculation.(2)
The two-dimensional logarithmic search method can be represented by Figure4.The specific steps are as follows.(i)
Step 1: in the current frame, the coordinates of the point to be tracked in the previous frame are set as the center point, as shown in gray ① in Figure4, and the search step is set to half the tracking distance. Then, four search points are found at the four positions above, below, left, and right of the center point, and a total of five points are added to the center point, and these five points are used as the points to be detected in the current frame that need to calculate similarity.(ii)
Step 2: the five points in the current frame are calculated for similarity. If the calculated best point position is four points around the center point, then the best point is taken as the center and the step 1 is repeated to search again. If the calculated best point is the center point, then the algorithm jumps to step 3.(iii)
Step 3: the tracking distance is halved, and the process of step 1 is repeated until the last tracking distance step is 1.(3)
The search method of the diamond search method is shown in Figure5. There are two types of diamond search methods. One is the large diamond search, which has 9 search points, as shown in Figure 6(a), and the other is the small diamond search, which has 5 search points, as shown in Figure 6(b).The specific steps are as follows.(i)
Step 1: in the current frame, the coordinates of the point to be tracked in the previous frame are set as the center point, as shown by gray ① in Figure5. According to the large diamond search mode, 8 points around the center point are found. After that, similarity matching is performed on these 9 points including the center point and the best position among these points is found. If this optimal location point is not the center point, then the algorithm jumps to step 2. However, if this point is the center point, then the algorithm jumps to step 3.(ii)
Step 2: in step 1, the best matching point is taken as the center point, and a large diamond search model is used to find 8 points to be matched around the center point, and similarity matching and comparison are performed on 9 points including the center point. If the best matching point is not the center point, then the algorithm continues to repeat step 2. However, if the best matching point is the center point, then the algorithm jumps to step 3.(iii)
Step 3: the best matching point in the previous step is taken as the center point, and the four diamond points next to the center point are found using the small diamond search mode. After that, similarity matching and comparison are performed on 5 points including the center point, and the best matching block position is found and used as the tracking result in the next frame.(4)
The three-step search method can be represented by Figure7.The specific steps are as follows.(i)
Step 1: in the current frame, the coordinates of the point to be tracked in the previous frame are set as the center point, the search step is set to half of the tracking distance, and the point to be detected is found in 8 points around the center point. After that, the similarity of 9 points including the center point is calculated and the point with the highest similarity is found.(ii)
Step 2: the point with the highest similarity detected in the previous step is taken as the center point, and the search step is set to half of the previous step, and the point to be detected is found in 8 points around the center point. After that, the similarity of 9 points including the center point is calculated and the point with the highest similarity is found.(iii)
Step 3: the point with the highest similarity detected in the previous step is taken as the center point, and the search step is set to half of the previous step, and the point to be detected is found in 8 points around the center point. After that, the similarity of 9 points including the center point is calculated and the point with the highest similarity is found. This point is used as the tracking point for the next frame.Figure 4
Two-dimensional logarithmic search method.Figure 5
Diamond search method.Figure 6
Diamond model. (a) Large diamond search model. (b) Small diamond search model.
(a)(b)Figure 7
Three-step search method.


## 6. Image Feature Extraction

First, routine grayscale and color Doppler ultrasound examination was performed to observe the location of the tumor, size, shape, boundary, internal echo of the lesion, blood supply of the lesion, renal vein, and whether there was an embolism in the inferior vena cava. At the same time, the image is stored. In addition, patients need to be informed and trained on how to cooperate, such as breath holding or shallow breathing. After identifying the target lesion, we need to keep the ultrasound probe stationary, switch the imaging mode to contrast-specific imaging mode, and set the instrument's MI, focus depth, and gain. The low-MI continuous imaging method is applied to obtain proper tissue suppression and maintain sufficient penetration, and the focus point is placed deep in the observation target. Then, the vein is injected with a contrast agent to perform contrast imaging. To facilitate comparisons, normal and abnormal kidney tissue should be included in the scan plane. In this study, it is recommended to use the double-frame simultaneous display of tissue signal and contrast signal on the same screen and start to inject contrast agent, time, and store images.After injecting the contrast agent through the cubital vein, the first phase is the shorter cortical enhancement phase (9–12 s after the bolus injection). This phase shows a uniform hyperechoic, but renal medulla is not significantly enhanced. Due to the influence of the high attenuation characteristics of the contrast agent and the angle of incidence of the sound beam, the renal parenchyma of the deep beam may be enhanced and weakened or uneven. Thereafter, the renal medulla gradually strengthens from the periphery to the center (20–40 s). After 40–50 s, the cortical and medulla enhancement levels are equivalent, and the entire renal parenchyma presents a more uniform and higher echo (40–120 s). After about 180 s, the contrast medium in the renal parenchyma nearly disappeared. Ultrasound contrast shows the cortical enhancement phase, the medulla enhancement phase, the renal cortex and the medulla which are evenly enhanced, and the late cortical medulla enhancement phase and the regression phase. The degree of enhancement, uniformity of enhancement, and pseudoenvelope sign and its enhancement pattern are observed. The vast majority of kidney cancer ultrasound contrast manifests as a “fast-in and fast-out” rich blood supply enhancement method, that is, echo starts to strengthen in the tumor earlier than the surrounding renal cortex and enhances faster. When the echo reached its peak, the echo enhancement intensity of tumor is higher than that of the surrounding renal cortex (Figure8). The contrast agent in the tumor resolves rapidly, and the echo enhancement intensity of tumor is lower than that of the surrounding renal cortex (Figure 9 and Figure 10). Irregular and nonenhanced areas may appear inside some tumors, which are caused by tumor necrosis and bleeding. This phenomenon is more common in tumors larger than 3 cm in size.Figure 8
After 1.5 ml of SonoVue suspension is injected intravenously, there is uneven enhancement in the tumor during the early cortical phase.Figure 9
The inner part of the medullary stage tumor shows uneven low enhancement.Figure 10
Large areas without tumor enhancement in the regression phase.Enhanced CT examinations are performed on all 50 lesions before operation. The CT examination uses a 64-row CT of GE gemstones. Before the examination, the examination consent is signed. The contrast agent is iopamidol at a dosage of 0.5–2 ml/kg. The patient is lying on the examination bed. The conventional plain scan of the kidney area is performed first, and then, the enhanced scan is performed. The contrast agent is injected through the elbow vein with a high-pressure syringe at an injection rate of 3 to 4 ml/s, a dose of about 1.2 to 1.5 ml/kg, a total of 90 to 100 ml, and a scanning layer thickness of 5 mm. The enhanced scan is divided into three phases: renal cortical phase, renal medulla phase, and excretory phase (or renal pelvis phase). (1) Renal cortical phase: 25 to 35 seconds after the start of contrast injection, the renal cortex is developed but the medulla is not developed. At this time, the boundary between the skin and the medulla is clearest, and almost all renal cancers are most obviously enhanced during the cortical phase (Figure11). The ideal enhanced image can be obtained during this phase, which is the best phase to judge the enhancement degree and enhancement method of kidney tumor. (2) Renal medulla phase: 85 to 95 s after the start of contrast injection, the medulla begins to develop and gradually strengthens, the cortical development weakens, and the enhancement of the cortex and medulla is similar. This phase is the best phase to distinguish normal renal medulla and renal tumors and is the most valuable for judging the benign and malignant of renal tumors (Figure 12). (3) Excretory phase (or renal pelvis phase): 3 to 5 minutes after the start of contrast injection, the density of contrast agent in renal parenchyma gradually decreases, and the contrast agent in renal calyces, renal pelvis, and ureter gradually fills (Figure 13). At this phase, we can observe the morphology of the tumor in the axial position and observe whether the tumor invades the kidney calyx and renal pelvis.Figure 11
Enhanced image of left renal cancer in the cortical phase.Figure 12
Enhanced image of left renal carcinoma in the renal medulla stage.Figure 13
Enhanced image of left kidney cancer in the excretory phase.From the above analysis, it can be seen that the ultrasound image segmentation of kidney tissue image feature extraction proposed in this study has a certain effect. The cardinalities of the above images are too small. In order to further verify the image feature extraction effect of this study, the performance of the image recognition algorithm of this research paper is studied through a comparative test. Several images of left renal cancer in the renal cortical phase, renal medulla phase, and excretory phase are collected, and 75 groups of trials are set up in each phase through random combination. The traditional kidney tissue feature extraction is compared with the ultrasonic image segmentation feature extraction method in this study. The results are shown in Table1.Table 1
Comparison results of traditional kidney tissue feature extraction and the ultrasonic image segmentation feature extraction method of this study.
132.5038.52232.0932.9662.9591.7393.0690.29361.8943.8254.0091.1088.3989.51448.0842.8238.1392.7389.8890.83530.7144.4454.4790.9594.6289.41659.8141.7161.1293.8190.3587.81751.7533.7756.7890.7094.5485.47828.1543.3852.7189.5591.9492.41945.5939.9640.6391.6189.4884.501040.7533.6161.7994.4785.9687.721125.2135.6947.4090.4391.3495.481235.6938.6735.5988.1286.3188.211333.5737.6639.1591.2594.6592.611446.8832.2351.8790.3892.2188.301562.6637.6063.2390.5185.5083.041649.9444.6540.1394.8390.7686.441754.1638.7656.2690.5187.1392.081859.2944.0555.5294.3494.2892.171957.0044.3938.9794.7586.5395.312037.4232.2146.0793.0390.4189.182125.3732.7358.5488.5591.3086.192230.7844.2546.3094.9093.5184.602363.0043.0745.1591.3791.5082.652426.5934.7942.4989.4593.2782.322557.3034.2534.9692.1290.9983.402644.6041.4859.6993.9692.3986.742742.4844.7853.4691.1085.3894.742854.2242.2537.1388.3792.3687.412953.2137.7353.9794.4891.5087.093029.2139.2656.4691.4187.3792.343155.7133.6934.2193.7392.7893.613225.5341.5451.5492.4588.3685.783349.4535.8137.6093.4791.1291.833443.7440.5440.4791.0890.1884.643557.9840.9958.9593.8094.4791.893624.4738.2761.7388.9989.6288.013725.8333.3058.7888.7989.2992.203832.4443.3731.8788.9687.2583.653927.2637.4942.6088.9390.9187.884035.9632.7761.7693.9788.1289.684152.7743.1451.6891.0188.7392.914250.6135.2147.6192.4285.7687.184325.9233.1757.4692.0989.1583.714425.1537.3337.6489.7691.7684.494535.1734.1764.5794.6889.4987.244642.3540.1344.1292.9788.5190.344759.6642.3249.2589.3586.2387.114831.9544.0232.9291.5190.7289.914940.6243.4436.0293.2685.4493.435062.7436.5744.8294.5089.2082.925131.6840.5433.3888.4591.1584.525235.5233.8738.5693.2494.2295.175351.5537.0039.9492.0994.0186.625424.3243.0741.1188.5885.7583.915530.1539.1356.5394.1692.6594.425630.4833.1542.5793.9187.2689.995745.5143.4641.1494.3391.7593.215860.9733.3042.6591.8587.8394.275963.7333.0750.1792.3294.7991.026059.3539.9750.6194.9488.4989.096140.6238.3053.5893.0794.6492.596253.9541.9650.4593.3494.2694.056341.8438.5333.2191.4291.1194.466444.2037.7258.4888.3494.1294.496553.1041.4434.2591.6190.0282.346653.3035.4251.5888.4785.6286.566757.9637.5335.2389.9290.4187.146846.9542.7940.5689.0493.4987.526929.6339.4253.2891.3692.0689.547057.4034.1630.3389.1289.1685.597123.8842.0161.1293.3293.9586.477253.8135.6739.8093.8389.1895.057322.7832.3952.9691.5292.2482.027426.8738.1539.8088.2591.4383.827550.9140.3354.4088.4289.7485.19132.5038.5245.3092.2191.3684.92232.0932.9662.9591.7393.0690.29The image feature recognition results of the left renal cancer in the renal cortical phase, renal medulla phase, and excretory phase are counted, respectively, as shown in Figure14, Figure 15, and Figure 16, respectively.Figure 14
Comparison results of image recognition effect of left renal cancer in the renal cortical stage.Figure 15
Comparison results of image recognition effect of left renal cancer in renal medulla stage.Figure 16
Comparison results of image recognition effect of left renal cancer in the renal medulla stage.As can be seen from Figures14–16, the performance of kidney tissue image feature extraction based on ultrasound image segmentation proposed in this study has significantly improved performance compared to traditional methods. The recognition rate of the methods proposed in this paper is between 85% and 95%, far exceeding the traditional algorithm, and the recognition rate of the methods proposed in this paper meets the current medical tissue feature recognition requirements. Therefore, the method proposed in this paper has certain practicality.


## 7. Conclusion

This paper designs a recognition model suitable for ultrasound image segmentation to solve the problem of automatic segmentation of kidney image features. First of all, this paper proposes an algorithm to segment the image contour. Its function is to automatically perform spot recognition extraction on the kidney image based on the segmentation result. Secondly, this study studies the speckle tracking algorithm, compares different search window sizes and image block sizes, compares the influence of parameters on the results of the block matching method, and analyzes the accuracy optimization effect of the block matching method under optical flow constraints. Thirdly, this study improves the speed of the algorithm by comparing the operation efficiency and accuracy of the pyramid block matching method and then compares the full search method and the two-dimensional log search method under the block matching method to optimize the algorithm speed. Finally, this study uses the algorithm proposed in this paper for clinical verification. The thoughts of the experiment in this paper are in the order of segmentation, tracking, tracking accuracy optimization, tracking speed optimization, and clinical verification. The performance of the method proposed in this paper is verified through experimental research, and the results show that the algorithm proposed in this paper has a certain effect.



---

*Source: 9915697-2021-04-26.xml*