The theory of compressive sensing (CS) has opened up new opportunities in the field of optical imaging. However, its implementation in this field is often not straight-forward. We list the implementation challenges that might arise in compressive imaging and present some solutions to overcome them.

In this paper, we give a straight forward, highly e cient, scalable implementation of common matrix multiplication operations. The algorithms are much simpler than previously published methods, yield better performance, and require less work space. MPI implementations are given, as are performance results on the Intel Paragon system.

In this paper we show a straight forward extension of the fuzzy Cohen’s-κ to Fleiss’-κ for the determination of classification agreements of fuzzy classifiers. In addition we investigate the influence of different interpretations of fuzzy intersection in terms of t-norms. These considerations are done for exemplary artificial data as well as for classification in image recognition for counting ...

The discrete Fourier transform (DFT) is used for determining the coefficients of a transfer function for n-order singular linear systems, Ex = ∑n i=1 Aix (n−1) + Bu, where E may be singular. The algorithm is straight forward and easily can be implemented. Three step-by-step examples illustrating the application of the algorithm are presented.

In this paper, the hyperbolic tangent function (tanh) method is used in finding soliton solutions of Generalized Fisher Equation (GFE) and Spalding Equation (SE). It is shown that the tanh method provides a straight forward and powerful tool for solving Nonlinear Evolution Equations (NLEEs) in Mathematical Physics.

We present an extension of phrase-based statistical machine translation models that enables the straight-forward integration of additional annotation at the word-level — may it be linguistic markup or automatically generated word classes. In a number of experiments we show that factored translation models lead to better translation performance, both in terms of automatic scores, as well as more...

The two body non-leptonic Λb decays are analyzed in the HQET with factorization approximation and large Nc limit. In this limit, Λb and Λc baryons can be treated as the bound states of chiral soliton and heavy meson, and consequently the Isgur-Wise function comes out in a straight forward manner. The results obtained remain well below their previously predicted upper limit.

We show an iterative reconstruction framework for diffraction ultrasound tomography. The use of broadband illumination allows significantly reduce the number of projections compared to straight ray tomography. The proposed algorithm makes use of fast forward nonuniform Fourier transform (NUFFT) for iterative Fourier inversion. Incorporation of total variation regularization allows reduce noise ...

In this paper we will present an implementation of an RNS-to-Binary Converter based on the mixed radix conversion algorithm by using recently proposed new cell-elements. The proposed architecture can be generated automatically for arbitrary sets of moduli and the method is straight forward. This method is very well suited for standard cell implementations resulting in compact layouts.

This paper focuses on the relation between automatic tag prediction and music similarity. Intuitively music similarity measures based on auto-tags should profit from the improvement of the quality of the underlying audio tag predictors. We present classification experiments that verify this claim. Our results suggest a straight forward way to further improve content-based music similarity measu...