From Segmented Images to Good Quality Meshes Using Delaunay Refinement

2009 ◽  
pp. 13-37 ◽  
Author(s):  
Jean-Daniel Boissonnat ◽  
Jean-Philippe Pons ◽  
Mariette Yvinec
Keyword(s):  
Delaunay Refinement ◽  
Segmented Images

An effective technique for diabetic retinopathy using hybrid machine learning technique

2021 ◽  
pp. 096228022098354
Author(s):  
N Satyanarayana Murthy ◽  
B Arunadevi
Keyword(s):  
Diabetic Retinopathy ◽  
Short Term Memory ◽  
Early Recognition ◽  
Hybrid Techniques ◽  
Specificity And Sensitivity ◽  
Retinal Blood Vessels ◽  
Segmented Images ◽  
Fuzzy C Means Clustering ◽  
Working Region

Diabetic retinopathy (DR) stays as an eye issue that has continuously developed in individuals who experienced diabetes. The complexities in diabetes cause harm to the vein at the back of the retina. In outrageous cases, DR could swift apparition disaster or visual impairment. This genuine impact had the option to charge through convenient treatment and early recognition. As of late, this issue has been spreading quickly, particularly in the working region, which in the end constrained the interest of an analysis of this disease from the most prompt stage. Therefore, that are castoff to protect the progressions of this disorder, revealing of the retinal blood vessels (RBVs) play a foremost role. The growth of an abnormal vessel leads to the development steps of DR, where it can be well known by extracting the RBV. The recognition of the BV for DR by developing an automatic approach is a major aim of our research study. In the proposed method, there are two major steps: one is segmentation and the second one is classification of affected retinal BV. The proposed method uses the Kinetic Gas Molecule Optimization based on centroid initialization used for the Fuzzy C-means Clustering. In the classification step, those segmented images are given as input to hybrid techniques such as a convolution neural network with bidirectional-long short-term memory (CNN with Bi-LSTM). The learning degree of Bi-LSTM is revised by using the self-attention mechanism for refining the classification accuracy. The trial consequences disclosed that the mixture algorithm achieved higher accuracy, specificity, and sensitivity than existing techniques.

scholarly journals Real Color Model of a Cadaver for Deep Brain Stimulation of the Subthalamic Nucleus

2021 ◽  
Vol 11 (11) ◽  
pp. 4999
Author(s):  
Chung-Yoh Kim ◽  
Jin-Seo Park ◽  
Beom-Sun Chung
Keyword(s):  
Deep Brain Stimulation ◽  
Subthalamic Nucleus ◽  
Brain Stimulation ◽  
Magnetic Resonance Images ◽  
Target Point ◽  
Anatomical Structures ◽  
Volume Model ◽  
Segmented Images ◽  
Volume Models ◽  
Deep Brain

When performing deep brain stimulation (DBS) of the subthalamic nucleus, practitioners should interpret the magnetic resonance images (MRI) correctly so they can place the DBS electrode accurately at the target without damaging the other structures. The aim of this study is to provide a real color volume model of a cadaver head that would help medical students and practitioners to better understand the sectional anatomy of DBS surgery. Sectioned images of a cadaver head were reconstructed into a real color volume model with a voxel size of 0.5 mm × 0.5 mm × 0.5 mm. According to preoperative MRIs and postoperative computed tomographys (CT) of 31 patients, a virtual DBS electrode was rendered on the volume model of a cadaver. The volume model was sectioned at the classical and oblique planes to produce real color images. In addition, segmented images of a cadaver head were formed into volume models. On the classical and oblique planes, the anatomical structures around the course of the DBS electrode were identified. The entry point, waypoint, target point, and nearby structures where the DBS electrode could be misplaced were also elucidated. The oblique planes could be understood concretely by comparing the volume model of the sectioned images with that of the segmented images. The real color and high resolution of the volume model enabled observations of minute structures even on the oblique planes. The volume models can be downloaded by users to be correlated with other patients’ data for grasping the anatomical orientation.

scholarly journals PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES

2007 ◽  
Vol 17 (01) ◽  
pp. 1-30 ◽  
Author(s):  
DANIEL A. SPIELMAN ◽  
SHANG-HUA TENG ◽  
ALPER ÜNGÖR
Keyword(s):  
Mesh Size ◽  
Constant Factor ◽  
Two Dimensions ◽  
Three Dimensions ◽  
Delaunay Refinement ◽  
Steiner Points ◽  
Input Domain ◽  
Set Of Points ◽  
Refinement Algorithm

