• Title/Summary/Keyword: Exploiting Sparsity

Search Result 11, Processing Time 0.021 seconds

Low Dimensional Multiuser Detection Exploiting Low User Activity

  • Lee, Junho;Lee, Seung-Hwan
    • Journal of Communications and Networks
    • /
    • v.15 no.3
    • /
    • pp.283-291
    • /
    • 2013
  • In this paper, we propose new multiuser detectors (MUDs) based on compressed sensing approaches for the large-scale multiple antenna systems equipped with dozens of low-power antennas. We consider the scenarios where the number of receiver antennas is smaller than the total number of users, but the number of active users is relatively small. This prior information motivates sparsity-embracing MUDs such as sparsity-embracing linear/nonlinear MUDs where the detection of active users and their symbol detection are employed. In addition, sparsity-embracing MUDs with maximum a posteriori probability criterion (MAP-MUDs) are presented. They jointly detect active users and their symbols by exploiting the probability of user activity, and it can be solved efficiently by introducing convex relaxing senses. Furthermore, it is shown that sparsity-embracing MUDs exploiting common users' activity across multiple symbols, i.e., frame-by-frame, can be considered to improve performance. Also, in multiple multiple-input and multiple-output networks with aggressive frequency reuse, we propose the interference cancellation strategy for the proposed sparsity-embracing MUDs. That first cancels out the interference induced by adjacent networks and then recovers the desired users' information by exploiting the low user activity. In simulation studies for binary phase shift keying modulation, numerical evidences establish the effectiveness of our proposed MUDs exploiting low user activity, as compared with the conventional MUD.

Efficient Solving Methods Exploiting Sparsity of Matrix in Real-Time Multibody Dynamic Simulation with Relative Coordinate Formulation

  • Choi, Gyoojae;Yoo, Yungmyun;Im, Jongsoon
    • Journal of Mechanical Science and Technology
    • /
    • v.15 no.8
    • /
    • pp.1090-1096
    • /
    • 2001
  • In this paper, new methods for efficiently solving linear acceleration equations of multibody dynamic simulation exploiting sparsity for real-time simulation are presented. The coefficient matrix of the equations tends to have a large number of zero entries according to the relative joint coordinate numbering. By adequate joint coordinate numbering, the matrix has minimum off-diagonal terms and a block pattern of non-zero entries and can be solved efficiently. The proposed methods, using sparse Cholesky method and recursive block mass matrix method, take advantages of both the special structure and the sparsity of the coefficient matrix to reduce computation time. The first method solves the η$\times$η sparse coefficient matrix for the accelerations, where η denotes the number of relative coordinates. In the second method, for vehicle dynamic simulation, simple manipulations bring the original problem of dimension η$\times$η to an equivalent problem of dimension 6$\times$6 to be solved for the accelerations of a vehicle chassis. For vehicle dynamic simulation, the proposed solution methods are proved to be more efficient than the classical approaches using reduced Lagrangian multiplier method. With the methods computation time for real-time vehicle dynamic simulation can be reduced up to 14 per cent compared to the classical approach.

  • PDF

Compressed Sensing Based Dynamic MR Imaging: A Short Survey (Compressed Sensing 기법을 이용한 Dynamic MR Imaging)

  • Jung, Hong;Ye, Jong-Chul
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.5
    • /
    • pp.25-31
    • /
    • 2009
  • The recently developed sampling theory, "compressed sensing" is gathering huge interest in MR reconstruction area because of its feasibility of high spatio-temporal resolution of dynamic MRI which has been limited in conventional methods based on Nyquist sampling theory. Since dynamic MRI usually has high redundant information along temporal direction, this can be very sparsely represented in most of cases. Therefore, compressed sensing that exploits the sparsity of unknown images can be effectively applied in most of dynamic MRI. This review article briefly introduces currently proposed compressed sensing based dynamic MR imaging algorithms and other methods exploiting sparsity. By comparing them with conventional methods, you may have insight how the compressed sensing based methods can impact nearly every area of clinical dynamic MRI.

