Two new algorithms for resolution of two-way data
β Scribed by Jing Xu; Zhong Guo; Yi-Zeng Liang; Ruqin Yu
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 652 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0886-9383
No coin nor oath required. For personal study only.
β¦ Synopsis
Two new algorithms for resolution of two-way data are developed in this paper. instead of using principal component analysis as most resolution methods do, the present methods are based only on the simple operations of basic linear algebra. Comparisons with iterative target transformation factor analysis and other methods show the efficiency of the proposed algorithms.
π SIMILAR VOLUMES
Understanding the demixing effect on the dispersion of particles by largescale turbulence is very important in practical applications. Using pseudospectral and Lagrangian approaches, we have simulated a three-dimensional particle-laden mixing layer under one-way coupling effect. However, the compute
Orthogonal moments have been successfully used in the ΓΏeld of pattern recognition and image analysis. However, the direct computation of orthogonal moments is very expensive. In this paper, we present two new algorithms for fast computing the two-dimensional (2D) Legendre moments. The ΓΏrst algorithm
This paper describes some parallel processing algorithms for the analysis of twodimensional electrophoresis images. One of the largest processor arrays in the world. CLIP4, at University College London, was used in the research. The paper concentrates on algorithms using CLIP4 for querying the data