• Title/Summary/Keyword: Sparse decomposition

Search Result 48, Processing Time 0.029 seconds

Speaker Localization in Reverberant Environments Using Sparse Priors on Acoustic Channels (음향 채널의 '성김' 특성을 이용한 반향환경에서의 화자 위치 탐지)

  • Cho, Ji-Won;Park, Hyung-Min
    • MALSORI
    • /
    • no.67
    • /
    • pp.135-147
    • /
    • 2008
  • In this paper, we propose a method for source localization in reverberant environments based on an adaptive eigenvalue decomposition (AED) algorithm which directly estimates channel impulse responses from a speaker to microphones. Unfortunately, the AED algorithm may suffer from whitening effects on channels estimated from temporally correlated natural sounds. The proposed method which applies sparse priors to the estimated channels can avoid the temporal whitening and improve the performance of source localization in reverberant environments. Experimental results show the effectiveness of the proposed method.

  • 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.

A domain decomposition method applied to queuing network problems

  • Park, Pil-Seong
    • Communications of the Korean Mathematical Society
    • /
    • v.10 no.3
    • /
    • pp.735-750
    • /
    • 1995
  • We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.

  • PDF

ITERATIVE ALGORITHMS AND DOMAIN DECOMPOSITION METHODS IN PARTIAL DIFFERENTIAL EQUATIONS

  • Lee, Jun Yull
    • Korean Journal of Mathematics
    • /
    • v.13 no.1
    • /
    • pp.113-122
    • /
    • 2005
  • We consider the iterative schemes for the large sparse linear system to solve partial differential equations. Using spectral radius of iteration matrices, the optimal relaxation parameters and good parameters can be obtained. With those parameters we compare the effectiveness of the SOR and SSOR algorithms. Applying Crank-Nicolson approximation, we observe the error distribution according to domain decomposition. The number of processors due to domain decomposition affects time and error. Numerical experiments show that effectiveness of SOR and SSOR can be reversed as time size varies, which is not the usual case. Finally, these phenomena suggest conjectures about equilibrium time grid for SOR and SSOR.

  • PDF

Block Sparse Low-rank Matrix Decomposition based Visual Defect Inspection of Rail Track Surfaces

  • Zhang, Linna;Chen, Shiming;Cen, Yigang;Cen, Yi;Wang, Hengyou;Zeng, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.6043-6062
    • /
    • 2019
  • Low-rank matrix decomposition has shown its capability in many applications such as image in-painting, de-noising, background reconstruction and defect detection etc. In this paper, we consider the texture background of rail track images and the sparse foreground of the defects to construct a low-rank matrix decomposition model with block sparsity for defect inspection of rail tracks, which jointly minimizes the nuclear norm and the 2-1 norm. Similar to ADM, an alternative method is proposed in this study to solve the optimization problem. After image decomposition, the defect areas in the resulting low-rank image will form dark stripes that horizontally cross the entire image, indicating the preciselocations of the defects. Finally, a two-stage defect extraction method is proposed to locate the defect areas. The experimental results of the two datasets show that our algorithm achieved better performance compared with other methods.

Dynamic Synchronous Phasor Measurement Algorithm Based on Compressed Sensing

  • Yu, Huanan;Li, Yongxin;Du, Yao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.1
    • /
    • pp.53-76
    • /
    • 2020
  • The synchronous phasor measurement algorithm is the core content of the phasor measurement unit. This manuscript proposes a dynamic synchronous phasor measurement algorithm based on compressed sensing theory. First, a dynamic signal model based on the Taylor series was established. The dynamic power signal was preprocessed using a least mean square error adaptive filter to eliminate interference from noise and harmonic components. A Chirplet overcomplete dictionary was then designed to realize a sparse representation. A reduction of the signal dimension was next achieved using a Gaussian observation matrix. Finally, the improved orthogonal matching pursuit algorithm was used to realize the sparse decomposition of the signal to be detected, the amplitude and phase of the original power signal were estimated according to the best matching atomic parameters, and the total vector error index was used for an error evaluation. Chroma 61511 was used for the output of various signals, the simulation results of which show that the proposed algorithm cannot only effectively filter out interference signals, it also achieves a better dynamic response performance and stability compared with a traditional DFT algorithm and the improved DFT synchronous phasor measurement algorithm, and the phasor measurement accuracy of the signal is greatly improved. In practical applications, the hardware costs of the system can be further reduced.

