ترغب بنشر مسار تعليمي؟ اضغط هنا

Detection of Derivative Discontinuities in Observational Data

46   0   0.0 ( 0 )
 نشر من قبل Dimitar Ninevski
 تاريخ النشر 2019
والبحث باللغة English




اسأل ChatGPT حول البحث

This paper presents a new approach to the detection of discontinuities in the n-th derivative of observational data. This is achieved by performing two polynomial approximations at each interstitial point. The polynomials are coupled by constraining their coefficients to ensure continuity of the model up to the (n-1)-th derivative; while yielding an estimate for the discontinuity of the n-th derivative. The coefficients of the polynomials correspond directly to the derivatives of the approximations at the interstitial points through the prudent selection of a common coordinate system. The approximation residual and extrapolation errors are investigated as measures for detecting discontinuity. This is necessary since discrete observations of continuous systems are discontinuous at every point. It is proven, using matrix algebra, that positive extrema in the combined approximation-extrapolation error correspond exactly to extrema in the difference of the Taylor coefficients. This provides a relative measure for the severity of the discontinuity in the observational data. The matrix algebraic derivations are provided for all aspects of the methods presented here; this includes a solution for the covariance propagation through the computation. The performance of the method is verified with a Monte Carlo simulation using synthetic piecewise polynomial data with known discontinuities. It is also demonstrated that the discontinuities are suitable as knots for B-spline modelling of data. For completeness, the results of applying the method to sensor data acquired during the monitoring of heavy machinery are presented.



قيم البحث

اقرأ أيضاً

52 - Wolfgang Erb 2019
We present a flexible framework for uncertainty principles in spectral graph theory. In this framework, general filter functions modeling the spatial and spectral localization of a graph signal can be incorporated. It merges several existing uncertai nty relations on graphs, among others the Landau-Pollak principle describing the joint admissibility region of two projection operators, and uncertainty relations based on spectral and spatial spreads. Using theoretical and computational aspects of the numerical range of matrices, we are able to characterize and illustrate the shapes of the uncertainty curves and to study the space-frequency localization of signals inside the admissibility regions.
The complex-step derivative approximation is a numerical differentiation technique that can achieve analytical accuracy, to machine precision, with a single function evaluation. In this letter, the complex-step derivative approximation is extended to be compatible with elements of matrix Lie groups. As with the standard complex-step derivative, the method is still able to achieve analytical accuracy, up to machine precision, with a single function evaluation. Compared to a central-difference scheme, the proposed complex-step approach is shown to have superior accuracy. The approach is applied to two different pose estimation problems, and is able to recover the same results as an analytical method when available.
The capability to achieve high-precision positioning accuracy has been considered as one of the most critical requirements for vehicle-to-everything (V2X) services in the fifth-generation (5G) cellular networks. The non-line-of-sight (NLOS) connectiv ity, coverage, reliability requirements, the minimum number of available anchors, and bandwidth limitations are among the main challenges to achieve high accuracy in V2X services. This work provides an overview of the potential solutions to provide the new radio (NR) V2X users (UEs) with high positioning accuracy in the future 3GPP releases. In particular, we propose a novel selective positioning solution to dynamically switch between different positioning technologies to improve the overall positioning accuracy in NR V2X services, taking into account the locations of V2X UEs and the accuracy of the collected measurements. Furthermore, we use high-fidelity system-level simulations to evaluate the performance gains of fusing the positioning measurements from different technologies in NR V2X services. Our numerical results show that the proposed hybridized schemes achieve a positioning error $boldsymbol{leq}$ 3 m with $boldsymbol{approx}$ 76% availability compared to $boldsymbol{approx}$ 55% availability when traditional positioning methods are used. The numerical results also reveal a potential gain of $boldsymbol{approx}$ 56% after leveraging the road-side units (RSUs) to improve the tail of the UEs positioning error distribution, i.e., worst-case scenarios, in NR V2X services.
Partition of unity methods (PUMs) on graphs are simple and highly adaptive auxiliary tools for graph signal processing. Based on a greedy-type metric clustering and augmentation scheme, we show how a partition of unity can be generated in an efficien t way on graphs. We investigate how PUMs can be combined with a local graph basis function (GBF) approximation method in order to obtain low-cost global interpolation or classification schemes. From a theoretical point of view, we study necessary prerequisites for the partition of unity such that global error estimates of the PUM follow from corresponding local ones. Finally, properties of the PUM as cost-efficiency and approximation accuracy are investigated numerically.
The significance of the broken ray transform (BRT) is due to its occurrence in a number of modalities spanning optical, x-ray, and nuclear imaging. When data are indexed by the scatter location, the BRT is both linear and shift invariant. Analyzing t he BRT as a linear system provides a new perspective on the inverse problem. In this framework we contrast prior inversion formulas and identify numerical issues. This has practical benefits as well. We clarify the extent of data required for global reconstruction by decomposing the BRT as a linear combination of cone beam transforms. Additionally we leverage the two dimensional Fourier transform to derive new inversion formulas that are computationally efficient for arbitrary scatter angles. Results of numerical simulations are presented.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا