2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2012
DOI: 10.1109/icassp.2012.6288744
|View full text |Cite
|
Sign up to set email alerts
|

A sampling theorem for Manhattan grids

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2012
2012
2014
2014

Publication Types

Select...
5

Relationship

4
1

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 6 publications
0
7
0
Order By: Relevance
“…The result of sampling on the union of two rectangular lattices considered in [8] follows immediately from the above result.…”
Section: ⊓ ⊔mentioning
confidence: 73%
See 3 more Smart Citations
“…The result of sampling on the union of two rectangular lattices considered in [8] follows immediately from the above result.…”
Section: ⊓ ⊔mentioning
confidence: 73%
“…The answer to (2) was answered previously in [8] for rectangular Manhattan grids when Ω1 and Ω2 were the rectangular Nyquist regions centered at the origin, corresponding to lattices L1 and L2, respectively. Although it was not explicitly stated in the previous work, it can be shown that the Landau bound is achieved in this case.…”
Section: Problem Description and Proposed Solutionmentioning
confidence: 99%
See 2 more Smart Citations
“…Previously, Manhattan grid sampling has been used in bilevel image coding and reconstruction [6,7,8], as well as grayscale image reconstruction [9,10]. A sampling theorem for Manhattan grids has also been derived [11]. The problem of RSS source localization is similar to these image processing problems in that we are given noisy samples of an RSS "image" on the Manhattan grid and we would like to reconstruct properties of that image (in this case, the source location).…”
Section: Introductionmentioning
confidence: 97%