Biometric and Physical Identifiers with Correlated Noise for Controllable Private Authentication

The problem of secret-key based authentication under privacy and storage constraints on the source sequence is considered . The identifier measurementchannels during authentication are assumed to be controllable via acost-constrained action sequence . The results are relevant for several user and deviceauthentication scenarios including physical and biometric identifiers with multiple measurements that provide diversity and multiplexing gains .…

Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa Szemerédi Graphs and Hypergraphs

One protocol leads to a simple and naturalextension of the original construction of Ruzsa and Szemer\'{e}di . Another protocol is an explicit (and slightly simpler) version of the construction of Alon,Moitra and Sudakov . We alsogeneralize the above protocols to more than three players, in order to construct dense uniform hypergraphs in which every edge lies in a positivesmall number of simplices .…

Coarse Grained Complexity for Dynamic Algorithms

To date, the only way to argue polynomial lower bounds for dynamic algorithms is via fine-grained complexity arguments . These arguments rely on strongassumptions about specific problems such as the Strong Exponential TimeHypothesis (SETH) and the Online Matrix- Vector Multiplication Conjecture (OMv) Dynamic algorithms missout some benefits and lessons from the traditional “coarse grained” approach .…

Incremental Monoidal Grammars

In this work we define formal grammars in terms of free monoidal categories . This allows us to link the categorical viewpoint on natural language to the standard machinelearning notion of probabilistic language model . We also develop a functor from the category of formal grammarmars to category ofautomata .…

Representing Unordered Data Using Complex Weighted Multiset Automata

Unordered, variable-sized inputs arise in many settings across multiplefields . The ability for set- and multiset-oriented neural networks to handle this type of input has been the focus of much work in recent years . We propose a new theoretical andintuitive justification for the Transformer model’s representation of positions using sinusoidal functions .…

Quick or cheap Breaking points in dynamic markets

We examine two-sided markets where players arrive stochastically over time and are drawn from a continuum of types . The cost of matching a client and provider varies, so a social planner is faced with two contending objectives:a) to reduce players’ waiting time before getting matched; and b) to formefficient pairs in order to reduce matching costs .…

Toward Optimal Adversarial Policies in the Multiplicative Learning System with a Malicious Expert

We consider a learning system based on the conventional multiplicative weight(MW) rule that combines experts’ advice to predict a sequence of true outcomes . In the offline setting where the malicious expert must choose its entire sequence of decisions a priori, we show somewhat surprisingly that asimple greedy policy of always reporting false prediction is asymptoticallyoptimal with an approximation ratio of $1+O(\sqrt{\frac{\ln N}{N) $N$is the total number of prediction stages .…

From Drinking Philosophers to Wandering Robots

In this paper, we consider the multi-robot path execution problem where agroup of robots move on predefined paths from their initial to target positions . We then propose modifications to an existing DrPP algorithm to allow more concurrent behavior, and provide conditions under which our method is deadlock-free .…

DeepFakes and Beyond A Survey of Face Manipulation and Fake Detection

Thissurvey provides a thorough review of techniques for manipulating face images including DeepFake methods . Inparticular, four types of facial manipulation are reviewed: entire facesynthesis, identity swap (DeepFakes), attribute manipulation, and expression swap . In addition to the survey information, we also discuss open issues and future trends that should be considered to advance in the field .…

DoWhy An End to End Library for Causal Inference

DoWhy is an open-source Python library that is built with causal assumptions as its first-class citizens . DoWhy implements a number of robustness checks including placebo tests, bootstrap tests, and tests for unobervedconfounding . The library is available at https://://://github.com/Microsoft/dowhy and the library is free to download from http://www.mnt.org/doWhy-why-pennifera-gui-a-libraries-to-measurement-by-mechanical-association-assumption-checker-assertions.…

Fourier based and Rational Graph Filters for Spectral Processing

Data are represented as graphs in a wide range of applications, such as Computer Vision and Graphics . We introduce a spectrum-free approach, which requires the solution of a small set of sparse, symmetric, well-conditioned linear systems . Approximating arbitrary graph filters with rational polynomials provides a more accurate andnumerically stable alternative with respect to polyomials .…

Designing Game Feel A Survey

The act of polishing that determines game feel, takes the shape of tuning, juicing, and streamlining respectively . Tuning thephysicality of game objects creates cohesion, predictability, and the resultingmovement informs many other design aspects . Juicing is the act of plishingamplification and it results in empowerment and provides clarity of feedback by communicating the importance of game events .…

Assembling a Pipeline for 3D Face Interpolation

This paper describes a pipeline built with open source tools forinterpolating 3D facial expressions taken from images . Given the input photos, corresponding 3D face models are constructed and texture-mappedusing the photos as textures aligned with facial features . Animations are thengenerated by morphing the models by interpolation of the geometries andtextures of the models .…

Deep Learning Based Human Pose Estimation A Survey

The goal of this survey paper is toprovide a comprehensive review of recent deep learning-based solutions for both 2D and 3D pose estimation . More than 240research papers since 2014 are covered in this survey . The challenges involved,applications, and future research directions are concluded .…

An Marching Cube Algorithm Based on Edge Growth

Marching Cube algorithm is currently one of the most popular 3D surface rendering algorithms . It forms cube voxels through the input image, then uses 15 basic topological configurations to extract theisosurfaces in the voxel . The algorithm first extractsseed triangles, then grows the seed triangles and reconstructs the entire 3D model .…

TopoKnit A Process Oriented Representation for Modeling the Topology of Yarns in Weft Knitted Textiles

Machine knitted textiles are complex multi-scale material structuresincreasingly important in many industries . Wepropose a process-oriented representation, TopoKnit, that defines afoundational data structure for representing the topology of weft-knittedtextiles at the yarn scale . Process space serves as an intermediary between themachine and fabric spaces, and supports a concise, computationally efficientevaluation approach based on on-demand, near constant-time queries .…

PAVEL Decorative Patterns with Packed Volumetric Elements

Ouralgorithm works by determining the locations in which to add the decorative elements and then removing the non-physical overlap between them while preserving the decoration volume . It can be used to enhance virtual surfaces, as well as 3D-printed pieces, by assembling the decorations onto real-surfacesto obtain tangible reproductions .…

Meta PU An Arbitrary Scale Upsampling Network for Point Cloud

Point cloud upsampling is vital for the quality of the mesh in three-dimensional reconstruction . The methods need to train a specific model for eachscale factor, which is both inefficient and impractical for storage and computing in real applications . We propose a novel method called “Meta-PU” to support point cloudupsampling of arbitrary scale factors with a single model .…

Azimuthal Anamorphic Ray map for Immersive Renders in Perspective

Wide choice of cinematic lenses enables motion-picture creators to adapt image visual-appearance to their creative vision . This work provides perspective imaging model that in artistically convincing manner resembles anamorphic photography lensvariety . Mathematical model for this projection has been chosen such that its parameters reflectpsycho-physiological aspects of visual perception .…

Volumetric Procedural Models for Shape Representation

PSML provides programmers the ability to describe shapes in terms of their 3D elements where each element may be asemantic group of 3D objects, e.g., a brick wall, or an indivisible object,e.g. brick wall . PSML also provides a number of new language-specific capabilitiesthat allow for a rich variety of context-sensitive behaviors andpost-processing functions .…

Engineering Sketch Generation for Computer Aided Design

Engineering sketches form the 2D basis of parametric Computer-Aided Design, the foremost modeling paradigm for manufactured objects . Wepropose two generative models, CurveGen and TurtleGen, for engineering sketchgeneration . Both models generate curve primitives without the need for a sketchconstraint solver and explicitly consider topology for downstream use with 3D CAD modeling operations .…

Validation of image systems simulation technology using a Cornell Box

We describe and experimentally validate an end-to-end simulation of a digital camera . The simulation models the spectral radiance of 3D-scenes, formation of the spectral irradiance by multi-element optics, and conversion of their digital values by the image sensor . We quantify the accuracy of the simulation by comparing real and simulated images of a precisely constructed, three-dimensional high dynamic range test scene .…