A Vector Fitting Approach for the Automated Estimation of Lumped Boundary Conditions of 1D Circulation Models.

PURPOSE: The choice of appropriate boundary conditions is a crucial step in the development of cardiovascular models for blood flow simulations. The three-element Windkessel model is usually employed as a lumped boundary condition, providing a reduced order representation of the peripheral circulation. However, the systematic estimation of the Windkessel parameters remains an open problem. Moreover, the Windkessel model is not always adequate to model blood flow dynamics, which often require more elaborate boundary conditions. In this study, we propose a method for the estimation of the parameters of high order boundary conditions, including the Windkessel model, from pressure and flow rate waveforms at the truncation point. Moreover, we investigate the effect of adopting higher order boundary conditions, corresponding to equivalent circuits with more than one storage element, on the accuracy of the model. METHOD: The proposed technique is based on Time-Domain Vector Fitting, a modeling algorithm that, given samples of the input and output of a system, such as pressure and flow waveforms, can derive a differential equation approximating their relation. RESULTS: The capabilities of the proposed method are tested on a 1D circulation model consisting of the 55 largest human systemic arteries, to demonstrate its accuracy and its usefulness to estimate boundary conditions with order higher than the traditional Windkessel models. The proposed method is compared to other common estimation techniques, and its robustness in parameter estimation is verified in presence of noisy data and of physiological changes of aortic flow rate induced by mental stress. CONCLUSION: Results suggest that the proposed method is able to accurately estimate boundary conditions of arbitrary order. Higher order boundary conditions can improve the accuracy of cardiovascular simulations, and Time-Domain Vector Fitting can automatically estimate them.

Multiclass Sparse Centroids With Application to Fast Time Series Classification.

In this article, we propose an efficient multiclass classification scheme based on sparse centroids classifiers. The proposed strategy exhibits linear complexity with respect to both the number of classes and the cardinality of the feature space. The classifier we introduce is based on binary space partitioning, performed by a decision tree where the assignation law at each node is defined via a sparse centroid classifier. We apply the presented strategy to the time series classification problem, showing by experimental evidence that it achieves performance comparable to that of state-of-the-art methods, but with a significantly lower classification time. The proposed technique can be an effective option in resource-constrained environments where the classification time and the computational cost are critical or, in scenarios, where real-time classification is necessary.