Pub Date : 2010-10-01DOI: 10.1109/MMSP.2010.5662030
B. Jovanova, M. Preda
This paper presents a survey on current trends in several technologies related to avatars and introduces a new solution for interoperability of avatars in Virtual Worlds. A short examination of several standards, recommendations, markup languages and VWs presentation definitions addressing different aspects of avatars are provided. As a result of this analysis, a new standard, called MPEG-V, aiming to provide an interchange format for virtual worlds is presented. Providing the container of avatar properties/capabilities is the vision of MPEG-V. By its descriptive format it aims to facilitate the deployment of VW recognizing that their success depends on maintaining acceptable development cost and one mechanism in doing so consists in ensuring interoperability between them at least at the level of avatars.
{"title":"Avatars interoperability in Virtual Worlds","authors":"B. Jovanova, M. Preda","doi":"10.1109/MMSP.2010.5662030","DOIUrl":"https://doi.org/10.1109/MMSP.2010.5662030","url":null,"abstract":"This paper presents a survey on current trends in several technologies related to avatars and introduces a new solution for interoperability of avatars in Virtual Worlds. A short examination of several standards, recommendations, markup languages and VWs presentation definitions addressing different aspects of avatars are provided. As a result of this analysis, a new standard, called MPEG-V, aiming to provide an interchange format for virtual worlds is presented. Providing the container of avatar properties/capabilities is the vision of MPEG-V. By its descriptive format it aims to facilitate the deployment of VW recognizing that their success depends on maintaining acceptable development cost and one mechanism in doing so consists in ensuring interoperability between them at least at the level of avatars.","PeriodicalId":105774,"journal":{"name":"2010 IEEE International Workshop on Multimedia Signal Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124128779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-01DOI: 10.1109/MMSP.2010.5662039
Alberto Corrales-García, José Luis Martínez, G. Fernández-Escribano
Distributed Video Coding (DVC) provides a new coding paradigm based on lower complex encoders than decoders. On the decoder side some missed frames have to be estimated by means of available frames and a correlation noise model. In addition, parity bit chunks can be requested to the encoder across the feedback channel to correct the mismatches of these frames. This is an iterative procedure which collets most of the complexity of the decoder. In this work, a novel approach is proposed to parallelize the DVC decoding process in a multicore system. In this way, each bitplane is decoded at the same time by a different core and they exchange information to update the integration limits of the probably model, reaching a time reduction up to 80% with a little bitrate penalty but maintaining the same PSNR.
{"title":"Reducing DVC decoder complexity in a multicore system","authors":"Alberto Corrales-García, José Luis Martínez, G. Fernández-Escribano","doi":"10.1109/MMSP.2010.5662039","DOIUrl":"https://doi.org/10.1109/MMSP.2010.5662039","url":null,"abstract":"Distributed Video Coding (DVC) provides a new coding paradigm based on lower complex encoders than decoders. On the decoder side some missed frames have to be estimated by means of available frames and a correlation noise model. In addition, parity bit chunks can be requested to the encoder across the feedback channel to correct the mismatches of these frames. This is an iterative procedure which collets most of the complexity of the decoder. In this work, a novel approach is proposed to parallelize the DVC decoding process in a multicore system. In this way, each bitplane is decoded at the same time by a different core and they exchange information to update the integration limits of the probably model, reaching a time reduction up to 80% with a little bitrate penalty but maintaining the same PSNR.","PeriodicalId":105774,"journal":{"name":"2010 IEEE International Workshop on Multimedia Signal Processing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125802153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-01DOI: 10.1109/MMSP.2010.5662002
A. A. Moghadam, M. Aghagolzadeh, Mrityunjay Kumar, H. Radha
A typical consumer digital camera uses a Color Filter Array (CFA) to sense only one color component per image pixel. The original three-color image is reconstructed by interpolating the missing color components. This interpolation process (known as demosaicing) corresponds to solving an under-determined system of linear equations. In this paper, we show that by replacing the traditional CFA with a random panchromatic CFA, recent results in the emerging field of Compressed Sensing (CS) can be used to solve the demosaicing problem in a novel way. Specifically, during the image reconstruction process, we exploit the fact that the multi-dimensional color of each pixel has a compressible representation in a (possibly overcomplete) color system. While adhering to the “single color per pixel sensing” constraint at the sensing stage, during the reconstruction process we utilize the inter-pixel correlation by exploiting the compressible representation of the overall image in some sparsifying bases. Depending on the CFA, sparsifying bases and the color system, we form an underdetermined system of linear equations and find the sparsest solution for the color image by utilizing a CS solver. We illustrate that, for natural images, the proposed Compressive Demosaicing (CD) framework visually outperforms leading demosaicing methods in a consistent manner; in many cases it achieves clear visible improvements in a significant way.
{"title":"Compressive demosaicing","authors":"A. A. Moghadam, M. Aghagolzadeh, Mrityunjay Kumar, H. Radha","doi":"10.1109/MMSP.2010.5662002","DOIUrl":"https://doi.org/10.1109/MMSP.2010.5662002","url":null,"abstract":"A typical consumer digital camera uses a Color Filter Array (CFA) to sense only one color component per image pixel. The original three-color image is reconstructed by interpolating the missing color components. This interpolation process (known as demosaicing) corresponds to solving an under-determined system of linear equations. In this paper, we show that by replacing the traditional CFA with a random panchromatic CFA, recent results in the emerging field of Compressed Sensing (CS) can be used to solve the demosaicing problem in a novel way. Specifically, during the image reconstruction process, we exploit the fact that the multi-dimensional color of each pixel has a compressible representation in a (possibly overcomplete) color system. While adhering to the “single color per pixel sensing” constraint at the sensing stage, during the reconstruction process we utilize the inter-pixel correlation by exploiting the compressible representation of the overall image in some sparsifying bases. Depending on the CFA, sparsifying bases and the color system, we form an underdetermined system of linear equations and find the sparsest solution for the color image by utilizing a CS solver. We illustrate that, for natural images, the proposed Compressive Demosaicing (CD) framework visually outperforms leading demosaicing methods in a consistent manner; in many cases it achieves clear visible improvements in a significant way.","PeriodicalId":105774,"journal":{"name":"2010 IEEE International Workshop on Multimedia Signal Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132891003","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
扫码关注我们
求助内容：
应助结果提醒方式：