Face completion aims to generate semantically new pixels for missing facial components. It is a challenging generative task due to large variations of face appearance. This paper studies generative face completion under structured occlusions. We treat the face completion and corruption as disentangling and fusing processes of clean faces and occlusions, and propose a jointly disentangling and f...

Hummel, HE, Langner SS, Hein DF, Sanguanpong U, Schmutterer H 1 Chair of Organic Agriculture, Justus-Liebig-University Giessen, Germany 2 University of Illinois Urbana-Champaign, Institute of Natural Resources Sustainability, Champaign,USA 3 Rajamangala University of Technology Thanyaburi, Faculty of Agricultural Technology, Patumthani 12100, Thailand 4 Wiesenstrasse 55, D-35435 Krofdorf-Gleibe...

Given a transversely projective foliation F on a C∞ manifold M and a nonnegative integer k, a transversal differential operator DF (2k + 1) of order 2k + 1 from N⊗k to N⊗(−k−1) is constructed, where N denotes the normal bundle for the foliation. There is a natural homomorphism from the space of all infinitesimal deformations of the transversely projective foliation F to the first cohomology of ...

A short Polish phrase was spoken by aphonetician with 8 different intonations, and these Prototypes were imitated 10 times each by 15 speakers. Each of the 1200 u t terances was represen ted as a -vector in an 8-D space. 8 quadratic and 8 linear discriminant functions (DFs) were calculated for each of the 1200 utterance-vectors. The DF with the highest value indica ted the assignment of the tok...

Résumé. La notion de règles entre attributs est très générale, allant des règles d’association en fouille de données aux dépendances fonctionnelles (DF) en bases de données. Malgré cette diversité, la syntaxe des règles est toujours la même, seule leur sémantique diffère. Pour une sémantique donnée, en fonction des propriétés induites, des techniques algorithmiques sont mises en oeuvre pour déc...

For a set G and a family of sets F let DF (G) = {F ∈ F : F ∩ G = ∅} and SF (G) = {F ∈ F : F ⊆ G or G ⊆ F}. We say that a family is l-almost intersecting, (≤ l)-almost intersecting, l-almost Sperner, (≤ l)-almost Sperner if |DF (F )| = l, |DF (F )| ≤ l, |SF (F )| = l, |SF (F )| ≤ l (respectively) for all F ∈ F . We consider the problem of finding the largest possible family for each of the above...

This correspondence focuses on the asymptotic performance analysis of general direction-of-arrival (DOA) finding algorithms under the stochastic model assumption in which source and noise signals are possibly non-Gaussian and possibly temporally correlated. We prove, in particular, that all the covariance-based DOA estimators are sensitive to the temporal correlation of the sources when the noi...

KARINA I. MAZZITELLO, CONSTANCIO M. ARIZMENDI∗, ALVARO L. SALAS BRITO† and HILARY G. E. HENTSCHEL‡ CONICET-Facultad de Ingenieŕıa, Universidad Nacional de Mar del Plata, Juan B. Justo 4302, B7608FDQ Mar del Plata, Argentina ∗Facultad de Ingenieŕıa, Universidad Nacional de Mar del Plata, Juan B. Justo 4302, B7608FDQ Mar del Plata, Argentina †Univ Autonoma Metropolitana Azcapotzalco, Lab Sistemas...