Pub Date : 2023-01-01DOI: 10.4236/jsip.2023.143003
Audu Omar Ahmed Otobo, Ijudai Musa Palnam
The caprice for the study came from an indigenous designed instructional board for teaching learners in nursery/primary schools (2 - 10 years) and the task whose overall topic is the reminiscence, retention of visuals aid use in the pedagogy. The study is to appraise the opinion of toddlers/teachers about the helpfulness of 3D-visuals (ergonomic board); the clarity of the intended functions of the 3D-visuals in the toddler’s lessons instruction and support from the producers in using them; and why visuals (conventional visual aids) in schoolroom instruction are misjudged/misinterpreted; their view about the functions in specific (conventional visuals) for the instruction pedagogy; and other sources of visuals provided other than the lesson’s instruction. Four nursery/primary schools participated in the study. Seventy-two (72) toddler’s/teachers participated in the study. The study examined using quantitative and qualitative approach for statistical analysis (using pie-chart and histogram). The findings suggested that the aspects of visuals items selected for comment and description are to some extent circumscribed by toddler’s learners’ linguistic resources. Understandably, the point made by researchers referred that visuals often fail to support learning as effectively as they might because they are not regarded as a full-fledged information mode that requires the same careful processing as verbal text, is borne out by the findings. Recommendation, the accountability is above all on producers of kid’s instructional materials: authors, editors, designers and illustrators of the materials. The implication of this is that toddlers’ instructional materials should, as in the case of illustrated books include both an overt explanation of the overall philosophy toward visuals and overview of their use.
{"title":"3D Ergonomic Board: Kids Teaching and Learning Proposition","authors":"Audu Omar Ahmed Otobo, Ijudai Musa Palnam","doi":"10.4236/jsip.2023.143003","DOIUrl":"https://doi.org/10.4236/jsip.2023.143003","url":null,"abstract":"The caprice for the study came from an indigenous designed instructional board for teaching learners in nursery/primary schools (2 - 10 years) and the task whose overall topic is the reminiscence, retention of visuals aid use in the pedagogy. The study is to appraise the opinion of toddlers/teachers about the helpfulness of 3D-visuals (ergonomic board); the clarity of the intended functions of the 3D-visuals in the toddler’s lessons instruction and support from the producers in using them; and why visuals (conventional visual aids) in schoolroom instruction are misjudged/misinterpreted; their view about the functions in specific (conventional visuals) for the instruction pedagogy; and other sources of visuals provided other than the lesson’s instruction. Four nursery/primary schools participated in the study. Seventy-two (72) toddler’s/teachers participated in the study. The study examined using quantitative and qualitative approach for statistical analysis (using pie-chart and histogram). The findings suggested that the aspects of visuals items selected for comment and description are to some extent circumscribed by toddler’s learners’ linguistic resources. Understandably, the point made by researchers referred that visuals often fail to support learning as effectively as they might because they are not regarded as a full-fledged information mode that requires the same careful processing as verbal text, is borne out by the findings. Recommendation, the accountability is above all on producers of kid’s instructional materials: authors, editors, designers and illustrators of the materials. The implication of this is that toddlers’ instructional materials should, as in the case of illustrated books include both an overt explanation of the overall philosophy toward visuals and overview of their use.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135798928","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 : 2023-01-01DOI: 10.4236/jsip.2023.141001
Kamara Ndèye Lama, Boye Mouhamadou Moustapha, Traore Ali
{"title":"White Blood Cells Detection Using Spectral Tresholding","authors":"Kamara Ndèye Lama, Boye Mouhamadou Moustapha, Traore Ali","doi":"10.4236/jsip.2023.141001","DOIUrl":"https://doi.org/10.4236/jsip.2023.141001","url":null,"abstract":"","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73991445","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 : 2023-01-01DOI: 10.4236/jsip.2023.142002
Xing Xing, Ming Zhang, Wilson Q. Wang
{"title":"Adaptive Variational Mode Decomposition for Bearing Fault Detection","authors":"Xing Xing, Ming Zhang, Wilson Q. Wang","doi":"10.4236/jsip.2023.142002","DOIUrl":"https://doi.org/10.4236/jsip.2023.142002","url":null,"abstract":"","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73064825","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 : 2022-01-01DOI: 10.4236/jsip.2022.131001
Kelechi G. Eze, C. Akujuobi
The adopters of IoT face challenges with the surging Internet-based attacks on their IoT assets and inefficiencies within the technology. Unfortunately, IoT is overly distributed, still evolving and facing implementation and security challenges. Given the above scenario, we argue that the IoT network should always be decentralized design, and security should be built by design. The paper is the design and construction of a decentralized IoT security framework, with the goal of making emerging IoT systems more resilient to attacks and supporting complex communication and resource sharing. The framework improves efficiency and scalability in IoT, exposes vulnerable subsystems and components as possible weak links to system compromise, and meets the requirements of a heterogeneous computing environment. Other features of the framework including efficient resource sharing, fault tolerance, and distributed storage support the Internet of Things. We discuss the design requirements and carry out the implementation of Proof of Concept and evaluation of our framework. Two underlying technologies: the actor model and the blockchain were used for the implementation. Our reason for choosing the actor model and blockchain is to compare its suitability for IoT integration in parallel. Hence, evaluation of the system is performed based on computational and memory efficiency, security, and scalability. We conclude from the evaluations that the actorbased implementation has better scalability than the block-chain-based implementation. Also, the blockchain seems to be computationally more intensive than the actors and less suitable for IoT systems.
{"title":"Design and Evaluation of a Distributed Security Framework for the Internet of Things","authors":"Kelechi G. Eze, C. Akujuobi","doi":"10.4236/jsip.2022.131001","DOIUrl":"https://doi.org/10.4236/jsip.2022.131001","url":null,"abstract":"The adopters of IoT face challenges with the surging Internet-based attacks on their IoT assets and inefficiencies within the technology. Unfortunately, IoT is overly distributed, still evolving and facing implementation and security challenges. Given the above scenario, we argue that the IoT network should always be decentralized design, and security should be built by design. The paper is the design and construction of a decentralized IoT security framework, with the goal of making emerging IoT systems more resilient to attacks and supporting complex communication and resource sharing. The framework improves efficiency and scalability in IoT, exposes vulnerable subsystems and components as possible weak links to system compromise, and meets the requirements of a heterogeneous computing environment. Other features of the framework including efficient resource sharing, fault tolerance, and distributed storage support the Internet of Things. We discuss the design requirements and carry out the implementation of Proof of Concept and evaluation of our framework. Two underlying technologies: the actor model and the blockchain were used for the implementation. Our reason for choosing the actor model and blockchain is to compare its suitability for IoT integration in parallel. Hence, evaluation of the system is performed based on computational and memory efficiency, security, and scalability. We conclude from the evaluations that the actorbased implementation has better scalability than the block-chain-based implementation. Also, the blockchain seems to be computationally more intensive than the actors and less suitable for IoT systems.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"23 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78131903","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 : 2021-10-15DOI: 10.4236/jsip.2021.124004
Mireille Pouyap, L. Bitjoka, E. Mfoumou, Denis Toko
The presence of bearing faults reduces the efficiency of rotating machines and thus increases energy consumption or even the total stoppage of the machine. It becomes essential to correctly diagnose the fault caused by the bearing. Hence the importance of determining an effective features extraction method that best describes the fault. The vision of this paper is to merge the features selection methods in order to define the most relevant featuresin the texture of the vibration signal images. In this study, the Gray Level Co-occurrence Matrix (GLCM) in texture analysis is applied on the vibration signal represented in images. Features selection based on the merge of PCA (Principal component Analysis) method and SFE (Sequential Features Extraction) method is done to obtain the most relevant features. The multiclass-Na?ve Bayesclassifier is used to test the proposed approach. The success rate of this classification is 98.27%. The relevant features obtained give promising results and are more efficient than the methods observed in the literature.
{"title":"Improved Bearing Fault Diagnosis by Feature Extraction Based on GLCM, Fusion of Selection Methods, and Multiclass-Naïve Bayes Classification","authors":"Mireille Pouyap, L. Bitjoka, E. Mfoumou, Denis Toko","doi":"10.4236/jsip.2021.124004","DOIUrl":"https://doi.org/10.4236/jsip.2021.124004","url":null,"abstract":"The \u0000presence of bearing faults reduces the efficiency of rotating machines and thus \u0000increases energy consumption or even the total stoppage of the machine. It becomes essential to correctly diagnose the \u0000fault caused by the bearing. Hence the importance of determining an \u0000effective features extraction method that best describes the fault. The vision \u0000of this paper is to merge the features selection methods in order to define the \u0000most relevant featuresin the texture of the \u0000vibration signal images. In this study, the Gray Level Co-occurrence Matrix \u0000(GLCM) in texture analysis is applied on the vibration signal represented in \u0000images. Features selection based on the merge of PCA (Principal component Analysis) method \u0000and SFE (Sequential Features Extraction) method is done to obtain the most relevant features. The multiclass-Na?ve \u0000Bayesclassifier is used to test the proposed approach. The success rate \u0000of this classification is 98.27%. The relevant features obtained give promising \u0000results and are more efficient than the methods observed in the literature.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82501651","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 : 2021-04-25DOI: 10.4236/JSIP.2021.122002
Yang Yang, Lian Wei
Edge detection is an important aspect to improve image edge quality in image processing. The purpose of edge detection is to identify the points in digital images with great brightness variation. However, the accuracy of traditional edge detection methods in edge extraction is low. For the actual image, the grey edge is sometimes not very clear, the image also contains noise. The detection result of the traditional Sobel operator is relatively accurate, but the detection result is rough and sensitive to noise. To solve the above problems, this paper proposes an improved eight-direction Sobel operator based on grey relevancy degree, which combines 5 × 5 Sobel operator with a grey relational degree and a new eight-direction grey relevancy method. The results show that this method can detect the useful information of edge more accurately and improve the anti-noise performance. However, the drawback is that the algorithm is not automatic.
{"title":"Grey Relevancy Degree and Improved Eight-Direction Sobel Operator Edge Detection","authors":"Yang Yang, Lian Wei","doi":"10.4236/JSIP.2021.122002","DOIUrl":"https://doi.org/10.4236/JSIP.2021.122002","url":null,"abstract":"Edge \u0000detection is an important aspect to improve image edge quality in image \u0000processing. The purpose of edge detection is to identify the points in digital \u0000images with great brightness variation. However, the accuracy of traditional \u0000edge detection methods in edge extraction is low. For the actual image, the \u0000grey edge is sometimes not very clear, the image also contains noise. The \u0000detection result of the traditional Sobel operator is relatively accurate, but the detection \u0000result is rough and sensitive to noise. To solve the above problems, this paper \u0000proposes an improved eight-direction Sobel operator based on grey relevancy \u0000degree, which combines 5 × 5 Sobel operator with a grey relational degree and \u0000a new eight-direction grey relevancy method. The results show that this method \u0000can detect the useful information of edge more accurately and improve the \u0000anti-noise performance. However, the drawback is that the algorithm is not \u0000automatic.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"6 1","pages":"43-55"},"PeriodicalIF":0.0,"publicationDate":"2021-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84361771","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 : 2021-02-26DOI: 10.4236/JSIP.2021.121001
Yehonatan Avraham, M. Pinchas
The National Institute of Standards and Technology (NIST) document is a list of fifteen tests for estimating the probability of signal randomness degree. Test number six in the NIST document is the Discrete Fourier Transform (DFT) test suitable for stationary incoming sequences. But, for cases where the input sequence is not stationary, the DFT test provides inaccurate results. For these cases, test number seven and eight (the Non-overlapping Template Matching Test and the Overlapping Template Matching Test) of the NIST document were designed to classify those non-stationary sequences. But, even with test number seven and eight of the NIST document, the results are not always accurate. Thus, the NIST test does not give a proper answer for the non-stationary input sequence case. In this paper, we offer a new algorithm or test, which may replace the NIST tests number six, seven and eight. The proposed test is applicable also for non-stationary sequences and supplies more accurate results than the existing tests (NIST tests number six, seven and eight), for non-stationary sequences. The new proposed test is based on the Wigner function and on the Generalized Gaussian Distribution (GGD). In addition, this new proposed algorithm alarms and indicates on suspicious places of cyclic sections in the tested sequence. Thus, it gives us the option to repair or to remove the suspicious places of cyclic sections (this part is beyond the scope of this paper), so that after that, the repaired or the shortened sequence (original sequence with removed sections) will result as a sequence with high probability of random degree.
{"title":"A New Approach for the DFT NIST Test Applicable for Non-Stationary Input Sequences","authors":"Yehonatan Avraham, M. Pinchas","doi":"10.4236/JSIP.2021.121001","DOIUrl":"https://doi.org/10.4236/JSIP.2021.121001","url":null,"abstract":"The National Institute of Standards and Technology \u0000(NIST) document is a list of fifteen tests for estimating the probability of \u0000signal randomness degree. Test number six in \u0000the NIST document is the Discrete Fourier Transform (DFT) test suitable \u0000for stationary incoming sequences. But, for cases where the input sequence is \u0000not stationary, the DFT test provides inaccurate results. For these cases, test \u0000number seven and eight (the Non-overlapping Template Matching Test and the \u0000Overlapping Template Matching Test) of the NIST document were designed to \u0000classify those non-stationary sequences. But, even with test number seven and \u0000eight of the NIST document, the results are not always accurate. Thus, the NIST \u0000test does not give a proper answer for the non-stationary input sequence case. \u0000In this paper, we offer a new algorithm or \u0000test, which may replace the NIST tests number six, seven and eight. The proposed test is applicable also for \u0000non-stationary sequences and supplies more accurate results than the existing tests (NIST tests number six, seven \u0000and eight), for non-stationary sequences. The new proposed test is based \u0000on the Wigner function and on the Generalized Gaussian Distribution (GGD). In \u0000addition, this new proposed algorithm alarms \u0000and indicates on suspicious places of cyclic sections in the tested sequence. Thus, it gives us the option to repair \u0000or to remove the suspicious places of cyclic sections (this part is beyond the scope of this paper), so that after that, the repaired \u0000or the shortened sequence (original \u0000sequence with removed sections) will result as a sequence with high probability of random degree.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"7 1","pages":"1-41"},"PeriodicalIF":0.0,"publicationDate":"2021-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79824070","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 : 2020-11-10DOI: 10.4236/jsip.2020.114005
A. Goltsev, V. Gritsenko, D. Húsek
The purpose of the research is to develop a universal algorithm for partial texture segmentation of any visual images. The main peculiarity of the proposed segmentation procedure is the extraction of only homogeneous fine-grained texture segments present in the images. At first, an initial seed point is found for the largest and most homogeneous segment of the image. This initial seed point of the segment is expanded using a region growing method. Other texture segments of the image are extracted analogously in turn. At the second stage, the procedure of merging the extracted segments belonging to the same texture class is performed. Then, the detected texture segments are input to a neural network with competitive layers which accomplishes more accurate delineation of the shapes of the extracted texture segments. The proposed segmentation procedure is fully unsupervised, i.e., it does not use any a priori knowledge on either the type of textures or the number of texture segments in the image. The research results in development of the segmentation algorithm realized as a computer program tested in a series of experiments that demonstrate its efficiency on grayscale natural scenes.
{"title":"Segmentation of Visual Images by Sequential Extracting Homogeneous Texture Areas","authors":"A. Goltsev, V. Gritsenko, D. Húsek","doi":"10.4236/jsip.2020.114005","DOIUrl":"https://doi.org/10.4236/jsip.2020.114005","url":null,"abstract":"The purpose of the research \u0000is to develop a universal algorithm for partial texture segmentation of any \u0000visual images. The main peculiarity of the proposed segmentation procedure is \u0000the extraction of only homogeneous fine-grained texture segments present in the \u0000images. At first, an initial seed point is found for the largest and most \u0000homogeneous segment of the image. This initial seed point of the segment is \u0000expanded using a region growing method. Other texture segments of the image are \u0000extracted analogously in turn. At the second stage, the procedure of merging \u0000the extracted segments belonging to the same texture class is performed. Then, \u0000the detected texture segments are input to a neural network with competitive \u0000layers which accomplishes more accurate delineation of the shapes of the \u0000extracted texture segments. The proposed segmentation procedure is fully \u0000unsupervised, i.e., \u0000it does not use any a priori knowledge on either the type of textures or the \u0000number of texture segments in the image. The research results in development of \u0000the segmentation algorithm realized as a computer program tested in a series of \u0000experiments that demonstrate its efficiency on grayscale natural scenes.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"80 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88977129","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 : 2020-08-31DOI: 10.4236/jsip.2020.113004
Yao Taky Alvarez Kossonou, A. Clément, B. Sahraoui, J. Zoueu
Local Binary Patterns (LBPs) have been highly used in texture classification for their robustness, their ease of implementation and their low computational cost. Initially designed to deal with gray level images, several methods based on them in the literature have been proposed for images having more than one spectral band. To achieve it, whether assumption using color information or combining spectral band two by two was done. Those methods use micro structures as texture features. In this paper, our goal was to design texture features which are relevant to color and multicomponent texture analysis without any assumption. Based on methods designed for gray scale images, we find the combination of micro and macro structures efficient for multispectral texture analysis. The experimentations were carried out on color images from Outex databases and multicomponent images from red blood cells captured using a multispectral microscope equipped with 13 LEDs ranging from 375 nm to 940 nm. In all achieved experimentations, our proposal presents the best classification scores compared to common multicomponent LBP methods. 99.81%, 100.00%, 99.07% and 97.67% are maximum scores obtained with our strategy respectively applied to images subject to rotation, blur, illumination variation and the multicomponent ones.
{"title":"A Local Binary Pattern-Based Method for Color and Multicomponent Texture Analysis","authors":"Yao Taky Alvarez Kossonou, A. Clément, B. Sahraoui, J. Zoueu","doi":"10.4236/jsip.2020.113004","DOIUrl":"https://doi.org/10.4236/jsip.2020.113004","url":null,"abstract":"Local Binary Patterns (LBPs) have been highly used in texture \u0000classification for their robustness, their \u0000ease of implementation and their low computational cost. Initially designed \u0000to deal with gray level images, several methods based on them in the literature \u0000have been proposed for images having more than one spectral band. To achieve \u0000it, whether assumption using color information or combining spectral band two \u0000by two was done. Those methods use micro structures \u0000as texture features. In this paper, our goal was to design texture features \u0000which are relevant to color and multicomponent texture analysis without any assumption. Based on methods designed \u0000for gray scale images, we find the combination of micro and macro structures \u0000efficient for multispectral texture analysis. The experimentations were carried \u0000out on color images from Outex databases and multicomponent images from red \u0000blood cells captured using a multispectral microscope equipped with 13 LEDs \u0000ranging from 375 nm to 940 nm. In all \u0000achieved experimentations, our proposal presents the best classification \u0000scores compared to common multicomponent LBP methods. 99.81%, 100.00%, 99.07% and 97.67% are maximum scores obtained with our strategy \u0000respectively applied to images subject to rotation, blur, illumination \u0000variation and the multicomponent ones.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"29 1","pages":"58-73"},"PeriodicalIF":0.0,"publicationDate":"2020-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82942162","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 : 2020-08-31DOI: 10.4236/jsip.2020.113003
Colince Welba, A. Okassa, Pascal Ntsama Eloundou, P. Ele
A new Modified Discrete Wavelets Packets Transform (MDWPT) based method for the compression of Surface EMG signal (s-EMG) data is presented. A Modified Discrete Wavelets Packets Transform (MDWPT) is applied to the digitized s-EMG signal. A Discrete Cosine Transforms (DCT) is applied to the MDWPT coefficients (only on detail coefficients). The MDWPT+ DCT coefficients are quantized with a Uniform Scalar Dead-Zone Quantizer (USDZQ). An arithmetic coder is employed for the entropy coding of symbol streams. The proposed approach was tested on more than 35 actuals S-EMG signals divided into three categories. The proposed approach was evaluated by the following parameters: Compression Factor (CF), Signal to Noise Ratio (SNR), Percent Root mean square Difference (PRD), Mean Frequency Distortion (MFD) and the Mean Square Error (MSE). Simulation results show that the proposed coding algorithm outperforms some recently developed s-EMG compression algorithms.
{"title":"Contribution to S-EMG Signal Compression in 1D by the Combination of the Modified Discrete Wavelet Packet Transform (MDWPT) and the Discrete Cosine Transform (DCT)","authors":"Colince Welba, A. Okassa, Pascal Ntsama Eloundou, P. Ele","doi":"10.4236/jsip.2020.113003","DOIUrl":"https://doi.org/10.4236/jsip.2020.113003","url":null,"abstract":"A new Modified Discrete Wavelets Packets Transform \u0000(MDWPT) based method for the compression of Surface EMG signal (s-EMG) data is \u0000presented. A Modified Discrete Wavelets Packets Transform (MDWPT) is applied to \u0000the digitized s-EMG signal. A Discrete \u0000Cosine Transforms (DCT) is applied to the MDWPT coefficients (only on detail \u0000coefficients). The MDWPT+ DCT coefficients are quantized with a Uniform \u0000Scalar Dead-Zone Quantizer (USDZQ). \u0000An arithmetic coder is employed for the entropy coding of symbol streams. The proposed approach was tested on more than 35 actuals \u0000S-EMG signals divided into three categories. The proposed approach was \u0000evaluated by the following parameters: \u0000Compression Factor (CF), Signal to Noise Ratio (SNR), Percent Root mean square Difference (PRD), Mean \u0000Frequency Distortion (MFD) and the Mean Square Error (MSE). Simulation \u0000results show that the proposed coding algorithm outperforms some recently \u0000developed s-EMG compression algorithms.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"29 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82410943","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
扫码关注我们
求助内容：
应助结果提醒方式：