This invited paper discusses low resolution face recognition using photon-counting linear discriminant analysis (LDA). The photon-counting LDA asymptotically realizes the Fisher criterion without dimensionality reduction. Linear boundaries are determined in high dimensional space to classify unknown objects. It will be shown that the proposed method provides better results than eigen face and Fisher face in terms of accuracy and false alarm rates.
{"title":"A Linear Discriminant Analysis for Low Resolution Face Recognition","authors":"S. Yeom","doi":"10.1109/FGCNS.2008.59","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.59","url":null,"abstract":"This invited paper discusses low resolution face recognition using photon-counting linear discriminant analysis (LDA). The photon-counting LDA asymptotically realizes the Fisher criterion without dimensionality reduction. Linear boundaries are determined in high dimensional space to classify unknown objects. It will be shown that the proposed method provides better results than eigen face and Fisher face in terms of accuracy and false alarm rates.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"26 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":"123756827","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}
Niranjan S. Ka, Vijaya Kumarb, Hemantha Kumar, Manjunath Aradhya
In this paper, we propose unconstrained handwritten Kannada character recognition based on Fisher linear discriminant analysis (FLD). The proposed system extracts features from well known FLD, Two dimensional FLD (2D-FLD) and diagonal FLD. In order to classify the characters, we explore different distance measure techniques and compare their results. The proposed system is tested on unconstrained handwritten Kannada characters with pertaining to large number of character classes. The system showed effectiveness and feasibility of the proposed method.
{"title":"FLD Based Unconstrained Handwritten Kannada Character Recognition","authors":"Niranjan S. Ka, Vijaya Kumarb, Hemantha Kumar, Manjunath Aradhya","doi":"10.1109/FGCNS.2008.17","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.17","url":null,"abstract":"In this paper, we propose unconstrained handwritten Kannada character recognition based on Fisher linear discriminant analysis (FLD). The proposed system extracts features from well known FLD, Two dimensional FLD (2D-FLD) and diagonal FLD. In order to classify the characters, we explore different distance measure techniques and compare their results. The proposed system is tested on unconstrained handwritten Kannada characters with pertaining to large number of character classes. The system showed effectiveness and feasibility of the proposed method.","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":"122573409","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}
Won-Seok Hwang, Sang-Wook Kim, Duck-Ho Bae, Young-Joo Do
A blog is a personal web site, usually maintained by an individual, with posts that contain private thoughts. Existing algorithms for web-page ranking are not directly applicable to post ranking in blog environment since posts have their unique features different from those of web-pages. In this paper, we first model the relationships between bloggers and posts as a bipartite graph referred to as a post-blogger graph. Next, we propose new post ranking algorithms by modifying prior web-page ranking algorithms to be suitable for the post-blogger graph. Then, we evaluate the accuracy of post ranking algorithms by performing experiments using real-world blog data.
{"title":"Post Ranking Algorithms in Blog Environment","authors":"Won-Seok Hwang, Sang-Wook Kim, Duck-Ho Bae, Young-Joo Do","doi":"10.1109/FGCNS.2008.75","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.75","url":null,"abstract":"A blog is a personal web site, usually maintained by an individual, with posts that contain private thoughts. Existing algorithms for web-page ranking are not directly applicable to post ranking in blog environment since posts have their unique features different from those of web-pages. In this paper, we first model the relationships between bloggers and posts as a bipartite graph referred to as a post-blogger graph. Next, we propose new post ranking algorithms by modifying prior web-page ranking algorithms to be suitable for the post-blogger graph. Then, we evaluate the accuracy of post ranking algorithms by performing experiments using real-world blog data.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"65 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":"131576689","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 paper presents the method of multivariable integrated model predictive control for the nuclear power plant, including designing controller and building the modeling of turbine and once-through steam generator. The simulation results show that the rotate speed of turbine and outlet pressure of steam generator under the multivariable integrated model predictive control is faster steady and smaller overshoot than under the PID control, when the power load of nuclear power plant is changed. Simulation test indicates that the multivariable integrated model predictive control can obtain better control performance for nuclear power plant.
{"title":"Multivariable Integrated Model Predictive Control of Nuclear Power Plant","authors":"G. Xia, J. Su, Wei Zhang","doi":"10.1109/FGCNS.2008.122","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.122","url":null,"abstract":"This paper presents the method of multivariable integrated model predictive control for the nuclear power plant, including designing controller and building the modeling of turbine and once-through steam generator. The simulation results show that the rotate speed of turbine and outlet pressure of steam generator under the multivariable integrated model predictive control is faster steady and smaller overshoot than under the PID control, when the power load of nuclear power plant is changed. Simulation test indicates that the multivariable integrated model predictive control can obtain better control performance for nuclear power plant.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"122 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":"128017192","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}
Location based service (LBS) cannot be realized unless the location of the user is available. For indoor LBS, indoor positioning must be utilized and many researchers have been working on indoor positioning and tracking. For example, extended Kalman filter (EKF) was exploited in Bluetooth based indoor positioning. Nowadays, WLAN (wireless local area network) is available virtually everywhere. Thus, WLAN based indoor positioning and tracking is more economical than Bluetooth based ones. The main purpose of this paper is to propose a new WLAN based EKF indoor tracking method by extending existing Bluetooth based EKF positioning method. Experimental results comparing our method with other previous methods are discussed.
{"title":"Development of Kalman Filters for WLAN Based Tracking","authors":"J. Yim, Seunghwan Jeong, Jaehun Joo, Chansik Park","doi":"10.1109/FGCNS.2008.147","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.147","url":null,"abstract":"Location based service (LBS) cannot be realized unless the location of the user is available. For indoor LBS, indoor positioning must be utilized and many researchers have been working on indoor positioning and tracking. For example, extended Kalman filter (EKF) was exploited in Bluetooth based indoor positioning. Nowadays, WLAN (wireless local area network) is available virtually everywhere. Thus, WLAN based indoor positioning and tracking is more economical than Bluetooth based ones. The main purpose of this paper is to propose a new WLAN based EKF indoor tracking method by extending existing Bluetooth based EKF positioning method. Experimental results comparing our method with other previous methods are discussed.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"310 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":"133747224","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}
With the rapid development of knowledge-based economy and Web technology, more and more enterprisers realize the importance of extracting Competitive Intelligence (CI) from Web. Unfortunately, current technologies fail to directly generate enterprise competitive intelligence from Web information. Towards this situation, in this paper we present a framework of ontology-driven extraction of enterprise competitive intelligence from the Internet. After a short review on related work, we first present the ontological foundation of enterprise competitive intelligence in the Internet. And then the ontology-driven extracting process for enterprise competitive intelligence from Web is discussed.
{"title":"Ontology-Driven Extraction of Enterprise Competitive Intelligence in the Internet","authors":"Yan Chen, Peiquan Jin, Lihua Yue","doi":"10.1109/FGCNS.2008.72","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.72","url":null,"abstract":"With the rapid development of knowledge-based economy and Web technology, more and more enterprisers realize the importance of extracting Competitive Intelligence (CI) from Web. Unfortunately, current technologies fail to directly generate enterprise competitive intelligence from Web information. Towards this situation, in this paper we present a framework of ontology-driven extraction of enterprise competitive intelligence from the Internet. After a short review on related work, we first present the ontological foundation of enterprise competitive intelligence in the Internet. And then the ontology-driven extracting process for enterprise competitive intelligence from Web is discussed.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"25 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":"134331964","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 paper develops a systematic method for kinematics modeling of multi-legged robots for walking on rough terrain. An extended D-H table is proposed for characterizing the robot joints and linkages parameters. The equations of motions are set up using this table for different frames starting from the robot reference frame, going through individual legs and finally reaching feet-terrain contact frames. The composite equation of motion is formed from those of individual legs.The formulation allows determining actuations to various joints for achieving a desired robot motion, while optimizing a performance index such as a stability measure for illustration, the method is applied to SILO4, an articulated quadruped.
{"title":"Kinematics Modeling of Multi-legged Robots walking on Rough Terrain","authors":"M. Tarokh, M. Lee","doi":"10.1109/FGCNS.2008.119","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.119","url":null,"abstract":"The paper develops a systematic method for kinematics modeling of multi-legged robots for walking on rough terrain. An extended D-H table is proposed for characterizing the robot joints and linkages parameters. The equations of motions are set up using this table for different frames starting from the robot reference frame, going through individual legs and finally reaching feet-terrain contact frames. The composite equation of motion is formed from those of individual legs.The formulation allows determining actuations to various joints for achieving a desired robot motion, while optimizing a performance index such as a stability measure for illustration, the method is applied to SILO4, an articulated quadruped.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"237 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":"134336618","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}
News topic extraction is very important for news search engine. The traditional methods are based on pattern matching and linguistic analysis, which mainly depend on the measurement of feature similarity. But due to two reasons, those methods are basically inefficient to process Chinese news topic extraction from Internet. The first reason is the difficulty of Natural Language Processing (NLP) for Chinese, and the other is the diversity and fast update speed of Internet news. At the present, some works utilizing news special structure (e.g. title) for Chinese news topic are presented. However, two problems still remain unsolved so far, which are (1) missing of some news topic and (2) irregular topic words produced. Aiming to solve these two problems, we propose a POS-based approach to news topic extraction. We first segment words and tag POS for news title, and then eliminate segmentation errors according to POS information and position relation. After that, topic words are associated and combined into bigger ones, and different topic weights are assigned to those bigger words. We conduct an experiment on 600 Chinese news Web pages to demonstrate our new approach. The experimental results show that our approach has a higher recall and precision rate of news topic extraction and reduces irregular topic words obviously.
{"title":"A Novel POS-Based Approach to Chinese News Topic Extraction from Internet","authors":"Xujian Zhao, Peiquan Jin, Lihua Yue","doi":"10.1109/FGCNS.2008.71","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.71","url":null,"abstract":"News topic extraction is very important for news search engine. The traditional methods are based on pattern matching and linguistic analysis, which mainly depend on the measurement of feature similarity. But due to two reasons, those methods are basically inefficient to process Chinese news topic extraction from Internet. The first reason is the difficulty of Natural Language Processing (NLP) for Chinese, and the other is the diversity and fast update speed of Internet news. At the present, some works utilizing news special structure (e.g. title) for Chinese news topic are presented. However, two problems still remain unsolved so far, which are (1) missing of some news topic and (2) irregular topic words produced. Aiming to solve these two problems, we propose a POS-based approach to news topic extraction. We first segment words and tag POS for news title, and then eliminate segmentation errors according to POS information and position relation. After that, topic words are associated and combined into bigger ones, and different topic weights are assigned to those bigger words. We conduct an experiment on 600 Chinese news Web pages to demonstrate our new approach. The experimental results show that our approach has a higher recall and precision rate of news topic extraction and reduces irregular topic words obviously.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"2 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":"134461753","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 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：