Pub Date : 2018-05-01DOI: 10.1109/WAINA.2018.00140
E. Ogawa, Shigenari Nakamura, T. Enokido, M. Takizawa
In wireless ad-hoc networks, messages have to be energy-efficiently exchanged among neighboring nodes. In our previous studies, the reactive type EAO (Energy-Aware One-to-one routing) and LEU (Low-Energy Unicast Ad-hoc routing) protocols are proposed to unicast messages to the destination node. In the EAO protocol, the total electric energy of nodes and delay time from a source node to a destination node can be reduced compared with the ESU and AODV protocols. However, a source-to-destination route may not be found if the communication range of each node is shorter. In this paper, we newly proposed an IEAO (Improved Energy-Aware One-to-one routing) protocol to overcome the difficulties of the EAO protocol. Here, after a shortest route is found to the destination node, a more energy-efficient prior node is found in nearest neighbor of each node starting from the destination node. In this paper, a neighbor node which has an uncovered neighbor node is selected as a prior node for each node to make a route. In the evaluation, we show the number of nodes in a source-to-destination route can be reduced and a route can be found even in shorter communication range in the IEAO protocol compared with the LEU and EAO protocols.
{"title":"Unicast Routing Protocols to Reduce Electric Energy Consumption in Wireless Ad-Hoc Networks","authors":"E. Ogawa, Shigenari Nakamura, T. Enokido, M. Takizawa","doi":"10.1109/WAINA.2018.00140","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00140","url":null,"abstract":"In wireless ad-hoc networks, messages have to be energy-efficiently exchanged among neighboring nodes. In our previous studies, the reactive type EAO (Energy-Aware One-to-one routing) and LEU (Low-Energy Unicast Ad-hoc routing) protocols are proposed to unicast messages to the destination node. In the EAO protocol, the total electric energy of nodes and delay time from a source node to a destination node can be reduced compared with the ESU and AODV protocols. However, a source-to-destination route may not be found if the communication range of each node is shorter. In this paper, we newly proposed an IEAO (Improved Energy-Aware One-to-one routing) protocol to overcome the difficulties of the EAO protocol. Here, after a shortest route is found to the destination node, a more energy-efficient prior node is found in nearest neighbor of each node starting from the destination node. In this paper, a neighbor node which has an uncovered neighbor node is selected as a prior node for each node to make a route. In the evaluation, we show the number of nodes in a source-to-destination route can be reduced and a route can be found even in shorter communication range in the IEAO protocol compared with the LEU and EAO protocols.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114286805","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00136
Shuo Zhang, S. Wolthusen
Although people use critical, redundant and ordinary categories to concisely distinguish the importance of edges in maintaining controllability of networks in linear time-invariant (LTI) model, a specific network analysis is still uncertain to confirm edges of each category for further edge protection. Given a large, sparse, Erdős-Rényi random digraph with a precomputed maximum matching in LTI model as an input network, we address the problem of efficiently classifying its all edges into those categories. By the minimal input theorem, classifying an edge into one of those categories is modeled into analysing the number of maximum matchings having it, while it is solved by finding maximally-matchable edges via a bipartite graph mapped by the input network. In the worst case, entire edge classification is executed in linear time except for precomputing a maximum matching of the input network.
{"title":"Security-Aware Network Analysis for Network Controllability","authors":"Shuo Zhang, S. Wolthusen","doi":"10.1109/WAINA.2018.00136","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00136","url":null,"abstract":"Although people use critical, redundant and ordinary categories to concisely distinguish the importance of edges in maintaining controllability of networks in linear time-invariant (LTI) model, a specific network analysis is still uncertain to confirm edges of each category for further edge protection. Given a large, sparse, Erdős-Rényi random digraph with a precomputed maximum matching in LTI model as an input network, we address the problem of efficiently classifying its all edges into those categories. By the minimal input theorem, classifying an edge into one of those categories is modeled into analysing the number of maximum matchings having it, while it is solved by finding maximally-matchable edges via a bipartite graph mapped by the input network. In the worst case, entire edge classification is executed in linear time except for precomputing a maximum matching of the input network.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122221041","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00067
K. Uchida, L. Barolli
This paper deals with ray tracing in a closed space such as tunnel or underground by using the numerical method based on Dijkstra algorithm (DA). The essence of the method is to modify the DA based proximity matrix in terms of three procedures, that is, path selection, path linearization and line of sight (LOS) check. This method has successively been applied to ray tracing in an open space such as a random rough surface. When we treat a closed space, however, more detailed discussions are required than in the case of an open space, because we must take account of the effects of floor, ceiling and side walls at the same time. In this paper we propose procedures for LOS check to solve this difficult situation. Numerical examples are shown for the traced rays and cost distributions in sinusoidal and cross type tunnels.
{"title":"Dijkstra Algorithm Based Ray Tracing: A Case Study for Tunnel Structures","authors":"K. Uchida, L. Barolli","doi":"10.1109/WAINA.2018.00067","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00067","url":null,"abstract":"This paper deals with ray tracing in a closed space such as tunnel or underground by using the numerical method based on Dijkstra algorithm (DA). The essence of the method is to modify the DA based proximity matrix in terms of three procedures, that is, path selection, path linearization and line of sight (LOS) check. This method has successively been applied to ray tracing in an open space such as a random rough surface. When we treat a closed space, however, more detailed discussions are required than in the case of an open space, because we must take account of the effects of floor, ceiling and side walls at the same time. In this paper we propose procedures for LOS check to solve this difficult situation. Numerical examples are shown for the traced rays and cost distributions in sinusoidal and cross type tunnels.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126583253","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00153
Deng-Yuan Huang, Chao-Ho Chen, Tsong-Yi Chen, Jian-He Wu, C. Ko
This paper presents a real-time face detection system using a moving camera. The proposed system consists of three modules, including (1) detection of face candidates: Face candidates are generated using the information of skin color, edges, and face area, (2) verification of face candidates: HOG (Histogram of Oriented Gradient) features are generated from face candidates and a two-class C-SVM (Support Vector Machine) classifier with pretrained face samples is employed to determine whether face candidates are real faces or not, (3) face tracking: Overlapping area of two face targets in current and previous frames is estimated to determine whether the tracking will be continuous or not. By use of estimation of face size, the proposed method can avoid a huge amount of computation time that is required by a point-by-point scanning way in conventional methods. Moreover, the accuracy of the face detection can be improved greatly. The proposed system can successfully detect most faces of the crowds in open space, which is beneficial for quickly searching the specified persons to prevent the occurrence of possible criminal events.
本文介绍了一种基于移动摄像机的实时人脸检测系统。该系统由三个模块组成，包括:(1)候选人脸检测:利用肤色、边缘和面部面积信息生成候选人脸;(2)候选人脸验证:从候选人脸中生成HOG (Histogram of Oriented Gradient)特征，并使用预训练的人脸样本进行两类C-SVM(支持向量机)分类器判断候选人脸是否为真实人脸;估计当前帧和前一帧中两个人脸目标的重叠区域，以确定跟踪是否连续。该方法利用人脸尺寸的估计，避免了传统逐点扫描方法所需要的大量计算时间。此外，还可以大大提高人脸检测的准确性。该系统能够成功地检测出开放空间中大多数人群的人脸，有利于快速搜索指定人员，防止可能发生的犯罪事件的发生。
{"title":"Real-Time Face Detection Using a Moving Camera","authors":"Deng-Yuan Huang, Chao-Ho Chen, Tsong-Yi Chen, Jian-He Wu, C. Ko","doi":"10.1109/WAINA.2018.00153","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00153","url":null,"abstract":"This paper presents a real-time face detection system using a moving camera. The proposed system consists of three modules, including (1) detection of face candidates: Face candidates are generated using the information of skin color, edges, and face area, (2) verification of face candidates: HOG (Histogram of Oriented Gradient) features are generated from face candidates and a two-class C-SVM (Support Vector Machine) classifier with pretrained face samples is employed to determine whether face candidates are real faces or not, (3) face tracking: Overlapping area of two face targets in current and previous frames is estimated to determine whether the tracking will be continuous or not. By use of estimation of face size, the proposed method can avoid a huge amount of computation time that is required by a point-by-point scanning way in conventional methods. Moreover, the accuracy of the face detection can be improved greatly. The proposed system can successfully detect most faces of the crowds in open space, which is beneficial for quickly searching the specified persons to prevent the occurrence of possible criminal events.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129350187","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00113
E. Kühn, Stefan Craß
Today, cloud providers cover a huge variety of optimized offers. Many of them are similar, but in detail there exist subtle differences. An example is the automatic scaleout of computing resources if the traffic increases, in order to achieve high availability and fault tolerance. The cloud also supports scaling-in if the load falls again, in order to save costs. The paper aims to abstract such offerings in form of coordination patterns that capture the functional and nonfunctional semantics of the required services in a cloud-agnostic way. Concrete pattern solutions can be deployed on any cloud that provides the respective services, and also be run using a platform-independent middleware.
{"title":"Coordination Pattern-Based Approach for Auto-Scaling in Multi-clouds","authors":"E. Kühn, Stefan Craß","doi":"10.1109/WAINA.2018.00113","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00113","url":null,"abstract":"Today, cloud providers cover a huge variety of optimized offers. Many of them are similar, but in detail there exist subtle differences. An example is the automatic scaleout of computing resources if the traffic increases, in order to achieve high availability and fault tolerance. The cloud also supports scaling-in if the load falls again, in order to save costs. The paper aims to abstract such offerings in form of coordination patterns that capture the functional and nonfunctional semantics of the required services in a cloud-agnostic way. Concrete pattern solutions can be deployed on any cloud that provides the respective services, and also be run using a platform-independent middleware.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114151108","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00151
Burak Kizilkaya, M. Çağlar, F. Al-turjman, E. Ever
Finding a parking spot can become quite stressful especially for the cases where the final destination of the journey is not well known and the parking region is rather complicated with large numbers of spots. Identification of a suitable parking spot can also be considered as an expensive process since it often causes an increase of vehicle traffic which in turn causes a consequent increase of pollution. In this paper, we present a hierarchical approach that helps users to reach a free parking spot easily, in a small area or a city. This solution introduces an approach which makes searching process in car parking applications efficient in terms of time and energy. It introduces two levels of hierarchy to make placement process more efficient. In the first level, algorithm only checks for the nearest car park. At the second level, algorithm focuses on the car park that is the nearest and checks the nearest parking spot in that car park. Using this hierarchical approach, search for an empty spot becomes more time efficient. Simulation results are presented in this study to show the efficiency of the proposed hierarchical approach. Both hierarchical and non-hierarchical approaches are employed for the same scenario in order to show the effectiveness of the new approach. According to simulation results, hierarchical approach is more efficient in terms of search time and energy. Briefly, we investigate how hierarchical approach affects the search algorithms used for car parking applications.
{"title":"An Intelligent Car Park Management System : Hierarchical Placement Algorithm Based on Nearest Location","authors":"Burak Kizilkaya, M. Çağlar, F. Al-turjman, E. Ever","doi":"10.1109/WAINA.2018.00151","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00151","url":null,"abstract":"Finding a parking spot can become quite stressful especially for the cases where the final destination of the journey is not well known and the parking region is rather complicated with large numbers of spots. Identification of a suitable parking spot can also be considered as an expensive process since it often causes an increase of vehicle traffic which in turn causes a consequent increase of pollution. In this paper, we present a hierarchical approach that helps users to reach a free parking spot easily, in a small area or a city. This solution introduces an approach which makes searching process in car parking applications efficient in terms of time and energy. It introduces two levels of hierarchy to make placement process more efficient. In the first level, algorithm only checks for the nearest car park. At the second level, algorithm focuses on the car park that is the nearest and checks the nearest parking spot in that car park. Using this hierarchical approach, search for an empty spot becomes more time efficient. Simulation results are presented in this study to show the efficiency of the proposed hierarchical approach. Both hierarchical and non-hierarchical approaches are employed for the same scenario in order to show the effectiveness of the new approach. According to simulation results, hierarchical approach is more efficient in terms of search time and energy. Briefly, we investigate how hierarchical approach affects the search algorithms used for car parking applications.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116222301","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00069
Bouthaina Smari, M. Labidi, F. Choubani
In this paper, a new design for metamaterial antennas is developed. For this purpose, metamaterial resonant antennas with a mushroom structure based on the zeroth order resonant characteristic of a composite right/lefthanded transmission line (CRLH TL) are investigated. The electromagnetic behavior of this structure is studied, and analytical equivalent-circuit model is proposed. The antenna is proposed for 28 GHz which can be applied for resonance-based millimeter wave circuits. The simulation results show that the antenna has small size and a good bandwidth with range from 27.05 to 28.25 GHz for return loss S11 less than -10 dB. The overall dimension of the antenna is 20.0*22.0*1.6 mm3 including the antenna substrate.
{"title":"Design of a Small Metamtrial Antenna for Millimetric Wave Applications","authors":"Bouthaina Smari, M. Labidi, F. Choubani","doi":"10.1109/WAINA.2018.00069","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00069","url":null,"abstract":"In this paper, a new design for metamaterial antennas is developed. For this purpose, metamaterial resonant antennas with a mushroom structure based on the zeroth order resonant characteristic of a composite right/lefthanded transmission line (CRLH TL) are investigated. The electromagnetic behavior of this structure is studied, and analytical equivalent-circuit model is proposed. The antenna is proposed for 28 GHz which can be applied for resonance-based millimeter wave circuits. The simulation results show that the antenna has small size and a good bandwidth with range from 27.05 to 28.25 GHz for return loss S11 less than -10 dB. The overall dimension of the antenna is 20.0*22.0*1.6 mm3 including the antenna substrate.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121966261","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00068
Amira Kchaou, Ryma Abassi, S. Fatmi
Vehicular Ad-hoc Networks (VANETs) allow communication among vehicles using some fixed equipment on roads. Vehicles share different kinds of information to improve road safety and provide travelers comfort using exchanged messages. However, falsified or modified messages can be propagated which affect the performance of the whole network and cause dangerous situations in roads such as accident, collision, traffic congestion, etc. In order to ensure security communication between vehicles, trust management can be used. Trust is a security concept used to build confident relations between vehicles. Hence, we propose a secure clustering mechanism for messages exchange in VANET. The main contributions provided by this paper concerns the clusters setting up based on vehicles velocity and then the cluster head computes the credibility of message based on the reputation of vehicles.
{"title":"Towards a Secured Clustering Mechanism for Messages Exchange in VANET","authors":"Amira Kchaou, Ryma Abassi, S. Fatmi","doi":"10.1109/WAINA.2018.00068","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00068","url":null,"abstract":"Vehicular Ad-hoc Networks (VANETs) allow communication among vehicles using some fixed equipment on roads. Vehicles share different kinds of information to improve road safety and provide travelers comfort using exchanged messages. However, falsified or modified messages can be propagated which affect the performance of the whole network and cause dangerous situations in roads such as accident, collision, traffic congestion, etc. In order to ensure security communication between vehicles, trust management can be used. Trust is a security concept used to build confident relations between vehicles. Hence, we propose a secure clustering mechanism for messages exchange in VANET. The main contributions provided by this paper concerns the clusters setting up based on vehicles velocity and then the cluster head computes the credibility of message based on the reputation of vehicles.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126286621","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00165
Emanuele Damiano, A. Minutolo, M. Esposito
Extracting information from text corpora is the first step for machines to understand and summarize vast quantities of text that are available in both scientific and more general knowledge repositories. Open Information Extraction (OIE) is a recent unsupervised strategy to extract huge amounts of propositions from massive unstructured data. Most of the existing OIE approaches so far has been focused on English, with only some recent attempts for other languages. Although Italian is a major European language, to the best of our knowledge, no significant research has been conducted in Italian OIE yet. This paper is intended to fill this knowledge gap and presents ItalIE, an Italian OIE system aimed at extracting n-ary propositions from simple sentences made by single clauses. Single clauses are detected in the input sentences and classified with respect to seven patterns defined for the Italian language by exploiting linguistic information from dependency parsing and Italian lexica of verb types. Depending on these patterns, minimal clauses are extracted and, on the top of them, further propositions are generated by opportunely adding optional complements and adverbials. An experimental study is performed on a dataset of 240 simple sentences in Italian, showing a good effectiveness of the system in determining correct clause types and extracting coherent propositions.
{"title":"Open Information Extraction for Italian Sentences","authors":"Emanuele Damiano, A. Minutolo, M. Esposito","doi":"10.1109/WAINA.2018.00165","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00165","url":null,"abstract":"Extracting information from text corpora is the first step for machines to understand and summarize vast quantities of text that are available in both scientific and more general knowledge repositories. Open Information Extraction (OIE) is a recent unsupervised strategy to extract huge amounts of propositions from massive unstructured data. Most of the existing OIE approaches so far has been focused on English, with only some recent attempts for other languages. Although Italian is a major European language, to the best of our knowledge, no significant research has been conducted in Italian OIE yet. This paper is intended to fill this knowledge gap and presents ItalIE, an Italian OIE system aimed at extracting n-ary propositions from simple sentences made by single clauses. Single clauses are detected in the input sentences and classified with respect to seven patterns defined for the Italian language by exploiting linguistic information from dependency parsing and Italian lexica of verb types. Depending on these patterns, minimal clauses are extracted and, on the top of them, further propositions are generated by opportunely adding optional complements and adverbials. An experimental study is performed on a dataset of 240 simple sentences in Italian, showing a good effectiveness of the system in determining correct clause types and extracting coherent propositions.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128363590","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 : 2018-05-01DOI: 10.1109/WAINA.2018.00156
Lung-Jen Wang, W. Hsieh
Unmanned aerial vehicle (UAV)-vision applications are increasingly widespread in recent years, however, the UAV-aerial image causes a blurred condition because there is no power in the high-frequency component of aerial image. To improve the quality of such a blurred image, the image enhancement is an indispensable post-processing method. In this paper, the opportunity cost can be used to improve the non-linear image enhancement method for the UAV blurred image. In addition, a modified non-linear image enhancement scheme by cubic splines and opportunity cost will be proposed. The different non-linear image enhancement methods such as Gaussian-Pyramid and FSD-Pyramid are also compared with the proposed enhancement method.
{"title":"Toward an Improvement of UAV-Aerial Image Using Non-linear Image Enhancement","authors":"Lung-Jen Wang, W. Hsieh","doi":"10.1109/WAINA.2018.00156","DOIUrl":"https://doi.org/10.1109/WAINA.2018.00156","url":null,"abstract":"Unmanned aerial vehicle (UAV)-vision applications are increasingly widespread in recent years, however, the UAV-aerial image causes a blurred condition because there is no power in the high-frequency component of aerial image. To improve the quality of such a blurred image, the image enhancement is an indispensable post-processing method. In this paper, the opportunity cost can be used to improve the non-linear image enhancement method for the UAV blurred image. In addition, a modified non-linear image enhancement scheme by cubic splines and opportunity cost will be proposed. The different non-linear image enhancement methods such as Gaussian-Pyramid and FSD-Pyramid are also compared with the proposed enhancement method.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129639842","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
扫码关注我们
求助内容：
应助结果提醒方式：