Pub Date : 2012-12-13DOI: 10.1109/GCCE.2012.6379965
Soojun Im, Dongkun Shin
Recently, graphic processing unit (GPU) becomes a mandatory component in mobile consumer devices such mobile phones. The vertex and fragment shader programs in embedded GPU are programmed with embedded system shading language(ESSL). The shader compiler for ESSL should be designed considering several distinct features of ESSL and GPU. In this paper, we present ESSL compiler techniques for embedded GPU. The compiler can optimize the code and data memory size as well as improve the performance of shader code by fully exploiting the special architecture of target GPU. Experiments show that the proposed optimization techniques can reduce the code size by up to 10.3% and the execution cycles by up to 16.8%.
{"title":"OpenGL ESSL optimizing compiler for embedded 3D graphic processor","authors":"Soojun Im, Dongkun Shin","doi":"10.1109/GCCE.2012.6379965","DOIUrl":"https://doi.org/10.1109/GCCE.2012.6379965","url":null,"abstract":"Recently, graphic processing unit (GPU) becomes a mandatory component in mobile consumer devices such mobile phones. The vertex and fragment shader programs in embedded GPU are programmed with embedded system shading language(ESSL). The shader compiler for ESSL should be designed considering several distinct features of ESSL and GPU. In this paper, we present ESSL compiler techniques for embedded GPU. The compiler can optimize the code and data memory size as well as improve the performance of shader code by fully exploiting the special architecture of target GPU. Experiments show that the proposed optimization techniques can reduce the code size by up to 10.3% and the execution cycles by up to 16.8%.","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122512215","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 : 2012-12-13DOI: 10.1109/GCCE.2012.6379665
K. Haruki, Ryuji Sakai, M. Shimbayashi, Y. Tanaka, T. Suzuki
This paper describes the General-Purpose computing on Graphics Processing Unit (GPGPU) optimized implementation of 2D-3D Conversion. 2D-3D Conversion is large-scale image processing and consists of 170 kernels. Those kernels, which are tasks performed by GPU, contain various algorithms. 30fps real-time processing of 2D-3D Conversion conventionally requires special hardware since it is computationally expensive. To clarify the feasibility of real-time processing by software, we did full GPGPU implementation of all image processing of 2D-3D Conversion on a laptop PC.
{"title":"Full GPGPU implementation of 2D-3D conversion on laptop GPU","authors":"K. Haruki, Ryuji Sakai, M. Shimbayashi, Y. Tanaka, T. Suzuki","doi":"10.1109/GCCE.2012.6379665","DOIUrl":"https://doi.org/10.1109/GCCE.2012.6379665","url":null,"abstract":"This paper describes the General-Purpose computing on Graphics Processing Unit (GPGPU) optimized implementation of 2D-3D Conversion. 2D-3D Conversion is large-scale image processing and consists of 170 kernels. Those kernels, which are tasks performed by GPU, contain various algorithms. 30fps real-time processing of 2D-3D Conversion conventionally requires special hardware since it is computationally expensive. To clarify the feasibility of real-time processing by software, we did full GPGPU implementation of all image processing of 2D-3D Conversion on a laptop PC.","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122924260","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 : 2012-12-13DOI: 10.1109/GCCE.2012.6379596
T. Matsuda, E. Horiuchi, T. Yokotani
Eligibility Based Round Robin (EBRR) scheduler proposed by Lenzini et al. is a packet scheduling algorithm which can be considered as an extension of Surplus Round Robin (SRR), computational complexity of which is O(1) even when quantum size is less than the maximum packet size. In this paper, we propose an extension of EBRR which makes it possible to transmit packets smaller than a threshold prior to packets larger than the threshold among packets received in one scheduling round. It can be used in Home Gateway. The computational complexity of the proposed algorithm is O(1).
Lenzini等人提出的基于资格的轮询调度(Eligibility Based Round Robin, EBRR)是一种数据包调度算法，可以看作是盈余轮询调度(Surplus Round Robin, SRR)的扩展，即使量子大小小于最大数据包大小，其计算复杂度也为0(1)。在本文中，我们提出了EBRR的一种扩展，使得在一个调度轮中接收的数据包可以在大于阈值的数据包之前发送小于阈值的数据包。可用于家庭网关。该算法的计算复杂度为0(1)。
{"title":"A proposal of a new packet scheduling algorithm which can reduce the delay of small packets","authors":"T. Matsuda, E. Horiuchi, T. Yokotani","doi":"10.1109/GCCE.2012.6379596","DOIUrl":"https://doi.org/10.1109/GCCE.2012.6379596","url":null,"abstract":"Eligibility Based Round Robin (EBRR) scheduler proposed by Lenzini et al. is a packet scheduling algorithm which can be considered as an extension of Surplus Round Robin (SRR), computational complexity of which is O(1) even when quantum size is less than the maximum packet size. In this paper, we propose an extension of EBRR which makes it possible to transmit packets smaller than a threshold prior to packets larger than the threshold among packets received in one scheduling round. It can be used in Home Gateway. The computational complexity of the proposed algorithm is O(1).","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127604618","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 : 2012-12-13DOI: 10.1109/GCCE.2012.6379621
R. Atarashi
Home network management is one of most important problem for consumer electronics because there is no operator in a home. This paper proposes Configurator that is alternative to expert network operator. Configurator manages IP information in the home network and configures the devices automatically.
{"title":"Home network with the Configurator","authors":"R. Atarashi","doi":"10.1109/GCCE.2012.6379621","DOIUrl":"https://doi.org/10.1109/GCCE.2012.6379621","url":null,"abstract":"Home network management is one of most important problem for consumer electronics because there is no operator in a home. This paper proposes Configurator that is alternative to expert network operator. Configurator manages IP information in the home network and configures the devices automatically.","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"26 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132692513","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 : 2012-12-13DOI: 10.1109/GCCE.2012.6379649
Thi Thi Zin, P. Tin, T. Toriu, H. Hama
In the consumer world, the ever growing image repositories in online shopping, consumer products images, consumer photos and video collections have resulted great demand of a system which can accurately retrieve similar images from image database. For this purpose, we propose a new concept of vision key for retrieving consumer product images. In our system, rather than considering an image as a whole, we consider it as a set of regions or sub-images with completely different semantic meanings. By using the properties of equivalence classes in the Markov chain, we first perform image segmentation and initial pixel grouping process. We then establish vision keys by using a Markov stationary feature. Finally, in the retrieval phase, users can interactively search candidate images which contain vision keys. In order to confirm the efficiency of our proposed method, we present the experimental results achieving on higher accuracy rates.
{"title":"Conceptual vision keys for consumer product images","authors":"Thi Thi Zin, P. Tin, T. Toriu, H. Hama","doi":"10.1109/GCCE.2012.6379649","DOIUrl":"https://doi.org/10.1109/GCCE.2012.6379649","url":null,"abstract":"In the consumer world, the ever growing image repositories in online shopping, consumer products images, consumer photos and video collections have resulted great demand of a system which can accurately retrieve similar images from image database. For this purpose, we propose a new concept of vision key for retrieving consumer product images. In our system, rather than considering an image as a whole, we consider it as a set of regions or sub-images with completely different semantic meanings. By using the properties of equivalence classes in the Markov chain, we first perform image segmentation and initial pixel grouping process. We then establish vision keys by using a Markov stationary feature. Finally, in the retrieval phase, users can interactively search candidate images which contain vision keys. In order to confirm the efficiency of our proposed method, we present the experimental results achieving on higher accuracy rates.","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134230696","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 : 2012-12-13DOI: 10.1109/GCCE.2012.6379661
H. Sawada, H. Tomohiro
This paper proposes a remote controller that can automatically display a GUI in which the buttons of household electric appliances being operated are efficiently laid out and that can also display the current status information. A prototype was prepared in order to evaluate the effectiveness of the proposed method.
{"title":"Remote controller routing information of ad-hoc wireless communication","authors":"H. Sawada, H. Tomohiro","doi":"10.1109/GCCE.2012.6379661","DOIUrl":"https://doi.org/10.1109/GCCE.2012.6379661","url":null,"abstract":"This paper proposes a remote controller that can automatically display a GUI in which the buttons of household electric appliances being operated are efficiently laid out and that can also display the current status information. A prototype was prepared in order to evaluate the effectiveness of the proposed method.","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134544757","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 : 2012-12-13DOI: 10.1109/GCCE.2012.6379658
S. Furuta, K. Kawashima, T. Otsuka, T. Yamaura, R. Otsuka
We hope that every people can enjoy the convenient functions of digital broadcasting such as an Electronic Program Guide (EPG). In 2007, Mitsubishi Electric launched the mass-produced LCD television equipped with the EPG voice read-out system to Japanese domestic market. This paper describes the development of the voice read out function of a digital television receiver, background of development, the introduced speech synthesis system and the improvement degrees of every model based on end-user's opinions are summarized respectively.
{"title":"The development of the voice read-out system for digital television receiver","authors":"S. Furuta, K. Kawashima, T. Otsuka, T. Yamaura, R. Otsuka","doi":"10.1109/GCCE.2012.6379658","DOIUrl":"https://doi.org/10.1109/GCCE.2012.6379658","url":null,"abstract":"We hope that every people can enjoy the convenient functions of digital broadcasting such as an Electronic Program Guide (EPG). In 2007, Mitsubishi Electric launched the mass-produced LCD television equipped with the EPG voice read-out system to Japanese domestic market. This paper describes the development of the voice read out function of a digital television receiver, background of development, the introduced speech synthesis system and the improvement degrees of every model based on end-user's opinions are summarized respectively.","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124384011","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 : 2012-12-13DOI: 10.1109/GCCE.2012.6379912
Y-h. Taguchi, T. Ida
An image interpolation method is proposed. An input image can be considered to be a deteriorated one from an unknown original image with more pixels than it. The image interpolation can be treated as an underdetermined problem to reconstruct the original image from the input image. In the proposed method, an output image by an arbitrary method is moved closer to the original image by a projection satisfying a reconstruction constraint that the output image should coincide with the input image by an assumed deterioration. Experimental results showed the effectiveness of the proposed method.
{"title":"An image interpolation method by projection satisfying reconstruction constraint","authors":"Y-h. Taguchi, T. Ida","doi":"10.1109/GCCE.2012.6379912","DOIUrl":"https://doi.org/10.1109/GCCE.2012.6379912","url":null,"abstract":"An image interpolation method is proposed. An input image can be considered to be a deteriorated one from an unknown original image with more pixels than it. The image interpolation can be treated as an underdetermined problem to reconstruct the original image from the input image. In the proposed method, an output image by an arbitrary method is moved closer to the original image by a projection satisfying a reconstruction constraint that the output image should coincide with the input image by an assumed deterioration. Experimental results showed the effectiveness of the proposed method.","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122165556","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 : 2012-12-13DOI: 10.1109/GCCE.2012.6379902
M. Yamazaki, S. Kawano, A. Mizutani
“Hybrid PC” system has been researched for years as a new technology for client PC, to enable various new user values. Low power and long battery operation is one of the major values. A project using hybrid PC technology to enable a feature to double the battery hour for non-business casual usage on a laptop PC has successfully achieved the target with a product released worldwide. This paper describes the system architecture, design, and evaluation of user values of the system, as one of the application cases of hybrid PC technology.
{"title":"Hybrid PC technology for low power, long battery operation with casual usage on client PC systems","authors":"M. Yamazaki, S. Kawano, A. Mizutani","doi":"10.1109/GCCE.2012.6379902","DOIUrl":"https://doi.org/10.1109/GCCE.2012.6379902","url":null,"abstract":"“Hybrid PC” system has been researched for years as a new technology for client PC, to enable various new user values. Low power and long battery operation is one of the major values. A project using hybrid PC technology to enable a feature to double the battery hour for non-business casual usage on a laptop PC has successfully achieved the target with a product released worldwide. This paper describes the system architecture, design, and evaluation of user values of the system, as one of the application cases of hybrid PC technology.","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122166284","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 : 2012-12-13DOI: 10.1109/GCCE.2012.6379935
T. Yamamoto, N. Mishima, T. Ono, T. Kaneko
3-D recursive search block matching is a conventional motion estimation method based on block matching. The algorithm is more efficient and effective than a full-search algorithm. However, the algorithm tends to fail to detect the true motion when the spatiotemporal smoothness of motion is not held. In this paper, we propose a new motion estimation algorithm introducing hierarchical search strategy.
{"title":"High-accuracy motion estimation with 4-D recursive search block matching","authors":"T. Yamamoto, N. Mishima, T. Ono, T. Kaneko","doi":"10.1109/GCCE.2012.6379935","DOIUrl":"https://doi.org/10.1109/GCCE.2012.6379935","url":null,"abstract":"3-D recursive search block matching is a conventional motion estimation method based on block matching. The algorithm is more efficient and effective than a full-search algorithm. However, the algorithm tends to fail to detect the true motion when the spatiotemporal smoothness of motion is not held. In this paper, we propose a new motion estimation algorithm introducing hierarchical search strategy.","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123162445","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
扫码关注我们
求助内容：
应助结果提醒方式：