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

Givi Meishvili

dblp:218/5405 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
5since 2021 · last 2025
0000-0002-0984-7078ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 8 · 4 first-author · 5 since 2021Artificial intelligence and machine learning · 7 · 3 first-author · 4 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021

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.

Artificial intelligence
4 papers
Optimization for machine learning · 28% Trustworthy machine learning · 25% Face, body and person analysis · 20%
Computer graphics and multimedia
2 papers
Image and video processing · 54% Rendering · 36% Virtual and augmented reality · 11%

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

TopicWeightPapersLastEvidence papers
Rendering
neural rendering
0.912025
VoluMe - Authentic 3D Video Calls from Live Gaussian Splat Prediction · ICCV 2025
Machine learning › Trustworthy machine learning › fairness
fair classification
0.812024
Hairmony: Fairness-aware hairstyle classification · SIGGRAPH Asia 2024
Machine learning › Trustworthy machine learning
fairness
0.812024
Hairmony: Fairness-aware hairstyle classification · SIGGRAPH Asia 2024
Machine learning › Optimization for machine learning
adaptive optimization
0.612022
KOALA: A Kalman Optimization Algorithm with Loss Adaptivity · AAAI 2022
Machine learning › Optimization for machine learning
convergence analysis
0.612022
KOALA: A Kalman Optimization Algorithm with Loss Adaptivity · AAAI 2022
Machine learning › Optimization for machine learning
stochastic optimization
0.612022
KOALA: A Kalman Optimization Algorithm with Loss Adaptivity · AAAI 2022
Computer vision › Vision and language › multimodal fusion
audio-visual fusion
0.412020
Learning to Have an Ear for Face Super-Resolution · CVPR 2020
Computer vision › Face, body and person analysis › face modeling
face hallucination
0.412020
Learning to Have an Ear for Face Super-Resolution · CVPR 2020
Computer vision › Video understanding and tracking
video representation learning
0.412020
Video Representation Learning by Recognizing Temporal Transformations · ECCV (28) 2020
Image and video processing › image restoration › image deblurring
blind deconvolution
0.312018
Learning to Extract a Video Sequence From a Single Motion-Blurred Image · CVPR 2018
Image and video processing › image restoration
image deblurring
0.312018
Learning to Extract a Video Sequence From a Single Motion-Blurred Image · CVPR 2018
Image and video processing
image restoration
0.312018
Learning to Extract a Video Sequence From a Single Motion-Blurred Image · CVPR 2018
Image and video processing › image restoration › image deblurring
motion deblurring
0.312018
Learning to Extract a Video Sequence From a Single Motion-Blurred Image · CVPR 2018
Virtual and augmented reality
immersive interaction
0.312025
VoluMe - Authentic 3D Video Calls from Live Gaussian Splat Prediction · ICCV 2025
Computer vision › 3D vision
human digitization
0.212024
Hairmony: Fairness-aware hairstyle classification · SIGGRAPH Asia 2024
Machine learning › Representation and self-supervised learning › representation learning
latent representation learning
0.112020
Learning to Have an Ear for Face Super-Resolution · CVPR 2020

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

