This paper describes a new algorithm for learning decision lists that operates by prepending successive rules to the front of the list under construction. By contrast, the classic algorithm operates by appending successive rules to the end of the decision list under construction. The new algorithm is demonstrated in the majority of cases to produce smaller classifiers that provide improved pred...

This paper investigated the feasibility of Fourier transform infrared transmission (FT-IR) spectroscopy to detect talcum powder illegally added in tea based on chemometric methods. Firstly, 210 samples of tea powder with 13 dose levels of talcum powder were prepared for FT-IR spectra acquirement. In order to highlight the slight variations in FT-IR spectra, smoothing, normalize and standard nor...

A well-known computational bottleneck in various first order methods like mirror descent is that of computing a certain Bregman projection. We give a novel algorithm, INC-FIX, for computing these projections under separable mirror maps and more generally for minimizing separable convex functions over submodular base polytopes. For minimizing divergences onto cardinality-based submodular base po...

H nuclear magnetic resonance (NMR) spectroscopy was utilized to distinguish the brands of rapeseed oils. As there are more than four hundreds of NMR variables which can cause the discrimination model redundancy, it is necessary to do effective variable selection. Successive projections algorithm (SPA) executed on the full spectrum only improved a few correct answer rate (CAR) and Cohen’s kappa ...

Introduction: The main goal of SPECT imaging is to determine activity distribution inside the organs of the body. However, due to photon attenuation, it is almost impossible to do a quantitative study. In this paper, we suggest a mathematical relationship between activity distribution and its corresponding projections using a transfer matrix. Monte Carlo simulation was used to find a precise tr...

The algorithm of Feldkamp, Davis, and Kress [J. Opt. Soc. Am. A 1, 612-619 (1984)] is a widely used filtered-backprojection algorithm for three-dimensional image reconstruction from cone-beam (CB) projections measured with a circular orbit of the x-ray source. A well-known property of this approximate algorithm is that the integral of the reconstructed image along any axial line orthogonal to t...

Considering a large-scale energy-harvesting wireless sensor network (EH-WSN) measuring compressible data, sparse random projections are feasible for data well-approximation, and the sparsity of random projections impacts the mean square error (MSE) as well as the system delay. In this paper, we propose an adaptive algorithm for sparse random projections in order to achieve a better tradeoff bet...

The reconstruction of 8-connected but not 4-connectedhv-convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of O(mnmin{m, n}) to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity ...

The H.264/AVC coding standard allows more than one decoded frame reference frames to make full use of reducing temporal redundancy in a video sequence. However, motion estimation in multiple frames introduces tremendous computational complexity. This paper presents a fast full search motion estimation algorithm for multiple reference frame motion estimation. The proposed method can be applied t...