Application of ionic liquids for the removal of heavy metals from wastewater and activated sludge

This paper presents the results of adsorption studies on the removal of heavy metals (Cr, Cu, Cd, Ni, Pb and Zn) from standard solutions, real wastewater samples and activated sewage sludge using a new technique of liquid-liquid extraction using quaternary ammonium and phosphonium ionic liquids (ILs). Batch sorption experiments were conducted using the ILs [PR4][TS], [PR4][MTBA], [A336][TS] and [A336][MTBA]. Removal of these heavy metals from standard solutions were not effective, however removal of heavy metals from the industrial effluents/wastewater treatment plants were satisfactory, indicating that the removal depends mainly on the composition of the wastewater and cannot be predicted with standard solutions. Removal of heavy metals from activated sludge proved to be more successful than conventional methods such as incineration, acid extraction, thermal treatment, etc. For the heavy metals Cu, Ni and Zn, ≥90% removal was achieved.     

How reliable are odour assessments?

This paper will demonstrate the differences found in odour test results, when odour sampling is performed at the same sources by two different consultants. By examining two case studies, this paper will highlight that the difference between the results can be significant. Both studies are based on odour sampling programs determining the odour removal efficiency of odour control units installed at two different facilities: a pet food facility and an oil/grease recycling facility. The first study is based on odour measurements at the inlet and outlet of the unit installed by Applied Plasma Physics AS at the pet food facility. Odour assessments were performed by two separate consultants at the same time. The second study is based on testing of the odour removal effectiveness of two units: a scrubber and a biofilter at an oil/grease recycling facility. During this study two odour sampling programs were performed by two consultants at different times, but under the same process conditions. This paper will show how varying results can play a role in choosing the adequate odour control technologies. The final results suggest that although, an odour control unit may appear to be insufficient, it actually is successful at removing the odours.     

Transmission of population-coded information

As neural activity is transmitted through the nervous system, neuronal noise degrades the encoded information and limits performance. It is therefore important to know how information loss can be prevented. We study this question in the context of neural population codes. Using Fisher information, we show how information loss in a layered network depends on the connectivity between the layers. We introduce an algorithm, reminiscent of the water filling algorithm for Shannon information that minimizes the loss. The optimal connection profile has a center-surround structure with a spatial extent closely matching the neurons' tuning curves. In addition, we show how the optimal connectivity depends on the correlation structure of the trial-to-trial variability in the neuronal responses. Our results explain how optimal communication of population codes requires the center-surround architectures found in the nervous system and provide explicit predictions on the connectivity parameters.     

Learning Deformable Shape Manifolds

We propose an approach to shape detection of highly deformable shapes in images via manifold learning with regression. Our method does not require shape key points be defined at high contrast image regions, nor do we need an initial estimate of the shape. We only require sufficient representative training data and a rough initial estimate of the object position and scale. We demonstrate the method for face shape learning, and provide a comparison to nonlinear Active Appearance Model. Our method is extremely accurate, to nearly pixel precision and is capable of accurately detecting the shape of faces undergoing extreme expression changes. The technique is robust to occlusions such as glasses and gives reasonable results for extremely degraded image resolutions.     

Efficient additive kernels via explicit feature maps

Large scale nonlinear support vector machines (SVMs) can be approximated by linear ones using a suitable feature map. The linear SVMs are in general much faster to learn and evaluate (test) than the original nonlinear SVMs. This work introduces explicit feature maps for the additive class of kernels, such as the intersection, Hellinger's, and χ2 kernels, commonly used in computer vision, and enables their use in large scale problems. In particular, we: 1) provide explicit feature maps for all additive homogeneous kernels along with closed form expression for all common kernels; 2) derive corresponding approximate finite-dimensional feature maps based on a spectral analysis; and 3) quantify the error of the approximation, showing that the error is independent of the data dimension and decays exponentially fast with the approximation order for selected kernels such as χ2. We demonstrate that the approximations have indistinguishable performance from the full kernels yet greatly reduce the train/test times of SVMs. We also compare with two other approximation methods: Nystrom's approximation of Perronnin et al., which is data dependent, and the explicit map of Maji and Berg for the intersection kernel, which, as in the case of our approximations, is data independent. The approximations are evaluated on a number of standard data sets, including Caltech-101, Daimler-Chrysler pedestrians, and INRIA pedestrians.     

Cluster Size Optimization in Sensor Networks with Decentralized Cluster-Based Protocols

Network lifetime and energy-efficiency are viewed as the dominating considerations in designing cluster-based communication protocols for wireless sensor networks. This paper analytically provides the optimal cluster size that minimizes the total energy expenditure in such networks, where all sensors communicate data through their elected cluster heads to the base station in a decentralized fashion. LEACH, LEACH-Coverage, and DBS comprise three cluster-based protocols investigated in this paper that do not require any centralized support from a certain node. The analytical outcomes are given in the form of closed-form expressions for various widely-used network configurations. Extensive simulations on different networks are used to confirm the expectations based on the analytical results. To obtain a thorough understanding of the results, cluster number variability problem is identified and inspected from the energy consumption point of view.     

Multistage particle windows for fast and accurate object detection

The common paradigm employed for object detection is the sliding window (SW) search. This approach generates grid-distributed patches, at all possible positions and sizes, which are evaluated by a binary classifier: The tradeoff between computational burden and detection accuracy is the real critical point of sliding windows; several methods have been proposed to speed up the search such as adding complementary features. We propose a paradigm that differs from any previous approach since it casts object detection into a statistical-based search using a Monte Carlo sampling for estimating the likelihood density function with Gaussian kernels. The estimation relies on a multistage strategy where the proposal distribution is progressively refined by taking into account the feedback of the classifiers. The method can be easily plugged into a Bayesian-recursive framework to exploit the temporal coherency of the target objects in videos. Several tests on pedestrian and face detection, both on images and videos, with different types of classifiers (cascade of boosted classifiers, soft cascades, and SVM) and features (covariance matrices, Haar-like features, integral channel features, and histogram of oriented gradients) demonstrate that the proposed method provides higher detection rates and accuracy as well as a lower computational burden w.r.t. sliding window detection.     

Improvements of Adaptive Filtering by Optimal Projection to filter different artifact types on long duration EEG recordings

Adaptive Filtering by Optimal Projection (AFOP) is an automatic method for reducing ocular and muscular artifacts on electro-encephalographic (EEG) recordings. This paper presents two additions to this method: an improvement of the stability of ocular artifact filtering and an adaptation of the method for filtering electrode artifacts. With these improvements, it is possible to reduce almost all the current types of artifacts, while preserving brain signals, particularly those characterising epilepsy. This generalised method consists of dividing the signal into several time-frequency windows, and in applying different spatial filters to each. Two steps are required to define one of these spatial filters: the first step consists of defining artifact spatial projection using the Common Spatial Pattern (CSP) method and the second consists of defining EEG spatial projection via regression. For this second step, a progressive orthogonalisation process is proposed to improve stability. This method has been tested on long-duration EEG recordings of epileptic patients. A neurologist quantified the ratio of removed artifacts and the ratio of preserved EEG. Among the 330 artifacted pages used for evaluation, readability was judged better for 78% of pages, equal for 20% of pages, and worse for 2%. Artifact amplitudes were reduced by 80% on average. At the same time, brain sources were preserved in amplitude from 70% to 95% depending on the type of waves (alpha, theta, delta, spikes, etc.). A blind comparison with manual Independent Component Analysis (ICA) was also realised. The results show that this method is competitive and useful for routine clinical practice.