Tensor-based signal processing methods are usually employed when dealing with multidimensional data and/or systems a large parameter space. In this paper, we present family of tensor-based adaptive filtering algorithms, which suitable for high-dimension system identification problems. The basic idea is to exploit decomposition-based approach, such that the global impulse response can be estimat...

Robust compressive sensing(CS) reconstruction has become an attractive research topic in recent years. Robust CS aims to reconstruct the sparse signals under non-Gaussian(i.e. heavy tailed) noises where traditional CS reconstruction algorithms may perform very poorly due to utilizing l2 norm of the residual vector in optimization. Most of existing robust CS reconstruction algorithms are based o...

COVID-19, which originated from Wuhan, rapidly spread throughout the world and became a public health crisis. Recognizing positive cases at earliest stage was crucial in order to restrain of this virus perform medical treatment quickly for patients affected. However, limited supply RT-PCR as diagnosis tool caused greatly delay obtaining examination results suspected patients. Previous research ...

In this brief, a robust and sparse recursive adaptive filtering algorithm, called convex regularized recursive maximum correntropy (CR-RMC), is derived by adding a general convex regularization penalty term to the maximum correntropy criterion (MCC). An approximate expression for automatically selecting the regularization parameter is also introduced. Simulation results show that the CR-RMC can...

We consider a branch-and-bound algorithm for maximum clique problems. We introduce cost based filtering techniques for the so-called candidate set (i.e. a set of nodes that can possibly extend the clique in the current choice point). Additionally, we present a taxonomy of upper bounds for maximum clique. Analytical results show that our cost based filtering is in a sense as tight as most of the...

DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed cluster tree elimination have been proposed. They also suffer from exponential size messages. However, using the strategy of cost function filtering, in practice these algorithms obtain important reductions in maximum m...

distance relays are used to protect ehv and hv transmission lines. over the past decades many algorithms have emerged for digital distance relays. these are based on the calculation of the transmission line impedance from the relaying to fault points. in this paper a novel method for digital distance relaying is proposed. in the method the tracking procedure is implemented. the method uses the ...