2014
DOI: 10.1109/tsp.2014.2329646
|View full text |Cite
|
Sign up to set email alerts
|

A Linear Source Recovery Method for Underdetermined Mixtures of Uncorrelated AR-Model Signals Without Sparseness

Abstract: Conventional sparseness-based approaches for instantaneous underdetermined blind source separation (UBSS) do not take into account the temporal structure of the source signals. In this work, we exploit the source temporal structure and propose a linear source recovery solution for the UBSS problem which does not require the source signals to be sparse. Assuming the source signals are uncorrelated and can be modeled by an autoregressive (AR) model, the proposed algorithm is able to estimate the source AR coeffi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
17
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(18 citation statements)
references
References 43 publications
1
17
0
Order By: Relevance
“…Multi-pass SAR images cannot be exactly equidistantly observed over time since the noise across the image stack is not related to the time order. As a consequence, the use of a time series model, commonly employed in statistical signal processing [28][29][30][31], may not be the most suitable approach to obtain a GSP, and, consequently, resulting in lower performance in a CDA. Additionally, the backscattering of the images in the stack is stable in time, i.e., a sequence of pixels for each position follows a similar pattern, and changes in such behavior are understood as outliers.…”
Section: Introductionmentioning
confidence: 99%
“…Multi-pass SAR images cannot be exactly equidistantly observed over time since the noise across the image stack is not related to the time order. As a consequence, the use of a time series model, commonly employed in statistical signal processing [28][29][30][31], may not be the most suitable approach to obtain a GSP, and, consequently, resulting in lower performance in a CDA. Additionally, the backscattering of the images in the stack is stable in time, i.e., a sequence of pixels for each position follows a similar pattern, and changes in such behavior are understood as outliers.…”
Section: Introductionmentioning
confidence: 99%
“…At present, there are two types of solutions to address this issue. The first type is based on the statistical properties of source signals, such as uncorrelated autoregressive (AR) model signals [19], nonnegative tensor factorization [20], and beamforming based on a minimum mean square error [21]. The second type is based on the analytical method of signal sparsity, which mainly includes chaotic matrix estimation and source signal restoration methods.…”
Section: Introductionmentioning
confidence: 99%
“…× 100% (19) where C 1 is the normal hiding image and C 2 is the hiding image when the value of one pixel in the original image is changed, M × N is the size of the hiding image. NPCR and UACI under the experimental data are shown in Table 2, indicating that the hiding scheme proposed in this paper can effectively resist differential attacks.…”
mentioning
confidence: 99%
“…Generally, BP methods expolit the 1 -norm minimization algorithm assuming the source signals (i.e. the rows of matrix S) are independent and identically distributed (i.i.d) [34,39] and their source recovery performance decreases with higher k. Actually, the most conventional USR algorithms like BP algorithm achieve a good separation performance for very high dimensional mixing system (m × n) and they fail when the mixing system dimension is low.…”
Section: Introductionmentioning
confidence: 99%