Extracting Microfacet‐based BRDF Parameters from Arbitrary Materials with Power Iterations

We introduce a novel fitting procedure that takes as input an arbitrary material, possibly anisotropic, and automatically converts it to a microfacet BRDF. Our algorithm is based on the property that the distribution of microfacets may be retrieved by solving an eigenvector problem that is built solely from backscattering samples. We show that the eigenvector associated to the largest eigenvalue is always the only solution to this problem, and compute it using the power iteration method. This approach is straightforward to implement, much faster to compute, and considerably more robust than solutions based on nonlinear optimizations. In addition, we provide simple conversion procedures of our fits into both Beckmann and GGX roughness parameters, and discuss the advantages of microfacet slope space to make our fits editable. We apply our method to measured materials from two large databases that include anisotropic materials, and demonstrate the benefits of spatially varying roughness on texture mapped geometric models.     

Mutual spectral residual approach for multifocus image fusion

Multifocus image fusion is the process of obtaining a single image from multiple partially focused images such that the newly formed image consists of the well-defined information extracted from each source image. This paper proposes the use of saliency of the source images based on Mutual Spectral Residual. Spectral Residual brings out the unique/salient features of an image in frequency domain. The idea of proposed mutual spectral residual is to emphasize the relative unique features of a source image with respect to the other source images. The relative unique features are utilized to form saliency maps for each source image. These saliency maps can clearly indicate the focused and defocused parts of an image. Based on the saliency maps obtained, the image fusion takes place in spatial domain. Visual inspection and quantitative evaluation of the fused images obtained by the proposed method, using different evaluation metrics, demonstrate its effectiveness over several existing image fusion methods.     

Wii remote–based low-cost motion capture for automated assembly simulation

This paper describes the development of a Wii remote (Wiimote)–based low-cost motion capture system and demonstrates its application for automated assembly simulation. Multiple Wiimotes are used to form a vision system to perform motion capture in 3D space. A hybrid algorithm for calibrating a multi-camera stereo vision system has been developed based on Zhang’s and Svoboda’s calibration algorithms. This hybrid algorithm has been evaluated and shown accuracy improvement over Svoboda’s algorithm for motion capture with multiple cameras. The captured motion data are used to automatically generate an assembly simulation of objects represented by CAD models in real time. The Wiimote-based motion capture system is practically attractive because it is inexpensive, wireless, and easily portable. Application examples have been developed for a single vision system with two Wiimotes to track the assembly of a microsatellite prototype frame and for an integrated vision system with four Wiimotes to track the assembly of a bookshelf.     

Bed morphology, flow structure, and sediment transport at the outlet of Lake Huron and in the upper St. Clair River

An integrated multibeam echo sounder and acoustic Doppler current profiler field survey was conducted in July 2008 to investigate the morphodynamics of the St. Clair River at the outlet of Lake Huron. The principal morphological features of the upper St. Clair River included flow-transverse bedforms that appear weakly mobile, erosive bedforms in cohesive muds, thin non-cohesive veneers of weakly mobile sediment that cover an underlying cohesive (till or glacio-lacustrine) surface, and vegetation that covers the bed. The flow was characterized by acceleration as the banks constrict from Lake Huron into the St. Clair River, an approximately 1500-m long region of flow separation downstream from the Blue Water Bridge, and secondary flow connected to: i) channel curvature; ii) forcing of the flow by local bed topography, and iii) flow wakes in the lee side of ship wrecks. Nearshore, sand-sized, sediment from Lake Huron was capable of being transported into, and principally along, the banks of the upper St. Clair River by the measured flow. A comparison of bathymetric surveys conducted in 2007 and 2008 identifies that the gravel bed does undergo slow downstream movement, but that this movement does not appear to be generated by the mean flow, and could possibly be caused by ship-propeller-induced turbulence. The study results suggest that the measured mean flow and dredging within the channel have not produced major scour of the upper St. Clair River and that the recent fall in the level of Lake Huron is unlikely to have been caused by these mechanisms.     

Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning

The classical Geiringer theorem addresses the limiting frequency of occurrence of various alleles after repeated application of crossover. It has been adopted to the setting of evolutionary algorithms and, a lot more recently, reinforcement learning and Monte-Carlo tree search methodology to cope with a rather challenging question of action evaluation at the chance nodes. The theorem motivates novel dynamic parallel algorithms that are explicitly described in the current paper for the first time. The algorithms involve independent agents traversing a dynamically constructed directed graph that possibly has loops and multiple edges. A rather elegant and profound category-theoretic model of cognition in biological neural networks developed by a well-known French mathematician, professor Andree Ehresmann jointly with a neurosurgeon, Jan Paul Vanbremeersch over the last thirty years provides a hint at the connection between such algorithms and Hebbian learning.     

