Search results for " algorithm"
showing 10 items of 2538 documents
Chaînage de bases de données anonymisées pour les études épidémiologiques multicentriques nationales et internationales : proposition d'un algorithme…
2009
Background: Compiling individual records coming from different sources is very important for multicenter epidemiological studies; however, European directives and other national legislation concerning nominal data processing must be respected. These legal aspects can be satisfied by implementing mechanisms that allow anonymization of patient data (such as hashing techniques). Moreover, for security reasons, official recommendations suggest using different cryptographic keys in combination with a cryptographic hash function for each study. Unfortunately, this type of anonymization procedure is in contradiction with common requirements in public health and biomedical research because it becom…
Application independent greedy particle tracking method for 3D fluorescence microscopy image series
2012
Single-particle tracking is computationally a challenging problem, and usually solved with local methods. Local methods suffer from defects in the image data or in the detection of particles, such as temporal disappearing of particles. A particle tracking method has to provide a solution also to real disappearing and appearing of particles as a result of merging and splitting. Here, we present an efficient, greedy algorithm as a solution to the particle tracking problem. This improved local method is application independent, as it has high configurability of the function used to solve particle correspondence. To demonstrate the accuracy of the method, we apply it to real microscopy image da…
Low Complexity Image Compression using Pruned 8-point DCT Approximation in Wireless Visual Sensor Networks
2017
International audience; Since the transmission of the uncompressed image in the context of wireless visual sensor networks (WVSNs) consumes less energy than transmitting the compressed image, developing energy-aware compression algorithms are mandatory to extend the camera node's lifetime and thereby the whole network lifetime. The present paper studies a low-complexity image compression algorithm in the context of WVSNs. This algorithm consists of applying a pruning approach on a DCT approximation transform. The scheme is investigated in terms of computation cycles, processing time, energy consumption and image quality. Experimental works are conducted using the Atmel Atmega128 processor o…
Projection-based improvement of 3D reconstructions from motion-impaired dental cone beam CT data.
2019
Purpose Computed tomography (CT) and, in particular, cone beam CT (CBCT) have been increasingly used as a diagnostic tool in recent years. Patient motion during acquisition is common in CBCT due to long scan times. This results in degraded image quality and may potentially increase the number of retakes. Our aim was to develop a marker-free iterative motion correction algorithm that works on the projection images and is suitable for local tomography. Methods We present an iterative motion correction algorithm that allows the patient's motion to be detected and taken into account during reconstruction. The core of our method is a fast GPU-accelerated three-dimensional reconstruction algorith…
"Table 2" of "Measurement of the Cross Section for Electromagnetic Dissociation with Neutron Emission in Pb-Pb Collisions at {\surd}sNN = 2.76 TeV"
2013
Mutual EMD -> at least one neutron is emitted by both Pb nuclei.
"Table 19" of "Measurement of the differential cross-sections of inclusive, prompt and non-prompt J/psi production in proton-proton collisions at sqr…
2013
Unweighted J/psi candidate yields in bins of $J/psi transverse momentum and rapidity. Uncertainties are statistical only.
Evolving Tree Algorithm Modifications
2007
There are many variants of the original self-organizing neural map algorithm proposed by Kohonen. One of the most recent is the Evolving Tree, a tree-shaped self-organizing network which has many interesting characteristics. This network builds a tree structure splitting the input dataset during learning. This paper presents a speed-up modification of the original training algorithm useful when the Evolving Tree network is used with complex data as images or video. After a measurement of the effectiveness an application of the modified algorithm in image segmentation is presented.
ADT implementation and completion by induction from examples
1991
There exists a fast algorithm [2] for inductive synthesis of terminating and ground confluent term rewriting systems from samples. The principles of this algorithm and the methodology of its use for implementation and completion of abstract data types are described.
Inductive synthesis of term rewriting systems
2005
Fast algorithm for inductive synthesis of term rewriting systems is described and proved to be correct. It is implemented and successfully applied for inductive synthesis of different algorithms, including the binary multiplication. The algorithm proposed supports automatic learning process and can be used for designing and implementation of ADT.
A particle swarm approach for tuning washout algorithms in vehicle simulators
2018
Abstract The MCA tuning problem involves finding the most appropriate values for the parameters (or coefficients) of Motion Cueing Algorithms (MCA), also known as washout algorithms. These algorithms are designed to control the movements of the robotic mechanisms, referred to as motion platforms, employed to generate inertial cues in vehicle simulators. This problem can be approached in several different ways. The traditional approach is to perform a manual pilot-in-the-loop subjective tuning, using the opinion of several pilots/drivers to guide the process. A more systematic approach is to use optimization techniques to explore the vast parameter space of the MCA, using objective motion fi…