Search

This study applies the discrete wavelet transform (DWT) to decompose the unit hydrograph, thereby generating parsimonious reparameterizations of the unit hydrograph. A model compression method is then employed to significantly compress the unit hydrograph requiring that fewer coefficients be estimated. Moreover, a wavelet-based linearly constrained least mean squares (WLCLMS) algorithm is also used to estimate on-line the wavelet coefficients of the unit hydrograph. The updated wavelet coefficients of the unit hydrograph, convoluted with effective rainfall input in the wavelet domain, allow for accurate prediction of one-step-ahead runoff in the time domain. The proposed approach allows the unit hydrographs to vary in time and accurately predicts runoff from a basin in Taiwan, thus making it highly promising for flood forecasting.

A preliminary method for coding random self-similar river networks and the corresponding distance calculations are proposed in a companion paper. The coding method is applied to generate random self-similar river networks, and the corresponding algorithm for calculating the geometric distances of the links is employed to determine the width function of the river networks, and thus evaluates the adaptability of the process. The width function-based geomorphological instantaneous unit hydrograph (WF-GIUH) model is then applied to estimate the runoff of the Po-bridge watershed in northern Taiwan. The results imply that the separately random self-similar generating algorithm can be used to simulate river networks during the rainfall–runoff process. It can also help analyse the variations of the river network when rainfall locations change and study the influence on hydrological responses (IUH) when the shape of river network changes.

This study proposes a preliminary method for coding random self-similar river networks as a series of numbers, and investigates the corresponding algorithm that calculates the geometric distances from the code series. The coding method, generating random self-similar patterns with various probabilities of particular pattern links, and transferring the pattern into numerical code series, is proposed, based on the wide range of stochastic characteristics of natural patterns. The heredity of self-similarity and the connecting relationships inside the generated pattern are discussed. Finally, the algorithm to calculate the geometric distances of the generated pattern are developed.