Region-Based Active Contours with Exponential Family Observations

In this paper, we focus on statistical region-based active contour models where image features (e.g. intensity) are random variables whose distribution belongs to some parametric family (e.g. exponential) rather than confining ourselves to the special Gaussian case. In the framework developed in this paper, we consider the general case of region-based terms involving functions of parametric probability densities, for which the anti-log-likelihood function is a special case. Using shape derivative tools, our effort focuses on constructing a general expression for the derivative of the energy (with respect to a domain), and on deriving the corresponding evolution speed. More precisely, we first show by an example that the estimator of the distribution parameters is crucial for the derived speed expression. On the one hand, when using the maximum likelihood (ML) estimator for these parameters, the evolution speed has a closed-form expression that depends simply on the probability density function. On the other hand, complicating additive terms appear when using other estimators, e.g. method of moments. We then proceed by stating a general result within the framework of multi-parameter exponential family. This result is specialized to the case of the anti-log-likelihood function with the ML estimator and to the case of the relative entropy. Experimental results on simulated data confirm our expectations that using the appropriate noise model leads to the best segmentation performance. We also report preliminary experiments on real life Synthetic Aperture Radar (SAR) images to demonstrate the potential applicability of our approach.     

Two‐dimensional model of methane thermal decomposition reactors with radiative heat transfer and carbon particle growth

A two‐dimensional model of methane thermal decomposition reactors is developed which accounts for coupled radiative heat and polydisperse carbon particle nucleation, growth, and transport. The model uses the Navier–Stokes equations for the fluid dynamics, the radiative transfer equation for methane and particle species radiation absorption, the advection–diffusion equation for gas and particle species transport, and a sectional method for particle species nucleation, heterogenous growth, and coagulation. The model is applied to a tubular laminar flow reactor. The simulation results indicate the development of a reaction boundary layer inside the reactor, which results in significant variation of the local particle size distribution across the reactor. © 2011 American Institute of Chemical Engineers AIChE J, 58: 2545–2556, 2012     

Magnebike: A magnetic wheeled robot with high mobility for inspecting complex‐shaped structures

This paper describes the Magnebike robot, a compact robot with two magnetic wheels in a motorbike arrangement, which is intended for inspecting the inner casing of ferromagnetic pipes with complex‐shaped structures. The locomotion concept is based on an adapted magnetic wheel unit integrating two lateral lever arms. These arms allow for slight lifting off the wheel in order to locally decrease the magnetic attraction force when passing concave edges, as well as laterally stabilizing the wheel unit. The robot has the main advantage of being compact (180 × 130 × 220 mm) and mechanically simple: it features only five active degrees of freedom (two driven wheels each equipped with an active lifter stabilizer and one steering unit). The paper presents in detail design and implementation issues that are specific to magnetic wheeled robots. Low‐level control functionalities are addressed because they are necessary to control the active system. The paper also focuses on characterizing and analyzing the implemented robot. The high mobility is shown through experimental results: the robot not only can climb vertical walls and follow circumferential paths inside pipe structures but it is also able to pass complex combinations of 90‐deg convex and concave ferromagnetic obstacles with almost any inclination regarding gravity. It requires only limited space to maneuver because turning on the spot around the rear wheel is possible. This high mobility enables the robot to access any location in the specified environment. Finally the paper analyzes the maximum payload for different types of environment complexities because this is a key feature for climbing robots and provides a security factor about the risk of falling and slipping. © 2009 Wiley Periodicals, Inc.     

CRIM’s content-based audio copy detection system for TRECVID 2009

We report results on audio copy detection for TRECVID 2009 copy detection task. This task involves searching for transformed audio queries in over 385?h of test audio. The queries were transformed in seven different ways, three of them involved mixing unrelated speech to the original query, making it a much more difficult task. We give results with two different audio fingerprints and show that mapping each test frame to the nearest query frame (nearest-neighbor fingerprint) results in robust audio copy detection. The most difficult task in TRECVID 2009 was to detect audio copies using predetermined thresholds computed from 2008 data. We show that the nearest-neighbor fingerprints were robust to even this task and gave actual minimal normalized detection cost rate (NDCR) of around 0.06 for all the transformations. These results are close to those obtained by using the optimal threshold for each transform. This result shows the robustness of the nearest-neighbor fingerprints. These nearest-neighbor fingerprints can be efficiently computed on a graphics processing unit, leading to a very fast search.     

