Pub Date : 2020-06-02DOI: 10.24003/emitter.v8i1.481
H. Mahmudah, Okkie Puspitorini, A. Wijayanti, N. Siswandari, Yetik Dwi Kusumaningrum
Over time, cellular communication technology developed significantly from year to year. This is due to increasing the number of users and the higher needed. To overcome this problem, many providers increase the number of new base station installations to fill up the customer's needed. The increase number of base stations does not take into account the amount of power consumption produced, where in the cellular network Base Stations (BS) are the most dominant energy consuming equipment estimated at 60% - 80% of the total energy consumption in the cellular industry. In addition, energy waste often occurs in the BS where the emission power will always remain even if the number of users is small. Power consumption and energy savings are important issues at this time because they will affect CO2 emissions in the air. This paper proposes to save energy consumption from BS by turning off BS (sleep mode) if the number of users is small and distributed to other BS (neighboring BS) which is called cell zooming technique. The cell size can zoom out when the load traffic is high and zoom in when the load traffic is low. To determine the central BS and neighboring BS, a sequential to better signal (SBS) scheme is used where this scheme sorts neighboring BS based on the SINR value received (user). The results of this research, base station can be able to save energy 29.12% and reduce CO2 emission around 3580 kg/year. It means saving energy consumption which is also reducing air pollution occurs and this term can be named as green cellular network.
{"title":"Analysis of Energy Consumption Using Sequential to Better Signal (SBS) Scheme for Green Celluler Network","authors":"H. Mahmudah, Okkie Puspitorini, A. Wijayanti, N. Siswandari, Yetik Dwi Kusumaningrum","doi":"10.24003/emitter.v8i1.481","DOIUrl":"https://doi.org/10.24003/emitter.v8i1.481","url":null,"abstract":"Over time, cellular communication technology developed significantly from year to year. This is due to increasing the number of users and the higher needed. To overcome this problem, many providers increase the number of new base station installations to fill up the customer's needed. The increase number of base stations does not take into account the amount of power consumption produced, where in the cellular network Base Stations (BS) are the most dominant energy consuming equipment estimated at 60% - 80% of the total energy consumption in the cellular industry. In addition, energy waste often occurs in the BS where the emission power will always remain even if the number of users is small. Power consumption and energy savings are important issues at this time because they will affect CO2 emissions in the air. This paper proposes to save energy consumption from BS by turning off BS (sleep mode) if the number of users is small and distributed to other BS (neighboring BS) which is called cell zooming technique. The cell size can zoom out when the load traffic is high and zoom in when the load traffic is low. To determine the central BS and neighboring BS, a sequential to better signal (SBS) scheme is used where this scheme sorts neighboring BS based on the SINR value received (user). The results of this research, base station can be able to save energy 29.12% and reduce CO2 emission around 3580 kg/year. It means saving energy consumption which is also reducing air pollution occurs and this term can be named as green cellular network. ","PeriodicalId":40905,"journal":{"name":"EMITTER-International Journal of Engineering Technology","volume":"6 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2020-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88549510","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-06-02DOI: 10.24003/emitter.v8i1.473
A. Noor
Methods for hearing aids sought to compensate for loss in hearing by amplifying signals of interest in the audio band. In real-world, audio signals are prone to outdoor noise which can be destructive for hearing aid. Eliminating interfering noise at high speed and low power consumption became a target for recent researches. Modern hearing compensation technologies use digital signal processing which requires minimum implementation costs to reduce power consumption, as well as avoiding delay in real time processing. In this paper, frequency controlled noise cancellation (FCNC) strategy for hearing aid and audio communication is developed with low complexity and least time delay. The contribution of the current work is made by offering a method that is capable of removing inherent distortion due filter-bank insertion and assigning adaptive filtering to a particular sub-band to remove external noise. The performance of the proposed FCNC was examined under frequency-limited noise, which corrupts particular parts of the audio spectrum. Results showed that the FCNC renders noise-immune audio signals with minimal number of computations and least delay. Mean square error (MSE) plots of the proposed FCNC method reached below -30 dB compared to -25 dB using conventional sub-band method and to -10 dB using standard full-band noise canceller. The proposed FCNC approach gave the lowest number of computations compared to other methods with a total of 346 computations per sample compared to 860 and 512 by conventional sub-band and full-band methods respectively. The time delay using FCNC is the least compared to the other methods.
{"title":"Frequency Controlled Noise Cancellation for Audio and Hearing Purposes","authors":"A. Noor","doi":"10.24003/emitter.v8i1.473","DOIUrl":"https://doi.org/10.24003/emitter.v8i1.473","url":null,"abstract":"Methods for hearing aids sought to compensate for loss in hearing by amplifying signals of interest in the audio band. In real-world, audio signals are prone to outdoor noise which can be destructive for hearing aid. Eliminating interfering noise at high speed and low power consumption became a target for recent researches. Modern hearing compensation technologies use digital signal processing which requires minimum implementation costs to reduce power consumption, as well as avoiding delay in real time processing. In this paper, frequency controlled noise cancellation (FCNC) strategy for hearing aid and audio communication is developed with low complexity and least time delay. The contribution of the current work is made by offering a method that is capable of removing inherent distortion due filter-bank insertion and assigning adaptive filtering to a particular sub-band to remove external noise. The performance of the proposed FCNC was examined under frequency-limited noise, which corrupts particular parts of the audio spectrum. Results showed that the FCNC renders noise-immune audio signals with minimal number of computations and least delay. Mean square error (MSE) plots of the proposed FCNC method reached below -30 dB compared to -25 dB using conventional sub-band method and to -10 dB using standard full-band noise canceller. The proposed FCNC approach gave the lowest number of computations compared to other methods with a total of 346 computations per sample compared to 860 and 512 by conventional sub-band and full-band methods respectively. The time delay using FCNC is the least compared to the other methods.","PeriodicalId":40905,"journal":{"name":"EMITTER-International Journal of Engineering Technology","volume":"34 2 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2020-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90532813","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-06-02DOI: 10.24003/emitter.v8i1.490
Zeynep Bala Duranay, H. Guldemir, Servet Tuncer
DSP implementation of speed control of three phase induction motor drive is presented in this paper. A closed loop speed control has been achieved using constant V/f technique which is a simple scalar control method used to control the magnitude of the control quantities. In this study, a fourth order polynomial drived from V/f curve is constructed instead of using look up table which takes much time for determination of voltage from frequency value. A PI controller is used in speed control. dSPACE DS-1103 controller board is used for the implementation with Matlab/Simulink, which has a simple real time interface. Steady-state speed characteristics and transient responses with various reference speed commands are presented by experimental system. The simulation and experimental results provide a smooth speed response and good performance under various dynamic operations. Real time speed control has been implemented and some results are presented.
{"title":"Implementation of a V/f Controlled Variable Speed Induction Motor Drive","authors":"Zeynep Bala Duranay, H. Guldemir, Servet Tuncer","doi":"10.24003/emitter.v8i1.490","DOIUrl":"https://doi.org/10.24003/emitter.v8i1.490","url":null,"abstract":"DSP implementation of speed control of three phase induction motor drive is presented in this paper. A closed loop speed control has been achieved using constant V/f technique which is a simple scalar control method used to control the magnitude of the control quantities. In this study, a fourth order polynomial drived from V/f curve is constructed instead of using look up table which takes much time for determination of voltage from frequency value. A PI controller is used in speed control. dSPACE DS-1103 controller board is used for the implementation with Matlab/Simulink, which has a simple real time interface. Steady-state speed characteristics and transient responses with various reference speed commands are presented by experimental system. The simulation and experimental results provide a smooth speed response and good performance under various dynamic operations. Real time speed control has been implemented and some results are presented.","PeriodicalId":40905,"journal":{"name":"EMITTER-International Journal of Engineering Technology","volume":"8 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2020-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84681106","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-06-02DOI: 10.24003/emitter.v8i1.468
Agus Priyo Utomo, Idris Winarno, I. Syarif
Currently, cloud computing technology is implemented by many industries in the world. This technology is very promising due to many companies only need to provide relatively smaller capital for their IT infrastructure. Virtualization is the core of cloud computing technology. Virtualization allows one physical machine to runs multiple operating systems. As a result, they do not need a lot of physical infrastructures (servers). However, the existence of virtualization could not guarantee that system failures in the guest operating system can be avoided. In this paper, we discuss the monitoring of hangs in the guest operating system in a virtualized environment without installing a monitoring agent in the guest operating system. There are a number of forensic applications that are useful for analyzing memory, CPU, and I/O, and one of it is called as LibVMI. Drakvuf, black-box binary analysis system, utilizes LibVMI to secure the guest OS. We use the LibVMI library through Drakvuf plugins to monitor processes running on the guest operating system. Therefore, we create a new plugin to Drakvuf to detect Hangs on the guest operating system running on the Xen Hypervisor. The experiment reveals that our application is able to monitor the guest operating system in real-time. However, Extended Page Table (EPT) violations occur during the monitoring process. Consequently, we need to activate the altp2m feature on Xen Hypervisor to by minimizing EPT violations.
{"title":"Towards a Resilient Server with an external VMI in the Virtualization Environment","authors":"Agus Priyo Utomo, Idris Winarno, I. Syarif","doi":"10.24003/emitter.v8i1.468","DOIUrl":"https://doi.org/10.24003/emitter.v8i1.468","url":null,"abstract":"Currently, cloud computing technology is implemented by many industries in the world. This technology is very promising due to many companies only need to provide relatively smaller capital for their IT infrastructure. Virtualization is the core of cloud computing technology. Virtualization allows one physical machine to runs multiple operating systems. As a result, they do not need a lot of physical infrastructures (servers). However, the existence of virtualization could not guarantee that system failures in the guest operating system can be avoided. In this paper, we discuss the monitoring of hangs in the guest operating system in a virtualized environment without installing a monitoring agent in the guest operating system. There are a number of forensic applications that are useful for analyzing memory, CPU, and I/O, and one of it is called as LibVMI. Drakvuf, black-box binary analysis system, utilizes LibVMI to secure the guest OS. We use the LibVMI library through Drakvuf plugins to monitor processes running on the guest operating system. Therefore, we create a new plugin to Drakvuf to detect Hangs on the guest operating system running on the Xen Hypervisor. The experiment reveals that our application is able to monitor the guest operating system in real-time. However, Extended Page Table (EPT) violations occur during the monitoring process. Consequently, we need to activate the altp2m feature on Xen Hypervisor to by minimizing EPT violations.","PeriodicalId":40905,"journal":{"name":"EMITTER-International Journal of Engineering Technology","volume":"65 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2020-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77355163","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-06-02DOI: 10.24003/emitter.v8i1.477
Nur Restu Prayoga, Tresna Maulana Fahrudin, Made Kamisutara, Angga Rahagiyanto, T. Alfath, Latipah, Slamet Winardi, Kunto Eko Susilo
The rejection on ratification of the revision of Indonesian Code Law or known as RKUHP and Corruption Law raises several opinions from various perspectives in social media. Twitter as one of many platforms affected, has more than 19.5 million users in Indonesia. Twitter is one of many social media in Indonesia where people can share their views, arguments, information, and opinions from all points of view. Since Twitter has a great diversity of users, it needs a system which is designed to determine the opinion tendency towards the problems or objects. The purpose of this study is to analyze the sentiment of Twitter users' tweets to reject the revision of the Law whether they have positive or negative sentiments using the Agglomerative Hierarchical Clustering method. The data that being used in this study were obtained from the results of crawling tweets based on hashtag (#) (#ReformasiDikorupsi). The next stage is pre-processing which consists of case folding, tokenizing, cleansing, sanitizing, and stemming. The extraction features Opinion words and Term Frequency (TF) which performs the process automatically. In the clustering stage, two clusters use three approaches; single linkage, complete linkage and average linkage. In the accuracy calculation phase, the writer uses the error ratio, confusion matrix, and silhouette coefficient. Therefore, the results are quite good. From 2408 tweets, the highest accuracy results are 61.6%.
{"title":"Unsupervised Twitter Sentiment Analysis on The Revision of Indonesian Code Law and the Anti-Corruption Law using Combination Method of Opinion Word and Agglomerative Hierarchical Clustering","authors":"Nur Restu Prayoga, Tresna Maulana Fahrudin, Made Kamisutara, Angga Rahagiyanto, T. Alfath, Latipah, Slamet Winardi, Kunto Eko Susilo","doi":"10.24003/emitter.v8i1.477","DOIUrl":"https://doi.org/10.24003/emitter.v8i1.477","url":null,"abstract":"The rejection on ratification of the revision of Indonesian Code Law or known as RKUHP and Corruption Law raises several opinions from various perspectives in social media. Twitter as one of many platforms affected, has more than 19.5 million users in Indonesia. Twitter is one of many social media in Indonesia where people can share their views, arguments, information, and opinions from all points of view. Since Twitter has a great diversity of users, it needs a system which is designed to determine the opinion tendency towards the problems or objects. The purpose of this study is to analyze the sentiment of Twitter users' tweets to reject the revision of the Law whether they have positive or negative sentiments using the Agglomerative Hierarchical Clustering method. The data that being used in this study were obtained from the results of crawling tweets based on hashtag (#) (#ReformasiDikorupsi). The next stage is pre-processing which consists of case folding, tokenizing, cleansing, sanitizing, and stemming. The extraction features Opinion words and Term Frequency (TF) which performs the process automatically. In the clustering stage, two clusters use three approaches; single linkage, complete linkage and average linkage. In the accuracy calculation phase, the writer uses the error ratio, confusion matrix, and silhouette coefficient. Therefore, the results are quite good. From 2408 tweets, the highest accuracy results are 61.6%.","PeriodicalId":40905,"journal":{"name":"EMITTER-International Journal of Engineering Technology","volume":"33 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2020-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90242504","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-06-02DOI: 10.24003/emitter.v8i1.498
Vivi Nur Wijayaningrum, Novi Nur Putriwijaya
Metaheuristic algorithms are often trapped in local optimum solutions when searching for solutions. This problem often occurs in optimization cases involving high dimensions such as data clustering. Imbalance of the exploration and exploitation process is the cause of this condition because search agents are not able to reach the best solution in the search space. In this study, the problem is overcome by modifying the solution update mechanism so that a search agent not only follows another randomly chosen search agent, but also has the opportunity to follow the best search agent. In addition, the balance of exploration and exploitation is also enhanced by the mechanism of updating the awareness probability of each search agent in accordance with their respective abilities in searching for solutions. The improve mechanism makes the proposed algorithm obtain pretty good solutions with smaller computational time compared to Genetic Algorithm and Particle Swarm Optimization. In large datasets, it is proven that the proposed algorithm is able to provide the best solution among the other algorithms.
{"title":"An Improved Crow Search Algorithm for Data Clustering","authors":"Vivi Nur Wijayaningrum, Novi Nur Putriwijaya","doi":"10.24003/emitter.v8i1.498","DOIUrl":"https://doi.org/10.24003/emitter.v8i1.498","url":null,"abstract":"Metaheuristic algorithms are often trapped in local optimum solutions when searching for solutions. This problem often occurs in optimization cases involving high dimensions such as data clustering. Imbalance of the exploration and exploitation process is the cause of this condition because search agents are not able to reach the best solution in the search space. In this study, the problem is overcome by modifying the solution update mechanism so that a search agent not only follows another randomly chosen search agent, but also has the opportunity to follow the best search agent. In addition, the balance of exploration and exploitation is also enhanced by the mechanism of updating the awareness probability of each search agent in accordance with their respective abilities in searching for solutions. The improve mechanism makes the proposed algorithm obtain pretty good solutions with smaller computational time compared to Genetic Algorithm and Particle Swarm Optimization. In large datasets, it is proven that the proposed algorithm is able to provide the best solution among the other algorithms.","PeriodicalId":40905,"journal":{"name":"EMITTER-International Journal of Engineering Technology","volume":"54 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2020-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76572621","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-06-02DOI: 10.24003/emitter.v8i1.486
Anindya Dwi Putri Islamidina, Amang Sudarsono, T. Dutono
Nowadays traveling is the activity that everyone likes the most, but sometimes there is one traveling member who is lost and confused looking for the location of the other members. When traveling, they must bring a smartphone because of its small size and easy to carry anywhere. For this reason, an Android-based smartphone application that is able to send GPS data to all travelling members is proposed. In order to secure data transmission, cryptography and group signature to ensure that only traveling members could find out the location are applied. We use hybrid cryptography, which is a combination of symmetric cryptography using AES and asymmetric cryptography using IB-mRSA. We also add group signature as verification that members are in the same traveling group. The test result showed that the proposed method is safer than the comparison method because the symmetric key is encrypted before the key is distributed, so the attacker can not know the key. The total processing time needed to send data until member get data is 2.01 s.
{"title":"Secure Data Travelling User using Hybrid Cryptosystem with User Privacy Protection","authors":"Anindya Dwi Putri Islamidina, Amang Sudarsono, T. Dutono","doi":"10.24003/emitter.v8i1.486","DOIUrl":"https://doi.org/10.24003/emitter.v8i1.486","url":null,"abstract":"Nowadays traveling is the activity that everyone likes the most, but sometimes there is one traveling member who is lost and confused looking for the location of the other members. When traveling, they must bring a smartphone because of its small size and easy to carry anywhere. For this reason, an Android-based smartphone application that is able to send GPS data to all travelling members is proposed. In order to secure data transmission, cryptography and group signature to ensure that only traveling members could find out the location are applied. We use hybrid cryptography, which is a combination of symmetric cryptography using AES and asymmetric cryptography using IB-mRSA. We also add group signature as verification that members are in the same traveling group. The test result showed that the proposed method is safer than the comparison method because the symmetric key is encrypted before the key is distributed, so the attacker can not know the key. The total processing time needed to send data until member get data is 2.01 s.","PeriodicalId":40905,"journal":{"name":"EMITTER-International Journal of Engineering Technology","volume":"10 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2020-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75431792","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-02-07DOI: 10.14419/ijet.v9i1.14878
Narendra Vg, Dasharathraj K. Shetty
In this paper, we introduce an algorithm for the fitting of bounding rectangle to a closed region of cashew kernel in a given image. We propose an algorithm to automatically compute the coordinates of the vertices closed form solution. Which is based on coordinate geometry and uses the boundary points of regions. The algorithm also computes directions of major and minor axis using least-square approach to compute the orientation of the given cashew kernel. More promising results were obtained by extracting shape features of a cashew kernel, it is proved that these features may predominantly use to make the better distinction of cashew kernels of different grades. The intelligent model was designed using Artificial Neural Network (ANN). The model was trained and tested using Back-Propagation learning algorithm and obtained classification accuracy of 89.74%.
{"title":"White whole (WW) grades cashew kernel’s classification using artificial neural network (ANN)","authors":"Narendra Vg, Dasharathraj K. Shetty","doi":"10.14419/ijet.v9i1.14878","DOIUrl":"https://doi.org/10.14419/ijet.v9i1.14878","url":null,"abstract":"In this paper, we introduce an algorithm for the fitting of bounding rectangle to a closed region of cashew kernel in a given image. We propose an algorithm to automatically compute the coordinates of the vertices closed form solution. Which is based on coordinate geometry and uses the boundary points of regions. The algorithm also computes directions of major and minor axis using least-square approach to compute the orientation of the given cashew kernel. More promising results were obtained by extracting shape features of a cashew kernel, it is proved that these features may predominantly use to make the better distinction of cashew kernels of different grades. The intelligent model was designed using Artificial Neural Network (ANN). The model was trained and tested using Back-Propagation learning algorithm and obtained classification accuracy of 89.74%. ","PeriodicalId":40905,"journal":{"name":"EMITTER-International Journal of Engineering Technology","volume":"29 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91133017","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-01-23DOI: 10.14419/IJET.V9I1.29918
Abdallah El Chakik, Abdul Rahman El Sayed, H. Alabboud, Amer Bakkach
Meshes and point clouds are traditionally used to represent and match 3D shapes. The matching prob-lem can be formulated as finding the best one-to-one correspondence between featured regions of two shapes. This paper presents an efficient and robust 3D matching method using vertices descriptors de-tection to define feature regions and an optimization approach for regions matching. To do so, we compute an invariant shape descriptor map based on 3D surface patches calculated using Zernike coef-ficients. Then, we propose a multi-scale descriptor map to improve the measured descriptor map quali-ty and to deal with noise. In addition, we introduce a linear algorithm for feature regions segmentation according to the descriptor map. Finally, the matching problem is modelled as sub-graph isomorphism problem, which is a combinatorial optimization problem to match feature regions while preserving the geometric. Finally, we show the robustness and stability of our method through many experimental re-sults with respect to scaling, noise, rotation, and translation.
{"title":"An invariant descriptor map for 3D objects matching","authors":"Abdallah El Chakik, Abdul Rahman El Sayed, H. Alabboud, Amer Bakkach","doi":"10.14419/IJET.V9I1.29918","DOIUrl":"https://doi.org/10.14419/IJET.V9I1.29918","url":null,"abstract":"Meshes and point clouds are traditionally used to represent and match 3D shapes. The matching prob-lem can be formulated as finding the best one-to-one correspondence between featured regions of two shapes. This paper presents an efficient and robust 3D matching method using vertices descriptors de-tection to define feature regions and an optimization approach for regions matching. To do so, we compute an invariant shape descriptor map based on 3D surface patches calculated using Zernike coef-ficients. Then, we propose a multi-scale descriptor map to improve the measured descriptor map quali-ty and to deal with noise. In addition, we introduce a linear algorithm for feature regions segmentation according to the descriptor map. Finally, the matching problem is modelled as sub-graph isomorphism problem, which is a combinatorial optimization problem to match feature regions while preserving the geometric. Finally, we show the robustness and stability of our method through many experimental re-sults with respect to scaling, noise, rotation, and translation. ","PeriodicalId":40905,"journal":{"name":"EMITTER-International Journal of Engineering Technology","volume":"64 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2020-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76702762","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-01-11DOI: 10.14419/ijet.v9i1.22231
L. W. Rizkallah, M. F. Ahmed, N. M. Darwish
The Vehicle Routing Problem (VRP) consists of a group of customers that needs to be served. Each customer has a certain demand of goods. A central depot having a fleet of vehicles is responsible for supplying the customers with their demands. The problem is composed of two sub-problems: The first sub-problem is an assignment problem where both the vehicles that will be used as well as the customers assigned to each vehicle are determined. The second sub-problem is the routing problem in which for each vehicle having a number of cus-tomers assigned to it, the order of visits of the customers is determined. Optimal number of vehicles as well as optimal total distance should be achieved. In this paper, an approach for solving the first sub-problem, the assignment problem, is presented. In the approach, a clustering algorithm is proposed for finding the optimal number of vehicles by grouping the customers into clusters where each cluster is visited by one vehicle. This work presents a polynomial time clustering algorithm for finding the optimal number of clusters. Also, a solution to the assignment problem is provided. The proposed approach was evaluated using Solomon’s C1 benchmarks where it reached optimal number of clusters for all the benchmarks in this category. The proposed approach succeeds in solving the assignment problem in VRP achieving a solving time that surpasses the state-of-the-art approaches provided in the literature. It also provides a means of working with varying num-ber of customers without major increase in solving time.
{"title":"A clustering algorithm for solving the vehicle routing assignment problem in polynomial time","authors":"L. W. Rizkallah, M. F. Ahmed, N. M. Darwish","doi":"10.14419/ijet.v9i1.22231","DOIUrl":"https://doi.org/10.14419/ijet.v9i1.22231","url":null,"abstract":"The Vehicle Routing Problem (VRP) consists of a group of customers that needs to be served. Each customer has a certain demand of goods. A central depot having a fleet of vehicles is responsible for supplying the customers with their demands. The problem is composed of two sub-problems: The first sub-problem is an assignment problem where both the vehicles that will be used as well as the customers assigned to each vehicle are determined. The second sub-problem is the routing problem in which for each vehicle having a number of cus-tomers assigned to it, the order of visits of the customers is determined. Optimal number of vehicles as well as optimal total distance should be achieved. In this paper, an approach for solving the first sub-problem, the assignment problem, is presented. In the approach, a clustering algorithm is proposed for finding the optimal number of vehicles by grouping the customers into clusters where each cluster is visited by one vehicle. This work presents a polynomial time clustering algorithm for finding the optimal number of clusters. Also, a solution to the assignment problem is provided. The proposed approach was evaluated using Solomon’s C1 benchmarks where it reached optimal number of clusters for all the benchmarks in this category. The proposed approach succeeds in solving the assignment problem in VRP achieving a solving time that surpasses the state-of-the-art approaches provided in the literature. It also provides a means of working with varying num-ber of customers without major increase in solving time. ","PeriodicalId":40905,"journal":{"name":"EMITTER-International Journal of Engineering Technology","volume":"140 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2020-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77518073","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
扫码关注我们
求助内容：
应助结果提醒方式：