Search results for "algorithm"
showing 10 items of 4887 documents
The Vector QD Algorithm for Smooth Functions (f, f′)
1996
AbstractWe deal with the functionz↦(f(z), f′(z)) wheref(z)=∑i⩾0aizi, (ai∈C) with limi→∞ai+1×ai−1/(ai)2=q. We investigate the convergence of the vector QD algorithm. We give the asymptotic behaviour of the generalized Hankel determinants. A convergence result on the vector orthogonal polynomials is proved.
Infrared-finite algorithms in QED II. The expansion of the groundstate of an atom interacting with the quantized radiation field
2009
Abstract In this paper, we present an explicit and constructive algorithm enabling us to calculate the groundstate and the groundstate energy of a non-relativistic atom minimally coupled to the quantized radiation field up to an error of arbitrary finite order in the fine structure constant. Because of infrared divergences, which invalidate a straightforward Taylor expansion, an iterative construction is employed to remove the infrared cut-off in photon momentum space and to produce a convergent algorithm.
Combinatorial Gray codes for classes of pattern avoiding permutations
2007
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, Schr\"oder, Pell, even index Fibonacci numbers and the central binomial coefficients. Consequently, this provides Gray codes for $\s_n(\tau)$ for all $\tau\in \s_3$ and the obtained Gray codes have distances 4 and 5.
The Reconstruction of Polyominoes from Approximately Orthogonal Projections
2001
The reconstruction of discrete two-dimensional pictures from their projection is one of the central problems in the areas of medical diagnostics, computer-aided tomography, pattern recognition, image processing, and data compression. In this note, we determine the computational complexity of the problem of reconstruction of polyominoes from their approximately orthogonal projections. We will prove that it is NP-complete if we reconstruct polyominoes, horizontal convex polyominoes and vertical convex polyominoes. Moreover we will give the polynomial algorithm for the reconstruction of hv-convex polyominoes that has time complexity O(m3n3).
A fully adaptive multiresolution scheme for image processing
2007
A nonlinear multiresolution scheme within Harten's framework [A. Harten, Discrete multiresolution analysis and generalized wavelets, J. Appl. Numer. Math. 12 (1993) 153-192; A. Harten, Multiresolution representation of data II, SIAM J. Numer. Anal. 33 (3) (1996) 1205-1256] is presented. It is based on a centered piecewise polynomial interpolation fully adapted to discontinuities. Compression properties of the multiresolution scheme are studied on various numerical experiments on images.
Mappings of finite distortion: The sharp modulus of continuity
2003
We establish an essentially sharp modulus of continuity for mappings of subexponentially integrable distortion.
Matrix Shuffle- Exchange Networks for Hard 2D Tasks
2021
Convolutional neural networks have become the main tools for processing two-dimensional data. They work well for images, yet convolutions have a limited receptive field that prevents its applications to more complex 2D tasks. We propose a new neural model, called Matrix Shuffle-Exchange network, that can efficiently exploit long-range dependencies in 2D data and has comparable speed to a convolutional neural network. It is derived from Neural Shuffle-Exchange network and has O(log N) layers and O(N ^ 2 log N) total time and O(N^2) space complexity for processing a NxN data matrix. We show that the Matrix Shuffle-Exchange network is well-suited for algorithmic and logical reasoning tasks on …
High resolution in currents reconstruction applying the extrapolation matrix and spectrum replies
2007
A faster method for the reconstruction of currents has been proposed. For this a new algorithm has been used which extrapolates a 2D signal in less time than the iterative method of Papoulis. Results exposed in this paper show the likeness of the reconstructed currents with the new algorithm with those of the iterative method and the improvement that might be obtained in these new currents with regard to the iterative one. Furthermore, results show the higher speed of the new matrix method.
A Linear Cost Algorithm to Compute the Discrete Gabor Transform
2010
In this paper, we propose an alternative efficient method to calculate the Gabor coefficients of a signal given a synthesis window with a support of size much lesser than the length of the signal. The algorithm uses the canonical dual of the window (which does not need to be calculated beforehand) and achieves a computational cost that is linear with the signal length in both analysis and synthesis. This is done by exploiting the block structure of the matrices and using an ad hoc Cholesky decomposition of the Gabor frame matrix.
A Parallel Approach for Statistical Texture Parameter Calculation
2014
This chapter focusses on the development of a new image processing technique for the processing of large and complex images, especially SAR images. We propose here a new and effective approach that outperforms the existing methods for the calculation of high order textural parameters. With a single processor, this approach is about \(256^{n-1}\) times faster than the co-occurrence matrix approach considered as classical, where \(n\) is the order of the textural parameter for a 256-gray scales image. In a parallel environment made of N processor, this performance can almost be multiply by the factor N. Our approach is based on a new modeling of textural parameters of a generic order \(n>1\) …