Pub Date : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032265
Dogancan Temel, G. Al-Regib
An average healthy person does not perceive the world in just black and white. Moreover, the perceived world is not composed of pixels and through vision humans perceive structures. However, the acquisition and display systems discretize the world. Therefore, we need to consider pixels, structures and colors to model the quality of experience. Quality assessment methods use the pixel-wise and structural metrics whereas color science approaches use the patch-based color differences. In this work, we combine these approaches by extending CIEDE2000 formula with perceptual color difference to assess image quality. We examine how perceptual color difference-based metric (PCDM) performs compared to PSNR, CIEDE2000, SSIM, MS-SSIM and CW-SSIM on the LIVE database. In terms of linear correlation, PCDM obtains compatible results under white noise (97.9%), Jpeg (95.9%) and Jp2k (95.6%) with an overall correlation of 92.7%. We also show that PCDM captures color-based artifacts that can not be captured by structure-based metrics.
{"title":"Image quality assessment and color difference","authors":"Dogancan Temel, G. Al-Regib","doi":"10.1109/GlobalSIP.2014.7032265","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032265","url":null,"abstract":"An average healthy person does not perceive the world in just black and white. Moreover, the perceived world is not composed of pixels and through vision humans perceive structures. However, the acquisition and display systems discretize the world. Therefore, we need to consider pixels, structures and colors to model the quality of experience. Quality assessment methods use the pixel-wise and structural metrics whereas color science approaches use the patch-based color differences. In this work, we combine these approaches by extending CIEDE2000 formula with perceptual color difference to assess image quality. We examine how perceptual color difference-based metric (PCDM) performs compared to PSNR, CIEDE2000, SSIM, MS-SSIM and CW-SSIM on the LIVE database. In terms of linear correlation, PCDM obtains compatible results under white noise (97.9%), Jpeg (95.9%) and Jp2k (95.6%) with an overall correlation of 92.7%. We also show that PCDM captures color-based artifacts that can not be captured by structure-based metrics.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127224706","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032327
Suleman Alnatheer, H. Man
This paper considers Multi-Arms Restless Bandits problem, where each arm have time varying rewards generated from unknown two-states discrete time Markov process. Each chain is assumed irreducible, aperiodic, and non-reactive to agent actions. Optimal solution or constant value approximation to all instances of Restless Bandits problem does not exist; in fact it has been proven to be intractable even if all parameters were deterministic. A polynomial time algorithm is proposed that learns transitional parameters for each arm and selects the perceived optimal policy from a set of predefined policies using a beliefs or probability distributions. More precisely, the proposed algorithm compares mean rewards of consistently staying with best perceived arm to means rewards of Myopically accessed combination of arms using randomized probability matching or better known as Thompson Sampling. Empirical evaluations are presented at the end of the paper that show an improve performance in all instances of the problem compared to other existing algorithms except a small set of instances where arms are similar and bursty.
{"title":"Multi-policy posterior sampling for restless Markov bandits","authors":"Suleman Alnatheer, H. Man","doi":"10.1109/GlobalSIP.2014.7032327","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032327","url":null,"abstract":"This paper considers Multi-Arms Restless Bandits problem, where each arm have time varying rewards generated from unknown two-states discrete time Markov process. Each chain is assumed irreducible, aperiodic, and non-reactive to agent actions. Optimal solution or constant value approximation to all instances of Restless Bandits problem does not exist; in fact it has been proven to be intractable even if all parameters were deterministic. A polynomial time algorithm is proposed that learns transitional parameters for each arm and selects the perceived optimal policy from a set of predefined policies using a beliefs or probability distributions. More precisely, the proposed algorithm compares mean rewards of consistently staying with best perceived arm to means rewards of Myopically accessed combination of arms using randomized probability matching or better known as Thompson Sampling. Empirical evaluations are presented at the end of the paper that show an improve performance in all instances of the problem compared to other existing algorithms except a small set of instances where arms are similar and bursty.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122715929","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032145
Ameya Agaskar, C. Wang, Yue M. Lu
The Kaczmarz method, or the algebraic reconstruction technique (ART), is a popular method for solving large-scale overdetermined systems of equations. Recently, Strohmer et al. proposed the randomized Kaczmarz algorithm, an improvement that guarantees exponential convergence to the solution. This has spurred much interest in the algorithm and its extensions. We provide in this paper an exact formula for the mean squared error (MSE) in the value reconstructed by the algorithm. We also compute the exponential decay rate of the MSE, which we call the "annealed" error exponent. We show that the typical performance of the algorithm is far better than the average performance. We define the "quenched" error exponent to characterize the typical performance. This is far harder to compute than the annealed error exponent, but we provide an approximation that matches empirical results. We also explore optimizing the algorithm's row-selection probabilities to speed up the algorithm's convergence.
{"title":"Randomized Kaczmarz algorithms: Exact MSE analysis and optimal sampling probabilities","authors":"Ameya Agaskar, C. Wang, Yue M. Lu","doi":"10.1109/GlobalSIP.2014.7032145","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032145","url":null,"abstract":"The Kaczmarz method, or the algebraic reconstruction technique (ART), is a popular method for solving large-scale overdetermined systems of equations. Recently, Strohmer et al. proposed the randomized Kaczmarz algorithm, an improvement that guarantees exponential convergence to the solution. This has spurred much interest in the algorithm and its extensions. We provide in this paper an exact formula for the mean squared error (MSE) in the value reconstructed by the algorithm. We also compute the exponential decay rate of the MSE, which we call the \"annealed\" error exponent. We show that the typical performance of the algorithm is far better than the average performance. We define the \"quenched\" error exponent to characterize the typical performance. This is far harder to compute than the annealed error exponent, but we provide an approximation that matches empirical results. We also explore optimizing the algorithm's row-selection probabilities to speed up the algorithm's convergence.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122855700","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032332
Rugui Yao, Yinsheng Liu, Lu Lu, Geoffrey Y. Li, A. Maaref
In this paper, we study cooperative precoder design in two-tier networks, consisting of a macro cell (MC) and small cells (SCs). By exploiting multi-user Vandermonde-subspace frequency division multiplexing (VFDM) transmission, a MC downlink can co-exist with cognitive SCs. In this paper, we first propose a cooperative cross-tier precoder (CTP) among the transmitters in the SCs to increase the transmit dimension. Moreover, the cooperative CTP allows us to use more efficient intra-tier precoder (ITP) in the SCs to handle intra-cell interference and improve the throughput of the cognitive system. And then, a capacity-achieving (CA) ITP is developed. Numerical results are presented to demonstrate the throughput improvement of the proposed scheme and the robustness to the channel estimation error.
{"title":"Cooperative capacity-achieving precoding design for multi-user VFDM transmission","authors":"Rugui Yao, Yinsheng Liu, Lu Lu, Geoffrey Y. Li, A. Maaref","doi":"10.1109/GlobalSIP.2014.7032332","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032332","url":null,"abstract":"In this paper, we study cooperative precoder design in two-tier networks, consisting of a macro cell (MC) and small cells (SCs). By exploiting multi-user Vandermonde-subspace frequency division multiplexing (VFDM) transmission, a MC downlink can co-exist with cognitive SCs. In this paper, we first propose a cooperative cross-tier precoder (CTP) among the transmitters in the SCs to increase the transmit dimension. Moreover, the cooperative CTP allows us to use more efficient intra-tier precoder (ITP) in the SCs to handle intra-cell interference and improve the throughput of the cognitive system. And then, a capacity-achieving (CA) ITP is developed. Numerical results are presented to demonstrate the throughput improvement of the proposed scheme and the robustness to the channel estimation error.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"159 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123077540","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032236
Y. Kantaros, M. Zavlanos
The purpose of this paper is to propose a distributed control scheme to maximize area coverage by a mobile robot network while ensuring reliable communication between the members of the team. The information that is generated at the sensors depends on the sensing capabilities of the sensors as well as on the frequency at which events occur in their vicinity, captured by appropriate probability density functions. This information is then routed to a fixed set of access points via a multi-hop network whose links model the probability that information packets are correctly decoded at their intended destinations. The proposed distributed control scheme simultaneously optimizes coverage and routing of information by decoupling coverage and routing control. Specifically, optimization of the communication variables is performed periodically in the dual domain. Then, between communication rounds, the robots move according to the solution of a distributed sequential concave program that handles efficiently the introduced nonlinearities in the mobility space. Our method is illustrated in computer simulations.
{"title":"Distributed simultaneous coverage and communication control by mobile sensor networks","authors":"Y. Kantaros, M. Zavlanos","doi":"10.1109/GlobalSIP.2014.7032236","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032236","url":null,"abstract":"The purpose of this paper is to propose a distributed control scheme to maximize area coverage by a mobile robot network while ensuring reliable communication between the members of the team. The information that is generated at the sensors depends on the sensing capabilities of the sensors as well as on the frequency at which events occur in their vicinity, captured by appropriate probability density functions. This information is then routed to a fixed set of access points via a multi-hop network whose links model the probability that information packets are correctly decoded at their intended destinations. The proposed distributed control scheme simultaneously optimizes coverage and routing of information by decoupling coverage and routing control. Specifically, optimization of the communication variables is performed periodically in the dual domain. Then, between communication rounds, the robots move according to the solution of a distributed sequential concave program that handles efficiently the introduced nonlinearities in the mobility space. Our method is illustrated in computer simulations.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127459701","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032324
Radwa A. Sultan, Lingyang Song, Zhu Han
In this paper, a study of the effect of full duplex on resource allocation for small cell network is presented. In our model, both the macro-base station and femtocell access point operate in full-duplex where users attempt to connect either to the base station or the femtocell access point. A resource allocation problem is formulated to adjust the base station and the femtocell access point transmitting powers to maximize the downlink channel capacity while guaranteeing the uplink channel QoS by maintaining a certain channel capacity. In addition, a solution algorithm using the interior point method is proposed. Our results show that depending on the interference conditions, it can be decided when it is preferable to employ full-duplex and when it is more advantageous to use half-duplex.
{"title":"Impact of full duplex on resource allocation for small cell networks","authors":"Radwa A. Sultan, Lingyang Song, Zhu Han","doi":"10.1109/GlobalSIP.2014.7032324","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032324","url":null,"abstract":"In this paper, a study of the effect of full duplex on resource allocation for small cell network is presented. In our model, both the macro-base station and femtocell access point operate in full-duplex where users attempt to connect either to the base station or the femtocell access point. A resource allocation problem is formulated to adjust the base station and the femtocell access point transmitting powers to maximize the downlink channel capacity while guaranteeing the uplink channel QoS by maintaining a certain channel capacity. In addition, a solution algorithm using the interior point method is proposed. Our results show that depending on the interference conditions, it can be decided when it is preferable to employ full-duplex and when it is more advantageous to use half-duplex.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129060117","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032105
Rui Ma, Wei Zhang
In energy harvesting (EH) wireless communications, full channel state information (CSI) at transmitter (TX) is generally needed to determine transmission power. In this paper, we propose a transmission power policy based on only 1-bit feedback of the CSI sent from the receiver (RX), for an EH communication system over Rayleigh fading channels. The RX periodically sends 1-bit feedback by comparing the channel power gain with a predetermined threshold. The TX adjusts transmission power based on the 1-bit feedback and its currently available energy. To obtain the optimal channel threshold and transmission power, we formulate a constrained optimization problem to maximize the throughput under an arbitrarily deterministic EH process. Constrained by the battery energy update process and channel state transition process, this problem follows a Markov decision process and can be solved via backward induction method. Simulation results show that our proposed policy has higher throughput performance than other policies.
{"title":"Optimal power allocation for energy harvesting communications with limited channel feedback","authors":"Rui Ma, Wei Zhang","doi":"10.1109/GlobalSIP.2014.7032105","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032105","url":null,"abstract":"In energy harvesting (EH) wireless communications, full channel state information (CSI) at transmitter (TX) is generally needed to determine transmission power. In this paper, we propose a transmission power policy based on only 1-bit feedback of the CSI sent from the receiver (RX), for an EH communication system over Rayleigh fading channels. The RX periodically sends 1-bit feedback by comparing the channel power gain with a predetermined threshold. The TX adjusts transmission power based on the 1-bit feedback and its currently available energy. To obtain the optimal channel threshold and transmission power, we formulate a constrained optimization problem to maximize the throughput under an arbitrarily deterministic EH process. Constrained by the battery energy update process and channel state transition process, this problem follows a Markov decision process and can be solved via backward induction method. Simulation results show that our proposed policy has higher throughput performance than other policies.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129138830","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032273
V. Murray, P. Rodríguez, M. Pattichis
We present a first approach to a new method to compute the motion estimation in digital videos using the two-dimensional instantaneous frequency information computed using amplitude-modulation frequency-modulation (AM-FM) methods. The optical flow vectors are computed using an iteratively reweighted norm for total variation (IRN-TV) algorithm. We compare the proposed method using synthetic videos versus a previous three-dimensional AM-FM based method and available motion estimation methods such as a phase-based, Horn-Schunck and the Lucas-Kanade methods. The results are promising producing a full density estimation with more accurate results than the other methods.
{"title":"2D instantaneous frequency-based method for motion estimation using total variation","authors":"V. Murray, P. Rodríguez, M. Pattichis","doi":"10.1109/GlobalSIP.2014.7032273","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032273","url":null,"abstract":"We present a first approach to a new method to compute the motion estimation in digital videos using the two-dimensional instantaneous frequency information computed using amplitude-modulation frequency-modulation (AM-FM) methods. The optical flow vectors are computed using an iteratively reweighted norm for total variation (IRN-TV) algorithm. We compare the proposed method using synthetic videos versus a previous three-dimensional AM-FM based method and available motion estimation methods such as a phase-based, Horn-Schunck and the Lucas-Kanade methods. The results are promising producing a full density estimation with more accurate results than the other methods.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131355654","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032272
Joseph Santarcangelo, Xiao-Ping Zhang
This paper introduces the concept of positive developmental video classification. The work focuses on developing features and classification systems that can be used to classify content based on the impact on the cognitive, social and academic development of children according to an expertly assigned predefined positive or negative cognitive impact category. We solve the problem by developing novel features that gauge the amount of social interaction, attention disrupting fast-paced content, incorporate music information retrieval features and combine these features with other video content analysis features. This information is then used to determine what content has a positive impact on a child's development. It was found that the low-level features can be used for classification and do have correlation with expertly assigned predefined impact categories. To ensure the validation results are not based on similarities between content, a new model validation technique is developed to ensure that the videos are classified with respect to their impact on development. In addition, we developed a data set of videos that has been classified as having a positive or negative impact on children, based on expert experimental results in the psychological literature. This data set can be used as a benchmark for future research. Validation results found the system had almost 30% better accuracy than state-of-the-art video genre classification systems and over 65% better performance than the arousal time curve used in affective video content modelling.
{"title":"Positive developmental video classification for children","authors":"Joseph Santarcangelo, Xiao-Ping Zhang","doi":"10.1109/GlobalSIP.2014.7032272","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032272","url":null,"abstract":"This paper introduces the concept of positive developmental video classification. The work focuses on developing features and classification systems that can be used to classify content based on the impact on the cognitive, social and academic development of children according to an expertly assigned predefined positive or negative cognitive impact category. We solve the problem by developing novel features that gauge the amount of social interaction, attention disrupting fast-paced content, incorporate music information retrieval features and combine these features with other video content analysis features. This information is then used to determine what content has a positive impact on a child's development. It was found that the low-level features can be used for classification and do have correlation with expertly assigned predefined impact categories. To ensure the validation results are not based on similarities between content, a new model validation technique is developed to ensure that the videos are classified with respect to their impact on development. In addition, we developed a data set of videos that has been classified as having a positive or negative impact on children, based on expert experimental results in the psychological literature. This data set can be used as a benchmark for future research. Validation results found the system had almost 30% better accuracy than state-of-the-art video genre classification systems and over 65% better performance than the arousal time curve used in affective video content modelling.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122994321","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032152
Jin Tan, Yanting Ma, D. Baron
We consider compressive imaging problems, where images are reconstructed from a reduced number of linear measurements. Our objective is to improve over current state of the art compressive imaging algorithms in terms of both reconstruction error and runtime. To pursue our objective, we propose a compressive imaging algorithm that employs the approximate message passing (AMP) framework. AMP is an iterative signal reconstruction algorithm that performs scalar denoising of noisy signals. In this work, we apply an adaptive Wiener filter, which is a wavelet-based image denoiser, within AMP. Numerical results show that the proposed algorithm improves over the state of the art in both reconstruction error and runtime.
{"title":"Compressive imaging via approximate message passing with wavelet-based image denoising","authors":"Jin Tan, Yanting Ma, D. Baron","doi":"10.1109/GlobalSIP.2014.7032152","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032152","url":null,"abstract":"We consider compressive imaging problems, where images are reconstructed from a reduced number of linear measurements. Our objective is to improve over current state of the art compressive imaging algorithms in terms of both reconstruction error and runtime. To pursue our objective, we propose a compressive imaging algorithm that employs the approximate message passing (AMP) framework. AMP is an iterative signal reconstruction algorithm that performs scalar denoising of noisy signals. In this work, we apply an adaptive Wiener filter, which is a wavelet-based image denoiser, within AMP. Numerical results show that the proposed algorithm improves over the state of the art in both reconstruction error and runtime.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121300688","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
扫码关注我们
求助内容：
应助结果提醒方式：