• Title/Summary/Keyword: sparse signals

Search Result 69, Processing Time 0.026 seconds

EMPIRICAL BAYES THRESHOLDING: ADAPTING TO SPARSITY WHEN IT ADVANTAGEOUS TO DO SO

  • Silverman Bernard W.
    • Journal of the Korean Statistical Society
    • /
    • v.36 no.1
    • /
    • pp.1-29
    • /
    • 2007
  • Suppose one is trying to estimate a high dimensional vector of parameters from a series of one observation per parameter. Often, it is possible to take advantage of sparsity in the parameters by thresholding the data in an appropriate way. A marginal maximum likelihood approach, within a suitable Bayesian structure, has excellent properties. For very sparse signals, the procedure chooses a large threshold and takes advantage of the sparsity, while for signals where there are many non-zero values, the method does not perform excessive smoothing. The scope of the method is reviewed and demonstrated, and various theoretical, practical and computational issues are discussed, in particularly exploring the wide potential and applicability of the general approach, and the way it can be used within more complex thresholding problems such as curve estimation using wavelets.

Analysis of Signal Recovery for Compressed Sensing using Deep Learning Technique (딥러닝 기술을 활용한 압축센싱 신호 복원방법 분석)

  • Seong, Jin-Taek
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.4
    • /
    • pp.257-267
    • /
    • 2017
  • Compressed Sensing(CS) deals with linear inverse problems. The theoretical results of CS have had an impact on inference problems and presented amazing research achievements in the related fields including signal processing and information theory. However, in order for CS to be applied in practical environments, there are two significant challenges to be solved. One is to guarantee in real time recovery of CS signals, and the other is that the signals have to be sparse. To this end, the latest researches using deep learning technology have emerged. In this paper, we consider CS problems based on deep learning and discuss the latest research results. And the approaches for CS signal reconstruction using deep learning show superior results in terms of recovery time and performance. It is expected that the approaches for CS reconstruction using deep learning shown in recent studies can not only raise the possibility of utilization of CS, but also be highly exploited in the fields of signal processing and communication areas.

Time Delay Estimation Using LASSO (Least Absolute Selection and Shrinkage Operator) (LASSO를 사용한 시간 지연 추정 알고리즘)

  • Lim, Jun-Seok;Pyeon, Yong-Guk;Choi, Seok-Im
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.10
    • /
    • pp.715-721
    • /
    • 2014
  • In decades, many researchers have studied the time delay estimation (TDE) method for the signals in the two different receivers. The channel estimation based TDE is one of the typical TDE methods. The channel estimation based TDE models the time delay between two receiving signals as an impulse response in a channel between two receivers. In general the impulse response becomes sparse. However, most conventional TDE algorithms cannot have utilized the sparsity. In this paper, we propose a TDE method taking the sparsity into consideration. The performance comparison shows that the proposed algorithm improves the estimation accuracy by 10 dB in the white gaussian source. In addition, even in the colored source, the proposed algorithm doesn't show the estimation threshold effect.

ME-based Emotion Recognition Model (ME 기반 감성 인식 모델)

  • Park, So-Young;Kim, Dong-Geun;Whang, Min-Cheol
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.985-987
    • /
    • 2010
  • In this paper, we propose a maximum entropy-based emotion recognition model using individual average difference. In order to accurately recognize an user' s emotion, the proposed model utilizes the difference between the average of the given input physiological signals and the average of each emotion state' signals rather than only the input signal. For the purpose of alleviating data sparse -ness, the proposed model substitutes two simple symbols such as +(positive number)/-(negative number) for every average difference value, and calculates the average of physiological signals based on a second rather than the longer total emotion response time. With the aim of easily constructing the model, it utilizes a simple average difference calculation technique and a maximum entropy model, one of well-known machine learning techniques.

  • PDF

Cyclic Shift Based Tone Reservation PAPR Reduction Scheme with Embedding Side Information for FBMC-OQAM Systems

  • Shi, Yongpeng;Xia, Yujie;Gao, Ya;Cui, Jianhua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.8
    • /
    • pp.2879-2899
    • /
    • 2021
  • The tone reservation (TR) scheme is an attractive method to reduce peak-to-average power ratio (PAPR) in the filter bank multicarrier with offset quadrature amplitude modulation (FBMC-OQAM) systems. However, the high PAPR of FBMC signal will severely degrades system performance. To address this issue, a cyclic shift based TR (CS-TR) scheme with embedding side information (SI) is proposed to reduce the PAPR of FBMC signals. At the transmitter, four candidate signals are first generated based on cyclic shift of the output of inverse discrete Fourier transform (IDFT), and the SI of the selected signal with minimum peak power among the four candidate signals is embedded in sparse symbols with quadrature phase-shift keying constellation. Then, the TR weighted by optimal scaling factor is employed to further reduce PAPR of the selected signal. At the receiver, a reliable SI detector is presented by determining the phase rotation of SI embedding symbols, and the transmitted data blocks can be correctly demodulated according to the detected SI. Simulation results show that the proposed scheme significantly outperforms the existing TR schemes in both PAPR reduction and bit error rate (BER) performances. In addition, the proposed scheme with detected SI can achieve the same BER performance compared to the one with perfect SI.

