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

Claude Knaus

dblp:29/8869 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
1since 2021 · last 2021
—ORCID · none

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 · 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.

Computer graphics and multimedia
6 papers
Rendering · 41% Virtual and augmented reality · 32% Audio and music processing · 14%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Virtual and augmented reality › 3d display › stereoscopic display
autostereoscopic display
0.512021
Project starline: a high-fidelity telepresence system · ACM Trans. Graph. 2021
Rendering
image-based rendering
0.512021
Project starline: a high-fidelity telepresence system · ACM Trans. Graph. 2021
Virtual and augmented reality
telepresence
0.512021
Project starline: a high-fidelity telepresence system · ACM Trans. Graph. 2021
Rendering
monte carlo rendering
0.322012
Adaptive rendering with non-local means filtering · ACM Trans. Graph. 2012
Adaptive sampling and reconstruction using greedy error minimization · ACM Trans. Graph. 2011
Image and video processing › image restoration
image denoising
0.222014
Progressive Image Denoising · IEEE Trans. Image Process. 2014
Adaptive rendering with non-local means filtering · ACM Trans. Graph. 2012
Audio and music processing › speech enhancement
dereverberation
0.112021
Project starline: a high-fidelity telepresence system · ACM Trans. Graph. 2021
Audio and music processing
spatial audio
0.112021
Project starline: a high-fidelity telepresence system · ACM Trans. Graph. 2021
Audio and music processing › sound source localization
speaker localization
0.112021
Project starline: a high-fidelity telepresence system · ACM Trans. Graph. 2021
Rendering › monte carlo rendering
adaptive sampling and reconstruction
0.112011
Adaptive sampling and reconstruction using greedy error minimization · ACM Trans. Graph. 2011
Rendering
global illumination
0.112011
Progressive photon mapping: A probabilistic approach · ACM Trans. Graph. 2011
Rendering › global illumination
photon mapping
0.112011
Progressive photon mapping: A probabilistic approach · ACM Trans. Graph. 2011
Rendering
volume rendering
0.112011
Progressive photon mapping: A probabilistic approach · ACM Trans. Graph. 2011
Mathematical optimization
continuous optimization
0.112014
Progressive Image Denoising · IEEE Trans. Image Process. 2014
Mathematical optimization › metaheuristic optimization
deterministic annealing
0.112014
Progressive Image Denoising · IEEE Trans. Image Process. 2014
Image and video processing › image restoration › image denoising › patch-based denoising
non-local means
0.012012
Adaptive rendering with non-local means filtering · ACM Trans. Graph. 2012
Image and video processing › image segmentation
interactive segmentation
0.012010
Stereoscopic 3D copy & paste · ACM Trans. Graph. 2010

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

