Hai Liu, Zhaoli Zhang, Sanya Liu, Jiangbo Shu, Tingting Liu
{"title":"Parametric spectral signal restoration via maximum entropy constraint and its application","authors":"Hai Liu, Zhaoli Zhang, Sanya Liu, Jiangbo Shu, Tingting Liu","doi":"10.1109/DSP-SPE.2015.7369579","DOIUrl":"https://doi.org/10.1109/DSP-SPE.2015.7369579","url":null,"abstract":"In this paper, we will propose a new framework which can estimate the desired signal and the instrument response function (IRF) simultaneously from the degraded spectral signal. Firstly, the spectral signal is considered as a distribution, thus, new entropy (called differential-entropy, DE) is defined to measure the distribution with a uniform distribution, which allows negative value existing. Moreover, the IRF is parametrically modeled as a Lorentzian function. Comparative results manifest that the proposed method outperforms the conventional methods on peak narrowing and noise suppression. The deconvolution IR spectrum is more convenient for extracting the spectral feature and interpreting the unknown chemical mixtures.","PeriodicalId":91992,"journal":{"name":"2015 IEEE Signal Processing and Signal Processing Education Workshop (SP/SPE)","volume":"48 1","pages":"353-357"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85550793","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}
{"title":"Using the IPython notebook as the computing platform for signals and systems courses","authors":"McKenna R. Lovejoy, M. Wickert","doi":"10.1109/DSP-SPE.2015.7369568","DOIUrl":"https://doi.org/10.1109/DSP-SPE.2015.7369568","url":null,"abstract":"The use of open-source Python as opposed to traditional computing platforms such MATLAB, Mathematica, and C/C++, is becoming more and more noticeable as all forms of opensource software develop. The Python user community itself is very vibrant, but what really stands out for those of us in signals and systems, is what is happening in the numerical computing side of Python. This paper will describe how in particular, the IPython notebook can be used as an analysis and simulation tool for teaching signals and systems courses. Specific code modules have been developed to augment existing Python code contained in the scipy.signal module. Case studies will be used to demonstrate the capabilities of the IPython notebook to augment lecture material with live calculations and simulations. Additionally, examples of how the IPython notebook has been successfully used by students for homework problems, computer projects and lab reports will be illustrated. Both student and industry team members in subcontract work, have responded favorably to the use of Python as an engineering problem solving platform.","PeriodicalId":91992,"journal":{"name":"2015 IEEE Signal Processing and Signal Processing Education Workshop (SP/SPE)","volume":"120 1","pages":"289-294"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78502971","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}
{"title":"Evaluating the performance of max current AC-DCT based colored digital image fusion for Visual Sensor Network's","authors":"Arun Begill, Shruti Puniani, Kamaljot Singh, Navjot Kaur","doi":"10.1109/DSP-SPE.2015.7369587","DOIUrl":"https://doi.org/10.1109/DSP-SPE.2015.7369587","url":null,"abstract":"This paper presents an efficient digital image fusion strategy that is created for Visual Sensor Networks(VSN's) to work in resource restricted, hazardous environments like battlefields. We aimed to use multiple partially unfocused colored images to develop a single multi-focus image using Discrete Cosine Transformation(DCT) depending on maximum value Alternating Current(AC) coefficients. This technique is beneficial in computation restricted environments of reduced computational powered devices to achieve image quality of higher degree. Our experiments shown that, the evaluated technique had produced better quality images as compared to other available methods of fusion in DCT domain.","PeriodicalId":91992,"journal":{"name":"2015 IEEE Signal Processing and Signal Processing Education Workshop (SP/SPE)","volume":"22 1","pages":"397-402"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82616077","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}
{"title":"Subspace smearing and interference mitigation with array radio telescopes","authors":"G. Hellbourg","doi":"10.1109/DSP-SPE.2015.7369566","DOIUrl":"https://doi.org/10.1109/DSP-SPE.2015.7369566","url":null,"abstract":"Array radio telescopes are suitable for the implementation of spatial filters. These filters present the advantage of canceling potential radio frequency interference (RFI) while recovering uncorrupted Time-Frequency data, of interest to astronomers. Although information regarding the sources of RFI can be a priori known or reliably inferred, the complexity of radio telescope systems randomizes the formulation of the subspace spanned by the RFI due to a lack of calibration or characterization. This knowledge is however necessary for building an efficient spatial filter, and needs therefore to be estimated.","PeriodicalId":91992,"journal":{"name":"2015 IEEE Signal Processing and Signal Processing Education Workshop (SP/SPE)","volume":"78 1","pages":"278-282"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86721237","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}
{"title":"Hands-on software defined radio experiments with the low-cost RTL-SDR dongle","authors":"M. Wickert, McKenna R. Lovejoy","doi":"10.1109/DSP-SPE.2015.7369529","DOIUrl":"https://doi.org/10.1109/DSP-SPE.2015.7369529","url":null,"abstract":"Software defined radio (SDR) is an exciting merger of digital signal processing and wideband radio hardware. The term SDR came into more common usage in 1992 by Dr. Joe Mitola, but actually had its beginnings back in 1984 at E-Systems. The ideal SDR receiver consists of an antenna connected to an analog-to-digital converter (ADC) followed by a digital signal processing system (DSPS) to extract the signal of interest. Low-cost, as in $20, SDR receivers originally designed for digital video broadcasting, have been available for several years. Giving undergraduate students hands-on experience in this area is needed. In this paper we describe the details of an SDR laboratory experiment for students in a first semester communications theory course. Complete open-source SDR receiver software is used to get started, then coding of DSP algorithms is explored to process captured radio signals generated using test equipment and then actual over-the-air broadcasts. Being able to write code to process live signals and then see and hear the results really connects with the students. Both Matlab and Python support code libraries are available.","PeriodicalId":91992,"journal":{"name":"2015 IEEE Signal Processing and Signal Processing Education Workshop (SP/SPE)","volume":"45 5","pages":"65-70"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91420062","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}
M. Barjenbruch, Franz Gritschneder, K. Dietmayer, J. Klappstein, J. Dickmann
{"title":"Memory efficient spectral estimation on parallel computing architectures","authors":"M. Barjenbruch, Franz Gritschneder, K. Dietmayer, J. Klappstein, J. Dickmann","doi":"10.1109/DSP-SPE.2015.7369576","DOIUrl":"https://doi.org/10.1109/DSP-SPE.2015.7369576","url":null,"abstract":"A method for spectral estimation is proposed. It is based on the multidimensional extensions of the RELAX algorithm. The fast Fourier transform is replaced by multiple Chirp-Z transforms. Each transform has a much shorter length than the transform in the original algorithm. This reduces the memory requirements significantly. At the same time a high degree of parallelism is preserved. A detailed analysis of the computational requirements is given. Finally, the proposed method is applied to automotive radar measurements. It is shown, that the multidimensional spectral estimation resolves multiple scattering centers on an extended object.","PeriodicalId":91992,"journal":{"name":"2015 IEEE Signal Processing and Signal Processing Education Workshop (SP/SPE)","volume":"12 1","pages":"337-340"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89269846","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}
{"title":"The performance limit for distributed Bayesian estimation with identical one-bit quantizers","authors":"Xia Li, Jun-hai Guo, Hao Chen, U. Rogers","doi":"10.1109/DSP-SPE.2015.7369521","DOIUrl":"https://doi.org/10.1109/DSP-SPE.2015.7369521","url":null,"abstract":"In this paper, a performance limit is derived for a distributed Bayesian parameter estimation problem in sensor networks where the prior probability density function of the parameter is known. The sensor observations are assumed conditionally independent and identically distributed given the parameter to be estimated, and the sensors employ independent and identical quantizers. The performance limit is established in terms of the best possible asymptotic performance that a distributed estimation scheme can achieve for all possible sensor observation models. This performance limit is obtained by deriving the optimal probabilistic quantizer under the ideal setting, where the sensors observe the parameter directly without any noise or distortion. With a uniform prior, the derived Bayesian performance limit and the associated quantizer are the same as the previous developed performance limit and quantizers under the minimax framework, where the parameter is assumed to be fixed but unknown. This proposed performance limit under distributed Bayesian setting is compared against a widely used performance bound that is based on full-precision sensor observations. This comparison shows that the performance limit derived in this paper is comparatively much tighter in most meaningful signalto- noise ratio (SNR) regions. Moreover, unlike the unquantized observations performance limit which can never be achieved, this performance limit can be achieved under certain noise observation models.","PeriodicalId":91992,"journal":{"name":"2015 IEEE Signal Processing and Signal Processing Education Workshop (SP/SPE)","volume":"1 1","pages":"19-24"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90971640","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}
{"title":"Relay misbehavior detection for robust diversity combining in cooperative communications","authors":"Tsang-Yi Wang, Po-Heng Chou, Wan-Jen Huang","doi":"10.1109/DSP-SPE.2015.7369550","DOIUrl":"https://doi.org/10.1109/DSP-SPE.2015.7369550","url":null,"abstract":"Most previous studies on cooperative communications assume that the relays operate normally and are trustworthy. However, this assumption may not always be true in practice. Accordingly, this study proposes a robust cooperative communication scheme in the physical layer for combating relay misbehavior. Two models for cooperative communications are considered, namely with direct path (WDP) and without direct path (WODP). For each model, a signal-correlation detection scheme is proposed in which the destination identifies the misbehaving relays within the network and then excludes their messages when performing diversity combining to infer the symbols of interest sent by the source. The proposed signal-correlation-detection rules are designed in such a way as to minimize the probability of error in identifying the misbehaving relays. The simulation results show that the proposed schemes yield an excellent detection performance in cooperative communication networks with relay misbehavior.","PeriodicalId":91992,"journal":{"name":"2015 IEEE Signal Processing and Signal Processing Education Workshop (SP/SPE)","volume":"9 1","pages":"184-189"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90309763","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}
{"title":"ON THE BLOCK-SPARSITY OF MULTIPLE-MEASUREMENT VECTORS.","authors":"Mohammad Shekaramiz, Todd K Moon, Jacob H Gunther","doi":"10.1109/DSP-SPE.2015.7369556","DOIUrl":"https://doi.org/10.1109/DSP-SPE.2015.7369556","url":null,"abstract":"<p><p>Based on the compressive sensing (CS) theory, it is possible to recover signals, which are either compressible or sparse under some suitable basis, via a small number of non-adaptive linear measurements. In this paper, we investigate recovering of block-sparse signals via multiple measurement vectors (MMVs) in the presence of noise. In this case, we consider one of the existing algorithms which provides a satisfactory estimate in terms of minimum mean-squared error but a non-sparse solution. Here, the algorithm is first modified to result in sparse solutions. Then, further modification is performed to account for the unknown block sparsity structure in the solution, as well. The performance of the proposed algorithm is demonstrated by experimental simulations and comparisons with some other algorithms for the sparse recovery problem.</p>","PeriodicalId":91992,"journal":{"name":"2015 IEEE Signal Processing and Signal Processing Education Workshop (SP/SPE)","volume":"2015 ","pages":"220-225"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/DSP-SPE.2015.7369556","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35636494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adaptive likelihood codebook reordering vector quantization for 1-D data sources","authors":"Chu Meh Chu, Nathan V. Parrish, David V. Anderson","doi":"10.1109/DSP-SPE.2015.7369536","DOIUrl":"https://doi.org/10.1109/DSP-SPE.2015.7369536","url":null,"abstract":"This paper outlines an adaptive extension of likelihood codebook reordering (LCR) vector quantization. By providing a method for allowing the vector quantization to adapt in a predetermined way, the codebook may be adaptively reordered to allow more efficient encoding by giving preference to encountered vectors in the dictionary. In particular, adaptation allows the trained dictionaries to be more efficient in representing specific data. The difference in the training and testing sets produces different transition matrices which are used to encode testing vectors. The adaptive likelihood codebook reordering vector quantization adapts the a priori transition matrix obtained from training data set to the testing data set on an online instantaneous basis. This method yields improvements in coding rate when entropy coding is applied to the reordered indices obtained from the adaptive version of the LCR algorithm.","PeriodicalId":91992,"journal":{"name":"2015 IEEE Signal Processing and Signal Processing Education Workshop (SP/SPE)","volume":"10 1","pages":"107-112"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81945862","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}