Ye, G and Fenner, RA (2014) Weighted least squares with expectation-maximization algorithm for burst detection in U.K. water distribution systems. Journal of Water Resources Planning and Management, 140. pp. 417-424. ISSN 0733-9496Full text not available from this repository.
Flow measurement data at the district meter area (DMA) level has the potential for burst detection in the water distribution systems. This work investigates using a polynomial function fitted to the historic flow measurements based on a weighted least-squares method for automatic burst detection in the U.K. water distribution networks. This approach, when used in conjunction with an expectationmaximization (EM) algorithm, can automatically select useful data from the historic flow measurements, which may contain normal and abnormal operating conditions in the distribution network, e.g., water burst. Thus, the model can estimate the normal water flow (nonburst condition), and hence the burst size on the water distribution system can be calculated from the difference between the measured flow and the estimated flow. The distinguishing feature of this method is that the burst detection is fully unsupervised, and the burst events that have occurred in the historic data do not affect the procedure and bias the burst detection algorithm. Experimental validation of the method has been carried out using a series of flushing events that simulate burst conditions to confirm that the simulated burst sizes are capable of being estimated correctly. This method was also applied to eight DMAs with known real burst events, and the results of burst detections are shown to relate to the water company's records of pipeline reparation work. © 2014 American Society of Civil Engineers.
|Uncontrolled Keywords:||Burst detection Expectation maximization algorithm Flow Signal processing Unsupervised classification Water distribution system Weighted least squares|
|Divisions:||Div D > Sustainable Development|
|Depositing User:||Cron job|
|Date Deposited:||04 Feb 2015 22:55|
|Last Modified:||03 Jun 2015 11:30|