Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747849
Songzhao Xie, Chengyou Wang, Chao Cui
This paper studies the statistical properties and distributed properties of the coefficients after the image is decomposed at different scales by using the wavelet transform. The different quantization and coding scheme for each subimage are carried out in accordance with its statistical properties and distributed properties of the coefficients. The wavelet coefficients in low frequency subimages are compressed by using Differential Pulse Code Modulation (DPCM). The wavelet coefficients in high frequency subimages are compressed and vector quantized by using Kohonen neural network on Self-Organizing Feature Mapping (SOFM) algorithm. In addition, an improved SOFM algorithm is used in vector quantization in order to shorten the encoding and decoding time. Using these compression techniques, we can obtain rather satisfactory compression ratio as well as shorten the encoding and decoding time while achieving superior reconstructed images.
{"title":"Vector quantization image coding based on biorthogonal wavelet transform and improved SOFM","authors":"Songzhao Xie, Chengyou Wang, Chao Cui","doi":"10.1109/ICIST.2013.6747849","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747849","url":null,"abstract":"This paper studies the statistical properties and distributed properties of the coefficients after the image is decomposed at different scales by using the wavelet transform. The different quantization and coding scheme for each subimage are carried out in accordance with its statistical properties and distributed properties of the coefficients. The wavelet coefficients in low frequency subimages are compressed by using Differential Pulse Code Modulation (DPCM). The wavelet coefficients in high frequency subimages are compressed and vector quantized by using Kohonen neural network on Self-Organizing Feature Mapping (SOFM) algorithm. In addition, an improved SOFM algorithm is used in vector quantization in order to shorten the encoding and decoding time. Using these compression techniques, we can obtain rather satisfactory compression ratio as well as shorten the encoding and decoding time while achieving superior reconstructed images.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116939631","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747702
C. Chen, W. Zou, Jiajun Wang
In this paper, a simple and efficient 3D surface reconstruction algorithm which can be implemented on mid or low-end computers is proposed. In this algorithm, the 3D images are obtained by a depth motion sensing device named Kinect. Data from region of interests are obtained by segmenting images whose k-neighbor relationship is established with a k-dimensional tree (KD-tree). After patching the point cloud holes with a bicubic spline function and a triangular mesh, the 3D surface of the object is reconstructed. Furthermore, the neighborhoods defined differently are used to connect regions since several non-connected regions exist in the point cloud. Experimental results show that the proposed algorithm based on the Kinect platform can be used to reconstruct complete and smooth surface even if the point cloud is non-connected in space and some of the captured data are lost.
{"title":"3D surface reconstruction based on Kinect","authors":"C. Chen, W. Zou, Jiajun Wang","doi":"10.1109/ICIST.2013.6747702","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747702","url":null,"abstract":"In this paper, a simple and efficient 3D surface reconstruction algorithm which can be implemented on mid or low-end computers is proposed. In this algorithm, the 3D images are obtained by a depth motion sensing device named Kinect. Data from region of interests are obtained by segmenting images whose k-neighbor relationship is established with a k-dimensional tree (KD-tree). After patching the point cloud holes with a bicubic spline function and a triangular mesh, the 3D surface of the object is reconstructed. Furthermore, the neighborhoods defined differently are used to connect regions since several non-connected regions exist in the point cloud. Experimental results show that the proposed algorithm based on the Kinect platform can be used to reconstruct complete and smooth surface even if the point cloud is non-connected in space and some of the captured data are lost.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115469704","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747622
Nguyen Hoa, Tran Duc Hieu
This paper introduces a probabilistic relational data base model (PRDB). In this model, the tuple attribute value of relations is uncertain and represented by a probabilistic triple. Every probabilistic triple consists of a set of relational attribute values and two upper and lower bound probability distributions over the set of the attribute values. Semantics of such representation indicating that the attribute has a value in the set with a probability belongs to an interval from the upper and lower bound of the set. On the base and using probabilistic combination strategies in Eiter et al (2001), we define the notions of uncertain values, schemas, probabilistic relations, and selection operation as respective extensions of the notions of values, schemas, relations, and selection operation in the conventional relational database model.
{"title":"A probabilistic relational data model for uncertain information","authors":"Nguyen Hoa, Tran Duc Hieu","doi":"10.1109/ICIST.2013.6747622","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747622","url":null,"abstract":"This paper introduces a probabilistic relational data base model (PRDB). In this model, the tuple attribute value of relations is uncertain and represented by a probabilistic triple. Every probabilistic triple consists of a set of relational attribute values and two upper and lower bound probability distributions over the set of the attribute values. Semantics of such representation indicating that the attribute has a value in the set with a probability belongs to an interval from the upper and lower bound of the set. On the base and using probabilistic combination strategies in Eiter et al (2001), we define the notions of uncertain values, schemas, probabilistic relations, and selection operation as respective extensions of the notions of values, schemas, relations, and selection operation in the conventional relational database model.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116061990","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747550
Dingxuan Zhao, Zhiwen Zhang, M. Li, Tianyu Li, Chengcheng Wang
Through the analysis of a five-ton loader working condition characteristics, this paper proposed a parallel hybrid loader structure, studied its parameter matching and put forward a fuzzy logic control strategy for energy saving. The input variables of fuzzy logic controller were system demand torque obtained by online estimation and state of charge of super capacitor. After fuzzy control optimization algorithm, the engine would work smoothly in the high efficiency area and super capacitor would keep balance between charging and discharging. The simulation results showed that the control strategy improved the engine fuel economy and energy saving effect which could save fuel by 7.72% compared with the traditional loader.
{"title":"Research on control strategy for parallel hybrid loader","authors":"Dingxuan Zhao, Zhiwen Zhang, M. Li, Tianyu Li, Chengcheng Wang","doi":"10.1109/ICIST.2013.6747550","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747550","url":null,"abstract":"Through the analysis of a five-ton loader working condition characteristics, this paper proposed a parallel hybrid loader structure, studied its parameter matching and put forward a fuzzy logic control strategy for energy saving. The input variables of fuzzy logic controller were system demand torque obtained by online estimation and state of charge of super capacitor. After fuzzy control optimization algorithm, the engine would work smoothly in the high efficiency area and super capacitor would keep balance between charging and discharging. The simulation results showed that the control strategy improved the engine fuel economy and energy saving effect which could save fuel by 7.72% compared with the traditional loader.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115595572","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747697
Xiang Cheng, Ganghong Zhao, Changyu Chen, Wei Wang
As for the mass data and record process variables produced during the aircraft digital manufacturing project, the information interactive model based on XML in the aircraft manufacturing project management is proposed from a new aspect. By establishing the independent interactive module between CIP(Central Information Platform) and Heterogeneous Database, using JDOM to visit and operate the mapping between XML document and relational database, a standard interface with good expansibility in different platforms for exchanging data is given in the article which greatly improves the information sharing and integration efficiency of aviation enterprise.
{"title":"The application of XML-based information interactive model in aircraft manufacturing project management","authors":"Xiang Cheng, Ganghong Zhao, Changyu Chen, Wei Wang","doi":"10.1109/ICIST.2013.6747697","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747697","url":null,"abstract":"As for the mass data and record process variables produced during the aircraft digital manufacturing project, the information interactive model based on XML in the aircraft manufacturing project management is proposed from a new aspect. By establishing the independent interactive module between CIP(Central Information Platform) and Heterogeneous Database, using JDOM to visit and operate the mapping between XML document and relational database, a standard interface with good expansibility in different platforms for exchanging data is given in the article which greatly improves the information sharing and integration efficiency of aviation enterprise.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123818017","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747569
Xingsheng Yuan, Fengtao Xiang, Zhengzhi Wang
In this paper, we propose a new automatic color image segmentation method using Colored Sift (CSIFT) and Graph Cuts. Color provides valuable information in object segmentation and recognition tasks. However, color information is vulnerable to be affected by shadows and highlights. CSIFT is a stable and distinctive feature with respect to variations in the photometrical imaging conditions. It has been demonstrated that the CSIFT is more robust than the conventional SIFT with respect to color and photometrical variations. On the other hand, Graph Cuts is proposed as a segmentation method of a detailed object region. But it is necessary to give seeds manually. In our method, the object is recognized first by CSIFT interest points. After that, the object region is cut out by Graph Cuts using CSIFT interest points as seeds.
{"title":"Automatic color image segmentation using CSIFT and Graph Cuts","authors":"Xingsheng Yuan, Fengtao Xiang, Zhengzhi Wang","doi":"10.1109/ICIST.2013.6747569","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747569","url":null,"abstract":"In this paper, we propose a new automatic color image segmentation method using Colored Sift (CSIFT) and Graph Cuts. Color provides valuable information in object segmentation and recognition tasks. However, color information is vulnerable to be affected by shadows and highlights. CSIFT is a stable and distinctive feature with respect to variations in the photometrical imaging conditions. It has been demonstrated that the CSIFT is more robust than the conventional SIFT with respect to color and photometrical variations. On the other hand, Graph Cuts is proposed as a segmentation method of a detailed object region. But it is necessary to give seeds manually. In our method, the object is recognized first by CSIFT interest points. After that, the object region is cut out by Graph Cuts using CSIFT interest points as seeds.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124689636","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747560
Li-Bao An, Ming-Ying Chen, Peiqing Yang
Machining parameter optimization plays an important role in satisfying quality requirements of machined parts at low production cost or time. It requires optimal selection of machining parameters and is essential for the process automation and implementation of a computer-integrated manufacturing system. In this research, a brief review of recent progress on the optimization of machining parameters is introduced. Some new machining practices developed in recent years are discussed including hard turning, dry cutting, high speed machining, and machining of difficult-to-machine materials. Modeling skills for creating relations between input parameters and output performances of machining processes and optimization techniques for solving optimal or near-optimal solutions are summarized and analyzed.
{"title":"Recent development of parameter optimization for machining processes","authors":"Li-Bao An, Ming-Ying Chen, Peiqing Yang","doi":"10.1109/ICIST.2013.6747560","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747560","url":null,"abstract":"Machining parameter optimization plays an important role in satisfying quality requirements of machined parts at low production cost or time. It requires optimal selection of machining parameters and is essential for the process automation and implementation of a computer-integrated manufacturing system. In this research, a brief review of recent progress on the optimization of machining parameters is introduced. Some new machining practices developed in recent years are discussed including hard turning, dry cutting, high speed machining, and machining of difficult-to-machine materials. Modeling skills for creating relations between input parameters and output performances of machining processes and optimization techniques for solving optimal or near-optimal solutions are summarized and analyzed.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123393822","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747720
Hui Wang, Ting-Zhu Huang
In this paper, an efficient active contour with Gaussian distribution fitting energy is proposed for image segmentation. We introduce the Gaussian distribution to construct the fitting energy, which drives the active contour toward the object boundaries. In order to protect the smoothness property and the stability, a reaction diffusion approach is borrowed to design a two-stage scheme, which eliminates the procedure of re-initialization of traditional level set methods and improves the segmentation quality effectively.
{"title":"An efficient active contour with Gaussian distribution fitting energy","authors":"Hui Wang, Ting-Zhu Huang","doi":"10.1109/ICIST.2013.6747720","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747720","url":null,"abstract":"In this paper, an efficient active contour with Gaussian distribution fitting energy is proposed for image segmentation. We introduce the Gaussian distribution to construct the fitting energy, which drives the active contour toward the object boundaries. In order to protect the smoothness property and the stability, a reaction diffusion approach is borrowed to design a two-stage scheme, which eliminates the procedure of re-initialization of traditional level set methods and improves the segmentation quality effectively.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128164416","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747722
Hann-Tzong Chern, Bo Xu
Worldwide Interoperability for Microwave Access (WiMAX) is a broadband wireless access (BWA) technology. It provides high data rate and multimedia service. It also supports Quality of Service (QoS) for various types of application. In this network, it is important to allocate appropriate resource to different class of service to guarantee the delay of real-time service and avoid the starvation of non real-time service. In IEEE 802.16, this part is remained opened to be explored. There is a connection admission control (CAC) mechanism in this network to allow a connection reserving bandwidth beforehand. However, a good prediction of the required bandwidth is not easy. A reserved bandwidth may not always meet its load. Thus, an algorithm adaptive to the load is proposed here. In this paper, a reserved bandwidth is allocated to each connection in the first stage. Then, two possible weighted fair queue (WFQ) algorithms are proposed. In the first one, the weight is decided by the left queue length of the connection. In the second one, the weight is decided by the left queue length and class of the connection. In this stage, the allocation will continue until the bandwidth of the frame is exhausted or all packets in the queue have been scheduled. The simulation will be done and compared with the round robin algorithm for both methods. The results show these algorithms can adapt to the load of the connection.
{"title":"The bandwidth allocation by queue length (BA-QL) for WiMAX network","authors":"Hann-Tzong Chern, Bo Xu","doi":"10.1109/ICIST.2013.6747722","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747722","url":null,"abstract":"Worldwide Interoperability for Microwave Access (WiMAX) is a broadband wireless access (BWA) technology. It provides high data rate and multimedia service. It also supports Quality of Service (QoS) for various types of application. In this network, it is important to allocate appropriate resource to different class of service to guarantee the delay of real-time service and avoid the starvation of non real-time service. In IEEE 802.16, this part is remained opened to be explored. There is a connection admission control (CAC) mechanism in this network to allow a connection reserving bandwidth beforehand. However, a good prediction of the required bandwidth is not easy. A reserved bandwidth may not always meet its load. Thus, an algorithm adaptive to the load is proposed here. In this paper, a reserved bandwidth is allocated to each connection in the first stage. Then, two possible weighted fair queue (WFQ) algorithms are proposed. In the first one, the weight is decided by the left queue length of the connection. In the second one, the weight is decided by the left queue length and class of the connection. In this stage, the allocation will continue until the bandwidth of the frame is exhausted or all packets in the queue have been scheduled. The simulation will be done and compared with the round robin algorithm for both methods. The results show these algorithms can adapt to the load of the connection.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128794074","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747510
Nasser Zalmout, M. Ghanem
We present and apply a generic methodology for multidimensional community detection from Twitter data. The approach builds on constructing multiple network structures based on the similarity and interaction patterns that exist between different users. It then applies traditional network centric community detection techniques to identify clusters of users. The paper also approaches the issues of dynamicity and evolution in Social Media by developing a Bayesian classifier that maps new users to the detected communities. Using a data set of UK political Tweets, we evaluate the factors affecting the quality of the detected communities. We also investigate how the accuracy of the classifier is affected by the dynamicity of the network evolution and the time elapsed between community detection and classifier application.
{"title":"Multidimensional community detection in Twitter","authors":"Nasser Zalmout, M. Ghanem","doi":"10.1109/ICIST.2013.6747510","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747510","url":null,"abstract":"We present and apply a generic methodology for multidimensional community detection from Twitter data. The approach builds on constructing multiple network structures based on the similarity and interaction patterns that exist between different users. It then applies traditional network centric community detection techniques to identify clusters of users. The paper also approaches the issues of dynamicity and evolution in Social Media by developing a Bayesian classifier that maps new users to the detected communities. Using a data set of UK political Tweets, we evaluate the factors affecting the quality of the detected communities. We also investigate how the accuracy of the classifier is affected by the dynamicity of the network evolution and the time elapsed between community detection and classifier application.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129874388","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
扫码关注我们
求助内容：
应助结果提醒方式：