Recently there has been a growing interest and progress in using total least squares (TLS) methods for solving blind deconvolution problems arising in image restoration. Here, the true image is to be estimated using only partial information about the blurring operator, or point spread function (PSF), which is subject to error and noise. In this paper, we present a new iterative, regularized, an...

This paper introduces a novel constraint adaptive filtering algorithm based on a relative logarithmic cost function which is termed as Constrained Least Mean Logarithmic Square (CLMLS). The proposed CLMLS algorithm elegantly adjusts the cost function based on the amount of error thereby achieves better performance compared to the conventional Constrained LMS (CLMS) algorithm. With no assumption...

An efficient method for reanalysis of a damaged structures is presented. Perturbation analysis for the equality constrained least squares problem is adapted to handle structural reanalysis, and related theoretical and numerical results are presented.

After publication of our work [1], we noticed that equations (41) and (42) (in Appendix 1) were incorrect. This does not affect resulting equations. The correct equations are below:

In this work we apply Dykstra’s alternating projection algorithm for minimizing ‖AX − B‖ where ‖ · ‖ is the Frobenius norm and A ∈ Rm×n, B ∈ Rm×n and X ∈ Rn×n are doubly symmetric positive definite matrices with entries within prescribed intervals. We first solve the constrained least-squares matrix problem by using the special structure properties of doubly symmetric matrices, and then use the...

A13 STRACT This paper presents a new adaptive objective function based on the regularized iterative block reduction technique for low-bit rate transform coded images. Also, a better initial estimate for the regularization approach is presented. Two types of prior knowledge are used: the first type bounds the maximum tolerable error (roughness), and the second type restricts the high-frequency c...

The adaptation of Volterra lters by one particular method, the method of least mean squares (LMS), while easily implemented, is complicated by the fact that upper bounds for the values of step sizes employed by a parallel update LMS scheme are diicult to obtain. In this paper, we propose a modiication of the Volterra lter in which the lter weights of a given order are optimized independently of...

Multicast routing consists of concurrently sending the same information from a source to subset all possible destinations in computer network thus becomes an important technology communication. To solve problem, current approach for efficiently supporting multicast session establishing tree that covers and terminal nodes. This problem can be reduced minimal Steiner (MST) which aims look set nod...