scispace - formally typeset
Search or ask a question
Institution

TELECOM Lille 1

About: TELECOM Lille 1 is a based out in . It is known for research contribution in the topics: Facial recognition system & Markov chain Monte Carlo. The organization has 167 authors who have published 234 publications receiving 3384 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: A novel geometric framework for analyzing 3D faces, with the specific goals of comparing, matching, and averaging their shapes, which allows for formal statistical inferences, such as the estimation of missing facial parts using PCA on tangent spaces and computing average shapes.
Abstract: We propose a novel geometric framework for analyzing 3D faces, with the specific goals of comparing, matching, and averaging their shapes. Here we represent facial surfaces by radial curves emanating from the nose tips and use elastic shape analysis of these curves to develop a Riemannian framework for analyzing shapes of full facial surfaces. This representation, along with the elastic Riemannian metric, seems natural for measuring facial deformations and is robust to challenges such as large facial expressions (especially those with open mouths), large pose variations, missing parts, and partial occlusions due to glasses, hair, and so on. This framework is shown to be promising from both-empirical and theoretical-perspectives. In terms of the empirical evaluation, our results match or improve upon the state-of-the-art methods on three prominent databases: FRGCv2, GavabDB, and Bosphorus, each posing a different type of challenge. From a theoretical perspective, this framework allows for formal statistical inferences, such as the estimation of missing facial parts using PCA on tangent spaces and computing average shapes.

300 citations

Journal ArticleDOI
TL;DR: A pair of efficient and light-weight authentication protocols to enable remote WBAN users to anonymously enjoy healthcare service and outperform the existing schemes in terms of better trade-off between desirable security properties and computational overhead, nicely meeting the needs of WBANs.
Abstract: Wireless body area network (WBAN) has been recognized as one of the promising wireless sensor technologies for improving healthcare service, thanks to its capability of seamlessly and continuously exchanging medical information in real time. However, the lack of a clear in-depth defense line in such a new networking paradigm would make its potential users worry about the leakage of their private information, especially to those unauthenticated or even malicious adversaries. In this paper, we present a pair of efficient and light-weight authentication protocols to enable remote WBAN users to anonymously enjoy healthcare service. In particular, our authentication protocols are rooted with a novel certificateless signature (CLS) scheme, which is computational, efficient, and provably secure against existential forgery on adaptively chosen message attack in the random oracle model. Also, our designs ensure that application or service providers have no privilege to disclose the real identities of users. Even the network manager, which serves as private key generator in the authentication protocols, is prevented from impersonating legitimate users. The performance of our designs is evaluated through both theoretic analysis and experimental simulations, and the comparative studies demonstrate that they outperform the existing schemes in terms of better trade-off between desirable security properties and computational overhead, nicely meeting the needs of WBANs.

271 citations

Journal ArticleDOI
TL;DR: These ideas are demonstrated using a nearest-neighbor classifier on two 3D face databases: Florida State University and Notre Dame, highlighting a good recognition performance.
Abstract: We study shapes of facial surfaces for the purpose of face recognition. The main idea is to 1) represent surfaces by unions of level curves, called facial curves, of the depth function and 2) compare shapes of surfaces implicitly using shapes of facial curves. The latter is performed using a differential geometric approach that computes geodesic lengths between closed curves on a shape manifold. These ideas are demonstrated using a nearest-neighbor classifier on two 3D face databases: Florida State University and Notre Dame, highlighting a good recognition performance

233 citations

Journal ArticleDOI
TL;DR: In this article, quantitative data regarding the performance of low-cost sensors (LCS) against reference measurement are presented. And the authors highlight the possibility to have versatile LCS able to operate with multiple pollutants and preferably with transparent LCS data treatment.
Abstract: A growing number of companies have started commercializing low-cost sensors (LCS) that are said to be able to monitor air pollution in outdoor air. The benefit of the use of LCS is the increased spatial coverage when monitoring air quality in cities and remote locations. Today, there are hundreds of LCS commercially available on the market with costs ranging from several hundred to several thousand euro. At the same time, the scientific literature currently reports independent evaluation of the performance of LCS against reference measurements for about 110 LCS. These studies report that LCS are unstable and often affected by atmospheric conditions—cross-sensitivities from interfering compounds that may change LCS performance depending on site location. In this work, quantitative data regarding the performance of LCS against reference measurement are presented. This information was gathered from published reports and relevant testing laboratories. Other information was drawn from peer-reviewed journals that tested different types of LCS in research studies. Relevant metrics about the comparison of LCS systems against reference systems highlighted the most cost-effective LCS that could be used to monitor air quality pollutants with a good level of agreement represented by a coefficient of determination R2 > 0.75 and slope close to 1.0. This review highlights the possibility to have versatile LCS able to operate with multiple pollutants and preferably with transparent LCS data treatment.

187 citations

Journal ArticleDOI
TL;DR: A reputation system is designed for the platoon head vehicles by collecting and modeling their user vehicle's feedback, and an iterative filtering algorithm is designed to deal with the untruthful feedback from user vehicles.
Abstract: The fast development of intelligent transportation has paved the way for innovative techniques for highways, and an entirely new driving pattern of highway vehicular platooning might offer a solution to the persistent problem of road congestion, travel comfort, and road safety. In this vehicular platooning system, a platoon head vehicle provides platoon service to its user vehicles. However, some badly behaved platoon head vehicles may put the platoon in danger, which makes it crucial for user vehicles to distinguish and avoid them. In this paper, we propose a reliable trust-based platoon service recommendation scheme, which is called REPLACE, to help the user vehicles avoid choosing badly behaved platoon head vehicles. Specifically, at the core of REPLACE, a reputation system is designed for the platoon head vehicles by collecting and modeling their user vehicle's feedback. Then, an iterative filtering algorithm is designed to deal with the untruthful feedback from user vehicles. A detailed security analysis is given to show that our proposed REPLACE scheme is secure and robust against badmouth, ballot-stuffing, newcomers, and on–off attacks that exist in vehicular ad hoc networks (VANETs). In addition, we conduct extensive experiments to demonstrate the correctness, accuracy, and robustness of our proposed scheme.

165 citations


Authors

Showing all 167 results

Network Information
Related Institutions (5)
Carnegie Mellon University
104.3K papers, 5.9M citations

80% related

Microsoft
86.9K papers, 4.1M citations

80% related

Hewlett-Packard
59.8K papers, 1.4M citations

79% related

Google
39.8K papers, 2.1M citations

79% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202120
202019
201922
201821
20179
201612