Search results for "Algorithm"
showing 10 items of 4887 documents
Shift- and scale-invariant recognition of contour objects with logarithmic radial harmonic filters.
2008
The phase-only logarithmic radial harmonic (LRH) filter has been shown to be suitable for scale-invariant block object recognition. However, an important set of objects is the collection of contour functions that results from a digital edge extraction of the original block objects. These contour functions have a constant width that is independent of the scale of the original object. Therefore, since the energy of the contour objects decreases more slowly with the scale factor than does the energy of the block objects, the phase-only LRH filter has difficulties in the recognition tasks when these contour objects are used. We propose a modified LRH filter that permits the realization of a shi…
Digital signal processing for relaxation data conversion
2005
Abstract The origins, philosophy and basic practical aspects are considered for an approach of digital data transformations for broadband dielectric relaxation spectroscopy and other relaxation experiments carrying out direct and inverse integral transforms with kernels depending on the ratio or product of arguments. The approach is based on the concept that the mentioned data transformations represent a filtering problem on a logarithmic scale allowing one to implement the transforms by digital functional filters with the logarithmic sampling. As an example, digital Kramers–Kronig transformers are considered.
Guide to Practical Work with the Monte Carlo Method
2002
The guide is structured such that we proceed from the “easy” simulation methods and algorithms to the more sophisticated. For each method the algorithms are presented by the technique of stepwise refinement. We first present the idea and the basic outline. From then on we proceed by breaking up the larger logical and algorithmic structures into smaller ones, until we have reached the level of single basic statements. Sometimes we may elect not to go to such a depth and the reader is asked to fill in the gaps.
Algorithmic Solution of Arithmetic Problems and Operands-Answer Associations in Long-Term Memory
2001
Many developmental models of arithmetic problem solving assume that any algorithmic solution of a given problem results in an association of the two operands and the answer in memory (Logan & Klapp, 1991; Siegler, 1996). In this experiment, adults had to perform either an operation or a comparison on the same pairs of two-digit numbers and then a recognition task. It is shown that unlike comparisons, the algorithmic solution of operations impairs the recognition of operands in adults. Thus, the postulate of a necessary and automatic storage of operands-answer associations in memory when young children solve additions by algorithmic strategies needs to be qualified.
XLCS: A New Bit-Parallel Longest Common Subsequence Algorithm on Xeon Phi Clusters
2019
Finding the longest common subsequence (LCS) of two strings is a classical problem in bioinformatics. A basic approach to solve this problem is based on dynamic programming. As the biological sequence databases are growing continuously, bit-parallel sequence comparison algorithms are becoming increasingly important. In this paper, we present XLCS, a new parallel implementation to accelerate the LCS algorithm on Xeon Phi clusters by performing bit-wise operations. We have designed an asynchronous IO framework to improve the data transfer efficiency. To make full use of the computing resources of Xeon Phi clusters, we use three levels of parallelism: node-level, thread-level and vector-level.…
Generalized SCODEF Deformations on Subdivision Surfaces
2006
This paper proposes to define a generalized SCODEF deformation method on a subdivision surface. It combines an “easy-to-use” free-form deformation with a Loop subdivision algorithm. The deformation method processes only on vertices of an object and permits the satisfaction of geometrical constraints given by the user. The method controls the resulting shape, defining the range (i.e. the impact) of the deformation on an object before applying it. The deformation takes into account the Loop properties to follow the subdivision scheme, allowing the user to fix some constraints at the subdivision-level he works on and to render the final object at the level he wants to. We also propose an adapt…
Experimental Comparison of Efficiency Enhancement Algorithms for Three-Phase Induction Motors
2019
This paper presents an experimental comparison of two efficiency improvement algorithms for three-phase induction motors by adopting Loss Model Algorithms (LMAs). The efficiency enhancement is evaluated starting from several simulations for different conditions of load and speed and, then, validated by comparing the experimental results obtained by applying the two control strategies and the traditional Field Oriented Control (FOC). Significant results in terms of efficiency enhancement are presented and discussed.
Lossless and near-lossless image compression based on multiresolution analysis
2013
There are applications in data compression, where quality control is of utmost importance. Certain features in the decoded signal must be exactly, or very accurately recovered, yet one would like to be as economical as possible with respect to storage and speed of computation. In this paper, we present a multi-scale data-compression algorithm within Harten's interpolatory framework for multiresolution that gives a specific estimate of the precise error between the original and the decoded signal, when measured in the L"~ and in the L"p (p=1,2) discrete norms. The proposed algorithm does not rely on a tensor-product strategy to compress two-dimensional signals, and it provides a priori bound…
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
2006
Data Compression is one of the most challenging arenas both for algorithm design and engineering. This is particularly true for Burrows and Wheeler Compression a technique that is important in itself and for the design of compressed indexes. There has been considerable debate on how to design and engineer compression algorithms based on the BWT paradigm. In particular, Move-to-Front Encoding is generally believed to be an "inefficient " part of the Burrows-Wheeler compression process. However, only recently two theoretically superior alternatives to Move-to-Front have been proposed, namely Compression Boosting and Wavelet Trees. The main contribution of this paper is to provide the first ex…
Statistical Modeling of Huffman Tables Coding
2005
An innovative algorithm for automatic generation of Huffman coding tables for semantic classes of digital images is presented. Collecting statistics over a large dataset of corresponding images, we generated Huffman tables for three images classes: landscape, portrait and document. Comparisons between the new tables and the JPEG standard coding tables, using also different quality settings, have shown the effectiveness of the proposed strategy in terms of final bit size (e.g. compression ratio).