Spatial characteristics of thunderstorm rainfall fields and their relation to runoff

The main aim of this study was to assess the ability of simple geometric measures of thunderstorm rainfall in explaining the runoff response from the watershed. For calculation of storm geometric properties (e.g. areal coverage of storm, areal coverage of the high-intensity portion of the storm, position of storm centroid and the movement of storm centroid in time), spatial information of rainfall is needed. However, generally the rainfall data consists of rainfall depth values over an unevenly spaced network of raingauges. For this study, rainfall depth values were available for 91 raingauges in a watershed of about 148 km2. There was a question about which interpolation method should be used for obtaining uniformly gridded data. Therefore, a small study was undertaken to compare cross-validation statistics and computed geometric parameters using two interpolation methods (kriging and multiquadric). These interpolation methods were used to estimate precipitation over a uniform 100 m × 100 m grid. The cross-validation results from the two methods were generally similar and neither method consistently performed better than the other did. In view of these results we decided to use multiquadric interpolation method for the rest of the study. Several geometric measures were then computed from interpolated surfaces for about 300 storm events occurring in a 17-year period. The correlation of these computed measures with basin runoff were then observed in an attempt to assess their relative importance in basin runoff response. It was observed that the majority of the storms (observed in the study) covered the entire watershed. Therefore, it was concluded that the areal coverage of storm was not a good indicator of the amount of runoff produced. The areal coverage of the storm core (10-min intensity greater than 25 mm/h), however, was found to be a much better predictor of runoff volume and peak rate. The most important variable in runoff production was found to be the volume of the storm core. It was also observed that the position of the storm core relative to the watershed outlet becomes more important as the catchment size increases, with storms positioned in the central portion of the watershed producing more runoff than those positioned near the outlet or near the head of the watershed. This observation indicates the importance of interaction of catchment size and shape with the spatial storm structure in runoff generation. Antecedent channel wetness was found to be of some importance in explaining runoff for the largest of the three watersheds studied but antecedent watershed wetness did not appreciably contributed to runoff explanation. © 2002 Elsevier Science B.V. All rights reserved

Network depth: identifying median and contours in complex networks

Centrality descriptors are widely used to rank nodes according to specific concept(s) of importance. Despite the large number of centrality measures available nowadays, it is still poorly understood how to identify the node which can be considered as the `centre' of a complex network. In fact, this problem corresponds to finding the median of a complex network. The median is a non-parametric and robust estimator of the location parameter of a probability distribution. In this work, we present the most natural generalisation of the concept of median to the realm of complex networks, discussing its advantages for defining the centre of the system and percentiles around that centre. To this aim, we introduce a new statistical data depth and we apply it to networks embedded in a geometric space induced by different metrics. The application of our framework to empirical networks allows us to identify median nodes which are socially or biologically relevant

Virtual Rephotography: Novel View Prediction Error for 3D Reconstruction

The ultimate goal of many image-based modeling systems is to render photo-realistic novel views of a scene without visible artifacts. Existing evaluation metrics and benchmarks focus mainly on the geometric accuracy of the reconstructed model, which is, however, a poor predictor of visual accuracy. Furthermore, using only geometric accuracy by itself does not allow evaluating systems that either lack a geometric scene representation or utilize coarse proxy geometry. Examples include light field or image-based rendering systems. We propose a unified evaluation approach based on novel view prediction error that is able to analyze the visual quality of any method that can render novel views from input images. One of the key advantages of this approach is that it does not require ground truth geometry. This dramatically simplifies the creation of test datasets and benchmarks. It also allows us to evaluate the quality of an unknown scene during the acquisition and reconstruction process, which is useful for acquisition planning. We evaluate our approach on a range of methods including standard geometry-plus-texture pipelines as well as image-based rendering techniques, compare it to existing geometry-based benchmarks, and demonstrate its utility for a range of use cases.Comment: 10 pages, 12 figures, paper was submitted to ACM Transactions on Graphics for revie

Data depth and floating body

Little known relations of the renown concept of the halfspace depth for multivariate data with notions from convex and affine geometry are discussed. Halfspace depth may be regarded as a measure of symmetry for random vectors. As such, the depth stands as a generalization of a measure of symmetry for convex sets, well studied in geometry. Under a mild assumption, the upper level sets of the halfspace depth coincide with the convex floating bodies used in the definition of the affine surface area for convex bodies in Euclidean spaces. These connections enable us to partially resolve some persistent open problems regarding theoretical properties of the depth

Intrinsic data depth for Hermitian positive definite matrices

Nondegenerate covariance, correlation and spectral density matrices are necessarily symmetric or Hermitian and positive definite. The main contribution of this paper is the development of statistical data depths for collections of Hermitian positive definite matrices by exploiting the geometric structure of the space as a Riemannian manifold. The depth functions allow one to naturally characterize most central or outlying matrices, but also provide a practical framework for inference in the context of samples of positive definite matrices. First, the desired properties of an intrinsic data depth function acting on the space of Hermitian positive definite matrices are presented. Second, we propose two computationally fast pointwise and integrated data depth functions that satisfy each of these requirements and investigate several robustness and efficiency aspects. As an application, we construct depth-based confidence regions for the intrinsic mean of a sample of positive definite matrices, which is applied to the exploratory analysis of a collection of covariance matrices associated to a multicenter research trial