Face recognition based on 3D ridge images obtained from range data

In this paper, we present an approach for 3D face recognition from frontal range data based on the ridge lines on the surface of the face. We use the principal curvature, k_max, to represent the face image as a 3D binary image called ridge image. The ridge image shows the locations of the ridge points around the important facial regions on the face (i.e., the eyes, the nose, and the mouth). We utilized the robust Hausdorff distance and the iterative closest points (ICP) for matching the ridge image of a given probe image to the ridge images of the facial images in the gallery. To evaluate the performance of our approach for 3D face recognition, we performed experiments on GavabDB face database (a small size database) and Face Recognition Grand Challenge V2.0 (a large size database). The results of the experiments show that the ridge lines have great capability for 3D face recognition. In addition, we found that as long as the size of the database is small, the performance of the ICP-based matching and the robust Hausdorff matching are comparable. But, when the size of the database increases, ICP-based matching outperforms the robust Hausdorff matching technique.     

An assessment of photosynthetic light use efficiency from space: Modeling the atmospheric and directional impacts on PRI reflectance

Estimation of photosynthetic light use efficiency (ε) from satellite observations is an important component of climate change research. The photochemical reflectance index, a narrow waveband index based on the reflectance at 531 and 570 nm, allows sampling of the photosynthetic activity of leaves; upscaling of these measurements to landscape and global scales, however, remains challenging. Only a few studies have used spaceborne observations of PRI so far, and research has largely focused on the MODIS sensor. Its daily global coverage and the capacity to detect a narrow reflectance band at 531 nm make it the best available choice for sensing ε from space. Previous results however, have identified a number of key issues with MODIS-based observations of PRI. First, the differences between the footprint of eddy covariance (EC) measurements and the MODIS footprint, which is determined by the sensor's observation geometry make a direct comparison between both data sources challenging and second, the PRI reflectance bands are affected by atmospheric scattering effects confounding the existing physiological signal. In this study we introduce a new approach for upscaling EC based ε measurements to MODIS. First, EC-measured ε values were “translated” into a tower-level optical PRI signal using AMSPEC, an automated multi-angular, tower-based spectroradiometer instrument. AMSPEC enabled us to adjust tower-measured PRI values to the individual viewing geometry of each MODIS overpass. Second, MODIS data were atmospherically corrected using a Multi-Angle Implementation of Atmospheric Correction (MAIAC) algorithm, which uses a time series approach and an image-based rather than pixel-based processing for simultaneous retrievals of atmospheric aerosol and surface bidirectional reflectance (BRDF). Using this approach, we found a strong relationship between tower-based and spaceborne reflectance measurements (r² = 0.74, p < 0.01) throughout the vegetation period of 2006. Swath (non-gridded) observations yielded stronger correlations than gridded data (r² = 0.58, p < 0.01) both of which included forward and backscatter observations. Spaceborne PRI values were strongly related to canopy shadow fractions and varied with different levels of ε. We conclude that MAIAC-corrected MODIS observations were able to track the site-level physiological changes from space throughout the observation period.     

Geometrically non-linear behavior of structural systems with random material property: An asymptotic spectral stochastic approach

An asymptotic spectral stochastic approach is presented for computing the statistics of the equilibrium path in the post-bifurcation regime for structural systems with random material properties. The approach combines numerical implementation of Koiter’s asymptotic theory with a stochastic Galerkin scheme and collocation in stochastic space to quantify uncertainties in the parametric representation of the load–displacement relationship, specifically in the form of uncertain post-buckling slope, post-buckling curvature, and a family of stochastic displacement fields. Using the proposed method, post-buckling response statistics for two plane frames are obtained and shown to be in close agreement with those obtained from Monte Carlo simulation, provided a fine enough spectral representation is used to model the variability in the random dimension.     

Extracting a polyhedron from a single-view sketch: Topological construction of a wireframe sketch with minimal hidden elements

An essential prerequisite to construct a manifold trihedral polyhedron from a given natural (or partial-view) sketch is solution of the “wireframe sketch from a single natural sketch (WSS)” problem, which is the subject of this paper. Published solutions view WSS as an “image-processing”/“computer vision” problem where emphasis is placed on analyzing the given input (natural sketch) using various heuristics. This paper proposes a new WSS method based on robust tools from graph theory, solid modeling and Euclidean geometry. Focus is placed on producing a minimal wireframe sketch that corresponds to a topologically correct polyhedron.     

An overhead and resource contention aware analytical model for overloaded Web servers

A Web server, when overloaded, shows a severe degradation of goodput initially, with the eventual settling of goodput as load increases further. Traditional performance models have failed to capture this behavior. In this paper, we propose an analytical model, which is a two-stage and layered queuing model of the Web server, which is able to reproduce this behavior. We do this by explicitly modelling the overhead processing, the user abandonment and retry behavior, and the contention for resources, for the FIFO and LIFO queuing disciplines. We show that LIFO provides better goodput in most overload situations. We compare our model predictions with experimental results from a test bed and find that our results match well with measurements.     

Partial 3D Shape Retrieval by Reeb Pattern Unfolding

