Pub Date : 2019-12-01DOI: 10.1109/CAS47993.2019.9075813
J. Al-Hawasy, M. Jawad
The Galerkin finite elements method (GAFEM) is used to find the numerical solution (NS) of the couple linear elliptic boundary value problem (CLEBVP). The solution of the CLEBVP is approximated by a linear combination of piecewise linear and continuous basis functions, upon substituting this approximated solution into the CLEBVP the problem then reduces to solve a “Galerkin” linear algebraic system (GALAS). This system is solved by using the classical Cholesky method (CChM). Some illustrative examples are given; to show the high efficiency of the GAFEM to solve such for the CLEBVPs. Figures provide the NS with “results”.
采用伽辽金有限元法(GAFEM)求解了一对线性椭圆边值问题的数值解。CLEBVP的解近似为分段线性和连续基函数的线性组合，将该近似解代入CLEBVP后，问题便简化为求解一个“伽辽金”线性代数系统(Galerkin linear algebra system, GALAS)。该系统采用经典的Cholesky方法(CChM)求解。给出了一些说明性实例;证明了GAFEM求解clebvp问题的高效率。图表向统计处提供“结果”。
{"title":"Numerical Solution for Couple Elliptic Boundary Value Problem","authors":"J. Al-Hawasy, M. Jawad","doi":"10.1109/CAS47993.2019.9075813","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075813","url":null,"abstract":"The Galerkin finite elements method (GAFEM) is used to find the numerical solution (NS) of the couple linear elliptic boundary value problem (CLEBVP). The solution of the CLEBVP is approximated by a linear combination of piecewise linear and continuous basis functions, upon substituting this approximated solution into the CLEBVP the problem then reduces to solve a “Galerkin” linear algebraic system (GALAS). This system is solved by using the classical Cholesky method (CChM). Some illustrative examples are given; to show the high efficiency of the GAFEM to solve such for the CLEBVPs. Figures provide the NS with “results”.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124436098","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075719
Ali Mahammed Abd ALrhman, Alaa A. Jabbar
Geographical information systems (GIS) become a popular tool in applications that include spatial objects and relations in the real world. The fast-technological expansions in the applications of web-based, simplifying the interaction between GIS and users. A fundamental problem remains available when dealing with a large amount of data in the GIS. Though the GIS strengths in the process of the spatial domain analysis, the systems of GIS are almost uninformed concerning the handling and analysis in the temporal domain. GIS systems find the path between two points or locations depending on time and speed. Therefore, in these days, considerable efforts are guided on this field towards the short time representation on GIS and safe this road. For accomplishing the particular goals of this paper and improve the usefulness of Google maps for the applications of GIS, this work builds a methodological structure to process vector and attribute data and visualise it. The conceptual model utilised here includes three main portions: firstly, the database tier; secondly, the application tier; and thirdly the client tier. This paper proposes a new spatial decision support system in GIS to find the best route between two locations based on different factors; it calculates the shortest and the fastest route depending on either length like other decision support systems or on other features like road safety or quality road by assigning a value to each road using intelligent algorithms (Dijkstra, Astar). The obtained results show decreasing in the time required to find the best result and adding more features as a cost to help the user to select the suitable road.
{"title":"Decision Support System in GIS to Find Best Route","authors":"Ali Mahammed Abd ALrhman, Alaa A. Jabbar","doi":"10.1109/CAS47993.2019.9075719","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075719","url":null,"abstract":"Geographical information systems (GIS) become a popular tool in applications that include spatial objects and relations in the real world. The fast-technological expansions in the applications of web-based, simplifying the interaction between GIS and users. A fundamental problem remains available when dealing with a large amount of data in the GIS. Though the GIS strengths in the process of the spatial domain analysis, the systems of GIS are almost uninformed concerning the handling and analysis in the temporal domain. GIS systems find the path between two points or locations depending on time and speed. Therefore, in these days, considerable efforts are guided on this field towards the short time representation on GIS and safe this road. For accomplishing the particular goals of this paper and improve the usefulness of Google maps for the applications of GIS, this work builds a methodological structure to process vector and attribute data and visualise it. The conceptual model utilised here includes three main portions: firstly, the database tier; secondly, the application tier; and thirdly the client tier. This paper proposes a new spatial decision support system in GIS to find the best route between two locations based on different factors; it calculates the shortest and the fastest route depending on either length like other decision support systems or on other features like road safety or quality road by assigning a value to each road using intelligent algorithms (Dijkstra, Astar). The obtained results show decreasing in the time required to find the best result and adding more features as a cost to help the user to select the suitable road.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127528550","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075747
Ammar H. Jassem, A. T. Hashim, Suhad A. Ali
Image security is essential, topic through the increase of the image usage in most of communications besides assures information security which is hidden in these images such as military and medical images. Blowfish is outstanding symmetric cryptography, which has the benefits of strong ability to resist attackers. Thus it is widely used in data encryption, but it is not suitable for image encryption because of the huge data, higher redundancy and toughly correlation of image pixels. The proposed enhanced method has been employed Blowfish based image encryption technique. Firstly the digital image is decomposed into several key-based blocks randomly to decorrelated the relationship between original and processed image then each block is passed through the Blowfish algorithm. The proposed system is designed to take advantage of the powerful facility, which is supported by a chaotic map resulting in a much-improved security/performance trade-off. As a result, the proposed system offers good performance for image encryption. To ensure improved Blowfish encryption algorithm, the implementation of both techniques has been carried out for experimental purposes which are showed that the original image has a flat histogram after encrypted, a decreasing correlation between adjacent pixels in all colour components and increasing entropy for the cases studied. A comparative study with previous Blowfish algorithm shows the superiority of the modified algorithm.
{"title":"Enhanced Blowfish Algorithm for Image Encryption Based on Chaotic Map","authors":"Ammar H. Jassem, A. T. Hashim, Suhad A. Ali","doi":"10.1109/CAS47993.2019.9075747","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075747","url":null,"abstract":"Image security is essential, topic through the increase of the image usage in most of communications besides assures information security which is hidden in these images such as military and medical images. Blowfish is outstanding symmetric cryptography, which has the benefits of strong ability to resist attackers. Thus it is widely used in data encryption, but it is not suitable for image encryption because of the huge data, higher redundancy and toughly correlation of image pixels. The proposed enhanced method has been employed Blowfish based image encryption technique. Firstly the digital image is decomposed into several key-based blocks randomly to decorrelated the relationship between original and processed image then each block is passed through the Blowfish algorithm. The proposed system is designed to take advantage of the powerful facility, which is supported by a chaotic map resulting in a much-improved security/performance trade-off. As a result, the proposed system offers good performance for image encryption. To ensure improved Blowfish encryption algorithm, the implementation of both techniques has been carried out for experimental purposes which are showed that the original image has a flat histogram after encrypted, a decreasing correlation between adjacent pixels in all colour components and increasing entropy for the cases studied. A comparative study with previous Blowfish algorithm shows the superiority of the modified algorithm.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128773162","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075489
S. Sadkhan, A. Salah
Speech is one of the means of communication between people throughout the universe, so people want to communicate with each other no matter how far away since wireless networking offers, this feature, the freedom to connect from anywhere and anytime. Because speech is used extensively in wireless networks, it takes much time to encrypt it using well-known cryptographic algorithms, so, speech scrambler techniques have been used in the modern communication systems to overcome this problem. It has proven its presence in protecting data transmitted over wireless networks in the past few years. The main objective of this paper is to compare the systems that use process permutation with the systems that use the substitution process in the speech scrambling technique to protect speech information. To find out which is better use the permutation process or substitution in the technique of speech scrambling in terms of security and quality, security and quality results we will compare between our proposed system, which uses permutation process, with another system, uses substitution process. Based on the values of the segmental signal-to-noise ratio measure (SSNR), Comparison of the above two systems will take place because it used in both systems to evaluate the performance of the system in terms of security and quality of the recovered speech.
{"title":"The trade-off between security and quality using permutation and substitution techniques in speech scrambling system","authors":"S. Sadkhan, A. Salah","doi":"10.1109/CAS47993.2019.9075489","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075489","url":null,"abstract":"Speech is one of the means of communication between people throughout the universe, so people want to communicate with each other no matter how far away since wireless networking offers, this feature, the freedom to connect from anywhere and anytime. Because speech is used extensively in wireless networks, it takes much time to encrypt it using well-known cryptographic algorithms, so, speech scrambler techniques have been used in the modern communication systems to overcome this problem. It has proven its presence in protecting data transmitted over wireless networks in the past few years. The main objective of this paper is to compare the systems that use process permutation with the systems that use the substitution process in the speech scrambling technique to protect speech information. To find out which is better use the permutation process or substitution in the technique of speech scrambling in terms of security and quality, security and quality results we will compare between our proposed system, which uses permutation process, with another system, uses substitution process. Based on the values of the segmental signal-to-noise ratio measure (SSNR), Comparison of the above two systems will take place because it used in both systems to evaluate the performance of the system in terms of security and quality of the recovered speech.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114814305","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075651
Abeer D. Salman, H. B. Abdulwahab
Recently, 3D media and its immersive experience became more attractive and widely used due to the development in network technology and decrease the prices of the display devices. The 3D videos that are created by DIBR techniques are getting a view of interest in the last years because of its visual reality and using it in many applications. Since DIBR takes the original colour with a depth view and generated two virtual views left and right, Copyright protection of DIBR is a difficult task because the centre, left-eye, and right-eye views need to be protected. In this paper, a dynamic, secure, and invariant watermark system is proposed to keep the copyright and ensure the authentication of 3D Video, where different watermark bits are embedded in different locations within the 3D video frame. The watermark bits are secured by encrypting it with the modified stream cipher algorithm. Experiment results show the secured watermark system embeds different watermarks with keeping the quality of the 3D Video system and makes the system more tolerant to attacks and the watermarks are extracted from the centre and generated rendered views correctly with minimum error rate after an attack.
{"title":"Dynamic, Secure, and Invariant Watermarking System for Multiview Plus Depth Video","authors":"Abeer D. Salman, H. B. Abdulwahab","doi":"10.1109/CAS47993.2019.9075651","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075651","url":null,"abstract":"Recently, 3D media and its immersive experience became more attractive and widely used due to the development in network technology and decrease the prices of the display devices. The 3D videos that are created by DIBR techniques are getting a view of interest in the last years because of its visual reality and using it in many applications. Since DIBR takes the original colour with a depth view and generated two virtual views left and right, Copyright protection of DIBR is a difficult task because the centre, left-eye, and right-eye views need to be protected. In this paper, a dynamic, secure, and invariant watermark system is proposed to keep the copyright and ensure the authentication of 3D Video, where different watermark bits are embedded in different locations within the 3D video frame. The watermark bits are secured by encrypting it with the modified stream cipher algorithm. Experiment results show the secured watermark system embeds different watermarks with keeping the quality of the 3D Video system and makes the system more tolerant to attacks and the watermarks are extracted from the centre and generated rendered views correctly with minimum error rate after an attack.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126339797","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075709
Makki A. Mohammed Salih, Jaafer Hmood Eidi
In this paper, we estimated scale parameter and reliability function for Transmuted Inverse Exponential Distribution (TIE) by five estimation methods Median (MED), Modified Moment (MM), Percentile (PER), Regression (REG) and Maximum Likelihood (MLE) methods. Simulation experiments were used to generate random variables by six experiments $(E_{1}, E_{2}, ldots, E_{6})$ and five times for reliability $(t)$ which is explain it in the simulation results section. Finally, Comparisons were made between the obtained results by using Mean Square Error (MSE); the results have been put in tables for comparison purpose. The results indicate that (MLE) estimator for an estimate the scale parameter and reliability function is the best concerning all estimators in four experiments, and (REG) estimator is the best in two experiments.
{"title":"Using Simulation to Estimate Reliability for Transmuted Inverse Exponential Distribution","authors":"Makki A. Mohammed Salih, Jaafer Hmood Eidi","doi":"10.1109/CAS47993.2019.9075709","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075709","url":null,"abstract":"In this paper, we estimated scale parameter and reliability function for Transmuted Inverse Exponential Distribution (TIE) by five estimation methods Median (MED), Modified Moment (MM), Percentile (PER), Regression (REG) and Maximum Likelihood (MLE) methods. Simulation experiments were used to generate random variables by six experiments $(E_{1}, E_{2}, ldots, E_{6})$ and five times for reliability $(t)$ which is explain it in the simulation results section. Finally, Comparisons were made between the obtained results by using Mean Square Error (MSE); the results have been put in tables for comparison purpose. The results indicate that (MLE) estimator for an estimate the scale parameter and reliability function is the best concerning all estimators in four experiments, and (REG) estimator is the best in two experiments.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"666 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134389620","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075461
Ali Muayad Jalil, F. S. Hasan, H. Alabbasi
Conventional speaker identification systems require features that are carefully designed to achieve high identification accuracy rates. With deep learning, these features are learned rather than specifically designed. The improvements of deep neural networks algorithms and techniques lead to an increase in using deep neural networks for speaker identification systems in favour of the conventional systems. In this paper, we use a convolutional neural network with Mel-spectrogram as an input for the identification purpose. The experiments are done on TIMIT dataset to evaluate the proposed CNN architecture and to compare with state-of-the-art systems for clean and noisy speech samples.
{"title":"Speaker identification using convolutional neural network for clean and noisy speech samples","authors":"Ali Muayad Jalil, F. S. Hasan, H. Alabbasi","doi":"10.1109/CAS47993.2019.9075461","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075461","url":null,"abstract":"Conventional speaker identification systems require features that are carefully designed to achieve high identification accuracy rates. With deep learning, these features are learned rather than specifically designed. The improvements of deep neural networks algorithms and techniques lead to an increase in using deep neural networks for speaker identification systems in favour of the conventional systems. In this paper, we use a convolutional neural network with Mel-spectrogram as an input for the identification purpose. The experiments are done on TIMIT dataset to evaluate the proposed CNN architecture and to compare with state-of-the-art systems for clean and noisy speech samples.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114474617","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075463
A. Saleh
In this peeper, some of the numerical methods for solving first order nonlinear Fredholm Integro-Differential Equations [FIDEs] are presented._ The numerical solution of these equations is obtained by using Block by Block method values at each step. The Block methods are used to produce two values of the solution at two successive points as well as formulas of three Blocks are derived from giving three values at each step, and four Blocks are derived from giving four values at each step.
本文给出了求解一阶非线性Fredholm积分-微分方程的一些数值方法。_这些方程的数值解是在每一步使用Block by Block方法的值得到的。Block方法用于在两个连续的点上产生两个解的值，并且通过在每一步给出三个值推导出三个Block的公式，并且通过在每一步给出四个值推导出四个Block。
{"title":"Numerical Solutions of Systems of Nonlinear Fredholm Integro- Differential Equations by Using Block by Block Method","authors":"A. Saleh","doi":"10.1109/CAS47993.2019.9075463","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075463","url":null,"abstract":"In this peeper, some of the numerical methods for solving first order nonlinear Fredholm Integro-Differential Equations [FIDEs] are presented._ The numerical solution of these equations is obtained by using Block by Block method values at each step. The Block methods are used to produce two values of the solution at two successive points as well as formulas of three Blocks are derived from giving three values at each step, and four Blocks are derived from giving four values at each step.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121919890","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075589
M. A. Fleah, Q. Al-Doori
Turbo codes are used to reduce the errors that occur when sending a message through a communication channel. They do that by detecting and correcting these errors. They are widely used in applications that need to transmit the information reliably over a noisy channel, due to their good performance that reaches to the Shannon limit of the channel capacity. This work will design the turbo codes using MATLAB program by two programming methods Simulink and M.file. The Simulink design is used to build the turbo codes and to implement them practically on an FPGA device using VHDL code. While in M.file is used to measure the turbo code performance in terms of Bit Error Rate (BER). BER is tested by changing the parameters of the turbo codes like the codes length, the iteration numbers, also by taking different rates, and the different decoding algorithms. The effect of the puncturing and non-puncturing operation is also presented. Then the obtained simulation results can be compared with each other to discuss which parameters can be used to give the best performance in designing the turbo codes circuit.
{"title":"Design and Implementation of Turbo encoder/ decoder using FPGA","authors":"M. A. Fleah, Q. Al-Doori","doi":"10.1109/CAS47993.2019.9075589","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075589","url":null,"abstract":"Turbo codes are used to reduce the errors that occur when sending a message through a communication channel. They do that by detecting and correcting these errors. They are widely used in applications that need to transmit the information reliably over a noisy channel, due to their good performance that reaches to the Shannon limit of the channel capacity. This work will design the turbo codes using MATLAB program by two programming methods Simulink and M.file. The Simulink design is used to build the turbo codes and to implement them practically on an FPGA device using VHDL code. While in M.file is used to measure the turbo code performance in terms of Bit Error Rate (BER). BER is tested by changing the parameters of the turbo codes like the codes length, the iteration numbers, also by taking different rates, and the different decoding algorithms. The effect of the puncturing and non-puncturing operation is also presented. Then the obtained simulation results can be compared with each other to discuss which parameters can be used to give the best performance in designing the turbo codes circuit.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126663295","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 : 2019-12-01DOI: 10.1109/CAS47993.2019.9075636
Maryem Abd AL-Munem Salman, S. A. Makki
Vehicle detection is one of the important solutions for transposition system problems and can be utilised for different applications. Vehicles consist of deferent iron parts that lead to having a magnetic behaviour or map. This paper presents a new vehicle detection and identification system using magnetic sensors. A specific new system has been designed consisting of a non-magnetic material frame. Four magnetic sensors to detect the magnetic fields around the vehicle have been fixed in the frame in suitable places. Each sensor signal has been measured and transmitted to a PC for storing, analysing and identifying. Signals from magnetic sensors detected when the vehicle passes through the frame. A new database has been built employing the designed identification system used as reference data or reference signals. Two approaches have been used to analyse and identify the vehicle type. The first approach uses normalised cross-correlation depending on Fast Fourier Transform to find the similarity between magnetic sensors signals and the reference signals. The second approach uses a matching pattern approach in which the signals from sensors converted to an image and make a matching between the two patterns to identify the vehicle. The accuracy of the first approach of vehicle identification reached 90%, and the accuracy for the second approach reached 95%. These two approaches, compared with other approaches, gave more accurate results to identify the type of vehicle and distinguish between vehicles of the same type and give a signature to each type/model of the vehicles. Other approaches just detect the vehicle and identify if it is a small or big vehicle.
{"title":"New Vehicle System Identification Based On Magnetic Feature Map","authors":"Maryem Abd AL-Munem Salman, S. A. Makki","doi":"10.1109/CAS47993.2019.9075636","DOIUrl":"https://doi.org/10.1109/CAS47993.2019.9075636","url":null,"abstract":"Vehicle detection is one of the important solutions for transposition system problems and can be utilised for different applications. Vehicles consist of deferent iron parts that lead to having a magnetic behaviour or map. This paper presents a new vehicle detection and identification system using magnetic sensors. A specific new system has been designed consisting of a non-magnetic material frame. Four magnetic sensors to detect the magnetic fields around the vehicle have been fixed in the frame in suitable places. Each sensor signal has been measured and transmitted to a PC for storing, analysing and identifying. Signals from magnetic sensors detected when the vehicle passes through the frame. A new database has been built employing the designed identification system used as reference data or reference signals. Two approaches have been used to analyse and identify the vehicle type. The first approach uses normalised cross-correlation depending on Fast Fourier Transform to find the similarity between magnetic sensors signals and the reference signals. The second approach uses a matching pattern approach in which the signals from sensors converted to an image and make a matching between the two patterns to identify the vehicle. The accuracy of the first approach of vehicle identification reached 90%, and the accuracy for the second approach reached 95%. These two approaches, compared with other approaches, gave more accurate results to identify the type of vehicle and distinguish between vehicles of the same type and give a signature to each type/model of the vehicles. Other approaches just detect the vehicle and identify if it is a small or big vehicle.","PeriodicalId":202291,"journal":{"name":"2019 First International Conference of Computer and Applied Sciences (CAS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126206683","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
扫码关注我们
求助内容：
应助结果提醒方式：