live prediction · 0.9gaussian splatting · 0.9synthetic training data · 0.8pre-trained feature extraction · 0.8momentum · 0.6kalman filtering · 0.6gradient descent · 0.6adam · 0.6temporal transformations · 0.4latent representation fusion · 0.4deep convolutional encoder-decoder · 0.4temporal-order-invariant loss · 0.3resampling · 0.3deep learning · 0.3
YearPublicationVenuePosition
2025 VoluMe - Authentic 3D Video Calls from Live Gaussian Splat Prediction
Martin de La Gorce, Charlie Hewitt, Robert Gerdisch, Zafiirah Hosenie, Givi Meishvili, Marek Kowalski, Thomas J. Cashman 0001, Antonio Criminisi
ICCV6
2024 Hairmony: Fairness-aware hairstyle classification
abstract
We present a method for prediction of a person's hairstyle from a single image. Despite growing use cases in user digitization and enrollment for virtual experiences, available methods are limited, particularly in the range of hairstyles they can capture. Human hair is extremely diverse and lacks any universally accepted description or categorization, making this a challenging task. Most current methods rely on parametric models of hair at a strand level. These approaches, while very promising, are not yet able to represent short, frizzy, coily hair and gathered hairstyles. We instead choose a classification approach which can represent the diversity of hairstyles required for a truly robust and inclusive system. Previous classification approaches have been restricted by poorly labeled data that lacks diversity, imposing constraints on the usefulness of any resulting enrollment system. We use only synthetic data to train our models. This allows for explicit control of diversity of hairstyle attributes, hair colors, facial appearance, poses, environments and other parameters. It also produces noise-free ground-truth labels. We introduce a novel hairstyle taxonomy developed in collaboration with a diverse group of domain experts which we use to balance our training data, supervise our model, and directly measure fairness. We annotate our synthetic training data and a real evaluation dataset using this taxonomy and release both to enable comparison of future hairstyle prediction approaches. We employ an architecture based on a pre-trained feature extraction network in order to improve generalization of our method to real data and predict taxonomy attributes as an auxiliary task to improve accuracy. Results show our method to be significantly more robust for challenging hairstyles than recent parametric approaches.
Givi Meishvili, James Clemoes, Charlie Hewitt, Zafiirah Hosenie, Xian Xiao, Martin de La Gorce, Tadas Baltrusaitis, Antonio Criminisi, Chyna McRae, Nina Jablonski, Marta Wilczkowiak
SIGGRAPH Asia1
2022 KOALA: A Kalman Optimization Algorithm with Loss Adaptivity
abstract
Optimization is often cast as a deterministic problem, where the solution is found through some iterative procedure such as gradient descent. However, when training neural networks the loss function changes over (iteration) time due to the randomized selection of a subset of the samples. This randomization turns the optimization problem into a stochastic one. We propose to consider the loss as a noisy observation with respect to some reference optimum. This interpretation of the loss allows us to adopt Kalman filtering as an optimizer, as its recursive formulation is designed to estimate unknown parameters from noisy measurements. Moreover, we show that the Kalman Filter dynamical model for the evolution of the unknown parameters can be used to capture the gradient dynamics of advanced methods such as Momentum and Adam. We call this stochastic optimization method KOALA, which is short for Kalman Optimization Algorithm with Loss Adaptivity. KOALA is an easy to implement, scalable, and efficient method to train neural networks. We provide convergence analysis and show experimentally that it yields parameter estimates that are on par with or better than existing state of the art optimization algorithms across several neural network architectures and machine learning tasks, such as computer vision and language modeling. The project page with the code and the supplementary materials is available at https://araachie.github.io/koala/.
Aram Davtyan, Sepehr Sameni, Llukman Cerkezi, Givi Meishvili, Adam Bielski, Paolo Favaro
AAAI4
2022 Contrastive Learning for Controllable Blind Video Restoration
Givi Meishvili, Abdelaziz Djelouah, Shinobu Hattori, Christopher Schroers
BMVC1
2021 Learning to Deblur and Rotate Motion-Blurred Faces
Givi Meishvili, Attila Szabó, Simon Jenni, Paolo Favaro
BMVC1
2020 Learning to Have an Ear for Face Super-Resolution
abstract
We propose a novel method to use both audio and a low-resolution image to perform extreme face super-resolution (a 16x increase of the input size). When the resolution of the input image is very low (e.g., 8x8 pixels), the loss of information is so dire that important details of the original identity have been lost and audio can aid the recovery of a plausible high-resolution image. In fact, audio carries information about facial attributes, such as gender and age. To combine the aural and visual modalities, we propose a method to first build the latent representations of a face from the lone audio track and then from the lone low-resolution image. We then train a network to fuse these two representations. We show experimentally that audio can assist in recovering attributes such as the gender, the age and the identity, and thus improve the correctness of the high-resolution image reconstruction process. Our procedure does not make use of human annotation and thus can be easily trained with existing video datasets. Moreover, we show that our model builds a factorized representation of images and audio as it allows one to mix low-resolution images and audio from different videos and to generate realistic faces with semantically meaningful combinations.
Givi Meishvili, Simon Jenni, Paolo Favaro
CVPR1
2020 Video Representation Learning by Recognizing Temporal Transformations
Simon Jenni, Givi Meishvili, Paolo Favaro
ECCV (28)2
2018 Learning to Extract a Video Sequence From a Single Motion-Blurred Image
abstract
We present a method to extract a video sequence from a single motion-blurred image. Motion-blurred images are the result of an averaging process, where instant frames are accumulated over time during the exposure of the sensor. Unfortunately, reversing this process is nontrivial. Firstly, averaging destroys the temporal ordering of the frames. Secondly, the recovery of a single frame is a blind deconvolution task, which is highly ill-posed. We present a deep learning scheme that gradually reconstructs a temporal ordering by sequentially extracting pairs of frames. Our main contribution is to introduce loss functions invariant to the temporal order. This lets a neural network choose during training what frame to output among the possible combinations. We also address the ill-posedness of deblurring by designing a network with a large receptive field and implemented via resampling to achieve a higher computational efficiency. Our proposed method can successfully retrieve sharp image sequences from a single motion blurred image and can generalize well on synthetic and real datasets captured with different cameras.
Meiguang Jin, Givi Meishvili, Paolo Favaro
CVPR2