Pub Date : 2015-12-10DOI: 10.1109/ICCVIA.2015.7351896
M. Saadoune, A. Hajami, H. Allali
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it comes to commercial applications, take as an example: the automotive networks that allow communication between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source and a destination node by initiating a route discovery process. Second, it maintains the active routes, which means finding alternative routes in a case of a link failure and deleting routes when they are no longer desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately. In this paper, we focused in the first point to enhance the local decision of each node in the network by the quantification of the mobility of their neighbors. The metric used describes the motion of a neighbor node using a formula that combines its relative speed and distance to the calculator node.
{"title":"Degree of spacial dependence quantification algorithm in AODV protocol","authors":"M. Saadoune, A. Hajami, H. Allali","doi":"10.1109/ICCVIA.2015.7351896","DOIUrl":"https://doi.org/10.1109/ICCVIA.2015.7351896","url":null,"abstract":"Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it comes to commercial applications, take as an example: the automotive networks that allow communication between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source and a destination node by initiating a route discovery process. Second, it maintains the active routes, which means finding alternative routes in a case of a link failure and deleting routes when they are no longer desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately. In this paper, we focused in the first point to enhance the local decision of each node in the network by the quantification of the mobility of their neighbors. The metric used describes the motion of a neighbor node using a formula that combines its relative speed and distance to the calculator node.","PeriodicalId":419122,"journal":{"name":"International Conference on Computer Vision and Image Analysis Applications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125389631","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-12-10DOI: 10.1109/ICCVIA.2015.7351897
Adnan A. Y. Mustafa
Given two dissimilar binary images we are interested in detecting their dissimilarity quickly. In our previous work, we developed a Probabilistic Model for Matching (PMM) that can be used to detect distinct-dissimilar binary images quickly with high confidence; e.g., by checking as few as five points with 93% confidence. In this paper we develop a similarity measure to be used with PMM. The similarity measure is a modification of the Hamming distance that measures the concurrence between two images. We show using real images, that by using this similarity measure, PMM can be extended to quasi-similar (non-distinct-dissimilar) images.
{"title":"A modified hamming distance measure for quick detection of dissimilar binary images","authors":"Adnan A. Y. Mustafa","doi":"10.1109/ICCVIA.2015.7351897","DOIUrl":"https://doi.org/10.1109/ICCVIA.2015.7351897","url":null,"abstract":"Given two dissimilar binary images we are interested in detecting their dissimilarity quickly. In our previous work, we developed a Probabilistic Model for Matching (PMM) that can be used to detect distinct-dissimilar binary images quickly with high confidence; e.g., by checking as few as five points with 93% confidence. In this paper we develop a similarity measure to be used with PMM. The similarity measure is a modification of the Hamming distance that measures the concurrence between two images. We show using real images, that by using this similarity measure, PMM can be extended to quasi-similar (non-distinct-dissimilar) images.","PeriodicalId":419122,"journal":{"name":"International Conference on Computer Vision and Image Analysis Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126325692","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-12-10DOI: 10.1109/ICCVIA.2015.7351889
R. Laajimi, M. Masmoudi
This paper describes the concept of sensor network receiver which has been made viable by a modified protocol ZIGBEE. This protocol needs a direct conversion receiver or homodyne for low manufacturing costs, easy integration and low power consumption. One of the most significant building-blocks in the homodyne architecture is Sigma-Delta Analogue to Digital Converter (ADC). We present the studying and sizing of this component which is designed to provide a higher speed of 10.24 MHz at large bandwidth of 80 MHz. For such specifications, a flexible third order ΣΔ ADC, with a mono-bit quantizer is presented and its simulations results are shown by using Matlab Simulink. With 0.35μm CMOS technology, the ΣΔ modulator achieves 86 dB dynamic range, and 85 dB signal to noise ratio (SNR) over a 80 KHz signal bandwidth with an oversampling ratio (OSR) of 88 at ±1.5V supply voltage.
{"title":"A novel design of an ADC converter using for sensor network receiver","authors":"R. Laajimi, M. Masmoudi","doi":"10.1109/ICCVIA.2015.7351889","DOIUrl":"https://doi.org/10.1109/ICCVIA.2015.7351889","url":null,"abstract":"This paper describes the concept of sensor network receiver which has been made viable by a modified protocol ZIGBEE. This protocol needs a direct conversion receiver or homodyne for low manufacturing costs, easy integration and low power consumption. One of the most significant building-blocks in the homodyne architecture is Sigma-Delta Analogue to Digital Converter (ADC). We present the studying and sizing of this component which is designed to provide a higher speed of 10.24 MHz at large bandwidth of 80 MHz. For such specifications, a flexible third order ΣΔ ADC, with a mono-bit quantizer is presented and its simulations results are shown by using Matlab Simulink. With 0.35μm CMOS technology, the ΣΔ modulator achieves 86 dB dynamic range, and 85 dB signal to noise ratio (SNR) over a 80 KHz signal bandwidth with an oversampling ratio (OSR) of 88 at ±1.5V supply voltage.","PeriodicalId":419122,"journal":{"name":"International Conference on Computer Vision and Image Analysis Applications","volume":"AES-23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126560131","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-12-10DOI: 10.1109/ICCVIA.2015.7351879
Ahmed Z. Emam, Yasser A. Ali, M. M. Ben Ismail
Capsule Endoscopy (CE) is considered an established tool for the exploration and investigation of the small intestine. There are a large number of different capsules which have been launched in the medical field by different vendors such as Given Imaging, Olympus, IntroMedic, and CapsoVision. To find experts of GI that are able to designate three to four hours for viewing one patient video will be very hard and unfeasible economically. In this research, different feature extraction techniques, such as Color Moment RGB, Color Moment HSV, Color Histogram, LBP, and Statistical features, were explored and investigated as a preprocessing phase for CE image bleeding classification algorithms. Two methods are developed using the adaptive feature selection techniques for image sequence reduction and summarization. The preliminary results showed a high reduction rate for CE images sequence size by more than 75%. Different levels of frame frequency occurrence using different features extraction techniques were developed.
{"title":"Adaptive features extraction for Capsule Endoscopy (CE) video summarization","authors":"Ahmed Z. Emam, Yasser A. Ali, M. M. Ben Ismail","doi":"10.1109/ICCVIA.2015.7351879","DOIUrl":"https://doi.org/10.1109/ICCVIA.2015.7351879","url":null,"abstract":"Capsule Endoscopy (CE) is considered an established tool for the exploration and investigation of the small intestine. There are a large number of different capsules which have been launched in the medical field by different vendors such as Given Imaging, Olympus, IntroMedic, and CapsoVision. To find experts of GI that are able to designate three to four hours for viewing one patient video will be very hard and unfeasible economically. In this research, different feature extraction techniques, such as Color Moment RGB, Color Moment HSV, Color Histogram, LBP, and Statistical features, were explored and investigated as a preprocessing phase for CE image bleeding classification algorithms. Two methods are developed using the adaptive feature selection techniques for image sequence reduction and summarization. The preliminary results showed a high reduction rate for CE images sequence size by more than 75%. Different levels of frame frequency occurrence using different features extraction techniques were developed.","PeriodicalId":419122,"journal":{"name":"International Conference on Computer Vision and Image Analysis Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123226036","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-12-10DOI: 10.1109/ICCVIA.2015.7351905
R. Sammouda, Hatim Aboalsamh, Fahman Saeed
In each year there are thousands of people die due to prostate cancer. Near-infrared (NIRF) optical imaging is a new technique that uses the high absorption of hemoglobin in prostate's cancer cells for early detection. We use Image segmentation method to segment and extract the cancer region in the prostate's infrared images. In this paper, two image segmentation methods: K-means algorithm and fuzzy c-means (FCM) algorithms are discussed and compared. The extracted cancer clusters by two algorithms are compared using Student t-test and we found that the K-mean is more accurate approach than FCM in extracting the exact shape of tumors.
{"title":"Comparison between K mean and fuzzy C-mean methods for segmentation of near infrared fluorescent image for diagnosing prostate cancer","authors":"R. Sammouda, Hatim Aboalsamh, Fahman Saeed","doi":"10.1109/ICCVIA.2015.7351905","DOIUrl":"https://doi.org/10.1109/ICCVIA.2015.7351905","url":null,"abstract":"In each year there are thousands of people die due to prostate cancer. Near-infrared (NIRF) optical imaging is a new technique that uses the high absorption of hemoglobin in prostate's cancer cells for early detection. We use Image segmentation method to segment and extract the cancer region in the prostate's infrared images. In this paper, two image segmentation methods: K-means algorithm and fuzzy c-means (FCM) algorithms are discussed and compared. The extracted cancer clusters by two algorithms are compared using Student t-test and we found that the K-mean is more accurate approach than FCM in extracting the exact shape of tumors.","PeriodicalId":419122,"journal":{"name":"International Conference on Computer Vision and Image Analysis Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130978087","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-12-10DOI: 10.1109/ICCVIA.2015.7351902
Narjes Khalifa, Rania Linda Filali, M. Benrejeb
In this paper, a secure image transmission method based on discrete-time chaotic maps synchronization is proposed. This method is based on designed observer in order to achieve synchronization and secure image transmission between the transmitter and the receiver. Borne & Gentina criterion was used to establish sufficient conditions for global asymptotic stability of the dynamic error between the two coupled chaotic systems, associated to the Benrejeb arrow form matrix for the system description. Simulation results are given to show the efficiency of the proposed method.
{"title":"Observer based discrete-time chaotic systems synchronization for secure image transmission","authors":"Narjes Khalifa, Rania Linda Filali, M. Benrejeb","doi":"10.1109/ICCVIA.2015.7351902","DOIUrl":"https://doi.org/10.1109/ICCVIA.2015.7351902","url":null,"abstract":"In this paper, a secure image transmission method based on discrete-time chaotic maps synchronization is proposed. This method is based on designed observer in order to achieve synchronization and secure image transmission between the transmitter and the receiver. Borne & Gentina criterion was used to establish sufficient conditions for global asymptotic stability of the dynamic error between the two coupled chaotic systems, associated to the Benrejeb arrow form matrix for the system description. Simulation results are given to show the efficiency of the proposed method.","PeriodicalId":419122,"journal":{"name":"International Conference on Computer Vision and Image Analysis Applications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122380108","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-12-10DOI: 10.1109/ICCVIA.2015.7351894
L. Janahi, Marie Griffiths, H. Al-Ammal
The purpose of this paper is to explore the importance of Information Technology (IT) Governance models for public organizations and presenting an IT Governance model that can be adopted by both practitioners and researchers. A review of the literature in IT Governance has been initiated to shape the intended theoretical background of this study. The systematic literature review formalizes a richer context for the IT Governance concept. An empirical survey, using a questionnaire based on COBIT 4.1 maturity model used to investigate IT Governance practice in multiple case studies from Kingdom of Bahrain. This method enabled the researcher to gain insights to evaluate IT Governance practices. The results of this research will enable public sector organizations to adopt an IT Governance model in a simple and dynamic manner. The model provides a basic structure of a concept; for instance, this allows organizations to gain a better perspective on IT Governance processes and provides a clear focus for decision-making attention. IT Governance model also forms as a basis for further research in IT Governance adoption models and bridges the gap between conceptual frameworks, real life and functioning governance.
{"title":"A conceptual model for IT Governance: A case study research","authors":"L. Janahi, Marie Griffiths, H. Al-Ammal","doi":"10.1109/ICCVIA.2015.7351894","DOIUrl":"https://doi.org/10.1109/ICCVIA.2015.7351894","url":null,"abstract":"The purpose of this paper is to explore the importance of Information Technology (IT) Governance models for public organizations and presenting an IT Governance model that can be adopted by both practitioners and researchers. A review of the literature in IT Governance has been initiated to shape the intended theoretical background of this study. The systematic literature review formalizes a richer context for the IT Governance concept. An empirical survey, using a questionnaire based on COBIT 4.1 maturity model used to investigate IT Governance practice in multiple case studies from Kingdom of Bahrain. This method enabled the researcher to gain insights to evaluate IT Governance practices. The results of this research will enable public sector organizations to adopt an IT Governance model in a simple and dynamic manner. The model provides a basic structure of a concept; for instance, this allows organizations to gain a better perspective on IT Governance processes and provides a clear focus for decision-making attention. IT Governance model also forms as a basis for further research in IT Governance adoption models and bridges the gap between conceptual frameworks, real life and functioning governance.","PeriodicalId":419122,"journal":{"name":"International Conference on Computer Vision and Image Analysis Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125094636","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-12-10DOI: 10.1109/ICCVIA.2015.7351880
Assas Ouarda
The imprecision in an image can be expressed in terms of ambiguity of belonging of a pixel in the image or the bottom (if it is black or white), or at the in-definition of the form and the geometry of a region in the image, or the combination of the two previous factors. The fuzzy c-partition entropy approach for threshold selection is one of the best image thresholding techniques, but its complexity increases with the number of thresholds. In this paper, a multi-level thresholding method for image segmentation using type-2 fuzzy c-partition entropy is presented. Type-2 fuzzy sets represent fuzzy sets with fuzzy membership values. The procedure for finding the optimal combination of all the fuzzy parameters is implemented by a particle swarm optimization algorithm. Experimental results reveal that the proposed image thresholding approaches has good performances for images with low contrast and grayscale ambiguity.
{"title":"Image thresholding using type-2 fuzzy c-partition entropy and particle swarm optimization algorithm","authors":"Assas Ouarda","doi":"10.1109/ICCVIA.2015.7351880","DOIUrl":"https://doi.org/10.1109/ICCVIA.2015.7351880","url":null,"abstract":"The imprecision in an image can be expressed in terms of ambiguity of belonging of a pixel in the image or the bottom (if it is black or white), or at the in-definition of the form and the geometry of a region in the image, or the combination of the two previous factors. The fuzzy c-partition entropy approach for threshold selection is one of the best image thresholding techniques, but its complexity increases with the number of thresholds. In this paper, a multi-level thresholding method for image segmentation using type-2 fuzzy c-partition entropy is presented. Type-2 fuzzy sets represent fuzzy sets with fuzzy membership values. The procedure for finding the optimal combination of all the fuzzy parameters is implemented by a particle swarm optimization algorithm. Experimental results reveal that the proposed image thresholding approaches has good performances for images with low contrast and grayscale ambiguity.","PeriodicalId":419122,"journal":{"name":"International Conference on Computer Vision and Image Analysis Applications","volume":"334 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122834991","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-12-10DOI: 10.1109/ICCVIA.2015.7351881
S. Awaida
This article addresses text-independent writer identification of Arabic manuscripts. Several types of statistical features are extracted from historical Arabic manuscripts. Gradient distribution features for Arabic handwritten text as well as windowed gradient distribution features, contour chain code distribution features, and windowed contour chain code distribution features are extracted. A nearest neighbor (NN) classifier is used with the Euclidean distance measure. Due to the lack of publicly available Arabic manuscript database, this work designed and collected a database of 10,000 Arabic manuscript images handwritten by 200 different historical scholars. Using 8,000 images for training and 2,000 images for testing, the proposed writer identification classifier achieved a top-1, top-5, and top-10 recognition rates of 93.95%, 98.30%, and 99.10%, respectively. The effects of increasing the number of writers on the accuracy results are presented and analyzed.
{"title":"Text independent writer identification of Arabic manuscripts and the effects of writers increase","authors":"S. Awaida","doi":"10.1109/ICCVIA.2015.7351881","DOIUrl":"https://doi.org/10.1109/ICCVIA.2015.7351881","url":null,"abstract":"This article addresses text-independent writer identification of Arabic manuscripts. Several types of statistical features are extracted from historical Arabic manuscripts. Gradient distribution features for Arabic handwritten text as well as windowed gradient distribution features, contour chain code distribution features, and windowed contour chain code distribution features are extracted. A nearest neighbor (NN) classifier is used with the Euclidean distance measure. Due to the lack of publicly available Arabic manuscript database, this work designed and collected a database of 10,000 Arabic manuscript images handwritten by 200 different historical scholars. Using 8,000 images for training and 2,000 images for testing, the proposed writer identification classifier achieved a top-1, top-5, and top-10 recognition rates of 93.95%, 98.30%, and 99.10%, respectively. The effects of increasing the number of writers on the accuracy results are presented and analyzed.","PeriodicalId":419122,"journal":{"name":"International Conference on Computer Vision and Image Analysis Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131103925","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-12-10DOI: 10.1109/ICCVIA.2015.7351884
Imen Boulnemour, Bachir Boucheham
Dynamic Time Warping (DTW) is one of the most important algorithms for time series alignment. However, it is unsuitable for quasi-periodic time series. These are a concatenation of quasi-similar forms called (quasi)periods, e.g. electrocardiogram (ECG) time series. It is even more difficult to align these series when each contains a different number of periods. The difficulty lies in the fact that each period is characterized by local morphological changes. SEA (Shape Exchange Algorithm) is the only algorithm that effectively aligns these very complex time series. However when it comes to aligning time series significantly phase shifted and contaminated with noise, the SEA algorithm shows some weaknesses. To remedy to this problem, we propose in this work a novel algorithm that combines the SEA and DTW algorithms. The new method is then called I-SEA (Improved shape Exchange Algorithm). The tests were performed on ECG time series, selected from the Massachusetts Institute of Technology - Beth Israel Hospital (MIT-BIH) public database. Results show that the proposed algorithm is more effective than SEA in terms of alignment accuracy on both qualitative and quantitative levels, which makes it very suitable for many applications related to time series data mining (searching, classification, diagnosis, etc.), for many types of media.
{"title":"I-SEA: Improved shape exchange algorithm for quasi-periodic time series alignment","authors":"Imen Boulnemour, Bachir Boucheham","doi":"10.1109/ICCVIA.2015.7351884","DOIUrl":"https://doi.org/10.1109/ICCVIA.2015.7351884","url":null,"abstract":"Dynamic Time Warping (DTW) is one of the most important algorithms for time series alignment. However, it is unsuitable for quasi-periodic time series. These are a concatenation of quasi-similar forms called (quasi)periods, e.g. electrocardiogram (ECG) time series. It is even more difficult to align these series when each contains a different number of periods. The difficulty lies in the fact that each period is characterized by local morphological changes. SEA (Shape Exchange Algorithm) is the only algorithm that effectively aligns these very complex time series. However when it comes to aligning time series significantly phase shifted and contaminated with noise, the SEA algorithm shows some weaknesses. To remedy to this problem, we propose in this work a novel algorithm that combines the SEA and DTW algorithms. The new method is then called I-SEA (Improved shape Exchange Algorithm). The tests were performed on ECG time series, selected from the Massachusetts Institute of Technology - Beth Israel Hospital (MIT-BIH) public database. Results show that the proposed algorithm is more effective than SEA in terms of alignment accuracy on both qualitative and quantitative levels, which makes it very suitable for many applications related to time series data mining (searching, classification, diagnosis, etc.), for many types of media.","PeriodicalId":419122,"journal":{"name":"International Conference on Computer Vision and Image Analysis Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121732715","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
扫码关注我们
求助内容：
应助结果提醒方式：