scholarly journals Active Contours Using Harmonic Global Division Function

2019 ◽  
Vol 9 (4) ◽  
pp. 4457-4462
Author(s):  
M. T. Bhatti ◽  
S. Soomro ◽  
A. M. Bughio ◽  
T. A. Soomro ◽  
A. Anwar ◽  
...  

This paper presents the region-based active contours method based on the harmonic global signed pressure force (HGSPF) function. The proposed formulation improves the performance of the level set method by utilizing intensity information based on the global division function, which has the ability to segment out regions with higher intensity differences. The new energy utilizes harmonic intensity, which can better preserve the low contrast details and can segment complicated areas easily. A Gaussian kernel is adjusted to regularize level set and to escape an expensive reinitialization. Finally, a set of real and synthetic images are used for validation of the proposed method. Results demonstrate the performance of the proposed method, the accuracy values are compared to previous state-of-the-art methods.

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Farhan Akram ◽  
Jeong Heon Kim ◽  
Chan-Gun Lee ◽  
Kwang Nam Choi

Segmentation of regions of interest is a well-known problem in image segmentation. This paper presents a region-based image segmentation technique using active contours with signed pressure force (SPF) function. The proposed algorithm contemporaneously traces high intensity or dense regions in an image by evolving the contour inwards. In medical image modalities these high intensity or dense regions refer to tumor, masses, or dense tissues. The proposed method partitions an image into an arbitrary number of subregions and tracks down salient regions step by step. It is implemented by enforcing a new region-based SPF function in a traditional edge-based level set model. It partitions an image into subregions and then discards outer subregion and partitions inner region into two more subregions; this continues iteratively until a stopping condition is fulfilled. A Gaussian kernel is used to regularize the level set function, which not only regularizes it but also removes the need of computationally expensive reinitialization. The proposed segmentation algorithm has been applied to different images in order to demonstrate the accuracy, effectiveness, and robustness of the algorithm.


PLoS ONE ◽  
2021 ◽  
Vol 16 (8) ◽  
pp. e0255948
Author(s):  
Haiping Yu ◽  
Ping Sun ◽  
Fazhi He ◽  
Zhihua Hu

Image segmentation is a fundamental task in image processing and is still a challenging problem when processing images with high noise, low resolution and intensity inhomogeneity. In this paper, a weighted region-based level set method, which is based on the techniques of local statistical theory, level set theory and curve evolution, is proposed. Specifically, a new weighted pressure force function (WPF) is first presented to flexibly drive the closed contour to shrink or expand outside and inside of the object. Second, a faster and smoother regularization term is added to ensure the stability of the curve evolution and that there is no need for initialization in curve evolution. Third, the WPF is integrated into the region-based level set framework to accelerate the speed of the curve evolution and improve the accuracy of image segmentation. Experimental results on medical and natural images demonstrate that the proposed segmentation model is more efficient and robust to noise than other state-of-the-art models.


Author(s):  
YU QIAN ZHAO ◽  
XIAO FANG WANG ◽  
FRANK Y. SHIH ◽  
GANG YU

This paper presents a new level-set method based on global and local regions for image segmentation. First, the image fitting term of Chan and Vese (CV) model is adapted to detect the image's local information by convolving a Gaussian kernel function. Then, a global term is proposed to detect large gradient amplitude at the outer region. The new energy function consists of both local and global terms, and is minimized by the gradient descent method. Experimental results on both synthetic and real images show that the proposed method can detect objects in inhomogeneous, low-contrast, and noisy images more accurately than the CV model, the local binary fitting model, and the Lankton and Tannenbaum model.


2016 ◽  
Vol 2016 ◽  
pp. 1-15 ◽  
Author(s):  
Shafiullah Soomro ◽  
Farhan Akram ◽  
Jeong Heon Kim ◽  
Toufique Ahmed Soomro ◽  
Kwang Nam Choi

This paper introduces an improved region based active contour method with a level set formulation. The proposed energy functional integrates both local and global intensity fitting terms in an additive formulation. Local intensity fitting term influences local force to pull the contour and confine it to object boundaries. In turn, the global intensity fitting term drives the movement of contour at a distance from the object boundaries. The global intensity term is based on the global division algorithm, which can better capture intensity information of an image than Chan-Vese (CV) model. Both local and global terms are mutually assimilated to construct an energy function based on a level set formulation to segment images with intensity inhomogeneity. Experimental results show that the proposed method performs better both qualitatively and quantitatively compared to other state-of-the-art-methods.


2019 ◽  
Author(s):  
Wengong Jin ◽  
Regina Barzilay ◽  
Tommi S Jaakkola

The problem of accelerating drug discovery relies heavily on automatic tools to optimize precursor molecules to afford them with better biochemical properties. Our work in this paper substantially extends prior state-of-the-art on graph-to-graph translation methods for molecular optimization. In particular, we realize coherent multi-resolution representations by interweaving trees over substructures with the atom-level encoding of the original molecular graph. Moreover, our graph decoder is fully autoregressive, and interleaves each step of adding a new substructure with the process of resolving its connectivity to the emerging molecule. We evaluate our model on multiple molecular optimization tasks and show that our model outperforms previous state-of-the-art baselines by a large margin.


