Automated Method for Retinal Artery Vein Separation via Graph Search Metaheuristic Approach


Identifying retinal biomarkers linked with systemic and neurodegenerative illnesses requires the separation of the vascular tree into arteries and veins. Using a graph search metaheuristic, we show how to automatically separate arteries and veins from colour fundus images. Vascular subtrees are labelled arteries and veins in our method based on local information that is combined with global information. Vessel network graphs are generated using binary vessel maps, which depict topological and geographic connection of the vessels. Vascular trees are divided into subtrees based on the anatomical distinctiveness of vessel crossing and branching locations. Based on hand-crafted characteristics trained with a random forest classifier, subtrees of vessels are labelled with A/V. Retinal datasets from AV-DRIVE and CT-DRIVE have been used to test the proposed method's accuracy with an average accuracy of 94.7 per cent, 93.2 per cent; 96 per cent; and 90.2 per cent accordingly among the four datasets. As can be seen from the data, our proposed strategy outperforms current best practises in A/V separation.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : A Siamese Content-Attentive Graph Convolutional Network For Personality Recognition Using Physiology ABSTRACT: Affective multimedia information has long been employed as a source of stimulation in the study
PROJECT TITLE : Robust Unsupervised Multi-view Feature Learning with Dynamic Graph ABSTRACT: By modeling the affinity associations with a graph to lower the dimension, graph-based multi-view feature learning algorithms learn a
PROJECT TITLE : A Grassmannian Graph Approach to Affine Invariant Feature Matching ABSTRACT: Feature matching in 2D and 3D for affine invariant 2D and 3D objects is a long-standing challenge in computer vision. There are two stages
PROJECT TITLE :Phase Transitions and a Model Order Selection Criterion for Spectral Graph Clustering - 2018ABSTRACT:One in every of the longstanding open issues in spectral graph clustering (SGC) is the thus-called model order
PROJECT TITLE :Semantic Neighbor Graph Hashing for Multimodal Retrieval - 2018ABSTRACT:Hashing strategies are widely used for approximate nearest neighbor search in recent years due to its computational and storage effectiveness.

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry