Evaluating the Complexity of Databases for Person Identification and Verification
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We present a method of formal description of the action semantics in smart objects. Smart objects were primarily used for behavioral animation in the past. We demonstrate, how a formally described semantics can be used for action planning purposes by intel ...
Using arguments developed by De Giorgi in the 1950's, it is possible to prove the regularity of the solutions to a vast class of variational problems in the Euclidean space. The main goal of the present thesis is to extend these results to the more abstrac ...
The issues of fusion with client-dependent and confidence information have been well studied separately in biometric authentication. In this study, we propose to take advantage of both sources of information in a discriminative framework. Initially, each s ...
Mammals adapt to a rapidly changing world because of the sophisticated perceptual and cognitive function enabled by the neocortex. The neocortex, which has expanded to constitute nearly 80% of the human brain seems to have arisen from repeated duplication ...
Cursive character recognition is a challenging task due to high variability and intrinsic ambiguity of cursive letters. This paper presents \emph{C-Cube} (Cursive Character Challenge), a new public-domain cursive character database. \emph{C-Cube} contains ...
The complexity of nowadays, algorithms in terms of number of lines of codes and cross-relations among processing algorithms that are activated by specific input signals, goes far beyond what the designer can reasonably grasp from the “pencil & paper” analy ...
In this paper we consider the problem of computing sets of observable states for discrete-time, piecewise affine systems. When the maximal set of observable states is full-dimensional, we provide an algorithm for reconstructing it up to a zero measure set. ...
We address the problem of how a data-oriented, structured overlay networks can be constructed efficiently from scratch in a self-organized way, a problem that has so far not been addressed in the literature. This problem occurs when using overlay networks ...
We investigate the learning of the appearance of an object from a single image of it. Instead of using a large number of pictures of an object to be recognized, we use pictures of other objects to learn invariance to noise and variations in pose and illumi ...
In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which req ...
