INTRODUCTION Adaptive sampling of k-space allows images in dynamic contrast-enhanced (DCE)-MRI to be reconstructed at various spatial and temporal resolutions from the same dataset. Golden-angle radial kspace sampling achieves this flexibility in-plane with samples incremented by the golden angle, φ = (√5 1)/2 * 180° [1,2]. These projections fill 2D k-space with projections that have a relative...

An effective compression artifacts removal algorithm is proposed based on thin-plate spline interpolation and the theory of projections onto convex sets (POCS). The thin-plate spline model is used to model the luminance in the flat regions of the image. Adaptive projections are used to suppress the compression artifacts in the spatially active image regions. The algorithm includes block mapping...

We present an approach to invariant matching. In this approach, an object or a pattern is invariantly represented by an object-centered description called an attributed relational structure (ARS) embedding invariant properties and relations between the primitives of the pattern such as line segments and points. Noise eeect is taken into account such that a scene can consist of noisy sub-parts o...

Knowledge-based classification and regression methods are especially powerful forms of learning. They allow a system to take advantage of prior domain knowledge supplied either by a human user or another algorithm, combining that knowledge with data to produce accurate models. A limitation of the use of prior knowledge occurs when the provided knowledge is incorrect. Such knowledge likely still...

A Poisson-type equation arising in a commonly used numerical weather forecasting model is solved using an alternating direction implicit (ADI) method with Wachpress optimum parameters on a trapezoidal domain which coincides with the operational forecast domain. Various optimum parameter sequences were obtained for the corresponding squares which enclose the region under consideration, computati...

The use of multiple antenna systems provides a great performance advantage in Rayleigh fading environments. To exploit this advantage several schemes like the layered spacetime architecture have been proposed, but mostly restricted to narrowband transmission. Recently, a generalization of the well known V-BLAST detection algorithm for frequency-selective fading channels has been presented by Lo...

In this paper, we propose a new fast and robust recursive algorithm for near-separable nonnegative matrix factorization, a particular nonnegative blind source separation problem. This algorithm, which we refer to as the successive nonnegative projection algorithm (SNPA), is closely related to the popular successive projection algorithm (SPA), but takes advantage of the nonnegativity constraint ...

It is well-known that the multiple knapsack problem is NP-hard, and does not admit an FPTAS even for the case of two identical knapsacks. Whereas the 0-1 knapsack problem with only one knapsack has been intensively studied, and some effective exact or approximation algorithms exist. A natural approach for the multiple knapsack problem is to pack the knapsacks successively by using an effective ...

In this paper we derive a successive matrix squaring (SMS) algorithm to approximate an outer generalized inverse with prescribed range and null space of a given matrix A ∈ Cm×n r . We generalize the results from the papers [3], [16], [18], and obtain an algorithm for computing various classes of outer generalized inverses of A. Instead of particular matrices used in these articles, we use an ap...