A filtered backprojection reconstruction algorithm was developed for cardiac single photon emission computed tomography with cone-beam geometry. The algorithm reconstructs cone-beam projections collected from ;short scan' acquisitions of a detector traversing a noncircular planar orbit. Since the algorithm does not correct for photon attenuation, it is designed to reconstruct data collected ove...

Biomass pellets are required as a source of energy because their abundant and high energy. The rapid measurement is used to control the biomass quality during production process. objective this work was use near infrared (NIR) hyperspectral images for predicting properties, i.e., fuel ratio (FR), volatile matter (VM), fixed carbon (FC), ash content (A), commercial pellets. Models were developed...

In this paper, we propose an extended successive elimination algorithm (SEA) for fast optimal block matching motion estimation (ME). By reinterpreting the typical sum of absolute differences measure, we can obtain additional decision criteria whether to discard the impossible candidate motion vectors. Experimental results show that the proposed algorithm reduces the computational complexity up ...

This paper looks at the SSOR algorithm and shows that, under certain conditions, we can generate an approximation to the SSOR preconditioner using only one triangular solve. We show that this approximation can result in slightly increased iterations to convergence, but increased solution eeciency when used as a preconditioner for non-symmetric, indeenite systems of equations. The paper analyzes...

In order to increase antenna placement options on crowded platforms, three methods for synthesizing conformal phased array excitations on curved surfaces were computer programmed and compared: the Alternating Projections method (AP), the Successive Projections method (SP), and the Genetic Algorithm method (GA). The comparison was based on how closely the synthesized patterns conformed to the de...

We present an SOR-type algorithm and a Jacobi-type algorithm that can effectively be applied to the `1-`2 problem by exploiting its special structure. The algorithms are globally convergent and can be implemented in a particularly simple manner. Relations with coordinate minimization methods are discussed.