We present a parallel Delaunay refinement algorithm for generating well-shaped meshes in both two and three dimensions. Like its sequential counterparts, the parallel algorithm iteratively improves the quality of a mesh by inserting new points, the Steiner points, into the input domain while maintaining the Delaunay triangulation. The Steiner points are carefully chosen from a set of candidates that includes the circumcenters of poorly-shaped triangular elements. We introduce a notion of independence among possible Steiner points that can be inserted simultaneously during Delaunay refinements and show that such a set of independent points can be constructed efficiently and that the number of parallel iterations is O( log 2Δ), where Δ is the spread of the input — the ratio of the longest to the shortest pairwise distances among input features. In addition, we show that the parallel insertion of these set of points can be realized by sequential Delaunay refinement algorithms such as by Ruppert's algorithm in two dimensions and Shewchuk's algorithm in three dimensions. Therefore, our parallel Delaunay refinement algorithm provides the same shape quality and mesh-size guarantees as these sequential algorithms. For generating quasi-uniform meshes, such as those produced by Chew's algorithms, the number of parallel iterations is in fact O( log Δ). To the best of our knowledge, our algorithm is the first provably polylog(Δ) time parallel Delaunay-refinement algorithm that generates well-shaped meshes of size within a constant factor of the best possible.

scholarly journals Detection and Classification of Cancer from Microscopic Biopsy Images Using Clinically Significant and Biologically Interpretable Features

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Rajesh Kumar ◽  
Rajeev Srivastava ◽  
Subodh Srivastava
Keyword(s):  
Texture Features ◽  
Histogram Equalization ◽  
Gray Level ◽  
Segmentation Methods ◽  
Segmented Images ◽  
Clinically Significant ◽  
Classification Of Images ◽  
Nearest Neighborhood ◽  
Neighborhood Method

A framework for automated detection and classification of cancer from microscopic biopsy images using clinically significant and biologically interpretable features is proposed and examined. The various stages involved in the proposed methodology include enhancement of microscopic images, segmentation of background cells, features extraction, and finally the classification. An appropriate and efficient method is employed in each of the design steps of the proposed framework after making a comparative analysis of commonly used method in each category. For highlighting the details of the tissue and structures, the contrast limited adaptive histogram equalization approach is used. For the segmentation of background cells, k-means segmentation algorithm is used because it performs better in comparison to other commonly used segmentation methods. In feature extraction phase, it is proposed to extract various biologically interpretable and clinically significant shapes as well as morphology based features from the segmented images. These include gray level texture features, color based features, color gray level texture features, Law’s Texture Energy based features, Tamura’s features, and wavelet features. Finally, the K-nearest neighborhood method is used for classification of images into normal and cancerous categories because it is performing better in comparison to other commonly used methods for this application. The performance of the proposed framework is evaluated using well-known parameters for four fundamental tissues (connective, epithelial, muscular, and nervous) of randomly selected 1000 microscopic biopsy images.

Deep Learning-Based Knowledge Extraction From Diseased and Healthy Edible Plant Leaves

2021 ◽  
Vol 12 (2) ◽  
pp. 67-81
Author(s):  
Udit Jindal ◽  
Sheifali Gupta
Keyword(s):  
Neural Network ◽  
Deep Learning ◽  
Plant Disease ◽  
Disease Detection ◽  
Edible Plant ◽  
Research Article ◽  
Segmented Images ◽  
Significant Area ◽  
Testing Accuracy ◽  
Disease Present

Agriculture contributes majorly to all nations' economies, but crop diseases are now becoming a very big issue that has to be resolving immediately. Because of this, crop/plant disease detection becomes a very significant area to work. However, a huge number of studies have been done for automatic disease detection using machine learning, but less work has been done using deep learning with efficient results. The research article presents a convolution neural network for plant disease detection by using open access ‘PlantVillage' dataset for three versions that are colored, grayscale, and segmented images. The dataset consists of 54,305 images and is being used to train a model that will be able to detect disease present in edible plants. The proposed neural network achieved the testing accuracy of 99.27%, 98.04%, and 99.14% for colored, grayscale, and segmented images, respectively. The work also presents better precision and recall rates on colored image datasets.

scholarly journals A Comparative Study on Application of Computer Vision and Fluorescence Imaging Spectroscopy for Detection of Huanglongbing Citrus Disease in the USA and Brazil

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Caio B. Wetterich ◽  
Ratnesh Kumar ◽  
Sindhuja Sankaran ◽  
José Belasque Junior ◽  
Reza Ehsani ◽  
...  
Keyword(s):  
Computer Vision ◽  
Fluorescence Imaging ◽  
Imaging Spectroscopy ◽  
Texture Features ◽  
Support Vector ◽  
Infected Leaf ◽  
Segmented Images ◽  
The Usa ◽  
Citrus Disease

The overall objective of this work was to develop and evaluate computer vision and machine learning technique for classification of Huanglongbing-(HLB)-infected and healthy leaves using fluorescence imaging spectroscopy. The fluorescence images were segmented using normalized graph cut, and texture features were extracted from the segmented images using cooccurrence matrix. The extracted features were used as an input into the classifier, support vector machine (SVM). The classification results were evaluated based on classification accuracies and number of false positives and false negatives. The results indicated that the SVM could classify HLB-infected leaf fluorescence intensities with up to 90% classification accuracy. Though the fluorescence intensities from leaves collected in Brazil and the USA were different, the method shows potential for detecting HLB.

Sign in / Sign up

Export Citation Format

Share Document