• Title/Summary/Keyword: compressive sensing (CS)

Search Result 47, Processing Time 0.023 seconds

압축센싱 소개

  • Lee, Heung-No;Park, Sang-Jun;Park, Sun-Cheol
    • The Magazine of the IEIE
    • /
    • v.38 no.1
    • /
    • pp.19-30
    • /
    • 2011
  • 최근에는 Compressive Sensing (CS)이라는 새로운 연구분야가 학계에서 많은 관심을 받고 있다. 이 분야는 2006년이후 신호처리 및 정보이론 학회를 중심으로 매우 빠르게 성장해 왔는데, 현재는 정보통신, 이메징, 센서 및 인스트루멘테이션 등 유관 분야로 영향력을 넓혀 가고 있다. 우리는 이러한 흐름의 원인을 다음 두 가지로 본다. 그 하나는 CS가 장기간에 걸쳐 연구되어온 탄탄한 이론적 토대 위에 그 근거를 두고 있어서 많은 학자들의 관심을 끌고 있는 점이다. 두 번째는, CS가 제시하는 방향이 현재 대학 및 산업계에서 가르치고 또 행하고 있는 디지털 신호취득 방식을 근본적으로 바꿀 수 있게 할 정도로 커다란 그림을 가르치고 있다는 점이다. 이러한 때에, 본 논문은 CS가 과연 무엇인지와 그것이 제시하고 있는 궁극적 목표를 소개하고자 한다. 또 CS를 이해하는데 필수적인 몇가지 기술적인 요소를 설명하고자 한다.

  • PDF

Improvement of Bandwidth Efficiency for High Transmission Capacity of Contents Streaming Data using Compressive Sensing Technique (컨텐츠 스트리밍 데이터의 전송효율 증대를 위한 압축센싱기반 전송채널 대역폭 절감기술 연구)

  • Jung, Eui-Suk;Lee, Yong-Tae;Han, Sang-Kook
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.3
    • /
    • pp.2141-2145
    • /
    • 2015
  • A new broadcasting signal transmission, which can save its channel bandwidth using compressive sensing(CS), is proposed in this paper. A new compression technique, which uses two dimensional discrete wavelet transform technique, is proposed to get high sparsity of multimedia image. A L1 minimization technique based on orthogonal matching pursuit is also introduced in order to reconstruct the compressed multimedia image. The CS enables us to save the channel bandwidth of wired and wireless broadcasting signal because various transmitted data are compressed using it. A $256{\times}256$ gray-scale image with compression rato of 20 %, which is sampled by 10 Gs/s, was transmitted to an optical receiver through 20-km optical transmission and then was reconstructed successfully using L1 minimization (bit error rate of $10^{-12}$ at the received optical power of -12.2 dB).

Improvement in the Channel Capacity in Visible Light Emitting Diodes using Compressive Sensing (압축센싱기법을 이용한 가시광 무선링크 전송용량 증가기술 연구)

  • Jung, Eui-Suk;Lee, Yong-Tae;Han, Sang-Kook
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.10
    • /
    • pp.6296-6302
    • /
    • 2014
  • A new technique, which can increase the channel bandwidth in an optical wireless orthogonal frequency division multiplexing (OFDM) link based on a light emitting diode (LED), is proposed. The technique uses adaptive sampling to convert an OFDM signal to a sparse waveform. In compressive sensing (CS), a sparse signal that is sampled below the Nyquist/Shannon limit can be reconstructed successively with sufficient measurements. The data rate of the proposed CS-based visible light communication (VLC)-OFDM link increases from 30.72 Mb/s to 51.2 Mb/s showing an error vector magnitude (EVM) of 31 % at the quadrature phase shift keying (QPSK) symbol.

A Time-Domain Equalization of OFDM Systems Using the OMP Algorithm (OMP 알고리즘을 이용한 OFDM 시스템의 시간 영역 등화기)

  • Moon, Woosik;Im, Sungbin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.9
    • /
    • pp.138-144
    • /
    • 2012
  • In this paper, we introduce the time-domain equalizer in orthogonal frequency division multiplexing (OFDM) systems using orthogonal matching pursuit (OMP) algorithm. Since OFDM system inserts guard intervals, it shows robust performance against multi-path fading. However, in Doppler channel, inter-carrier interference (ICI) occurs because an orthogonality of sub-carriers does not maintain. A least squares (LS) algorithm is common method of time-domain equalizer, but if a channel length is longer, the performance deteriorates by noise. The multi-path fading is a summation of the different delay signal. And that has sparse properties in time-domain. Because the OMP algorithm of the compressive sensing (CS) algorithm restores the channel by choosing the important elements of sparse channel, it can reduce the influence of noise. We simulate the performance of time-domain equalizer in OFDM system with various channel environments using OMP algorithm compared with other equalization method.

