Rane, Aniket (2020) Iterative construction of Distributed Component Forests. Bachelor's Thesis, Computing Science.
|
Text
Final_Thesis_AniketRane_s3290999.pdf Download (532kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
toestemming.pdf Restricted to Registered users only Download (93kB) |
Abstract
In this paper, we present an implementation to construct Distributed Component Forests in an iterative manner in situations where the number of processor nodes and memory is limited. The input image is first split into N_t different tiles, where N_t is larger than N_p, the maximal number of nodes or processes on the machine used. Components tees are then computed and stored iteratively for each image tile. In order to adapt the full parallel implementation of constructing Distributed Component Forests in an iterative manner, boundary trees are successfully created, merged, combined and updated by iteratively storing and loading the necessary information in files to perform these operations using a limited number of processes. This implementation would help to process very large images on machines with limited memory capacity.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Supervisor name: | Gazagnes, S.R.N. and Wilkinson, M.H.F. |
| Degree programme: | Computing Science |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 26 Aug 2020 12:26 |
| Last Modified: | 26 Aug 2020 12:26 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/23227 |
Actions (login required)
 |
View Item |