An improvement in the algorithm for assigning vertex(es) as graph center(s) is achieved on the basis of the distances between vertexes and between edges, as well as proceeding from the vertex-edge incidence. The iterative vertex and edge centricities (IVEC) algorithm produces assignments that are in better agreement with the intuitive notion of graph center than those produced by the previous p...

This article presents a method to improve camera calibration by separating determination of the nonlinear calibration parameters from that of the linear ones. We measure correspondences between the distorted image on a camera target and a flexible undistorted calibration pattern displayed on a TFT monitor. Using these correspondences the image of the camera may be projected onto the plane of th...

Iterative proportional fitting (IPF) on junction trees is an important tool for learning in graphical models. We identify the propagation and IPF updates on the junction tree as fixed point equations of a single constrained entropy maximization problem. This allows a more efficient message updating protocol than the well known effective IPF of Jiroušek and Přeučil (1995). When the junction tree...

New decoding algorithms for binary linear codes based on the concave-convex procedure are presented. Numerical experiments show that the proposed decoding algorithms surpass Belief Propagation (BP) decoding in error performance. Average computational complexity of one of the proposed decoding algorithms is only a few times greater than that of the BP decoding. key words: concave-convex procedur...

An iterative procedure is discussed to estimate poles and zeros of a rational transfer function from speech signals, which takes advantage of the individual solutions of AR and MA processes. Besides speech, analyses of test signals are also carried out, which lead to optimal results. In contrast to Prony’s and related methods, the algorithm don’t presuppose a pair of an input and output signal....

In many situations, a signal consisting of a single tone corrupted by additive white noise is available, and the frequency of the tone must be estimated. This problem has applications in communications, radar, sonar, measurements, adaptive control, speech processing etc [1], and it belongs to the wider class of spectrum estimation problems [2]. Both complex and real signals have been considered...

In this paper, we propose and validate a computationally efficient non-iterative domain decomposition procedure for calculating bivariate cubic L1 smoothing splines. This domain decomposition procedure involves calculating local L1 smoothing splines individually on overlapping “extended subdomains” that cover the global domain and then creating the global L1 smoothing spline by patching togethe...

The aim of this paper is to prove weak and strong convergence as well as weak stability results of CR-iterative procedures using contractive-like operators. The results obtained generalize several existing results. An example is also given, using computer programming in C++, to show that CR-iterative procedure converges faster than SP and Noor iterative procedures.

The scaling of the exact solution a hyperbolic balance law generates family scaled problems in which source term does not depend on current solution. These are used to construct sequence solutions whose limiting function solves original problem. Thus this gives rise an iterative procedure. Its convergence is demonstrated both theoretically and analytically. analytical demonstration terms local ...