Pub Date : 2015-06-06DOI: 10.1109/ICCE-TW.2015.7216979
Chao-Hsien Lee, Yu-Lin Zheng
The explosive growth of huge data lets cloud computing be more and more popular in recent years. Traditional web-based content management systems (CMS), e.g., phpBB, WordPress, and Joomla, store data using relational databases whose key advantage is the strong relationships among tables. However, regarding the flexibility and the feasibility of parallel processing, cloud computing adopts NoSQL databases that can support horizontal scaling to handle big data. Therefore, how to transform the existing SQL data into the NoSQL database becomes an emerging and necessary issue. This paper is motivated to propose an automatic SQL-to-NoSQL schema transformation mechanism over the MySQL and HBase databases. Based on our experimental results, the proposed mechanism is able to improve about 47% access performance.
{"title":"Automatic SQL-to-NoSQL schema transformation over the MySQL and HBase databases","authors":"Chao-Hsien Lee, Yu-Lin Zheng","doi":"10.1109/ICCE-TW.2015.7216979","DOIUrl":"https://doi.org/10.1109/ICCE-TW.2015.7216979","url":null,"abstract":"The explosive growth of huge data lets cloud computing be more and more popular in recent years. Traditional web-based content management systems (CMS), e.g., phpBB, WordPress, and Joomla, store data using relational databases whose key advantage is the strong relationships among tables. However, regarding the flexibility and the feasibility of parallel processing, cloud computing adopts NoSQL databases that can support horizontal scaling to handle big data. Therefore, how to transform the existing SQL data into the NoSQL database becomes an emerging and necessary issue. This paper is motivated to propose an automatic SQL-to-NoSQL schema transformation mechanism over the MySQL and HBase databases. Based on our experimental results, the proposed mechanism is able to improve about 47% access performance.","PeriodicalId":340402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics - Taiwan","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116178467","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 : 2015-06-06DOI: 10.1109/ICCE-TW.2015.7216887
Sheau-Ru Tong, Shau-Ting Du, Li-Wen Chen, Sally Chen, E. Yeh
Video broadcast is an important feature for over-the-top content providers (OTT-CPs) to disseminate video programs to a large number of Internet mobile users. This paper focuses on a self-sustained content delivery network (CDN) solution, where OTT-CP servers and mobile users collaboratively join together to form a mobile peer-to-peer streaming (MPPS) CDN to assist video broadcasting. Several unique features are introduced to address the vulnerable connectivity issues in a mobile networking environment. The simulation result show that MPPS can agilely adapt to versatile mobile networks to offer stable video broadcast service to a large number of mobile users. The system is under prototyping in a test bed operated by ELTA TV.
{"title":"A peer-to-peer streaming CDN for supporting OTT video broadcast service in mobile networks","authors":"Sheau-Ru Tong, Shau-Ting Du, Li-Wen Chen, Sally Chen, E. Yeh","doi":"10.1109/ICCE-TW.2015.7216887","DOIUrl":"https://doi.org/10.1109/ICCE-TW.2015.7216887","url":null,"abstract":"Video broadcast is an important feature for over-the-top content providers (OTT-CPs) to disseminate video programs to a large number of Internet mobile users. This paper focuses on a self-sustained content delivery network (CDN) solution, where OTT-CP servers and mobile users collaboratively join together to form a mobile peer-to-peer streaming (MPPS) CDN to assist video broadcasting. Several unique features are introduced to address the vulnerable connectivity issues in a mobile networking environment. The simulation result show that MPPS can agilely adapt to versatile mobile networks to offer stable video broadcast service to a large number of mobile users. The system is under prototyping in a test bed operated by ELTA TV.","PeriodicalId":340402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics - Taiwan","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126565816","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 : 2015-06-06DOI: 10.1109/ICCE-TW.2015.7216900
Shuhei Toba, H. Kudo, Tomo Miyazaki, Yoshihiro Sugaya, S. Omachi
Improvement of character recognition technology brings us various character recognition applications for mobile camera. However, many low-resolution and poor-quality character images exist due to the performance of the camera or the influence of environment, and existing methods are not good at recognizing those low-resolution characters. Therefore, we develop a character recognition system for ultra-low resolution character images less than 20*20 pixels. The proposed system consists of three phases: increased training data with a generative learning method, creating a deblurred high-resolution image with Wiener filter and image alignment, and recognition by pruning Mutual Subspace Method.
{"title":"Ultra-low resolution character recognition system with pruning mutual subspace method","authors":"Shuhei Toba, H. Kudo, Tomo Miyazaki, Yoshihiro Sugaya, S. Omachi","doi":"10.1109/ICCE-TW.2015.7216900","DOIUrl":"https://doi.org/10.1109/ICCE-TW.2015.7216900","url":null,"abstract":"Improvement of character recognition technology brings us various character recognition applications for mobile camera. However, many low-resolution and poor-quality character images exist due to the performance of the camera or the influence of environment, and existing methods are not good at recognizing those low-resolution characters. Therefore, we develop a character recognition system for ultra-low resolution character images less than 20*20 pixels. The proposed system consists of three phases: increased training data with a generative learning method, creating a deblurred high-resolution image with Wiener filter and image alignment, and recognition by pruning Mutual Subspace Method.","PeriodicalId":340402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics - Taiwan","volume":"62 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128015454","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 : 2015-06-06DOI: 10.1109/ICCE-TW.2015.7216919
Su-Ling Lee, C. Tseng
In this paper, the design of matrix second-order differentiator (SOD) using discrete sine transform (DST) is presented. First, the design problem of matrix filter is described. Then, the DST is applied to obtain the closed-form transfer matrix of the matrix SOD. Next, the designed matrix SOD is used to develop an image sharpening algorithm by using Laplacian operator. Finally, the performance of the proposed matrix SOD is evaluated through numerical examples.
{"title":"Design of matrix second-order differentiator for image sharpening using discrete sine transform","authors":"Su-Ling Lee, C. Tseng","doi":"10.1109/ICCE-TW.2015.7216919","DOIUrl":"https://doi.org/10.1109/ICCE-TW.2015.7216919","url":null,"abstract":"In this paper, the design of matrix second-order differentiator (SOD) using discrete sine transform (DST) is presented. First, the design problem of matrix filter is described. Then, the DST is applied to obtain the closed-form transfer matrix of the matrix SOD. Next, the designed matrix SOD is used to develop an image sharpening algorithm by using Laplacian operator. Finally, the performance of the proposed matrix SOD is evaluated through numerical examples.","PeriodicalId":340402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics - Taiwan","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125438075","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 : 2015-06-06DOI: 10.1109/ICCE-TW.2015.7216895
Ching-Lung Su, Ya-Han Chang, Kai-Ping Chen, Jia-Hua Wu
Traffic accidents make car safety receive most attention in recent years. With the progress of image processing technology, the automotive safety equipment sets cameras on cars and conducts image processing with the images captured by the cameras, which provides drivers more traffic information. In the image-based active driving safety equipment, the pedestrian detection technology is important. Most previous works that used cameras to capture traffic images applied classifiers to train the pedestrian features and conduct multi-stage feature matching. In our proposed method, we apply the single-lens camera to capture images, and we use formulae as well as image processing to extract the pedestrian features of each body part, such as edge line detection and color grouping. As a result, we exclude the objects that are not pedestrians on the road and find the correct pedestrians. Regarding the performance, the proposed method saves the computation time for manual template selection and pedestrian feature training of classifiers, which meets the requirements of real-time processing. The proposed method also provides the benefits to change cameras without conducting the above procedure repeatedly and only adjusts according to the pedestrian size. The result shows that the average computation time of pedestrian detection speed of the proposed method achieves 82.43 fps on Intel Core i7 processor at 3.4 GHz, the detection rate is better than 88%, and the false positive rate is no more than 10%.
{"title":"Pedestrian recognition using feature extraction","authors":"Ching-Lung Su, Ya-Han Chang, Kai-Ping Chen, Jia-Hua Wu","doi":"10.1109/ICCE-TW.2015.7216895","DOIUrl":"https://doi.org/10.1109/ICCE-TW.2015.7216895","url":null,"abstract":"Traffic accidents make car safety receive most attention in recent years. With the progress of image processing technology, the automotive safety equipment sets cameras on cars and conducts image processing with the images captured by the cameras, which provides drivers more traffic information. In the image-based active driving safety equipment, the pedestrian detection technology is important. Most previous works that used cameras to capture traffic images applied classifiers to train the pedestrian features and conduct multi-stage feature matching. In our proposed method, we apply the single-lens camera to capture images, and we use formulae as well as image processing to extract the pedestrian features of each body part, such as edge line detection and color grouping. As a result, we exclude the objects that are not pedestrians on the road and find the correct pedestrians. Regarding the performance, the proposed method saves the computation time for manual template selection and pedestrian feature training of classifiers, which meets the requirements of real-time processing. The proposed method also provides the benefits to change cameras without conducting the above procedure repeatedly and only adjusts according to the pedestrian size. The result shows that the average computation time of pedestrian detection speed of the proposed method achieves 82.43 fps on Intel Core i7 processor at 3.4 GHz, the detection rate is better than 88%, and the false positive rate is no more than 10%.","PeriodicalId":340402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics - Taiwan","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127931734","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 : 2015-06-06DOI: 10.1109/ICCE-TW.2015.7217022
Yang Li, Xu Zhu, Yufei Jiang, Yi Huang, E. Lim
We propose a received signal strength (RSS) based energy-efficient positioning approach for cellular networks with unknown path loss exponent (PLE). A low-complexity searching algorithm is proposed for PLE estimation and a low-complexity lateration algorithm is proposed to provide the searching criteria. Simulation results show that the proposed positioning method achieves an accuracy similar to that of the nonlinear least square (NLS) algorithm, while requiring a much lower complexity.
{"title":"Energy-efficient positioning for cellular networks with unknown path loss exponent","authors":"Yang Li, Xu Zhu, Yufei Jiang, Yi Huang, E. Lim","doi":"10.1109/ICCE-TW.2015.7217022","DOIUrl":"https://doi.org/10.1109/ICCE-TW.2015.7217022","url":null,"abstract":"We propose a received signal strength (RSS) based energy-efficient positioning approach for cellular networks with unknown path loss exponent (PLE). A low-complexity searching algorithm is proposed for PLE estimation and a low-complexity lateration algorithm is proposed to provide the searching criteria. Simulation results show that the proposed positioning method achieves an accuracy similar to that of the nonlinear least square (NLS) algorithm, while requiring a much lower complexity.","PeriodicalId":340402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics - Taiwan","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131381021","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 : 2015-06-06DOI: 10.1109/ICCE-TW.2015.7217006
Tomotaka Kimura, Tatsuro Jonouchi, T. Matsuda, T. Takine
Store-carry-forward routing is a promising solution for achieving end-to-end delivery of messages in intermittently connected mobile ad-hoc networks. To reduce the number of message copies without increasing the message delivery delay, a probabilistic store-carry-forward routing scheme based on node density has been proposed so far. In this routing scheme, the forwarding probability is determined depending on node density and it is set to be small in high node-density areas. Although this routing scheme can suppress the speed of disseminating message copies over high node-density areas, the number of forwarded message copies increases gradually as time goes by. This means that a large delivery delay of a message causes excessively many copies to be disseminated. To solve this problem, we propose a routing scheme with an adaptive forwarding probability control, where the forwarding probability is reduced every time its copy is forwarded to a node. With simulation experiments, we evaluate the performance of our scheme in terms of the mean delivery delay and the mean number of forwarded message copies.
{"title":"Density-aware store-carry-forward routing with adaptive forwarding probability control","authors":"Tomotaka Kimura, Tatsuro Jonouchi, T. Matsuda, T. Takine","doi":"10.1109/ICCE-TW.2015.7217006","DOIUrl":"https://doi.org/10.1109/ICCE-TW.2015.7217006","url":null,"abstract":"Store-carry-forward routing is a promising solution for achieving end-to-end delivery of messages in intermittently connected mobile ad-hoc networks. To reduce the number of message copies without increasing the message delivery delay, a probabilistic store-carry-forward routing scheme based on node density has been proposed so far. In this routing scheme, the forwarding probability is determined depending on node density and it is set to be small in high node-density areas. Although this routing scheme can suppress the speed of disseminating message copies over high node-density areas, the number of forwarded message copies increases gradually as time goes by. This means that a large delivery delay of a message causes excessively many copies to be disseminated. To solve this problem, we propose a routing scheme with an adaptive forwarding probability control, where the forwarding probability is reduced every time its copy is forwarded to a node. With simulation experiments, we evaluate the performance of our scheme in terms of the mean delivery delay and the mean number of forwarded message copies.","PeriodicalId":340402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics - Taiwan","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130724638","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 : 2015-06-06DOI: 10.1109/ICCE-TW.2015.7216813
Fuminori Yoshiyama, Shingo Uenohara, Keisuke Nishijima, Yusuke Hioka, K. Furuya
A multichannel extension of non-negative matrix factorization (NMF) associates the spatial property of the sources with each of the NMF bases. An initial-value selection method based on log-likelihood for multichannel non-negative matrix factorization (MNMF) is introduced to reduce the variation of the source separation performance. Experimental results showed selecting initial values that provide high log-likelihood would improve the source separation performance of MNMF depending on the sources.
{"title":"Log-likelihood method to select initial values of multichannel non-negative matrix factorization","authors":"Fuminori Yoshiyama, Shingo Uenohara, Keisuke Nishijima, Yusuke Hioka, K. Furuya","doi":"10.1109/ICCE-TW.2015.7216813","DOIUrl":"https://doi.org/10.1109/ICCE-TW.2015.7216813","url":null,"abstract":"A multichannel extension of non-negative matrix factorization (NMF) associates the spatial property of the sources with each of the NMF bases. An initial-value selection method based on log-likelihood for multichannel non-negative matrix factorization (MNMF) is introduced to reduce the variation of the source separation performance. Experimental results showed selecting initial values that provide high log-likelihood would improve the source separation performance of MNMF depending on the sources.","PeriodicalId":340402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics - Taiwan","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133412253","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 : 2015-06-06DOI: 10.1109/ICCE-TW.2015.7217033
Yunhua Gu, Xing Wang, S. Shen, S. Ji, Jin Wang
The replication mechanism of NoSQL database MongoDB includes Master/Slave structure and Replica Set. Write operation implement on Master, Slaves will send the synchronize data command asynchronously to Master to update its data. Read operation just implement on Master to provide the strong consistency, while read operation implement on Slave to provide the eventual consistency. Replica set is a group of servers which run Mongod and store the copy of the same data with automatic failover and automatic recovery of member nodes.
{"title":"Analysis of data replication mechanism in NoSQL database MongoDB","authors":"Yunhua Gu, Xing Wang, S. Shen, S. Ji, Jin Wang","doi":"10.1109/ICCE-TW.2015.7217033","DOIUrl":"https://doi.org/10.1109/ICCE-TW.2015.7217033","url":null,"abstract":"The replication mechanism of NoSQL database MongoDB includes Master/Slave structure and Replica Set. Write operation implement on Master, Slaves will send the synchronize data command asynchronously to Master to update its data. Read operation just implement on Master to provide the strong consistency, while read operation implement on Slave to provide the eventual consistency. Replica set is a group of servers which run Mongod and store the copy of the same data with automatic failover and automatic recovery of member nodes.","PeriodicalId":340402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics - Taiwan","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115738061","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 : 2015-06-06DOI: 10.1109/ICCE-TW.2015.7216973
H. Luo, Y. Wu
In this paper, the direction-of-arrival (DOA) distribution of the multipath in the wireless fading channel is analytically derived, assuming directional antennas at both transmitter and receiver. The derived DOA distribution is based on the spatial relationship between the transmitter, the receiver, and the scatterers. With scatterers uniformly distributed in the whole space, the DOA distribution is explicitly parameterized by the beamwidths of the transmitting and receiving antennas. The proposed DOA distribution is validated by fitting to the empirical data obtained in some certain measurements.
{"title":"A wireless channel model for the multipaths' DOA distribution, assuming directional antennas at transmitter and receiver","authors":"H. Luo, Y. Wu","doi":"10.1109/ICCE-TW.2015.7216973","DOIUrl":"https://doi.org/10.1109/ICCE-TW.2015.7216973","url":null,"abstract":"In this paper, the direction-of-arrival (DOA) distribution of the multipath in the wireless fading channel is analytically derived, assuming directional antennas at both transmitter and receiver. The derived DOA distribution is based on the spatial relationship between the transmitter, the receiver, and the scatterers. With scatterers uniformly distributed in the whole space, the DOA distribution is explicitly parameterized by the beamwidths of the transmitting and receiving antennas. The proposed DOA distribution is validated by fitting to the empirical data obtained in some certain measurements.","PeriodicalId":340402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics - Taiwan","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114315559","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
扫码关注我们
求助内容：
应助结果提醒方式：