Image Denoising for Metal MRI Exploiting Sparsity and Low Rank Priors

  • Choi, Sangcheon;Park, Jun-Sik;Kim, Hahnsung;Park, Jaeseok
    • Investigative Magnetic Resonance Imaging
    • /
    • v.20 no.4
    • /
    • pp.215-223
    • /
    • 2016
  • Purpose: The management of metal-induced field inhomogeneities is one of the major concerns of distortion-free magnetic resonance images near metallic implants. The recently proposed method called "Slice Encoding for Metal Artifact Correction (SEMAC)" is an effective spin echo pulse sequence of magnetic resonance imaging (MRI) near metallic implants. However, as SEMAC uses the noisy resolved data elements, SEMAC images can have a major problem for improving the signal-to-noise ratio (SNR) without compromising the correction of metal artifacts. To address that issue, this paper presents a novel reconstruction technique for providing an improvement of the SNR in SEMAC images without sacrificing the correction of metal artifacts. Materials and Methods: Low-rank approximation in each coil image is first performed to suppress the noise in the slice direction, because the signal is highly correlated between SEMAC-encoded slices. Secondly, SEMAC images are reconstructed by the best linear unbiased estimator (BLUE), also known as Gauss-Markov or weighted least squares. Noise levels and correlation in the receiver channels are considered for the sake of SNR optimization. To this end, since distorted excitation profiles are sparse, $l_1$ minimization performs well in recovering the sparse distorted excitation profiles and the sparse modeling of our approach offers excellent correction of metal-induced distortions. Results: Three images reconstructed using SEMAC, SEMAC with the conventional two-step noise reduction, and the proposed image denoising for metal MRI exploiting sparsity and low rank approximation algorithm were compared. The proposed algorithm outperformed two methods and produced 119% SNR better than SEMAC and 89% SNR better than SEMAC with the conventional two-step noise reduction. Conclusion: We successfully demonstrated that the proposed, novel algorithm for SEMAC, if compared with conventional de-noising methods, substantially improves SNR and reduces artifacts.

Compressive Sensing-Based L1-SVD DOA Estimation (압축센싱기법 기반 L1-SVD 도래각 추정)

  • Cho, Yunseong;Paik, Ji-Woong;Lee, Joon-Ho;Ko, Yo Han;Cho, Sung-Woo
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.27 no.4
    • /
    • pp.388-394
    • /
    • 2016
  • There have been many studies on the direction-of-arrival(DOA) estimation algorithm using antenna arrays. Beamforming, Capon's method, maximum likelihood, MUSIC algorithms are the main algorithms for the DOA estimation. Recently, compressive sensing-based DOA estimation algorithm exploiting the sparsity of the incident signals has attracted much attention in the signal processing community. In this paper, the performance of the L1-SVD algorithm, which is based on fitting of the data matrix, is compared with that of the MUSIC algorithm.

상하분해 단체법에서 수정 Forrest-Tomlin 방법의 효율적인 구현

  • 김우제;임성묵;박순달
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.63-66
    • /
    • 1998
  • In the implementation of the simplex method program, the representation and the maintenance of basis matrix is very important, In the experimental study, we investigates Suhl's idea in the LU factorization and LU update of basis matrix. First, the triangularization of basis matrix is implemented and its efficiency is shown. Second, various technique in the dynamic Markowitz's ordering and threshold pivoting are presented. Third, modified Forrest-Tomlin LU update method exploiting sparsity is presented. Fourth, as a storage scheme of LU factors, Gustavson data structure is explained. Fifth, efficient timing of reinversion is developed. Finally, we show that modified Forrest-Tomlin method with Gustavson data structure is superior more than 30% to the Reid method with linked list data structure.

  • PDF

Tucker Modeling based Kronecker Constrained Block Sparse Algorithm

  • Zhang, Tingping;Fan, Shangang;Li, Yunyi;Gui, Guan;Ji, Yimu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.657-667
    • /
    • 2019
  • This paper studies synthetic aperture radar (SAR) imaging problem which the scatterers are often distributed in block sparse pattern. To exploiting the sparse geometrical feature, a Kronecker constrained SAR imaging algorithm is proposed by combining the block sparse characteristics with the multiway sparse reconstruction framework with Tucker modeling. We validate the proposed algorithm via real data and it shows that the our algorithm can achieve better accuracy and convergence than the reference methods even in the demanding environment. Meanwhile, the complexity is smaller than that of the existing methods. The simulation experiments confirmed the effectiveness of the algorithm as well.

