Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687593
Haiyan Zhao, Yanlan Chen
To obtain and maintain user models are very important for personalized service offering. The quality of personalized services directly relies on the quality of the user models. Not surprisingly, many web sites have adopted different ways to construct user models so that they can recommend goods or services to individuals according to user's preference. Obviously, to integrate separate user models coming from different sources for one user can provide more comprehensive and accurate user information. Thus there exist the requirements to obtain integrated user models by sharing their user models. After discussing the requirements of sharing user models, an open user model service platform is presented. It's architecture, key technologies and an implemented prototype are introduced.
{"title":"An open user model service platform","authors":"Haiyan Zhao, Yanlan Chen","doi":"10.1109/PIC.2010.5687593","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687593","url":null,"abstract":"To obtain and maintain user models are very important for personalized service offering. The quality of personalized services directly relies on the quality of the user models. Not surprisingly, many web sites have adopted different ways to construct user models so that they can recommend goods or services to individuals according to user's preference. Obviously, to integrate separate user models coming from different sources for one user can provide more comprehensive and accurate user information. Thus there exist the requirements to obtain integrated user models by sharing their user models. After discussing the requirements of sharing user models, an open user model service platform is presented. It's architecture, key technologies and an implemented prototype are introduced.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125469614","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687974
Zheng Gui, Peng Xie
Reliability is a fatal factor in the operation of automatic container terminal. RTK GPS technology could be adopted for container and equipment positioning, structure deformation detecting, travel control and safety survey to enhance the reliability. Also some steps that could be taken up to backup the operation of GPS are discussed, which involve sheltering compensation, standby communication, standby reference station and receiver calibrating.
{"title":"RTK GPS enhanced reliability for automatic container terminal","authors":"Zheng Gui, Peng Xie","doi":"10.1109/PIC.2010.5687974","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687974","url":null,"abstract":"Reliability is a fatal factor in the operation of automatic container terminal. RTK GPS technology could be adopted for container and equipment positioning, structure deformation detecting, travel control and safety survey to enhance the reliability. Also some steps that could be taken up to backup the operation of GPS are discussed, which involve sheltering compensation, standby communication, standby reference station and receiver calibrating.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133724814","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687899
Rui Ling, Yuan-jun He, Kairen Deng
How to use computers to effectively solve geometric computation problems is one important focus in the development of geometry. In this paper, we introduce a new method to solve geometric problems with a geometric method. We establish a set of geometric bases and generate sequences of these geometric bases automatically with forward-reasoning. The geometric base sequence is a new description of the solution of geometric problems which is more readable than the solution generated by algebra methods. Moreover, we modify the hidden Markov chain model to avoid information explosion. Experimental results indicate that our method can be used to generate the sequences efficiently.
{"title":"Automatic generation of geometric base sequences","authors":"Rui Ling, Yuan-jun He, Kairen Deng","doi":"10.1109/PIC.2010.5687899","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687899","url":null,"abstract":"How to use computers to effectively solve geometric computation problems is one important focus in the development of geometry. In this paper, we introduce a new method to solve geometric problems with a geometric method. We establish a set of geometric bases and generate sequences of these geometric bases automatically with forward-reasoning. The geometric base sequence is a new description of the solution of geometric problems which is more readable than the solution generated by algebra methods. Moreover, we modify the hidden Markov chain model to avoid information explosion. Experimental results indicate that our method can be used to generate the sequences efficiently.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116696746","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5688018
Ken Chen, Yicong Wang, G. Jiang, L. Banta
Saddle points formed through morphologic erosion and existing between adjacent connecting objects in 2D images have been applied for segmenting purposes. In this article, a new approach is presented for searching the saddle points in 2D images using mathematic programming restraints for the purpose of ultimately separating the connecting objects. By combining the pixel distribution information in 3D topographic image and mathematic programming restraints for saddle point, the saddle points in the image can thus be identified. In addition, the relation between step selection in the algorithm and detection rate is also explored. The experiment results on the given real particle images suggest the better robustness in saddle point detection algorithm, which undoubtedly lays the practical and theoretic base for touching object segmentation for 2D images.
{"title":"Saddle point detection for connecting objects in 2D images based on mathematic programming restraints","authors":"Ken Chen, Yicong Wang, G. Jiang, L. Banta","doi":"10.1109/PIC.2010.5688018","DOIUrl":"https://doi.org/10.1109/PIC.2010.5688018","url":null,"abstract":"Saddle points formed through morphologic erosion and existing between adjacent connecting objects in 2D images have been applied for segmenting purposes. In this article, a new approach is presented for searching the saddle points in 2D images using mathematic programming restraints for the purpose of ultimately separating the connecting objects. By combining the pixel distribution information in 3D topographic image and mathematic programming restraints for saddle point, the saddle points in the image can thus be identified. In addition, the relation between step selection in the algorithm and detection rate is also explored. The experiment results on the given real particle images suggest the better robustness in saddle point detection algorithm, which undoubtedly lays the practical and theoretic base for touching object segmentation for 2D images.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116864699","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687479
Zhen Li, Guo Zhang, H. Pan, Qiang Qiang
The use of stereoscopic SAR images offers an alternative to conventional stereo-photogrammetric survey for the generation of Digital Elevation Models (DEMs). Often the SAR ground-range form is more popular with the commercial users, since the pixel spacing on the ground is roughly the same for the different look-angle images. The different mathematical descriptions between the slant-range and ground-range products thus make the stereo modeling and adjustment a challenging objective to deal with. Previous work applied sensor model adjustment of range and timing parameters to SAR spotlight range images, promising 3-D mapping accuracies in the range of 2 m. However, this adopted the direct least squares method, which is too sensitive in the case of the ground-range images, making it less than optimal for SAR range images' stereo restitution. In this paper, an image based transformation (geometric correction) using a small number of control points(CPs) in cooperation with the Rational Polynomial Coefficient (RPC) model to improve the space intersection accuracy is proposed. The development of such an RPC-based adjustment method is first described, which is very practical to implement and can be applied to SAR slant- or ground-range products. By situating several well-distributed trihedral corner reflectors (CRs) within sites and imaging these sites using COSMO-SkyMed's stripmap (SM) mode, the modeling quality of the delivered slant- or ground-range products was validated, and the 3-D mapping potential was also assessed.
{"title":"RPC-based adjustment model for COSMO-SkyMed stereo slant/ground-range images","authors":"Zhen Li, Guo Zhang, H. Pan, Qiang Qiang","doi":"10.1109/PIC.2010.5687479","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687479","url":null,"abstract":"The use of stereoscopic SAR images offers an alternative to conventional stereo-photogrammetric survey for the generation of Digital Elevation Models (DEMs). Often the SAR ground-range form is more popular with the commercial users, since the pixel spacing on the ground is roughly the same for the different look-angle images. The different mathematical descriptions between the slant-range and ground-range products thus make the stereo modeling and adjustment a challenging objective to deal with. Previous work applied sensor model adjustment of range and timing parameters to SAR spotlight range images, promising 3-D mapping accuracies in the range of 2 m. However, this adopted the direct least squares method, which is too sensitive in the case of the ground-range images, making it less than optimal for SAR range images' stereo restitution. In this paper, an image based transformation (geometric correction) using a small number of control points(CPs) in cooperation with the Rational Polynomial Coefficient (RPC) model to improve the space intersection accuracy is proposed. The development of such an RPC-based adjustment method is first described, which is very practical to implement and can be applied to SAR slant- or ground-range products. By situating several well-distributed trihedral corner reflectors (CRs) within sites and imaging these sites using COSMO-SkyMed's stripmap (SM) mode, the modeling quality of the delivered slant- or ground-range products was validated, and the 3-D mapping potential was also assessed.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131981712","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687960
Li Mao, Deyu Qi, Xiaoxi Li
The bioadhesive drug delivery systems using satrch-based colon-targeted drug carriers have drawn great attention in the field of pharmaceutical science in resent years. A Neural Network (NN) prediction model was developed based on hibrid method of improved genetic algorithms (GA) and conjugate gradient algorithm for backpropagation(GDBP) NN according to key factors that affect releasing behaviors of satrch-based colon-targeted drug carrier. In particular, function approximation capability and high efficciency of GDBP NN is used to simulate nonlinear relation between key factors and drug carrier releasing behaviors. Futhermore, the simulation results indicate that compared with traditional GA-BP NN, training efficiency of GA-GDBP NN has been greatly improved. Consequently, the model finds a new way to predict drug carrier releasing behaviors and instructs factors seting in real experiments.
{"title":"Improved GA combined with GDBP algorithm for forecasting releasing behaviors of drug carrier","authors":"Li Mao, Deyu Qi, Xiaoxi Li","doi":"10.1109/PIC.2010.5687960","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687960","url":null,"abstract":"The bioadhesive drug delivery systems using satrch-based colon-targeted drug carriers have drawn great attention in the field of pharmaceutical science in resent years. A Neural Network (NN) prediction model was developed based on hibrid method of improved genetic algorithms (GA) and conjugate gradient algorithm for backpropagation(GDBP) NN according to key factors that affect releasing behaviors of satrch-based colon-targeted drug carrier. In particular, function approximation capability and high efficciency of GDBP NN is used to simulate nonlinear relation between key factors and drug carrier releasing behaviors. Futhermore, the simulation results indicate that compared with traditional GA-BP NN, training efficiency of GA-GDBP NN has been greatly improved. Consequently, the model finds a new way to predict drug carrier releasing behaviors and instructs factors seting in real experiments.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134325465","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5688020
Lei Hua, Lei Xie, Hui-fang Chen
The color interpolation method of Bayer CFA used in most digital cameras plays an important role in imaging system. In Bayer pattern, the green components are the twice as much as red or blue and contain more image information, which can be used to compensate the interpolations of red and blue. Due to the high correlation among the three color channels, color mutation is prevented by the fixed color difference. Based on these principles, the proposed interpolation algorithm estimates green component firstly with adapted color plane interpolation algorithm, then computes the color difference image (R-G and B-G) to interpolate the full resolution difference image with the compensation of interpolated G and edge adaptive method. Edge blurring problem is addressed by using edge judgment to estimate RGB. Color distortion is reduced using color difference interpolation procedure. Experimental results show that the proposed algorithm outperforms existing typical interpolation methods in terms of image quality and peak signal-to-noise ratio (PSNR), and also computational complexity is low.
{"title":"A color interpolation algorithm for Bayer pattern digital cameras based on green components and color difference space","authors":"Lei Hua, Lei Xie, Hui-fang Chen","doi":"10.1109/PIC.2010.5688020","DOIUrl":"https://doi.org/10.1109/PIC.2010.5688020","url":null,"abstract":"The color interpolation method of Bayer CFA used in most digital cameras plays an important role in imaging system. In Bayer pattern, the green components are the twice as much as red or blue and contain more image information, which can be used to compensate the interpolations of red and blue. Due to the high correlation among the three color channels, color mutation is prevented by the fixed color difference. Based on these principles, the proposed interpolation algorithm estimates green component firstly with adapted color plane interpolation algorithm, then computes the color difference image (R-G and B-G) to interpolate the full resolution difference image with the compensation of interpolated G and edge adaptive method. Edge blurring problem is addressed by using edge judgment to estimate RGB. Color distortion is reduced using color difference interpolation procedure. Experimental results show that the proposed algorithm outperforms existing typical interpolation methods in terms of image quality and peak signal-to-noise ratio (PSNR), and also computational complexity is low.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127713078","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687590
ShouChao Song, Jie Zhang, J. Du, Qiaoyuan Wen
How to construct Boolean functions with good crytographic characteristics is an interesting and significant problem in crytography. Based on the properties of concatenation, two methods were proposed to construct Boolean functions with optimal or suboptimal algebraic immunity. Moreover, some other cryptographic properties, such as algebraic degree, balancedness, and nonlinearity, of the constructed function were also studied. At the end, a new idea was presented for ascertaining whether the given Boolean function had optimal algebraic immunity.
{"title":"On the construction of Boolean functions with optimal algebraic immunity and good other properties by concatenation","authors":"ShouChao Song, Jie Zhang, J. Du, Qiaoyuan Wen","doi":"10.1109/PIC.2010.5687590","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687590","url":null,"abstract":"How to construct Boolean functions with good crytographic characteristics is an interesting and significant problem in crytography. Based on the properties of concatenation, two methods were proposed to construct Boolean functions with optimal or suboptimal algebraic immunity. Moreover, some other cryptographic properties, such as algebraic degree, balancedness, and nonlinearity, of the constructed function were also studied. At the end, a new idea was presented for ascertaining whether the given Boolean function had optimal algebraic immunity.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127740690","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687419
Chunguang Chang, Xiang Ma, Xiaoyu Song, Bo Gao
With the flourishing development of construction and real estate industry, engineering accidents happen more frequently. The purpose of this paper is to generate emergency case as quick as possible so as to improve the quick emergency reaction capability when engineering accident happens. The flow of CBR based emergency case generating system (CBR/ECGS) under engineering accidents is studied. Both the static and dynamic case presentation technologies for CBR/ECGS are designed, and the case retrieval, case adaptation and case maintenance technologies for CBR/ECGS are proposed. It can be seen from running result of CBR/ECGS that, comparing with the result under the mode in which artificial adjustment is allowed, the overcast degree of emergency cases generated by CBR/ECGS under the mode in which only automatic system adjustment is allowed is almost the same. The validity of CBR/ECGS proposed in this paper is validated, and CBR is suitable for solving complex, non-structure problems such as emergency case generating under engineering accidents.
{"title":"CBR based emergency case generating system under engineering accidents","authors":"Chunguang Chang, Xiang Ma, Xiaoyu Song, Bo Gao","doi":"10.1109/PIC.2010.5687419","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687419","url":null,"abstract":"With the flourishing development of construction and real estate industry, engineering accidents happen more frequently. The purpose of this paper is to generate emergency case as quick as possible so as to improve the quick emergency reaction capability when engineering accident happens. The flow of CBR based emergency case generating system (CBR/ECGS) under engineering accidents is studied. Both the static and dynamic case presentation technologies for CBR/ECGS are designed, and the case retrieval, case adaptation and case maintenance technologies for CBR/ECGS are proposed. It can be seen from running result of CBR/ECGS that, comparing with the result under the mode in which artificial adjustment is allowed, the overcast degree of emergency cases generated by CBR/ECGS under the mode in which only automatic system adjustment is allowed is almost the same. The validity of CBR/ECGS proposed in this paper is validated, and CBR is suitable for solving complex, non-structure problems such as emergency case generating under engineering accidents.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129158122","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687942
Fei Tan, Zhengming Li, Xiaoqin Zhu
Influenced by the noises, for example, eyelid and eyelash occlusions, iris localization algorithms are difficult to keep a right balance between real-time quality and accuracy. Therefore, a novel iris localization method with effective noise eliminating is proposed in this paper. For the iris' inner edge location, morphological open is used to eliminate noise based on separating pupil region by binaryzation. Then the pupil's center and radius are located accurately by gray projection. For the iris' outer edge location, morphological close is proposed to eliminate the rich texture within the iris area. Based on this method, an edge detection template to search four directional points within a small scope of the probable boundary is designed and thus the iris's centre and radius can be located. Simulation results show that, compared with the pre-algorithms, the new algorithm not only greatly improves the accuracy and the speed, but also shows good robustness.
{"title":"Iris localization algorithm based on gray distribution features","authors":"Fei Tan, Zhengming Li, Xiaoqin Zhu","doi":"10.1109/PIC.2010.5687942","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687942","url":null,"abstract":"Influenced by the noises, for example, eyelid and eyelash occlusions, iris localization algorithms are difficult to keep a right balance between real-time quality and accuracy. Therefore, a novel iris localization method with effective noise eliminating is proposed in this paper. For the iris' inner edge location, morphological open is used to eliminate noise based on separating pupil region by binaryzation. Then the pupil's center and radius are located accurately by gray projection. For the iris' outer edge location, morphological close is proposed to eliminate the rich texture within the iris area. Based on this method, an edge detection template to search four directional points within a small scope of the probable boundary is designed and thus the iris's centre and radius can be located. Simulation results show that, compared with the pre-algorithms, the new algorithm not only greatly improves the accuracy and the speed, but also shows good robustness.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129179576","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
扫码关注我们
求助内容：
应助结果提醒方式：