Three-dimensional facial surface modeling applied to recognition

Applications related to game technology, law-enforcement, security, medicine or biometrics are becoming increasingly important, which, combined with the proliferation of three-dimensional (3D) scanning hardware, have made that 3D face recognition is now becoming a promising and feasible alternative to two-dimensional (2D) face methods. The main advantage of 3D data, when compared with traditional 2D approaches, is that it provides information that is invariant to rigid geometric transformations and to pose and illumination conditions. One key element for any 3D face recognition system is the modeling of the available scanned data. This paper presents new 3D models for facial surface representation and evaluates them using two matching approaches: one based on support vector machines and another one on principal component analysis (with a Euclidean classifier). Also, two types of environments were tested in order to check the robustness of the proposed models: a controlled environment with respect to facial conditions (i.e. expressions, face rotations, etc.) and a non-controlled one (presenting face rotations and pronounced facial expressions). The recognition rates obtained using reduced spatial resolution representations (a 77.86% for non-controlled environments and a 90.16% for controlled environments, respectively) show that the proposed models can be effectively used for practical face recognition applications.     

A study on the use of statistical tests for experimentation with neural networks: Analysis of parametric test conditions and non-parametric tests

In this paper, we focus on the experimental analysis on the performance in artificial neural networks with the use of statistical tests on the classification task. Particularly, we have studied whether the sample of results from multiple trials obtained by conventional artificial neural networks and support vector machines checks the necessary conditions for being analyzed through parametrical tests. The study is conducted by considering three possibilities on classification experiments: random variation in the selection of test data, the selection of training data and internal randomness in the learning algorithm.The results obtained state that the fulfillment of these conditions are problem-dependent and indefinite, which justifies the need of using non-parametric statistics in the experimental analysis.     

Discontinuous gradient algorithm for finite-time estimation of time-varying parameters

ABSTRACT

In this work, we present a discontinuous algorithm capable of estimating time-varying parameters in finite time. The measured output is assumed to be linear in the parameters, i.e. it corresponds to a linear parametric model. It is further assumed that the parameter variation is uniformly bounded, and that the regressor is sufficiently exciting as to make the parameters identifiable.     

Robotics in Education

Collision avoidance is essential for safe robot manipulation. Especially with humans around, robots should work only when safety can be robustly guaranteed. In this paper, we propose using virtual impedance control for reactive, smooth, and consistent collision avoidance that interferes minimally with the original task. The virtual impedance control operates in the risk space, a vector space describing the possibilities of all forthcoming collisions, and is designed to elude all risks in a consistent response in order to create assuring human-robot interaction experiences. The proposed scheme intrinsically handles kinematic singularity and the activation of avoidance using a boundary layer defined on the spectrum of Jacobian. In cooperation with the original controller, the proposed avoidance scheme provides a proof of convergence if the original controller is stable with and without projection. In simulations and experiments, we verified the characteristics of the proposed control scheme and integrated the system with Microsoft Kinect to monitor the workspace for real-time collision detection and avoidance. The results show that the proposed approach is suitable for robot operation with humans nearby.     

Supporting Unified Distributed Management and Autonomic Decisions: Design,Implementation and Deployment

Nowadays, the prevailing use of networks based on traditional centralized management systems reflects on a fast increase of the management costs. The growth in the number of network equipments and services reinforces the need to distribute the management responsibilities throughout the network devices. In this approach, each device executes common network management functionalities, being part of the overall network management platform. In this paper, we present a Unified Distributed Network Management (UDNM) framework that provides a unified (wired and wireless) management network solution, where further different network services can take part of this infrastructure, e.g., flow monitoring, accurate routing decisions, distributed policies dissemination, etc. This framework is divided in two main components: (A) Situation awareness, which sets up initial information through bootstrapping, discovery, fault-management process and exchange of management information; (B) Autonomic Decision System (ADS) that performs distributed decisions in the network with incomplete information. We deploy the UDNM framework in a testbed which involves two cities (\(\approx\)250 km between), different standards (IEEE 802.3, IEEE 802.11 and IEEE 802.16e) and network technologies, such as, wired virtual grid, wireless ad-hoc gateways, ad-hoc mobile access devices. The UDNM framework integrates management functionalities into the managed devices, proving to be a lightweight and easy-respond framework. The performance analysis shows that the UDNM framework is feasible to unify devices management functionalities and to take accurate decisions on top of a real network.     

On improving the efficiency of tensor voting

This paper proposes two alternative formulations to reduce the high computational complexity of tensor voting, a robust perceptual grouping technique used to extract salient information from noisy data. The first scheme consists of numerical approximations of the votes, which have been derived from an in-depth analysis of the plate and ball voting processes. The second scheme simplifies the formulation while keeping the same perceptual meaning of the original tensor voting: The stick tensor voting and the stick component of the plate tensor voting must reinforce surfaceness, the plate components of both the plate and ball tensor voting must boost curveness, whereas junctionness must be strengthened by the ball component of the ball tensor voting. Two new parameters have been proposed for the second formulation in order to control the potentially conflictive influence of the stick component of the plate vote and the ball component of the ball vote. Results show that the proposed formulations can be used in applications where efficiency is an issue since they have a complexity of order O(1). Moreover, the second proposed formulation has been shown to be more appropriate than the original tensor voting for estimating saliencies by appropriately setting the two new parameters.     

Quantum statistical foundation to the fermi liquid model and Ginzburg-Landau wave function

An energy eigenvalue equation for a quasi-particle is derived, starting with the Heisenberg equation of motion for an annihilation operator. An elementary derivation of the Fermi liquid model having a sharply defined Fermi surface in thek-space is given, starting with a realistic model of a metal including the Coulomb interaction amongand between electrons and lattice-ions. The Ginzburg-Landau wave function (r), where represents the superconducting pairon (Cooper-pair) state, is shown to be connected with the one-pairon density operatorn by (r) = r¦_n ^1/2¦. A close analogy between supercurrent and laser is indicated.On sabbatical leave from Department of Physics and Astronomy, State University of New York at Buffalo, Buffalo, New York.     

Catalytic oxidation with Al-Ce-Fe-PILC as a post-treatment system for coffee wet processing wastewater

The effluent from the anaerobic biological treatment of coffee wet processing wastewater (CWPW) contains a non-biodegradable compound that must be treated before it is discharged into a water source. In this paper, the wet hydrogen peroxide catalytic oxidation (WHPCO) process using Al-Ce-Fe-PILC catalysts was researched as a post-treatment system for CWPW and tested in a semi-batch reactor at atmospheric pressure and 25 °C. The Al-Ce-Fe-PILC achieved a high conversion rate of total phenolic compounds (70%) and mineralization to CO(2) (50%) after 5 h reaction time. The chemical oxygen demand (COD) of coffee processing wastewater after wet hydrogen peroxide catalytic oxidation was reduced in 66%. The combination of the two treatment methods, biological (developed by Cenicafé) and catalytic oxidation with Al-Ce-Fe-PILC, achieved a 97% reduction of COD in CWPW. Therefore, the WHPCO using Al-Ce-Fe-PILC catalysts is a viable alternative for the post-treatment of coffee processing wastewater.