Extraction of fringe sceleton and data organization using n-ary trees in automatic interferogram processing

The fringe centers allocation is one of the important steps in obtaining the information from interferometric patterns. In this work the algorithm of sceleton lines extraction and the way of data organizations with using of n-ary trees in the program of interferogram processing is presented. Such manner of data representation makes further work with sceleton lines more convenient. Moreover, it allows one to exclude false minima and maxima on later stages of processing (after the sceleton lines extraction) with more sensible methods than filtration. The work of the program has been tested on computer-simulated interferograms as well as on real ones.