Performance of covariance matrix fitting-based direction-of-arrival estimation algorithm using compressed sensing in the frequency domain (주파수 영역에서 공분산 행렬 fitting 기반 압축센싱 도래각 추정 알고리즘의 성능)

  • Zhang, Xueyang;Paik, Ji Woong;Hong, Wooyoung;Ahn, Jae-Kyun;Kim, Seongil;Lee, Joon-Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.6
    • /
    • pp.394-400
    • /
    • 2017
  • This paper shows the extension of SpSF (Sparse Spectrum Fitting) algorithm, which is one of covariance matrix fitting-based DOA (Direction-of-Arrival) estimation algorithms, from the time domain to the frequency domain, and presents that SpSF can be implemented in the frequency domain. The superiority of the SpSF algorithm has been demonstrated by comparing DOA estimation performance with the performance of Conventional DOA estimation algorithm in the frequency domain for sinusoidal incident signals.

A Study on Adaptive Sparse Matrix Beamforming Algorithm of Error Beam Steering Vector for Target Estimation (목표물 추정을 위한 오차 빔 지향벡터의 적응 회소 행렬 빔형성 알고리즘 연구)

  • Kang, Kyoung Sik
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.7 no.2
    • /
    • pp.111-116
    • /
    • 2014
  • In this paper, we estimates the direction of arrival of desired a target using linear array antenna in wireless communication. Direction of arrival estimation is to estimate for desired target position among incident signals on receiver array antennas. This paper improved estimation of direction of arrival for target using optimum weight, high resolution adaptive beamforming algorithm, and sparse matrix for driection of arrival estimation. Through simulation, we showed that we are performance the analysis to compare general algorithm with proposed algorithm. We show that propose algorithm more improve for direction of estimation than general beamforming algorithm.

Performance of Image Reconstruction Techniques for Efficient Multimedia Transmission of Multi-Copter (멀티콥터의 효율적 멀티미디어 전송을 위한 이미지 복원 기법의 성능)

  • Hwang, Yu Min;Lee, Sun Yui;Lee, Sang Woon;Kim, Jin Young
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.4
    • /
    • pp.104-110
    • /
    • 2014
  • This paper considers two reconstruction schemes of structured-sparse signals, turbo inference and Markov chain Monte Carlo (MCMC) inference, in compressed sensing(CS) technique that is recently getting an important issue for an efficient video wireless transmission system using multi-copter as an unmanned aerial vehicle. Proposed reconstruction algorithms are setting importance on reduction of image data sizes, fast reconstruction speed and errorless reconstruction. As a result of experimentation with twenty kinds of images, we can find turbo reconstruction algorithm based on loopy belief propagation(BP) has more excellent performances than MCMC algorithm based on Gibbs sampling as aspects of average reconstruction computation time, normalized mean squared error(NMSE) values.

Direction of Arrival Estimation under Aliasing Conditions (앨리아싱 조건에서의 광대역 음향신호의 방위각 추정)

  • 윤병우
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.4 no.3
    • /
    • pp.1-6
    • /
    • 2003
  • It is difficult to detect and to track the moving targets like tanks and diesel vehicles due to the variety of terrain and moving of targets. It is possible to be happened the aliasing conditions as the difficulty of antenna deployment in the complex environment like the battle fields. In this paper, we study the problem of detecting and tracking of moving targets which are emitting wideband signals under severe spatial aliasing conditions because of the sparse arrays. We developed a direction of arrival(DOA) estimation algorithm based on subband MUSIC(Multiple Signal Classification) method which produces high-resolution estimation. In this algorithm, the true bearings are invariant regardless of changes of frequency bands while the aliased false bearings vary. As a result, the proposed algorithm overcomes the aliasing effects and improves the localization performance in sparse passive arrays.

  • PDF

A 95% accurate EEG-connectome Processor for a Mental Health Monitoring System

  • Kim, Hyunki;Song, Kiseok;Roh, Taehwan;Yoo, Hoi-Jun
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.4
    • /
    • pp.436-442
    • /
    • 2016
  • An electroencephalogram (EEG)-connectome processor to monitor and diagnose mental health is proposed. From 19-channel EEG signals, the proposed processor determines whether the mental state is healthy or unhealthy by extracting significant features from EEG signals and classifying them. Connectome approach is adopted for the best diagnosis accuracy, and synchronization likelihood (SL) is chosen as the connectome feature. Before computing SL, reconstruction optimizer (ReOpt) block compensates some parameters, resulting in improved accuracy. During SL calculation, a sparse matrix inscription (SMI) scheme is proposed to reduce the memory size to 1/24. From the calculated SL information, a small world feature extractor (SWFE) reduces the memory size to 1/29. Finally, using SLs or small word features, radial basis function (RBF) kernel-based support vector machine (SVM) diagnoses user's mental health condition. For RBF kernels, look-up-tables (LUTs) are used to replace the floating-point operations, decreasing the required operation by 54%. Consequently, The EEG-connectome processor improves the diagnosis accuracy from 89% to 95% in Alzheimer's disease case. The proposed processor occupies $3.8mm^2$ and consumes 1.71 mW with $0.18{\mu}m$ CMOS technology.