Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905625
Mourad Ghafiri, Ilham Elhandaoui, A. E. Khadimi
Many Implementations of the Global Navigation Satellite Systems (GNSS) have been developed so far (GPS, Glonass, Galileo, etc.). The aim of these implementations is to provide global position, velocity and timing (PVT) as a service for a variety of consumers (military, civilians, agency, etc.) with specific Quality of Service (QoS). The basics behind GNSS is trilateration and the use of electromagnetic waves phenomenon as the observable key to determine the PVT. Each implementation of GNSS has its own jargon to deliver the PVT Service. We end up to a situation in which GNSS concepts are overloaded or misused, and sometimes implementation, tool and technology dependent. As a direct result, this leads to more community segregation toward GNSS concepts and PVT service design, hence impeding the community from better understanding the nature of GNSS and collaboratively thinking about a flexible and efficient way to implement Intelligent GNSS Receivers, taking advantage of all existing implementations of GNSS and the power of Software-Defined Radio (SDR) paradigm, as well as defending themselves against PVT service spoofing. In this paper we provide a preliminary attempt to unify the concepts and jargon of GNSS, using gravity-like field analogy to introduce a Lingua Franca for GNSS, in order to boost creativity and scientific imagination of GNSS community to design, implement and Test Intelligent Software-Defined GNSS Receivers.
{"title":"A Lingua Franca to design, implement and Test Intelligent Software-Defined GNSS Receivers","authors":"Mourad Ghafiri, Ilham Elhandaoui, A. E. Khadimi","doi":"10.1109/ICMCS.2016.7905625","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905625","url":null,"abstract":"Many Implementations of the Global Navigation Satellite Systems (GNSS) have been developed so far (GPS, Glonass, Galileo, etc.). The aim of these implementations is to provide global position, velocity and timing (PVT) as a service for a variety of consumers (military, civilians, agency, etc.) with specific Quality of Service (QoS). The basics behind GNSS is trilateration and the use of electromagnetic waves phenomenon as the observable key to determine the PVT. Each implementation of GNSS has its own jargon to deliver the PVT Service. We end up to a situation in which GNSS concepts are overloaded or misused, and sometimes implementation, tool and technology dependent. As a direct result, this leads to more community segregation toward GNSS concepts and PVT service design, hence impeding the community from better understanding the nature of GNSS and collaboratively thinking about a flexible and efficient way to implement Intelligent GNSS Receivers, taking advantage of all existing implementations of GNSS and the power of Software-Defined Radio (SDR) paradigm, as well as defending themselves against PVT service spoofing. In this paper we provide a preliminary attempt to unify the concepts and jargon of GNSS, using gravity-like field analogy to introduce a Lingua Franca for GNSS, in order to boost creativity and scientific imagination of GNSS community to design, implement and Test Intelligent Software-Defined GNSS Receivers.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"24 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":"115075299","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.7905523
O. Lachhab, El Hassan Ibn El Haj
In this paper, we propose a novel vector transformation projecting the feature vectors in a new space, characterized by good discriminant properties, while reducing drastically the number of parameters used in the ASR systems. We call this method “N-to-1 Gaussian MFCC transformation”. It uses the HMM acoustic parameters obtained by N and 1 Gaussian in the training process in order to calculate the transformed vectors in the new projection space. Our transformation technique permits an important reduction of the number of Gaussians (in the GMM modeling of the emission probability of each state) while improving the performances of ASR systems. Our experimental results using both TIMIT and FPSD corpus demonstrate that the proposed feature transformation, improves the phone recognition accuracy when compared with classical methods using conventional cepstral feature vectors in the context of using HMMs with a number of Gaussians less than 16 by state.
{"title":"Improved feature vectors using N-to-1 Gaussian MFCC transformation for automatic speech recognition system","authors":"O. Lachhab, El Hassan Ibn El Haj","doi":"10.1109/ICMCS.2016.7905523","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905523","url":null,"abstract":"In this paper, we propose a novel vector transformation projecting the feature vectors in a new space, characterized by good discriminant properties, while reducing drastically the number of parameters used in the ASR systems. We call this method “N-to-1 Gaussian MFCC transformation”. It uses the HMM acoustic parameters obtained by N and 1 Gaussian in the training process in order to calculate the transformed vectors in the new projection space. Our transformation technique permits an important reduction of the number of Gaussians (in the GMM modeling of the emission probability of each state) while improving the performances of ASR systems. Our experimental results using both TIMIT and FPSD corpus demonstrate that the proposed feature transformation, improves the phone recognition accuracy when compared with classical methods using conventional cepstral feature vectors in the context of using HMMs with a number of Gaussians less than 16 by state.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"2 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":"122983105","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.7905533
Jihen Thabet, R. Barrak, N. Khouja, A. Ghazel
This paper presents a reconfigurable decimation filter architecture for reconfigurable multiband GNSS receivers. The proposed filter architecture is designed for a reconfigurable GNSS subsampling receiver, where the sampling process is performed at the Analog to Digital Converter. As the selected sampling rates are much higher than the Nyquist rate, a decimation stage is required to speed up GNSS digital processing, mainly the acquisition, the tracking and the navigation. The proposed reconfigurable filter performs decimation in two stages; the first one is a Cascade Integrator Combs (CIC). This filter allows reducing the sampling rate to twice the required GNSS signals bandwidth. The second stage composed of compensation filter to achieve wide broadband compensation of the CIC filter and to perform decimation to the Nyquist frequency. In this paper, Decimation filter specification for multiband GNSS signals is first derived. Then, the parameters of CIC and FIR filters are investigated through simulations under Matlab.
{"title":"Design of a reconfigurable digital decimation filter for flexible GNSS receivers","authors":"Jihen Thabet, R. Barrak, N. Khouja, A. Ghazel","doi":"10.1109/ICMCS.2016.7905533","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905533","url":null,"abstract":"This paper presents a reconfigurable decimation filter architecture for reconfigurable multiband GNSS receivers. The proposed filter architecture is designed for a reconfigurable GNSS subsampling receiver, where the sampling process is performed at the Analog to Digital Converter. As the selected sampling rates are much higher than the Nyquist rate, a decimation stage is required to speed up GNSS digital processing, mainly the acquisition, the tracking and the navigation. The proposed reconfigurable filter performs decimation in two stages; the first one is a Cascade Integrator Combs (CIC). This filter allows reducing the sampling rate to twice the required GNSS signals bandwidth. The second stage composed of compensation filter to achieve wide broadband compensation of the CIC filter and to perform decimation to the Nyquist frequency. In this paper, Decimation filter specification for multiband GNSS signals is first derived. Then, the parameters of CIC and FIR filters are investigated through simulations under Matlab.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"14 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":"131264352","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.7905583
B. Nini, Asma Ounzar
This paper presents a permutation technique based on a sinusoid whose complexity is O(N) but providing a very acceptable security. It considers an image as a set of vertical and horizontal bits that shift under the effect of a sinusoidal wave. This results in the permutation of the image content at the level of bits. As a result, for only one round of the algorithm, the correlation between pixel values may reach 0.03. Moreover, the proposed method offers the opportunity to permute a selective free form. The algorithm is able to consider any concave or convex curve in the selected part. The significance of these two criterion is in the possibility to mix the technique together with an object detection application in order to encrypt the object of interest in a live broadcast.
{"title":"Bitwise level image permutation using a sinusoidal signal","authors":"B. Nini, Asma Ounzar","doi":"10.1109/ICMCS.2016.7905583","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905583","url":null,"abstract":"This paper presents a permutation technique based on a sinusoid whose complexity is O(N) but providing a very acceptable security. It considers an image as a set of vertical and horizontal bits that shift under the effect of a sinusoidal wave. This results in the permutation of the image content at the level of bits. As a result, for only one round of the algorithm, the correlation between pixel values may reach 0.03. Moreover, the proposed method offers the opportunity to permute a selective free form. The algorithm is able to consider any concave or convex curve in the selected part. The significance of these two criterion is in the possibility to mix the technique together with an object detection application in order to encrypt the object of interest in a live broadcast.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"1 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":"130646288","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.7905584
Yassine Zahraoui, Chaymae Fahassa, M. Akherraz, A. Bennassar
This paper purposes to present a sensorless indirect field oriented control (IFOC) commanded by a space vector algorithm (SV) in goal to guarantee fast response in one hand, and to improve the dynamic performance of a three-phase squirrel cage induction motor drive (SCIM) in the other hand. This numerical algorithm is used by the pulse width modulation (PWM) in order to obtain a control sequence of the inverter switches to generate an output voltage vector that approaches as much as possible to the reference voltage vector. The global control is reinforced by an extended Kalman filter observer (EKF) for the rotor speed estimation. Simulation results show that the proposed vector control with the proposed observer and the numerical algorithm provide good performance dynamic characteristics for different operating modes. The robustness of the overall system is tested under load torque disturbance in order to show the system stability. All simulations have been realized in MatLab/Simulink.
{"title":"Sensorless vector control of induction motor using an EKF and SVPWM algorithm","authors":"Yassine Zahraoui, Chaymae Fahassa, M. Akherraz, A. Bennassar","doi":"10.1109/ICMCS.2016.7905584","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905584","url":null,"abstract":"This paper purposes to present a sensorless indirect field oriented control (IFOC) commanded by a space vector algorithm (SV) in goal to guarantee fast response in one hand, and to improve the dynamic performance of a three-phase squirrel cage induction motor drive (SCIM) in the other hand. This numerical algorithm is used by the pulse width modulation (PWM) in order to obtain a control sequence of the inverter switches to generate an output voltage vector that approaches as much as possible to the reference voltage vector. The global control is reinforced by an extended Kalman filter observer (EKF) for the rotor speed estimation. Simulation results show that the proposed vector control with the proposed observer and the numerical algorithm provide good performance dynamic characteristics for different operating modes. The robustness of the overall system is tested under load torque disturbance in order to show the system stability. All simulations have been realized in MatLab/Simulink.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"5 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":"127356245","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.7905524
Mayumbo Nyirenda, Hiroki Arimura, Kimihito Ito
Data access of a massive collection of geographic spatial data is one of the serious bottlenecks in large-scale data-centric applications in the big data era such as data assimilation and urban data analytic systems. In this paper, we consider the issue of implementation of distributed spatial indices, specifically quad trees, on a distributed computing system in the shared-nothing memory approach. We discuss static and dynamic partitioning and allocation strategies for data and queries across distributed nodes. Using scale-down parallel data load and search experiments with a small distributed processor system as proof-of-concept, we show that the proposed approach with a collection of small indices of distributed shared-nothing memory is more efficient than the conventional approach with a single processor with a large external index. We also observed that the proposed tree-based partitioning and assignment strategy using sampling reduces query time than other conventional partitioning strategies used in databases. We also discuss how to allocate a collection of small tree indices among distributed processors. These results suggest that the use of parallelized access to databases with spatial indexing functions can enhance the throughput of large-scale data-centric applications.
{"title":"Relaxing the data access bottleneck of geographic big-data analytics applications using distributed quad trees","authors":"Mayumbo Nyirenda, Hiroki Arimura, Kimihito Ito","doi":"10.1109/ICMCS.2016.7905524","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905524","url":null,"abstract":"Data access of a massive collection of geographic spatial data is one of the serious bottlenecks in large-scale data-centric applications in the big data era such as data assimilation and urban data analytic systems. In this paper, we consider the issue of implementation of distributed spatial indices, specifically quad trees, on a distributed computing system in the shared-nothing memory approach. We discuss static and dynamic partitioning and allocation strategies for data and queries across distributed nodes. Using scale-down parallel data load and search experiments with a small distributed processor system as proof-of-concept, we show that the proposed approach with a collection of small indices of distributed shared-nothing memory is more efficient than the conventional approach with a single processor with a large external index. We also observed that the proposed tree-based partitioning and assignment strategy using sampling reduces query time than other conventional partitioning strategies used in databases. We also discuss how to allocate a collection of small tree indices among distributed processors. These results suggest that the use of parallelized access to databases with spatial indexing functions can enhance the throughput of large-scale data-centric applications.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"61 3 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":"123792128","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.1007/978-3-319-64719-7_29
O. Serrar, A. Tamtaoui
{"title":"Robust video coding based on perceptual unequal protection","authors":"O. Serrar, A. Tamtaoui","doi":"10.1007/978-3-319-64719-7_29","DOIUrl":"https://doi.org/10.1007/978-3-319-64719-7_29","url":null,"abstract":"","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"58 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":"126667215","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.7905642
Anas Abouyahya, S. Fkihi, R. Thami, D. Aboutajdine
The recognition of an expression seems obvious and easy when classified by the human brain. However, it is clearly difficult for a computer to detect human face, extract all of the components characterizing the facial expression and then determine its classification from a single image. Moreover, based on videos, the process becomes even more complex because it must take simultaneously into account the temporal and spatial information available. Also, It should be noted that facial features have an important fact to developing a robust face representation because it aims to select the best of features and reduce dimensionality of features set by finding a new set which contains most of the face features information. For those reasons, this paper present several features extraction approaches for facial expressions recognition as state-of-the-art review.
{"title":"Features extraction for facial expressions recognition","authors":"Anas Abouyahya, S. Fkihi, R. Thami, D. Aboutajdine","doi":"10.1109/ICMCS.2016.7905642","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905642","url":null,"abstract":"The recognition of an expression seems obvious and easy when classified by the human brain. However, it is clearly difficult for a computer to detect human face, extract all of the components characterizing the facial expression and then determine its classification from a single image. Moreover, based on videos, the process becomes even more complex because it must take simultaneously into account the temporal and spatial information available. Also, It should be noted that facial features have an important fact to developing a robust face representation because it aims to select the best of features and reduce dimensionality of features set by finding a new set which contains most of the face features information. For those reasons, this paper present several features extraction approaches for facial expressions recognition as state-of-the-art review.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"13 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":"116955250","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.7905565
Walid Dahhane, Jamal Berrich, T. Bouchentouf, M. Rahmoun
Developing complex systems can be simplified if the designer is guided by a method from Software Engineering. Currently, Agent Oriented Software Engineering methods aim at providing an adaptive engineering process. The method processes have been broken up into different parts called fragments, enabling the mix of different engineering processes' parts to get better adequacy between the system to be done and the process. However, some difficulties remain on the expertise needed to compose these fragments when a number of fragments prevent the composition to be done by hand. The difference between how each method is described is also an obstacle. SEMAT is an initiative to reshape software engineering such that software engineering qualifies as a rigorous discipline, which can facilitate the composition of methods. The first step ends up with a Kernel called Essence adopted as an OMG standard in June 2014. Different software constructors like Red Hat, Google have already applied this kernel to redefine some of their methods and processes. Our aim in this paper is to apply a first recast to OMaSE in terms of the Essence kernel toward an evaluation of its relevance to building a common ground kernel for MAS methodologies.
{"title":"SEMAT Essence's Kernel applied to O-MaSE","authors":"Walid Dahhane, Jamal Berrich, T. Bouchentouf, M. Rahmoun","doi":"10.1109/ICMCS.2016.7905565","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905565","url":null,"abstract":"Developing complex systems can be simplified if the designer is guided by a method from Software Engineering. Currently, Agent Oriented Software Engineering methods aim at providing an adaptive engineering process. The method processes have been broken up into different parts called fragments, enabling the mix of different engineering processes' parts to get better adequacy between the system to be done and the process. However, some difficulties remain on the expertise needed to compose these fragments when a number of fragments prevent the composition to be done by hand. The difference between how each method is described is also an obstacle. SEMAT is an initiative to reshape software engineering such that software engineering qualifies as a rigorous discipline, which can facilitate the composition of methods. The first step ends up with a Kernel called Essence adopted as an OMG standard in June 2014. Different software constructors like Red Hat, Google have already applied this kernel to redefine some of their methods and processes. Our aim in this paper is to apply a first recast to OMaSE in terms of the Essence kernel toward an evaluation of its relevance to building a common ground kernel for MAS methodologies.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"69 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":"114778443","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.7905616
Amina Kharbach, Amar Merdani, B. Bellach, M. Rahmoun
Image registration is an excellent tool in different fields. Its medical applications are various in many clinical situations in order to analyze the patient's situation and to follow the localization of malignant sites. Generally, registration can be categorized according to several criterions. In this work, we are interested in the similarity function, for that we contributed a normalized dissimilarity index. This proposed approach is based on dissimilarity map that is a good tool to compare two images. We implemented this measure in a medical images example. The experimental results show that the proposed method is capable to align both binarized and gray-level images with higher precision.
{"title":"An efficient registration method for medical images based on transform distance","authors":"Amina Kharbach, Amar Merdani, B. Bellach, M. Rahmoun","doi":"10.1109/ICMCS.2016.7905616","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905616","url":null,"abstract":"Image registration is an excellent tool in different fields. Its medical applications are various in many clinical situations in order to analyze the patient's situation and to follow the localization of malignant sites. Generally, registration can be categorized according to several criterions. In this work, we are interested in the similarity function, for that we contributed a normalized dissimilarity index. This proposed approach is based on dissimilarity map that is a good tool to compare two images. We implemented this measure in a medical images example. The experimental results show that the proposed method is capable to align both binarized and gray-level images with higher precision.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"215 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":"124241987","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
扫码关注我们
求助内容：
应助结果提醒方式：