Mustafa Isik

dblp:270/9062 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2023
0000-0002-3086-8922ORCID · reported

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 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.

Computer graphics and multimedia
3 papers
Rendering · 89% Image and video processing · 8% Visualization and visual analytics · 3%

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

TopicWeightPapersLastEvidence papers
Rendering
neural rendering
1.222023
HumanRF: High-Fidelity Neural Radiance Fields for Humans in Motion · ACM Trans. Graph. 2023
Learning Adaptive Sampling and Reconstruction for Volume Visualization · IEEE Trans. Vis. Comput. Graph. 2022
Rendering
neural radiance fields
0.712023
HumanRF: High-Fidelity Neural Radiance Fields for Humans in Motion · ACM Trans. Graph. 2023
Rendering
novel view synthesis
0.712023
HumanRF: High-Fidelity Neural Radiance Fields for Humans in Motion · ACM Trans. Graph. 2023
Rendering › monte carlo rendering
adaptive sampling and reconstruction
0.612022
Learning Adaptive Sampling and Reconstruction for Volume Visualization · IEEE Trans. Vis. Comput. Graph. 2022
Rendering
volume rendering
0.612022
Learning Adaptive Sampling and Reconstruction for Volume Visualization · IEEE Trans. Vis. Comput. Graph. 2022
Image and video processing › image restoration
denoising
0.512021
Interactive Monte Carlo denoising using affinity of neural features · ACM Trans. Graph. 2021
Rendering
interactive rendering
0.512021
Interactive Monte Carlo denoising using affinity of neural features · ACM Trans. Graph. 2021
Rendering
monte carlo rendering
0.512021
Interactive Monte Carlo denoising using affinity of neural features · ACM Trans. Graph. 2021
Rendering
real-time rendering
0.512021
Interactive Monte Carlo denoising using affinity of neural features · ACM Trans. Graph. 2021
Visualization and visual analytics
volume visualization
0.212022
Learning Adaptive Sampling and Reconstruction for Volume Visualization · IEEE Trans. Vis. Comput. Graph. 2022

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

temporal matrix-vector decomposition · 0.7multi-view reconstruction · 0.7differentiable sampling · 0.6backpropagation · 0.6artificial neural network · 0.6temporal filtering · 0.5recursive filter · 0.5pairwise affinity · 0.5neural network · 0.5
YearPublicationVenuePosition
2023 HumanRF: High-Fidelity Neural Radiance Fields for Humans in Motion
abstract
Representing human performance at high-fidelity is an essential building block in diverse applications, such as film production, computer games or videoconferencing. To close the gap to production-level quality, we introduce HumanRF 1 , a 4D dynamic neural scene representation that captures full-body appearance in motion from multi-view video input, and enables playback from novel, unseen viewpoints. Our novel representation acts as a dynamic video encoding that captures fine details at high compression rates by factorizing space-time into a temporal matrix-vector decomposition. This allows us to obtain temporally coherent reconstructions of human actors for long sequences, while representing high-resolution details even in the context of challenging motion. While most research focuses on synthesizing at resolutions of 4MP or lower, we address the challenge of operating at 12MP. To this end, we introduce ActorsHQ, a novel multi-view dataset that provides 12MP footage from 160 cameras for 16 sequences with high-fidelity, per-frame mesh reconstructions 2 . We demonstrate challenges that emerge from using such high-resolution data and show that our newly introduced HumanRF effectively leverages this data, making a significant step towards production-level quality novel view synthesis.
Mustafa Isik, Martin Rünz, Markos Georgopoulos, Taras Khakhulin, Jonathan Starck, Lourdes Agapito, Matthias Nießner
ACM Trans. Graph.1
2022 Learning Adaptive Sampling and Reconstruction for Volume Visualization
abstract
A central challenge in data visualization is to understand which data samples are required to generate an image of a data set in which the relevant information is encoded. In this article, we make a first step towards answering the question of whether an artificial neural network can predict where to sample the data with higher or lower density, by learning of correspondences between the data, the sampling patterns and the generated images. We introduce a novel neural rendering pipeline, which is trained end-to-end to generate a sparse adaptive sampling structure from a given low-resolution input image, and reconstructs a high-resolution image from the sparse set of samples. For the first time, to the best of our knowledge, we demonstrate that the selection of structures that are relevant for the final visual representation can be jointly learned together with the reconstruction of this representation from these structures. Therefore, we introduce differentiable sampling and reconstruction stages, which can leverage back-propagation based on supervised losses solely on the final image. We shed light on the adaptive sampling patterns generated by the network pipeline and analyze its use for volume visualization including isosurface and direct volume rendering.
Sebastian Weiss, Mustafa Isik, Justus Thies, Rüdiger Westermann
IEEE Trans. Vis. Comput. Graph.2
2021 Interactive Monte Carlo denoising using affinity of neural features
abstract
High-quality denoising of Monte Carlo low-sample renderings remains a critical challenge for practical interactive ray tracing. We present a new learning-based denoiser that achieves state-of-the-art quality and runs at interactive rates. Our model processes individual path-traced samples with a lightweight neural network to extract per-pixel feature vectors. The rest of our pipeline operates in pixel space. We define a novel pairwise affinity over the features in a pixel neighborhood, from which we assemble dilated spatial kernels to filter the noisy radiance. Our denoiser is temporally stable thanks to two mechanisms. First, we keep a running average of the noisy radiance and intermediate features, using a per-pixel recursive filter with learned weights. Second, we use a small temporal kernel based on the pairwise affinity between features of consecutive frames. Our experiments show our new affinities lead to higher quality outputs than techniques with comparable computational costs, and better high-frequency details than kernel-predicting approaches. Our model matches or outperfoms state-of-the-art offline denoisers in the low-sample count regime (2--8 samples per pixel), and runs at interactive frame rates at 1080p resolution.
Mustafa Isik, Krishna Mullia, Matthew Fisher, Jonathan Eisenmann, Michaël Gharbi
ACM Trans. Graph.1