- Abstract
- 10.1016/j.aimed.2019.03.221
A study on the Development of a Korean Metabolic Syndrome Questionnaire
- Apr 19, 2019
- Advances in Integrative Medicine
- Byoung-Kab Kang
A study on the Development of a Korean Metabolic Syndrome Questionnaire
Pyramid graph cut: Integrating intensity and gradient information for grayscale medical image segmentation
A study on the Development of a Korean Metabolic Syndrome Questionnaire
A study on the Development of a Korean Metabolic Syndrome Questionnaire
Improved FCM based distance regularization level set algorithm for image segmentation
Considering the traditional contour initialization with high sensitivity to noise limitation in original level-set algorithm, this paper proposes a Distance Regularized Level Set Evolution (DRLSE) evolution model based on the morphological reconstruction FCM algorithm. First, morphological reconstruction (MR) is used to smooth and denoise the image. Under the premise of ensuring anti-noise and image detail preservation, the image is clustered and segmented as the initial contour of DRLSE evolution, and finally the clustering result is segmented by DRLSE model evolution. . The experiment is carried out on multiple images. The segmentation results of the algorithm in this paper are significantly better than the traditional FCM algorithm and DRLSE model, which improves the accuracy of segmentation and is robust to noise.
Read moreDistance Regularized Level Set Evolution and Its Application to Image Segmentation
Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities during its evolution, which may cause numerical errors and eventually destroy the stability of the evolution. Therefore, a numerical remedy, called reinitialization, is typically applied to periodically replace the degraded level set function with a signed distance function. However, the practice of reinitialization not only raises serious problems as when and how it should be performed, but also affects numerical accuracy in an undesirable way. This paper proposes a new variational level set formulation in which the regularity of the level set function is intrinsically maintained during the level set evolution. The level set evolution is derived as the gradient flow that minimizes an energy functional with a distance regularization term and an external energy that drives the motion of the zero level set toward desired locations. The distance regularization term is defined with a potential function such that the derived level set evolution has a unique forward-and-backward (FAB) diffusion effect, which is able to maintain a desired shape of the level set function, particularly a signed distance profile near the zero level set. This yields a new type of level set evolution called distance regularized level set evolution (DRLSE). The distance regularization effect eliminates the need for reinitialization and thereby avoids its induced numerical errors. In contrast to complicated implementations of conventional level set formulations, a simpler and more efficient finite difference scheme can be used to implement the DRLSE formulation. DRLSE also allows the use of more general and efficient initialization of the level set function. In its numerical implementation, relatively large time steps can be used in the finite difference scheme to reduce the number of iterations, while ensuring sufficient numerical accuracy. To demonstrate the effectiveness of the DRLSE formulation, we apply it to an edge-based active contour model for image segmentation, and provide a simple narrowband implementation to greatly reduce computational cost.
Read moreLiver tumor segmentation in noisy CT images using distance regularized level set evolution based on fuzzy C-means clustering
In this paper, we propose an approach to detection and segmentation of liver tumors in noisy computed topography (CT) images. Image segmentation plays crucial role in medical image processing applications. Noise is quite common in medical images. It occurs while acquisition and transmission of images. The essential goal of this framework is to identify liver cancer by segmenting liver tumors from noisy CT scan images. Liver segmentation is difficult task in medical applications because inter-patient variability in size, shape and disease. In general CT scanning is used to inspect liver cancer. In this research work, the liver tumors are detected by the medical images in three stages, pre-processing stage, processing stage and detection stage. First in pre-processing stage, median filter is used to remove the noise from CT image, and then the denoised image is segmented by fuzzy c-means clustering (FCM) algorithm. Finally in the detection stage distance regularized level set evolution (DRLSE) is used to extract tumor boundaries. This algorithm is very much useful for identifying hepatocellular carcinoma (liver cancer). Experimental results on various noisy CT scan images show that the proposed method is efficient for extracting hepatic tumors from liver.
Read moreEffective fuzzy clustering algorithm with Bayesian model and mean template for image segmentation
Fuzzy c‐means (FCMs) with spatial constraints have been considered as an effective algorithm for image segmentation. The well‐known Gaussian mixture model (GMM) has also been regarded as a useful tool in several image segmentation applications. In this study, the authors propose a new algorithm to incorporate the merits of these two approaches and reveal some intrinsic relationships between them. In the authors model, the new objective function pays more attention on spatial constraints and adopts Gaussian distribution as the distance function. Thus, their model can degrade to the standard GMM as a special case. Our algorithm is fully free of the empirically pre‐defined parameters that are used in traditional FCM methods to balance between robustness to noise and effectiveness of preserving the image sharpness and details. Furthermore, in their algorithm, the prior probability of an image pixel is influenced by the fuzzy memberships of pixels in its immediate neighbourhood to incorporate the local spatial information and intensity information. Finally, they utilise the mean template instead of the traditional hidden Markov random field (HMRF) model for estimation of prior probability. The mean template is considered as a spatial constraint for collecting more image spatial information. Compared with HMRF, their method is simple, easy and fast to implement. The performance of their proposed algorithm, compared with state‐of‐the‐art technologies including extensions of possibilistic fuzzy c‐means (PFCM), GMM, FCM, HMRF and their hybrid models, demonstrates its improved robustness and effectiveness.
Read moreAnalyzing Training Information From Random Forests for Improved Image Segmentation
Labeled training data are used for challenging medical image segmentation problems to learn different characteristics of the relevant domain. In this paper, we examine random forest (RF) classifiers, their learned knowledge during training and ways to exploit it for improved image segmentation. Apart from learning discriminative features, RFs also quantify their importance in classification. Feature importance is used to design a feature selection strategy critical for high segmentation and classification accuracy, and also to design a smoothness cost in a second-order MRF framework for graph cut segmentation. The cost function combines the contribution of different image features like intensity, texture, and curvature information. Experimental results on medical images show that this strategy leads to better segmentation accuracy than conventional graph cut algorithms that use only intensity information in the smoothness cost.
Read moreModified distance regularized level set evolution for brain ventricles segmentation
Neurodegenerative disorders are commonly characterized by atrophy of the brain which is caused by neuronal loss. Ventricles are one of the prominent structures in the brain; their shape changes, due to their content, the cerebrospinal fluid. Analyzing the morphological changes of ventricles, aids in the diagnosis of atrophy, for which the region of interest needs to be separated from the background. This study presents a modified distance regularized level set evolution segmentation method, incorporating regional intensity information. The proposed method is implemented for segmenting ventricles from brain images for normal and atrophy subjects of magnetic resonance imaging and computed tomography images. Results of the proposed method were compared with ground truth images and produced sensitivity in the range of 65%–90%, specificity in the range of 98%–99%, and accuracy in the range of 95%–98%. Peak signal to noise ratio and structural similarity index were also used as performance measures for determining segmentation accuracy: 95% and 0.95, respectively. The parameters of level set formulation vary for different datasets. An optimization procedure was followed to fine tune parameters. The proposed method was found to be efficient and robust against noisy images. The proposed method is adaptive and multimodal.
Read moreA Lightweight Pixel-Level Unified Image Fusion Network.
In recent years, deep-learning-based pixel-level unified image fusion methods have received more and more attention due to their practicality and robustness. However, they usually require a complex network to achieve more effective fusion, leading to high computational cost. To achieve more efficient and accurate image fusion, a lightweight pixel-level unified image fusion (L-PUIF) network is proposed. Specifically, the information refinement and measurement process are used to extract the gradient and intensity information and enhance the feature extraction capability of the network. In addition, these information are converted into weights to guide the loss function adaptively. Thus, more effective image fusion can be achieved while ensuring the lightweight of the network. Extensive experiments have been conducted on four public image fusion datasets across multimodal fusion, multifocus fusion, and multiexposure fusion. Experimental results show that L-PUIF can achieve better fusion efficiency and has a greater visual effect compared with state-of-the-art methods. In addition, the practicability of L-PUIF in high-level computer vision tasks, i.e., object detection and image segmentation, has been verified.
Read moreNon-rigid registration between 3D ultrasound and CT images of the liver based on intensity and gradient information
In order to utilize both ultrasound (US) and computed tomography (CT) images of the liver concurrently for medical applications such as diagnosis and image-guided intervention, non-rigid registration between these two types of images is an essential step, as local deformation between US and CT images exists due to the different respiratory phases involved and due to the probe pressure that occurs in US imaging. This paper introduces a voxel-based non-rigid registration algorithm between the 3D B-mode US and CT images of the liver. In the proposed algorithm, to improve the registration accuracy, we utilize the surface information of the liver and gallbladder in addition to the information of the vessels inside the liver. For an effective correlation between US and CT images, we treat those anatomical regions separately according to their characteristics in US and CT images. Based on a novel objective function using a 3D joint histogram of the intensity and gradient information, vessel-based non-rigid registration is followed by surface-based non-rigid registration in sequence, which improves the registration accuracy. The proposed algorithm is tested for ten clinical datasets and quantitative evaluations are conducted. Experimental results show that the registration error between anatomical features of US and CT images is less than 2 mm on average, even with local deformation due to different respiratory phases and probe pressure. In addition, the lesion registration error is less than 3 mm on average with a maximum of 4.5 mm that is considered acceptable for clinical applications.
Read moreChange detection of polarimetric SAR images based on the KummerU Distribution
In the society of PolSAR image segmentation, change detection and classification, the classical Wishart distribution has been used for a long time, but it especially suit to low-resolution SAR image, because in traditional sensors, only a small number of scatterers are present in each resolution cell. With the improving of SAR systems these years, the classical statistical models can therefore be reconsidered for high resolution and polarimetric information contained in the images acquired by these advanced systems. In this study, SAR image segmentation algorithm based on level-set method, added with distance regularized level-set evolution (DRLSE) is performed using Envisat/ASAR single-polarization data and Radarsat-2 polarimetric images, respectively. KummerU heterogeneous clutter model is used in the later to overcome the homogeneous hypothesis at high resolution cell. An enhanced distance regularized level-set evolution (DRLSE-E) is also applied in the later, to ensure accurate computation and stable level-set evolution. Finally, change detection based on four polarimetric Radarsat-2 time series images is carried out at Genhe area of Inner Mongolia Autonomous Region, NorthEastern of China, where a heavy flood disaster occurred during the summer of 2013, result shows the recommend segmentation method can detect the change of watershed effectively.
Read moreEnergy Efficient Clustering and Congestion Control in WSNs with Mobile Sinks
Large scale Wireless Sensor Networks (WSNs) often utilize multiple mobile sink nodes to improve the network lifetime and scalability. However, most of the studies conducted in this context, consider unlimited buffer capacity for the sink nodes. But, this model cannot truly describe the behavior of WSNs and causes congestion in the sink nodes. To solve this problem, in this paper, we use limited buffer capacity for each mobile sink node in WSNs and present a two-level Fuzzy Logic Controller (FLC)-based dynamic clustering scheme and congestion prevention. In this scheme, sink nodes try to predict current load based on their loads in previous rounds by using ARIMA method and based on it, the first FLC selects the nearest uncongested sink node from multiple available mobile sink nodes. Then, the second FLC applies the output of the first FLC to select appropriate nodes as cluster heads to mitigate the energy consumption in the network. Extensive simulation results indicate the effectiveness of the proposed fuzzy logic-based solution in reducing congestion in the mobile sink nodes and improving load balancing in them which these result in the network lifetime improvement and decreasing the number of retransmissions.
Read moreNew insight at level set & Gaussian mixture model for natural image segmentation
Level set method and Gaussian Mixture model (GMM) are two very valuable tools for natural image segmentation. The former aims to acquire good geometrical continuity of segmentation boundaries, while the latter focuses on analyzing statistical properties of image feature data. Some studies on the integration between them have been reported due to their complementarity in the last 10 years. However, these studies generally supposed that the image-featured data density distribution of every segmented domain is independent with each other and can be separately approximated by Gaussian model or GMM, which conflicts with the fundamental idea of GMM clustering-based image segmentation. To remedy this problem, we give a new insight at image segmentation objective under the combined framework between Bayesian theory and GMM density approximation. Thereby, a novel level set image segmentation method integrated with GMM (GMMLS) is proposed. Then, the theoretical analysis on GMMLS is given, in which some valuable results are demonstrated. At last, several types of natural image segmentation experiments are reported and the corresponding results indicate that GMMLS can obtain better or at least equivalent performance compared with existing relevant methods in almost all cases.
Read moreAutomatic Nuclear Segmentation Using Multiscale Radial Line Scanning With Dynamic Programming.
In the diagnosis of various cancers by analyzing histological images, automatic nuclear segmentation is an important step. However, nuclear segmentation is a difficult problem because of overlapping nuclei, inhomogeneous staining, and presence of noisy pixels and other tissue components. In this paper, we present an automatic technique for nuclear segmentation in skin histological images. The proposed technique first applies a bank of generalized Laplacian of Gaussian kernels to detect nuclear seeds. Based on the detected nuclear seeds, a multiscale radial line scanning method combined with dynamic programming is applied to extract a set of candidate nuclear boundaries. The gradient, intensity, and shape information are then integrated to determine the optimal boundary for each nucleus in the image. Nuclear overlap limitation is finally imposed based on a Dice coefficient measure such that the obtained nuclear contours do not severely intersect with each other. Experiments have been thoroughly performed on two datasets with H&E and Ki-67 stained images, which show that the proposed technique is superior to conventional schemes of nuclear segmentation.
Read moreAutomatic Segmentation of MR Brain Images Using Spatial-Varying Gaussian Mixture and Markov Random Field Approach
We present an automatic segmentation method using the Maximum a posterior (MAP)-Markov random field (MRF) framework that possesses regional adaptive capability for the segmentation of MR brain images with the presence of noise and the intensity inhomogeneity. A spatial-varying Gaussian mixture (SVGM) is used to model the conditional probability distribution of each of the three brain tissues (WM, GM and CSF), and the MRF is used to represent prior probabilities. A three-component random vector consisting of spatial and intensity information is used in SVGM such that the model can represent more complex image characteristics, such as intensity inhomogeneity. The regional adaptive capability is achieved by imposing a similarity criterion that minimizes the intensity variation of the segmented tissues in local regions. Initial parameters of SVGM are estimated from a brain atlas using either the expectation maximization (EM) algorithm or modified k-mean (MKM) algorithm, and the iterated conditional modes (ICM) algorithm is used to perform the segmentation. The parameters estimation and the ICM algorithm are alternatively operated until a stopping criterion is reached. The implement of the method is validated by quantitatively comparing with other published classification methods on fifteen simulated and twenty in vivo brain volumes using the same evaluation criteria. Our algorithm demonstrates superior performance in all cases other than two, and is especially suitable for the volumes with higher noise and inhomogeneity. The complete experiments illustrate that the incorporations of the spatial information and the regional adaptive processing into MAP-MRF framework provide better solution to the segmentation of MR brain images.
Read moreA region and gradient based active contour model and its application in boundary tracking on anal canal ultrasound images
A region and gradient based active contour model and its application in boundary tracking on anal canal ultrasound images
Read more