Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905597
Safaa Achour, M. Benattou
The work presented in this paper extends an existing constraint model defined to automatically generate test inputs for java Bytecode programs. We propose to consider also BML specifications for generating valid test data. The main objective is to apply constraint based testing on java bytecode program annotated with BML for detecting the valid execution paths, to check the validity of the returned result, to reduce the domain of input data, and to perform coverage of the testing method under test.
{"title":"Test case generation for Java Bytecode programs annotated with BML specifications","authors":"Safaa Achour, M. Benattou","doi":"10.1109/ICMCS.2016.7905597","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905597","url":null,"abstract":"The work presented in this paper extends an existing constraint model defined to automatically generate test inputs for java Bytecode programs. We propose to consider also BML specifications for generating valid test data. The main objective is to apply constraint based testing on java bytecode program annotated with BML for detecting the valid execution paths, to check the validity of the returned result, to reduce the domain of input data, and to perform coverage of the testing method under test.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121372647","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 : 2016-09-01DOI: 10.1109/ICMCS.2016.7905666
Amal Battou, Omar Baz, D. Mammass
Learning Design approaches have provided new perspectives for the design and the implementation of learning environments. This paper focuses on the presentation and the comparison of the most used Learning Design approaches in the literature. Several Learning Design approaches are presented. This work seeks to make it easier for instructors that want to make the best choice when choosing an approach to design and authoring a learning environment by revealing which approach will meet their needs.
{"title":"Learning Design approaches for designing Learning environments: A comparative study","authors":"Amal Battou, Omar Baz, D. Mammass","doi":"10.1109/ICMCS.2016.7905666","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905666","url":null,"abstract":"Learning Design approaches have provided new perspectives for the design and the implementation of learning environments. This paper focuses on the presentation and the comparison of the most used Learning Design approaches in the literature. Several Learning Design approaches are presented. This work seeks to make it easier for instructors that want to make the best choice when choosing an approach to design and authoring a learning environment by revealing which approach will meet their needs.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116251274","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 : 2016-09-01DOI: 10.1109/ICMCS.2016.7905590
K. Boudaraia, H. Mahmoudi, Mohamed Abbou, M. Hilal
This paper deals with the DC motor position control using second order sliding mode technique in aim to position a solar tracker front of the sun throughout the day. A short description of the studied system is introduced and the modeling of the DC motor using electrical and mechanical equations is shown. Thereafter, a comparative study using PI controller and second order sliding mode is presented in order to control the position of the DC motor. Finally, simulation results using Matlab/Simulink is presented to show the performance of the proposed techniques in position control of the DC motor.
{"title":"DC motor position control of a solar tracking system using second order sliding mode","authors":"K. Boudaraia, H. Mahmoudi, Mohamed Abbou, M. Hilal","doi":"10.1109/ICMCS.2016.7905590","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905590","url":null,"abstract":"This paper deals with the DC motor position control using second order sliding mode technique in aim to position a solar tracker front of the sun throughout the day. A short description of the studied system is introduced and the modeling of the DC motor using electrical and mechanical equations is shown. Thereafter, a comparative study using PI controller and second order sliding mode is presented in order to control the position of the DC motor. Finally, simulation results using Matlab/Simulink is presented to show the performance of the proposed techniques in position control of the DC motor.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127073462","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 : 2016-09-01DOI: 10.1109/ICMCS.2016.7905595
M. Al-Ayyoub, Shadi Alzu'bi, Y. Jararweh, M. Alsmirat
Breast cancer is the most lethal type of cancer affecting women in the world. To improve the life quality of women, an early detection of this malignancy is always promising because this cancer is one of the cancers that can be managed and treated easily if it is detected earlier. Mammography is the standard screening method to diagnose breast cancer. At these days, there are a lot of researches that have been done to improve this screening method by benefiting from the enormous growth of technology. Graphics Processing Unit (GPU) is a parallel processor that can divide the complex computations tasks into subtasks and run them concurrently. Many medical imaging modalities offloaded their processing to this processor to help in improving the speed of healthcare systems in order to diagnose the illnesses in real time. This research introduces an acceleration method for the segmentation of the mammography images based on the GPU. In order to provide a better detection for the cancerous tumor, we use a modified version of the most common algorithm for image segmentation, which is the Single Pass Fuzzy C-Means (FCM) algorithm. The approach will be applied to a set of mammogram images to distinguish between malignant and benign cases. Additionally, the system is implemented on GPU parallel processor as well as the traditional CPU in order to compare the performance of both implementations. The performance results are compared according to the execution time and the speedup metrics. The proposed implementation on GPU provides a fine speedup compared to its serial implementation on CPU.
乳腺癌是世界上影响女性的最致命的癌症。为了提高妇女的生活质量，早期发现这种恶性肿瘤总是有希望的，因为这种癌症是一种癌症，如果发现得早，就可以很容易地控制和治疗。乳房x光检查是诊断乳腺癌的标准筛查方法。目前，人们已经做了很多研究来改进这种筛选方法，这得益于技术的巨大发展。图形处理器(Graphics Processing Unit, GPU)是一种并行处理器，它可以将复杂的计算任务划分成子任务并发运行。许多医学成像模式将其处理卸载到该处理器，以帮助提高医疗保健系统的速度，以便实时诊断疾病。本文介绍了一种基于GPU的乳腺x线图像加速分割方法。为了更好地检测癌性肿瘤，我们使用了最常用的图像分割算法的改进版本，即单遍模糊c均值(Single Pass Fuzzy C-Means, FCM)算法。该方法将应用于一组乳房x线照片，以区分恶性和良性病例。此外，该系统在GPU并行处理器和传统CPU上实现，以比较两种实现的性能。性能结果根据执行时间和加速指标进行比较。与在CPU上串行实现相比，在GPU上的实现提供了良好的加速。
{"title":"A GPU-based breast cancer detection system using Single Pass Fuzzy C-Means clustering algorithm","authors":"M. Al-Ayyoub, Shadi Alzu'bi, Y. Jararweh, M. Alsmirat","doi":"10.1109/ICMCS.2016.7905595","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905595","url":null,"abstract":"Breast cancer is the most lethal type of cancer affecting women in the world. To improve the life quality of women, an early detection of this malignancy is always promising because this cancer is one of the cancers that can be managed and treated easily if it is detected earlier. Mammography is the standard screening method to diagnose breast cancer. At these days, there are a lot of researches that have been done to improve this screening method by benefiting from the enormous growth of technology. Graphics Processing Unit (GPU) is a parallel processor that can divide the complex computations tasks into subtasks and run them concurrently. Many medical imaging modalities offloaded their processing to this processor to help in improving the speed of healthcare systems in order to diagnose the illnesses in real time. This research introduces an acceleration method for the segmentation of the mammography images based on the GPU. In order to provide a better detection for the cancerous tumor, we use a modified version of the most common algorithm for image segmentation, which is the Single Pass Fuzzy C-Means (FCM) algorithm. The approach will be applied to a set of mammogram images to distinguish between malignant and benign cases. Additionally, the system is implemented on GPU parallel processor as well as the traditional CPU in order to compare the performance of both implementations. The performance results are compared according to the execution time and the speedup metrics. The proposed implementation on GPU provides a fine speedup compared to its serial implementation on CPU.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131847796","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 : 2016-09-01DOI: 10.1109/ICMCS.2016.7905611
F. R. Zakani, K. Arhid, Mohcine Bouksim, T. Gadi, M. Aboulfatah
Recently, the 3D mesh segmentation is considered as an important stage in many applications in 3D shape analysis. In fact, extensive research has been performed to offer multiple approaches and algorithms for 3D mesh segmentation. Nevertheless, it is relatively hard to assess which algorithm produces more accurate segmentation quality than the other. Various methods have been proposed to evaluate the quality of segmentation algorithms. However, the evaluation of these qualities is far from being a solved problem, since most of the existing metrics don't take into account the regularity of the meshes and base their comparison on only one ground truth segmentation which presents a serious problematic since almost all the 3D objects have in general multiple reference segmentations. Hence, in this paper, we propose a new objective evaluation measure, based on the Kulczynski similarity index. The proposed method support comparison with multiple ground truth segmentations and takes into account the irregularity of meshes. Several experiments have been produced to show the discriminative power of our proposed measure.
{"title":"Kulczynski similarity index for objective evaluation of mesh segmentation algorithms","authors":"F. R. Zakani, K. Arhid, Mohcine Bouksim, T. Gadi, M. Aboulfatah","doi":"10.1109/ICMCS.2016.7905611","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905611","url":null,"abstract":"Recently, the 3D mesh segmentation is considered as an important stage in many applications in 3D shape analysis. In fact, extensive research has been performed to offer multiple approaches and algorithms for 3D mesh segmentation. Nevertheless, it is relatively hard to assess which algorithm produces more accurate segmentation quality than the other. Various methods have been proposed to evaluate the quality of segmentation algorithms. However, the evaluation of these qualities is far from being a solved problem, since most of the existing metrics don't take into account the regularity of the meshes and base their comparison on only one ground truth segmentation which presents a serious problematic since almost all the 3D objects have in general multiple reference segmentations. Hence, in this paper, we propose a new objective evaluation measure, based on the Kulczynski similarity index. The proposed method support comparison with multiple ground truth segmentations and takes into account the irregularity of meshes. Several experiments have been produced to show the discriminative power of our proposed measure.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132341297","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 : 2016-09-01DOI: 10.1109/ICMCS.2016.7905560
Omar El Maleky, F. Abdelouahab, M. Essaaidi, Laila Ajana
This paper present a reconfigurable T-shaped antenna how can operate easily at seven frequencies in S-band, the switching technique consist of an equivalent approach to PIN Diode it is to change the state of the distribution of current by insert a simple micro strip line in different positions, the simulated and de measured prototype frequency is respectively 3.12 GHz, 3.2 GHz, 3.31 GHz, 3.44 GHz, 3.56 GHz, 3.76 GHz, 4 GHz. The antenna is fabricated using FR4 substrate with relative permittivity of 4.4 and pert tangent of 0.02.
{"title":"Reconfigurable T-shaped antenna for S-band applications","authors":"Omar El Maleky, F. Abdelouahab, M. Essaaidi, Laila Ajana","doi":"10.1109/ICMCS.2016.7905560","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905560","url":null,"abstract":"This paper present a reconfigurable T-shaped antenna how can operate easily at seven frequencies in S-band, the switching technique consist of an equivalent approach to PIN Diode it is to change the state of the distribution of current by insert a simple micro strip line in different positions, the simulated and de measured prototype frequency is respectively 3.12 GHz, 3.2 GHz, 3.31 GHz, 3.44 GHz, 3.56 GHz, 3.76 GHz, 4 GHz. The antenna is fabricated using FR4 substrate with relative permittivity of 4.4 and pert tangent of 0.02.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"29 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114036551","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 : 2016-09-01DOI: 10.1109/ICMCS.2016.7905552
Mohammed Rida Ech-Charrat, K. Amechnoue
In this study, we are interested in the reusable containers management (e.g gases bottles, pallets, maritime containers, etc.). In this context, we address a dynamic reusable containers planning problem in a close-loop supply chain to optimize reusable containers collect, exploitation, storage and redistribution under environmental constraint in the context of reverse logistic. We propose firstly a new mixed integer programming model that helps practitioners to determine the delivered, collected, stored quantities of reusable containers on each period of the planning horizon under a carbon emission constraint. Secondly we introduce a hybrid approach based on the genetic algorithms to solve the problem. The numerical results have shown that developed hybrid approach generates high-quality solutions in a moderate computational time.
{"title":"Dynamic hybrid approach for reusable containers management in a close-loop supply chain","authors":"Mohammed Rida Ech-Charrat, K. Amechnoue","doi":"10.1109/ICMCS.2016.7905552","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905552","url":null,"abstract":"In this study, we are interested in the reusable containers management (e.g gases bottles, pallets, maritime containers, etc.). In this context, we address a dynamic reusable containers planning problem in a close-loop supply chain to optimize reusable containers collect, exploitation, storage and redistribution under environmental constraint in the context of reverse logistic. We propose firstly a new mixed integer programming model that helps practitioners to determine the delivered, collected, stored quantities of reusable containers on each period of the planning horizon under a carbon emission constraint. Secondly we introduce a hybrid approach based on the genetic algorithms to solve the problem. The numerical results have shown that developed hybrid approach generates high-quality solutions in a moderate computational time.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123917549","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 : 2016-09-01DOI: 10.1109/ICMCS.2016.7905532
Fateh Bougamouza, Samira Hazmoune, Mohammed Benmohammed
This paper presents an approach to extract features of online Arabic handwritten characters by combining offline features with Mel Frequency Cepstral Coefficients (MFCCs); indeed, these latter are commonly used as features in speech recognition systems. In this work, we have adapted MFCC method to online handwriting recognition area, and we investigate the classification performance of the MFCC with Hidden Markov Models (HMMs) for online Arabic handwritten character recognition, by varying some MFCC and HMM parameters such as sampling frequency, frame size, frame increment and number of HMM states. Besides, we have proposed a new solution of the problem of distributing points unevenly along the stroke curve, due to the variation in writing speed. This solution is appropriate for the online Arabic handwriting recognition systems for the reason of preserving information of the original character signal. The proposed system is evaluated using NOUN dataset and it gives an excellent recognition rate up to 96% which outperforms that reported by NOUN dataset owner in [1,2].
{"title":"Using Mel Frequency Cepstral Coefficient method for online Arabic characters handwriting recognition","authors":"Fateh Bougamouza, Samira Hazmoune, Mohammed Benmohammed","doi":"10.1109/ICMCS.2016.7905532","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905532","url":null,"abstract":"This paper presents an approach to extract features of online Arabic handwritten characters by combining offline features with Mel Frequency Cepstral Coefficients (MFCCs); indeed, these latter are commonly used as features in speech recognition systems. In this work, we have adapted MFCC method to online handwriting recognition area, and we investigate the classification performance of the MFCC with Hidden Markov Models (HMMs) for online Arabic handwritten character recognition, by varying some MFCC and HMM parameters such as sampling frequency, frame size, frame increment and number of HMM states. Besides, we have proposed a new solution of the problem of distributing points unevenly along the stroke curve, due to the variation in writing speed. This solution is appropriate for the online Arabic handwriting recognition systems for the reason of preserving information of the original character signal. The proposed system is evaluated using NOUN dataset and it gives an excellent recognition rate up to 96% which outperforms that reported by NOUN dataset owner in [1,2].","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123919900","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 : 2016-09-01DOI: 10.1109/ICMCS.2016.7905623
Ali Kamouch, A. Chaoub, Z. Guennoun
In this paper, we consider a multi-relay cooperative network assisted by the Automatic Repeat reQuest mechanism. In particular, the source node broadcasts the encoded stream to a set of relaying nodes and a relay will be chosen at each retransmission round to assist the source to convey the same stream to the common destination. Afterwards, we develop a semi-analytical method to compute the exact end-to-end outage probability, average delay and throughput metrics for the general case where the relays are positioned at various locations. This analytical method is corroborated by extensive simulation results to prove the accuracy of the proposed formulation. Further, we assess the performance of several relay-placement and power allocation configurations to find the optimal scheme.
{"title":"Optimum relay location and power allocation of cooperative decode-and-forward dual-hop ARQ networks","authors":"Ali Kamouch, A. Chaoub, Z. Guennoun","doi":"10.1109/ICMCS.2016.7905623","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905623","url":null,"abstract":"In this paper, we consider a multi-relay cooperative network assisted by the Automatic Repeat reQuest mechanism. In particular, the source node broadcasts the encoded stream to a set of relaying nodes and a relay will be chosen at each retransmission round to assist the source to convey the same stream to the common destination. Afterwards, we develop a semi-analytical method to compute the exact end-to-end outage probability, average delay and throughput metrics for the general case where the relays are positioned at various locations. This analytical method is corroborated by extensive simulation results to prove the accuracy of the proposed formulation. Further, we assess the performance of several relay-placement and power allocation configurations to find the optimal scheme.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116030662","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 : 2016-09-01DOI: 10.1109/ICMCS.2016.7905608
A. Hatim, R. Latif, Oussama El Bachari, M. Arioua
A new electrocardiogram (ECG) lossy compression scheme has been developed. The algorithm can reach high compression ratios with a reduced error which makes it suitable for real-time electrocardiogram monitoring. The new algorithm is based on delta coding technique. Low and high coding categories were made to encode the differences and insure an optimized compressed signal. In addition the number of successive coded differences is flexible and defined with a window size. A new frame format was developed to transmit data. The algorithm has been verified using multiple and most frequent normal and pathological types of cardiac signals from MIT-BIH physionet data bases. The algorithm can reach a mean compression ratio of 33.45 and a mean PRD of 0.25%. The proposed algorithm has a low complexity and is very suitable for hardware designs.
{"title":"Efficient electrocardiogram (ECG) lossy compression scheme","authors":"A. Hatim, R. Latif, Oussama El Bachari, M. Arioua","doi":"10.1109/ICMCS.2016.7905608","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905608","url":null,"abstract":"A new electrocardiogram (ECG) lossy compression scheme has been developed. The algorithm can reach high compression ratios with a reduced error which makes it suitable for real-time electrocardiogram monitoring. The new algorithm is based on delta coding technique. Low and high coding categories were made to encode the differences and insure an optimized compressed signal. In addition the number of successive coded differences is flexible and defined with a window size. A new frame format was developed to transmit data. The algorithm has been verified using multiple and most frequent normal and pathological types of cardiac signals from MIT-BIH physionet data bases. The algorithm can reach a mean compression ratio of 33.45 and a mean PRD of 0.25%. The proposed algorithm has a low complexity and is very suitable for hardware designs.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122411273","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
扫码关注我们
求助内容：
应助结果提醒方式：