Group-Sparse Channel Estimation using Bayesian Matching Pursuit for OFDM Systems

  • Liu, Yi;Mei, Wenbo;Du, Huiqian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.583-599
    • /
    • 2015
  • We apply the Bayesian matching pursuit (BMP) algorithm to the estimation of time-frequency selective channels in orthogonal frequency division multiplexing (OFDM) systems. By exploiting prior statistics and sparse characteristics of propagation channels, the Bayesian method provides a more accurate and efficient detection of the channel status information (CSI) than do conventional sparse channel estimation methods that are based on compressive sensing (CS) technologies. Using a reasonable approximation of the system model and a skillfully designed pilot arrangement, the proposed estimation scheme is able to address the Doppler-induced inter-carrier interference (ICI) with a relatively low complexity. Moreover, to further reduce the computational cost of the channel estimation, we make some modifications to the BMP algorithm. The modified algorithm can make good use of the group-sparse structure of doubly selective channels and thus reconstruct the CSI more efficiently than does the original BMP algorithm, which treats the sparse signals in the conventional manner and ignores the specific structure of their sparsity patterns. Numerical results demonstrate that the proposed Bayesian estimation has a good performance over rapidly time-varying channels.

A Tree Regularized Classifier-Exploiting Hierarchical Structure Information in Feature Vector for Human Action Recognition

  • Luo, Huiwu;Zhao, Fei;Chen, Shangfeng;Lu, Huanzhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1614-1632
    • /
    • 2017
  • Bag of visual words is a popular model in human action recognition, but usually suffers from loss of spatial and temporal configuration information of local features, and large quantization error in its feature coding procedure. In this paper, to overcome the two deficiencies, we combine sparse coding with spatio-temporal pyramid for human action recognition, and regard this method as the baseline. More importantly, which is also the focus of this paper, we find that there is a hierarchical structure in feature vector constructed by the baseline method. To exploit the hierarchical structure information for better recognition accuracy, we propose a tree regularized classifier to convey the hierarchical structure information. The main contributions of this paper can be summarized as: first, we introduce a tree regularized classifier to encode the hierarchical structure information in feature vector for human action recognition. Second, we present an optimization algorithm to learn the parameters of the proposed classifier. Third, the performance of the proposed classifier is evaluated on YouTube, Hollywood2, and UCF50 datasets, the experimental results show that the proposed tree regularized classifier obtains better performance than SVM and other popular classifiers, and achieves promising results on the three datasets.

A selective sparse coding based fast super-resolution method for a side-scan sonar image (선택적 sparse coding 기반 측면주사 소나 영상의 고속 초해상도 복원 알고리즘)

  • Park, Jaihyun;Yang, Cheoljong;Ku, Bonwha;Lee, Seungho;Kim, Seongil;Ko, Hanseok
    • The Journal of the Acoustical Society of Korea
    • /
    • v.37 no.1
    • /
    • pp.12-20
    • /
    • 2018
  • Efforts have been made to reconstruct low-resolution underwater images to high-resolution ones by using the image SR (Super-Resolution) method, all to improve efficiency when acquiring side-scan sonar images. As side-scan sonar images are similar with the optical images with respect to exploiting 2-dimensional signals, conventional image restoration methods for optical images can be considered as a solution. One of the most typical super-resolution methods for optical image is a sparse coding and there are studies for verifying applicability of sparse coding method for underwater images by analyzing sparsity of underwater images. Sparse coding is a method that obtains recovered signal from input signal by linear combination of dictionary and sparse coefficients. However, it requires huge computational load to accurately estimate sparse coefficients. In this study, a sparse coding based underwater image super-resolution method is applied while a selective reconstruction method for object region is suggested to reduce the processing time. For this method, this paper proposes an edge detection and object and non object region classification method for underwater images and combine it with sparse coding based image super-resolution method. Effectiveness of the proposed method is verified by reducing the processing time for image reconstruction over 32 % while preserving same level of PSNR (Peak Signal-to-Noise Ratio) compared with conventional method.