5,990 research outputs found
On the use of SIFT features for face authentication
Several pattern recognition and classification techniques
have been applied to the biometrics domain. Among them,
an interesting technique is the Scale Invariant Feature
Transform (SIFT), originally devised for object recognition.
Even if SIFT features have emerged as a very powerful image
descriptors, their employment in face analysis context
has never been systematically investigated.
This paper investigates the application of the SIFT approach
in the context of face authentication. In order to determine
the real potential and applicability of the method,
different matching schemes are proposed and tested using
the BANCA database and protocol, showing promising results
Active User Authentication for Smartphones: A Challenge Data Set and Benchmark Results
In this paper, automated user verification techniques for smartphones are
investigated. A unique non-commercial dataset, the University of Maryland
Active Authentication Dataset 02 (UMDAA-02) for multi-modal user authentication
research is introduced. This paper focuses on three sensors - front camera,
touch sensor and location service while providing a general description for
other modalities. Benchmark results for face detection, face verification,
touch-based user identification and location-based next-place prediction are
presented, which indicate that more robust methods fine-tuned to the mobile
platform are needed to achieve satisfactory verification accuracy. The dataset
will be made available to the research community for promoting additional
research.Comment: 8 pages, 12 figures, 6 tables. Best poster award at BTAS 201
Image Hash Minimization for Tamper Detection
Tamper detection using image hash is a very common problem of modern days.
Several research and advancements have already been done to address this
problem. However, most of the existing methods lack the accuracy of tamper
detection when the tampered area is low, as well as requiring long image
hashes. In this paper, we propose a novel method objectively to minimize the
hash length while enhancing the performance at low tampered area.Comment: Published at the 9th International Conference on Advances in Pattern
Recognition, 201
EsPRESSo: Efficient Privacy-Preserving Evaluation of Sample Set Similarity
Electronic information is increasingly often shared among entities without
complete mutual trust. To address related security and privacy issues, a few
cryptographic techniques have emerged that support privacy-preserving
information sharing and retrieval. One interesting open problem in this context
involves two parties that need to assess the similarity of their datasets, but
are reluctant to disclose their actual content. This paper presents an
efficient and provably-secure construction supporting the privacy-preserving
evaluation of sample set similarity, where similarity is measured as the
Jaccard index. We present two protocols: the first securely computes the
(Jaccard) similarity of two sets, and the second approximates it, using MinHash
techniques, with lower complexities. We show that our novel protocols are
attractive in many compelling applications, including document/multimedia
similarity, biometric authentication, and genetic tests. In the process, we
demonstrate that our constructions are appreciably more efficient than prior
work.Comment: A preliminary version of this paper was published in the Proceedings
of the 7th ESORICS International Workshop on Digital Privacy Management (DPM
2012). This is the full version, appearing in the Journal of Computer
Securit
- …