{"title":"Image Stitching of Scenes with Large Misregistration","authors":"Mai Zheng, Antai Guo, W. Zhong, Li Guo","doi":"10.1109/ICCSIT.2008.30","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.30","url":null,"abstract":"This paper presents a technique to automatically stitch images captured from different viewpoints. The main contribution of our method is that it allows for largely mismatched content between the adjacent views. To do this, we detect robust keypoints in each of the input images and match them between the adjacent views. Then the correct correspondences are employed to compute the projective matrix through least-square method. After aligning the inputs on the same plane, we use a weight mask to blend the overlapped views with different priorities. This blending strategy keeps the main information of the scene and avoids the interference of the mismatched inputs. We demonstrate the effectiveness of our method on image sets with large misregistration.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115809598","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}
{"title":"Study on User Certificate in Public Key Infrastructure with High Efficiency and Robust","authors":"Xiangdong Yin, Xuri Chen","doi":"10.1109/ICCSIT.2008.179","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.179","url":null,"abstract":"PKI (public key infrastructure) bases on cryptography as its theoretic fundamental, it provides identity authentication, confidentiality, integral and non-repudiation service, it is the important credible and authorized safety platform of network application and it provides information safety assurance for network activities. The paper designs user certificate in PKI, mainly discusses potential safety hazard and efficiency for user certificate in PKI, and on the basic of which, it advances design proposal for user certificate in PKI, and finally it realizes the proposal and makes brief analysis for its performance.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124581494","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}
S. Chowdhury, A. Chowdhury, S. R. Bhadra Chaudhuri, C. T. Bhunia
{"title":"Data Transmission Using Online Dynamic Dictionary Based Compression Technique of Fixed & Variable Length Coding","authors":"S. Chowdhury, A. Chowdhury, S. R. Bhadra Chaudhuri, C. T. Bhunia","doi":"10.1109/ICCSIT.2008.112","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.112","url":null,"abstract":"While sending data packets through the network some on-line dictionary based compression technique can be applied to reduce the data packet size for better bandwidth utilization and hence faster transmission of data. It has been observed that compression techniques works well, when repetition rate of the same symbols within the data are high i.e. when the redundancy within the data increases. During both encoding and decoding process, the online building of the dictionary in the primary memory ensures the single pass over the data, and the dictionary need not need to be transmitted over the network. Since this proposed technique scans the data byte-wise, hence chances of repetition of individual symbols is higher for text messages as we have limited number of key characters (0-127). Fixed length coding is simple to implement, as it transmits fixed length codes for all dictionary entries. Although for bigger messages better optimization in terms of size reduction can be achieved through variable length coding with L-Z technique, where transmitted code length corresponding to individual dictionary entries will vary according to the requirement dynamically.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123634577","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}
{"title":"The Design of Publishing CRM System Based on J2EE and XML","authors":"Lingbo Liu, Dake Ding, Huaili Zheng","doi":"10.1109/ICCSIT.2008.97","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.97","url":null,"abstract":"With the opening of the publishing market, China's publishing industry is facing more and more fierce competition. And it has become a trend to research and develop the Customer Relationship Management (CRM) system for publishing houses in order to improve their integrated competitive power. The authors in this essay, after analyzing J2EE and XML technologies, put forward a framework of the CRM system for publishing houses based on the layer models of J2EE and solve the problem of exchanging heterogeneous database based on the XML technology. Also in this essay, the mechanism of Jsp servlet and Javabean is researched and a data model for the evaluation of the publisherpsilas client's value is established. The project carried out by the authors has established a CRM system which enables the publishing houses to focus their advantages resources and significantly improve their work efficiency.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123975032","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}
Jianzhou Wang, Jinzhao Liang, Jinxing Che, Donghuai Sun
{"title":"ARMA Model identification using Particle Swarm Optimization Algorithm","authors":"Jianzhou Wang, Jinzhao Liang, Jinxing Che, Donghuai Sun","doi":"10.1109/ICCSIT.2008.60","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.60","url":null,"abstract":"In this paper, a new approach to ARMA model identification using evolutionary particle swarm optimization (PSO) algorithm has been proposed. ARMA is a popular method to analyze stationary univariate time series data. Stationarity checking, model identification, model estimation and model checking are usually four main stages to build an ARMA model and model identification is the most important stage in building ARMA models. However there is no method suitable for ARMA model that can overcome the problem of local optima, which is suitable for any ARMA model. The effectiveness of PSO Algorithm which is used to choose the parameters of ARMA Model automatically is tested for ARMA (2,2) model example. The identification of model ARMA(2,2): xt +0.1xt-1-0.2xt-2 = at+0.2at-1-0.5at-2. The simulation shows that the PSO-based model identification method can present better solutions than the MINIC model identification method.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125044209","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}
{"title":"Research on Organization and Discovery of Grid Resources","authors":"Xin Huang, Yan Ma, Juhua Zhang","doi":"10.1109/ICCSIT.2008.61","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.61","url":null,"abstract":"This paper analyzes grid resources organization, elaborates on the fundamental principles of the ant colony algorithm, and proposes a grid resource discovery method based on the ant colony algorithm. We consider users request ontology as ants, take search resource as food, and food source is the node of search target. The process of ants to find food is similar to the process of discovery grid resources.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128193446","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}
{"title":"Numerical Simulation of Coal Water Mixture Pipeline Transport Axial Flow Field","authors":"Zhiqiang Xu, Yuming Xia","doi":"10.1109/ICCSIT.2008.75","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.75","url":null,"abstract":"The finite element method is applied to simulate the coal water mixture pipeline transport axial flow field. The pipeline axial velocity and contour distribution are obtained by solving the divided pipeline axial flow field. The relationship curves between the axial velocity and the cross sectional radiuses of the pipeline axial flow field are drawn. Two groups of comparative computations are performed and the relationships between the axial velocity and the variety of the axial pressure gradients and cross sectional radiuses are indicated according to the conclusions. The average axial velocity and the maximum axial velocity are compared. According to the comparison results, a method of calculating the flow quantity of the pipeline is obtained.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127038441","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}
{"title":"Target Location in Self-organized Sensor Networks Based on Perfect Sampling","authors":"Zhang Jingmei, Zhai Yong-zhi, Gao Shesheng","doi":"10.1109/ICCSIT.2008.126","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.126","url":null,"abstract":"An equivalent center of concentric circle model in target location based on self-organized sensor networks (ad-hoc) is derived. The model is a description of many different sensors in the area where there is one or more monitored target, and the number of sensors is assumed to be the certain stochastic distribution. By defining a proposal distribution about unknown parameters, the maximum posterior likelihood function is taken. Perfect sampling scheme has been applied to induce the runtime of coalesce of chain. We come to the samples from the posterior distribution of targets being monitored. Numerical simulation results indicate that the developed method is reasonable.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130067456","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}
{"title":"Perfect Sampling on Blind Receivers Fading Channel with Unknown Channel State Information","authors":"Zhai Yong-zhi, Zhang Jingmei","doi":"10.1109/ICCSIT.2008.95","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.95","url":null,"abstract":"This paper presents perfect sampling based on coupling from the past (CFTP) algorithms for blind detection about flat fading channel. The basic idea is to take CFTP as a protocol for finite-state Markov chain Monte Carlo (MCMC) method and by itself. The algorithm can determine the necessary runtime to convergence of state with unknown channel parameters by using the sandwiched CFTP scheme distribution, which allows for perfect (exact) and independent sampling from the desired stationary state distribution of the fading channels with unknown statistics so as to lower the computation complexity. On above, we generate samples from the likelihood function of the posterior distribution and extract relevant information. Simulation results are provided to demonstrate the excellent performance of the proposed blind receiver method.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132395235","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}
{"title":"Parallel Bionic Algorithm Used to Optimize Sensor Placement for Self-diagnostic Smart Structures","authors":"Jianhong Xie","doi":"10.1109/ICCSIT.2008.29","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.29","url":null,"abstract":"Smart structures are a multi-sensor architecture, and the problem of multi-sensor optimal placement involves the cost-effective factor. It has been of great practical value and is worth to researching further to optimize sensors' locations and number for smart structures. For piezoelectric smart composite laminated plates, least square wavelet support vector machine (LS-WSVM) with wavelet kernel function is proposed to establish the performance function of damage detection, and then an improved genetic algorithm (GA) is applied to optimize the performance function. To enhance the algorithm speed, LS-WSVM adopted as parallel mode are combined with GA, that is, a parallel genetic algorithm integrated neural network is constructed to realize the optimal sensor placement corresponding to its primal sensor placement based on damage detection. Simulation results show that the optimal placements of different number of sensors are consistent with engineering judgments, and the optimal sensors' number corresponding to its primal sensorspsila number can be determined through the method of parallel genetic algorithm integrated neural network, and the method possesses the advantages of faster speed, etc..","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130877710","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}