Based on the degree of participation and contribution, the current study classified online community users into four categories, which are active login, active participant, indirect contributor and direct contributor. In order to help enterprises understand how users of different categories behave and how to guide users to the category which is beneficial to the enterprise's marketing efforts, the study adopted the relatively static variable of consumer's role to represent the dynamic consumer behaviors and empirically tested the path of user's role formation in an enterprise's official community with the applications of SEM.
{"title":"The Formation of Consumer's Role in Virtual Communities","authors":"Zhiying Zheng, Lei Shen","doi":"10.1109/ISCID.2013.161","DOIUrl":"https://doi.org/10.1109/ISCID.2013.161","url":null,"abstract":"Based on the degree of participation and contribution, the current study classified online community users into four categories, which are active login, active participant, indirect contributor and direct contributor. In order to help enterprises understand how users of different categories behave and how to guide users to the category which is beneficial to the enterprise's marketing efforts, the study adopted the relatively static variable of consumer's role to represent the dynamic consumer behaviors and empirically tested the path of user's role formation in an enterprise's official community with the applications of SEM.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126613073","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}
In this paper, the modified prominent point processing (MPPP) approach for the phase compensation in inverse synthetic aperture radar (ISAR) imaging is proposed. It applies the minimum entropy method (MEM) to find the prominent point cell used for the phase calibration. After minusing the measured phase value of prominent point range cell from all the range bins belonged to the same echo, a well-focused ISAR image can be obtained by combining all the range bins. Compared to the PPP algorithm, the MPPP method can find the better prominent point unit utilized for the phase correction, which will lead to a more focused ISAR image after the phase compensation. The simulation result proves that the proposed approach can enhance the clarity and focusing of the ISAR image.
{"title":"Modified Prominent Point Processing in ISAR Imaging Based on Minimum Entropy Method","authors":"Guanglong Wang, Daiying Zhou, Yuxing Bo","doi":"10.1109/ISCID.2013.71","DOIUrl":"https://doi.org/10.1109/ISCID.2013.71","url":null,"abstract":"In this paper, the modified prominent point processing (MPPP) approach for the phase compensation in inverse synthetic aperture radar (ISAR) imaging is proposed. It applies the minimum entropy method (MEM) to find the prominent point cell used for the phase calibration. After minusing the measured phase value of prominent point range cell from all the range bins belonged to the same echo, a well-focused ISAR image can be obtained by combining all the range bins. Compared to the PPP algorithm, the MPPP method can find the better prominent point unit utilized for the phase correction, which will lead to a more focused ISAR image after the phase compensation. The simulation result proves that the proposed approach can enhance the clarity and focusing of the ISAR image.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128746579","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}
Detecting the boundary of television screen is the basis of content identification for human-computer interaction. Uncertainty exists in TV video image which is captured by mobile phone because of the resolution, color, brightness, background. The reduction of image quality leads to inaccurate identification. We propose a method based on the feature of TV's shape to segment the TV screen indirectly. Our approach aims at extracting the typical feature between the background and objective image. The experimental results demonstrate the effectiveness of the proposed approach for TV screen shape.
{"title":"A Method of TV Screen Shape Detection Based on Threshold Segmentation","authors":"Huimin Jiao, Haiming Lu","doi":"10.1109/ISCID.2013.143","DOIUrl":"https://doi.org/10.1109/ISCID.2013.143","url":null,"abstract":"Detecting the boundary of television screen is the basis of content identification for human-computer interaction. Uncertainty exists in TV video image which is captured by mobile phone because of the resolution, color, brightness, background. The reduction of image quality leads to inaccurate identification. We propose a method based on the feature of TV's shape to segment the TV screen indirectly. Our approach aims at extracting the typical feature between the background and objective image. The experimental results demonstrate the effectiveness of the proposed approach for TV screen shape.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"297 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127366383","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}
A new adaptive demodulation(ADM) scheme based on rate less code and Maximum a Posteriori Probability compute the log-likelihood ratio(LLR) of each bit in the modulated symbol, if the LLR of this bit is larger than the pre-set threshold, demodulate this bit, else delete it. Because the channel state information(CSI) is known by the receiver, this scheme select the bit to demodulate based on the CSI, so it improve the channel usage. The demodulate threshold in this algorithm determines the demodulation order, hence it has great influence on system performance. This paper analyses the demodulation threshold in this adaptive demodulation algorithm, and find out the optimal threshold by simulation, in order to achieve the optimal performance.
{"title":"Analysis of the Threshold in Adaptive Demodulation","authors":"Xujin Guo, Weijia Lei, Xianzhong Xie","doi":"10.1109/ISCID.2013.159","DOIUrl":"https://doi.org/10.1109/ISCID.2013.159","url":null,"abstract":"A new adaptive demodulation(ADM) scheme based on rate less code and Maximum a Posteriori Probability compute the log-likelihood ratio(LLR) of each bit in the modulated symbol, if the LLR of this bit is larger than the pre-set threshold, demodulate this bit, else delete it. Because the channel state information(CSI) is known by the receiver, this scheme select the bit to demodulate based on the CSI, so it improve the channel usage. The demodulate threshold in this algorithm determines the demodulation order, hence it has great influence on system performance. This paper analyses the demodulation threshold in this adaptive demodulation algorithm, and find out the optimal threshold by simulation, in order to achieve the optimal performance.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129189933","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}
QoS multicast routing problem is a nonlinear combination optimization problem, which is difficult to get the global solution by using the traditional algorithm. In this paper, we use the Firefly Algorithm (FA) to solve the multi-constrained QoS multicast routing problem and QoS-FA algorithm is presented. FA is a novel heuristic stochastic algorithm and has been applied to many optimization fields. The simulation results show that the QoS-FA algorithm can search the optical multicast tree and has better performance.
{"title":"QoS Multicast Routing Based on Firefly Algorithm","authors":"Jie Yuan, Yafei Tian, Shan Wang, Changnian Liu","doi":"10.1109/ISCID.2013.47","DOIUrl":"https://doi.org/10.1109/ISCID.2013.47","url":null,"abstract":"QoS multicast routing problem is a nonlinear combination optimization problem, which is difficult to get the global solution by using the traditional algorithm. In this paper, we use the Firefly Algorithm (FA) to solve the multi-constrained QoS multicast routing problem and QoS-FA algorithm is presented. FA is a novel heuristic stochastic algorithm and has been applied to many optimization fields. The simulation results show that the QoS-FA algorithm can search the optical multicast tree and has better performance.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132630661","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}
Extreme learning machine (ELM) is a new type of feed forward neural network. Compared with traditional single hidden layer feed forward neural networks, ELM executes with higher training speed and produces smaller error. Due to random input weights and hidden biases, ELM might need numerous hidden neurons to achieve a reasonable accuracy. A new ELM learning algorithm, which was optimized by the Firefly Algorithm (FA), was proposed in this paper. FA was used to select the input weights and biases of hidden layer, and then the output weights could be calculated. To test the validity of proposed method, a simulation experiments about the approximation curves of the SINC function was done. The results showed that the proposed algorithm achieved better performance with less hidden neurons than other similar methods.
{"title":"A New Extreme Learning Machine Optimized by Firefly Algorithm","authors":"Qiang Zhang, Hongxin Li, Changnian Liu, Wei Hu","doi":"10.1109/ISCID.2013.147","DOIUrl":"https://doi.org/10.1109/ISCID.2013.147","url":null,"abstract":"Extreme learning machine (ELM) is a new type of feed forward neural network. Compared with traditional single hidden layer feed forward neural networks, ELM executes with higher training speed and produces smaller error. Due to random input weights and hidden biases, ELM might need numerous hidden neurons to achieve a reasonable accuracy. A new ELM learning algorithm, which was optimized by the Firefly Algorithm (FA), was proposed in this paper. FA was used to select the input weights and biases of hidden layer, and then the output weights could be calculated. To test the validity of proposed method, a simulation experiments about the approximation curves of the SINC function was done. The results showed that the proposed algorithm achieved better performance with less hidden neurons than other similar methods.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132837742","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}
Pattern matching is a fundamental application text retrieval, string query, biological sequence analysis, etc. Therefore, the effective algorithm performing this kind of matching is in great need. In this paper, the wildcard is defines to match any one character in a sequence. Multiple wildcards form a gap. The length of a flexible gap is arbitrary. We design CLPM algorithm by use of cross list index structure to realize pattern matching with flexible wildcard gaps. The preprocessing algorithm is designed to initialize cross list so as to reduce searching space. In CLPM algorithm, the effective intervals is defined and computed based on the start positions of each sub pattern in each string, which help to obtain matching result set. Moreover, the approximate pattern matching is converted to short extract pattern matching. The contrast experiments are done based on DBLP tile data set. The results show that CLMP algorithm has better performance in the same fields.
{"title":"Pattern Matching with Wildcard Gaps Based on Cross List","authors":"Jun-yan Zhang, Chenhui Yang","doi":"10.1109/ISCID.2013.152","DOIUrl":"https://doi.org/10.1109/ISCID.2013.152","url":null,"abstract":"Pattern matching is a fundamental application text retrieval, string query, biological sequence analysis, etc. Therefore, the effective algorithm performing this kind of matching is in great need. In this paper, the wildcard is defines to match any one character in a sequence. Multiple wildcards form a gap. The length of a flexible gap is arbitrary. We design CLPM algorithm by use of cross list index structure to realize pattern matching with flexible wildcard gaps. The preprocessing algorithm is designed to initialize cross list so as to reduce searching space. In CLPM algorithm, the effective intervals is defined and computed based on the start positions of each sub pattern in each string, which help to obtain matching result set. Moreover, the approximate pattern matching is converted to short extract pattern matching. The contrast experiments are done based on DBLP tile data set. The results show that CLMP algorithm has better performance in the same fields.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133626754","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}
In this paper, we present a novel system which allows its users to see a stereoscopic virtual object. Unlike most existing stereoscopic systems that display the same imagery when watched from different directions, the user's head is tracked in real-time so that the real-time images can be rendered according to the viewing position, which enables the dynamic images to be displayed on the screen and the users can see different parts of a virtual object when wearing a pair of polarized glasses. This creates a more vivid illusion that a real object is set at the physical scene. The key technologies of the proposed system such as depth-image-based head tracking, geometric calibration and view-dependent real-time stereoscopic image rendering are studied and the experimental results proves the performance of the proposed system.
{"title":"A View-Dependent Stereoscopic System Using Tiled Projection","authors":"Feng Chen, Yue Liu","doi":"10.1109/ISCID.2013.190","DOIUrl":"https://doi.org/10.1109/ISCID.2013.190","url":null,"abstract":"In this paper, we present a novel system which allows its users to see a stereoscopic virtual object. Unlike most existing stereoscopic systems that display the same imagery when watched from different directions, the user's head is tracked in real-time so that the real-time images can be rendered according to the viewing position, which enables the dynamic images to be displayed on the screen and the users can see different parts of a virtual object when wearing a pair of polarized glasses. This creates a more vivid illusion that a real object is set at the physical scene. The key technologies of the proposed system such as depth-image-based head tracking, geometric calibration and view-dependent real-time stereoscopic image rendering are studied and the experimental results proves the performance of the proposed system.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127226441","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}
In order to solve the camera calibration in intelligent space of mobile robot, a new calibration method based on neural network with tunable activation function (TAF) is presented. In the TAF model, the inner product mode is adopted in the calculation of output signal in synapse model and the S function is adopted in base function. Taking the coordinate in image coordinate system as the network input, and the coordinate in world coordinate system as the network output, the weight matrix, threshold matrix and activation function parameter are achieved firstly through the network training based on sample data, then the calibration test are carried out using the TAF network which is trained. The experiment results show that, compared with the test results of BP network, the proposed calibration method is characterized by high detection precision and quick detection speed, which verifies the validity of TAF network in camera calibration.
{"title":"A New Camera Calibration Based on Neural Network with Tunable Activation Function in Intelligent Space","authors":"Mingxin Yuan, Haixiu Hu, Yafeng Jiang, Sheng Hang","doi":"10.1109/ISCID.2013.99","DOIUrl":"https://doi.org/10.1109/ISCID.2013.99","url":null,"abstract":"In order to solve the camera calibration in intelligent space of mobile robot, a new calibration method based on neural network with tunable activation function (TAF) is presented. In the TAF model, the inner product mode is adopted in the calculation of output signal in synapse model and the S function is adopted in base function. Taking the coordinate in image coordinate system as the network input, and the coordinate in world coordinate system as the network output, the weight matrix, threshold matrix and activation function parameter are achieved firstly through the network training based on sample data, then the calibration test are carried out using the TAF network which is trained. The experiment results show that, compared with the test results of BP network, the proposed calibration method is characterized by high detection precision and quick detection speed, which verifies the validity of TAF network in camera calibration.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130390581","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}
Zheng Shou, Binqiang Yu, Gang Chen, Hengjin Cai, Qiaochu Liu
Online 3D Virtual Garment Try-on System is deeply needed and would be quite popular if we could improve its accuracy, effect, and user experience. In order to achieve these goals, we propose several key designs in implementing it. In this paper, we discuss the system architecture design at first. Then we introduce a simple but effective method to model 3D body prototypes. Based on models in Poser software, we segment them into layers and then do triangularizition to get triangular surfaces. As for garment modeling based on Spring-Mass model and physical try-on simulation, we propose a novel method based on uniform grid to detect collision. Store references of triangular surfaces into grids that they occupied and then calculate which grids a moving line of mass go through. Get triangular surfaces in these grids out and then judge whether the moving line intersects with them. It achieved fast detection in around 0.1% of time consuming by using linear searching. The performances of body modeling and try-on simulation are satisfying, and real-time responses could be achieved because of less complex computation and light-scale data transformation.
{"title":"Key Designs in Implementing Online 3D Virtual Garment Try-On System","authors":"Zheng Shou, Binqiang Yu, Gang Chen, Hengjin Cai, Qiaochu Liu","doi":"10.1109/ISCID.2013.46","DOIUrl":"https://doi.org/10.1109/ISCID.2013.46","url":null,"abstract":"Online 3D Virtual Garment Try-on System is deeply needed and would be quite popular if we could improve its accuracy, effect, and user experience. In order to achieve these goals, we propose several key designs in implementing it. In this paper, we discuss the system architecture design at first. Then we introduce a simple but effective method to model 3D body prototypes. Based on models in Poser software, we segment them into layers and then do triangularizition to get triangular surfaces. As for garment modeling based on Spring-Mass model and physical try-on simulation, we propose a novel method based on uniform grid to detect collision. Store references of triangular surfaces into grids that they occupied and then calculate which grids a moving line of mass go through. Get triangular surfaces in these grids out and then judge whether the moving line intersects with them. It achieved fast detection in around 0.1% of time consuming by using linear searching. The performances of body modeling and try-on simulation are satisfying, and real-time responses could be achieved because of less complex computation and light-scale data transformation.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131093385","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
扫码关注我们
求助内容：
应助结果提醒方式：