A Surface Reconstruction Method Using Global Graph Cut Optimization

Surface reconstruction from multiple calibrated images has been mainly approached using local methods, either as a continuous optimization problem driven by level sets, or by discrete volumetric methods such as space carving. We propose a direct surface reconstruction approach which starts from a continuous geometric functional that is minimized up to a discretization by a global graph-cut algorithm operating on a 3D embedded graph. The method is related to the stereo disparity computation based on graph-cut formulation, but fundamentally different in two aspects. First, existing stereo disparity methods are only interested in obtaining layers of constant disparity, while we focus on high resolution surface geometry. Second, most of the existing graph-cut algorithms only reach approximate solutions, while we guarantee a global minimum. The whole procedure is consistently incorporated into a voxel representation that handles both occlusions and discontinuities. We demonstrate our algorithm on real sequences, yielding remarkably detailed surface geometry up to 1/10th of a pixel. Author has worked on this project during his Ph. D. at ARTIS     

Expressiveness of Probabilistic π-calculus

In this work we propose a probabilistic extension of the π-calculus. The main novelty is a probabilistic mixed choice operator, that is, a choice construct with a probability distribution on the branches, and where input and output actions can both occur as guards. We develop the operational semantics of this calculus, and then we investigate its expressiveness. In particular, we compare it with the sublanguage with the two separate choices, where input and output guards are not allowed together in the same choice construct. Our main result is that the separate choices can encode the mixed one. Further, we show that input-guarded choice can encode output-guarded choice and viceversa. In contrast, we conjecture that neither of them can encode the pair of the two separate choices.     

Molecular Orientational Ordering in Solid C60

Single-crystal X-ray diffraction studies of the orientational ordering in solid C₆₀ are reviewed. The temperature dependence of selected Bragg reflections was carefully examined, allowing to obtain original information on the first-order orientational ordering transition at T_o = 259K, the unusual behavior of both fundamental and superstructure reflections below T_o and the freezing in of the C₆₀ reorientations at T_g ≈ 85K. The diffuse intensity due to orientational disorder of the C₆₀ molecules at room temperature is found to be strongly modulated, both radially and azimuthally. showing that the molecular orientations are indeed correlated. The corresponding intensity distribution has been calculated within a mean-field theory for different microscopic models of inter molecular interactions. It should allow a better understanding of these interactions.     

Characterization of Campylobacter isolates recovered from clinically healthy pigs and from sporadic cases of campylobacteriosis in humans

Campylobacter spp. were recovered from 660 (77.6%) of 850 swine cecal contents at the abattoir and from 24 (8.6%) of 278 specimens from sporadic cases of human diarrhea during the same period in the same geographical area. Campylobacter coli represented 95.7% of Campylobacter isolates recovered from pigs and 8.3% of those isolated from humans. Genetic profiles were determined by pulsed-field gel electrophoresis (PFGE) using KpnI enzyme to characterize the isolates in combination with phenotypic assays to detect production of cytotoxins, enterotoxins, and hemolysins. Among a subset of isolates (n = 10), up to five colonies from the same animal were characterized by PFGE. In 5 (50%) of 10 of the isolates, more than one genetic profile was observed per pig. Among the 100 isolates from pigs selected for further analysis, 81 different genetic profiles were observed, whereas 20 different genetic profiles were found among the 24 isolates of human origin. Cytotoxicity on Chinese hamster ovary cells was observed in 11 (11%) of 98 isolates from pigs and in 5 (21%) of 24 Campylobacter isolates from humans. No enterotoxin production was detected in Campylobacter isolates in this study, but 17 (71%) of 24 human and 61 (63%) of 97 pig isolates showed hemolytic activity. The study of genotypic and phenotypic profiles of swine and human isolates revealed no epidemiological relationship between isolates. The low genomic relatedness observed between groups of isolates and the weak toxicity level of swine isolates suggest that the hazard of contamination of humans by Campylobacter associated with swine production is low.     

A P-matrix based model for SAW grating waveguides taking into account modes conversion at the reflection