Fast Hybrid Transform: DCT-II/DFT/HWT

  • Xu, Dan-Ping;Shin, Dae-Chol;Duan, Wei;Lee, Moon-Ho
    • Journal of Broadcast Engineering
    • /
    • v.16 no.5
    • /
    • pp.782-792
    • /
    • 2011
  • In this paper, we address a new fast DCT-II/DFT/HWT hybrid transform architecture for digital video and fusion mobile handsets based on Jacket-like sparse matrix decomposition. This fast hybrid architecture is consist of source coding standard as MPEG-4, JPEG 2000 and digital filtering discrete Fourier transform, and has two operations: one is block-wise inverse Jacket matrix (BIJM) for DCT-II, and the other is element-wise inverse Jacket matrix (EIJM) for DFT/HWT. They have similar recursive computational fashion, which mean all of them can be decomposed to Kronecker products of an identity Hadamard matrix and a successively lower order sparse matrix. Based on this trait, we can develop a single chip of fast hybrid algorithm architecture for intelligent mobile handsets.

SAR Image De-noising Based on Residual Image Fusion and Sparse Representation

  • Ma, Xiaole;Hu, Shaohai;Yang, Dongsheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3620-3637
    • /
    • 2019
  • Since the birth of Synthetic Aperture Radar (SAR), it has been widely used in the military field and so on. However, the existence of speckle noise makes a good deal inconvenience for the subsequent image processing. The continuous development of sparse representation (SR) opens a new field for the speckle suppressing of SAR image. Although the SR de-noising may be effective, the over-smooth phenomenon still has bad influence on the integrity of the image information. In this paper, one novel SAR image de-noising method based on residual image fusion and sparse representation is proposed. Firstly we can get the similar block groups by the non-local similar block matching method (NLS-BM). Then SR de-noising based on the adaptive K-means singular value decomposition (K-SVD) is adopted to obtain the initial de-noised image and residual image. The residual image is processed by Shearlet transform (ST), and the corresponding de-noising methods are applied on it. Finally, in ST domain the low-frequency and high-frequency components of the initial de-noised and residual image are fused respectively by relevant fusion rules. The final de-noised image can be recovered by inverse ST. Experimental results show the proposed method can not only suppress the speckle effectively, but also save more details and other useful information of the original SAR image, which could provide more authentic and credible records for the follow-up image processing.

Subband Sparse Adaptive Filter for Echo Cancellation in Digital Hearing Aid Vent (디지털 보청기 벤트 반향제거를 위한 부밴드 성긴 적응필터)

  • Bae, Hyeonl-Deok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.5
    • /
    • pp.538-542
    • /
    • 2018
  • Echo generated in digital hearing aid vent give rise to user's discomfort. For cancelling feedback echo in vent, it is required to estimate vent impulse response exactly. The vent impulse response has time varying and sparse characteristics. The IPNLMS has been known a useful adaptive algorithm to estimate vent impulse response with these characteristics. In this paper, subband sparse adaptive filter which applying IPNLMS to subband hearing aid structure is proposed to cancel echo of vent by estimating sparse vent impulse response. In the propose method, the decomposition of input signal to subband can pre-whiten each subband signal, so adaptive filter convergence speed can be improved. And the poly phase component decomposition of adaptive filter increases sparsity of each components, and the better echo cancellation can be possible without additional computation. To derive coefficients update equation of the adaptive filter, by defining the cost function based weight NLMS is defined, and the coefficient update equation of each subband is derived. For verifying performances of the adaptive filter, convergence speed, and steady state error by white signal input, and echo cancelling results by real speech input are evaluated by comparing conventional adaptive filters.

Decomposition of Interference Hyperspectral Images Based on Split Bregman Iteration

  • Wen, Jia;Geng, Lei;Wang, Cailing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.3338-3355
    • /
    • 2018
  • Images acquired by Large Aperture Static Imaging Spectrometer (LASIS) exhibit obvious interference stripes, which are vertical and stationary due to the special imaging principle of interference hyperspectral image (IHI) data. As the special characteristics above will seriously affect the intrinsic structure and sparsity of IHI, decomposition of IHI has drawn considerable attentions of many scientists and lots of efforts have been made. Although some decomposition methods for interference hyperspectral data have been proposed to solve the above problem of interference stripes, too many times of iteration are necessary to get an optimal solution, which will severely affect the efficiency of application. A novel algorithm for decomposition of interference hyperspectral images based on split Bregman iteration is proposed in this paper, compared with other decomposition methods, numerical experiments have proved that the proposed method will be much more efficient and can reduce the times of iteration significantly.