Pub Date : 2008-11-05DOI: 10.1109/MMSP.2008.4665122
Xin Liu, Gene Cheung, C. Chuah
By providing coding ability at intermediate nodes, network coding has been shown to improve throughput in wireless broadcast/multicast networks. Considering a scenario where wireless ad-hoc peers cooperatively relay packets to each other to recover packets lost during MBMS broadcast, we show that by first imposing coding structures globally and then selecting the appropriate types within the structures locally, network coding can be optimized for video streaming in a rate-distortion manner. Experimental results show that our proposed scheme can improve video quality noticeably, by up to 19.71 dB over un-repaired video stream and by up to 8.34 dB over video stream using traditional unstructured network coding.
{"title":"Structured network coding and cooperative local peer-to-peer repair for MBMS video streaming","authors":"Xin Liu, Gene Cheung, C. Chuah","doi":"10.1109/MMSP.2008.4665122","DOIUrl":"https://doi.org/10.1109/MMSP.2008.4665122","url":null,"abstract":"By providing coding ability at intermediate nodes, network coding has been shown to improve throughput in wireless broadcast/multicast networks. Considering a scenario where wireless ad-hoc peers cooperatively relay packets to each other to recover packets lost during MBMS broadcast, we show that by first imposing coding structures globally and then selecting the appropriate types within the structures locally, network coding can be optimized for video streaming in a rate-distortion manner. Experimental results show that our proposed scheme can improve video quality noticeably, by up to 19.71 dB over un-repaired video stream and by up to 8.34 dB over video stream using traditional unstructured network coding.","PeriodicalId":402287,"journal":{"name":"2008 IEEE 10th Workshop on Multimedia Signal Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114905748","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 : 2008-11-05DOI: 10.1109/MMSP.2008.4665123
Sheng-Shuen Wang, Hsu-Feng Hsiao
More and more streaming protocols are developed for the multimedia applications. However, many streaming protocols only consider the network stability, but not the characteristics of streaming applications. In order to cooperate with H.264/MPEG-4 AVC scalable extension which can achieve fine granularity of scalability at bit level to the time-vary heterogeneous networks, we design a TCP-friendly congestion control algorithm based on the bandwidth estimation to smoothly change sending rate to avoid unnecessary oscillations so that the subscription decision of SVC layers can be made to better utilize the network resource. In case of the unavoidable network congestion, we unsubscribe scalable video layers according to the packet lost rate and the recently received throughput instead of only dropping one layer at a time to rapidly accommodate the streaming service to the channels and avoid persecuting the other flows at the same bottleneck. In addition, the probing packets for estimating the available bandwidth are encapsulated with RTP/RTCP. The simulations show that the proposed congestion control algorithm for real-time applications efficiently utilizes network bandwidth without hampering the performance of the existing TCP applications.
{"title":"TCP-friendly congestion control for layered video streaming using end-to-end bandwidth inference","authors":"Sheng-Shuen Wang, Hsu-Feng Hsiao","doi":"10.1109/MMSP.2008.4665123","DOIUrl":"https://doi.org/10.1109/MMSP.2008.4665123","url":null,"abstract":"More and more streaming protocols are developed for the multimedia applications. However, many streaming protocols only consider the network stability, but not the characteristics of streaming applications. In order to cooperate with H.264/MPEG-4 AVC scalable extension which can achieve fine granularity of scalability at bit level to the time-vary heterogeneous networks, we design a TCP-friendly congestion control algorithm based on the bandwidth estimation to smoothly change sending rate to avoid unnecessary oscillations so that the subscription decision of SVC layers can be made to better utilize the network resource. In case of the unavoidable network congestion, we unsubscribe scalable video layers according to the packet lost rate and the recently received throughput instead of only dropping one layer at a time to rapidly accommodate the streaming service to the channels and avoid persecuting the other flows at the same bottleneck. In addition, the probing packets for estimating the available bandwidth are encapsulated with RTP/RTCP. The simulations show that the proposed congestion control algorithm for real-time applications efficiently utilizes network bandwidth without hampering the performance of the existing TCP applications.","PeriodicalId":402287,"journal":{"name":"2008 IEEE 10th Workshop on Multimedia Signal Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127341383","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 : 2008-11-05DOI: 10.1109/MMSP.2008.4665108
R. Farrugia, C. J. Debono
The transmission of H.264/AVC encoded sequences over noisy wireless channels generally adopt the error detection capabilities of the transport protocol to identify and discard corrupted slices. All the macroblocks (MBs) within each corrupted slice are then concealed. This paper presents an algorithm that does not discard the corrupted slices but tries to detect those MBs which provide major visual artefacts and then conceal only these MBs. Results show that the proposed solution, based on a set of image-level features and two support vector machines (SVMs), manages to detect 94.6% of those artefacts. Gains in peak signal-to-noise ratios (PSNR) of up to 5.74 dB have been obtained when compared to the standard H.264/AVC decoder.
{"title":"Improved quality of experience of reconstructed H.264/AVC encoded video sequences through robust pixel domain error detection","authors":"R. Farrugia, C. J. Debono","doi":"10.1109/MMSP.2008.4665108","DOIUrl":"https://doi.org/10.1109/MMSP.2008.4665108","url":null,"abstract":"The transmission of H.264/AVC encoded sequences over noisy wireless channels generally adopt the error detection capabilities of the transport protocol to identify and discard corrupted slices. All the macroblocks (MBs) within each corrupted slice are then concealed. This paper presents an algorithm that does not discard the corrupted slices but tries to detect those MBs which provide major visual artefacts and then conceal only these MBs. Results show that the proposed solution, based on a set of image-level features and two support vector machines (SVMs), manages to detect 94.6% of those artefacts. Gains in peak signal-to-noise ratios (PSNR) of up to 5.74 dB have been obtained when compared to the standard H.264/AVC decoder.","PeriodicalId":402287,"journal":{"name":"2008 IEEE 10th Workshop on Multimedia Signal Processing","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127364435","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 : 2008-11-05DOI: 10.1109/MMSP.2008.4665186
D. Maskell, A. P. Vinod, G. Woods
This paper investigates the design of very low complexity multiplierless linear phase FIR filters for use in the channelizer of multi-standard software defined radios. A technique for reducing the hardware complexity of linear phase FIR digital filters which minimizes the adder depth and the number of adders in the multiplier block is introduced and is used to implement a multistage, multi-standard decimating filter. The design reuses components for different communications standards and is thus ideal for use in systems which support dynamic reconfiguration.
{"title":"Multiplierless multi-standard SDR channel filters","authors":"D. Maskell, A. P. Vinod, G. Woods","doi":"10.1109/MMSP.2008.4665186","DOIUrl":"https://doi.org/10.1109/MMSP.2008.4665186","url":null,"abstract":"This paper investigates the design of very low complexity multiplierless linear phase FIR filters for use in the channelizer of multi-standard software defined radios. A technique for reducing the hardware complexity of linear phase FIR digital filters which minimizes the adder depth and the number of adders in the multiplier block is introduced and is used to implement a multistage, multi-standard decimating filter. The design reuses components for different communications standards and is thus ideal for use in systems which support dynamic reconfiguration.","PeriodicalId":402287,"journal":{"name":"2008 IEEE 10th Workshop on Multimedia Signal Processing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127015410","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 : 2008-11-05DOI: 10.1109/MMSP.2008.4665080
Jürgen Seiler, André Kaup
In the past years, video communication has found its application in an increasing number of environments. Unfortunately, some of them are error-prone and the risk of block losses caused by transmission errors is ubiquitous. To reduce the effects of these block losses, a new spatio-temporal error concealment algorithm is presented. The algorithm uses spatial as well as temporal information for extrapolating the signal into the lost areas. The extrapolation is carried out in two steps, first a preliminary temporal extrapolation is performed which then is used to generate a model of the original signal, using the spatial neighborhood of the lost block. By applying the spatial refinement a significantly higher concealment quality can be achieved resulting in a gain of up to 5.2 dB in PSNR compared to the unrefined underlying pure temporal extrapolation.
{"title":"Adaptive joint spatio-temporal error concealment for video communication","authors":"Jürgen Seiler, André Kaup","doi":"10.1109/MMSP.2008.4665080","DOIUrl":"https://doi.org/10.1109/MMSP.2008.4665080","url":null,"abstract":"In the past years, video communication has found its application in an increasing number of environments. Unfortunately, some of them are error-prone and the risk of block losses caused by transmission errors is ubiquitous. To reduce the effects of these block losses, a new spatio-temporal error concealment algorithm is presented. The algorithm uses spatial as well as temporal information for extrapolating the signal into the lost areas. The extrapolation is carried out in two steps, first a preliminary temporal extrapolation is performed which then is used to generate a model of the original signal, using the spatial neighborhood of the lost block. By applying the spatial refinement a significantly higher concealment quality can be achieved resulting in a gain of up to 5.2 dB in PSNR compared to the unrefined underlying pure temporal extrapolation.","PeriodicalId":402287,"journal":{"name":"2008 IEEE 10th Workshop on Multimedia Signal Processing","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126314441","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 : 2008-11-05DOI: 10.1109/MMSP.2008.4665087
U. Fecker, Jürgen Seiler, André Kaup
Practical applications for multi-view video such as three-dimensional television may require to transmit the data over error-prone channels. Even when channel coding is used, it is likely that parts of the image information are lost after decoding. To improve the image quality in this case, an efficient algorithm for multi-view error concealment is presented. Extending and enhancing a previously known method for single-view concealment, the algorithm simultaneously uses information from surrounding image parts, from temporally preceding and succeeding frames and from neighbouring camera views for extrapolating known image samples into the lost area. It is shown that the proposed algorithm leads to convincing results in terms of PSNR as well as to a good subjective quality. Compared to single-view concealment, the result is improved by up to 0.75 dB by adding cross-view information.
{"title":"4-D frequency selective extrapolation for error concealment in multi-view video","authors":"U. Fecker, Jürgen Seiler, André Kaup","doi":"10.1109/MMSP.2008.4665087","DOIUrl":"https://doi.org/10.1109/MMSP.2008.4665087","url":null,"abstract":"Practical applications for multi-view video such as three-dimensional television may require to transmit the data over error-prone channels. Even when channel coding is used, it is likely that parts of the image information are lost after decoding. To improve the image quality in this case, an efficient algorithm for multi-view error concealment is presented. Extending and enhancing a previously known method for single-view concealment, the algorithm simultaneously uses information from surrounding image parts, from temporally preceding and succeeding frames and from neighbouring camera views for extrapolating known image samples into the lost area. It is shown that the proposed algorithm leads to convincing results in terms of PSNR as well as to a good subjective quality. Compared to single-view concealment, the result is improved by up to 0.75 dB by adding cross-view information.","PeriodicalId":402287,"journal":{"name":"2008 IEEE 10th Workshop on Multimedia Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131265424","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 : 2008-11-05DOI: 10.1109/MMSP.2008.4665086
Jinrong Zhang, Houqiang Li, C. Chen
We present in this paper a novel distributed image coding scheme by exploiting image spatial correlation via Markov random field modeling at the decoding end. This allows us to design a simple yet efficient encoder suitable for various energy efficient imaging sensor network applications. The novelty is the integration of LDPC decoding and Markov random field modeling in order to jointly exploit both inter-image and intra-image correlation. The current research aims at improving our previous work in which the Markov model was defined by a state transition probability matrix. In this research, we model the image via a Markov random field described by Gibbs distribution. Both analysis and simulations have been carried out to demonstrate that this Markov model-based approach is able to achieve significant gains over the schemes without Markov modeling. Furthermore, this new Gibbs-based Markov model is less sensitive to correlated noise. Our approach also outperforms a JPEG codec by up to 4 dB even if the interimage correlation is not very high.
{"title":"Distributed image coding based on integrated Markov random field modeling and LDPC decoding","authors":"Jinrong Zhang, Houqiang Li, C. Chen","doi":"10.1109/MMSP.2008.4665086","DOIUrl":"https://doi.org/10.1109/MMSP.2008.4665086","url":null,"abstract":"We present in this paper a novel distributed image coding scheme by exploiting image spatial correlation via Markov random field modeling at the decoding end. This allows us to design a simple yet efficient encoder suitable for various energy efficient imaging sensor network applications. The novelty is the integration of LDPC decoding and Markov random field modeling in order to jointly exploit both inter-image and intra-image correlation. The current research aims at improving our previous work in which the Markov model was defined by a state transition probability matrix. In this research, we model the image via a Markov random field described by Gibbs distribution. Both analysis and simulations have been carried out to demonstrate that this Markov model-based approach is able to achieve significant gains over the schemes without Markov modeling. Furthermore, this new Gibbs-based Markov model is less sensitive to correlated noise. Our approach also outperforms a JPEG codec by up to 4 dB even if the interimage correlation is not very high.","PeriodicalId":402287,"journal":{"name":"2008 IEEE 10th Workshop on Multimedia Signal Processing","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131621456","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 : 2008-11-05DOI: 10.1109/MMSP.2008.4665058
A. El-Sallam
The paper considers a blind channel estimation method combined with a model selection algorithm for the classification and estimation of significant channel parameters in coded orthogonal frequency division multiplexing (COFDM) systems with multiple receive antennas. Unlike conventional channel estimation methods, where channel parameters are estimated based on a known or an estimated length, we propose a blind-based method which will jointly classify and estimate only significant channel parameters and the channel length, i.e., parsimonious channel estimates. Firstly, by using only the received signal and userspsila spreading codes, a data model for the channel response is presented. Then, a blind channel estimation method based on eigenvalue value decomposition (EVD), incorporated with a hierarchical minimum description length (MDL) model selection method is used to estimate only the identified significant channel parameters. Simulation results show that, the proposed method is capable of identifying significant channel parameters with high probabilities and at low SNRs. In addition, the system performance based on the identified parameters is enhanced over conventional methods.
{"title":"Model selection-based blind channel estimation method for parsimonious MIMO-COFDM systems","authors":"A. El-Sallam","doi":"10.1109/MMSP.2008.4665058","DOIUrl":"https://doi.org/10.1109/MMSP.2008.4665058","url":null,"abstract":"The paper considers a blind channel estimation method combined with a model selection algorithm for the classification and estimation of significant channel parameters in coded orthogonal frequency division multiplexing (COFDM) systems with multiple receive antennas. Unlike conventional channel estimation methods, where channel parameters are estimated based on a known or an estimated length, we propose a blind-based method which will jointly classify and estimate only significant channel parameters and the channel length, i.e., parsimonious channel estimates. Firstly, by using only the received signal and userspsila spreading codes, a data model for the channel response is presented. Then, a blind channel estimation method based on eigenvalue value decomposition (EVD), incorporated with a hierarchical minimum description length (MDL) model selection method is used to estimate only the identified significant channel parameters. Simulation results show that, the proposed method is capable of identifying significant channel parameters with high probabilities and at low SNRs. In addition, the system performance based on the identified parameters is enhanced over conventional methods.","PeriodicalId":402287,"journal":{"name":"2008 IEEE 10th Workshop on Multimedia Signal Processing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128280120","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 : 2008-11-05DOI: 10.1109/MMSP.2008.4665038
Chang Wen Chen
Summary form only given: This talk will present some technical challenges in video coding and processing to meet the paradigm shifting trends for future digital entertainment for consumers. Traditional consumer video services have been in the broadcasting mode, from terrestrial TV, to satellite and cable services, in which a single encoder is able to serve millions of decoders. The design principle has been the simple decoder of volume sets at the expense of very complicated encoder. The proliferation of mobile devices with video capture capabilities in the recent years has resulted in a paradigm shift trends that require simple encoder for the mobile devices. The burden of the performance has now shifted to decoder that resides at consumerpsilas home to manage volumetric video captures with desktop computers. This paradigm shift thus created an opportunity for new generations of video coding and processing algorithms and architectures to meet the challenges in more complicated video decoding. In this talk, we will present several examples of new video coding and processing schemes based on distributed source coding. Some detailed analysis and simulation results will be shown to demonstrate that distributed source coding based approach is indeed promising for video decoding and processing for future digital entertainment.
{"title":"Technical challenges in video coding and processing for future digital entertainment","authors":"Chang Wen Chen","doi":"10.1109/MMSP.2008.4665038","DOIUrl":"https://doi.org/10.1109/MMSP.2008.4665038","url":null,"abstract":"Summary form only given: This talk will present some technical challenges in video coding and processing to meet the paradigm shifting trends for future digital entertainment for consumers. Traditional consumer video services have been in the broadcasting mode, from terrestrial TV, to satellite and cable services, in which a single encoder is able to serve millions of decoders. The design principle has been the simple decoder of volume sets at the expense of very complicated encoder. The proliferation of mobile devices with video capture capabilities in the recent years has resulted in a paradigm shift trends that require simple encoder for the mobile devices. The burden of the performance has now shifted to decoder that resides at consumerpsilas home to manage volumetric video captures with desktop computers. This paradigm shift thus created an opportunity for new generations of video coding and processing algorithms and architectures to meet the challenges in more complicated video decoding. In this talk, we will present several examples of new video coding and processing schemes based on distributed source coding. Some detailed analysis and simulation results will be shown to demonstrate that distributed source coding based approach is indeed promising for video decoding and processing for future digital entertainment.","PeriodicalId":402287,"journal":{"name":"2008 IEEE 10th Workshop on Multimedia Signal Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114969800","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 : 2008-11-05DOI: 10.1109/MMSP.2008.4665040
P. P. Wang, Wei Zhang, Jianguo Li, Yimin Zhang
Consumers are making increasing use of digital camera, phone camera, and camcorder every minute. Normal users have desires to produce high-quality photos although they are less of photography techniques. Consumers hunger for online instructing on how to capture a good photograph in terms of camera pose (location, orientation, field of view, etc.) Making it ubiquitously accessible is essential which requires excessive computation and communication capabilities over existing portable devices. The emerging Mobile Internet Devices (MIDs) and Ultra Mobile PCs (UMPCs) have been equipped with enabling features and turn into an alternative. This paper presents a new Location Based Service for photography assistance. It consists of three major components, focus of attention modeling, image quality assessment, and camera pose matching, to deal with the geo-referenced photos retrieved from Internet. Those techniques have been widely studied in the research domains of computer vision and pattern recognition. Having the MID / UMPC platforms at hand, richer experiences on Internet, such as instant travel blogging and photo sharing are more convenient.
{"title":"Online photography assistance by exploring geo-referenced photos on MID / UMPC","authors":"P. P. Wang, Wei Zhang, Jianguo Li, Yimin Zhang","doi":"10.1109/MMSP.2008.4665040","DOIUrl":"https://doi.org/10.1109/MMSP.2008.4665040","url":null,"abstract":"Consumers are making increasing use of digital camera, phone camera, and camcorder every minute. Normal users have desires to produce high-quality photos although they are less of photography techniques. Consumers hunger for online instructing on how to capture a good photograph in terms of camera pose (location, orientation, field of view, etc.) Making it ubiquitously accessible is essential which requires excessive computation and communication capabilities over existing portable devices. The emerging Mobile Internet Devices (MIDs) and Ultra Mobile PCs (UMPCs) have been equipped with enabling features and turn into an alternative. This paper presents a new Location Based Service for photography assistance. It consists of three major components, focus of attention modeling, image quality assessment, and camera pose matching, to deal with the geo-referenced photos retrieved from Internet. Those techniques have been widely studied in the research domains of computer vision and pattern recognition. Having the MID / UMPC platforms at hand, richer experiences on Internet, such as instant travel blogging and photo sharing are more convenient.","PeriodicalId":402287,"journal":{"name":"2008 IEEE 10th Workshop on Multimedia Signal Processing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132614970","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
扫码关注我们
求助内容：
应助结果提醒方式：