scispace - formally typeset
Search or ask a question
Institution

Technische Universität Darmstadt

EducationDarmstadt, Germany
About: Technische Universität Darmstadt is a education organization based out in Darmstadt, Germany. It is known for research contribution in the topics: Neutron & Finite element method. The organization has 17316 authors who have published 40619 publications receiving 937916 citations. The organization is also known as: Darmstadt University of Technology & University of Darmstadt.


Papers
More filters
Book ChapterDOI
27 Jul 2009
TL;DR: This paper proposes for the first time a strongly privacy-enhanced face recognition system, which allows to efficiently hide both the biometrics and the result from the server that performs the matching operation, by using techniques from secure multiparty computation.
Abstract: Face recognition is increasingly deployed as a means to unobtrusively verify the identity of people. The widespread use of biometrics raises important privacy concerns, in particular if the biometric matching process is performed at a central or untrusted server, and calls for the implementation of Privacy-Enhancing Technologies. In this paper we propose for the first time a strongly privacy-enhanced face recognition system, which allows to efficiently hide both the biometrics and the result from the server that performs the matching operation, by using techniques from secure multiparty computation. We consider a scenario where one party provides a face image, while another party has access to a database of facial templates. Our protocol allows to jointly run the standard Eigenfaces recognition algorithm in such a way that the first party cannot learn from the execution of the protocol more than basic parameters of the database, while the second party does not learn the input image or the result of the recognition process. At the core of our protocol lies an efficient protocol for securely comparing two Pailler-encrypted numbers. We show through extensive experiments that the system can be run efficiently on conventional hardware.

546 citations

Journal ArticleDOI
TL;DR: The ALICE Time-Projection Chamber (TPC) as discussed by the authors is the main device for pattern recognition, tracking, and identification of charged particles in the ALICE experiment at the CERN LHC.
Abstract: The design, construction, and commissioning of the ALICE Time-Projection Chamber (TPC) is described. It is the main device for pattern recognition, tracking, and identification of charged particles in the ALICE experiment at the CERN LHC. The TPC is cylindrical in shape with a volume close to 90 m(3) and is operated in a 0.5T solenoidal magnetic field parallel to its axis. In this paper we describe in detail the design considerations for this detector for operation in the extreme multiplicity environment of central Pb-Pb collisions at LHC energy. The implementation of the resulting requirements into hardware (field cage, read-out chambers, electronics), infrastructure (gas and cooling system, laser-calibration system), and software led to many technical innovations which are described along with a presentation of all the major components of the detector, as currently realized. We also report on the performance achieved after completion of the first round of stand-alone calibration runs and demonstrate results close to those specified in the TPC Technical Design Report. (C) 2010 CERN for the benefit of the ALICE collaboration. Published by Elsevier B.V. All rights reserved. (Less)

545 citations

Proceedings ArticleDOI
01 Jul 2017
TL;DR: In this paper, the authors proposed a methodology for benchmarking denoising techniques on real photographs by capturing pairs of images with different ISO values and appropriately adjusted exposure times, where the nearly noise-free low-ISO image serves as reference.
Abstract: Lacking realistic ground truth data, image denoising techniques are traditionally evaluated on images corrupted by synthesized i.i.d. Gaussian noise. We aim to obviate this unrealistic setting by developing a methodology for benchmarking denoising techniques on real photographs. We capture pairs of images with different ISO values and appropriately adjusted exposure times, where the nearly noise-free low-ISO image serves as reference. To derive the ground truth, careful post-processing is needed. We correct spatial misalignment, cope with inaccuracies in the exposure parameters through a linear intensity transform based on a novel heteroscedastic Tobit regression model, and remove residual low-frequency bias that stems, e.g., from minor illumination changes. We then capture a novel benchmark dataset, the Darmstadt Noise Dataset (DND), with consumer cameras of differing sensor sizes. One interesting finding is that various recent techniques that perform well on synthetic noise are clearly outperformed by BM3D on photographs with real noise. Our benchmark delineates realistic evaluation scenarios that deviate strongly from those commonly used in the scientific literature.

540 citations

Journal ArticleDOI
TL;DR: This work shows that a simple (weighted) voting strategy minimizes risk with respect to the well-known Spearman rank correlation and compares RPC to existing label ranking methods, which are based on scoring individual labels instead of comparing pairs of labels.

538 citations

Posted Content
01 Jan 2011
TL;DR: In this paper, the authors compared four seeding strategies in two complementary small-scale field experiments, as well as in one real-life viral marketing campaign involving more than 200,000 customers of a mobile phone service provider.
Abstract: Seeding strategies have strong influences on the success of viral marketing campaigns, but previous studies using computer simulations and analytical models have produced conflicting recommendations about the optimal seeding strategy. This study compares four seeding strategies in two complementary small-scale field experiments, as well as in one real-life viral marketing campaign involving more than 200,000 customers of a mobile phone service provider. The empirical results show that the best seeding strategies can be up to eight times more successful than other seeding strategies. Seeding to well-connected people is the most successful approach because these attractive seeding points are more likely to participate in viral marketing campaigns. This finding contradicts a common assumption in other studies. Well-connected people also actively use their greater reach but do not have more influence on their peers than do less well-connected people.

534 citations


Authors

Showing all 17627 results

NameH-indexPapersCitations
Yang Gao1682047146301
Herbert A. Simon157745194597
Stephen Boyd138822151205
Jun Chen136185677368
Harold A. Mooney135450100404
Bernt Schiele13056870032
Sascha Mehlhase12685870601
Yuri S. Kivshar126184579415
Michael Wagner12435154251
Wolf Singer12458072591
Tasawar Hayat116236484041
Edouard Boos11675764488
Martin Knapp106106748518
T. Kuhl10176140812
Peter Braun-Munzinger10052734108
Network Information
Related Institutions (5)
Karlsruhe Institute of Technology
82.1K papers, 2.1M citations

96% related

École Polytechnique Fédérale de Lausanne
98.2K papers, 4.3M citations

94% related

RWTH Aachen University
96.2K papers, 2.5M citations

94% related

ETH Zurich
122.4K papers, 5.1M citations

94% related

Georgia Institute of Technology
119K papers, 4.6M citations

93% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023135
2022624
20212,462
20202,585
20192,609
20182,493