The invention of the computational tools, especially computers, in the recent decades has led to produce many new medical imaging techniques, such as computed tomography scan (CT scan), ultrasound imaging, magnetic resonance imaging (MRI) and etc., for medical diagnosing. Among these imaging techniques, the ultrasound imaging technique is popularly used in medical diagnosing, mainly in obstetrics, gastrointestinal and cardiovascular fields. The main reasons for the popularity of ultrasound imaging technique are related to other more sophisticated imaging techniques, such as CT, MRI or Positron Emission Tomography (PET), and are its low cost, non-ionizing properties and its portability to provide real time interactive visualization of anatomical structures (Abbott and Thurstone, 1979). Ultrasound images are created by ultrasonic waves, which are produced by dispatching special sound waves through body tissues and receiving their reflex by a transducer and they are processed and transformed into a digital image (Ragesh et al., 2011). Usually, the inappropriate contact or being air gap between the transducer and body lead to create an interference pattern called speckle (Abbott and Thurstone, 1979). Speckle is a particular type of noise that is characterized by a granular pattern of bright and dark spots which tend to degrade the fine details and edges of ultrasound images and consequently lead to complication in clinical diagnosing.

Generally, two families of approaches have been proposed for reducing of speckle noise of ultrasound images:

A) The first family are those filters that perform on ultrasound images directly. In Abazari and Lakestani (2018a) the authors applied the Fourier based discrete shearlet transform to despeckle medical ultrasound images. Ritenour et al. (1984) applied the median filter to suppress speckle noise from the digital radiographic images. The adaptive weighted form of median filter is also suggested by Loupas et al. (1989) to denoise ultrasonic images. The wavelet transform and its complex form are also applied directly for ultrasound images in Deka and Bora (2013), Khare et al. (2010). Elyasi and Pourmina (2016) have employed the TV regularization with modified bayes shrink for reducing of speckle noise from ultrasound images. In Zong et al. (1998) it is shown that the linear filtering cannot be an optimal method for reducing the speckle noises. In Elmoniem et al. (2002) a denoising method based on nonlinear coherent diffusion (NCD) is utilized. Yu and Acton (2002) proposed a despeckle method based on anisotropic diffusion method (SRAD) to cast the spatial adaptive filers into diffusion model (Yu and Acton, 2002). Oriented version of SRAD (OSRAD) filter (Krissian et al., 2007), which is one of the extension of SRAD, was proposed with appraising the properties of the numerical scheme associated with SRAD filter. In Vese and Osher (2003) modified the TV minimization algorithm to reduce speckle noise from ultrasound images. Zhang et al. (2001) proposed an algorithm based on wavelet frame for denoising of Doppler ultrasound signals. Wang et al. (2014) also introduced a new denoising approach based on framelet regularization. An automated approach for segmentation of intravascular ultrasound images is also studied in Vard et al. (2012).

B) The second family are those that firstly convert the speckle noise to an additive noise via log-transform method and then a special filtering is applied to denoise the additive noise. The fundamental properties of speckle noises (Goodman, 1976), the log-transform speckle noise is studied in Hiremath et al. (2013) and their properties in the Contourlet Transform Domain are clearly explained in Kabir and Bhuiyan (2015). The discrete wavelet denoising approaches via log-transform method (Rajeshwar, 2018) are utilized for reducing the speckle noises of medical ultrasound images. In Hazarika et al. (2015), the enhanced Lee filter in lapped orthogonal transform (LOT) domain is applied to despeckle the log-transformed SAR images. Some other approaches to reduce speckle noise in medical ultrasound images are also proposed in Huang et al. (2016), Gupta et al. (2004), Bhuiyan et al. (2009) and the references given there.

As mentioned above, several methods have been proposed for reducing speckle noises, however, each method has its assumptions, advantages, and disadvantages. Among them, the methods based on wavelet transform have good efficiency in noise reduction. However, wavelets fail to capture the geometric regularity along the singularities of curves, because of their isotropic support. To exploit the anisotropic regularity of a curve along edges, the basis must include elongated functions that are nearly parallel to the edges. Several image representations have been proposed to capture the geometric regularity of a given image. Some of these representations are ridgelet (Candes, 1998), brushlet (Meyer and Ronald, 1997), curvelet (Candes and Donoho, 2000), beamlet (Donoho and Huo, 2001), contourlet (Do and Vetterli, 2005) and recently proposed shearlet (Labate et al., 2005).