Several models exist for analyzing the wave-guiding effect of a reflective grating. On the one hand, there are models based on scalar waveguide theory. These models consider that a device can be described as being made of several regions having different velocities. On the other hand, an extension of the coupling of modes (COM) model taking into account the transverse dimension has been developed. This paraxial COM model predicts that guidance is possible even when there is no velocity difference between the interior and the exterior of the grating region. Guidance, under such circumstances, is due only to differences in reflectivity between regions. Following from this insight, a new approach has been developed: guided modes and the continuum of radiating modes are first determined. At each period, reflections then are considered as occurring only in the reflective regions, so that the modes are truncated. Thus, at each reflection (and transmission), each mode is converted into a distribution of all modes. Dispersion curves very similar to those shown by other researchers are obtained by this method. They show, in particular, the existence of guided modes even when the wave velocity in all regions is identical. This model can be used to more easily analyze practical devices and exhibits a good agreement with experimental results.     

Measuring and Improving Image Resolution by Adaptation of the Reciprocal Cell

Traditionally, discrete images are assumed to be sampled on a square grid and from a special kind of band-limited continuous image, namely one whose Fourier spectrum is contained within the rectangular reciprocal cell associated with the sampling grid. With such a simplistic model, resolution is just given by the distance between sample points.Whereas this model matches to some extent the characteristics of traditional acquisition systems, it doesn't explain aliasing problems, and it is no longer valid for certain modern ones, where the sensors may show a heavily anisotropic transfer function, and may be located on a non-square (in most cases hexagonal) grid.In this work we first summarize the generalizations of Fourier theory and of Shannon's sampling theorem, that are needed for such acquisition devices. Then we explore its consequences: (i) A new way of measuring the effective resolution of an image acquisition system; (ii) A more accurate way of restoring the original image which is represented by the samples. We show on a series of synthetic and real images, how the proposed methods make a better use of the information present in the samples, since they may drastically reduce the amount of aliasing with respect to traditional methods. Finally we show how in combination with Total Variation minimization, the proposed methods can be used to extrapolate the Fourier spectrum in a reasonable manner, visually increasing image resolution.     

CMOS inverters based positive type second generation current conveyor

A new versatile class AB low-voltage second generation current conveyor based on CMOS inverters operating in transconductance mode is presented in this letter. Against traditional design based on CCII+, the circuit is able to operate at low supply voltages and offers numerous advantages like class AB operation, large voltage and current swing, synthesis from digital inverters. Simulation results from a typical 0.35 μm CMOS process had demonstrated the circuit capability to operate at high frequency over wide voltage and wide current swings. The proposed circuit operation has been acted from measurements with the HEF4069UBP from Philips semiconductors [1].     

On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems

Given a graph G=(V,E) and a positive integer k, an edge modification problem for a graph property Π consists in deciding whether there exists a set F of pairs of V of size at most k such that the graph $H=(V,E\vartriangle F)$ satisfies the property Π. In the Π edge-completion problem, the set F is constrained to be disjoint from E; in the Π edge-deletion problem, F is a subset of E; no constraint is imposed on F in the Π edge-editing problem. A number of optimization problems can be expressed in terms of graph modification problems which have been extensively studied in the context of parameterized complexity (Cai in Inf. Process. Lett. 58:171–176, 1996; Fellows et al. in FCT, pp. 312–321, 2007; Heggernes et al. in STOC, pp. 374–381, 2007). When parameterized by the size k of the set F, it has been proved that if Π is a hereditary property characterized by a finite set of forbidden induced subgraphs, then the three Π edge-modification problems are FPT (Cai in Inf. Process. Lett. 58:171–176, 1996). It was then natural to ask (Bodlaender et al. in IWPEC, 2006) whether these problems also admit a polynomial kernel. in polynomial time to an equivalent instance (G′,k′) with size bounded by a polynomial in k). Using recent lower bound techniques, Kratsch and Wahlström answered this question negatively (Kratsch and Wahlström in IWPEC, pp. 264–275, 2009). However, the problem remains open on many natural graph classes characterized by forbidden induced subgraphs. question to characterize for which type of graph properties, the parameterized edge-modification problems have polynomial kernels. Kratsch and Wahlström asked whether the result holds when the forbidden subgraphs are paths or cycles and pointed out that the problem is already open in the case of P ₄-free graphs (i.e. cographs). This paper provides positive and negative results in that line of research. We prove that Parameterized cograph edge-modification problems have cubic vertex kernels whereas polynomial kernels are unlikely to exist for the P _l -free edge-deletion and the C _l -free edge-deletion problems for l?7 and l≥4 respectively. Indeed, if they exist, then NP?coNP/poly.