Pub Date : 2015-09-01DOI: 10.1109/WSCNIS.2015.7368287
M. Safavi, M. Shafieian
Upcoming Wireless networks have been emerging in the real world applications as well as in researching. Multihop characteristics of ad hoc networks may lead to most of their challenges. Selfishness is an inevitable behavior in these networks and many researches have been performing to thwart it. In this paper we investigate some game theory selfish model and incentive VCG payments to motivate relay ad hoc nodes for cooperation in forwarding packets in some probabilistic ad hoc scenarios. The throughput of each scenario in simulation is shown as well as the cases where such payments are not efficient. Our proposed method for improvement payment especially in the challenging single route network scenario is suggested.
{"title":"Thwarting the probabilistic selfish behaviours in packet forwarding of multihop ad hoc networks","authors":"M. Safavi, M. Shafieian","doi":"10.1109/WSCNIS.2015.7368287","DOIUrl":"https://doi.org/10.1109/WSCNIS.2015.7368287","url":null,"abstract":"Upcoming Wireless networks have been emerging in the real world applications as well as in researching. Multihop characteristics of ad hoc networks may lead to most of their challenges. Selfishness is an inevitable behavior in these networks and many researches have been performing to thwart it. In this paper we investigate some game theory selfish model and incentive VCG payments to motivate relay ad hoc nodes for cooperation in forwarding packets in some probabilistic ad hoc scenarios. The throughput of each scenario in simulation is shown as well as the cases where such payments are not efficient. Our proposed method for improvement payment especially in the challenging single route network scenario is suggested.","PeriodicalId":253256,"journal":{"name":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123420222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-09-01DOI: 10.1109/WSCNIS.2015.7368294
Mohammad Hamad, V. Prevelakis
The rapid development of the embedded systems and the wide use of them in many sensitive fields require safeguarding their communications. Internet Protocol Security (IPsec) is widely used to solve network security problems by providing confidentiality and integrity for the communications in the network, but it introduces communication overhead. This overhead becomes a critical factor with embedded systems because of their low computing power and limited resources. In this research, we studied the overhead of using embedded IPsec in constrained resource systems, which run microkernel operating system (OS), in terms of the network latency and throughput. To conduct our experiment first, we ran the test with an unmodified network stack, and then we ran the same test with the modified network stack which contains the IPsec implementation. Later, we compared the results obtained from these two sets of experiments to examine the overhead. Our research demonstrated that the overhead imposed by IPsec protocols is small and well within the capabilities of even low cost microcontrollers such as the one used in the Raspberry Pi computer.
{"title":"Implementation and performance evaluation of embedded IPsec in microkernel OS","authors":"Mohammad Hamad, V. Prevelakis","doi":"10.1109/WSCNIS.2015.7368294","DOIUrl":"https://doi.org/10.1109/WSCNIS.2015.7368294","url":null,"abstract":"The rapid development of the embedded systems and the wide use of them in many sensitive fields require safeguarding their communications. Internet Protocol Security (IPsec) is widely used to solve network security problems by providing confidentiality and integrity for the communications in the network, but it introduces communication overhead. This overhead becomes a critical factor with embedded systems because of their low computing power and limited resources. In this research, we studied the overhead of using embedded IPsec in constrained resource systems, which run microkernel operating system (OS), in terms of the network latency and throughput. To conduct our experiment first, we ran the test with an unmodified network stack, and then we ran the same test with the modified network stack which contains the IPsec implementation. Later, we compared the results obtained from these two sets of experiments to examine the overhead. Our research demonstrated that the overhead imposed by IPsec protocols is small and well within the capabilities of even low cost microcontrollers such as the one used in the Raspberry Pi computer.","PeriodicalId":253256,"journal":{"name":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126854150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-09-01DOI: 10.1109/WSCNIS.2015.7368279
Jianping Li, Si Chen
The sphere decoding (SD) algorithm based on Schnorr-Euchner (S-E) strategy can reduce the complexity for multiple-input multiple-output (MIMO) systems to find the maximum likelihood (ML) solution by updating the search radius whenever a new lattice point was found. In this paper, we propose an improved scheme to reduce the complexity of sphere decoding. In the new method, a factor was introduced for speeding up contraction of sphere radius in each layer of the searching tree. The contraction factor was controlled by signal to noise ratio (SNR) and thus can reduce the complexity especially in low SNR region. Simulation results show that the proposed SD algorithm based on a contraction factor (SD-CF) can efficiently reduce the complexity with negligible performance degradation contrasting to traditional SD.
{"title":"An improved reduced-complexity scheme to accelerate sphere decoding for MIMO systems","authors":"Jianping Li, Si Chen","doi":"10.1109/WSCNIS.2015.7368279","DOIUrl":"https://doi.org/10.1109/WSCNIS.2015.7368279","url":null,"abstract":"The sphere decoding (SD) algorithm based on Schnorr-Euchner (S-E) strategy can reduce the complexity for multiple-input multiple-output (MIMO) systems to find the maximum likelihood (ML) solution by updating the search radius whenever a new lattice point was found. In this paper, we propose an improved scheme to reduce the complexity of sphere decoding. In the new method, a factor was introduced for speeding up contraction of sphere radius in each layer of the searching tree. The contraction factor was controlled by signal to noise ratio (SNR) and thus can reduce the complexity especially in low SNR region. Simulation results show that the proposed SD algorithm based on a contraction factor (SD-CF) can efficiently reduce the complexity with negligible performance degradation contrasting to traditional SD.","PeriodicalId":253256,"journal":{"name":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115526581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-09-01DOI: 10.1109/WSCNIS.2015.7368276
Hamdi Boukamcha, Mohamed Elhallek, Mohamed Atri, F. Smach
This paper presents our methodology for Landmark Point detection to improve 3D face recognition in a presence of variant facial expression. The objective was to develop an automatic process for distinguishing and segmenting to be embedded in a 3D face recognition system using only 3D Point Distribution Model (PDM) as input. The approach used hydride method to extract this features from the surface curvature information. Landmark Localization is done on the segmented face via finding the change that decreases the deviation of the model from the mean profile. Face registering is achieved using previous anthropometric information and the localized landmarks. The results confirm that the method used is accurate and robust for the proposed application.
{"title":"3D face landmark auto detection","authors":"Hamdi Boukamcha, Mohamed Elhallek, Mohamed Atri, F. Smach","doi":"10.1109/WSCNIS.2015.7368276","DOIUrl":"https://doi.org/10.1109/WSCNIS.2015.7368276","url":null,"abstract":"This paper presents our methodology for Landmark Point detection to improve 3D face recognition in a presence of variant facial expression. The objective was to develop an automatic process for distinguishing and segmenting to be embedded in a 3D face recognition system using only 3D Point Distribution Model (PDM) as input. The approach used hydride method to extract this features from the surface curvature information. Landmark Localization is done on the segmented face via finding the change that decreases the deviation of the model from the mean profile. Face registering is achieved using previous anthropometric information and the localized landmarks. The results confirm that the method used is accurate and robust for the proposed application.","PeriodicalId":253256,"journal":{"name":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127102181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-09-01DOI: 10.1109/WSCNIS.2015.7368289
M. H. Taieb, J. Chouinard
This paper investigates reliable and secure transmissions over the Gaussian wiretap channel. A physical layer coding scheme based on Low-Density-Parity-Check (LDPC) codes with granular Hybrid Automatic Repeat reQuest(HARQ) protocol is presented. Increasing the HARQ granularity aims at sending coded data at the minimum rate required for legitimate successful decoding. This minimizes the information leakage that may benefit to eavesdropping. It will be shown that the granularity increases the frame error rate of the eavesdropper. Since the secrecy level can be assessed through the bit error rate (BER) at the unintended receiver, intraframe and interframe error contamination is employed to convert the loss of only few packets into much higher BERs. After obtaining the BERs at the legitimate and illegitimate receivers the reliable and secret regions can be determined. It is observed that with granular HARQ and interframe error contamination, regions that are reliable and secure at the same time are expanded.
{"title":"Reliable and secure regions for the Gaussian wiretap channel using LDPC codes with granular HARQ","authors":"M. H. Taieb, J. Chouinard","doi":"10.1109/WSCNIS.2015.7368289","DOIUrl":"https://doi.org/10.1109/WSCNIS.2015.7368289","url":null,"abstract":"This paper investigates reliable and secure transmissions over the Gaussian wiretap channel. A physical layer coding scheme based on Low-Density-Parity-Check (LDPC) codes with granular Hybrid Automatic Repeat reQuest(HARQ) protocol is presented. Increasing the HARQ granularity aims at sending coded data at the minimum rate required for legitimate successful decoding. This minimizes the information leakage that may benefit to eavesdropping. It will be shown that the granularity increases the frame error rate of the eavesdropper. Since the secrecy level can be assessed through the bit error rate (BER) at the unintended receiver, intraframe and interframe error contamination is employed to convert the loss of only few packets into much higher BERs. After obtaining the BERs at the legitimate and illegitimate receivers the reliable and secret regions can be determined. It is observed that with granular HARQ and interframe error contamination, regions that are reliable and secure at the same time are expanded.","PeriodicalId":253256,"journal":{"name":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127524172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-09-01DOI: 10.1109/WSCNIS.2015.7368290
M. Talbi, Siraa Ben Ftima, A. Cherif
In this paper we propose a new image watermarking technique using data compression. This technique consists at first step in getting the first color in case of RGB image and obtaining a two dimensional matrix. Then the 2-D lifting wavelet transform (LWT2) (Sema KAYHAN, Ergun ERçELEB, 2011), is applied to this two dimensional matrix or image in order to have four sub-images, cA1, cH 1, cV1 and cD 1. Then the Discrete Cosine Transform (DCT) is applied to cA1 and we insert the Watermark signal into the obtained DCT values. This Watermark signal is obtained after compression of the original signal which is a speech waveform. This compression is performed in the wavelet domain. After inserting the watermark signal, the inverse of DCT is applied in order to obtain the sub-image, cA11. The watermarked image is finally obtained by the application of the inverse of LWT2, ILWT2, to the four sub-images, cA11, cH 1, cV1 and cD 1. The extraction process is simply subtracting the original DCT coefficients from the watermarked sub-image (cA11) ones. After extracting the compressed signal, the latter is decompressed in order to recover the original signal. The proposed image watermarking technique is applied on a number of color images and a speech waveform is used in experiments. The obtained results from PSNR, MSE SSIM, SIM and SNR, show the performance of the proposed image watermarking technique.
{"title":"Image watermarking using data compression","authors":"M. Talbi, Siraa Ben Ftima, A. Cherif","doi":"10.1109/WSCNIS.2015.7368290","DOIUrl":"https://doi.org/10.1109/WSCNIS.2015.7368290","url":null,"abstract":"In this paper we propose a new image watermarking technique using data compression. This technique consists at first step in getting the first color in case of RGB image and obtaining a two dimensional matrix. Then the 2-D lifting wavelet transform (LWT2) (Sema KAYHAN, Ergun ERçELEB, 2011), is applied to this two dimensional matrix or image in order to have four sub-images, cA1, cH 1, cV1 and cD 1. Then the Discrete Cosine Transform (DCT) is applied to cA1 and we insert the Watermark signal into the obtained DCT values. This Watermark signal is obtained after compression of the original signal which is a speech waveform. This compression is performed in the wavelet domain. After inserting the watermark signal, the inverse of DCT is applied in order to obtain the sub-image, cA11. The watermarked image is finally obtained by the application of the inverse of LWT2, ILWT2, to the four sub-images, cA11, cH 1, cV1 and cD 1. The extraction process is simply subtracting the original DCT coefficients from the watermarked sub-image (cA11) ones. After extracting the compressed signal, the latter is decompressed in order to recover the original signal. The proposed image watermarking technique is applied on a number of color images and a speech waveform is used in experiments. The obtained results from PSNR, MSE SSIM, SIM and SNR, show the performance of the proposed image watermarking technique.","PeriodicalId":253256,"journal":{"name":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122356931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-09-01DOI: 10.1109/WSCNIS.2015.7368277
Afef Kchaou, W. El Hadj Youssef, R. Tourki
Complexity of embedded systems becomes more and more popular which integrates a hardware and software parts on common platform. This complexity can be inferred on the performance of such systems. This paper, explains the characteristics of LEON3 Soft Core processor and its implementation for several configurations, including single, dual, tri, and quad cores, as well as with and without the hardware FPU and cache system. We propose a performance evaluation methodology affected by a benchmark test. Measuring the performance of such systems becomes a very important task for any embedded system design process. The performance of such systems is affected by a benchmark test discussed for different configuration of LEON3 processor.
{"title":"Performance evaluation of multicore LEON3 processor","authors":"Afef Kchaou, W. El Hadj Youssef, R. Tourki","doi":"10.1109/WSCNIS.2015.7368277","DOIUrl":"https://doi.org/10.1109/WSCNIS.2015.7368277","url":null,"abstract":"Complexity of embedded systems becomes more and more popular which integrates a hardware and software parts on common platform. This complexity can be inferred on the performance of such systems. This paper, explains the characteristics of LEON3 Soft Core processor and its implementation for several configurations, including single, dual, tri, and quad cores, as well as with and without the hardware FPU and cache system. We propose a performance evaluation methodology affected by a benchmark test. Measuring the performance of such systems becomes a very important task for any embedded system design process. The performance of such systems is affected by a benchmark test discussed for different configuration of LEON3 processor.","PeriodicalId":253256,"journal":{"name":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131476385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-09-01DOI: 10.1109/WSCNIS.2015.7368305
M. Radhouene, M. Najjar, R. Houria
In this paper, two-dimension band pass filters are proposed to design CWDM de-multiplexer which permit to separate two telecom wavelengths (1.31 μm and 1.55 μm). The square lattice with TE mode are adapted to designed the proposed de-multiplexer with help Photonic Band Gap (PBG). The structure has been designed using silicon rods, refractive index 3.45, which are embedded in air. The Plane Wave Expansion (PWE) method and 2D Finite Difference Time Domain (FDTD) method are employed to calculate the PBG range and output spectra of the filter. The localization property of photonic crystal has been used to guide the wavelengths in two different output with high transmission.
{"title":"Optimization of WDM demultiplexer based on photonic crystal","authors":"M. Radhouene, M. Najjar, R. Houria","doi":"10.1109/WSCNIS.2015.7368305","DOIUrl":"https://doi.org/10.1109/WSCNIS.2015.7368305","url":null,"abstract":"In this paper, two-dimension band pass filters are proposed to design CWDM de-multiplexer which permit to separate two telecom wavelengths (1.31 μm and 1.55 μm). The square lattice with TE mode are adapted to designed the proposed de-multiplexer with help Photonic Band Gap (PBG). The structure has been designed using silicon rods, refractive index 3.45, which are embedded in air. The Plane Wave Expansion (PWE) method and 2D Finite Difference Time Domain (FDTD) method are employed to calculate the PBG range and output spectra of the filter. The localization property of photonic crystal has been used to guide the wavelengths in two different output with high transmission.","PeriodicalId":253256,"journal":{"name":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132343916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-09-01DOI: 10.1109/WSCNIS.2015.7368280
Mohamed Grissa, A. Yavuz, B. Hamdaoui
Cognitive Radio Networks (CRNs) enable opportunistic access to the licensed channels by allowing secondary users (SUs) to exploit vacant channel opportunities. One effective technique through which SU s acquire whether a channel is vacant is using geo-location databases. Despite their usefulness, geo-location database-driven CRN s suffer from location privacy threats, merely because SUs have to query the database with their exact locations in order to learn about spectrum availability. In this paper, we propose an efficient scheme for database-driven CRN s that preserves the location privacy of SU s while allowing them to learn about available channels in their vicinity. We present a tradeoff between offering an ideal location privacy while having a high communication overhead and compromising some of the users' coordinates at the benefit of incurring much lower overhead. We also study the effectiveness of the proposed scheme under various system parameters.
{"title":"Cuckoo filter-based location-privacy preservation in database-driven cognitive radio networks","authors":"Mohamed Grissa, A. Yavuz, B. Hamdaoui","doi":"10.1109/WSCNIS.2015.7368280","DOIUrl":"https://doi.org/10.1109/WSCNIS.2015.7368280","url":null,"abstract":"Cognitive Radio Networks (CRNs) enable opportunistic access to the licensed channels by allowing secondary users (SUs) to exploit vacant channel opportunities. One effective technique through which SU s acquire whether a channel is vacant is using geo-location databases. Despite their usefulness, geo-location database-driven CRN s suffer from location privacy threats, merely because SUs have to query the database with their exact locations in order to learn about spectrum availability. In this paper, we propose an efficient scheme for database-driven CRN s that preserves the location privacy of SU s while allowing them to learn about available channels in their vicinity. We present a tradeoff between offering an ideal location privacy while having a high communication overhead and compromising some of the users' coordinates at the benefit of incurring much lower overhead. We also study the effectiveness of the proposed scheme under various system parameters.","PeriodicalId":253256,"journal":{"name":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133012722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-09-01DOI: 10.1109/WSCNIS.2015.7368284
R. M. Jomaa, Md. Saiful Islam, H. Mathkour
Heartbeat signal is an emerging biometric modality which is getting attention for its robustness against spoof attack. Introducing heartbeat into a fingerprint biometric system can yield promising results in two ways. First, it may increase the accuracy of the biometric system and second it may increase its robustness against spoof attacks. In this paper, a score level fusion is used based on the information content of the unimodal biometrics to enhance the information content of fingerprint biometrics. We measure the gain of information content of the multimodal biometric system obtained from fusion of fingerprint and heartbeat signal captured from fingers. Experimental results show that fusion of these two modalities increases the information content of the multimodal biometric system, consequently, increasing its accuracy and robustness against spoof attacks.
{"title":"Enhancing the information content of fingerprint biometrics with heartbeat signal","authors":"R. M. Jomaa, Md. Saiful Islam, H. Mathkour","doi":"10.1109/WSCNIS.2015.7368284","DOIUrl":"https://doi.org/10.1109/WSCNIS.2015.7368284","url":null,"abstract":"Heartbeat signal is an emerging biometric modality which is getting attention for its robustness against spoof attack. Introducing heartbeat into a fingerprint biometric system can yield promising results in two ways. First, it may increase the accuracy of the biometric system and second it may increase its robustness against spoof attacks. In this paper, a score level fusion is used based on the information content of the unimodal biometrics to enhance the information content of fingerprint biometrics. We measure the gain of information content of the multimodal biometric system obtained from fusion of fingerprint and heartbeat signal captured from fingers. Experimental results show that fusion of these two modalities increases the information content of the multimodal biometric system, consequently, increasing its accuracy and robustness against spoof attacks.","PeriodicalId":253256,"journal":{"name":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133910043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：