In this paper an improved camera calibration algorithm is applied to the video-based traffic information detection. The geometric camera model is set up based on the pin-hole model and Direct Linear Transformation (DLT). Adopting the coplanar condition, we estimate parameters of the model and realize the transform from image coordinates to world coordinates in the end. The problem of control points is discussed. In our experiment, the algorithm has the advantage of high-accuracy and its parameters can be easily estimated. It is proved that the algorithm could meet the requirement of calibration accuracy in the application of the video-based traffic information detection.
{"title":"A Camera Calibration Strategy in the Video-based Traffic Information Detection","authors":"Yu Yuan, Jiang Dan","doi":"10.1109/SNPD.2007.16","DOIUrl":"https://doi.org/10.1109/SNPD.2007.16","url":null,"abstract":"In this paper an improved camera calibration algorithm is applied to the video-based traffic information detection. The geometric camera model is set up based on the pin-hole model and Direct Linear Transformation (DLT). Adopting the coplanar condition, we estimate parameters of the model and realize the transform from image coordinates to world coordinates in the end. The problem of control points is discussed. In our experiment, the algorithm has the advantage of high-accuracy and its parameters can be easily estimated. It is proved that the algorithm could meet the requirement of calibration accuracy in the application of the video-based traffic information detection.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":" 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120827270","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}
Nowadays, remote control applications via the Internet are going to be used more and more widely with the development of powerful chips and network technology. For applications which do not need real time communication or persistent connection and have a little amount of data transportation, conventional approaches based on Web services either are a little bit complex, or have a higher overhead. In this paper we introduce another method called WeeRMES, a Web services based email extension for remote monitoring of embedded systems, to be supplement of conventional remote control methods in some special occasions. Thanks to the model, we are able to do all those things using emails such as sending devices instructions, inspecting device status and gathering data using XML capsulated messages. User interfaces can be dynamically achieved by means of XForms generated by Java classes loaded on target devices. Furthermore, researches are carried out on security mechanism to ensure safety and robustness of the system. An idiographic implementation is given as an example in the end.
{"title":"A Web Services Based Email Extension for Remote Monitoring of Embedded Systems","authors":"Cao Chengzhi, Gu Xiaofeng, Liu Yang","doi":"10.1109/SNPD.2007.453","DOIUrl":"https://doi.org/10.1109/SNPD.2007.453","url":null,"abstract":"Nowadays, remote control applications via the Internet are going to be used more and more widely with the development of powerful chips and network technology. For applications which do not need real time communication or persistent connection and have a little amount of data transportation, conventional approaches based on Web services either are a little bit complex, or have a higher overhead. In this paper we introduce another method called WeeRMES, a Web services based email extension for remote monitoring of embedded systems, to be supplement of conventional remote control methods in some special occasions. Thanks to the model, we are able to do all those things using emails such as sending devices instructions, inspecting device status and gathering data using XML capsulated messages. User interfaces can be dynamically achieved by means of XForms generated by Java classes loaded on target devices. Furthermore, researches are carried out on security mechanism to ensure safety and robustness of the system. An idiographic implementation is given as an example in the end.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116263177","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}
Some scholars provided the discernibility matrix based on the positive region. The time complexity of the algorithm for computing core with this discernibility matrix is O(|CparU|2 ). For cutting down the time complexity of the algorithm, the definition of simplified discernibility matrix based on the positive region and the corresponding definition of the core are provided. At the same time, it is proved that this core is equivalent to the core based on the positive region. Since the partition of U/C is the key process for computing simplified discernibility matrix, a quick algorithm for computing U/C is designed with the idea of radix sorting. Its time complexity is O(|CparU|). On this condition, a new algorithm for computing core based on the positive region is designed with the simplified discernibility. Its time complexity is cut down to max{O(|CparU'posparU/C|), O(|CparU|)}.
{"title":"A Quick Algorithm for Computing Core Based on the Positive Region","authors":"Wei-Dong Cai, Zhangyan Xu, Wei Song, Bingru Yang","doi":"10.1109/SNPD.2007.87","DOIUrl":"https://doi.org/10.1109/SNPD.2007.87","url":null,"abstract":"Some scholars provided the discernibility matrix based on the positive region. The time complexity of the algorithm for computing core with this discernibility matrix is O(|CparU|2 ). For cutting down the time complexity of the algorithm, the definition of simplified discernibility matrix based on the positive region and the corresponding definition of the core are provided. At the same time, it is proved that this core is equivalent to the core based on the positive region. Since the partition of U/C is the key process for computing simplified discernibility matrix, a quick algorithm for computing U/C is designed with the idea of radix sorting. Its time complexity is O(|CparU|). On this condition, a new algorithm for computing core based on the positive region is designed with the simplified discernibility. Its time complexity is cut down to max{O(|CparU'posparU/C|), O(|CparU|)}.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126235829","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}
Stakeholder cooperation is important for conducting a successful software project. The software industry has increasingly expanded its adoption of COTS components for complex applications. The stakeholders of COTS-based projects differ considerably from these of conventional custom development projects. All members of the project team should print the COTS-inclusion concept deeply within their mind. There are also great changes in roles and needed skills. For COTS-based project, it is crucial to understand all classes of stakeholders, their responsibilities, and inter-collaboration relationships by contrasting with traditional software development. According to the characteristics of COTS-based project, focusing on the differences, this paper is regulated to elaborate on all stakeholder roles and corresponding responsibilities, the differences with custom-development project, and the cooperation relationship between stakeholders.
{"title":"The differences of COTS-based project stakeholders","authors":"Yunmei Du, Shixian Li","doi":"10.1109/SNPD.2007.494","DOIUrl":"https://doi.org/10.1109/SNPD.2007.494","url":null,"abstract":"Stakeholder cooperation is important for conducting a successful software project. The software industry has increasingly expanded its adoption of COTS components for complex applications. The stakeholders of COTS-based projects differ considerably from these of conventional custom development projects. All members of the project team should print the COTS-inclusion concept deeply within their mind. There are also great changes in roles and needed skills. For COTS-based project, it is crucial to understand all classes of stakeholders, their responsibilities, and inter-collaboration relationships by contrasting with traditional software development. According to the characteristics of COTS-based project, focusing on the differences, this paper is regulated to elaborate on all stakeholder roles and corresponding responsibilities, the differences with custom-development project, and the cooperation relationship between stakeholders.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126437347","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 end devices become more and more powerful, enabling them to execute more sophisticated tasks. Hence it is desirable to leverage these potential resources, by being able to execute tasks on external devices. At the same time, peer-to-peer (P2P) gains more and more attention, and will level the difference between clients and servers. As P2P technology proved to be an effective means for mobile computing, it seems logical to combine the benefits of both worlds. This paper discusses how to organize a Mobile P2P (MP2P) infrastructure, and the experimental results show that the services running on MP2P network have better efficiency than on traditional client/server model network.
{"title":"Organization Technology in Mobile Peer-to-peer Network Based on Mobile Unit","authors":"Liang Ye, Ci Lin-lin","doi":"10.1109/SNPD.2007.410","DOIUrl":"https://doi.org/10.1109/SNPD.2007.410","url":null,"abstract":"Mobile end devices become more and more powerful, enabling them to execute more sophisticated tasks. Hence it is desirable to leverage these potential resources, by being able to execute tasks on external devices. At the same time, peer-to-peer (P2P) gains more and more attention, and will level the difference between clients and servers. As P2P technology proved to be an effective means for mobile computing, it seems logical to combine the benefits of both worlds. This paper discusses how to organize a Mobile P2P (MP2P) infrastructure, and the experimental results show that the services running on MP2P network have better efficiency than on traditional client/server model network.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126021148","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}
By means of Riccati transformation technique, we establish some new oscillation criteria for the second-order delay dynamic equations. Our results in this paper not only extend the results given in Sahiner [?] but also unify the oscillation of the second order nonlinear delay differential equation and the second order nonlinear delay difference equation.
{"title":"Oscillation Criteria of Second-Order Delay Dynamic Equations on Time Scales","authors":"Z. Han, Shurong Sun","doi":"10.1109/SNPD.2007.62","DOIUrl":"https://doi.org/10.1109/SNPD.2007.62","url":null,"abstract":"By means of Riccati transformation technique, we establish some new oscillation criteria for the second-order delay dynamic equations. Our results in this paper not only extend the results given in Sahiner [?] but also unify the oscillation of the second order nonlinear delay differential equation and the second order nonlinear delay difference equation.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127974277","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 increasing tempo of war and complication of battle field, battle damage assessment (BDA) has become more critical to the decision of commander. In the Persian Gulf War, the BDA system of U.S. army couldn't meet the needs of commanders in both accuracy and speed, and badly blocked operations, one of its main reasons was lack of scientific and reasonable assessment model for BDA. According to the fact of BDA and the characters of Bayesian network, paper studies the theory of BDA based on Bayesian network, expatiates upon the modeling of Bayesian decision model for BDA, and puts forward a way to update the model, to enhance the accuracy of assessment.
{"title":"Battle Damage Assessment based on Bayesian Network","authors":"Zhijun Ma, Quan Shi, Bin Li","doi":"10.1109/SNPD.2007.421","DOIUrl":"https://doi.org/10.1109/SNPD.2007.421","url":null,"abstract":"With increasing tempo of war and complication of battle field, battle damage assessment (BDA) has become more critical to the decision of commander. In the Persian Gulf War, the BDA system of U.S. army couldn't meet the needs of commanders in both accuracy and speed, and badly blocked operations, one of its main reasons was lack of scientific and reasonable assessment model for BDA. According to the fact of BDA and the characters of Bayesian network, paper studies the theory of BDA based on Bayesian network, expatiates upon the modeling of Bayesian decision model for BDA, and puts forward a way to update the model, to enhance the accuracy of assessment.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115899217","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}
Gnutella is one of the prominent unstructured P2P networks. In the unstructured P2P networks, the network topology and the placement of files are largely unconstrained. The primitive search algorithm in Gnutella is flooding-based. The algorithm produces too much traffic though with limited search region which is constrained by TTL value. To improve search efficiency and reduce unnecessary traffic in Gnutella, this paper proposes an algorithm to unstructured P2P network, and it consists of ranked neighbor caching scheme and queryhit caching scheme. The proposed algorithm can extend the search region but reduce the search traffic, and also balance the network load, so that acquires the whole networks scalable.
{"title":"A Scalable Search Algorithm on Unstructured P2P Networks","authors":"Fuyong Yuan, Jian Liu, Chunxia Yin","doi":"10.1109/SNPD.2007.391","DOIUrl":"https://doi.org/10.1109/SNPD.2007.391","url":null,"abstract":"Gnutella is one of the prominent unstructured P2P networks. In the unstructured P2P networks, the network topology and the placement of files are largely unconstrained. The primitive search algorithm in Gnutella is flooding-based. The algorithm produces too much traffic though with limited search region which is constrained by TTL value. To improve search efficiency and reduce unnecessary traffic in Gnutella, this paper proposes an algorithm to unstructured P2P network, and it consists of ranked neighbor caching scheme and queryhit caching scheme. The proposed algorithm can extend the search region but reduce the search traffic, and also balance the network load, so that acquires the whole networks scalable.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"43 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132026424","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}
Digital steganography introduces statistical distortion to some extent. Thus, steganalysis can be used to classify an object with or without hidden information. In this paper, we present a novel approach to detect the presence of LSB (least significant bit) steganographic messages in the voice secure communication system. A distance measure, which has been proved to be sensitive to LSB steganography by ANOVA (analysis of variance), is denoted to estimate the difference between the host signal and the stego signal. Then a MI (maximum likelihood) decision is combined to form the classifier. Statistical experiments show that the proposed approach has highly accurate rate and low computational complexity.
{"title":"A Novel Approach to Detect the Presence of LSB Steganographic Messages","authors":"Zongyuan Deng, Xi Shao, Zhen Yang","doi":"10.1109/SNPD.2007.303","DOIUrl":"https://doi.org/10.1109/SNPD.2007.303","url":null,"abstract":"Digital steganography introduces statistical distortion to some extent. Thus, steganalysis can be used to classify an object with or without hidden information. In this paper, we present a novel approach to detect the presence of LSB (least significant bit) steganographic messages in the voice secure communication system. A distance measure, which has been proved to be sensitive to LSB steganography by ANOVA (analysis of variance), is denoted to estimate the difference between the host signal and the stego signal. Then a MI (maximum likelihood) decision is combined to form the classifier. Statistical experiments show that the proposed approach has highly accurate rate and low computational complexity.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"360 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132232572","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 segment x-ray images of steel pipe welding to assess the quality of welding. Image segmentation is posed as an optimization problem, and is correlated with the energy function of the multistage Hopfield neural network. The algorithm for optimization and the principle of selecting coefficient are also given. The algorithm is easy to be programmed. As an application, we successfully segment some real industrial welding x-ray images.
{"title":"A Novel Algorithm for Detecting Air Holes in Steel Pipe Welding Based on Hopfield Neural Network","authors":"Weixin Gao, Tang Nan, Xiangyang Mu","doi":"10.1109/SNPD.2007.66","DOIUrl":"https://doi.org/10.1109/SNPD.2007.66","url":null,"abstract":"The paper segment x-ray images of steel pipe welding to assess the quality of welding. Image segmentation is posed as an optimization problem, and is correlated with the energy function of the multistage Hopfield neural network. The algorithm for optimization and the principle of selecting coefficient are also given. The algorithm is easy to be programmed. As an application, we successfully segment some real industrial welding x-ray images.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"s3-29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130122473","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
扫码关注我们
求助内容：
应助结果提醒方式：