Generalized Orthogonal Matching Pursuit (일반화된 직교 매칭 퍼슛 알고리듬)

  • Kwon, Seok-Beop;Shim, Byong-Hyo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.2
    • /
    • pp.122-129
    • /
    • 2012
  • As a greedy algorithm reconstructing the sparse signal from underdetermined system, orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we present an extension of OMP for pursuing efficiency of the index selection. Our approach, referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple (N) columns are identified per step. Using the restricted isometry property (RIP), we derive the condition for gOMP to recover the sparse signal exactly. The gOMP guarantees to reconstruct sparse signal when the sensing matrix satisfies the RIP constant ${\delta}_{NK}$ < $\frac{\sqrt{N}}{\sqrt{K}+2\sqrt{N}}$. In addition, we show recovery performance and the reduced number of iteration required to recover the sparse signal.

Lifetime Escalation and Clone Detection in Wireless Sensor Networks using Snowball Endurance Algorithm(SBEA)

  • Sathya, V.;Kannan, Dr. S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1224-1248
    • /
    • 2022
  • In various sensor network applications, such as climate observation organizations, sensor nodes need to collect information from time to time and pass it on to the recipient of information through multiple bounces. According to field tests, this information corresponds to most of the energy use of the sensor hub. Decreasing the measurement of information transmission in sensor networks becomes an important issue.Compression sensing (CS) can reduce the amount of information delivered to the network and reduce traffic load. However, the total number of classification of information delivered using pure CS is still enormous. The hybrid technique for utilizing CS was proposed to diminish the quantity of transmissions in sensor networks.Further the energy productivity is a test task for the sensor nodes. However, in previous studies, a clustering approach using hybrid CS for a sensor network and an explanatory model was used to investigate the relationship between beam size and number of transmissions of hybrid CS technology. It uses efficient data integration techniques for large networks, but leads to clone attacks or attacks. Here, a new algorithm called SBEA (Snowball Endurance Algorithm) was proposed and tested with a bow. Thus, you can extend the battery life of your WSN by running effective copy detection. Often, multiple nodes, called observers, are selected to verify the reliability of the nodes within the network. Personal data from the source centre (e.g. personality and geographical data) is provided to the observer at the optional witness stage. The trust and reputation system is used to find the reliability of data aggregation across the cluster head and cluster nodes. It is also possible to obtain a mechanism to perform sleep and standby procedures to improve the life of the sensor node. The sniffers have been implemented to monitor the energy of the sensor nodes periodically in the sink. The proposed algorithm SBEA (Snowball Endurance Algorithm) is a combination of ERCD protocol and a combined mobility and routing algorithm that can identify the cluster head and adjacent cluster head nodes.This algorithm is used to yield the network life time and the performance of the sensor nodes can be increased.

Reconstructed Iimage Quality Improvement of Distributed Compressive Video Sensing Using Temporal Correlation (시간 상관관계를 이용한 분산 압축 비디오 센싱 기법의 복원 화질 개선)

  • Ryu, Joong-seon;Kim, Jin-soo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.22 no.2
    • /
    • pp.27-34
    • /
    • 2017
  • For The Purpose of Pursuing the Simplest Sampling, a Motion Compensated Block Compressed Sensing with Smoothed Projected Landweber (MC-BCS-SPL) has been Studied for an Effective Scheme of Distributed Compressive Video Sensing with all Compressed Sensing (CS) Frames. However, Conventional MC-BCS-SPL Scheme is Very Simple and so it Does not Provide Good Visual Qualities in Reconstructed Wyner-Ziv (WZ) Frames. In this Paper, the Conventional Scheme of MC-BCS-SPL is Modified to Provide Better Visual Qualities in WZ Frames. That is, the Proposed Agorithm is Designed in such a way that the Reference Frame may be Adaptively Selected Based on the Temporal Correlation Between Successive Frames. Several Experimental Results show that the Proposed Algorithm Provides Better Visual Qualities than Conventional Algorithm.

