Pub Date : 2019-10-01DOI: 10.1109/ISMSIT.2019.8932749
Onur Çelebi, Cem Ergin, Ayça Badem, Fulya Akdeniz, Y. Becerikli
Plants are an important factor in conservation the ecological balance. There are thousands of plant species in the world. Due to the diversity of plant species, it is very important that plant species can be detected accurately and automatically. In the study, a mobile application developed based on server which automatically detects plant species from leaf images. Flavia and Swedish databases were used in the study. Morphological properties of the leaf and local binary pattern (LBP) algorithm were used as feature extraction method. Firebase platform was used in the study to reduce the load of the mobile device using the application and also to increase the speed of the application. In the classification, support vector machines and k-nearest neighborhood methods were used. The best accuracy in the study has found to be 86% using support vector machine algorithm.
{"title":"Performance Comparison of Support Vector Machine and K-Nearest Neighbor Algorithms in Leaf Recognition System Based on Android Operating System","authors":"Onur Çelebi, Cem Ergin, Ayça Badem, Fulya Akdeniz, Y. Becerikli","doi":"10.1109/ISMSIT.2019.8932749","DOIUrl":"https://doi.org/10.1109/ISMSIT.2019.8932749","url":null,"abstract":"Plants are an important factor in conservation the ecological balance. There are thousands of plant species in the world. Due to the diversity of plant species, it is very important that plant species can be detected accurately and automatically. In the study, a mobile application developed based on server which automatically detects plant species from leaf images. Flavia and Swedish databases were used in the study. Morphological properties of the leaf and local binary pattern (LBP) algorithm were used as feature extraction method. Firebase platform was used in the study to reduce the load of the mobile device using the application and also to increase the speed of the application. In the classification, support vector machines and k-nearest neighborhood methods were used. The best accuracy in the study has found to be 86% using support vector machine algorithm.","PeriodicalId":169791,"journal":{"name":"2019 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134174668","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-10-01DOI: 10.1109/ISMSIT.2019.8932733
Serdar Ekinci, B. Hekimoğlu, Erdal Eker, Davut Sevim
In this study, a new design approach using HFPSO algorithm, which is obtained by hybridization of firefly algorithm (FA) with particle swarm optimization (PSO) algorithm is presented for the adjustment of proportional-integral-derivative (PID) controller parameters in a buck converter. Using the proposed approach, it is aimed to improve the stability profile of the relevant system. In order to demonstrate the superiority of the proposed HFPSO-based PID (HFPSO/PID) controller, stability analyzes in time domain and frequency domain, and disturbance suppression analysis were performed comparatively. The results obtained from analyzes showed that the proposed HFPSO/PID controller is more efficient than the whale optimization algorithm (WOA) based PID (WOA/PID) controller and genetic algorithm (GA) based PID (GA/PID) controller to improve the control performance of the buck converter.
{"title":"Hybrid Firefly and Particle Swarm Optimization Algorithm for PID Controller Design of Buck Converter","authors":"Serdar Ekinci, B. Hekimoğlu, Erdal Eker, Davut Sevim","doi":"10.1109/ISMSIT.2019.8932733","DOIUrl":"https://doi.org/10.1109/ISMSIT.2019.8932733","url":null,"abstract":"In this study, a new design approach using HFPSO algorithm, which is obtained by hybridization of firefly algorithm (FA) with particle swarm optimization (PSO) algorithm is presented for the adjustment of proportional-integral-derivative (PID) controller parameters in a buck converter. Using the proposed approach, it is aimed to improve the stability profile of the relevant system. In order to demonstrate the superiority of the proposed HFPSO-based PID (HFPSO/PID) controller, stability analyzes in time domain and frequency domain, and disturbance suppression analysis were performed comparatively. The results obtained from analyzes showed that the proposed HFPSO/PID controller is more efficient than the whale optimization algorithm (WOA) based PID (WOA/PID) controller and genetic algorithm (GA) based PID (GA/PID) controller to improve the control performance of the buck converter.","PeriodicalId":169791,"journal":{"name":"2019 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124583031","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-10-01DOI: 10.1109/ISMSIT.2019.8932729
Buse Asena Koca, Burakhan Çubukçu, Uğur Yüzgeç
In recent years, Augmented Reality (AR) applications have been introduced especially in a number of different areas by being used more advanced lenses in the cameras in addition to the processor and image processing capacities of smart phones. Nowadays, from Mobile AR games to entertainment applications, from online shopping to Industry 4.0 solutions, Augmented Reality has become one of the most used technologies. Within the scope of this study, the principle of the fun learning of children in preschool age in Turkey has been discussed. An AR application was developed for preschool children to make their learning more fun. In this AR application, Unity 3D platform and Vuforia SDK Augmented Reality Library were utilized.
{"title":"Augmented Reality Application for Preschool Children with Unity 3D Platform","authors":"Buse Asena Koca, Burakhan Çubukçu, Uğur Yüzgeç","doi":"10.1109/ISMSIT.2019.8932729","DOIUrl":"https://doi.org/10.1109/ISMSIT.2019.8932729","url":null,"abstract":"In recent years, Augmented Reality (AR) applications have been introduced especially in a number of different areas by being used more advanced lenses in the cameras in addition to the processor and image processing capacities of smart phones. Nowadays, from Mobile AR games to entertainment applications, from online shopping to Industry 4.0 solutions, Augmented Reality has become one of the most used technologies. Within the scope of this study, the principle of the fun learning of children in preschool age in Turkey has been discussed. An AR application was developed for preschool children to make their learning more fun. In this AR application, Unity 3D platform and Vuforia SDK Augmented Reality Library were utilized.","PeriodicalId":169791,"journal":{"name":"2019 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124749330","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-10-01DOI: 10.1109/ISMSIT.2019.8932905
Cem Bugra Alkan, Z. Işik
RNA-sequencing data is used to measure mRNA levels of genes based on tissue or blood samples. The critical changes in transcriptome can be observed more accurately by using RNA-sequencing data that eventually leads to understanding different behavior of the disease. In this study, different feature selection methods and machine learning algorithms are compared for the accurate classification of cancer types by using RNA-sequencing data from blood samples. In the analysis, seven cancer types were compared with each other and healthy samples. Correlation coefficient and information gain analysis are applied as feature selection methods. The selected genes are provided as the input of Support Vector Machine (SVM), Naïve Bayes (NB), and Random Forest (RF) methods. All machine learning methods were evaluated by applying 10-fold cross-validation. In the experiments, machine learning models achieved higher than 85% accuracy in the discrimination of hepatobiliary, lung, and pancreatic cancer types. When machine learning models are evaluated in terms of accuracy, RF and SVM were more successful than NB in many cases.
{"title":"Characterization of Cancer Types by Applying Machine Learning Methods on Blood RNA-Sequencing Data","authors":"Cem Bugra Alkan, Z. Işik","doi":"10.1109/ISMSIT.2019.8932905","DOIUrl":"https://doi.org/10.1109/ISMSIT.2019.8932905","url":null,"abstract":"RNA-sequencing data is used to measure mRNA levels of genes based on tissue or blood samples. The critical changes in transcriptome can be observed more accurately by using RNA-sequencing data that eventually leads to understanding different behavior of the disease. In this study, different feature selection methods and machine learning algorithms are compared for the accurate classification of cancer types by using RNA-sequencing data from blood samples. In the analysis, seven cancer types were compared with each other and healthy samples. Correlation coefficient and information gain analysis are applied as feature selection methods. The selected genes are provided as the input of Support Vector Machine (SVM), Naïve Bayes (NB), and Random Forest (RF) methods. All machine learning methods were evaluated by applying 10-fold cross-validation. In the experiments, machine learning models achieved higher than 85% accuracy in the discrimination of hepatobiliary, lung, and pancreatic cancer types. When machine learning models are evaluated in terms of accuracy, RF and SVM were more successful than NB in many cases.","PeriodicalId":169791,"journal":{"name":"2019 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125213634","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-10-01DOI: 10.1109/ISMSIT.2019.8932955
B. Kaleci, Kaya Turgut
In indoor environments, segmentation of planar surfaces such as wall, floor, and door can contribute the efficiency of robots in performing tasks. In this study, a split and merge based method is developed to segment planar surfaces via point cloud data in indoor environments. Apart from the previous split and merge studies, fixed-size regions are used instead of octree data structure. In this way, the segmentation time can be decreased as low as possible. In the split phase, the fixed-size regions are assigned to one of the three categories, the outer edge, the inner edge, and the non-edge. In the merge phase, each of these categories is processed separately. Thus, the segmentation success can be increased. The proposed method is tested with point cloud data captured in ESOGU Electrical Engineering Laboratory building modelled in Gazebo simulation environment. In addition, RANSAC and region growing methods are implemented for comparison. Experiments are conducted to analyze performance of the proposed method in terms of segmentation time and segmentation success.
{"title":"Plane Segmentation of Point Cloud Data Using Split and Merge Based Method","authors":"B. Kaleci, Kaya Turgut","doi":"10.1109/ISMSIT.2019.8932955","DOIUrl":"https://doi.org/10.1109/ISMSIT.2019.8932955","url":null,"abstract":"In indoor environments, segmentation of planar surfaces such as wall, floor, and door can contribute the efficiency of robots in performing tasks. In this study, a split and merge based method is developed to segment planar surfaces via point cloud data in indoor environments. Apart from the previous split and merge studies, fixed-size regions are used instead of octree data structure. In this way, the segmentation time can be decreased as low as possible. In the split phase, the fixed-size regions are assigned to one of the three categories, the outer edge, the inner edge, and the non-edge. In the merge phase, each of these categories is processed separately. Thus, the segmentation success can be increased. The proposed method is tested with point cloud data captured in ESOGU Electrical Engineering Laboratory building modelled in Gazebo simulation environment. In addition, RANSAC and region growing methods are implemented for comparison. Experiments are conducted to analyze performance of the proposed method in terms of segmentation time and segmentation success.","PeriodicalId":169791,"journal":{"name":"2019 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131623967","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-10-01DOI: 10.1109/ISMSIT.2019.8932796
Buse Garip, Burakhan Çubukçu, Zafer Serin, Uğur Yüzgeç
Uzun süre hareketsiz kalmak başta kas hastalıkları olmak üzere pek çok hastalığa sebep olmaktadır. Buna rağmen pek çok insan tüm günü masa başında oturarak geçirmektedir. Bu durum bel, sırt, boyun, omuz bölgelerinde rahatsızlıklara sebep olabilmektedir. Bu ağrıları yaşamamak için gün içinde kısa süreli egzersizler yapmak önemlidir. Çalışma koşullarında buna ayıracak vakit yokmuş gibi görünse de yapılacak birkaç değişiklikle bu zaman sağlanabilir. Bu çalışmada, ofis çalışanlarının tüm gününün oturarak geçmemesi, kısa süreli egzersizler yapmaları için Unity ve Microsoft Kinect v2 kullanılarak bir egzersiz oyunu geliştirilmiştir. Uygulama C# yazılım dili kullanılarak Visual Studio ortamında gerçekleştirilmiştir. Çalışmada egzersizleri eğlenceli bir hale getirerek, ofis çalışanlarının egzersiz yapmaya teşvik edilmesi amaçlanmaktadır. Çalışanların bölgesel ağrılarının azalması ile iş motivasyonlarının da artması ve daha verimli çalışmaları hedeflenmektedir.(p)(/p)Staying immobilized for a long time causes many diseases, especially muscular diseases. However, many people spend all day sitting at the desk. This can cause discomfort in the waist, back, neck, shoulder areas. It is important to do brief exercises during the day to avoid these aches. Even though it seems like there is no time to spare in working conditions, this can be achieved with a few changes to be made. In this study, an exercise game was developed using Unity and Microsoft Kinect v2 to make sure that office workers do not sit around all day and do short-time exercises. The application was implemented in the Visual Studio environment using the C # software language. It is intended to encourage office workers to exercise by making exercises fun in the workplace. It is aimed to increase work motivations and to work more efficiently by decreasing the regional pain of the employees.
长期不运动会导致许多疾病，尤其是肌肉疾病。尽管如此，许多人还是整天坐在办公桌前。这会导致腰部、背部、颈部和肩部不适。为了避免这些疼痛，在白天进行短期锻炼非常重要。虽然在工作条件下似乎没有时间这样做，但只要做出一些改变，就可以提供这样的时间。在这项研究中，我们使用 Unity 和 Microsoft Kinect v2 开发了一款运动游戏，这样上班族就不用整天坐着做短期运动了。该应用是在 Visual Studio 环境中使用 C# 软件语言实现的。这项研究旨在通过增加运动的趣味性来鼓励上班族锻炼身体。(p)(/p)长期坐着不动会导致许多疾病，尤其是肌肉疾病。然而，许多人整天坐在办公桌前。这可能会引起腰、背、颈、肩等部位的不适。为了避免这些疼痛，在白天做一些简单的运动非常重要。尽管在工作条件下似乎没有多余的时间，但只要做出一些改变，就能实现这一目标。在这项研究中，我们使用 Unity 和 Microsoft Kinect v2 开发了一款运动游戏，以确保上班族不会整天坐着做短时间运动。该应用程序是在 Visual Studio 环境中使用 C# 软件语言实现的。其目的是通过在工作场所增加运动的趣味性来鼓励上班族锻炼身体。其目的是通过减少员工的区域性疼痛来提高工作积极性和工作效率。
{"title":"Kinect based Office Exercises: BreakOut","authors":"Buse Garip, Burakhan Çubukçu, Zafer Serin, Uğur Yüzgeç","doi":"10.1109/ISMSIT.2019.8932796","DOIUrl":"https://doi.org/10.1109/ISMSIT.2019.8932796","url":null,"abstract":"Uzun süre hareketsiz kalmak başta kas hastalıkları olmak üzere pek çok hastalığa sebep olmaktadır. Buna rağmen pek çok insan tüm günü masa başında oturarak geçirmektedir. Bu durum bel, sırt, boyun, omuz bölgelerinde rahatsızlıklara sebep olabilmektedir. Bu ağrıları yaşamamak için gün içinde kısa süreli egzersizler yapmak önemlidir. Çalışma koşullarında buna ayıracak vakit yokmuş gibi görünse de yapılacak birkaç değişiklikle bu zaman sağlanabilir. Bu çalışmada, ofis çalışanlarının tüm gününün oturarak geçmemesi, kısa süreli egzersizler yapmaları için Unity ve Microsoft Kinect v2 kullanılarak bir egzersiz oyunu geliştirilmiştir. Uygulama C# yazılım dili kullanılarak Visual Studio ortamında gerçekleştirilmiştir. Çalışmada egzersizleri eğlenceli bir hale getirerek, ofis çalışanlarının egzersiz yapmaya teşvik edilmesi amaçlanmaktadır. Çalışanların bölgesel ağrılarının azalması ile iş motivasyonlarının da artması ve daha verimli çalışmaları hedeflenmektedir.(p)(/p)Staying immobilized for a long time causes many diseases, especially muscular diseases. However, many people spend all day sitting at the desk. This can cause discomfort in the waist, back, neck, shoulder areas. It is important to do brief exercises during the day to avoid these aches. Even though it seems like there is no time to spare in working conditions, this can be achieved with a few changes to be made. In this study, an exercise game was developed using Unity and Microsoft Kinect v2 to make sure that office workers do not sit around all day and do short-time exercises. The application was implemented in the Visual Studio environment using the C # software language. It is intended to encourage office workers to exercise by making exercises fun in the workplace. It is aimed to increase work motivations and to work more efficiently by decreasing the regional pain of the employees.","PeriodicalId":169791,"journal":{"name":"2019 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134301733","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-10-01DOI: 10.1109/ISMSIT.2019.8932868
Abdullah Taha Arslan, E. Seke
Depth maps depict pixel-wise depth association with a 2D digital image. Point clouds generation and 3D surface reconstruction can be conducted by processing a depth map. Estimating a corresponding depth map from a given input image is an important and difficult task in the computer vision field. Fortunately, with the advent of artificial intelligence, and especially deep learning based techniques new approaches for difficult tasks have been developed. One of the attractive structures is named as Generative Adversarial Network (GAN). However, training a GAN has been reported to be problematic in terms of optimization leading to some convergence issues. Vanishing or exploding gradients and mode collapses are some examples of these issues. Lately, several alternative optimization functions and distance measures have been investigated in order to handle these difficulties. Among these approaches, Wasserstein-1 distance and Wasserstein GAN (WGAN) offers a promising alternative. In this study, Wasserstein functions and its variants are investigated for the depth map estimation task from a given 2D face image. Different network structures are trained and compared in order to assess the effectiveness and stability. Quantitative analysis is conducted by calculating two separate error metrics between the network outputs and ground-truth values.
深度图描述了与二维数字图像的逐像素深度关联。通过深度图的处理，可以实现点云的生成和三维曲面的重建。从给定的输入图像中估计出相应的深度图是计算机视觉领域的一个重要而困难的任务。幸运的是，随着人工智能的出现，特别是基于深度学习的技术，已经开发出了解决困难任务的新方法。其中一种有吸引力的结构被称为生成对抗网络(GAN)。然而，据报道，训练GAN在优化方面存在问题，导致一些收敛问题。消失或爆炸梯度和模式崩溃是这些问题的一些例子。最近，为了解决这些困难，研究了几种备选优化函数和距离度量。在这些方法中，Wasserstein-1距离和Wasserstein GAN (WGAN)提供了一个很有前途的选择。在本研究中，研究了Wasserstein函数及其变体对给定二维人脸图像的深度图估计任务的影响。对不同的网络结构进行训练和比较，以评估其有效性和稳定性。通过计算网络输出与接地真值之间的两个单独的误差度量来进行定量分析。
{"title":"Training Wasserstein GANs for Estimating Depth Maps","authors":"Abdullah Taha Arslan, E. Seke","doi":"10.1109/ISMSIT.2019.8932868","DOIUrl":"https://doi.org/10.1109/ISMSIT.2019.8932868","url":null,"abstract":"Depth maps depict pixel-wise depth association with a 2D digital image. Point clouds generation and 3D surface reconstruction can be conducted by processing a depth map. Estimating a corresponding depth map from a given input image is an important and difficult task in the computer vision field. Fortunately, with the advent of artificial intelligence, and especially deep learning based techniques new approaches for difficult tasks have been developed. One of the attractive structures is named as Generative Adversarial Network (GAN). However, training a GAN has been reported to be problematic in terms of optimization leading to some convergence issues. Vanishing or exploding gradients and mode collapses are some examples of these issues. Lately, several alternative optimization functions and distance measures have been investigated in order to handle these difficulties. Among these approaches, Wasserstein-1 distance and Wasserstein GAN (WGAN) offers a promising alternative. In this study, Wasserstein functions and its variants are investigated for the depth map estimation task from a given 2D face image. Different network structures are trained and compared in order to assess the effectiveness and stability. Quantitative analysis is conducted by calculating two separate error metrics between the network outputs and ground-truth values.","PeriodicalId":169791,"journal":{"name":"2019 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133632621","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-10-01DOI: 10.1109/ISMSIT.2019.8932742
Haydar Tuna, R. Demirci
Chain codes are major techniques for shape representation. Shell-based chain code, which is one of the related approaches is invariant to rotation. In the shell chain code, the chain code symbols are determined by using distances between the boundary points and the center of gravity of objects. The similarity between the chain codes can be found by means of text comparison metric such as Levenshtein. Nevertheless, the main drawback of the method is that the cost of text similarity computation increases as the length of the chain code increases. On the other hand, the computation cost could be reduced by resizing chain codes. In this paper, the performance of the resized shell-based chain code has been examined. Four rotated shapes were used for testing the proposed method and their chain codes were compared with Levenshtein similarity metric. The obtained results confirm that there is no significant decrease in the performance of similarity computation with the resized shell chain codes.
{"title":"Investigation of Resized Shell Chain Code Behavior in Rotated Shapes","authors":"Haydar Tuna, R. Demirci","doi":"10.1109/ISMSIT.2019.8932742","DOIUrl":"https://doi.org/10.1109/ISMSIT.2019.8932742","url":null,"abstract":"Chain codes are major techniques for shape representation. Shell-based chain code, which is one of the related approaches is invariant to rotation. In the shell chain code, the chain code symbols are determined by using distances between the boundary points and the center of gravity of objects. The similarity between the chain codes can be found by means of text comparison metric such as Levenshtein. Nevertheless, the main drawback of the method is that the cost of text similarity computation increases as the length of the chain code increases. On the other hand, the computation cost could be reduced by resizing chain codes. In this paper, the performance of the resized shell-based chain code has been examined. Four rotated shapes were used for testing the proposed method and their chain codes were compared with Levenshtein similarity metric. The obtained results confirm that there is no significant decrease in the performance of similarity computation with the resized shell chain codes.","PeriodicalId":169791,"journal":{"name":"2019 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132244379","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}
Since decades, scientists have been using diver’s and expensive gadgets to explore the unseen world of sea. This exploration is important not only to conduct underwater research and exploration, but also for the defense related tasks. The objective of this paper is to give a concept of small unarmed underwater vehicle UUV that could be used for underwater research and exploration. The proposed vehicle would not only accomplish the given tasks but should also be cost effective so that could replace the expensive gadgets. In this paper, the cost analysis and designing parameters of such UUV has been discussed in quite detail.
{"title":"Design and Analysis of Un-armed Underwater Vehicle (UUV)","authors":"Atif Saeed, Monahil Fatima, Syeda Ansa, Fahad Mairaj","doi":"10.1109/ISMSIT.2019.8932920","DOIUrl":"https://doi.org/10.1109/ISMSIT.2019.8932920","url":null,"abstract":"Since decades, scientists have been using diver’s and expensive gadgets to explore the unseen world of sea. This exploration is important not only to conduct underwater research and exploration, but also for the defense related tasks. The objective of this paper is to give a concept of small unarmed underwater vehicle UUV that could be used for underwater research and exploration. The proposed vehicle would not only accomplish the given tasks but should also be cost effective so that could replace the expensive gadgets. In this paper, the cost analysis and designing parameters of such UUV has been discussed in quite detail.","PeriodicalId":169791,"journal":{"name":"2019 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133856721","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-10-01DOI: 10.1109/ISMSIT.2019.8932843
S. Eyupoglu
Repellent is a general title for the substance which removes insects from human and domestic animals. Repellent substances are used for blood-sucking and disturbing insects in close and open areas. Repellent substances are extremely useful in the struggle with insects. However, especially synthetic insect repellents are toxin for human and animals. In this study, identification of repellents, mechanism of action, properties of repellents and repellent natural oils are investigated.
{"title":"Investigation of Insect Repellent Essential Oils","authors":"S. Eyupoglu","doi":"10.1109/ISMSIT.2019.8932843","DOIUrl":"https://doi.org/10.1109/ISMSIT.2019.8932843","url":null,"abstract":"Repellent is a general title for the substance which removes insects from human and domestic animals. Repellent substances are used for blood-sucking and disturbing insects in close and open areas. Repellent substances are extremely useful in the struggle with insects. However, especially synthetic insect repellents are toxin for human and animals. In this study, identification of repellents, mechanism of action, properties of repellents and repellent natural oils are investigated.","PeriodicalId":169791,"journal":{"name":"2019 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121303745","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
扫码关注我们
求助内容：
应助结果提醒方式：