The sheartlet transform as an alternative anisotropic multi-resolution system has been introduced by Labate et al. (2005) which yields nearly optimal approximation properties (Guo and Labate, 2007). Furthermore, the definition of shearlet transform is such that includes various scales, location and orientation in order to optimally represent an image. This new representation is based on a simple and rigorous mathematical framework which not only provides a more flexible theoretical tool for the geometric representation of multidimensional data, but is more natural for implementation. As a result, the shearlet approach can be associated to a multiresolution analysis (MRA) and this leads to a unified treatment of both the continuous and discrete world (Labate et al., 2005). Also, unlike the wavelets, they are optimal in sparse representation of multi-dimensional data (Guo and Labate, 2012) and, unlike curvelets, their directionality is achieved by shear matrices instead of rotation matrices (Guo and Labate, 2013). The shearlet transform has been applied in diverse areas of engineering and medical sciences, including inverse problems (Colonna et al., 2010), image separation (Kutyniok and Lim, 2011), image restoration (Patel et al., 2009), image denoising (Lakestani et al., 2016) and medical image analysis (Abazari and Lakestani, 2018a). However, due to shift variant nature of the shearlet, this method produces artifacts in the most of their process more in image denoising and image fusion (Vishwakarma et al., 2018). Some improved methods proposed to rectify the mentioned artifacts. Recently, the author proposed a hybrid denoising method based on shearlet transform and yaroslavsky’s method (Abazari and Lakestani, 2018b) to suppress the effect of the pseudo-Gibbs phenomena and shearlet-like artifacts in denoising. The non-subsampled shearlet transform (NSST) is also proposed to capture edges and line discontinuities for image fusion (Vishwakarma et al., 2018). Since the NSST is shift invariant, it diminishes the effect of pseudo-Gibbs phenomena and shearlet-like artifacts in the related processing.

In this paper, by focusing on the non-subsampled form of “discrete shearlet transform” (Hou et al., 2012), we have proposed a despeckling approach via log-transform for speckle noisy ultrasound images. To illustrate the efficiency of the proposed approach, it is applied on a sample image and two real ultrasound images. Numerical results illustrate that the proposed approach can obtain better performance in terms of peak signal to noise ratio (PSNR) and structural similarity (SSIM) index rather than existing state-of-the-art methods.

Speckle noise is characterized by a peculiar granular pattern of bright and dark spots which lead to degrade the resolution of ultrasound images. This typical pattern is also observed in other kind of images involving coherent radiation, such as Laser and Synthetic Aperture Radar (SAR).

Generally, the speckle noise is described as a multiplicative phenomenon. Suppose that the observed image f n be degraded of noise free image f by the speckle noise n s and an additive noise (such as thermal noise) n a as follows from Kabir and Bhuiyan (2015): (1) f n = f n s + n a . Since the effect of additive noise in comparison to speckle noise is very little, so equation (1) can be written as (2) f n = f n s . By applying the log-transformation on (2), we obtain (3) F n = F + N s , where F n = log ( f n ) , F = log ( f ) and N s = log ( n s ). The probability density function (pdf) of n s is given by a Rayleigh pdf as follow: (4) pdf ( n s ) = n s α 2 e − n s 2 2 α 2 , where α is the shape parameter and the expected value of n s will be E ( n s ) = α π 2 . From (3) and (4), it follows that (5) pdf ( N s ) = e N s α 2 e − e 2 N s 2 α 2 , where pdf ( N s ) is the pdf of N s . By applying multi-resolution transform, such as shearlet transform, on (3), we obtain (6) y = x + ε , where y, x and ε represents the coefficients corresponding to F n , F and N s , respectively. In Goodman (1976), Goodman studied some fundamental properties of speckle noise. Also, he shows that the statistics of log-transformed speckle noise is given by a double-exponential probability density function which is known as Fisher–Tippett probability density function. For more information about properties of speckle noise, please see Goodman (1976), Kabir and Bhuiyan (2015) and the references mentioned there.

In this section, the shearlet and its transform both in continuous and discrete form will be briefly explained. The shearlet representation is a directional representation system that provides more geometrical information and shearlets are frame elements used in this representation scheme.

