924 research outputs found

    Data on geochemical and hydraulic properties of a characteristic confined/unconfined aquifer system of the younger Pleistocene in northeast Germany

    Get PDF
    The paper presents a database of hydrochemical and hydraulic groundwater measurements of a younger Pleistocene multilayered, unconfined/confined aquifer system in NE Germany. The Institute of Landscape Hydrology of the Leibniz Centre for Agricultural Landscape Research (ZALF) operates seven groundwater monitoring wells in the Quillow catchment located in the Uckermark region (federal state of Brandenburg, Germany). From July 2000 to March 2014, water samples were collected periodically on different days of the year and at depths between 3 and 5 m (shallow wells) and 16 and 24 m (deeper wells) below the surface. The parameters pH value, redox potential, electric conductivity, water temperature, oxygen content, spectral absorption coefficient and concentration of hydrogen carbonate, ammonium, phosphate, chloride, bromide, nitrite, sulfate, sodium, potassium, magnesium, calcite, dissolved organic carbon, iron(II) and manganese were determined for each sample (doi:10.4228/ZALF.2000.266). The measurements, taken over a period of 14 years, include a high variation of hydraulic situations represented by a corresponding database of 19 000 recorded groundwater heads. The hydraulic head was measured between 2000 and 201

    Hybrid Wavelet-Support Vector Classifiers

    Full text link
    The Support Vector Machine (SVM) represents a new and very promising technique for machine learning tasks involving classification, regression or novelty detection. Improvements of its generalization ability can be achieved by incorporating prior knowledge of the task at hand. We propose a new hybrid algorithm consisting of signal-adapted wavelet decompositions and SVMs for waveform classification. The adaptation of the wavelet decompositions is tailormade for SVMs with radial basis functions as kernels. It allows the optimization Of the representation of the data before training the SVM and does not suffer from computationally expensive validation techniques. We assess the performance of our algorithm against the background of current concerns in medical diagnostics, namely the classification of endocardial electrograms and the detection of otoacoustic emissions. Here the performance of SVMs can significantly be improved by our adapted preprocessing step

    Parameter Detection of Thin Films From Their X-Ray Reflectivity by Support Vector Machines

    Full text link
    Reflectivity measurements are used in thin film investigations for determining the desity and the thickness of layered structures and the roughness of external and internal surfaces. From the mathematical point of view the deduction of these parameters from a measured reflectivity curve represents an inverSe ptoblem. At present, curve fitting procedures, based to a large extent on expert knowledge are commonly used in practice. These techniques suffer from a low degree of automation. In this paper we present a new approach to the evaluation of reflectivity measurements using support vector machines. For the estimation of the different thin film parameters we provide sparse approximations of vector-valued functions, where we work in parallel on the same data sets. Our support vector machines were trained by simulated reflectivity curves generated by the optical matrix method. The solution of the corresponding quadratic programming problem makes use of the SVMTorch algorithm. We present numerical investigations to assess the performance of our method using models of practical relevance. It is concluded that the approximation by support vector machines represents a very promising tool in X-ray reflectivity investigations and seems also to be applicable for a much broader range of parameter detection problems in X-ray analysis

    Lagrangian Motion Magnification with Double Sparse Optical Flow Decomposition

    Get PDF
    Motion magnification techniques aim at amplifying and hence revealing subtle motion in videos. There are basically two main approaches to reach this goal, namely via Eulerian or Lagrangian techniques. While the first one magnifies motion implicitly by operating directly on image pixels, the Lagrangian approach uses optical flow techniques to extract and amplify pixel trajectories. Microexpressions are fast and spatially small facial expressions that are difficult to detect. In this paper, we propose a novel approach for local Lagrangian motion magnification of facial micromovements. Our contribution is three-fold: first, we fine-tune the recurrent all-pairs field transforms for optical flows (RAFT) deep learning approach for faces by adding ground truth obtained from the variational dense inverse search (DIS) for optical flow algorithm applied to the CASME II video set of faces. This enables us to produce optical flows of facial videos in an efficient and sufficiently accurate way. Second, since facial micromovements are both local in space and time, we propose to approximate the optical flow field by sparse components both in space and time leading to a double sparse decomposition. Third, we use this decomposition to magnify micro-motions in specific areas of the face, where we introduce a new forward warping strategy using a triangular splitting of the image grid and barycentric interpolation of the RGB vectors at the corners of the transformed triangles. We demonstrate the very good performance of our approach by various examples

    Disparity and optical flow partitioning using extended Potts priors

    Get PDF
    This paper addresses the problems of disparity and optical flow partitioning based on the brightness invariance assumption. We investigate new variational approaches to these problems with Potts priors and possibly box constraints. For the optical flow partitioning, our model includes vector-valued data and an adapted Potts regularizer. Using the notion of asymptotically level stable (als) functions, we prove the existence of global minimizers of our functionals. We propose a modified alternating direction method of multipliers. This iterative algorithm requires the computation of global minimizers of classical univariate Potts problems which can be done efficiently by dynamic programming. We prove that the algorithm converges both for the constrained and unconstrained problems. Numerical examples demonstrate the very good performance of our partitioning method
    • …
    corecore