Space-Time Quantization and Motion-Aligned Reconstruction for Block-Based Compressive Video Sensing

  • Li, Ran;Liu, Hongbing;He, Wei;Ma, Xingpo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.321-340
    • /
    • 2016
  • The Compressive Video Sensing (CVS) is a useful technology for wireless systems requiring simple encoders but handling more complex decoders, and its rate-distortion performance is highly affected by the quantization of measurements and reconstruction of video frame, which motivates us to presents the Space-Time Quantization (ST-Q) and Motion-Aligned Reconstruction (MA-R) in this paper to both improve the performance of CVS system. The ST-Q removes the space-time redundancy in the measurement vector to reduce the amount of bits required to encode the video frame, and it also guarantees a low quantization error due to the fact that the high frequency of small values close to zero in the predictive residuals limits the intensity of quantizing noise. The MA-R constructs the Multi-Hypothesis (MH) matrix by selecting the temporal neighbors along the motion trajectory of current to-be-reconstructed block to improve the accuracy of prediction, and besides it reduces the computational complexity of motion estimation by the extraction of static area and 3-D Recursive Search (3DRS). Extensive experiments validate that the significant improvements is achieved by ST-Q in the rate-distortion as compared with the existing quantization methods, and the MA-R improves both the objective and the subjective quality of the reconstructed video frame. Combined with ST-Q and MA-R, the CVS system obtains a significant rate-distortion performance gain when compared with the existing CS-based video codecs.

A Study on the Formulation of High Resolution Range Profile and ISAR Image Using Sparse Recovery Algorithm (Sparse 복원 알고리즘을 이용한 HRRP 및 ISAR 영상 형성에 관한 연구)

  • Bae, Ji-Hoon;Kim, Kyung-Tae;Yang, Eun-Jung
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.25 no.4
    • /
    • pp.467-475
    • /
    • 2014
  • In this paper, we introduce a sparse recovery algorithm applied to a radar signal model, based on the compressive sensing(CS), for the formulation of the radar signatures, such as high-resolution range profile(HRRP) and ISAR(Inverse Synthetic Aperture Radar) image. When there exits missing data in observed RCS data samples, we cannot obtain correct high-resolution radar signatures with the traditional IDFT(Inverse Discrete Fourier Transform) method. However, high-resolution radar signatures using the sparse recovery algorithm can be successfully recovered in the presence of data missing and qualities of the recovered radar signatures are nearly comparable to those of radar signatures using a complete RCS data without missing data. Therefore, the results show that the sparse recovery algorithm rather than the DFT method can be suitably applied for the reconstruction of high-resolution radar signatures, although we collect incomplete RCS data due to unwanted interferences or jamming signals.

Modal parameter identification with compressed samples by sparse decomposition using the free vibration function as dictionary

  • Kang, Jie;Duan, Zhongdong
    • Smart Structures and Systems
    • /
    • v.25 no.2
    • /
    • pp.123-133
    • /
    • 2020
  • Compressive sensing (CS) is a newly developed data acquisition and processing technique that takes advantage of the sparse structure in signals. Normally signals in their primitive space or format are reconstructed from their compressed measurements for further treatments, such as modal analysis for vibration data. This approach causes problems such as leakage, loss of fidelity, etc., and the computation of reconstruction itself is costly as well. Therefore, it is appealing to directly work on the compressed data without prior reconstruction of the original data. In this paper, a direct approach for modal analysis of damped systems is proposed by decomposing the compressed measurements with an appropriate dictionary. The damped free vibration function is adopted to form atoms in the dictionary for the following sparse decomposition. Compared with the normally used Fourier bases, the damped free vibration function spans a space with both the frequency and damping as the control variables. In order to efficiently search the enormous two-dimension dictionary with frequency and damping as variables, a two-step strategy is implemented combined with the Orthogonal Matching Pursuit (OMP) to determine the optimal atom in the dictionary, which greatly reduces the computation of the sparse decomposition. The performance of the proposed method is demonstrated by a numerical and an experimental example, and advantages of the method are revealed by comparison with another such kind method using POD technique.