The dilation matrix A a resembles the parabolic scaling, which has an elongated history in the literature of harmonic analysis and can be outlined back to the second dyadic decomposition from the theory of oscillatory integrals. Briefly, from the dilation matrix  A a it can be concluded that the scaling in the x-direction is square of the scaling in the y-direction. The general form of dilation matrix A a is A a = diag ( a , a α ) with the parameter α ∈ ( 0 , 1 ) that controls the degree of anisotropy, however, the value α = 1 2 plays a special role in the discrete setting. In fact, parabolic scaling is required in order to obtain optimally sparse approximations of cartoon-like images (see Definition 2), since it is best adapted to the C 2 -regularity of the curves of discontinuity in the cartoon-like images class (Guo and Labate, 2007). The shearing matrix S s also parameterizes the orientations using the variables associated with the slopes rather than the angles, and has the advantage of leaving the integer lattice invariant, provided s is an integer. The geometric effects of parabolic scaling and shearing with fixed parameter a and several parameter s are illustrated in Fig. 1. The associated continuous shearlet transform of any f ∈ L 2 ( R 2 ) is given by SH ψ f ( a , s , t ) = ⟨ f , ψ a , s , t ⟩ . In other words, SH ψ maps the function f to the coefficients SH ψ f ( a , s , t ) associated with the scale variable a > 00$]]>, the orientation variable s ∈ R, and the location variable t ∈ R 2 .

Now, our main aim is to achieve a continuous shearlet transform, which becomes an isometry, since this is automatically associated with a reconstruction formula. To do it, the generating function ψ must be a well localized function and be compatible with admissibility condition as follows from Labate et al. (2005), ∫ R 2 | ψ ˆ ( ξ 1 , ξ 2 ) | 2 ξ 1 2 d ξ 2 d ξ 1 ⩽ ∞ . So that, each f ∈ L 2 ( R 2 ) has the representation (8) f = ∫ R n ∫ − ∞ ∞ ∫ 0 ∞ ⟨ f , ψ a , s , t ⟩ ψ a , s , t d a a 3 d s d t . Consequently, it can be easily construct examples of shearlets, including examples of admissible shearlets which are well localized. Essentially any function ψ such that ψ ˆ is compactly supported away from the origin is an admissible shearlet. A particular example of these representation is classical shearlet, wherein for any ξ = ( ξ 1 , ξ 2 ) ∈ R ˆ 2 , ξ 1 ≠ 0 , the generating function ψ is setting such that (9) ψ ˆ ( ξ 1 , ξ 2 ) = ψ ˆ 1 ( ξ 1 ) ψ ˆ 2 ( ξ 2 ξ 1 ) , where ψ 1 ∈ L 2 ( R ) is a wavelet which satisfies in the Calderon condition (Guo and Labate, 2007), given by ∑ j ∈ Z | ψ ˆ 1 ( 2 − j ξ ) | 2 = 1 , ∀ a.e. ξ ∈ R with supp ψ ˆ 1 ⊂ [ − 2 , − 1 2 ] ∪ [ 1 2 , 2 ] and ψ 2 ∈ L 2 ( R ) is a bump function with s u p p ψ ˆ 2 ⊂ [ − 1 , 1 ] and ∑ k = − 1 1 | ψ ˆ 2 ( ξ + k ) | 2 = 1 , ∀ a. e. ξ ∈ [ − 1 , 1 ] . Thus, a classical shearlet ψ is a function which is wavelet-like along one axis and bump-like along another one. Each element ψ a , s , t of classic shearlet has frequency support on a pair of trapezoids, at various scales a, symmetric with respect to the origin and oriented along a line of slope s (see Fig. 2). Let ψ ∈ L 2 ( R 2 ) be an admissible shearlet. Define C ψ + = ∫ 0 ∞ ∫ R | ψ ˆ ( ξ 1 , ξ 2 ) | 2 ξ 1 2 d ξ 2 d ξ 1 , C ψ − = ∫ − ∞ 0 ∫ R | ψ ˆ ( ξ 1 , ξ 2 ) | 2 ξ 1 2 d ξ 2 d ξ 1 . If C ψ + = C ψ − = 1, then SH ψ is an isometry.

