Search results for "algorithm"
showing 10 items of 4887 documents
Entropy-Based Detection of Complexity and Nonlinearity in Short-Term Heart Period Variability under different Physiopathological States
2020
We compare different estimators of a popular en-tropy-based nonlinear dynamic measure, i.e. the conditional entropy (CE), as regards their ability to assess the complexity and nonlinearity of short-term heart rate variability (HRV). The CE is computed using binning, kernel and nearest neighbor entropy estimators in HRV time series measured from young, old and post-myocardial infarction patients studied at rest and during orthostatic stress. We find that the three estimators yield similar patterns of CE, but different patterns of nonlinear dynamics, across groups and conditions. These results suggest that the strategy for CE estimation is not crucial for the quantification of complexity, but…
Gesture Modeling by Hanklet-Based Hidden Markov Model
2015
In this paper we propose a novel approach for gesture modeling. We aim at decomposing a gesture into sub-trajectories that are the output of a sequence of atomic linear time invariant (LTI) systems, and we use a Hidden Markov Model to model the transitions from the LTI system to another. For this purpose, we represent the human body motion in a temporal window as a set of body joint trajectories that we assume are the output of an LTI system. We describe the set of trajectories in a temporal window by the corresponding Hankel matrix (Hanklet), which embeds the observability matrix of the LTI system that produced it. We train a set of HMMs (one for each gesture class) with a discriminative a…
On general conditional prevision assessments
2009
In this paper we consider general conditional random quantities of the kind $X|Y$, where $X$ and $Y$ are finite discrete random quantities. Then, we introduce the notion of coherence for conditional prevision assessments on finite families of general conditional random quantities. Moreover, we give a compound prevision theorem and we examine the relation between the previsions of $X|Y$ and $Y|X$. Then, we give some results on random gains and, by a suitable alternative theorem, we obtain a characterization of coherence. We also propose an algorithm for the checking of coherence. Finally, we briefly examine the case of imprecise conditional prevision assessments by introducing the notions of…
The SISCone jet algorithm optimised for low particle multiplicities
2011
The SISCone jet algorithm is a seedless infrared-safe cone jet algorithm. There exists an implementation which is highly optimised for a large number of final state particles. However, in fixed-order perturbative calculations with a small number of final state particles, it turns out that the computer time needed for the jet clustering of this implementation is comparable to the computer time of the matrix elements. This article reports on an implementation of the SISCone algorithm optimised for low particle multiplicities.
Automated detection of patient movement during a CBCT scan based on the projection data.
2015
Objectives To develop an automated procedure to detect patient motion on the projection images acquired during a cone beam computed tomography (CBCT) scan and to evaluate the method's feasibility on small real-world CBCT images in relation to visual assessment. Methods Based on optical flow theory, software was developed using the sequence of the projection images of a CBCT machine for automated detection of patient motion. Averaged acceleration vectors were used as measurement data and compared with visual assessment of the projection images displayed as video. Seventy-nine CBCT data sets (small field-of-view: 40 mm) from our patient database were selected in a sequential fashion and evalu…
Auto calibration of a cone-beam-CT
2012
Purpose: This paper introduces a novel autocalibration method for cone-beam-CTs (CBCT) or flat-panel CTs, assuming a perfect rotation. The method is based on ellipse-fitting. Autocalibration refers to accurate recovery of the geometric alignment of a CBCT device from projection images alone, without any manual measurements. Methods: The authors use test objects containing small arbitrarily positioned radio-opaque markers. No information regarding the relative positions of the markers is used. In practice, the authors use three to eight metal ball bearings (diameter of 1 mm), e.g., positioned roughly in a vertical line such that their projection image curves on the detector preferably form l…
A PARALLEL ALGORITHM FOR ANALYZING CONNECTED COMPONENTS IN BINARY IMAGES
1992
In this paper, a parallel algorithm for analyzing connected components in binary images is described. It is based on the extension of the Cylindrical Algebraic Decomposition (CAD) to a two-dimensional (2D) discrete space. This extension allows us to find the number of connected components, to determine their connectivity degree, and to solve the visibility problem. The parallel implementation of the algorithm is outlined and its time/space complexity is given.
Two-view “cylindrical decomposition” of binary images
2001
This paper describes the discrete cylindrical algebraic decomposition (DCAD) construction along two orthogonal views of binary images. The combination of two information is used to avoid ambiguities for image recognition purposes. This algorithm associates an object connectivity graph to each connected component, allowing a complete description of the structuring information. Moreover, an easy and compact representation of the scene is achieved by using strings in a five letter alphabet. Examples on complex digital images are also provided. © 2001 Elsevier Science Inc.
Stationary states in quantum walk search
2016
When classically searching a database, having additional correct answers makes the search easier. For a discrete-time quantum walk searching a graph for a marked vertex, however, additional marked vertices can make the search harder by causing the system to approximately begin in a stationary state, so the system fails to evolve. In this paper, we completely characterize the stationary states, or 1-eigenvectors, of the quantum walk search operator for general graphs and configurations of marked vertices by decomposing their amplitudes into uniform and flip states. This infinitely expands the number of known stationary states and gives an optimization procedure to find the stationary state c…
Optimization of flat area coverage under connectivity constraint in wireless sensor networks
2022
A wireless sensor network consists of a set of small autonomous units that interact via a network built by their communication modules. They observe their environment, capture information, then manage this information according to their computing and/or storage capacity. To effectively accomplish their task(s), they need to cover as much of the area of interest as possible. It is therefore essential to quantify the quality of their coverage. In this thesis, we therefore seek to best cover an area of interest, with a precise number of sensors. While taking into account the possible overlaps between sensors, we first deploy in a zone of regular dimensions and evaluate the exact coverage using…