Improved graph cut model with features of superpixels and neighborhood patches for myocardium segmentation from ultrasound image PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Improved graph cut model with features of superpixels and neighborhood patches for myocardium segmentation from ultrasound image PDF full book. Access full book title Improved graph cut model with features of superpixels and neighborhood patches for myocardium segmentation from ultrasound image by Xiangfen Song. Download full books in PDF and EPUB format.
Author: Xiangfen Song
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 23
Get Book Here
Book Description
Ultrasound (US) imaging has the technical advantages for the functional evaluation of myocardium compared with other imaging modalities. However, it is a challenge of extracting the myocardial tissues from the background due to low quality of US imaging. To better extract the myocardial tissues, this study proposes a semi-supervised segmentation method of fast Superpixels and Neighborhood Patches based Continuous Min-Cut (fSP-CMC).
Author: Xiangfen Song
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 23
Get Book Here
Book Description
Ultrasound (US) imaging has the technical advantages for the functional evaluation of myocardium compared with other imaging modalities. However, it is a challenge of extracting the myocardial tissues from the background due to low quality of US imaging. To better extract the myocardial tissues, this study proposes a semi-supervised segmentation method of fast Superpixels and Neighborhood Patches based Continuous Min-Cut (fSP-CMC).
Author: Xiangfen Song
Publisher: Infinite Study
ISBN:
Category : Medical
Languages : en
Pages : 23
Get Book Here
Book Description
Ultrasound (US) imaging has the technical advantages for the functional evaluation of myocardium compared with other imaging modalities. However, it is a challenge of extracting the myocardial tissues from the background due to low quality of US imaging.
Author: 李承霖
Publisher:
ISBN:
Category :
Languages : en
Pages : 66
Get Book Here
Book Description
Author: 胥吉友
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
Author: Oscar Camara
Publisher: Springer
ISBN: 3642283268
Category : Computers
Languages : en
Pages : 299
Get Book Here
Book Description
This book constitutes the thoroughly refereed post-conference proceedings of the Second International Workshop on Statistical Atlases and Computational Models of the Heart: Imaging and Modelling Challegenges, STACOM 2011, held in conjunction with MICCAI 2011, in Toronto, Canada, in September 2011. The 28 revised full papers were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on EP simulation challenge, motion tracking challenge, segmentation challenge, and regular papers.
Author: Shusil Dangi
Publisher:
ISBN:
Category : Heart
Languages : en
Pages : 192
Get Book Here
Book Description
"Segmentation of the heart structures helps compute the cardiac contractile function quantified via the systolic and diastolic volumes, ejection fraction, and myocardial mass, representing a reliable diagnostic value. Similarly, quantification of the myocardial mechanics throughout the cardiac cycle, analysis of the activation patterns in the heart via electrocardiography (ECG) signals, serve as good cardiac diagnosis indicators. Furthermore, high quality anatomical models of the heart can be used in planning and guidance of minimally invasive interventions under the assistance of image guidance. The most crucial step for the above mentioned applications is to segment the ventricles and myocardium from the acquired cardiac image data. Although the manual delineation of the heart structures is deemed as the gold-standard approach, it requires significant time and effort, and is highly susceptible to inter- and intra-observer variability. These limitations suggest a need for fast, robust, and accurate semi- or fully-automatic segmentation algorithms. However, the complex motion and anatomy of the heart, indistinct borders due to blood flow, the presence of trabeculations, intensity inhomogeneity, and various other imaging artifacts, makes the segmentation task challenging. In this work, we present and evaluate segmentation algorithms for multi-modal, multi-dimensional cardiac image datasets. Firstly, we segment the left ventricle (LV) blood-pool from a tri-plane 2D+time trans-esophageal (TEE) ultrasound acquisition using local phase based filtering and graph-cut technique, propagate the segmentation throughout the cardiac cycle using non-rigid registration-based motion extraction, and reconstruct the 3D LV geometry. Secondly, we segment the LV blood-pool and myocardium from an open-source 4D cardiac cine Magnetic Resonance Imaging (MRI) dataset by incorporating average atlas based shape constraint into the graph-cut framework and iterative segmentation refinement. The developed fast and robust framework is further extended to perform right ventricle (RV) blood-pool segmentation from a different open-source 4D cardiac cine MRI dataset. Next, we employ convolutional neural network based multi-task learning framework to segment the myocardium and regress its area, simultaneously, and show that segmentation based computation of the myocardial area is significantly better than that regressed directly from the network, while also being more interpretable. Finally, we impose a weak shape constraint via multi-task learning framework in a fully convolutional network and show improved segmentation performance for LV, RV and myocardium across healthy and pathological cases, as well as, in the challenging apical and basal slices in two open-source 4D cardiac cine MRI datasets. We demonstrate the accuracy and robustness of the proposed segmentation methods by comparing the obtained results against the provided gold-standard manual segmentations, as well as with other competing segmentation methods."--Abstract.
Author: Ning Yu
Publisher:
ISBN:
Category :
Languages : en
Pages : 118
Get Book Here
Book Description
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages : 16
Get Book Here
Book Description
Author: Michael Verhoek
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
Heart disease is a major cause of death in western countries. In order to diagnose and monitor heart disease, 3D echocardiography is an important tool, as it provides a fast, relatively low-cost, portable and harmless way of imaging the moving heart. Segmentation of cardiac walls is an indispensable method of obtaining quantitative measures of heart function. However segmentation of ultrasound images has its challenges: image quality is often relatively low and current segmentation methods are often not fast. It is desirable to make the segmentation technique as fast as possible, making quantitative heart function measures available at the time of recording. In this thesis, we test two state-of-the-art fast segmentation techniques to address this issue; furthermore, we develop a novel technique for finding the best segmentation propagation strategy between points of time in a cardiac image sequence. The first fast method is Graph Cuts (GC), an energy minimisation technique that represents the image as a graph. We test this method on static 3D echocardiography to segment the myocardium, varying the importance of the regulariser function. We look at edge measures, position constraints and tissue characterisation and find that GC is relatively fast and accurate. The second fast method is Random Forests (RFos), a discriminative classifier using binary decision trees, used in machine learning. To our knowledge, we are the first to test this method for myocardial segmentation on 2D and 3D static echocardiography. We investigate the number of trees, image features used, some internal parameters, and compare with intensity thresholding. We conclude that RFos are very fast and more accurate than GC segmentation. The static RFo method is subsequently applied to all time frames. We describe a novel optical flow based propagation technique that improves the static results by propagating the results from well-performing time frames to less-performing frames. We describe a learning algorithm that learns for each frame which propagation strategy is best. Furthermore, we look at the influence of the number of images and of the training set available per tree, and we compare against other methods that use motion information. Finally, we perform the same propagation learning method on the static GC results, concluding that the propagation method improves the static results in this case as well. We compare the dynamic GC results with the dynamic RFo results and find that RFos are more accurate and faster than GC.
Author: Umar Farooq Mohammad
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Get Book Here
Book Description
Breast cancer is one of the most common diseases with a high mortality rate. Early detection and diagnosis using computer-aided methods is considered one of the most efficient ways to control the mortality rate. Different types of classical methods were applied to segment the region of interest from breast ultrasound images. In recent years, Deep learning (DL) based implementations achieved state-of-the-art results for various diseases in both accuracy and inference speed on large datasets. We propose two different supervised learning-based approaches with adaptive optimization methods to segment breast cancer tumours from ultrasound images. The first approach is to switch from Adam to Stochastic Gradient Descent (SGD) in between the training process. The second approach is to employ an adaptive learning rate technique to achieve a rapid training process with element-wise scaling in terms of learning rates. We have implemented our algorithms on four state-of-the-art architectures like AlexNet, VGG19, Resnet50, U-Net++ for the segmentation task of the cancer lesion in the breast ultrasound images and evaluate the Intersection Over Union (IOU) of the four aforementioned architectures using the following methods : 1) without any change, i.e., SGD optimizer, 2) with the substitution of Adam with SGD after three quarters of the total epochs and 3) with adaptive optimization technique. Despite superior training performances of recent DL-based applications on medical ultrasound images, most of the models lacked generalization and could not achieve higher accuracy on new datasets. To overcome the generalization problem, we introduce semi-supervised learning methods using transformers, which are designed for sequence-to-sequence prediction. Transformers have recently emerged as a viable alternative to natural global self-attention processes. However, due to a lack of low-level information, they may have limited translation abilities. To overcome this problem, we created a network that takes advantages of both transformers and UNet++ architectures. Transformers uses a tokenized picture patch as the input sequence for extracting global contexts from a Convolution Neural Network (CNN) feature map. To achieve exact localization, the decoder upsamples the encoded features, which are subsequently integrated with the high-resolution CNN feature maps. As an extension of our implementation, we have also employed the adaptive optimization approach on this architecture to enhance the capabilities of segmenting the breast cancer tumours from ultrasound images. The proposed method achieved better outcomes in comparison to the supervised learning based image segmentation algorithms.