To obtain the discrete form of the continuous shearlet system and related transform, it is easy to discrete by properly sampling the scale, shear and translation parameters. A (regular) discrete shearlet system, associated with ψ ∈ L 2 ( R 2 ) and denoted by SH ( ψ ), is defined by (10) SH ( ψ ) = { ψ j , k , m = 2 3 4 j ψ ( S k A 2 j . − m ) , j , k ∈ Z , m ∈ Z 2 } , which can be easily obtained by setting ( a , s , t ) = ( 2 − j , − k 2 − j / 2 , S − k 2 − j / 2 A 2 − j m ). Similarly to the continuous case, the discrete shearlet transform of f ∈ L 2 ( R 2 ) is defined as the following map f → SH ψ f ( j , k , m ) = ⟨ f , ψ j , k , m ⟩ , where j , k ∈ Z, m ∈ Z 2 . The main goal of utilizing shearlet systems is analysis and synthesis of 2-D data, therefore, we need to provide a discrete shearlet system SH ( ψ ) which forms a basis or, more generally, a frame. Similar on continuous form, for each f ∈ L 2 ( R 2 ), we have the reproducing formula: (11) f = ∑ j , k ∈ Z , m ∈ Z 2 ⟨ f , ψ j , k , m ⟩ ψ j , k , m , with convergence in the L 2 sense. Also, in Labate et al. (2005), Guo and Labate (2007) it is illustrated that the classical shearlet is a well-localized function, i.e. it has rapid decay both in the spatial and in frequency domain. The well localization property of classical shearlet implies that discrete shearlet system SH ( ψ ) forms a frame. This property is needed for obtaining optimally sparse approximations. Tiling of the frequency plane induced by discrete shearlets ψ ˆ j , k , m is shown in Fig. 3.

The property of optimally sparse approximations of multivariate functions is one of the main motivations to propose the shearlet framework. Before stating the main results, we briefly describe how shearlet expansions are able to achieve optimally sparse approximations. Consider a cartoon-like function f and let SH ψ be a discrete shearlet system of (10). For j ∈ Z, the elements of SH ψ are approximately inside a box of size 2 − j / 2 × 2 − j , it follows that at scale 2 − j there exists about O ( 2 j / 2 ) such waveforms whose support is tangent to the curve of discontinuity. Consequently, for j sufficiently large, each shearlet coefficient ⟨ f , ψ j , k , m ⟩ can be controlled by Guo and Labate (2007, 2012) (12) | ⟨ f , ψ j , k , m ⟩ | ⩽ ‖ f ‖ ∞ ‖ ψ j , k , m ‖ L 1 ⩽ C 2 − 3 j / 4 , where C is a constant. From inequality (12) and the observation that there exists at most O ( 2 j / 2 ) significant coefficients, it can be concluded that the Mth largest shearlet coefficient is bounded by O ( M 3 / 2 ). This implies that the following result holds.

Let ψ j , k , m be a classical shearlet, according to Fig. 2, to attain the reproducing formula (11), it is enough to compute the inner product of ⟨ f , ψ j , k , m ⟩ in both horizontal region D h and vertical region D v . In Guo and Labate (2007, 2012), for both region index d = { h , v }, it can be shown that (13) ⟨ f , ψ j , k , m d ⟩ = 2 3 j 2 ∫ R 2 f ˆ ( ξ ) V ( 2 − 2 j ξ ) W j , k d ( ξ ) ‾ e 2 π i ξ A d − j S d − k m d ξ , where V ( 2 − 2 j ξ ) = ψ ˆ 1 ( 2 − 2 j ξ 1 ) χ D h ( 2 − 2 j ξ ) + ψ ˆ 1 ( 2 − 2 j ξ 2 ) χ D v ( 2 − 2 j ξ ) , W j , k h ( ξ ) = ψ ˆ 2 ( 2 j ξ 2 ξ 1 − k ) χ D h ( ξ ) + ψ ˆ 2 ( 2 j ξ 1 ξ 2 − k + 1 ) χ D v ( ξ ) , if k = − 2 j ψ ˆ 2 ( 2 j ξ 2 ξ 1 − k ) χ D h ( ξ ) + ψ ˆ 2 ( 2 j ξ 1 ξ 2 − k − 1 ) χ D v ( ξ ) , if k = 2 j − 1 ψ ˆ 2 ( 2 j ξ 2 ξ 1 − k ) , otherwise W j , k v ( ξ ) = ψ ˆ 2 ( 2 j ξ 2 ξ 1 − k + 1 ) χ D h ( ξ ) + ψ ˆ 2 ( 2 j ξ 1 ξ 2 − k ) χ D v ( ξ ) , if k = − 2 j ψ ˆ 2 ( 2 j ξ 2 ξ 1 − k − 1 ) χ D h ( ξ ) + ψ ˆ 2 ( 2 j ξ 1 ξ 2 − k ) χ D v ( ξ ) , if k = 2 j − 1 ψ ˆ 2 ( 2 j ξ 1 ξ 2 − k ) , otherwise and A h = 4 0 0 2 , S h = 1 1 0 1 and A v = 2 0 0 4 , S v = S h T . In (13), it is required to compute f ˆ ( ξ ) in discrete form, so given an N × N image f ∈ ℓ 2 ( Z N 2 ), the 2D discrete Fourier transform (DFT) of f will be: f ˆ [ k 1 , k 2 ] = 1 N ∑ n 1 , n 2 = 0 N − 1 f [ n 1 , n 2 ] e − 2 π i ( n 1 N k 1 + n 2 N k 2 ) , where − N 2 ⩽ k 1 , k 2 ⩽ N 2 and brackets [ . , . ] denote the indices of f ˆ in Fourier domain. To compute the integrand of (13), in the space domain and at the resolution level j, firstly, the Laplacian-pyramid (LP) algorithm (Burt and Adelson, 1983) associated with the pseudo-polar Fourier transform (Averbuch et al., 2008) will be utilized. This will achieve the multiscale partition illustrated in Fig. 4, by decomposing f a j − 1 [ n 1 , n 2 ], 0 ⩽ n 1 , n 2 ⩽ N j − 1 , into a low pass filtered image f a j [ n 1 , n 2 ] , a quarter of the size of f a j − 1 [ n 1 , n 2 ] , and a high pass filtered image f d j [ n 1 , n 2 ]. Consequently, to compute the shearlet coefficients ⟨ f , ψ j , k , m d ⟩ given by (13), in the discrete domain, it is enough to compute the inverse pseudo-polar DFT and apply the inverse two-dimensional fast Fourier transform (FFT) on each decomposition level.

