Concept

Book embedding

Publications associées (18)

Multi-IVE: Privacy Enhancement of Multiple Soft-Biometrics in Face Embeddings

Sébastien Marcel, Hatef Otroshi Shahreza

This study focuses on the protection of soft-biometric attributes related to the demographic information of individuals that can be extracted from compact representations of face images, called embeddings. We consider a state-ofthe-art technology for soft- ...

IEEE COMPUTER SOC2023

Face Reconstruction Fromdeep Facial Embeddings Using A Convolutional Neural Network

Sébastien Marcel, Hatef Otroshi Shahreza

State-of-the-art (SOTA) face recognition systems generally use deep convolutional neural networks (CNNs) to extract deep features, called embeddings, from face images. The face embeddings are stored in the system's database and are used for recognition of ...

IEEE2022

Scalable Robust Graph Embedding with Spark

Karl Aberer, Quoc Viet Hung Nguyen, Chi Thang Duong, Trung-Dung Hoang

Graph embedding aims at learning a vector-based representation of vertices that incorporates the structure of the graph. This representation then enables inference of graph properties. Existing graph embedding techniques, however, do not scale well to larg ...

ASSOC COMPUTING MACHINERY2021

Efficient Streaming Subgraph Isomorphism with Graph Neural Networks

Karl Aberer, Quoc Viet Hung Nguyen, Chi Thang Duong, Trung-Dung Hoang

Queries to detect isomorphic subgraphs are important in graph-based data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do n ...

ASSOC COMPUTING MACHINERY2021

On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing

Igor Malinovic

Knapsack problems give a simple framework for decision making. A classical example is the min-knapsack problem (MinKnap): choose a subset of items with minimum total cost, whose total profit is above a given threshold. While this model successfully general ...

EPFL2019

Improving speech embedding using crossmodal transfer learning with audio-visual data

Jean-Marc Odobez

Learning a discriminative voice embedding allows speaker turns to be compared directly and efficiently, which is crucial for tasks such as diarization and verification. This paper investigates several transfer learning approaches to improve a voice embeddi ...

2019

Note on k-planar crossing numbers

János Pach

The crossing number CR(G) of a graph G = (V, E) is the smallest number of edge crossings over all drawings of G in the plane. For any k >= 1, the k-planar crossing number of G, CRk(G), is defined as the minimum of CR(G(0)) + CR(G(1)) + ... + CR(G(k-i)) ove ...

Elsevier Science Bv2018

Geographical Feature Extraction for Entities in Location-based Social Networks

Pearl Pu Faltings

Location-based embedding is a fundamental problem to solve in location-based social network (LBSN). In this paper, we propose a geographical convolutional neural tensor network (GeoCNTN) as a generic embedding model. GeoCNTN first takes the raw location da ...

ASSOC COMPUTING MACHINERY2018

Every Smile is Unique: Landmark-Guided Diverse Smile Generation

Pascal Fua, Wei Wang

Each smile is unique: one person surely smiles in different ways (e.g. closing/opening the eyes or mouth). Given one input image of a neutral face, can we generate multiple smile videos with distinctive characteristics? To tackle this one-to-many video gen ...

IEEE2018

Clustered planarity testing revisited

Radoslav Fulek, Jan Kyncl, Igor Malinovic

The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generali ...

2015

Fabrication-Aware Design with Performative Criteria

Yuliy Gennadievich Schwartzburg

Artists and architects often need to handle multiple constraints during design of physical constructions. We define a performative constraint as any constraint on design that is tied to the performance of the model--either during fabrication, construction, ...

EPFL2015

Free Edge Lengths in Plane Graphs

Radoslav Fulek, Filip Moric

We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graph H (where H is the "host" of G). The graph G is free in H if for every choice of positive lengths for the edges of G, the host H has a pla ...

Springer2015

Outerplanar graph drawings with few slopes

Bartosz Maria Walczak

We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions. We prove that Delta - 1 edge slopes suffic ...

Elsevier Science Bv2014

Fabrication-aware Design with Intersecting Planar Pieces

Mark Pauly, Yuliy Gennadievich Schwartzburg

We propose a computational design approach to generate 3D models composed of interlocking planar pieces. We show how intricate 3D forms can be created by sliding the pieces into each other along straight slits, leading to a simple construction that does no ...

Blackwell Publishing2013

Design and Optimization of Orthogonally Intersecting Planar Surfaces

Mark Pauly, Yuliy Gennadievich Schwartzburg

We present a method for the design of 3D constructions from planar pieces that can be cut easily and cheaply with laser cutters and similar Computer Numerical Control (CNC) machines. By cutting tight slits in intersecting pieces, they can be slid into each ...

Springer Berlin Heidelberg2012

Electromagnetic Modelling of Planar Circuits Embedded in Laterally Shielded Multilayered Media

Laleh Golestanirad

Multilayered media with printed circuits embedded between their dielectric layers are one of the most successful technologies for manufacturing planar structures with a very promising performance-to-price ratio. These planar structures include many differe ...

EPFL2011

Decomposition of Geometric Set Systems and Graphs

Doemoetoer Palvoelgyi

We study two decomposition problems in combinatorial geometry. The first part of the thesis deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold coveri ...

EPFL2010

Electromagnetic modelling of planar circuits in bounded layered media

Pedro Crespo Valero

Printed circuits in bounded media encompass a wide range of practical structures such as discontinuities in waveguides, planar circuits embedded in shielded multilayered media or even two-dimensional printed periodic structures. The Electromagnetic (EM) mo ...

EPFL2007