Finding minimum spanning trees more efficiently for tile-based phase unwrapping

Measurement Science and Technology

Volumn 17, Issue 6, 2006, Pages 1428-1435

  Sawaf, Firas ^a   Tatam, Ralph P ^a  

^a CRANFIELD UNIVERSITY   (United Kingdom)

Author keywords

Chirped fibre Bragg gratings; Intragrating sensors; Temperature measurement

Indexed keywords

ALGORITHMS; FIBER BRAGG GRATINGS; PROBLEM SOLVING; TEMPERATURE MEASUREMENT; TREES (MATHEMATICS);

CHIRPED FIBRE BRAGG GRATINGS; INTRAGRATING SENSORS; MST ALGORITHM; PRIM'S ALGORITHM;

GRAPH THEORY;

ALGORITHMS; FIBER BRAGG GRATINGS; GRAPH THEORY; PROBLEM SOLVING; TEMPERATURE MEASUREMENT; TREES (MATHEMATICS);

EID: 33646885026     PISSN: 09570233     EISSN: 13616501     Source Type: Journal    
DOI: 10.1088/0957-0233/17/6/022     Document Type: Conference Paper

References (39)

1. Takeda M, Ina H and Khobayashi S 1981 S Fourier-transform method of fringe pattern analysis for computer based topography and interferometry J. Opt. Soc. Am. 72 156-60
2. Macy W W Jr 1983 Two-dimensional fringe pattern analysis Appl. Opt. 22 3898-901
3. Breuckmann B and Thieme W 1985 Computer-aided analysis of holographic interferograms using the phase shift method Appl. Opt. 24 2145-49
4. Thalman R and Dandliker R 1984 High-resolution video processing for holographic interferometry applied to contouring and measuring deformations SPIE ECOOSA (Amsterdam) vol 429
5. Breuckmann B and Thieme W 1985 Computer-aided analysis of holographic interferograms using the phase shift method Appl. Opt. 24 2145-49
6. Dandliker R and Thalmann R 1989 Heterodyne and quasi-heterodyne holographic interferometry Opt. Eng. 24 824-31
7. Reid G T 1986/7 Automatic fringe analysis-a review Opt. Lasers Eng. 7 37-68
8. Robinson D W and Reid G T 1993 Interferogram Analysis-Digital Fringe Pattern Measurements Techniques (Bristol: IOPP)
9. Huntley J M and Saldner H 1993 Temporal phase unwrapping algorithm for automated interferogram analysis Appl. Opt. 32 3047-52
10. Ettemeyer A, Neupert U, Rottenkolber H and Winter C 1989 Schnelle und robuste bildanalyse von streifenmustern-ein wichtiger schritt der automation von hlografischen profprozessen Proc. 1st int. Workshop on Automatic Processing of Fringe Patterns pp 23-31
11. Towers D P, Judge T R and Bryanston-Cross P J 1989 A quasi-heterodyne holograph technique and automatic algorithms for phase unwrapping Proc. SPIE 1163 95
12. Towers D P, Judge T R and Bryanston-Cross P J 1991 Analysis of holographic fringe data using the dual reference approach Opt. Eng. 30 452-60
13. Towers D P, Judge T R and Bryanston-Cross P J 1991 Automatic interferogram analysis techniques applied to quasi-heterodyne holography and ESPI Opt. Lasers Eng. 14 239-81
14. Judge T R, Quan T R and Bryanston-Cross P J 1992 Holographic deformation measurements by Fourier reansform technique with automatic phase unwrapping Opt. Eng. 31 533-43
15. Prim R C 1957 Shortest connection networks and some generalisations Bell Syst. Tech. J. 36 1389-401
16. Judge T R 1992 Quantitative digital image processing in fringe analysis and particle image velocimetry PhD Thesis Warwick University
17. Berge C 1973 Graphs and Hypergraphs (Amsterdam: North-Holland)
18. Bondy J A and Murty U S R 1976 Graph Theory with Applications (New York: North-Holland)
19. Busacker R G and Saaty T L 1965 Finite Graphs and Networks- An Introduction with Applications (New York: McGraw-Hill)
20. Harry F 1969 Graph Theory (Reading, MA: Addison-Wesley)
21. Tarjan R E 1983 Data Structures and Network Algorithms CBMS 44 (Philadelphia, PA: Society for Industrial and Applied Mathematics) pp 72-7
22. Kerschenbaum A and Van Slyke R 1972 Computing minimum spanning trees efficiently Proc. 25th Annu. Conf. ACM pp 518-27
23. Moret B M E and Shapiro H D 1991 An empirical analysis of algorithms for constructing a minimum spanning tress Lecture Notes Comput. Sci. 519 400-11
24. Fredman M L and Tarjan R E 1987 Fibonacci heaps and their use in improved network optimisation algorithms J. ACM 34 596-615
25. Gabow H N, Galil Z, Spencer T and Tarjan R E 1986 Efficient algorithms for finding minimum spanning trees in undirected and directed graphs Combinatorica 6 109-22
26. Yao A C 1975 An O(|E| log log|V|) algorithm for finding minimum spannig trees Inf. Process. Lett. 4 21-3
27. Chazelle B 2000 A minimum spanning tree algorithm with inverse-Ackermann type complexity J. ACM 47 1028-47
28. Pettie S 1999 Finding minimum spanning trees in O(mα(m, n)) time Technical Report T R99-23 University of Texas at Austin
29. Karger D R, Klein P N and Tarjan R E 1995 A randomised linear-time algorithm to find minimum spanning trees J. Assoc. Comput. Mach. 42 321-28
30. King V 1995 A simpler minimum spanning tress verification algorithm Proc. Workshop on Algorithms and Data Structures
31. Cheriton D and Tarjan R E 1976 Finding minimum spanning trees SIAM J. Comput. 5 724-42
32. Matsui T 1995 The minimum spanning tree problem on a planar graph Discrete Appl. Math. 58 91-4
33. Frederickson G 1985 Data structures for on-line updating of minimum spanning tree, with applications SIAM J. Comput. 14 781-98
34. Eppstine D, Italiano G F, Tamassia R, Tarjan R E, Westbrook J and Yung M 1990 Maintanace of minimum spanning forest in a dynamic planar graph Proc. 1st ACM/SIAM Symp. Discrete Algorithms pp 1-11
35. Gabow H N and Stallman M 1985 Efficient algorithms for graphic matroid intersection and priority Proc. 12th Int. Conf. Automata, Languages, and Programming (Lecture Notes in Computer Science vol 194) (Berlin: Springer) pp 210-20
36. Boruvka O 1926 O jistem problemu minimalnim Praca Morvavke Prirodovedecke Spolecnosi 3 37-58 (Czech with summary in German, translated in [37])
37. Nesetril J, Milkova E and Nesetrilova H 2001 Otakar Boruvka on minimum spanning tree problem Discrete Mathematics 233 3-36 (Engl. Transl.)
38. Kruskal J B 1956 On the shortest spanning sub-tree of a graph and the travelling salesman problem Proc. Am. Math. Soc. 7 48-50
39. Siek J G, Lee L Q and Lumsdaine A 2002 The Boost Graph Library (Reading, MA: Addison-Wesley)