Regional aboveground forest biomass using airborne and spaceborne LiDAR in Québec

Aboveground dry biomass was estimated for the 1.3 M km² forested area south of the treeline in the eastern Canadian province of Québec by combining data from an airborne and spaceborne LiDAR, a Landsat ETM+ land cover map, a Shuttle Radar Topographic Mission (SRTM) digital elevation model, ground inventory plots, and vegetation zone maps. Plot-level biomass was calculated using allometric relationships between tree attributes and biomass. A small footprint portable laser profiler then flew over these inventory plots to develop a generic airborne LiDAR-based biomass equation (R² = 0.65, n = 207). The same airborne LiDAR system flew along four portions of orbits of the ICESat Geoscience Laser Altimeter System (GLAS). A square-root transformed equation was developed to predict airborne profiling LiDAR estimates of aboveground dry biomass from GLAS waveform parameters combined with an SRTM slope index (R² = 0.59, n = 1325).Using the 104,044 quality-filtered GLAS pulses obtained during autumn 2003 from 97 orbits over the study area, we then predicted aboveground dry biomass for the main vegetation areas of Québec as well as for the entire Province south of the treeline. Including cover type covariances both within and between GLAS orbits increased standard errors of the estimates by two to five times at the vegetation zone level and as much as threefold at the provincial level. Aboveground biomass for the whole study area averaged 39.0 ± 2.2 (standard error) Mg ha^? 1 and totalled 4.9 ± 0.3 Pg. Biomass distributions were 12.6% northern hardwoods, 12.6% northern mixedwood, 38.4% commercial boreal, 13% non-commercial boreal, 14.2% taiga, and 9.2% treed tundra. Non-commercial forests represented 36% of the estimated aboveground biomass, thus highlighting the importance of remote northern forests to C sequestration. This study has shown that space-based forest inventories of northern forests could be an efficient way of estimating the amount, distribution, and uncertainty of aboveground biomass and carbon stocks at large spatial scales.     

Real-time crowd motion planning

Real-time crowd motion planning requires fast, realistic methods for path planning as well as obstacle avoidance. In a previous work (Morini et al. in Cyberworlds International Conference, pp. 144–151, 2007), we introduced a hybrid architecture to handle real-time motion planning of thousands of pedestrians. In this article, we present an extended version of our architecture, introducing two new features: an improved short-term collision avoidance algorithm, and simple efficient group behavior for crowds. Our approach allows the use of several motion planning algorithms of different precision for regions of varied interest. Pedestrian motion continuity is ensured when switching between such algorithms. To assess our architecture, several performance tests have been conducted, as well as a subjective test demonstrating the impact of using groups. Our results show that the architecture can plan motion in real time for several thousands of characters.

Optimizing counter-terror operations: Should one fight fire with “fire” or “water”?

This paper deals dynamically with the question of how recruitment to terror organizations is influenced by counter-terror operations. This is done within an optimal control model, where the key state is the (relative) number of terrorists and the key controls are two types of counter-terror tactics, one (“water”) that does not and one (“fire”) that does provoke recruitment of new terrorists. The model is nonlinear and does not admit analytical solutions, but an efficient numerical implementation of Pontryagin's minimum principle allows for solution with base case parameters and considerable sensitivity analysis. Generally, this model yields two different steady states, one where the terror organization is nearly eradicated and one with a high number of terrorists. Whereas water strategies are used at almost any time, it can be optimal not to use fire strategies if the number of terrorists is below a certain threshold.     

Differencing and merging of architectural views

Differencing and merging architectural views is an important activity in software engineering. However, existing approaches are still based on restrictive assumptions, such as requiring view elements to have unique identifiers or exactly matching types, which is often not the case in many application domains. We propose an approach based on structural information. We generalize a published polynomial-time tree-to-tree correction algorithm that detects inserts, renames and deletes, into a novel algorithm that additionally detects restricted moves. Our algorithm also supports forcing and preventing matches between view elements. We incorporate the algorithm into tools to compare and merge Component-and-Connector (C&C) architectural views. We provide an empirical evaluation of the algorithm. We illustrate the tools using extended examples, and use them to detect and reconcile interesting differences between real architectural views. This article is an expanded version of the following paper: Abi-Antoun, M., Aldrich, J., Nahas, N., Schmerl, B., and Garlan, D: 2006, ‘Differencing and Merging of Architectural Views’. In: Proceedings of the 21st IEEE International Conference on Automated Software Engineering, pp. 47–58.