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

Elian Dib

dblp:241/0223 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2020
0000-0001-6079-1885ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

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 coding · 67% Image and video processing · 33%
Artificial intelligence
1 paper
3D vision · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › predictive coding
disparity compensation
0.412020
Local Low Rank Approximation With a Parametric Disparity Model for Light Field Compression · IEEE Trans. Image Process. 2020
Image and video coding
light field compression
0.412020
Local Low Rank Approximation With a Parametric Disparity Model for Light Field Compression · IEEE Trans. Image Process. 2020
Image and video processing
low-rank approximation
0.412020
Local Low Rank Approximation With a Parametric Disparity Model for Light Field Compression · IEEE Trans. Image Process. 2020
Computer vision › 3D vision › stereo vision
stereo matching
0.112020
Local Low Rank Approximation With a Parametric Disparity Model for Light Field Compression · IEEE Trans. Image Process. 2020

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

singular value decomposition · 0.9low-rank matrix approximation · 0.9
YearPublicationVenuePosition
2020 Local Low Rank Approximation With a Parametric Disparity Model for Light Field Compression
abstract
We address the problem of light field dimensionality reduction for compression. We describe a local low rank approximation method using a parametric disparity model. The local support of the approximation is defined by super-rays. A super-ray can be seen as a set of super-pixels that are coherent across all light field views. A dedicated super-ray construction method is first described that constrains the super-pixels forming a given super-ray to be all of the same shape and size, dealing with occlusions. This constraint is needed so that the super-rays can be used as supports of angular dimensionality reduction based on low rank matrix approximation. The light field low rank assumption depends on how much the views are correlated, i.e. on how well they can be aligned by disparity compensation. We first introduce a parametric model describing the local variations of disparity within each super-ray. We then consider two methods for estimating the model parameters. The first method simply fits the model on an input disparity map. We then introduce a disparity estimation method using a low rank prior. This method alternatively searches for the best parameters of the disparity model and of the low rank approximation. We assess the proposed disparity parametric model, first assuming that the disparity is constant within a super-ray, and second by considering an affine disparity model. We show that using the proposed disparity parametric model and estimation algorithm gives an alignment of super-pixels across views that favours the low rank approximation compared with using disparity estimated with classical computer vision methods. The low rank matrix approximation is computed on the disparity compensated super-rays using a singular value decomposition (SVD). A coding algorithm is then described for the different components of the proposed disparity-compensated low rank approximation. Experimental results show performance gains, with a rate saving going up to 92.61%, compared with the JPEG Pleno anchor, for real light fields captured by a Lytro Illum camera. The rate saving goes up to 37.72% with synthetic light fields. The approach is also shown to outperform an HEVC-based light field compression scheme.
Elian Dib, Mikael Le Pendu, Xiaoran Jiang, Christine Guillemot
IEEE Trans. Image Process.1
2019 Super-Ray Based Low Rank Approximation for Light Field Compression
abstract
We describe a local low rank approximation method based on super-rays for light field compression. Super-rays can be seen as a set of super-pixels that are coherent across all light field views. A super-ray based disparity estimation method is proposed using a low rank prior, in order to be able to align all the super-pixels forming each super-ray. A dedicated super-ray construction method is described that constrains the super-pixels forming a given super-ray to be all of the same shape and size, dealing with occlusions. This constraint is needed so that the super-rays can be used as a support of angular dimensionality reduction based on low rank matrix approximation. A low rank matrix approximation is then computed on the disparity compensated super-rays using a singular value decomposition (SVD). A coding algorithm is then described for the different components of the resulting low rank approximation. Experimental results show performance gains compared with two reference light field coding schemes (HEVC-based scheme and JPEG-Pleno VM 1.1).
Elian Dib, Mikael Le Pendu, Xiaoran Jiang, Christine Guillemot
DCC1
2019 Light Field Compression Using Fourier Disparity Layers
abstract
In this paper, we present a compression method for light fields based on the Fourier Disparity Layer representation. This light field representation consists in a set of layers that can be efficiently constructed in the Fourier domain from a sparse set of views, and then used to reconstruct intermediate viewpoints without requiring a disparity map. In the proposed compression scheme, a subset of light field views is encoded first and used to construct a Fourier Disparity Layer model from which a second subset of views is predicted. After encoding and decoding the residual of those predicted views, a larger set of decoded views is available, allowing us to refine the layer model in order to predict the next views with increased accuracy. The procedure is repeated until the complete set of light field views is encoded. Following this principle, we investigate in the paper different scanning orders of the light field views and analyse their respective efficiencies regarding the compression performance.
Elian Dib, Mikael Le Pendu, Christine Guillemot
ICIP1