2013 IEEE International Conference on Image Processing 2013
DOI: 10.1109/icip.2013.6738096
|View full text |Cite
|
Sign up to set email alerts
|

Anisotropically foveated nonlocal image denoising

Abstract: When our gaze fixates a point, the visual acuity is maximal at the fixation point (imaged by the fovea, i.e. the central part of the retina) and decreases rapidly towards the periphery of the visual field. This phenomenon is known as foveated vision or foveated imaging. We recently investigated the role o ff o v a t i o ni ni m a g efi ltering and we have shown that the foveated patch distance, i.e. the Euclidean distance between foveated patches, is a valuable feature for the assessment of nonlocal self-simil… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…Visual acuity is maximum in the middle of the retina termed as fovea and decreases towards the periphery of the retina. Foveation proved to be very effectively in nonlocal means denoising algorithms [21]. In foveation central section of the window is focused, while the peripheral pixels are defocused using linear space invariant gaussian blur.…”
Section: A Data Manipulationmentioning
confidence: 99%
“…Visual acuity is maximum in the middle of the retina termed as fovea and decreases towards the periphery of the retina. Foveation proved to be very effectively in nonlocal means denoising algorithms [21]. In foveation central section of the window is focused, while the peripheral pixels are defocused using linear space invariant gaussian blur.…”
Section: A Data Manipulationmentioning
confidence: 99%
“…Thus, foveated self-similarity reveals a connection between features of the HVS and modern imaging algorithms. This work builds upon our preliminary conference publications: Foi and Boracchi (2012), where we first introduced isotropic foveation operators and their constrained designed for Foveated NL-means;and Foi and Boracchi (2013b), Foi and Boracchi (2013a) where we described their anisotropic extensions. Here, we develop these works in the following directions: we provide a more precise and detailed characterization of the design constraints leading to foveation operators (both isotropic and anisotropic); introduce selfmap foveation operators that share the same compact support of windowing operators; illustrate the foveation operators through their singular value decomposition; present a more thorough and extensive experimental validation which includes a detailed analysis and optimization of the filter parameters; detail the computational overhead of replacing the windowed distance with the foveated distance; discuss several connections between the HVS and the effectiveness of foveated self-similarity, including a direct analogy between the radial bias in the HVS and the optimal orientation in anisotropic foveation, which we expose by replicating the outcomes of a recent fMRI study on human subjects within our image-denoising framework.…”
Section: Introductionmentioning
confidence: 99%
“…[10]- [11]. The digital convolution [2]- [3] process widely implemented in FPGA [4] for several decades. However these algorithms are computationally expensive.…”
Section: Introductionmentioning
confidence: 99%
“…But the multiplier design is generic and not suitable for filtering [3]. A.G.Dimster suggested the Fixed binary common sub expression algorithm (FBCSE) is eliminate the computational complexity moderately by considering BCSE algorithm across the adjacent coefficients is designed [4], [9],[10].…”
Section: Introductionmentioning
confidence: 99%