A method for automatically identifying the order of fringe pattern traces is presented. It uses the simplified Otsu algorithm for obtaining the threshold, the angular scan in the range of 45~ for searching the trace positions, and the zone search technique for identifying different traces. Experimental results show that the proposed method may reliably obtain the order of fringe pattern traces orientating from almost 45° to 90°. 相似文献
Recently, a number of heuristic techniques have been devised in order to overcome some of the limitations of the Blind Source Separation (BSS) algorithms that are rooted in the theory of Independent Component Analysis (ICA). They are usually based on topographic maps and designed to separate mixtures of signals with either sub-Gaussian or super-Gaussian source densities. In the sub-Gaussian case, the coordinates of the winning neurons in the topographic map represent the estimates of the source signal amplitudes. In the super-Gaussian case, one relies on the topographic map's ability to detect the source directions in mixture space which, in turn, correspond to the column vectors of the mixing matrix in the linear case. We will introduce a new topographic map-based heuristic for super-Gaussian BSS. It relies on the tendency of the mixture samples to cluster around the source directions. We will demonstrate its performance on linear and mildly non-linear mixtures of speech signals, including the case where there are less mixtures than sources to be separated (non-square BSS). 相似文献
1 IntroductionWe consider tlie variational inequality problelll, deuoted by VIP(X, F), wliicli is to find avector x* E X such thatF(X*)"(X -- X-) 2 0, VX E X, (1)where F: R" - R" is any vector-valued f11uction and X is a uonelllpty subset of R'.This problem has important applicatiolls. in equilibriun1 modeIs arising in fields such asecououtics, transportatioll scieuce alld operations research. See [1]. There exist mauy lllethodsfor solviug tlie variational li1equality problem VIP(X. … 相似文献
We study online bounded space bin packing in the resource augmentation model of competitive analysis. In this model, the online bounded space packing algorithm has to pack a list L of items in (0,1] into a small number of bins of size b1. Its performance is measured by comparing the produced packing against the optimal offline packing of the list L into bins of size 1.We present a complete solution to this problem: For every bin size b1, we design online bounded space bin packing algorithms whose worst case ratio in this model comes arbitrarily close to a certain bound ρ(b). Moreover, we prove that no online bounded space algorithm can perform better than ρ(b) in the worst case. 相似文献
The multiple knapsack problem denoted by MKP (B,S,rn,n) can be defined as follows. A set B of n items and a set S of rn knapsacks are given such that each item j has a profit pi and weight wj,and each knapsack i has a capacity Ci. The goal is to find a subset of items of maximum profit such that they have a feasible packing in the knapsacks. MKP (B,S,m,n) is strongly NP-Complete and no polynomial time approximation algorithm can have an approximation ratio better than 0.5. In the last ten years,semi-definite programming has been empolyed to solve some combinatorial problems successfully. This paper firstly presents a semi-definite relaxation algorithm (MKPS) for MKP (B,S,rn,n). It is proved that MKPS have a approximation ratio better than 0. 5 for a subclass of MKP (B,S,m,n) with n≤100, m≤5 and max^nj=1{wj}/min^mi=1={Ci}≤2/3. 相似文献
The state-of-the-art, large-scale numerical simulations of the scattering problem for the Helmholtz equation in two dimensions rely on iterative solvers for the Lippmann–Schwinger integral equation, with an optimal CPU time O(m3 log(m)) for an m-by-m wavelength problem. We present a method to solve the same problem directly, as opposed to iteratively, with the obvious advantage in efficiency for multiple right-hand sides corresponding to distinct incident waves. Analytically, this direct method is a hierarchical, recursive scheme consisting of the so-called splitting and merging processes. Algebraically, it amounts to a recursive matrix decomposition, for a cost of O(m3), of the discretized Lippmann–Schwinger operator. With this matrix decomposition, each back substitution requires only O(m2 log(m)); therefore, a scattering problem with m incident waves can be solved, altogether, in O(m3 log(m)) flops. 相似文献
We analyze the approximation and smoothness properties of quincunx fundamental refinable functions. In particular, we provide a general way for the construction of quincunx interpolatory refinement masks associated with the quincunx lattice in . Their corresponding quincunx fundamental refinable functions attain the optimal approximation order and smoothness order. In addition, these examples are minimally supported with symmetry. For two special families of such quincunx interpolatory masks, we prove that their symbols are nonnegative. Finally, a general way of constructing quincunx biorthogonal wavelets is presented. Several examples of quincunx interpolatory masks and quincunx biorthogonal wavelets are explicitly computed.
This paper shows that for unitary Hessenberg matrices the algorithm, with (an exceptional initial-value modification of) the Wilkinson shift, gives global convergence; moreover, the asymptotic rate of convergence is at least cubic, higher than that which can be shown to be quadratic only for Hermitian tridiagonal matrices, under no further assumption. A general mixed shift strategy with global convergence and cubic rates is also presented.
In this paper we present an algorithm for recursively generating orthogonal bivariate polynomials on a discrete set S2. For this purpose we employ commuting pairs of real symmetric matrices H, Kn×n to obtain, in a certain sense, a two dimensional Hermitian Lanczos method. The resulting algorithm relies on a recurrence having a slowly growing length. Practical implementation issues an applications are considered. The method can be generalized to compute orthogonal polynomials depending on an arbitrary number of variables. 相似文献
We study the perturbation theory for the eigenvalue problem of a formal matrix product A1s1 ··· Apsp, where all Ak are square and sk {–1, 1}. We generalize the classical perturbation results for matrices and matrix pencils to perturbation results for generalized deflating subspaces and eigenvalues of such formal matrix products. As an application we then extend the structured perturbation theory for the eigenvalue problem of Hamiltonian matrices to Hamiltonian/skew-Hamiltonian pencils. 相似文献