Abstract

Abstract In this paper we introduce the concept of segmentation based on mathematical approach using graph theory algorithms using the family of augmenting paths algorithms. We present a new program, an implementation, algorithms and obtained results devoted to segmentation of biomedical data. We implement our program for handling with segmentation, counting a measure of the existence of the minerals in the biomedical data. As a consequence we prove the existence of minerals in the data obtained from the brain of rabbits.

Highlights

  • This paper is motivated by the problem of segmentation and its application on real biomedical data

  • In this paper we introduce the concept of segmentation based on mathematical approach using graph theory algorithms using the family of augmenting paths algorithms

  • We present a new program, an implementation, algorithms and obtained results devoted to segmentation of biomedical data

Read more

Summary

Introduction

This paper is motivated by the problem of segmentation and its application on real biomedical data. We focused on a graph theoretical approach to segmentation which is called "graph cutting" [2, 4, 13,14,15,16]. It means that we have data represented as an image. According to [2,3,4, 13] the minimal cut in network is the equivalent problem to finding a segmentation. We present different segmentation techniques used in image processing and we focus on graph theory based methods. The last Section No 5 is devoted to the conclusion and the summary

Metodology: maximal value and minimum cut in the network
Maximal Flow and Minimal Cut
Ford-Fulkersonov algorithm
Edmonds-Karp algorithm
Transformation of real data into network
Finding the minimum s–t cut
Modifications of the algorithm
Tracing back and saturating the augmenting path
Further modifications
Reconstruction of the system of paths
The program functionality and implementation
Real data processing and results
Findings
Discussion and Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.