Abstract
AbstractAmong various applications of digital twins, measuring particulate matter in the context of air pollution has become increasingly important due to growing interest in atmospheric environments. By obtaining particle count values from analogue‐to‐digital converter raw data through photodiode and calibrating them, particulate matter values can be acquired. The singular‐value–decomposition is efficient transfer function learning method. However, due to the linear nature of the transfer function of singular‐value–decomposition, it also conveys noise information, necessitating post‐processing to suppress noise. This study proposes a method that utilizes long short‐term memory neural networks to effectively stabilize noise based on the output of continuous dust sensor particulate matter distributions. Using the singular value decomposition based particulate matter shows relative root‐mean‐square error (4.4761, 100%) as a reference, the proposed long short‐term memory post‐processing demonstrates an improved result (2.9328, 65.52%) compared to other post‐processing method: the mean filter (3.6704, 82.00%), low‐pass filter (3.7719, 84.27%) and Kalman filter (3.5550, 79.42%). Furthermore, to address the limitation of initial delay in long short‐term memory to achieve stable data output, a method of iteratively training the initial input data sample is proposed. For the initial input data, the non‐initialization approach exhibited a relative error of 87.57% and it took around 5 samples to predict stable output. In contrast, the proposed iterative training method, applied five times to the initial data sample, achieved a relative error of 9.51% and immediately obtained stable data.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.