2010
DOI: 10.1007/s11045-010-0129-9
|View full text |Cite
|
Sign up to set email alerts
|

Two-dimensional digital filters with sparse coefficients

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
65
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 52 publications
(65 citation statements)
references
References 10 publications
0
65
0
Order By: Relevance
“…They showed that the stability of 2-D discrete systems can be guaranteed if there are some matrices satisfying a certain linear matrix inequality (LMIs). The controller and filter design problems have been addressed in Du et al (2000), Gao et al (2004), Liu et al (1998), Liu and Zhang (2003), Lu and Antoniou (1992), Xie et al (2002), Lin et al (2001), Wu et al (2007Wu et al ( , 2008. Gao et al (2004) addressed the controller and filter design problems of controllers and filters for 2-D systems.…”
Section: Introductionmentioning
confidence: 99%
“…They showed that the stability of 2-D discrete systems can be guaranteed if there are some matrices satisfying a certain linear matrix inequality (LMIs). The controller and filter design problems have been addressed in Du et al (2000), Gao et al (2004), Liu et al (1998), Liu and Zhang (2003), Lu and Antoniou (1992), Xie et al (2002), Lin et al (2001), Wu et al (2007Wu et al ( , 2008. Gao et al (2004) addressed the controller and filter design problems of controllers and filters for 2-D systems.…”
Section: Introductionmentioning
confidence: 99%
“…The set S contains the indices of the coefficients that are forced to zero and so are eliminated from the next iterations. The set can grow at each iteration by the hard thresholding step (14). This means that the size of the optimization problem solved shrinks at each iteration, speeding up the running time of the overall algorithm.…”
Section: Design Of Sparse Filtersmentioning
confidence: 99%
“…The two most popular approaches that are used to induce sparsity are: convex relaxation to l 1 minimization [9] and greedy methods [10]. In this sense, previous work for sparse filter design includes the use of the orthogonal matching pursuit algorithm [11], greedy coefficient elimination [12] and linear programming [12], [13], [14]. In this paper we consider a combination of the two approaches to design filters in the minimax sense.…”
Section: Introductionmentioning
confidence: 99%
“…In the past decades, research on two-dimensional (2-D) discrete systems has rapidly increased due to their extensive practical applications in circuits analysis [1], digital image processing [2], signal filtering [3] and thermal power engineering [4], etc. Thus, the study of 2-D systems is an attractive problem and a number of results have been presented in the literature.…”
Section: Introductionmentioning
confidence: 99%