Pub Date : 2011-03-24DOI: 10.1109/ICCSP.2011.5739283
A. T. Kunnath, M. Ramesh
Recent years have shown an alarmous increase in rain fall induced landslides. This has facilitated the need for having a monitoring system to predict the landslides which could eventually reduce the loss of human life. We have developed and deployed a Wireless Sensor Network to monitor rainfall induced landslide, in Munnar, South India. A successful landslide warning was issued in June 2009 using this system. The system is being enhanced by incorporating a Wireless Geophone Network to locate the initiation of landslide. The paper discusses an algorithm that was developed to analyze the geophone data and automatically detect the landslide signal. A novel method to localize the landslide initiation point is detailed. The algorithm is based on the time delay inherent in the transmission of waves through the surface of the earth. The approach detailed here does not require additional energy since the geophones are self excitatory. The error rate of the approach is much less when compared to the other localization methods like RSSI. The proposed algorithm is being tested and validated, in the landslide laboratory set up at our university.
{"title":"Wireless Geophone Network for remote monitoring and detection of landslides","authors":"A. T. Kunnath, M. Ramesh","doi":"10.1109/ICCSP.2011.5739283","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739283","url":null,"abstract":"Recent years have shown an alarmous increase in rain fall induced landslides. This has facilitated the need for having a monitoring system to predict the landslides which could eventually reduce the loss of human life. We have developed and deployed a Wireless Sensor Network to monitor rainfall induced landslide, in Munnar, South India. A successful landslide warning was issued in June 2009 using this system. The system is being enhanced by incorporating a Wireless Geophone Network to locate the initiation of landslide. The paper discusses an algorithm that was developed to analyze the geophone data and automatically detect the landslide signal. A novel method to localize the landslide initiation point is detailed. The algorithm is based on the time delay inherent in the transmission of waves through the surface of the earth. The approach detailed here does not require additional energy since the geophones are self excitatory. The error rate of the approach is much less when compared to the other localization methods like RSSI. The proposed algorithm is being tested and validated, in the landslide laboratory set up at our university.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121166323","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 : 2011-03-24DOI: 10.1109/ICCSP.2011.5739368
Dr. Nagaraj V. Dharwadkar, B. B. Amberker, A. Gorai
Recent developments in digital image and Internet technology help the common users to easily produce illegal copies of the images. In order to solve the copyright protection problems of the image, several watermarking schemes have been widely used. Very few watermarking schemes have been proposed for defining the copyrights of color image. To resolve the copyright protection problem of color image, we propose an effective, robust and imperceptible color image watermarking scheme. This scheme embeds the watermark into cover image in (Red, Green, Blue) RGB space. The combinations of Discrete Wavelet Transformation (DWT) and Singular Value Decomposition (SVD) of Blue channel is used to embed the watermark. The singular values of different subband coefficients of Blue channel are modified using different scaling factors to embed the singular values of the watermark. The copy of the watermark is embedded into four subband coefficients which is very difficult to remove or destroy. The combinations of DWT and SVD increases the security, robustness and imperceptibility of the scheme.
{"title":"Non-blind watermarking scheme for color images in RGB space using DWT-SVD","authors":"Dr. Nagaraj V. Dharwadkar, B. B. Amberker, A. Gorai","doi":"10.1109/ICCSP.2011.5739368","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739368","url":null,"abstract":"Recent developments in digital image and Internet technology help the common users to easily produce illegal copies of the images. In order to solve the copyright protection problems of the image, several watermarking schemes have been widely used. Very few watermarking schemes have been proposed for defining the copyrights of color image. To resolve the copyright protection problem of color image, we propose an effective, robust and imperceptible color image watermarking scheme. This scheme embeds the watermark into cover image in (Red, Green, Blue) RGB space. The combinations of Discrete Wavelet Transformation (DWT) and Singular Value Decomposition (SVD) of Blue channel is used to embed the watermark. The singular values of different subband coefficients of Blue channel are modified using different scaling factors to embed the singular values of the watermark. The copy of the watermark is embedded into four subband coefficients which is very difficult to remove or destroy. The combinations of DWT and SVD increases the security, robustness and imperceptibility of the scheme.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115167758","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 : 2011-03-24DOI: 10.1109/ICCSP.2011.5739331
P. Shukla, V. Soni, Mithilesh Kumar
In this paper, nonrecursive digital filters design using 3-parameter Hyperbolic Cosine window (3-parameter Cosh window for short) is investigated. The 2-parameter Cosh window has been investigated in literature that is modified by introducing a new third parameter. The quality and performance of filter designed by proposed window are compared with the well-known adjustable windows in literature such as the ultraspherical, Saramaki, Kaiser, Dolph-Chebyshev, 2-parameter Cosh and Modified Kaiser window. Simulation results show that the filters designed by proposed 3-parameter Cosh window provide higher quality in terms of the minimum stopband attenuation for a fixed order, and yield lower order for a fix minimum stopband attenuation compared to the filters designed by other windows. The far-end stopband attenuation has more significance when the filtered signal has great concentration of spectral energy. In a sub-band coding, the filter is an intended to separate out various frequency bands for independent processing. In the case of speech, e.g. the far-end rejection of the energy in the stopband should be more so that the energy leak from one band to another is a minimum and the simulation results show that the filter designed by proposed window provides the maximum (better) far-end stopband attenuation that is figure of merit.
{"title":"Nonrecursive digital FIR filter design by 3-parameter Hyperbolic Cosine window: A high quality low order filter design","authors":"P. Shukla, V. Soni, Mithilesh Kumar","doi":"10.1109/ICCSP.2011.5739331","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739331","url":null,"abstract":"In this paper, nonrecursive digital filters design using 3-parameter Hyperbolic Cosine window (3-parameter Cosh window for short) is investigated. The 2-parameter Cosh window has been investigated in literature that is modified by introducing a new third parameter. The quality and performance of filter designed by proposed window are compared with the well-known adjustable windows in literature such as the ultraspherical, Saramaki, Kaiser, Dolph-Chebyshev, 2-parameter Cosh and Modified Kaiser window. Simulation results show that the filters designed by proposed 3-parameter Cosh window provide higher quality in terms of the minimum stopband attenuation for a fixed order, and yield lower order for a fix minimum stopband attenuation compared to the filters designed by other windows. The far-end stopband attenuation has more significance when the filtered signal has great concentration of spectral energy. In a sub-band coding, the filter is an intended to separate out various frequency bands for independent processing. In the case of speech, e.g. the far-end rejection of the energy in the stopband should be more so that the energy leak from one band to another is a minimum and the simulation results show that the filter designed by proposed window provides the maximum (better) far-end stopband attenuation that is figure of merit.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133258034","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 : 2011-03-24DOI: 10.1109/ICCSP.2011.5739309
R. Patachaianand, K. Sandrasegaran
Proportional fair (PF) scheduling can maximise the net throughput of multiuser systems with high fairness. Typically, the scheduling requires that knowledge of channel state information (CSI) from all users be made available to the transmitter. In this paper, a feedback reporting technique in which the feedback is limited to two bits per CSI command for multiuser systems with PF scheduling is proposed. Simulation results show that the proposed scheme can achieve the same net throughput as full-CSI case and significantly outperforms one-bit feedback scheme when the feedback thresholds are optimally selected to suit the system conditions while the feedback load is dramatically reduced compared with the full-CSI.
{"title":"Opportunistic feedback for proportional fair scheduling","authors":"R. Patachaianand, K. Sandrasegaran","doi":"10.1109/ICCSP.2011.5739309","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739309","url":null,"abstract":"Proportional fair (PF) scheduling can maximise the net throughput of multiuser systems with high fairness. Typically, the scheduling requires that knowledge of channel state information (CSI) from all users be made available to the transmitter. In this paper, a feedback reporting technique in which the feedback is limited to two bits per CSI command for multiuser systems with PF scheduling is proposed. Simulation results show that the proposed scheme can achieve the same net throughput as full-CSI case and significantly outperforms one-bit feedback scheme when the feedback thresholds are optimally selected to suit the system conditions while the feedback load is dramatically reduced compared with the full-CSI.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124396452","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 : 2011-03-24DOI: 10.1109/ICCSP.2011.5739410
C. Poongodi, K. Dineshkumar, D. Deenadhayalan, A. Shanmugam
This paper presents the simulated capacity results that could be achieved when echelon, H-shaped, V -shaped free standing dipoles and printed dipole arrays are used in the MIMO systems. As the configurations of interest, in this paper, have dipoles oriented in different directions, the channel model for multi-polarized antennas is used in the simulations. The polarization change at every scatterer is included using a dyad. The performances of arrays are evaluated using capacity as the metric. The mutual coupling between the dipoles of different orientations is also included to make simulation more realistic. Here we used Method of Moment (MOM) solution for the printed dipole mutual coupling impedance calculation.
{"title":"Capacity of echelon, H-shaped, V-shaped and printed dipole arrays in MIMO system","authors":"C. Poongodi, K. Dineshkumar, D. Deenadhayalan, A. Shanmugam","doi":"10.1109/ICCSP.2011.5739410","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739410","url":null,"abstract":"This paper presents the simulated capacity results that could be achieved when echelon, H-shaped, V -shaped free standing dipoles and printed dipole arrays are used in the MIMO systems. As the configurations of interest, in this paper, have dipoles oriented in different directions, the channel model for multi-polarized antennas is used in the simulations. The polarization change at every scatterer is included using a dyad. The performances of arrays are evaluated using capacity as the metric. The mutual coupling between the dipoles of different orientations is also included to make simulation more realistic. Here we used Method of Moment (MOM) solution for the printed dipole mutual coupling impedance calculation.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125138336","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 : 2011-03-24DOI: 10.1109/ICCSP.2011.5739308
P. Vardhan, K. Majumdar
Automatic detection of seizure in a continuous multichannel recording of EEG and ECoG has remained a challenging task even after more than three decades of research. Here we report that differential operator significantly accentuates the seizure part of depth electrode recordings (ECoG) relative to the non-seizure part. The success rate of detection by windowed variance method goes up considerably if the signal is treated with differential operator beforehand. In order to keep the false positive rate at the minimum a number of statistical checks have been introduced. Altogether they take only linear time and therefore well suited for real time applications. Detection on the same data with the same windowed variance method has also been performed using DB4 wavelet filtering instead of the differential operator (DB4 has been chosen from among Haar, DB1, DB2, DB3, DB4, DB5 and Morlet based on comparative study). It showed almost equal success but with higher time complexity.
{"title":"Automatic seizure detection in ECoG by DB4 wavelets and windowed variance: A comparison","authors":"P. Vardhan, K. Majumdar","doi":"10.1109/ICCSP.2011.5739308","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739308","url":null,"abstract":"Automatic detection of seizure in a continuous multichannel recording of EEG and ECoG has remained a challenging task even after more than three decades of research. Here we report that differential operator significantly accentuates the seizure part of depth electrode recordings (ECoG) relative to the non-seizure part. The success rate of detection by windowed variance method goes up considerably if the signal is treated with differential operator beforehand. In order to keep the false positive rate at the minimum a number of statistical checks have been introduced. Altogether they take only linear time and therefore well suited for real time applications. Detection on the same data with the same windowed variance method has also been performed using DB4 wavelet filtering instead of the differential operator (DB4 has been chosen from among Haar, DB1, DB2, DB3, DB4, DB5 and Morlet based on comparative study). It showed almost equal success but with higher time complexity.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129099294","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 : 2011-03-24DOI: 10.1109/ICCSP.2011.5739366
Mohammad Zia-Ur-Rahman, D. Reddy, Y. Sangeetha
Adaptive filter is a primary method to filter ECG signal, because it does not need the signal statistical characteristics. In this paper we present a novel adaptive filter for removing the artifacts from ECG signals based on Constrained Stability Least Mean Square (CSLMS) algorithm. This algorithm is derived based on the minimization of the squared Euclidean norm of the difference weight vector under a stability constraint defined over the posteriori estimation error. The adaptive filter essentially minimizes the mean-squared error between a primary input, which is the noisy ECG, and a reference input, which is either noise that is correlated in some way with the noise in the primary input or a signal that is correlated only with ECG in the primary input. Different filter structures are presented to eliminate the diverse forms of noise. Finally, we have applied this algorithm on ECG signals from the MIT-BIH data base and compared its performance with the conventional LMS algorithm. The results show that the performance of the CSLMS based algorithm is superior to that of the LMS based algorithm in noise reduction.
{"title":"Stationary and non-stationary noise removal from cardiac signals using a Constrained Stability Least Mean Square algorithm","authors":"Mohammad Zia-Ur-Rahman, D. Reddy, Y. Sangeetha","doi":"10.1109/ICCSP.2011.5739366","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739366","url":null,"abstract":"Adaptive filter is a primary method to filter ECG signal, because it does not need the signal statistical characteristics. In this paper we present a novel adaptive filter for removing the artifacts from ECG signals based on Constrained Stability Least Mean Square (CSLMS) algorithm. This algorithm is derived based on the minimization of the squared Euclidean norm of the difference weight vector under a stability constraint defined over the posteriori estimation error. The adaptive filter essentially minimizes the mean-squared error between a primary input, which is the noisy ECG, and a reference input, which is either noise that is correlated in some way with the noise in the primary input or a signal that is correlated only with ECG in the primary input. Different filter structures are presented to eliminate the diverse forms of noise. Finally, we have applied this algorithm on ECG signals from the MIT-BIH data base and compared its performance with the conventional LMS algorithm. The results show that the performance of the CSLMS based algorithm is superior to that of the LMS based algorithm in noise reduction.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134490725","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 : 2011-03-24DOI: 10.1109/ICCSP.2011.5739412
V. A. Shameena, Sarah Jacob, C. Aanandan, K. Vasudevan, P. Mohanan
A compact CPW-fed planar monopole antenna for ultra-wideband applications is presented and investigated. The proposed antenna with a small size of 20 mm ×26 mm × 1.6 mm is composed of a staircase shaped radiating element fed by a CPW feed line, and an inverted stair-style ground. The measured results agree reasonably with the simulated ones. The proposed antenna yields a wide bandwidth ranging from 3.1 to 11.4 GHz with return loss less than −10 dB with monopole like radiation pattern and stable antenna gain
提出并研究了一种适用于超宽带应用的小型cpw馈电平面单极天线。该天线的尺寸较小，为20 mm ×26 mm × 1.6 mm，由CPW馈线馈电的楼梯形辐射单元和倒楼梯式地面组成。实测结果与模拟结果吻合较好。该天线具有3.1 ~ 11.4 GHz的宽带宽，回波损耗小于- 10 dB，具有类似单极子的辐射方向图和稳定的天线增益
{"title":"A compact CPW fed serrated UWB antenna","authors":"V. A. Shameena, Sarah Jacob, C. Aanandan, K. Vasudevan, P. Mohanan","doi":"10.1109/ICCSP.2011.5739412","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739412","url":null,"abstract":"A compact CPW-fed planar monopole antenna for ultra-wideband applications is presented and investigated. The proposed antenna with a small size of 20 mm ×26 mm × 1.6 mm is composed of a staircase shaped radiating element fed by a CPW feed line, and an inverted stair-style ground. The measured results agree reasonably with the simulated ones. The proposed antenna yields a wide bandwidth ranging from 3.1 to 11.4 GHz with return loss less than −10 dB with monopole like radiation pattern and stable antenna gain","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133006276","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 : 2011-03-24DOI: 10.1109/ICCSP.2011.5739389
S. Kanade, P. Patil
Representative frames are vital and attractive key components in providing Internet users a way to swiftly browse a video clip in different levels of detail, without the need to view entire video clip. Past study reveals that several schemes have been developed for representative frame extraction however all schemes are not decorating the key frames. This paper proposes a new concept called Representative Frame Decoration (RFD), in which the essential operation is to enhance the key frame of a video shot. Our approach employs an unsharp mask filter to enhance contrast and sharpen edges of the elements without increasing noise or blemish. Experimental results of representative frames existing on internet illustrate the high performance of the proposed schemata.
{"title":"Representative Frame Decoration using unsharp filter in video summarization","authors":"S. Kanade, P. Patil","doi":"10.1109/ICCSP.2011.5739389","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739389","url":null,"abstract":"Representative frames are vital and attractive key components in providing Internet users a way to swiftly browse a video clip in different levels of detail, without the need to view entire video clip. Past study reveals that several schemes have been developed for representative frame extraction however all schemes are not decorating the key frames. This paper proposes a new concept called Representative Frame Decoration (RFD), in which the essential operation is to enhance the key frame of a video shot. Our approach employs an unsharp mask filter to enhance contrast and sharpen edges of the elements without increasing noise or blemish. Experimental results of representative frames existing on internet illustrate the high performance of the proposed schemata.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117207528","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 : 2011-03-24DOI: 10.1109/ICCSP.2011.5739298
N. Aravind, Abhinandan K, Vineeth V. Acharya, S. David
In this paper, we present a novel method for the acquisition and compression of hyperspectral images based on two concepts - distributed source coding and compressive sensing. Compressive sensing (CS) is a signal acquisition method that samples at sub Nyquist rates which is possible for signals that are sparse in some transform domain. Distributed source coding (DSC) is a method to encode correlated sources separately and decode them together in an attempt to shift complexity from the encoder to the decoder. Distributed compressive sensing (DCS) is a new framework suggested for jointly sparse signals which we apply to the correlated bands of hyperspectral images. We compressively sense each band of the hyperspectral image individually and can then recover the bands separately or using a joint recovery method. We use the Orthogonal Matching Pursuit (OMP) for individual recovery and Simultaneous Orthogonal Matching Pursuit (SOMP) for joint decoding and compare the two methods. The latter is shown to perform consistently better showing that the Distributed Compressive Sensing method that exploits the joint sparsity of the hyperspectral image is much better than individual recovery.
{"title":"Comparison of OMP and SOMP in the reconstruction of compressively sensed hyperspectral images","authors":"N. Aravind, Abhinandan K, Vineeth V. Acharya, S. David","doi":"10.1109/ICCSP.2011.5739298","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739298","url":null,"abstract":"In this paper, we present a novel method for the acquisition and compression of hyperspectral images based on two concepts - distributed source coding and compressive sensing. Compressive sensing (CS) is a signal acquisition method that samples at sub Nyquist rates which is possible for signals that are sparse in some transform domain. Distributed source coding (DSC) is a method to encode correlated sources separately and decode them together in an attempt to shift complexity from the encoder to the decoder. Distributed compressive sensing (DCS) is a new framework suggested for jointly sparse signals which we apply to the correlated bands of hyperspectral images. We compressively sense each band of the hyperspectral image individually and can then recover the bands separately or using a joint recovery method. We use the Orthogonal Matching Pursuit (OMP) for individual recovery and Simultaneous Orthogonal Matching Pursuit (SOMP) for joint decoding and compare the two methods. The latter is shown to perform consistently better showing that the Distributed Compressive Sensing method that exploits the joint sparsity of the hyperspectral image is much better than individual recovery.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114920511","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
扫码关注我们
求助内容：
应助结果提醒方式：