A performance of two learning mechanisms for small mobile robots is performed in this paper. Relational reinforcement learning, and radial basis function neural network learned by evolutionary algorithm are trained to perform the same maze exploration task and the results were compared in terms learning speed, accuracy and compactness of the resulting control mechanisms. Advantages of the chosen methods are discussed.
{"title":"Performance Comparison of Relational Reinforcement Learning and RBF Neural Networks for Small Mobile Robots","authors":"Roman Neruda, S. Slusny, P. Vidnerová","doi":"10.1109/FGCNS.2008.133","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.133","url":null,"abstract":"A performance of two learning mechanisms for small mobile robots is performed in this paper. Relational reinforcement learning, and radial basis function neural network learned by evolutionary algorithm are trained to perform the same maze exploration task and the results were compared in terms learning speed, accuracy and compactness of the resulting control mechanisms. Advantages of the chosen methods are discussed.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121834085","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}
This study suggests using a selected geometric invariant point through the whole processing procedure of an image and inserting and extracting based on the invariant point so that it will be robust in a geometric transformation attack. The introduced algorithm here is based on a watershed splittling method in order to make medical images strong against RST transformation and other processing. It also helps to maintain the watermark in images that are compressed and stored for a period of time.
{"title":"Design of a Robust Watermarking Algorithm against the Geometric Distortion for Medical Image Security","authors":"Guan-tack Oh, Yun-bae Lee, Min-Six Jung, Soon-ja Yeom","doi":"10.1109/FGCNS.2008.23","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.23","url":null,"abstract":"This study suggests using a selected geometric invariant point through the whole processing procedure of an image and inserting and extracting based on the invariant point so that it will be robust in a geometric transformation attack. The introduced algorithm here is based on a watershed splittling method in order to make medical images strong against RST transformation and other processing. It also helps to maintain the watermark in images that are compressed and stored for a period of time.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115942382","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}
Lots of researches and applications on the automated overhead cranes in shops have been done for some decades, but a few successful results are reported. A more reasonable control system fit to requirements of manufacturing industries is suggested in the study. The controller was designed in the continuous time domain by loop-shaping method. Sway of the rope is suppressed by anti-sway control method. The sway angle of the rope is measured by a sway angle sensor which is mechanically in contact with the rope. The real-time control law is comprised of the position and the anti-sway controller. Some algorithms required for coil yard operation as well as main control algorithms such as reference position generation, position control and anti-sway control have been designed and fully tested on a crane in the steel-making works. The designed crane control system showed satisfactory performance on position control accuracy and anti-sway of rope. The maximum positional error is 20 mm and the maximum sway error is 0.07 degrees in the destination position.
{"title":"Automatic Coil-Handling Crane Control System","authors":"Chintae Choi, K. You, H. Jeong","doi":"10.1109/FGCNS.2008.116","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.116","url":null,"abstract":"Lots of researches and applications on the automated overhead cranes in shops have been done for some decades, but a few successful results are reported. A more reasonable control system fit to requirements of manufacturing industries is suggested in the study. The controller was designed in the continuous time domain by loop-shaping method. Sway of the rope is suppressed by anti-sway control method. The sway angle of the rope is measured by a sway angle sensor which is mechanically in contact with the rope. The real-time control law is comprised of the position and the anti-sway controller. Some algorithms required for coil yard operation as well as main control algorithms such as reference position generation, position control and anti-sway control have been designed and fully tested on a crane in the steel-making works. The designed crane control system showed satisfactory performance on position control accuracy and anti-sway of rope. The maximum positional error is 20 mm and the maximum sway error is 0.07 degrees in the destination position.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128985198","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}
In this paper, we propose an applicable technique in the real time applications using FPGA chip implementation technique which can be implemented by Haar wavelet based real time video watermarking for robust watermarking for copyright protection of video contents. Proposed method does algorithm design which can reduce computation complexity for hardware implantation and then implement hardware. In implementation result, we can confirm correct watermark inserting by FPGA simulation tool and cannot recognize concealed watermark in video sequence which insert watermark in original video sequence using implemented hardware watermark embedder system. Our implemented watermark embedding chipcan be useful in movie production and broadcasting companies that requires real-time based copyright protection system.
{"title":"Implementation of Real Time Video Watermark Embedder Based on Haar Wavelet Transform Using FPGA","authors":"Yongjae Jeong, Kwang-Seok Moon, Jong-Nam Kim","doi":"10.1109/FGCNS.2008.50","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.50","url":null,"abstract":"In this paper, we propose an applicable technique in the real time applications using FPGA chip implementation technique which can be implemented by Haar wavelet based real time video watermarking for robust watermarking for copyright protection of video contents. Proposed method does algorithm design which can reduce computation complexity for hardware implantation and then implement hardware. In implementation result, we can confirm correct watermark inserting by FPGA simulation tool and cannot recognize concealed watermark in video sequence which insert watermark in original video sequence using implemented hardware watermark embedder system. Our implemented watermark embedding chipcan be useful in movie production and broadcasting companies that requires real-time based copyright protection system.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132273874","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}
A new parameter estimation method for linear chirp signal is proposed. This method utilizes the Discrete Fractional Fourier Transform (DFRFT) along with Bowtie Chirplet Transform to estimate the amplitude and phase parameters of multi-component chirp signals. DFRFT is used for estimating amplitude parameter whereas the chirp rate and initial frequency are estimated using Chirplet Transform. Performance of the proposed method in noise is analyzed by Monte- Carlo simulation for different Signal to Noise Ratio (SNR). Good performance was achieved at SNR as low as -10 dB.
{"title":"Novel Parameter Estimation Method for Chirp Signals Using Bowtie Chirplet and Discrete Fractional Fourier Transform","authors":"A. Mostayed, Sikyung Kim, S.Z.K. Sajib","doi":"10.1109/FGCNS.2008.26","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.26","url":null,"abstract":"A new parameter estimation method for linear chirp signal is proposed. This method utilizes the Discrete Fractional Fourier Transform (DFRFT) along with Bowtie Chirplet Transform to estimate the amplitude and phase parameters of multi-component chirp signals. DFRFT is used for estimating amplitude parameter whereas the chirp rate and initial frequency are estimated using Chirplet Transform. Performance of the proposed method in noise is analyzed by Monte- Carlo simulation for different Signal to Noise Ratio (SNR). Good performance was achieved at SNR as low as -10 dB.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128119903","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}
Signature can be seen as an individual characteristic of a person which if modeled with precision can be used for his/her validation. Automatic signature verification is a technique that saves time and money. The paper is focused on skilled forgery detection. In addition, it also lays emphasis on the extraction of the critical regions which are more prone to mistakes. It follows a graph matching approach, which compares these critical regions, taking care of the inevitable intra-personal variations. The results show significant improvement over other approaches for detecting skilled forgery.
{"title":"Offline Signature Verification Using Critical Region Matching","authors":"A. Bansal, P. Nemmikanti, P. Kumar","doi":"10.1109/FGCNS.2008.55","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.55","url":null,"abstract":"Signature can be seen as an individual characteristic of a person which if modeled with precision can be used for his/her validation. Automatic signature verification is a technique that saves time and money. The paper is focused on skilled forgery detection. In addition, it also lays emphasis on the extraction of the critical regions which are more prone to mistakes. It follows a graph matching approach, which compares these critical regions, taking care of the inevitable intra-personal variations. The results show significant improvement over other approaches for detecting skilled forgery.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132060939","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}
In this paper, we propose a new vision based method to recognize the entering and exiting events from video sequences via motion analysis. Without sensors, the proposed approach is invariant to body shape and clothing as a combination of edge detection, motion history image and geometrical characteristic of the human shape in MHI sequences. The proposed method includes several applications such as access control in visual surveillance and computer vision fields.
{"title":"An Approach to Event Recognition for Visual Surveillance Systems","authors":"Yaohuan Cui, C. Lee","doi":"10.1109/FGCNS.2008.36","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.36","url":null,"abstract":"In this paper, we propose a new vision based method to recognize the entering and exiting events from video sequences via motion analysis. Without sensors, the proposed approach is invariant to body shape and clothing as a combination of edge detection, motion history image and geometrical characteristic of the human shape in MHI sequences. The proposed method includes several applications such as access control in visual surveillance and computer vision fields.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"21 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113974711","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}
In this paper we propose a content aware fast block matching motion estimation algorithm that can reduce the computation complexity of motion estimation module in H.264/AVC while maintaining almost same coding efficiency. In the first step inter block correlation is used to define a correlation coefficient that helps to identify the motion content of the current block. Based on this coefficient the algorithm adopts different search strategies for different video contents to get more efficient matches. Implementation of the proposed algorithm in JM12.2 of H.264/AVC shows reduction in encoding time while maintaining almost same bit rate and PSNR.
{"title":"A Content Aware Fast Motion Estimation Algorithm for H.264/AVC","authors":"H. Nisar, T. Choi","doi":"10.1109/FGCNS.2008.34","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.34","url":null,"abstract":"In this paper we propose a content aware fast block matching motion estimation algorithm that can reduce the computation complexity of motion estimation module in H.264/AVC while maintaining almost same coding efficiency. In the first step inter block correlation is used to define a correlation coefficient that helps to identify the motion content of the current block. Based on this coefficient the algorithm adopts different search strategies for different video contents to get more efficient matches. Implementation of the proposed algorithm in JM12.2 of H.264/AVC shows reduction in encoding time while maintaining almost same bit rate and PSNR.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122900905","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}
The existing home appliances could be used after buying and plug in it. Appliances become intelligent, conveniences, and supply a lot of functions. However, the usages and setting ways are complex. Furthermore, the users need to upgrade version occasionally in the using time. In the paper we embody an auto configuration method in the home server which update configuration automatically when the appliances are connected. The suggested method in the smart home-networking environments overcomes those difficulties of the home gateway and/or home server. It can make access to the home gateway and/or home server to yield a lot of profits of maintenances and repairs. This paper describes how it adapts to conditions where administration is minimized, and where network administrators in large enterprises wish to reduce tedium and workload.
{"title":"Implementation of an Auto Configuration Method for the Management Home Server","authors":"Byounghee Son, Youngchoong Park, Hagbae Kim","doi":"10.1109/FGCNS.2008.92","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.92","url":null,"abstract":"The existing home appliances could be used after buying and plug in it. Appliances become intelligent, conveniences, and supply a lot of functions. However, the usages and setting ways are complex. Furthermore, the users need to upgrade version occasionally in the using time. In the paper we embody an auto configuration method in the home server which update configuration automatically when the appliances are connected. The suggested method in the smart home-networking environments overcomes those difficulties of the home gateway and/or home server. It can make access to the home gateway and/or home server to yield a lot of profits of maintenances and repairs. This paper describes how it adapts to conditions where administration is minimized, and where network administrators in large enterprises wish to reduce tedium and workload.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126232655","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}
Mobile information services will play an important role in our future work and private life. Enabling mobility in urban and populous areas needs novel techniques for individual traffic planning. However, though there already are WAP-based traffic systems featuring route planning, their usability is not often universal. We present a SMS-based urban public traffic information system (SMS-UPTS) offering exact transfer query service and supporting most mobile devices. The SMS-UPTS makes use of bus station library model and least transfer path search algorithm. The least transfer path search algorithm is consisted of direct reach path search algorithm and least transfer converse search algorithm (CS-LT). Bus station library model improves veracity of Chinese parse word algorithm and flexibility of traffic information system, and direct reach path search algorithm can immediately get paths whose bus stations are on the same line, and CS-LT algorithm is based on point to point least transfer algorithm (P2P-LT) which makes use of adjacent and reachable matrixes, it greatly improves transfer algorithm performance. And the implementation results show that the performance of P2P-LS algorithm is better than Dijkstra algorithm and the SMS-UPTS has good efficiency.
{"title":"SMS-Based Urban Public Traffic Query Service","authors":"Benting Wan","doi":"10.1109/FGCNS.2008.94","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.94","url":null,"abstract":"Mobile information services will play an important role in our future work and private life. Enabling mobility in urban and populous areas needs novel techniques for individual traffic planning. However, though there already are WAP-based traffic systems featuring route planning, their usability is not often universal. We present a SMS-based urban public traffic information system (SMS-UPTS) offering exact transfer query service and supporting most mobile devices. The SMS-UPTS makes use of bus station library model and least transfer path search algorithm. The least transfer path search algorithm is consisted of direct reach path search algorithm and least transfer converse search algorithm (CS-LT). Bus station library model improves veracity of Chinese parse word algorithm and flexibility of traffic information system, and direct reach path search algorithm can immediately get paths whose bus stations are on the same line, and CS-LT algorithm is based on point to point least transfer algorithm (P2P-LT) which makes use of adjacent and reachable matrixes, it greatly improves transfer algorithm performance. And the implementation results show that the performance of P2P-LS algorithm is better than Dijkstra algorithm and the SMS-UPTS has good efficiency.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122558741","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
扫码关注我们
求助内容：
应助结果提醒方式：