We refer to Labate et al. (2005), Guo and Labate (2007, 2012) for additional information about shearlet and its applications in various sciences and engineering.

The main idea of shearlet transform is to filter signals in pseudo-polar grid (Averbuch et al., 2008), and then utilize a bandpass filter in frequency domain directly without sampling operations. Therefore, the directional filtering is kept away from distortion and lead to invariance in shearlet transform. Also, as described in the last section, the discrete form of shearlet transform is achieved by combination of Laplacian-pyramid (Burt and Adelson, 1983) algorithm and directional filter. To improve the computational efficiency and also to reduce the effect of Gibbs phenomena, usually the directional filter is so designed that has a small size support.

The non-subsampled form of Laplacian-pyramid filter (NSLP) is proposed by Cunha et al. (2006). By substituting NSLP for LP and combining it with discrete shearlet transform, non-subsampled shearlet transform (NSST) is designed to improve effectiveness of discrete shearlet transform (Hou et al., 2012). The NSST is known as the shift-invariant version of the shearlet transform. Since the NSST is a fully shift-invariant, multi-scale and multi-directional expansion in comparing to shearlet transform, it can diminish the effect of pseudo-Gibbs phenomena and shearlet-like artifacts in the related processing. The analysis of NSLP can be done as the following iterative processing (Hou et al., 2012): NSLP j + 1 f = ( F h j 1 ∏ k = 1 j − 1 F h k 0 ) f , where f is an image, NSLP j + 1 is the detail coefficients at scale j + 1, and F h k 0 and F h j 1 are low pass and high pass filters of NSLP at scale j and k, respectively. Therefore, according to Fig. 4, given an N × N image f ∈ ℓ 2 ( Z N 2 ), the procedure of the non-subsampled shearlet transform associated with non-subsampled Laplacian-pyramid at a fixed resolution scale j and in the number of direction D j can be summarized in Algorithm 1.

