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.7032198
Shiva Kiran, S. Hoyos, S. Palermo
Some proposed high speed wireline communications make use of an ADC front end to allow a feedforward equalizer (FFE) to compensate for the frequency dependent loss of the channel. High precision ADCs are expensive in terms of power. The FFE block performs multiplication and addition operations at high speed and further increases the power consumption. This paper proposes a simple forward error correction method by which the ADC resolution and the equalizer complexity can be reduced. A single parity check code implemented together with a threshold detector can provide single error correction capability. With this error correction capability, the number of taps required in the FFE block is shown to be reduced to 3 taps from 6 taps for a channel with 15dB insertion loss at 5GHz frequency with the data rate being 20Gb/s. The effective number of bits (ENOB) required from the ADC is also shown to reduce to about 3.5 bits from 6 bits. The high rate of the code and the very simple decoder architecture make this error correction mechanism well suited for the wireline application.
{"title":"A single parity check forward error correction method for high speed I/O","authors":"Shiva Kiran, S. Hoyos, S. Palermo","doi":"10.1109/GlobalSIP.2014.7032198","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032198","url":null,"abstract":"Some proposed high speed wireline communications make use of an ADC front end to allow a feedforward equalizer (FFE) to compensate for the frequency dependent loss of the channel. High precision ADCs are expensive in terms of power. The FFE block performs multiplication and addition operations at high speed and further increases the power consumption. This paper proposes a simple forward error correction method by which the ADC resolution and the equalizer complexity can be reduced. A single parity check code implemented together with a threshold detector can provide single error correction capability. With this error correction capability, the number of taps required in the FFE block is shown to be reduced to 3 taps from 6 taps for a channel with 15dB insertion loss at 5GHz frequency with the data rate being 20Gb/s. The effective number of bits (ENOB) required from the ADC is also shown to reduce to about 3.5 bits from 6 bits. The high rate of the code and the very simple decoder architecture make this error correction mechanism well suited for the wireline application.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"312 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":"124439686","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.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.7032156
Heng Qiao, P. Pal
This paper considers the problem of estimating the symmetric and Toeplitz covariance matrix of compressive samples of wide sense stationary random vectors. A new structured deterministic sampling method known as the "Generalized Nested Sampling" is introduced which enables compressive quadratic sampling of symmetric Toeplitz matrices., by fully exploiting the inherent redundancy in the Toeplitz matrix. For a Toeplitz matrix of size N ×N, this sampling scheme can attain a compression factor of O(√N) even without assuming sparsity and/or low rank, and allows exact recovery of the original Toeplitz matrix. When the matrix is sparse, a new hybrid sampling approach is proposed which efficiently combines Generalized Nested Sampling and Random Sampling to attain even greater compression rates, which, under suitable conditions can be as large as O(√N), using a novel observation formulated in this paper.
{"title":"Generalized nested sampling for compression and exact recovery of symmetric Toeplitz matrices","authors":"Heng Qiao, P. Pal","doi":"10.1109/GlobalSIP.2014.7032156","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032156","url":null,"abstract":"This paper considers the problem of estimating the symmetric and Toeplitz covariance matrix of compressive samples of wide sense stationary random vectors. A new structured deterministic sampling method known as the \"Generalized Nested Sampling\" is introduced which enables compressive quadratic sampling of symmetric Toeplitz matrices., by fully exploiting the inherent redundancy in the Toeplitz matrix. For a Toeplitz matrix of size N ×N, this sampling scheme can attain a compression factor of O(√N) even without assuming sparsity and/or low rank, and allows exact recovery of the original Toeplitz matrix. When the matrix is sparse, a new hybrid sampling approach is proposed which efficiently combines Generalized Nested Sampling and Random Sampling to attain even greater compression rates, which, under suitable conditions can be as large as O(√N), using a novel observation formulated in this paper.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"5 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":"130714168","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.7032087
Xiang Chen, Wei Chen
Joint channel-aware and buffer-aware scheduling along with rate/power adaptation is a promising solution to assure Quality of Service (QoS) and improve energy efficiency. In this paper, an analytical delay-power tradeoff and optimal threshold-based scheduling are proposed. In particular, we are interested in the scheduling policies where the scheduler only needs to decide transmitting or not. More specifically, we shall focus on the slow fading scenario, where channel coherent time is long enough to transmit several data packets. We formulate a linear programming problem where the average delay is minimized given an average power constraint. By deriving the analytical solution to this linear programming, the optimal delay-power tradeoff and the optimal scheduling policy are presented.
{"title":"A joint channel-aware and buffer-aware scheduling for energy-efficient transmission over fading channels with long coherent time","authors":"Xiang Chen, Wei Chen","doi":"10.1109/GlobalSIP.2014.7032087","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032087","url":null,"abstract":"Joint channel-aware and buffer-aware scheduling along with rate/power adaptation is a promising solution to assure Quality of Service (QoS) and improve energy efficiency. In this paper, an analytical delay-power tradeoff and optimal threshold-based scheduling are proposed. In particular, we are interested in the scheduling policies where the scheduler only needs to decide transmitting or not. More specifically, we shall focus on the slow fading scenario, where channel coherent time is long enough to transmit several data packets. We formulate a linear programming problem where the average delay is minimized given an average power constraint. By deriving the analytical solution to this linear programming, the optimal delay-power tradeoff and the optimal scheduling policy are presented.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"10 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":"132450397","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.7032165
Jing Yang, Zuoen Wang, Jingxian Wu
In this paper, we study the level set estimation of a spatial-temporally correlated random field by using a small number of spatially distributed sensors. The level sets of a random field are defined as regions where data values exceed a certain threshold. We propose a new active sparse sensing and inference scheme, which can accurately extract level sets in a large random field with a small number of sensors strategically and sparsely placed in the random field. In the proposed active sparse sensing scheme, a central controller dynamically selects a small number of sensing locations according to the information revealed from past measurements, with the objective to minimize the expected level set estimation errors. The expected estimation error is explicitly expressed as a function of the sensing locations, and the results are used to formulate optimal and sub-optimal selection of sensing locations. Simulation results demonstrate that the proposed algorithms can achieve significant performance gains over baseline passive sensing algorithms that do not proactively select the sensing locations.
{"title":"Level set estimation with dynamic sparse sensing","authors":"Jing Yang, Zuoen Wang, Jingxian Wu","doi":"10.1109/GlobalSIP.2014.7032165","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032165","url":null,"abstract":"In this paper, we study the level set estimation of a spatial-temporally correlated random field by using a small number of spatially distributed sensors. The level sets of a random field are defined as regions where data values exceed a certain threshold. We propose a new active sparse sensing and inference scheme, which can accurately extract level sets in a large random field with a small number of sensors strategically and sparsely placed in the random field. In the proposed active sparse sensing scheme, a central controller dynamically selects a small number of sensing locations according to the information revealed from past measurements, with the objective to minimize the expected level set estimation errors. The expected estimation error is explicitly expressed as a function of the sensing locations, and the results are used to formulate optimal and sub-optimal selection of sensing locations. Simulation results demonstrate that the proposed algorithms can achieve significant performance gains over baseline passive sensing algorithms that do not proactively select the sensing locations.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"4 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":"134410919","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
扫码关注我们
求助内容：
应助结果提醒方式：