Abstract

Background-oriented Schlieren tomography (BOST) is widely used for 3D reconstruction of turbulent flames. Two major concerns are associated with 3D reconstruction. One is the time asynchrony within the data acquisition of the high-speed camera. The other is that the ray tracing process requires significant computational consumption. This study proposes a ray tracing optimization method based on the k-d tree. The study results show that the average search nodes for each ray are only 0.018% of 3D flame with 3.07 million grid nodes. In addition, a parameter estimation method of the unknown azimuth power spectrum function is proposed. First, a typical Sandia turbulent jet diffusion flame dataset was built and validated accordingly, with experiments. The algorithm’s applicability to the 3D reconstruction of temperature and density fields is discussed on this basis. The root-mean-square error (RMSE) of the cross-section density for 3D reconstruction is below 0.1 kg/m3. In addition, the RMSE of the cross-section temperature is below 270 K. Finally, an uncertainty analysis of the flame reconstruction based on a physical model is performed by optimizing the ray tracing method. For the time asynchronous variance of 1 ms, the density uncertainty of the 3D reconstruction is below 1.6 × 10−2 kg/m3, and the temperature uncertainty is below 70 K. The method can provide an essential basis for the design of BOST systems and the 3D reconstruction of turbulent flames.

Full Text
Paper version not known

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.