This paper presents a novel approach for fast and efficient partial shape retrieval on a collection of 3D shapes. Each shape is represented by a Reeb graph associated with geometrical signatures. Partial similarity between two shapes is evaluated by computing a variant of their maximum common sub-graph.
By investigating Reeb graph theory, we take advantage of its intrinsic properties at two levels. First, we show that the segmentation of a shape by a Reeb graph provides charts with disk or annulus topology only. This topology control enables the computation of concise and efficient sub-part geometrical signatures based on parameterisation techniques. Secondly, we introduce the notion of Reeb pattern on a Reeb graph along with its structural signature. We show this information discards Reeb graph structural distortion and still depicts the topology of the related sub-parts. The number of combinations to evaluate in the matching process is then dramatically reduced by only considering the combinations of topology equivalent Reeb patterns.
The proposed framework is invariant against rigid transformations and robust against non-rigid transformations and surface noise. It queries the collection in interactive time (from 4 to 30 seconds for the largest queries). It outperforms the competing methods of the SHREC 2007 contest in term of NDCG vector and provides, respectively, a gain of 14.1% and 40.9% on the approaches by Biasotti et al. [ BMSF06 ] and Cornea et al. [ CDS*05 ].
As an application, we present an intelligent modelling-by-example system which enables a novice user to rapidly create new 3D shapes by composing shapes of a collection having similar sub-parts.     

On the decoding of binary cyclic codes with the Newton identities

We revisit in this paper the concept of decoding binary cyclic codes with Gröbner bases. These ideas were first introduced by Cooper, then Chen, Reed, Helleseth and Truong, and eventually by Orsini and Sala. We discuss here another way of putting the decoding problem into equations: the Newton identities. Although these identities have been extensively used for decoding, the work was done manually, to provide formulas for the coefficients of the locator polynomial. This was achieved by Reed, Chen, Truong and others in a long series of papers, for decoding quadratic residue codes, on a case-by-case basis. It is tempting to automate these computations, using elimination theory and Gröbner bases.Thus, we study in this paper the properties of the system defined by the Newton identities, for decoding binary cyclic codes. This is done in two steps, first we prove some facts about the variety associated with this system, then we prove that the ideal itself contains relevant equations for decoding, which lead to formulas.Then we consider the so-called online Gröbner basis decoding, where the work of computing a Gröbner basis is done for each received word. It is much more efficient for practical purposes than preprocessing and substituting into the formulas. Finally, we conclude with some computational results, for codes of interesting length (about one hundred).     

Improved Interface Conditions for 2<Emphasis Type="Italic">D</Emphasis> Domain Decomposition with Corners: Numerical Applications

This article deals with a local improvement of domain decomposition methods for 2-dimensional elliptic problems for which either the geometry or the domain decomposition presents conical singularities. After explaining the main results of the theoretical analysis carried out in Chniti et al. (Calcolo 45, 2008), the numerical experiments presented in this article confirm the optimality properties of the new interface conditions.     

Local and Global Interactions in an Evolutionary Resource Game

Conditions for the emergence of cooperation in a spatial common-pool resource game are studied. This combines in a unique way local and global interactions. A fixed number of harvesters are located on a spatial grid. Harvesters choose among three strategies: defection, cooperation, and enforcement. Individual payoffs are affected by both global factors, namely, aggregate harvest and resource stock level, and local factors, such as the imposition of sanctions on neighbors by enforcers. The evolution of strategies in the population is driven by social learning through imitation, based on local interaction or locally available information. Numerous types of equilibria exist in these settings. An important new finding is that clusters of cooperators and enforcers can survive among large groups of defectors. We discuss how the results contrast with the non-spatial, but otherwise similar, game of Sethi and Somanathan (American Economic Review 86(4):766–789, 1996).      

Application of VPRS model with enhanced threshold parameter selection mechanism to automatic stock market forecasting and portfolio selection

This study proposes a technique based upon Fuzzy C-Means (FCM) classification theory and related fuzzy theories for choosing an appropriate value of the Variable Precision Rough Set (VPRS) threshold parameter (β) when applied to the classification of continuous information systems. The VPRS model is then combined with a moving Average Autoregressive Exogenous (ARX) prediction model and Grey Systems theory to create an automatic stock market forecasting and portfolio selection mechanism. In the proposed mechanism, financial data are collected automatically every quarter and are input to an ARX prediction model to forecast the future trends of the collected data over the next quarter or half-year period. The forecast data are then reduced using a GM(1, N) model, classified using a FCM clustering algorithm, and then supplied to a VPRS classification module which selects appropriate investment stocks in accordance with a pre-determined set of decision-making rules. Finally, a grey relational analysis technique is employed to weight the selected stocks in such a way as to maximize the rate of return of the stock portfolio. The validity of the proposed approach is demonstrated using electronic stock data extracted from the financial database maintained by the Taiwan Economic Journal (TEJ). The portfolio results obtained using the proposed hybrid model are compared with those obtained using a Rough Set (RS) selection model. The effects of the number of attributes of the RS lower approximation set and VPRS β-lower approximation set on the classification are systematically examined and compared. Overall, the results show that the proposed stock forecasting and stock selection mechanism not only yields a greater number of selected stocks in the β-lower approximation set than in the RS approximation set, but also yields a greater rate of return.