Abstract

BackgroundBreath detection, i.e. its precise delineation in time is a crucial step in lung function data analysis as obtaining any clinically relevant index is based on the proper localization of breath ends. Current threshold or smoothing algorithms suffer from severe inaccuracy in cases of suboptimal data quality. Especially in infants, the precise analysis is of utmost importance. The key objective of our work is to design an algorithm for accurate breath detection in severely distorted data. MethodsFlow and gas concentration data from multiple breath washout test were the input information. Based on universal physiological characteristics of the respiratory tract we designed an algorithm for breath detection. Its accuracy was tested on severely distorted data from 19 patients with different types of breathing disorders. Its performance was compared to the performance of currently used algorithms and to the breath counts estimated by human experts. ResultsThe novel algorithm outperformed the threshold algorithms with respect to their accuracy and had similar performance to human experts. It proved to be a highly robust and efficient approach in severely distorted data. This was demonstrated on patients with different pulmonary disorders. ConclusionOur newly proposed algorithm is highly robust and universal. It works accurately even on severely distorted data, where the other tested algorithms failed. It does not require any pre-set thresholds or other patient-specific inputs. Consequently, it may be used with a broad spectrum of patients. It has the potential to replace current approaches to the breath detection in pulmonary function diagnostics.

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.