In this section, firstly, we have proposed a denoising algorithm based on non-subsampled shearlet transform associated with log-transform method and secondly evaluated its performance for reducing the speckle noise of the ultrasound images. The structure of present method is similar to those described in Abazari and Lakestani (2018a), Hou et al. (2012). Consider the speckle noisy problem u = v n s , where u is observed image, v is noise free image and n s is the multiplicative speckle noise which is independent of noise free image v. According to relationships (3)–(6), after applying the log-transform, we have g = f + Υ , where g = log ( u ), f = log ( v ) and Υ = log ( n s ). The additive noise Υ has properties similar to additive Gaussian noise. Our goal is to obtain an estimatation of f, namely  f ˜, from the noisy data g by applying a classical soft thresholding scheme (Labate et al., 2005; Guo and Labate, 2007) on the shearlet coefficients of g. The threshold levels are given by τ j , k = c j σ Υ j , k , as in Labate et al. (2005), Guo and Labate (2007, 2012, 2013), where σ Υ j , k is the standard deviation of noise at scale j and shear directional band k and c j is the scaling parameter. Here the standard deviation σ Υ j , k is estimated by using the MATLAB function of std. By using Laplacian-pyramid decomposition, we used five levels of the NSLP decomposition, and we applied a directional decomposition on four of the five scales. According to Fig. 4, we used eight shear filters of size 32 × 32 for the first two scales (coarser scales), and sixteen shear filters of size 16 × 16 for the third and forth levels (fine scales) and so on. Finally, by using the exp-transformation, the estimated image can be obtained as f ˜ = exp ( f ˜ ). Let f be noise free image of size N × N and f ˜ denotes the estimated image, to test our algorithm and to assess its performance, we used two measurements from the following:

The proposed scheme, which is briefly mentioned in Algorithm 2, is implemented using MATLAB 2012. The scours of ShearLab (2008) are used to construct a discrete form of shearlet transform and its non-subsampled form is erected by open source files of NSCT (2008) proposed by Minh. N. Do which initially applied for contourlet transform.

In the first set, we have considered three images listed in Fig. 5 (one sample cartoon-like image and two real ultrasound images same as considered in Yu and Acton (2002), Vese and Osher (2003), Wang et al. (2014), and have compared the results of the proposed method with some related medical ultrasound despeckling techniques from the recent literature such as Yu and Acton (2002), Vese and Osher (2003), Wang et al. (2014). Firstly, we degraded a noise free sample cartoon-like image, (Fig. 5(a)), by multiplicative speckle noise with Rayleigh distribution by variance of υ = 0.8 and then applied the proposed method on this image. To evaluate the efficiency of the proposed method, we used peak signal to noise ratio (PSNR) as a quantity to measure the quality of reconstruction of noisy images and SSIM as a structural similarity index between denoised image and original image. The despeckled image of our proposed method, (Fig. 6(g)), is compared with related techniques of Yu and Acton (2002), Vese and Osher (2003), Wang et al. (2014) with respect to PSNR and SSIM and are shown in Figs. 6(b)–6(f). The measurements of PSNR and SSIM of the proposed method in comparison to those methods mentioned in Yu and Acton (2002), Vese and Osher (2003), Wang et al. (2014) show that the proposed approach is better than those methods, in addition, the proposed method preserves the texture and edges of images while the methods of Yu and Acton (2002), Vese and Osher (2003), Wang et al. (2014) lead to smooth edges of images. Also, to evaluate the visual quality of the proposed approach, similarly to the methods mentioned in Yu and Acton (2002), Vese and Osher (2003), Wang et al. (2014), we employed the proposed method to two real noisy medical ultrasound images (see Figs. 5(b) and 5(c) same as in Yu and Acton (2002), Vese and Osher (2003), Wang et al. (2014)). The results of our proposed method in comparison with the results of state-of-the-art methods mentioned in Yu and Acton (2002), Vese and Osher (2003), Wang et al. (2014) are listed in Figs. 7 and 8.

In the second set, two other real ultrasound images, Fig. 9(a) and 9(b), from Siemens Healthcare (Siemens Healthcare GmbH, 2019), are considered and the proposed method is applied to reduce their speckle noise. The despeckled result of these images are shown in Fig. 9(c) and 9(d), respectively, which show that our proposed method can effectively suppress the speckle noises.

Generally, experimental results of the first and the second set of selected images illustrate that the proposed approach can obtain better performance in terms of PSNR and SSIM for ultrasound image denoising. From visual comparison, it is easy to see that our proposed method gets smooth effect while preserving the edges of images, which lead to maintain the useful texture information of test images.

In this paper, we have proposed a denoising method based on discrete shearlet transform and log-transform methods for speckle suppression in ultrasound images. Our numerical tests are done in MATLAB experiments. The experimental results on a sample cartoon-like image and two real ultrasound images polluted by multiplicative speckle noise illustrate the efficiency of the proposed method in terms of qualitative visual evaluation. Experimental results illustrate that the proposed approach can obtain better performance in terms of peak signal to noise ratio (PSNR) and structural similarity index (SSIM) between despeckled images and original images. This approach can be helpful to assist radiologists in their quest and diagnostics.