Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alessio Raccis

dblp:05/1892 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 67% Image and video coding · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video coding › error resilience
error concealment
0.112005
JPEG2000-coded image error concealment exploiting convex sets projections · IEEE Trans. Image Process. 2005
Image and video processing
image restoration
0.112005
JPEG2000-coded image error concealment exploiting convex sets projections · IEEE Trans. Image Process. 2005
Image and video processing › image reconstruction › iterative reconstruction
projection onto convex sets
0.112005
JPEG2000-coded image error concealment exploiting convex sets projections · IEEE Trans. Image Process. 2005

Methods — techniques the papers use, named apart from their topics

projections onto convex sets · 0.1edge map · 0.1adaptive low-pass filtering · 0.1
YearPublicationVenuePosition
2005 JPEG2000-coded image error concealment exploiting convex sets projections
abstract
Transmission errors in JPEG2000 can be grouped into three main classes, depending on the affected area: LL, high frequencies at the lower decomposition levels, and high frequencies at the higher decomposition levels. The first type of errors are the most annoying but can be concealed exploiting the signal spatial correlation like in a number of techniques proposed in the past; the second are less annoying but more difficult to address; the latter are often imperceptible. In this paper, we address the problem of concealing the second class or errors when high bit-planes are damaged by proposing a new approach based on the theory of projections onto convex sets. Accordingly, the error effects are masked by iteratively applying two procedures: low-pass (LP) filtering in the spatial domain and restoration of the uncorrupted wavelet coefficients in the transform domain. It has been observed that a uniform LP filtering brought to some undesired side effects that negatively compensated the advantages. This problem has been overcome by applying an adaptive solution, which exploits an edge map to choose the optimal filter mask size. Simulation results demonstrated the efficiency of the proposed approach.
Luigi Atzori, Giaime Ginesu, Alessio Raccis
IEEE Trans. Image Process.3
2004 A novel iterative approach for JPEG2000 error concealment
abstract
In this paper, we address the problem of concealing high-frequencies errors at the lower decomposition levels in JPEG2000, by proposing a new approach based on the theory of projections onto convex sets. The error effects are masked by iteratively applying two important procedures: low-pass (LP) filtering in the spatial domain and restoration of the uncorrupted wavelet coefficients in the transform domain. It has been observed that a uniform LP filtering brought to some undesired side-effects that negatively compensated the advantages. This problem has been overcome by applying an adaptive solution exploiting an edge map to choose the optimal filter mask dimension. Simulation results demonstrated the efficiency of the proposed approach.
Luigi Atzori, Giaime Ginesu, Alessio Raccis, Daniele D. Giusto
MMSP3