2020 ◽  
Vol 8 (1) ◽  
pp. 84-90
Author(s):  
R. Lalchhanhima ◽  
◽  
Debdatta Kandar ◽  
R. Chawngsangpuii ◽  
Vanlalmuansangi Khenglawt ◽  
...  

Fuzzy C-Means is an unsupervised clustering algorithm for the automatic clustering of data. Synthetic Aperture Radar Image Segmentation has been a challenging task because of the presence of speckle noise. Therefore the segmentation process can not directly rely on the intensity information alone but must consider several derived features in order to get satisfactory segmentation results. In this paper, it is attempted to use the fuzzy nature of classification for the purpose of unsupervised region segmentation in which FCM is employed. Different features are obtained by filtering of the image by using different spatial filters and are selected for segmentation criteria. The segmentation performance is determined by the accuracy compared with a different state of the art techniques proposed recently.


Author(s):  
Jorge F. Lazo ◽  
Aldo Marzullo ◽  
Sara Moccia ◽  
Michele Catellani ◽  
Benoit Rosa ◽  
...  

Abstract Purpose Ureteroscopy is an efficient endoscopic minimally invasive technique for the diagnosis and treatment of upper tract urothelial carcinoma. During ureteroscopy, the automatic segmentation of the hollow lumen is of primary importance, since it indicates the path that the endoscope should follow. In order to obtain an accurate segmentation of the hollow lumen, this paper presents an automatic method based on convolutional neural networks (CNNs). Methods The proposed method is based on an ensemble of 4 parallel CNNs to simultaneously process single and multi-frame information. Of these, two architectures are taken as core-models, namely U-Net based in residual blocks ($$m_1$$ m 1 ) and Mask-RCNN ($$m_2$$ m 2 ), which are fed with single still-frames I(t). The other two models ($$M_1$$ M 1 , $$M_2$$ M 2 ) are modifications of the former ones consisting on the addition of a stage which makes use of 3D convolutions to process temporal information. $$M_1$$ M 1 , $$M_2$$ M 2 are fed with triplets of frames ($$I(t-1)$$ I ( t - 1 ) , I(t), $$I(t+1)$$ I ( t + 1 ) ) to produce the segmentation for I(t). Results The proposed method was evaluated using a custom dataset of 11 videos (2673 frames) which were collected and manually annotated from 6 patients. We obtain a Dice similarity coefficient of 0.80, outperforming previous state-of-the-art methods. Conclusion The obtained results show that spatial-temporal information can be effectively exploited by the ensemble model to improve hollow lumen segmentation in ureteroscopic images. The method is effective also in the presence of poor visibility, occasional bleeding, or specular reflections.


2015 ◽  
Vol 2015 ◽  
pp. 1-19 ◽  
Author(s):  
Mohammed M. Abdelsamea ◽  
Giorgio Gnecco ◽  
Mohamed Medhat Gaber ◽  
Eyad Elyan

Most Active Contour Models (ACMs) deal with the image segmentation problem as a functional optimization problem, as they work on dividing an image into several regions by optimizing a suitable functional. Among ACMs, variational level set methods have been used to build an active contour with the aim of modeling arbitrarily complex shapes. Moreover, they can handle also topological changes of the contours. Self-Organizing Maps (SOMs) have attracted the attention of many computer vision scientists, particularly in modeling an active contour based on the idea of utilizing the prototypes (weights) of a SOM to control the evolution of the contour. SOM-based models have been proposed in general with the aim of exploiting the specific ability of SOMs to learn the edge-map information via their topology preservation property and overcoming some drawbacks of other ACMs, such as trapping into local minima of the image energy functional to be minimized in such models. In this survey, we illustrate the main concepts of variational level set-based ACMs, SOM-based ACMs, and their relationship and review in a comprehensive fashion the development of their state-of-the-art models from a machine learning perspective, with a focus on their strengths and weaknesses.


2018 ◽  
Vol 8 (12) ◽  
pp. 2393 ◽  
Author(s):  
Lin Sun ◽  
Xinchao Meng ◽  
Jiucheng Xu ◽  
Shiguang Zhang

When the level set algorithm is used to segment an image, the level set function must be initialized periodically to ensure that it remains a signed distance function (SDF). To avoid this defect, an improved regularized level set method-based image segmentation approach is presented. First, a new potential function is defined and introduced to reconstruct a new distance regularization term to solve this issue of periodically initializing the level set function. Second, by combining the distance regularization term with the internal and external energy terms, a new energy functional is developed. Then, the process of the new energy functional evolution is derived by using the calculus of variations and the steepest descent approach, and a partial differential equation is designed. Finally, an improved regularized level set-based image segmentation (IRLS-IS) method is proposed. Numerical experimental results demonstrate that the IRLS-IS method is not only effective and robust to segment noise and intensity-inhomogeneous images but can also analyze complex medical images well.


Sign in / Sign up

Export Citation Format

Share Document