Search results for " computing"

Depth Enhancement by Fusion for Passive and Active Sensing

2012

This paper presents a general refinement procedure that enhances any given depth map obtained by passive or active sensing. Given a depth map, either estimated by triangulation methods or directly provided by the sensing system, and its corresponding 2-D image, we correct the depth values by separately treating regions with undesired effects such as empty holes, texture copying or edge blurring due to homogeneous regions, occlusions, and shadowing. In this work, we use recent depth enhancement filters intended for Time-of-Flight cameras, and adapt them to alternative depth sensing modalities, both active using an RGB-D camera and passive using a dense stereo camera. To that end, we propose …

Time course of central and peripheral fatigue differs when maintaining a constant-EMG task vs. a constant-torque task

2005

Fault Detection, Isolation, andTolerant Control of Vehicles using Soft Computing Methods

2014

Fuzzy Set Theory as a Methodological Bridge between Hard Sciences and Humanities

2013

In this paper, we will investigate the possible role of fuzzy set theory (FST), and more generally the ensemble of technologies and theoretical approaches known as soft computing, as a methodological bridge between hard sciences and humanities. We will try, building on previous works, to investigate the “family links” between these disciplines and show how FST may be of help in promoting a connection between the “two cultures”. We will discuss Carnap and his paradox of explication, the dilemma between imagination and rigor according to Bateson, the problem of interdisciplinarity, and the consequences of precision and exactness. C

L'edizione critica digitale. La critica del testo nella storia della tradizione

2019

The traditional output of philological work aiming at the constitutio textus is the print critical edition with apparatus footnotes showing select variant readings. The digital scholarly edition, instead, is not constrained by the space limits of the printed page, so it can encode and visualize synoptically many versions of a text, as found in different textual witnesses. This opportunity has often been exploited by New Philology editions, in which textual versions are juxtaposed without any attempt to reconstruct an "original" text. However, the digital critical edition can constitute a "third way" between constitutio textus and New Philology: the digital editor can provide different versi…

Session details: Geometric computing and reasoning (GCR)

2006

Session details: Geometric computing and reasoning

2007

Parallelized short read assembly of large genomes using de Bruijn graphs

2011

Abstract Background Next-generation sequencing technologies have given rise to the explosive increase in DNA sequencing throughput, and have promoted the recent development of de novo short read assemblers. However, existing assemblers require high execution times and a large amount of compute resources to assemble large genomes from quantities of short reads. Results We present PASHA, a parallelized short read assembler using de Bruijn graphs, which takes advantage of hybrid computing architectures consisting of both shared-memory multi-core CPUs and distributed-memory compute clusters to gain efficiency and scalability. Evaluation using three small-scale real paired-end datasets shows tha…

Hybrid Observer for Indoor Localization with Random Time-of-Arrival Measurments

2018

In this work an indoor position estimation algorithm will be proposed. The position will be measured by means of a sensor network composed by fixed beacons placed on the indoor environment and a mobile beacon mounted on the object to be tracked. The mobile beacon communicates with all the fixed beacons by means of ultra wide-band signals, and the distance between them is computed by means of time of flight techniques. Moreover, inertial measurements will be used when the position measurements are not available. Two main problems will be considered in the proposed architecture: the fact that the beacons work with a lower update rate than the IMU, and that the mobile beacon can comunicate wit…

An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph

2001

International audience; In this article we characterize bipartite graphs whose associated neighborhood hypergraphs have the Helly property. We examine incidence graphs both hypergraphs and linear hypergraphs and we give a polynomial algorithm to recognize if a linear hypergraph has the Helly property.