標(biāo)題: Titlebook: Biometrics and ID Management; COST 2101 European W Claus Vielhauer,Jana Dittmann,Michael C. Fairhurst Conference proceedings 2011 Springer [打印本頁] 作者: 作業(yè) 時(shí)間: 2025-3-21 19:42
書目名稱Biometrics and ID Management影響因子(影響力)
書目名稱Biometrics and ID Management影響因子(影響力)學(xué)科排名
書目名稱Biometrics and ID Management網(wǎng)絡(luò)公開度
書目名稱Biometrics and ID Management網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Biometrics and ID Management被引頻次
書目名稱Biometrics and ID Management被引頻次學(xué)科排名
書目名稱Biometrics and ID Management年度引用
書目名稱Biometrics and ID Management年度引用學(xué)科排名
書目名稱Biometrics and ID Management讀者反饋
書目名稱Biometrics and ID Management讀者反饋學(xué)科排名
作者: MANIA 時(shí)間: 2025-3-21 21:17 作者: Tdd526 時(shí)間: 2025-3-22 01:37
Attack against Robust Watermarking-Based Multimodal Biometric Recognition Systems biometric sample data. In case robust embedding is used as the sole means of security, tampering attacks can be mounted. The results of a corresponding attack against a multimodal iris recognition scheme show, that in this environment either semi-fragile watermarking or additional classical cryptog作者: 擺動(dòng) 時(shí)間: 2025-3-22 06:32 作者: 墊子 時(shí)間: 2025-3-22 09:56
Eigen-Model Projections for Protected On-line Signature Recognitionhe enrolled users, and directly affects the successful deployment of the system itself. In this paper we propose a protected on-line signature recognition system where the properties of Universal Background Models are exploited to provide a small dimensionality and a limited intra-class variability 作者: Malleable 時(shí)間: 2025-3-22 16:41 作者: fetter 時(shí)間: 2025-3-22 20:44 作者: strdulate 時(shí)間: 2025-3-22 21:21
Hill-Climbing Attack Based on the Uphill Simplex Algorithm and Its Application to Signature Verifica matcher are used in this approach to adapt iteratively an initial estimate of the attacked template to the specificities of the client being attacked. The proposed attack is evaluated on a competitive feature-based signature verification system over both the MCYT and the BiosecurID databases (compr作者: 桉樹 時(shí)間: 2025-3-23 04:08 作者: Dorsal 時(shí)間: 2025-3-23 09:03
Performance Evaluation in Open-Set Speaker Identificationolves first identifying the speaker model in the database that best matches the given test utterance, and then determining if the test utterance has actually been produced by the speaker associated with the best-matched model. Whilst, conventionally, the performance of each of these two sub-processe作者: meditation 時(shí)間: 2025-3-23 10:59
Effects of Long-Term Ageing on Speaker VerificationIn this work, we examine the effect of long-term vocal ageing on a speaker verification system. On a cohort of 13 adult speakers, using a conventional GMM-UBM system, we carry out longitudinal testing of each speaker across a time span of 30-40 years. We uncover a progressive degradation in verifica作者: 招募 時(shí)間: 2025-3-23 14:21 作者: 致敬 時(shí)間: 2025-3-23 21:03
Entropy-Based Iterative Face Classificationct the face classes and a clustering algorithm to partition the projected face data, thus forming a set of discriminant clusters. Then, an iterative process creates subsets, whose cardinality is defined by an entropy-based measure, that contain the most useful clusters. The best match to the test fa作者: 無王時(shí)期, 時(shí)間: 2025-3-24 01:42
Local Binary LDA for Face Recognitiontraction of features from images that we have called local binary linear discriminant analysis (LBLDA), which combines the good characteristics of both LDA and local feature extraction methods. We demonstrated that binarizing the feature vector obtained by LBLDA significantly improves the recognitio作者: 表臉 時(shí)間: 2025-3-24 05:29
From 3D Faces to Biometric Identitiesshape for the face surface is now a feasible solution to overcome this problem and make it well-posed. This paper proposes a completely automatic algorithm for face registration and matching. The algorithm is based on the extraction of stable 3D facial features characterizing the face and the subseq作者: fulmination 時(shí)間: 2025-3-24 09:11
Face Classification via Sparse Approximation factors as illumination, expression, pose, occlusion and resolution. We investigate the potential of a method where the face recognition problem is cast as a sparse approximation. The sparse approximation provides a significant amount of robustness beneficial in mitigating various adverse effects. 作者: circuit 時(shí)間: 2025-3-24 10:58 作者: Bother 時(shí)間: 2025-3-24 16:54 作者: 一小塊 時(shí)間: 2025-3-24 21:14 作者: 牛馬之尿 時(shí)間: 2025-3-25 02:15 作者: 轉(zhuǎn)向 時(shí)間: 2025-3-25 03:48
Dmitry Berdinsky,Prohrak Kruengthomyansidered in this paper, which is in principle similar to the method used for computing the diarisation error rate. The paper details the above approach for assessing the performance of open-set speaker identification and presents an analysis of its characteristics.作者: Ardent 時(shí)間: 2025-3-25 08:49 作者: 嚴(yán)重傷害 時(shí)間: 2025-3-25 14:08 作者: 孤獨(dú)無助 時(shí)間: 2025-3-25 16:33 作者: 內(nèi)部 時(shí)間: 2025-3-25 23:16
Adult Face Recognition in Score-Age-Quality Classification Spacend expression) aware decision boundary compares favorably with the conventional face verification approach, which uses decision threshold calculated only in the score space at the time of enrolment. The proposed approach is evaluated on the MORPH database.作者: temperate 時(shí)間: 2025-3-26 00:10 作者: 法律的瑕疵 時(shí)間: 2025-3-26 06:15 作者: miracle 時(shí)間: 2025-3-26 10:21
On Using High-Definition Body Worn Cameras for Face Recognition from a DistanceD video result in better recognition accuracy, compared to SD video. This scenario resembles real-life conditions of video surveillance and law-enforcement activities. However, at a close range, face data obtained from SD video result in similar, if not better recognition accuracy than using HD face data of the same range.作者: 前奏曲 時(shí)間: 2025-3-26 14:26
0302-9743 2101 International Workshop, BIOID 2011, held in Brandenburg (Havel), Germany, in March 2011. The 25 revised full papers presented were carefully reviewed and selected from numerous submissions and are completed by an introduction on COST. The papers are organized in topical main sections on theory 作者: SEEK 時(shí)間: 2025-3-26 18:50 作者: 提名的名單 時(shí)間: 2025-3-26 21:52
Shift-Reduce Parsers for Transition Networksng attack against a multimodal iris recognition scheme show, that in this environment either semi-fragile watermarking or additional classical cryptographic means need to be applied to secure the system against the demonstrated attack.作者: IVORY 時(shí)間: 2025-3-27 02:44
Fabian Birkmann,Stefan Milius,Henning Urbatast as a sparse approximation. The sparse approximation provides a significant amount of robustness beneficial in mitigating various adverse effects. The study is conducted experimentally using the Extended Yale Face B database and the results are compared against the Fisher classifier benchmark.作者: HATCH 時(shí)間: 2025-3-27 08:19 作者: Texture 時(shí)間: 2025-3-27 10:48 作者: 小木槌 時(shí)間: 2025-3-27 16:07 作者: Vulnerable 時(shí)間: 2025-3-27 19:14 作者: 共棲 時(shí)間: 2025-3-28 01:21
Da-Jung Cho,Yo-Sub Han,Hwee Kimsignature representation. The reported experimental results show that the employed signature representation and protection scheme allow to reach high recognition accuracy while providing protection to the considered biometric data.作者: 討好女人 時(shí)間: 2025-3-28 03:10 作者: 橫截,橫斷 時(shí)間: 2025-3-28 06:22 作者: Mast-Cell 時(shí)間: 2025-3-28 14:22 作者: ENNUI 時(shí)間: 2025-3-28 18:11
Dmitry Berdinsky,Prohrak Kruengthomyace is found when one final face class is retained. The standard UMIST and XM2VTS databases have been utilized to evaluate the performance of the proposed algorithm. Results show that it provides a good solution to the face classification problem.作者: 貞潔 時(shí)間: 2025-3-28 19:46 作者: 補(bǔ)助 時(shí)間: 2025-3-29 02:45 作者: aesthetician 時(shí)間: 2025-3-29 05:06 作者: CBC471 時(shí)間: 2025-3-29 09:27 作者: Optic-Disk 時(shí)間: 2025-3-29 13:10
Features Extracted Using Frequency-Time Analysis Approach from Nyquist Filter Bank and Gaussian FiltST database with 130 speakers using Gaussian mixture speaker model. Results reveal that, the feature sets extracted using frequency-time analysis approach performs significantly better compared to the feature set extracted using time-frequency analysis approach.作者: 袖章 時(shí)間: 2025-3-29 17:32
Entropy-Based Iterative Face Classificationce is found when one final face class is retained. The standard UMIST and XM2VTS databases have been utilized to evaluate the performance of the proposed algorithm. Results show that it provides a good solution to the face classification problem.作者: chandel 時(shí)間: 2025-3-29 20:18
Local Binary LDA for Face Recognitionn accuracy. The experimental results demonstrate the feasibility of the method for face recognition as follows: on XM2VTS face image database, a recognition accuracy of 96.44% is obtained using LBLDA, which is an improvement over LDA (94.41%). LBLDA can also outperform LDA in terms of computation speed.作者: 熱情贊揚(yáng) 時(shí)間: 2025-3-30 00:15
0302-9743 andsystems, handwriting authentication, speaker authentication, face recognition, multibiometric authentication, and on biometrics and forensics.978-3-642-19529-7978-3-642-19530-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 用樹皮 時(shí)間: 2025-3-30 07:27
https://doi.org/10.1007/978-3-642-19530-3biometric cryptosystems; biometric recognition; face classification; face verification; fingerprint anal作者: mosque 時(shí)間: 2025-3-30 12:08 作者: Ingredient 時(shí)間: 2025-3-30 15:13
Claus Vielhauer,Jana Dittmann,Michael C. FairhurstFast conference proceedings.Up to date results.State-of-the-art report作者: Orthodontics 時(shí)間: 2025-3-30 18:59 作者: 光亮 時(shí)間: 2025-3-30 23:20 作者: 贊美者 時(shí)間: 2025-3-31 03:42 作者: 提名的名單 時(shí)間: 2025-3-31 05:14
Shift-Reduce Parsers for Transition Networks biometric sample data. In case robust embedding is used as the sole means of security, tampering attacks can be mounted. The results of a corresponding attack against a multimodal iris recognition scheme show, that in this environment either semi-fragile watermarking or additional classical cryptog作者: 激怒某人 時(shí)間: 2025-3-31 10:41 作者: PAD416 時(shí)間: 2025-3-31 15:53
Da-Jung Cho,Yo-Sub Han,Hwee Kimhe enrolled users, and directly affects the successful deployment of the system itself. In this paper we propose a protected on-line signature recognition system where the properties of Universal Background Models are exploited to provide a small dimensionality and a limited intra-class variability 作者: NAVEN 時(shí)間: 2025-3-31 19:55
Lecture Notes in Computer Sciencert cards are correctly authenticated such as with cryptographic signatures, attacks to biometric databases are reduced like template replacement or cross-matching of biometric databases. Furthermore, smart cards are used to match reference data with the actual data of a claimed identity (e.g. [1], [作者: 鋪?zhàn)?nbsp; 時(shí)間: 2025-4-1 00:04 作者: 模仿 時(shí)間: 2025-4-1 03:29 作者: MODE 時(shí)間: 2025-4-1 07:54
Lecture Notes in Computer Scienced), which classification methods are appropriate, user acceptability issues, and so on. Machine learning techniques need as much information as possible to maximise accuracy, but biometric samples are not necessarily straightforward to acquire and usability factors can be very influential. This pape作者: Thyroid-Gland 時(shí)間: 2025-4-1 13:27
Dmitry Berdinsky,Prohrak Kruengthomyaolves first identifying the speaker model in the database that best matches the given test utterance, and then determining if the test utterance has actually been produced by the speaker associated with the best-matched model. Whilst, conventionally, the performance of each of these two sub-processe作者: itinerary 時(shí)間: 2025-4-1 15:28
Lecture Notes in Computer ScienceIn this work, we examine the effect of long-term vocal ageing on a speaker verification system. On a cohort of 13 adult speakers, using a conventional GMM-UBM system, we carry out longitudinal testing of each speaker across a time span of 30-40 years. We uncover a progressive degradation in verifica作者: PHAG 時(shí)間: 2025-4-1 18:59 作者: 斷斷續(xù)續(xù) 時(shí)間: 2025-4-2 00:40
Dmitry Berdinsky,Prohrak Kruengthomyact the face classes and a clustering algorithm to partition the projected face data, thus forming a set of discriminant clusters. Then, an iterative process creates subsets, whose cardinality is defined by an entropy-based measure, that contain the most useful clusters. The best match to the test fa
