Path‐space Motion Estimation and Decomposition for Robust Animation Filtering

Renderings of animation sequences with physics‐based Monte Carlo light transport simulations are exceedingly costly to generate frame‐by‐frame, yet much of this computation is highly redundant due to the strong coherence in space, time and among samples. A promising approach pursued in prior work entails subsampling the sequence in space, time, and number of samples, followed by image‐based spatio‐temporal upsampling and denoising. These methods can provide significant performance gains, though major issues remain: firstly, in a multiple scattering simulation, the final pixel color is the composite of many different light transport phenomena, and this conflicting information causes artifacts in image‐based methods. Secondly, motion vectors are needed to establish correspondence between the pixels in different frames, but it is unclear how to obtain them for most kinds of light paths (e.g. an object seen through a curved glass panel). To reduce these ambiguities, we propose a general decomposition framework, where the final pixel color is separated into components corresponding to disjoint subsets of the space of light paths. Each component is accompanied by motion vectors and other auxiliary features such as reflectance and surface normals. The motion vectors of specular paths are computed using a temporal extension of manifold exploration and the remaining components use a specialized variant of optical flow. Our experiments show that this decomposition leads to significant improvements in three image‐based applications: denoising, spatial upsampling, and temporal interpolation.     

METIS-II: low resource machine translation

METIS-II was an EU-FET MT project running from October 2004 to September 2007, which aimed at translating free text input without resorting to parallel corpora. The idea was to use “basic” linguistic tools and representations and to link them with patterns and statistics from the monolingual target-language corpus. The METIS-II project has four partners, translating from their “home” languages Greek, Dutch, German, and Spanish into English. The paper outlines the basic ideas of the project, their implementation, the resources used, and the results obtained. It also gives examples of how METIS-II has continued beyond its lifetime and the original scope of the project. On the basis of the results and experiences obtained, we believe that the approach is promising and offers the potential for development in various directions.     

Network invariants for real-time systems

We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition structures (which are similar in spirit to timed automata) and define a notion of abstraction that is safe with respect to linear temporal properties. We strengthen the notion of abstraction to allow a finite system, then called network invariant, to be an abstraction of networks of real-time systems. In general the problem of checking abstraction of real-time systems is undecidable. Hence, we provide sufficient criteria, which can be checked automatically, to conclude that one system is an abstraction of a concrete one. Our method is based on timed superposition and discretization of timed systems. We exemplify our approach by proving mutual exclusion of a simple protocol inspired by Fischer’s protocol, using the model checker TLV. Part of this work was done during O. Grinchtein’s stay at Weizmann Institute. This author was supported by the European Research Training Network “Games”.     

REVISE: A Tool for Measuring and Mitigating Bias in Visual Datasets

International Journal of Computer Vision - Machine learning models are known to perpetuate and even amplify the biases present in the data. However, these data biases frequently do not become...     

Efficient estimation of a semiparametric dynamic copula model

A new semiparametric dynamic copula model is proposed where the marginals are specified as parametric GARCH-type processes, and the dependence parameter of the copula is allowed to change over time in a nonparametric way. A straightforward two-stage estimation method is given by local maximum likelihood for the dependence parameter, conditional on consistent first stage estimates of the marginals. First, the properties of the estimator are characterized in terms of bias and variance and the bandwidth selection problem is discussed. The proposed estimator attains the semiparametric efficiency bound and its superiority is demonstrated through simulations. Finally, the wide applicability of the model in financial time series is illustrated, and it is compared with traditional models based on conditional correlations.     

Portfolio Management in Double Unknown Situations: Technological Platforms and the Role of Cross‐Application Managers

This article investigates portfolio management in double unknown situations. Double unknown refers to a situation in which the level of uncertainty is high and both technology and markets are as yet unknown. This situation can be an opportunity for new discoveries, creation of new performance solutions and giving direction to portfolio structuring. The literature highlights that the double unknown situation is a prerequisite to designing generic technologies that are able to address many existing and emerging markets and create value across a broad range of applications. The purpose of this paper is to investigate the initial phases of generic technology governance and associated portfolio structuring in multi‐project firms. We studied three empirical contexts of portfolio structuring at the European semiconductor provider STMicroelectronics. The results demonstrate that (1) portfolio management for generic technologies is highly transversal and comprises creating both modules to address market complementarities and the core element of a technological system – the platform, and (2) the design of generic technologies requires ‘cross‐application’ managers who are able to supervise the interactions among innovative concepts developed in different business and research groups and who are responsible for structuring and managing technological and marketing exploration portfolios within the organizational structures of a company.     

Gambling versus Designing: Organizing for the Design of the Probability Space in the Energy Sector

The objective of this paper is to elucidate an organizational process for the design of generic technologies (GTs). While recognizing the success of GTs, the literature on innovation management generally describes their design according to evolutionary strategies featuring multiple and uncertain trials, resulting in the discovery of common features among multiple applications. This random walk depends on multiple market and technological uncertainties that are considered exogenous: as smart as he can be, the ‘gambler’ must play in a given probability space. However, what happens when the innovator is not a gambler but a designer, i.e., when the actor is able to establish new links between previously independent emerging markets and technologies? Formally speaking, the actor designs a new probability space. Building on a case study of two technological development programmes at the French Center for Atomic Energy, we present cases of GTs that correspond to this logic of designing the probability space, i.e. the logic of intentionally designing common features that bridge the gap between a priori heterogeneous applications and technologies. This study provides another example showing that the usual trial‐and‐learning strategy is not the only strategy to design GTs and that these technologies can be designed by intentionally building new interdependences between markets and technologies. Our main result is that building these interdependences requires organizational patterns that correspond to a ‘design of exploration’ phase in which multiple technology suppliers and application providers are involved in designing both the probability space itself and the instruments to explore and benefit from this new space.     

Hierarchical mapping of Northern Eurasian land cover using MODIS data

The Northern Eurasian land mass encompasses a diverse array of land cover types including tundra, boreal forest, wetlands, semi-arid steppe, and agricultural land use. Despite the well-established importance of Northern Eurasia in the global carbon and climate system, the distribution and properties of land cover in this region are not well characterized. To address this knowledge and data gap, a hierarchical mapping approach was developed that encompasses the study area for the Northern Eurasia Earth System Partnership Initiative (NEESPI). The Northern Eurasia Land Cover (NELC) database developed in this study follows the FAO-Land Cover Classification System and provides nested groupings of land cover characteristics, with separate layers for land use, wetlands, and tundra. The database implementation is substantially different from other large-scale land cover datasets that provide maps based on a single set of discrete classes. By providing a database consisting of nested maps and complementary layers, the NELC database provides a flexible framework that allows users to tailor maps to suit their needs. The methods used to create the database combine empirically derived climate–vegetation relationships with results from supervised classifications based on Moderate Resolution Imaging Spectroradiometer (MODIS) data. The hierarchical approach provides an effective framework for integrating climate–vegetation relationships with remote sensing-based classifications, and also allows sources of error to be characterized and attributed to specific levels in the hierarchy. The cross-validated accuracy was 73% for the land cover map and 73% and 91% for the agriculture and wetland classifications, respectively. These results support the use of hierarchical classification and climate–vegetation relationships for mapping land cover at continental scales.     

The Search of Equilibrium Strategies for Controlled Boundary Value Problem

The present paper is focused on the finite‐time differential game of m players with nonzero sum. The principal difference from regular cases consists in the fact that the states of players are subordinated to boundary value system of ordinary differential equations (rather than the initial value system). By the end of the game we understand the equilibrium situation and our purpose is to design a well‐founded suitable method for the equilibrium control search.