This paper presents a 3D camera calibration method based on a nonlinear modeling function of an artificial neural network. The neural network employed in this paper is primarily used as a nonlinear mapper between 2D image points and points of a certain space in 3D real world. The neural network model implicitly contains all the physical parameters, some of which are very difficult to be estimated in the conventional calibration methods. MutiLayer Perceptron Type Neural Network (MLPNN) is employed to implement the relationship between image coordinates. In order to show the performance of the proposed method, we carry out experiments on the estimation of 2D image coordinates given 3D real world coordinates. The experimental results show that the proposed method improved calibration accuracy over widely used Tsai's two stage method (TSM).
{"title":"An Efficient Method for Camera Calibration Using MultiLayer Perceptron Type Neural Network","authors":"Dong-Min Woo, Dong-Chul Park","doi":"10.1109/ICFCC.2009.94","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.94","url":null,"abstract":"This paper presents a 3D camera calibration method based on a nonlinear modeling function of an artificial neural network. The neural network employed in this paper is primarily used as a nonlinear mapper between 2D image points and points of a certain space in 3D real world. The neural network model implicitly contains all the physical parameters, some of which are very difficult to be estimated in the conventional calibration methods. MutiLayer Perceptron Type Neural Network (MLPNN) is employed to implement the relationship between image coordinates. In order to show the performance of the proposed method, we carry out experiments on the estimation of 2D image coordinates given 3D real world coordinates. The experimental results show that the proposed method improved calibration accuracy over widely used Tsai's two stage method (TSM).","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132840050","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}
Anjana Pandey, Sumit Sabnani, K. Pardasani, Sanjay Sharma
Usually popular temporal association rule mining methods are having performance bottleneck for database with different characteristics. Methods like Temporal-Apriori suffer from problem of candidate generation and database scans for Temporal Association rule mining. To overcome some of these problems of Temporal-Apriori TPASCAL has been discussed recently The TPASCAL uses counting inference approach that minimizes as much as possible the number of pattern support counts performed when extracting frequent patterns. TPASCAL is calendric temporal association rule mining, which is working on precise-match association rules that require the association rule hold during every Interval. TPASCAL is based on the level wise extraction of frequent patterns Here an attempt has been made to evaluate and compare the performance of TPASCAL with temporal-Apriori on datasets with different characteristics. The relationship of execution time with characteristics like denseness, sparseness and volume of data extra has been obtained by implementing the algorithm on synthetic dataset available online. The parameter which is affecting the efficiency of two algorithm have been explored and evaluated
{"title":"Performance Analysis of T-PASCAL on Sparse and Dense Datasets","authors":"Anjana Pandey, Sumit Sabnani, K. Pardasani, Sanjay Sharma","doi":"10.1109/ICFCC.2009.17","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.17","url":null,"abstract":"Usually popular temporal association rule mining methods are having performance bottleneck for database with different characteristics. Methods like Temporal-Apriori suffer from problem of candidate generation and database scans for Temporal Association rule mining. To overcome some of these problems of Temporal-Apriori TPASCAL has been discussed recently The TPASCAL uses counting inference approach that minimizes as much as possible the number of pattern support counts performed when extracting frequent patterns. TPASCAL is calendric temporal association rule mining, which is working on precise-match association rules that require the association rule hold during every Interval. TPASCAL is based on the level wise extraction of frequent patterns Here an attempt has been made to evaluate and compare the performance of TPASCAL with temporal-Apriori on datasets with different characteristics. The relationship of execution time with characteristics like denseness, sparseness and volume of data extra has been obtained by implementing the algorithm on synthetic dataset available online. The parameter which is affecting the efficiency of two algorithm have been explored and evaluated","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133408929","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 aim of this study is to develop an intelligent financial early warning system model based on data mining for SMEs in Turkey. SMEs have made an important contribution to world’s rapid economic growth and the fast industrialization process. SMEs play a major role in Turkish economy and the main issue of the SMEs is finance. Therefore, developing an intelligent financial early warning system is vital for SMEs. Model has 5 steps and is based on a data mining method Chi-Square Automatic Interaction Detector (CHAID) decision tree algorithm.
{"title":"An Intelligent Financial Early Warning System Model Based on Data Mining for SMEs","authors":"A. S. Koyuncugil, N. Ozgulbas","doi":"10.1109/ICFCC.2009.118","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.118","url":null,"abstract":"The aim of this study is to develop an intelligent financial early warning system model based on data mining for SMEs in Turkey. SMEs have made an important contribution to world’s rapid economic growth and the fast industrialization process. SMEs play a major role in Turkish economy and the main issue of the SMEs is finance. Therefore, developing an intelligent financial early warning system is vital for SMEs. Model has 5 steps and is based on a data mining method Chi-Square Automatic Interaction Detector (CHAID) decision tree algorithm.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133680641","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}
Norashikin Yahaya, Ereneyanti Husmin, Noor Fazilatulakma Mohd Zaini, F. Bakar, Z. Ismaail, Zulhizam Sanip, R. Kaspin
This paper aims to describe the general concept and design on a solution being developed in TM Research and Development to enable end users to obtain on demand information on location specific data based on Global Positioning System (GPS) or mobile triangulation information directly from mobile devices or fixed terminals. In order to illustrate our approach, a proof-of-concept was implemented.The resulting prototype is called a Location-based Content Utility Service Terminal (LoCUST) which consists of an application server, a database and a few test clients. LoCUST is an IP Multimedia Subsystem (IMS) Location Based Services(LBS) which is community driven. LoCUST is using Session Initiation Protocol (SIP) for the communication between the server and the client.
{"title":"IMS Application in Telekom Malaysia","authors":"Norashikin Yahaya, Ereneyanti Husmin, Noor Fazilatulakma Mohd Zaini, F. Bakar, Z. Ismaail, Zulhizam Sanip, R. Kaspin","doi":"10.1109/ICFCC.2009.83","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.83","url":null,"abstract":"This paper aims to describe the general concept and design on a solution being developed in TM Research and Development to enable end users to obtain on demand information on location specific data based on Global Positioning System (GPS) or mobile triangulation information directly from mobile devices or fixed terminals. In order to illustrate our approach, a proof-of-concept was implemented.The resulting prototype is called a Location-based Content Utility Service Terminal (LoCUST) which consists of an application server, a database and a few test clients. LoCUST is an IP Multimedia Subsystem (IMS) Location Based Services(LBS) which is community driven. LoCUST is using Session Initiation Protocol (SIP) for the communication between the server and the client.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130521401","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}
Even though matching between different scripts could be immensely useful for news organizations, author recognition with cross-script matches in digital libraries and homeland security, it is impossible to automatically match. Now, we propose a new approach, ME-Match, for matching the proper names across different scripts. The foremost concept of our approach is to match them via phoneme strings. The main steps in ME-Match are creation of bilingual pronouncing mapping, tokenization of query names, transformation of query names to IPA forms based on tonal grouping approach, searching possible various words in both scripts for each query IPA phoneme string, combination of various words to become full name strings and then searching names. The performance is measured by standard information-retrieval metrics: recall, precision, and f-measures.
{"title":"ME-Match: Tonal Grouping Based Approach in Cross-Script Name Matching","authors":"Kyaw Zar Zar Phyu, Khin Mar Lar Tun","doi":"10.1109/ICFCC.2009.24","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.24","url":null,"abstract":"Even though matching between different scripts could be immensely useful for news organizations, author recognition with cross-script matches in digital libraries and homeland security, it is impossible to automatically match. Now, we propose a new approach, ME-Match, for matching the proper names across different scripts. The foremost concept of our approach is to match them via phoneme strings. The main steps in ME-Match are creation of bilingual pronouncing mapping, tokenization of query names, transformation of query names to IPA forms based on tonal grouping approach, searching possible various words in both scripts for each query IPA phoneme string, combination of various words to become full name strings and then searching names. The performance is measured by standard information-retrieval metrics: recall, precision, and f-measures.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132391968","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}
Abbas M. Al-Ghaili, S. Mashohor, A. Ismail, A. Ramli
Vertical edge detection is a very important task for image processing-based applications. One of the most common techniques which depends on this task is car license plate detection system. In this work, two contributions are presented and discussed. The first one, a Vertical Edge Detection Algorithm (VEDA) is proposed in order to extract vertical edges. The second one, an implementation of VEDA is presented in order to confirm that VEDA is robust for highlighting car license plates efficiently. The results show that VEDA is faster than Sobel and its time complexity is less. So, VEDA can be used with real-time applications. VEDA shows that it could detect vertical license plate details efficiently.
{"title":"Efficient Implementation of VEDA for Highlighting Car License Plate Details","authors":"Abbas M. Al-Ghaili, S. Mashohor, A. Ismail, A. Ramli","doi":"10.1109/ICFCC.2009.35","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.35","url":null,"abstract":"Vertical edge detection is a very important task for image processing-based applications. One of the most common techniques which depends on this task is car license plate detection system. In this work, two contributions are presented and discussed. The first one, a Vertical Edge Detection Algorithm (VEDA) is proposed in order to extract vertical edges. The second one, an implementation of VEDA is presented in order to confirm that VEDA is robust for highlighting car license plates efficiently. The results show that VEDA is faster than Sobel and its time complexity is less. So, VEDA can be used with real-time applications. VEDA shows that it could detect vertical license plate details efficiently.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116152649","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 progressive switching median (PSM) filter implements a noise detection algorithm before filtering. Both noise detection and filtering procedures are progressively repeated for a number of iterations. As an attempt to improve the PSM filter, an improved progressive switching median filter (IPSM) is proposed to enhance progressive median filter in term of its noise filtering ability. The proposed algorithm sets a limit on the number of good pixels used in determine median and mean values, and substitute impulse pixel with half of the value of the summation of median and mean value. Experimental results show that the proposed algorithm performs a better noise filtering ability as the images are highly corrupted.
{"title":"An Improved Progressive Switching Median Filter","authors":"Soon Ting Boo, H. Ibrahim, K. Toh","doi":"10.1109/ICFCC.2009.87","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.87","url":null,"abstract":"The progressive switching median (PSM) filter implements a noise detection algorithm before filtering. Both noise detection and filtering procedures are progressively repeated for a number of iterations. As an attempt to improve the PSM filter, an improved progressive switching median filter (IPSM) is proposed to enhance progressive median filter in term of its noise filtering ability. The proposed algorithm sets a limit on the number of good pixels used in determine median and mean values, and substitute impulse pixel with half of the value of the summation of median and mean value. Experimental results show that the proposed algorithm performs a better noise filtering ability as the images are highly corrupted.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125617286","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}
Wireless Mesh Networks (WMNs) is a promising technology for backhaul wireless connectivity in user premises due to its multi-hop nature, multi-radio multi-channel capabilities and stable power supplies. With proliferation of new and advanced access technologies, future WMN’s will bean integrated paradigm to provide seamless and ubiquitous connectivity to multi interface end user devices. Co-existence of multiple heterogeneous interfaces on wireless mesh routers increases overall network capacity, resilience and availability in the mesh backhaul as compared to homogenous radios mesh networks. In this paper, we present a novel architecture for heterogeneous WMN’s based on integrated IEEE 802.11/16/15technologies and discuss issues, possible solutions and future insight. We propose an optimal route algorithm along with radio assignment graph which captures the heterogeneity of radios. We also present a handover mechanism for seamless interface switch for mobile and static end user devices.
{"title":"Optimal Path Discovery with Mobility Management in Heterogeneous Mesh Networks","authors":"I. Shah, S. Jan, S. Mahmud, H. Al-Raweshidy","doi":"10.1109/ICFCC.2009.21","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.21","url":null,"abstract":"Wireless Mesh Networks (WMNs) is a promising technology for backhaul wireless connectivity in user premises due to its multi-hop nature, multi-radio multi-channel capabilities and stable power supplies. With proliferation of new and advanced access technologies, future WMN’s will bean integrated paradigm to provide seamless and ubiquitous connectivity to multi interface end user devices. Co-existence of multiple heterogeneous interfaces on wireless mesh routers increases overall network capacity, resilience and availability in the mesh backhaul as compared to homogenous radios mesh networks. In this paper, we present a novel architecture for heterogeneous WMN’s based on integrated IEEE 802.11/16/15technologies and discuss issues, possible solutions and future insight. We propose an optimal route algorithm along with radio assignment graph which captures the heterogeneity of radios. We also present a handover mechanism for seamless interface switch for mobile and static end user devices.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121377877","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}
Congestion control is one of open issues in the Internet research and congestion is the main reason for reduced performance and poor quality of service. One of the most important properties of any control system is its stability. In this paper we develop a stable congestion control algorithm that is inspired from nature. Toward this purpose, the window size of any connection is viewed as population size of flow species and congestion control problem is redefined as population control of these flow species (W). In order to control population size of W species, we use a realistic predator-prey model and map it to the Internet congestion control issue. Mathematical analysis shows that this scheme is globally converging to a fair and high-performance equilibrium.
{"title":"Nature-Inspired Approach for Stable Congestion Control in the Internet","authors":"S. Jamali, Khalil Valipoor, M. Analoui","doi":"10.1109/ICFCC.2009.100","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.100","url":null,"abstract":"Congestion control is one of open issues in the Internet research and congestion is the main reason for reduced performance and poor quality of service. One of the most important properties of any control system is its stability. In this paper we develop a stable congestion control algorithm that is inspired from nature. Toward this purpose, the window size of any connection is viewed as population size of flow species and congestion control problem is redefined as population control of these flow species (W). In order to control population size of W species, we use a realistic predator-prey model and map it to the Internet congestion control issue. Mathematical analysis shows that this scheme is globally converging to a fair and high-performance equilibrium.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121520185","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 concerns the direction of arrival (DOA)estimation for code division multiple access (CDMA) frequency on-selective and slow fading multipath and multi input multioutput (MIMO) channels. Through decorrelating processing we can employ one-dimensional unitary TLS-ESPRIT algorithm twice to solve the problem. Simulation results are presented efficient estimator.
{"title":"DOA Estimation for Rectangular Antenna Array in Multipath Fading and MIMO Channels","authors":"M. Espandar, H. Bakhshi","doi":"10.1109/ICFCC.2009.86","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.86","url":null,"abstract":"This paper concerns the direction of arrival (DOA)estimation for code division multiple access (CDMA) frequency on-selective and slow fading multipath and multi input multioutput (MIMO) channels. Through decorrelating processing we can employ one-dimensional unitary TLS-ESPRIT algorithm twice to solve the problem. Simulation results are presented efficient estimator.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122741765","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
扫码关注我们
求助内容：
应助结果提醒方式：