Computing all subtree repeats in ordered trees

We consider the problem of computing all subtree repeats in a given labeled ordered tree. We first transform the tree to a string representing its postfix notation, and then present an algorithm based on the bottom-up technique to solve it. The proposed algorithm consists of two phases: the preprocessing phase and the phase where all subtree repeats are computed. The linear time and space complexity of the proposed algorithm are important parts of its quality.     

High Angular Resolution Diffusion MRI Segmentation Using Region-Based Statistical Surface Evolution

In this article we develop a new method to segment high angular resolution diffusion imaging (HARDI) data. We first estimate the orientation distribution function (ODF) using a fast and robust spherical harmonic (SH) method. Then, we use a region-based statistical surface evolution on this image of ODFs to efficiently find coherent white matter fiber bundles. We show that our method is appropriate to propagate through regions of fiber crossings and we show that our results outperform state-of-the-art diffusion tensor (DT) imaging segmentation methods, inherently limited by the DT model. Results obtained on synthetic data, on a biological phantom, on real datasets and on all 13 subjects of a public NMR database show that our method is reproducible, automatic and brings a strong added value to diffusion MRI segmentation.

Predictive, Stochastic and Dynamic Extensions to Aversion Dynamics Scheduling

Schedulers' decisions in real factories deal with perceived risks and impacts. They proactively anticipate and reactively mitigate risky events by altering what would be considered a normal schedule to minimize associated impacts. These risk mitigation concepts are called aversion dynamics (AD). Aversion dynamics describes the aversion that jobs exhibit to impacts resulting from risky events in dynamic and unstable production environments. The aversion manifests itself in either advancing or delaying the work to avoid the risky period. This paper extends the first AD heuristic, Averse-1, to capture additional real-world dynamics and to make the heuristic predictive (proactive) as to when the perceived risky event may happen. In particular, predictive and stochastic elements are incorporated within a dynamic job arrival framework to create an extended heuristic called Averse-2.     

A fast and practical bit-vector algorithm for the Longest Common Subsequence problem

This paper presents a new practical bit-vector algorithm for solving the well-known Longest Common Subsequence (LCS) problem. Given two strings of length m and n, nm, we present an algorithm which determines the length p of an LCS in O(nm/w) time and O(m/w) space, where w is the number of bits in a machine word. This algorithm can be thought of as column-wise “parallelization” of the classical dynamic programming approach. Our algorithm is very efficient in practice, where computing the length of an LCS of two strings can be done in linear time and constant (additional/working) space by assuming that mw.     

Monocular Vision for Mobile Robot Localization and Autonomous Navigation

This paper presents a new real-time localization system for a mobile robot. We show that autonomous navigation is possible in outdoor situation with the use of a single camera and natural landmarks. To do that, we use a three step approach. In a learning step, the robot is manually guided on a path and a video sequence is recorded with a front looking camera. Then a structure from motion algorithm is used to build a 3D map from this learning sequence. Finally in the navigation step, the robot uses this map to compute its localization in real-time and it follows the learning path or a slightly different path if desired. The vision algorithms used for map building and localization are first detailed. Then a large part of the paper is dedicated to the experimental evaluation of the accuracy and robustness of our algorithms based on experimental data collected during two years in various environments.     

Software HEVC video decoder: towards an energy saving for mobile applications

Multimedia Tools and Applications - With the explosive growth of mobile video consumption over the Internet, delivering video at high quality while controlling the energy consumption of embedded...     

iLogDemons: A Demons-Based Registration Algorithm for Tracking Incompressible Elastic Biological Tissues

Tracking soft tissues in medical images using non-linear image registration algorithms requires methods that are fast and provide spatial transformations consistent with the biological characteristics of the tissues. LogDemons algorithm is a fast non-linear registration method that computes diffeomorphic transformations parameterised by stationary velocity fields. Although computationally efficient, its use for tissue tracking has been limited because of its ad-hoc Gaussian regularisation, which hampers the implementation of more biologically motivated regularisations. In this work, we improve the logDemons by integrating elasticity and incompressibility for soft-tissue tracking. To that end, a mathematical justification of demons Gaussian regularisation is proposed. Building on this result, we replace the Gaussian smoothing by an efficient elastic-like regulariser based on isotropic differential quadratic forms of vector fields. The registration energy functional is finally minimised under the divergence-free constraint to get incompressible deformations. As the elastic regulariser and the constraint are linear, the method remains computationally tractable and easy to implement. Tests on synthetic incompressible deformations showed that our approach outperforms the original logDemons in terms of elastic incompressible deformation recovery without reducing the image matching accuracy. As an application, we applied the proposed algorithm to estimate 3D myocardium strain on clinical cine MRI of two adult patients. Results showed that incompressibility constraint improves the cardiac motion recovery when compared to the ground truth provided by 3D tagged MRI.     

Quantitative mass spectrometry for colorectal cancer proteomics

This review documents the uses of quantitative MS applied to colorectal cancer (CRC) proteomics for biomarker discovery and molecular pathway profiling. Investigators are adopting various labeling and label-free MS approaches to quantitate differential protein levels in cells, tumors, and plasma/serum. We comprehensively review recent uses of this technology to examine mouse models of CRC, CRC cell lines, their secretomes and subcellular fractions, CRC tumors, CRC patient plasma/serum, and stool samples. For biomarker discovery these approaches are uncovering proteins with potential diagnostic and prognostic utility, while in vitro cell culture experiments are characterizing proteomic and phosphoproteomic responses to disrupted signaling pathways due to mutations or to inhibition of drugable enzymes.     

Modeling the behavior of persons with mild cognitive impairment or Alzheimer’s for intelligent environment simulation

User Modeling and User-Adapted Interaction - Intelligent environments may improve the independence and quality of life of persons with mild cognitive impairment (MCI) or Alzheimer’s disease...