multi-view capture · 0.5depth video compression · 0.5robust estimation · 0.4deterministic annealing · 0.4iterative error estimation · 0.1dual-buffer sampling · 0.1stochastic ray tracing · 0.1radiance estimation · 0.1probabilistic derivation · 0.1greedy error minimization · 0.1
YearPublicationVenuePosition
2021 Project starline: a high-fidelity telepresence system
abstract
We present a real-time bidirectional communication system that lets two people, separated by distance, experience a face-to-face conversation as if they were copresent. It is the first telepresence system that is demonstrably better than 2D videoconferencing, as measured using participant ratings (e.g., presence, attentiveness, reaction-gauging, engagement), meeting recall, and observed nonverbal behaviors (e.g., head nods, eyebrow movements). This milestone is reached by maximizing audiovisual fidelity and the sense of copresence in all design elements, including physical layout, lighting, face tracking, multi-view capture, microphone array, multi-stream compression, loudspeaker output, and lenticular display. Our system achieves key 3D audiovisual cues (stereopsis, motion parallax, and spatialized audio) and enables the full range of communication cues (eye contact, hand gestures, and body language), yet does not require special glasses or body-worn microphones/headphones. The system consists of a head-tracked autostereoscopic display, high-resolution 3D capture and rendering subsystems, and network transmission using compressed color and depth video streams. Other contributions include a novel image-based geometry fusion algorithm, free-space dereverberation, and talker localization.
Jason Lawrence, Dan B. Goldman, Supreeth Achar, Gregory Major Blascovich, Joseph G. Desloge, Tommy Fortes, Eric M. Gomez, Sascha Häberling, Hugues Hoppe, Andy Huibers, Claude Knaus, Brian Kuschak, Ricardo Martin-Brualla, Harris Nover, Andrew Ian Russell, Steven M. Seitz, Kevin Tong
ACM Trans. Graph.11
2015 Dual-Domain Filtering
abstract
We propose dual-domain filtering, an image processing paradigm that couples spatial domain with frequency domain filtering. Our dual-domain defined filter removes artifacts like residual noise of other image denoising methods and compression artifacts. Moreover, iterating the filter achieves state-of-the-art image denoising results, but with a much simpler algorithm than competing approaches. The simplicity and versatility of the dual-domain filter makes it an attractive tool for image processing.
Claude Knaus, Matthias Zwicker
SIAM J. Imaging Sci.1
2014 Progressive Image Denoising
abstract
Image denoising continues to be an active research topic. Although state-of-the-art denoising methods are numerically impressive and approch theoretical limits, they suffer from visible artifacts.While they produce acceptable results for natural images, human eyes are less forgiving when viewing synthetic images. At the same time, current methods are becoming more complex, making analysis, and implementation difficult. We propose image denoising as a simple physical process, which progressively reduces noise by deterministic annealing. The results of our implementation are numerically and visually excellent. We further demonstrate that our method is particularly suited for synthetic images. Finally, we offer a new perspective on image denoising using robust estimators.
Claude Knaus, Matthias Zwicker
IEEE Trans. Image Process.1
2013 Dual-domain image denoising
abstract
Image denoising methods have been implemented in both spatial and transform domains. Each domain has its advantages and shortcomings, which can be complemented by each other. State-of-the-art methods like block-matching 3D filtering (BM3D) therefore combine both domains. However, implementation of such methods is not trivial. We offer a hybrid method that is surprisingly easy to implement and yet rivals BM3D in quality.
Claude Knaus, Matthias Zwicker
ICIP1
2012 Adaptive rendering with non-local means filtering
abstract
We propose a novel approach for image space adaptive sampling and filtering in Monte Carlo rendering. We use an iterative scheme composed of three steps. First, we adaptively distribute samples in the image plane. Second, we denoise the image using a non-linear filter. Third, we estimate the residual per-pixel error of the filtered rendering, and the error estimate guides the sample distribution in the next iteration. The effectiveness of our approach hinges on the use of a state of the art image denoising technique, which we extend to an adaptive rendering framework. A key idea is to split the Monte Carlo samples into two buffers. This improves denoising performance and facilitates variance and error estimation. Our method relies only on the Monte Carlo samples, allowing us to handle arbitrary light transport and lens effects. In addition, it is robust to high noise levels and complex image content. We compare our approach to a state of the art adaptive rendering technique based on adaptive bandwidth selection and demonstrate substantial improvements in terms of both numerical error and visual quality. Our framework is easy to implement on top of standard Monte Carlo renderers and it incurs little computational overhead.
Fabrice Rousselle, Claude Knaus, Matthias Zwicker
ACM Trans. Graph.2
2011 Progressive photon mapping: A probabilistic approach
abstract
In this article we present a novel formulation of progressive photon mapping. Similar to the original progressive photon mapping algorithm, our approach is capable of computing global illumination solutions without bias in the limit, and it uses only a constant amount of memory. It produces high-quality results in situations that are difficult for most other algorithms, such as scenes with realistic light fixtures where the light sources are completely enclosed by refractive material. Our new formulation is based on a probabilistic derivation. The key property of our approach is that it does not require the maintenance of local photon statistics. In addition, our derivation allows for arbitrary kernels in the radiance estimate and includes stochastic ray tracing algorithms. Finally, our approach is readily applicable to volumetric photon mapping. We compare our algorithm to previous progressive photon mapping approaches and show that we achieve the same convergence to unbiased results, even without local photon statistics.
Claude Knaus, Matthias Zwicker
ACM Trans. Graph.1
2011 Adaptive sampling and reconstruction using greedy error minimization
abstract
We introduce a novel approach for image space adaptive sampling and reconstruction in Monte Carlo rendering. We greedily minimize relative mean squared error (MSE) by iterating over two steps. First, given a current sample distribution, we optimize over a discrete set of filters at each pixel and select the filter that minimizes the pixel error. Next, given the current filter selection, we distribute additional samples to further reduce MSE. The success of our approach hinges on a robust technique to select suitable per pixel filters. We develop a novel filter selection procedure that robustly solves this problem even with noisy input data. We evaluate our approach using effects such as motion blur, depth of field, interreflections, etc. We provide a comparison to a state-of-the-art algorithm based on wavelet shrinkage and show that we achieve significant improvements in numerical error and visual image quality. Our approach is simple to implement, requires a single user parameter, and is compatible with standard Monte Carlo rendering.
Fabrice Rousselle, Claude Knaus, Matthias Zwicker
ACM Trans. Graph.2
2010 Stereoscopic 3D copy & paste
abstract
With the increase in popularity of stereoscopic 3D imagery for film, TV, and interactive entertainment, an urgent need for editing tools to support stereo content creation has become apparent. In this paper we present an end-to-end system for object copy & paste in a stereoscopic setting to address this need. There is no straightforward extension of 2D copy & paste to support the addition of the third dimension as we show in this paper. For stereoscopic copy & paste we need to handle depth, and our core objective is to obtain a convincing 3D viewing experience. As one of the main contributions of our system, we introduce a stereo billboard method for stereoscopic rendering of the copied selection. Our approach preserves the stereo volume and is robust to the inevitable inaccuracies of the depth maps computed from a stereo pair of images. Our system also includes an interactive stereoscopic segmentation tool to achieve high quality object selection. Hence, we focus on intuitive and minimal user interaction, and our editing operations perform within interactive rates to provide immediate feedback.
Wan-Yen Lo, Jeroen van Baar, Claude Knaus, Matthias Zwicker, Markus Gross 0001
ACM Trans. Graph.3