scholarly journals Background Modeling Based on Statistical Clustering Partitioning

2021 ◽  
Vol 2021 ◽  
pp. 1-28
Author(s):  
Biao Li ◽  
Xu Zhiyong ◽  
Jianlin Zhang ◽  
Xiangru Wang ◽  
Xiangsuo Fan

In order to effectively detect dim-small targets in complex scenes, background suppression is applied to highlight the targets. This paper presents a statistical clustering partitioning low-rank background modeling algorithm (SCPLBMA), which clusters the image into several patches based on image statistics. The image matrix of each patch is decomposed into low-rank matrix and sparse matrix in the SCPLBMA. The background of the original video frames is reconstructed from the low-rank matrices, and the targets can be obtained by subtracting the background. Experiments on different scenes show that the SCPLBMA can effectively suppress the background and textures and equalize the residual noise with gray levels significantly lower than that of the targets. Thus, the difference images obtain good stationary characteristics, and the contrast between the targets and the residual backgrounds is significantly improved. Compared with six other algorithms, the SCPLBMA significantly improved the target detection rates of single-frame threshold segmentation.

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Fan Xiangsuo ◽  
Xu Zhiyong

In order to improve the detection ability of dim and small targets in dynamic scenes, this paper first proposes an anisotropic gradient background modeling method combined with spatial and temporal information and then uses the multidirectional gradient maximum of neighborhood blocks to segment the difference maps. On the basis of previous background modeling and segmentation extraction candidate targets, a dim small target detection algorithm for local energy aggregation degree of sequence images is proposed. Experiments show that compared with the traditional algorithm, this method can eliminate the interference of noise to the target and improve the detection ability of the system effectively.


2014 ◽  
Vol 635-637 ◽  
pp. 1056-1059 ◽  
Author(s):  
Bao Yan Wang ◽  
Xin Gang Wang

Key and difficult points of background subtraction method lie in looking for an ideal background modeling under complex scene. Stacking the individual frames as columns of a big matrix, background parts can be viewed as a low-rank background matrix because of large similarity among individual frames, yet foreground parts can be viewed as a sparse matrix as foreground parts play a small role in individual frames. Thus the process of video background modeling is in fact a process of low-rank matrix recovery. Background modeling based on low-rank matrix recovery can separate foreground images from background at the same time without pre-training samples, besides, the approach is robust to illumination changes. However, there exist some shortcomings in background modeling based on low-rank matrix recovery by analyzing numerical experiments, which is developed from three aspects.


2016 ◽  
Vol 41 (2) ◽  
pp. 245-254 ◽  
Author(s):  
Chengli Sun ◽  
Jianxiao Xie ◽  
Yan Leng

Abstract Subspace-based methods have been effectively used to estimate enhanced speech from noisy speech samples. In the traditional subspace approaches, a critical step is splitting of two invariant subspaces associated with signal and noise via subspace decomposition, which is often performed by singular-value decomposition or eigenvalue decomposition. However, these decomposition algorithms are highly sensitive to the presence of large corruptions, resulting in a large amount of residual noise within enhanced speech in low signal-to-noise ratio (SNR) situations. In this paper, a joint low-rank and sparse matrix decomposition (JLSMD) based subspace method is proposed for speech enhancement. In the proposed method, we firstly structure the corrupted data as a Toeplitz matrix and estimate its effective rank value for the underlying clean speech matrix. Then the subspace decomposition is performed by means of JLSMD, where the decomposed low-rank part corresponds to enhanced speech and the sparse part corresponds to noise signal, respectively. An extensive set of experiments have been carried out for both of white Gaussian noise and real-world noise. Experimental results show that the proposed method performs better than conventional methods in many types of strong noise conditions, in terms of yielding less residual noise and lower speech distortion.


2018 ◽  
Vol 32 (22) ◽  
pp. 1850262 ◽  
Author(s):  
Nasir Saleem ◽  
Muhammad Irfan Khattak

An important stage in speech enhancement is to estimate noise signal which is a difficult task in non-stationary and low signal-to-noise conditions. This paper presents an iterative speech enhancement approach which requires no prior knowledge of noise and is based on low-rank sparse matrix decomposition using Gammatone filterbank and convex distortion measure. To estimate noise and speech, the noisy speech is decomposed into low-rank noise and sparse-speech parts by enforcing sparsity regularization. The exact distribution of noise signals and noise estimator is not required in this approach. The experimental results demonstrate that our approach outperforms competing methods and yields better overall speech quality and intelligibility. Moreover, composite objective measure reinforced a better performance in terms of residual noise and speech distortion in adverse noisy conditions. The time-varying spectral analysis validates significant reduction of the background noise.


Author(s):  
Qiwei Chen ◽  
Cheng Wu ◽  
Yiming Wang

A method based on Robust Principle Component Analysis (RPCA) technique is proposed to detect small targets in infrared images. Using the low rank characteristic of background and the sparse characteristic of target, the observed image is regarded as the sum of a low-rank background matrix and a sparse outlier matrix, and then the decomposition is solved by the RPCA. The infrared small target is extracted from the single-frame image or multi-frame sequence. In order to get more efficient algorithm, the iteration process in the augmented Lagrange multiplier method is improved. The simulation results show that the method can detect out the small target precisely and efficiently.


Author(s):  
Sampurna Biswas ◽  
Sunrita Poddar ◽  
Soura Dasgupta ◽  
Raghuraman Mudumbai ◽  
Mathews Jacob

Sign in / Sign up

Export Citation Format

Share Document