Pairwise testing for software product lines: comparison of two approaches

Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability, which in turn leads to combinatorial explosion of the number of derivable products. Exhaustive testing in such a large products space is hardly feasible. Hence, one possible option is to test SPLs by generating test configurations that cover all possible t feature interactions (t-wise). It dramatically reduces the number of test products while ensuring reasonable SPL coverage. In this paper, we report our experience on applying t-wise techniques for SPL with two independent toolsets developed by the authors. One focuses on generality and splits the generation problem according to strategies. The other emphasizes providing efficient generation. To evaluate the respective merits of the approaches, measures such as the number of generated test configurations and the similarity between them are provided. By applying these measures, we were able to derive useful insights for pairwise and t-wise testing of product lines.     

Large scale multiple sequence alignment with simultaneous phylogeny inference

Multiple sequence alignment (MSA) and phylogenetic tree reconstruction are one of the most important problems in the computational biology. While both these problems are of great practical significance, in most cases they are very computationally demanding. In this paper we propose a new approach to the MSA problem which simultaneously infers an underlying phylogenetic tree. To process large data sets we provide parallel implementation of our method, which is based on the distributed caching of intermediate results. Finally, we show a parallel server designed for grid environments, and we report results of experiments performed with actual biological data, e.g. 1000 ribosomal RNA sequences.     

Transfer of learning in virtual environments: a new challenge?

The aim of all education is to apply what we learn in different contexts and to recognise and extend this learning to new situations. Virtual learning environments can be used to build skills. Recent research in cognitive psychology and education has shown that acquisitions are linked to the initial context. This provides a challenge for virtual reality in education or training. A brief overview of transfer issues highlights five main ideas: (1) the type of transfer enables the virtual environment (VE) to be classified according to what is learned; (2) the transfer process can create conditions within the VE to facilitate transfer of learning; (3) specific features of VR must match and comply with transfer of learning; (4) transfer can be used to assess a VE’s effectiveness; and (5) future research on transfer of learning must examine the singular context of learning. This paper discusses how new perspectives in cognitive psychology influence and promote transfer of learning through the use of VEs.     

On-column solvent exchange for purified preparative fractions

On-column solvent exchange, using many of the principles of solid-phase extraction, has been implemented to significantly reduce evaporation cycle time following reverse-phase preparative HPLC. Additional benefits, such as a reduced potential for salt formation, thermal decomposition, and residual solvent, are also described. Fractions obtained from preparative separations, typically in a large volume of acetonitrile:water, are injected into the preparative HPLC and then eluted in acetonitrile, creating a new fraction in a volatile organic solvent. Minimal modification to the instrument was required, and unattended operation is possible. Acetonitrile evaporation is achieved within 3 h, compared with 17 h for aqueous-based fractions; lower temperatures can be used during the evaporation step; mobile-phase additives, likely to form salts with the target compound if concentrated in the fraction, are removed before evaporation; sample recovery and purity are unaffected.     

Uniqueness of the Perfect Fusion Grid on ℤ d

Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In a graph, merging two regions, separated by a set of vertices, is not straightforward. The perfect fusion graphs defined in J. Cousty et al. (J. Math. Imaging Vis. 30:(1):87–104, 2008) verify all the basic properties required by region merging algorithms as used in image segmentation. Unfortunately, the graphs which are the most frequently used in image analysis (namely, those induced by the direct and the indirect adjacency relations) are not perfect fusion graphs. The perfect fusion grid, introduced in the above mentioned reference, is an adjacency relation on ℤ ^d which can be used in image analysis, which indeed induces perfect fusion graphs and which is “between” the graphs induced by the direct and the indirect adjacencies. One of the main results of this paper is that the perfect fusion grid is the only such graph whatever the dimension d.

A Cost-Regular Based Hybrid Column Generation Approach

Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To solve hard combinatorial optimization problems using CP alone or hybrid CP-ILP decomposition methods, costs also have to be taken into account within the propagation process. Optimization constraints, with their cost-based filtering algorithms, aim to apply inference based on optimality rather than feasibility. This paper introduces a new optimization constraint, cost-regular. Its filtering algorithm is based on the computation of shortest and longest paths in a layered directed graph. The support information is also used to guide the search for solutions. We believe this constraint to be particularly useful in modeling and solving Column Generation subproblems and evaluate its behaviour on complex Employee Timetabling Problems through a flexible CP-based column generation approach. Computational results on generated benchmark sets and on a complex real-world instance are given.A preliminary version of this paper appeared as [7]. This research was supported by the Mathematics of Information Technology and Complex Systems (MITACS) Internship program in association with Omega Optimisation Inc. (CA).