Finding minimum spanning trees more efficiently for tile-based phase unwrapping.
| dc.contributor.author | Al-Sawaf, Firas | - |
| dc.contributor.author | Tatam, Ralph P. | - |
| dc.date.accessioned | 2012-12-10T23:01:38Z | |
| dc.date.available | 2012-12-10T23:01:38Z | |
| dc.date.issued | 2006-06-06T00:00:00Z | - |
| dc.description.abstract | The tile-based phase unwrapping method employs an algorithm for finding the minimum spanning tree (MST) in each tile. We first examine the properties of a tile's representation from a graph theory viewpoint, observing that it is possible to make use of a more efficient class of MST algorithms. We then describe a novel linear time algorithm which reduces the size of the MST problem by half at the least, and solves it completely at best. We also show how this algorithm can be applied to a tile using a sliding window technique. Finally, we show how the reduction algorithm can be combined with any other standard MST algorithm to achieve a more efficient hybrid, using Prim's algorithm for empirical comparison and noting that the reduction algorithm takes only 0.1% of the time taken by the overall hybrid. | en_UK |
| dc.identifier.citation | Firas Al-Sawaf and Ralph P Tatam; Finding minimum spanning trees more efficiently for tile-based phase unwrapping. Measurement Science and Technology, 2006, Volume 17, Issue 6, pp1428-1435 | - |
| dc.identifier.issn | 0957-0233 | - |
| dc.identifier.uri | http://dx.doi.org/10.1088/0957-0233/17/6/022 | - |
| dc.identifier.uri | http://dspace.lib.cranfield.ac.uk/handle/1826/1416 | |
| dc.language.iso | en_UK | - |
| dc.publisher | Iop Publishing Ltd | en_UK |
| dc.subject | phase unwrapping | en_UK |
| dc.subject | minimum spanning tree | en_UK |
| dc.subject | graph theory | en_UK |
| dc.title | Finding minimum spanning trees more efficiently for tile-based phase unwrapping. | en_UK |
| dc.type | Article | - |