% BibTeX Exporter written in LotusScript by Uwe Brahm, % Please send bug reports via email to . Thanks. % Exported: Monday, 22. April 2019, 16:53, Server: domino/MPII/DE @PHDTHESIS{2008PhD-Thesis, AUTHOR = {Freiherr von Funck, Wolfram Alexander}, TITLE = {Shape Deformations Based on Vector Fields}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {December}, YEAR = {2008}, } @MASTERSTHESIS{2013MasterRobertini, AUTHOR = {Robertini, Nadia}, TITLE = {Capture of Arm-Muscle Deformations using a Depth Camera}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {April}, YEAR = {2013}, } @MASTERSTHESIS{2013Master:Eghbali, AUTHOR = {Eghbali, Mandana}, TITLE = {Facial Performance Capture Using a Single Kinect Camera}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {April}, YEAR = {2013}, } @INPROCEEDINGS{2013:OCEANS:Hegedues, AUTHOR = {Gracias, N. and Ridao, P. and Garcia, R. and Escartin, J. and L’Hour, M. and Cibecchini, F. and Campos, R. and Carreras M. and Ribas, D. and Palomeras, N. and Magi, L. and Palomer A. and Nicosevici, T. and Prados, R. and Heged{\"u}s, R. and Neumann, L. and De Filippo, F. and Mallios, A.}, TITLE = {(2013) Mapping the Moon: Using a lightweight AUV to survey the site of the 17th Century ship ‘La Lune’,}, BOOKTITLE = {OCEANS '13 MTS/IEEE Bergen "The Northern Dimension and Challenges"}, ORGANIZATION = {IEEE}, PADDRESS = {??}, ADDRESS = {Bergen, Norway}, PUBLISHER = {IEEE Xplore Digital Library}, YEAR = {2013}, PAGES = {1--8}, } @ARTICLE{2013:OSA:Hegedues, AUTHOR = {Neumann, L. and Garcia, R. and Basa, J. and Heged{\"u}s, R.}, JOURNAL = {Journal of the Optical Society of America A.}, TITLE = {Acquisition and Visualization Techniques for Narrow Spectral Color Imaging}, NUMBER = {6}, VOLUME = {30}, YEAR = {2013}, PAGES = {1039--1052}, } @MASTERSTHESIS{2014Master:StopperGebhard, AUTHOR = {Stopper, Gebhard}, TITLE = {Data-Guided Flow Illustration}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {April}, YEAR = {2014}, PAGES = {79}, } @PHDTHESIS{2014PhD:KurzChristian, AUTHOR = {Kurz, Christian}, TITLE = {Constrained Camera Motion Estimation and 3D Reconstruction}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, YEAR = {2014}, } @INCOLLECTION{2014:AnimalSciences:Hegedues6, AUTHOR = {Horv{\'a}th, G. and Blah{\'o}, M. and Egri, Á. and Heged{\"u}s, R. and Sz{\'e}l, Gy}, EDITOR = {Horv{\'a}th, G.}, TITLE = {Circular Polarization Vision of Scarab Beetles}, BOOKTITLE = {Polarized Light and Polarization Vision in Animal Sciences}, CHAPTER = {6}, ADDRESS = {New York}, PUBLISHER = {Springer}, YEAR = {2014}, } @INPROCEEDINGS{Adams2008, AUTHOR = {Adams, Bart and Ovsjanikov, Maksim and Wand, Michael and Seidel, Hans-Peter and Guibas, Leonidas}, TITLE = {Meshless Modeling of Deformable Shapes and their Motion}, BOOKTITLE = {ACM SIGGRAPH/Eurographics Symposium on Computer Animation}, ORGANIZATION = {ACM/Eurographics}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Dublin, Ireland}, PUBLISHER = {Eurographics Association}, YEAR = {2008}, PAGES = {77--86}, } @ARTICLE{Adams2010, AUTHOR = {Adams, Bart and Wicke, Martin and Ovsjanikov, Maks and Wand, Michael and Seidel, Hans-Peter and Guibas, Leonidas}, JOURNAL = {Computer Graphics Forum}, TITLE = {Meshless Shape and Motion Design for Multiple Deformable Objects}, ADDRESS = {Oxford, UK}, NUMBER = {1}, PUBLISHER = {Blackwell}, MONTH = {January}, VOLUME = {29}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2009.01536.x}, YEAR = {2010}, PAGES = {43--59}, } @INPROCEEDINGS{ADM:SIGGRAPH:CSSM:2008, AUTHOR = {Annen, Thomas and Dong, Zhao and Mertens, Tom and Bekaert, Philippe and Seidel, Hans-Peter and Kautz, Jan}, EDITOR = {Turk, Greg}, TITLE = {Real-Time, All-Frequency Shadows in Dynamic Scenes}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2008}, PADDRESS = {New York}, ADDRESS = {Los Angeles, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {August}, SERIES = {ACM Transactions on Graphics}, VOLUME = {27}, ISBN = {0730-0301}, DOI = {http://doi.acm.org/10.1145/1360612.1360633}, YEAR = {2008}, PAGES = {1--8}, } @MASTERSTHESIS{Aguiar2004_Master, AUTHOR = {de Aguiar, Edilson}, TITLE = {Character Animation from a Motion Capture Database}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {November}, YEAR = {2003}, ABSTRACT = {This thesis discusses methods that use information contained in a motion capture database to assist in the creation of a realistic character animation. Starting with an animation sketch, where only a small number of keyframes for some degrees of freedom are set, the motion capture data is used to improve the initial motion quality. First, the multiresolution filtering technique is presented and it is shown how this method can be used as a building block for character animation. Then, the hierarchical fragment method is introduced, which uses signal processing techniques, the skeleton hierarchy information and a simple matching algorithm applied to data fragments to synthesize missing degrees of freedom in a character animation, from a motion capture database. In a third technique, a principal component model is fitted to the motion capture database and it is demonstrated that using the motion principle components a character animation can be edited and enhanced after it has been created. After comparing these methods, a hybrid approach combining the individual technique s advantages is proposed, which uses a pipeline in order to create the character animation in a simple and intuitive way. Finally, the methods and results are reviewed and approaches for future improvements are mentioned.}, } @ARTICLE{AguiarCGF2008, AUTHOR = {Eisemann, Martin and de Decker, Bert and Magnor, Marcus A. and Bekaert, Philippe and de Aguiar, Edilson and Ahmed, Naveed and Theobalt, Christian and Sellent, A.}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, TITLE = {Floating Textures}, ADDRESS = {na}, NUMBER = {2}, PUBLISHER = {European Association for Computer Graphics}, MONTH = {April}, VOLUME = {27}, ISBN = {0167-7055}, YEAR = {2008}, PAGES = {409--418}, } @PHDTHESIS{Ahmed2009, AUTHOR = {Ahmed, Naveed}, TITLE = {High Quality Dynamic Reflectance and Surface Reconstruction from Video}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {July}, YEAR = {2009}, ABSTRACT = {The creation of high quality animations of real-world human actors has long been a challenging problem in computer graphics. It involves the modeling of the shape of the virtual actors, creating their motion, and the reproduction of very fine dynamic details. In order to render the actor under arbitrary lighting, it is required that reflectance properties are modeled for each point on the surface. These steps, that are usually performed manually by professional modelers, are time consuming and cumbersome. In this thesis, we show that algorithmic solutions for some of the problems that arise in the creation of high quality animation of real-world people are possible using multi-view video data. First, we present a novel spatio-temporal approach to create a personalized avatar from multi-view video data of a moving person. Thereafter, we propose two enhancements to a method that captures human shape, motion and reflectance properties of amoving human using eightmulti-view video streams. Afterwards we extend this work, and in order to add very fine dynamic details to the geometric models, such as wrinkles and folds in the clothing, we make use of the multi-view video recordings and present a statistical method that can passively capture the fine-grain details of time-varying scene geometry. Finally, in order to reconstruct structured shape and animation of the subject from video, we present a dense 3D correspondence finding method that enables spatiotemporally coherent reconstruction of surface animations directly frommulti-view video data. These algorithmic solutions can be combined to constitute a complete animation pipeline for acquisition, reconstruction and rendering of high quality virtual actors from multi-view video data. They can also be used individually in a system that require the solution of a specific algorithmic sub-problem. The results demonstrate that using multi-view video data it is possible to find the model description that enables realistic appearance of animated virtual actors under different lighting conditions and exhibits high quality dynamic details in the geometry.}, } @INPROCEEDINGS{AhmedICIP07, AUTHOR = {Ahmed, Naveed and Theobalt, Christian and Magnor, Marcus and Seidel, Hans-Peter}, TITLE = {Spatio-Temporal Registration Techniques for Relightable 3D Video}, BOOKTITLE = {International Conference on Image Processing 2007}, ORGANIZATION = {IEEE}, PADDRESS = {San Antonio, Texas, USA}, ADDRESS = {San Antonio, TX, USA}, PUBLISHER = {IEEE}, VOLUME = {2}, ISBN = {978-1-4244-1437-6}, YEAR = {2007}, PAGES = {501--504}, ABSTRACT = {By jointly applying a model-based marker-less motion capture approach and multi-view texture generation 3D Videos of human actors can be reconstructed from multi-view video streams. If the input data were recorded under calibrated lighting, the texture information can also be used to measure time-varying surface reflectance. This way, 3D videos can be realistically displayed under novel lighting conditions. Reflectance estimation is only feasible if the multi-view texture-to-surface registration is consistent over time. In this paper, we propose two image-based warping methods that compensate registration errors due to inaccurate model geometry and shifting of apparel over the body.}, } @INPROCEEDINGS{Ahrenberg2004, AUTHOR = {Ahrenberg, Lukas and Ihrke, Ivo and Magnor, Marcus}, TITLE = {A Mobile System for Multi-Video Recording}, BOOKTITLE = {Proc. of CVMP}, PADDRESS = {London}, ADDRESS = {London}, YEAR = {2004}, PAGES = {127--132}, } @INPROCEEDINGS{Ahrenberg2005, AUTHOR = {Ahrenberg, Lukas and Ihrke, Ivo and Magnor, Marcus}, TITLE = {Volumetric Reconstruction, Compression and Rendering of Natural Phenomena from Multi-Video Data}, BOOKTITLE = {Proc. of Volume Graphics}, PADDRESS = {London}, ADDRESS = {London}, YEAR = {2005}, PAGES = {83--90}, } @INCOLLECTION{aimatshape:interrogation:2007, AUTHOR = {Hahmann, Stefanie and Belyaev, Alexander and Buse, Laurent and Elber, Gershon and Mourrain, Bernard and R{\"o}ssl, Christian}, EDITOR = {de Floriani, Leila and Spagnuolo, Michaela}, TITLE = {Shape Interrogation}, BOOKTITLE = {Shape Analysis and Structuring}, CHAPTER = {1}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Springer}, SERIES = {Mathematics and Visualization}, ISBN = {978-3-540-33264-0}, YEAR = {2008}, PAGES = {1--52}, } @INCOLLECTION{aimatshape:vectorfields:2007, AUTHOR = {Theisel, Holger and R{\"o}ssl, Christian and Weinkauf, Tino}, EDITOR = {de Floriani, Leila and Spagnuolo, Michaela}, TITLE = {Topological Representations of Vector Fields}, BOOKTITLE = {Shape Analysis and Structuring}, ADDRESS = {Berlin}, PUBLISHER = {Spinger}, SERIES = {Mathematics and Visualization}, YEAR = {2007}, } @INPROCEEDINGS{Ajdin2008, AUTHOR = {Ajdin, Boris and Hullin, Matthias B. and Fuchs, Christian and Seidel, Hans-Peter and Lensch, Hendrik P. A.}, TITLE = {Demosaicing by Smoothing along 1D Features}, BOOKTITLE = {IEEE Conference on Computer Vision and Pattern Recognition}, PADDRESS = {IEEE}, ADDRESS = {Anchorage, AK, USA}, MONTH = {June}, ISBN = {978-1-4244-2242-5}, DOI = {10.1109/CVPR.2008.4587653}, YEAR = {2008}, PAGES = {1--8}, ABSTRACT = {Most digital cameras capture color pictures in the form of an image mosaic, recording only one color channel at each pixel position. Therefore, an interpolation algorithm needs to be applied to reconstruct the missing color information. In this paper we present a novel Bayer pattern demosaicing approach, employing stochastic global optimization performed on a pixel neighborhood. We are minimizing a newly developed cost function that increases smoothness along one-dimensional image features. While previous algorithms have been developed focusing on LDR images only, our optimization scheme and the underlying cost function are designed to handle both LDR and HDR images, creating less demosaicing artifacts, compared to previous approaches.}, } @ARTICLE{Ajdin2009, AUTHOR = {Matusik, Wojciech and Ajdin, Boris and Gu, Jinwei and Lawrence, Jason and Lensch, Hendrik P.A. and Pellacini, Fabio and Rusinkiewicz, Szymon}, JOURNAL = {ACM Transactions on Graphics (Proc. of SIGGRAPH ASIA 2009)}, TITLE = {Printing Spatially-Varying Reflectance}, BOOKTITLE = {Proceedings of ACM SIGGRAPH Asia 2009}, ORGANIZATION = {Association for Computing Machinery (ACM)}, ADDRESS = {New York, NY}, NUMBER = {5}, PUBLISHER = {ACM}, MONTH = {December}, SERIES = {ACM Transactions on Graphics}, VOLUME = {28}, ISBN = {0730-0301}, DOI = {10.1145/1618452.1618474}, YEAR = {2009}, PAGES = {128,1--128,9}, ABSTRACT = {Although real-world surfaces can exhibit significant variation in materials --- glossy, diffuse, metallic, etc. --- printers are usually used to reproduce color or gray-scale images. We propose a complete system that uses appropriate inks and foils to print documents with a variety of material properties. Given a set of inks with known Bidirectional Reflectance Distribution Functions (BRDFs), our system automatically finds the optimal linear combinations to approximate the BRDFs of the target documents. Novel gamut-mapping algorithms preserve the relative glossiness between different BRDFs, and halftoning is used to produce patterns to be sent to the printer. We demonstrate the effectiveness of this approach with printed samples of a number of measured spatially-varying BRDFs.}, } @PHDTHESIS{Albrecht2005, AUTHOR = {Albrecht, Irene}, TITLE = {--Faces and Hands-- : Modeling and Animating Anatomical and Photorealistic Models with Regard to the Communicative Competence of Virtual Humans}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {December}, YEAR = {2005}, ABSTRACT = {In order to be believable, virtual human characters must be able to communicate in a human-like fashion realistically. This dissertation contributes to improving and automating several aspects of virtual conversations. We have proposed techniques to add non-verbal speech-related facial expressions to audiovisual speech, such as head nods for of emphasis. During conversation, humans experience shades of emotions much more frequently than the strong Ekmanian basic emotions. This prompted us to develop a method that interpolates between facial expressions of emotions to create new ones based on an emotion model. In the area of facial modeling, we have presented a system to generate plausible 3D face models from vague mental images. It makes use of a morphable model of faces and exploits correlations among facial features. The hands also play a major role in human communication. Since the basis for every realistic animation of gestures must be a convincing model of the hand, we devised a physics-based anatomical hand model, where a hybrid muscle model drives the animations. The model was used to visualize complex hand movement captured using multi-exposure photography.}, } @INPROCEEDINGS{Albrecht:2002:SSPFA, AUTHOR = {Albrecht, Irene and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Skala, V{\'a}clav}, TITLE = {{Speech Synchronization for Physics-based Facial Animation}}, BOOKTITLE = {Proceedings of the 10th International Conferences in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG 2002)}, PADDRESS = {Plzen, CZ}, ADDRESS = {Plzen, Czech Republic}, PUBLISHER = {UNION Agency}, MONTH = {February}, ISBN = {1213-6972}, YEAR = {2002}, PAGES = {9--16}, ABSTRACT = {We present a method for generating realistic speech-synchronized facial animations using a physics-based approach and support for coarticulation, i.e.\ the coloring of a speech segment by surrounding segments. We have implemented several extensions to the original coarticulation algorithm of Cohen and Massaro. The enhancements include an optimization to improve performance as well as special treatment of closure and release phase of bilabial stops and other phonemes. Furthermore, for phonemes that are shorter than the sampling intervals of the algorithm and might therefore be missed, additional key frames are created to ensure their impact onto the animation. }, } @INPROCEEDINGS{Albrecht:AGNVFES, AUTHOR = {Albrecht, Irene and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Vince, John and Earnshaw, Rae}, TITLE = {Automatic Generation of Non-Verbal Facial Expressions from Speech}, BOOKTITLE = {Advances in Modelling, Animation and Rendering (Proceedings Computer Graphics International 2002)}, ORGANIZATION = {Silicon Graphics Inc.}, PADDRESS = {London, UK}, ADDRESS = {Bradford, UK}, PUBLISHER = {Springer}, MONTH = {July}, ISBN = {1-85233-654-4}, YEAR = {2002}, PAGES = {283--293}, ABSTRACT = {Speech synchronized facial animation that controls only the movement of the mouth is typically perceived as wooden and unnatural. We propose a method to generate additional facial expressions such as movement of the head, the eyes, and the eyebrows fully automatically from the input speech signal. This is achieved by extracting prosodic parameters such as pitch flow and power spectrum from the speech signal and using them to control facial animation parameters in accordance to results from paralinguistic research.}, } @INPROCEEDINGS{Albrecht:CAABHHM, AUTHOR = {Albrecht, Irene and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Breen, Dave and Lin, Ming}, TITLE = {Construction and Animation of Anatomically Based Human Hand Models}, BOOKTITLE = {ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SIGGRAPH-SCA-03)}, PADDRESS = {New York, USA}, ADDRESS = {San Diego, USA}, PUBLISHER = {ACM}, MONTH = {July}, ISBN = {1-58113-659-5}, YEAR = {2003}, PAGES = {98--109,368}, ABSTRACT = {The human hand is a masterpiece of mechanical complexity, able to perform fine motor manipulations and powerful work alike. Designing an animatable human hand model that features the abilities of the archetype created by Nature requires a great deal of anatomical detail to be modeled. In this paper, we present a human hand model with underlying anatomical structure. Animation of the hand model is controlled by muscle contraction values. We employ a physically based hybrid muscle model to convert these contraction values into movement of skin and bones. Pseudo muscles directly control the rotation of bones based on anatomical data and mechanical laws, while geometric muscles deform the skin tissue using a mass-spring system. Thus, resulting animations automatically exhibit anatomically and physically correct finger movements and skin deformations. In addition, we present a deformation technique to create individual hand models from photographs. A radial basis warping function is set up from the correspondence of feature points and applied to the complete structure of the reference hand model, making the deformed hand model instantly animatable.}, } @ARTICLE{Albrecht:MF, AUTHOR = {Albrecht, Irene and Schr{\"o}der, Marc and Haber, J{\"o}rg and Seidel, Hans-Peter}, JOURNAL = {Virtual Reality}, TITLE = {Mixed feelings: Expression of non-basic emotions in a muscle-based talking head}, ADDRESS = {London, UK}, NUMBER = {4}, PUBLISHER = {Springer}, MONTH = {September}, VOLUME = {8}, ISBN = {1359-4338 (Paper) 1434-9957 (Online)}, YEAR = {2005}, PAGES = {201--212}, } @INPROCEEDINGS{Albrecht:MITTY, AUTHOR = {Albrecht, Irene and Haber, J{\"o}rg and K{\"a}hler, Kolja and Schr{\"o}der, Marc and Seidel, Hans-Peter}, EDITOR = {Coquillart, Sabine and Shum, Heung-Yeung and Hu, Shi-Min}, TITLE = {{"May I talk to you? :-)" -- Facial Animation from Text}}, BOOKTITLE = {Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2002)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Bejing, China}, PUBLISHER = {IEEE}, MONTH = {October}, ISBN = {0-7695-1784-6}, YEAR = {2002}, PAGES = {77--86}, ABSTRACT = {We introduce a facial animation system that produces real-time animation sequences including speech synchronization and non-verbal speech-related facial expressions from plain text input. A state-of-the-art text-to-speech synthesis component performs linguistic analysis of the text input and creates a speech signal from phonetic and intonation information. The phonetic transcription is additionally used to drive a speech synchronization method for the physically based facial animation. Further high-level information from the linguistic analysis such as different types of accents or pauses as well as the type of the sentence is used to generate non-verbal speech-related facial expressions such as movement of head, eyes, and eyebrows or voluntary eye blinks. Moreover, emoticons are translated into XML markup that triggers emotional facial expressions.}, } @MASTERSTHESIS{Albrecht:SSP:2001, AUTHOR = {Albrecht, Irene}, TITLE = {Speech Synchronization for Physics-based Animation of Human Face Models}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, YEAR = {2001}, } @INPROCEEDINGS{Albrecht_EG2006.pdf, AUTHOR = {Blanz, Volker and Albrecht, Irene and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Gr{\"o}ller, Eduard and Szirmay-Kalos, L{\'a}szl{\'o}}, TITLE = {Creating Face Models from Vague Mental Images}, BOOKTITLE = {EUROGRAPHICS 2006 (EG'06)}, PADDRESS = {Oxford, UK}, ADDRESS = {Vienna, Austria}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {25}, YEAR = {2006}, PAGES = {645--654}, ABSTRACT = {We present a novel approach to create plausible 3D face models from vague recollections or incomplete descriptions. This task plays an important role in police work, where composite facial images of suspects need to be created from vague descriptions given by the eyewitnesses of an incident. Our approach is based on a morphable model of 3D faces and takes into account correlations among facial features based on human anatomy and ethnicity. Using these correlations, unspeci?ed parts of the target face are automatically completed to yield a coherent face model. The system uses a novel paradigm for navigating face space and provides high-level control of facial attributes as well as the possibility to import facial features from a database. In addition, the user can specify a set of attribute constraints that are used to restrict the target face to a residual subspace. These constraints can also be enforced on the example faces in the database, bringing their appearance closer to the mental image of the user, and thus avoiding confusing exposure to entirely different faces. We also propose a novel approach for adapting the system to local populations based on additional image databases that are converted into our 3D representation by automated shape reconstruction. We demonstrate the applicability of our system in a simulated forensic scenario and compare our results with those obtained by a professional forensic artist using state-of-the-art software for creating composite images in police work.}, } @MASTERSTHESIS{Annen:ASMP:2002, AUTHOR = {Annen, Thomas}, TITLE = {Advanced Shadow Map Parameterization}, SCHOOL = {Hochschule f{\"u}r Technik und Wirtschaft des Saarlandes}, TYPE = {Master's thesis}, MONTH = {September}, YEAR = {2002}, ABSTRACT = {Shadows are an indispensable part of any realistic computer-synthesized image. They contribute important information about spatial relationships among objects in a scene. Todays most common shadow technique is Shadow Mapping proposed by Williams. This thesis presents two new shadow map parameterizations to improve overall shadow quality and making the shadow mapping algorithm capable to handle hemispherical and omnidirectional light sources.}, } @INPROCEEDINGS{Annen:EGSR:2004, AUTHOR = {Annen, Thomas and Kautz, Jan and Durand, Fr{\'e}do and Seidel, Hans-Peter}, EDITOR = {Keller, Alexander and Jensen, Henrik Wann}, TITLE = {Spherical Harmonic Gradients for Mid-Range Illumination}, BOOKTITLE = {Rendering Techniques 2004 : Eurographics Symposium on Rendering}, ORGANIZATION = {Eurographics Association}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Norrk{\"o}ping, Sweden}, PUBLISHER = {Eurographics}, MONTH = {June}, ISBN = {3-905673-12-6}, YEAR = {2004}, PAGES = {331--336}, ABSTRACT = {Spherical harmonics are often used for compact description of incident radiance in low-frequency but distant lighting environments. For interaction with nearby emitters, computing the incident radiance at the center of an object only is not sufficient. Previous techniques then require expensive sampling of the incident radiance field at many points distributed over the object. Our technique alleviates this costly requirement using a first-order Taylor expansion of the spherical-harmonic lighting coefficients around a point. We propose an interpolation scheme based on these gradients requiring far fewer samples (one is often sufficient). We show that the gradient of the incident-radiance spherical harmonics can be computed for little additional cost compared to the coefficients alone. We introduce a semi-analytical formula to calculate this gradient at run-time and describe how a simple vertex shader can interpolate the shading. The interpolated representation of the incident radiance can be used with any low-frequency light-transfer technique.}, } @INPROCEEDINGS{Annen:EGSR:CSM:2007, AUTHOR = {Annen, Thomas and Mertens, Tom and Bekaert, Philippe and Seidel, Hans-Peter and Kautz, Jan}, EDITOR = {Kautz, Jan and Pattanaik,Sumanta}, TITLE = {Convolution Shadow Maps}, BOOKTITLE = {Rendering Techniques 2007: Eurographics Symposium on Rendering}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Grenoble, France}, PUBLISHER = {Eurographics}, MONTH = {June}, SERIES = {Eurographics / ACM SIGGRAPH Symposium Proceedings}, VOLUME = {18}, ISBN = {978-3-905673-52-4}, YEAR = {2007}, PAGES = {51--60}, ABSTRACT = {We present \emph{Convolution Shadow Maps}, a novel shadow representation that affords efficient arbitrary linear filtering of shadows. Traditional shadow mapping is inherently non-linear w.r.t.\ the stored depth values due to the binary shadow test. We linearize the problem by approximating shadow maps as a weighted summation of basis terms. We demonstrate the usefulness of this representation and show that hardware-accelerated anti-aliasing techniques, such as tri-linear filtering, can be applied naturally to Convolution Shadow Maps. This approach can be implemented very efficiently in current generation graphics hardware yielding real-time frame rates.}, } @INPROCEEDINGS{Annen:GI:ESM:2008, AUTHOR = {Annen, Thomas and Mertens, Tom and Seidel, Hans-Peter and Flerackers, Eddy and Kautz, Jan}, EDITOR = {Shaw, Chris and Bartram, Lyn}, TITLE = {Exponential Shadow Maps}, BOOKTITLE = {Proceedings of Graphics Interface 2008}, ORGANIZATION = {IEEE VGTC}, PADDRESS = {Natick, USA}, ADDRESS = {Windsor, Ontario, Canada}, PUBLISHER = {A K Peters}, MONTH = {May}, SERIES = {ACM International Conference Proceeding Series}, VOLUME = {34}, ISBN = {978-1-56881-423-0}, YEAR = {2008}, PAGES = {155--161}, } @INPROCEEDINGS{Annen:GI:VFC:2008, AUTHOR = {Annen, Thomas and Theisel, Holger and R{\"o}ssl, Christian and Ziegler, Gernot and Seidel, Hans-Peter}, EDITOR = {Shaw, Chris and Bartram, Lyn}, TITLE = {Vector Field Contours}, BOOKTITLE = {Proceedings of the Graphics Interface 2008}, ORGANIZATION = {IEEE VGTC}, PADDRESS = {New York, USA}, ADDRESS = {Windsor, Ontario, Canada}, PUBLISHER = {ACM}, ISBN = {978-1-56881-423-0}, YEAR = {2008}, PAGES = {97--105}, } @MASTERSTHESIS{Annen:SHG:2004, AUTHOR = {Annen, Thomas}, TITLE = {Radiance Transfer Using Spherical Harmonic Gradients}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {September}, YEAR = {2004}, ABSTRACT = {Spherical harmonics are often used for compact description of incident radiance in low-frequency but distant lighting environments. For interaction with nearby emitters, computing the incident radiance at the center of an object only is not sufficient. Previous techniques then require expensive sampling of the incident radiance field at many points distributed over the object. Our technique alleviates this costly requirement using a first-order Taylor expansion of the spherical-harmonic lighting coefficients around a point. We propose an interpolation scheme based on these gradients requiring far fewer samples (one is often sufficient). We show that the gradient of the incident-radiance spherical harmonics can be computed for little additional cost compared to the coefficients alone. We introduce a semi-analytical formula to calculate this gradient at run-time and describe how a simple vertex shader can interpolate the shading. The interpolated representation of the incident radiance can be used with any low-frequency light-transfer technique.}, } @INPROCEEDINGS{Annen:SPIE:2006, AUTHOR = {Annen, Thomas and Matusik, Wojciech and Zwicker, Matthias and Pfister, Hanspeter and Seidel, Hans-Peter}, EDITOR = {Woods, Andrew J. and Dodgson, Neil A. and Merritt, John O. and Bolas, Mark T. and McDowall, Ian E.}, TITLE = {Distributed Rendering for Multiview Parallax Displays}, BOOKTITLE = {Proceedings of Stereoscopic Displays and Virtual Reality Systems XIII}, ORGANIZATION = {IS\&T/SPIE}, PADDRESS = {Bellingham, USA}, ADDRESS = {San Jose, USA}, PUBLISHER = {SPIE}, SERIES = {SPIE}, VOLUME = {6055}, ISBN = {0-8194-6095-8}, YEAR = {2006}, PAGES = {231--240}, ABSTRACT = {3D display technology holds great promise for the future of television, virtual reality, entertainment, and visualization. Multiview parallax displays deliver stereoscopic views without glasses to arbitrary positions within the viewing zone. These systems must include a high-performance and scalable 3D rendering subsystem in order to generate multiple views at real-time frame rates. This paper describes a distributed rendering system for large-scale multiview parallax displays built with a network of PCs, commodity graphics accelerators, multiple projectors, and multiview screens. The main challenge is to render various perspective views of the scene and assign rendering tasks effectively. In this paper we investigate two different approaches: Optical multiplexing for lenticular screens and software multiplexing for parallax-barrier displays. We describe the construction of largescale multi-projector 3D display systems using lenticular and parallax-barrier technology. We have developed different distributed rendering algorithms using the Chromium stream-processing framework and evaluate the trade-offs and performance bottlenecks. Our results show that Chromium is well suited for interactive rendering on multiview parallax displays.}, } @PHDTHESIS{ArtDiss2011, AUTHOR = {Tevs, Art}, TITLE = {Deformable shape matching}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {August}, YEAR = {2011}, PAGES = {201}, } @INPROCEEDINGS{Atcheson:2008, AUTHOR = {Atcheson, Bradley and Ihrke, Ivo and Heidrich, Wolfgang and Tevs, Art and Bradley, Derek and Magnor, Marcus and Seidel, Hans-Peter}, TITLE = {Time-resolved 3D Capture of Non-stationary Gas Flows}, BOOKTITLE = {ACM Transactions on Graphics (Proceedings of SIGGRAPH Asia 2008)}, ORGANIZATION = {ACM}, PADDRESS = {New York, NY, USA}, ADDRESS = {Singapore}, PUBLISHER = {ACM}, DOI = {10.1145/1457515.1409085}, YEAR = {2008}, PAGES = {1--9}, ABSTRACT = {Fluid simulation is one of the most active research areas in computer graphics. However, it remains difficult to obtain measurements of real fluid flows for validation of the simulated data. In this paper, we take a step in the direction of capturing flow data for such purposes. Specifically, we present the first time-resolved Schlieren tomography system for capturing full 3D, non-stationary gas flows on a dense volumetric grid. Schlieren tomography uses 2D ray deflection measurements to reconstruct a time-varying grid of 3D refractive index values, which directly correspond to physical properties of the flow. We derive a new solution for this reconstruction problem that lends itself to efficient algorithms that robustly work with relatively small numbers of cameras. Our physical system is easy to set up, and consists of an array of relatively low cost rolling-shutter camcorders that are synchronized with a new approach. We demonstrate our method with real measurements, and analyze precision with synthetic data for which ground truth information is available.}, } @PHDTHESIS{AydinPhD2010, AUTHOR = {Aydin, Tunc Ozan}, TITLE = {Human visual system models in computer graphics}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {December}, YEAR = {2010}, } @INPROCEEDINGS{aydin_2008_spie, AUTHOR = {Aydin, Tunc Ozan and Mantiuk, Rafał and Seidel, Hans-Peter}, EDITOR = {Heimer, Andrea}, TITLE = {Extending Quality Metrics to Full Luminance Range Images}, BOOKTITLE = {Human Vision and Electronic Imaging XIII}, ORGANIZATION = {SPIE}, PADDRESS = {San Jose, USA}, ADDRESS = {San Jose, USA}, PUBLISHER = {SPIE}, MONTH = {January}, YEAR = {2008}, ABSTRACT = {Many quality metrics take as input gamma corrected images and assume that pixel code values are scaled perceptually uniform. Although this is a valid assumption for darker displays operating in the luminance range typical for CRT displays (from 0.1 to 80 $cd/m^2$), it is no longer true for much brighter LCD displays (typically up to 500 $cd/m^2$), plasma displays (small regions up to 1000 $cd/m^2$) and HDR displays (up to 3000 $cd/m^2$). The distortions that are barely visible on dark displays become clearly noticeable when shown on much brighter displays. To estimate quality of images shown on bright displays, we propose a straightforward extension to the popular quality metrics, such as PSNR and SSIM, that makes them capable of handling all luminance levels visible to the human eye without altering their results for typical CRT display luminance levels. Such extended quality metrics can be used to estimate quality of high dynamic range (HDR) images as well as account for display brightness. }, } @INPROCEEDINGS{BaakHMS10_AnalyzingMarkerlessMocap_ECCVHMW, AUTHOR = {Baak, Andreas and Helten, Thomas and M{\"u}ller, Meinard and Pons-Moll, Gerard and Rosenhahn, Bodo and Seidel, Hans-Peter}, EDITOR = {Elgammal, Ahmed and Sigal, Leonid and Rosenhahn, Bodo}, TITLE = {Analyzing and Evaluating Markerless Motion Tracking Using Inertial Sensors}, BOOKTITLE = {Proceedings of the 3nd International Workshop on Human Motion}, PADDRESS = {Berlin}, ADDRESS = {Hersonissos, Crete, Greece}, PUBLISHER = {Springer}, MONTH = {September}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {6553}, YEAR = {2010}, PAGES = {137--150}, } @INPROCEEDINGS{BaakMS08_KeyframeMotion_ACM-MIR, AUTHOR = {Baak, Andreas and M{\"u}ller, Meinard and Seidel, Hans-Peter}, EDITOR = {Lew, Michael S. and Del Bimbo, Alberto and Bakker, Erwin M.}, TITLE = {An Efficient Algorithm for Keyframe-based Motion Retrieval in the Presence of Temporal Deformations}, BOOKTITLE = {Proceedings of the 1st ACM SIGMM International Conference on Multimedia Information Retrieval}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, NY, USA}, ADDRESS = {Vancouver, British Columbia, Canada}, PUBLISHER = {ACM}, MONTH = {October}, ISBN = {978-1-60558-312-9}, DOI = {10.1145/1460096.1460169}, YEAR = {2008}, PAGES = {451--458}, ABSTRACT = {In the last years, various algorithms have been proposed for automatic classification and retrieval of motion capture data. Here, one main difficulty is due to the fact that similar types of motions may exhibit significant spatial as well as temporal variations. To cope with such variations, previous algorithms often rely on warping and alignment techniques that are computationally time and cost intensive. In this paper, we present a novel keyframe-based algorithm that significantly speeds up the retrieval process and drastically reduces memory requirements. In contrast to previous index-based strategies, our recursive algorithm can cope with temporal variations. In particular, the degree of admissible deformation tolerance between the queried keyframes can be controlled by an explicit stiffness parameter. While our algorithm works for general multimedia data, we concentrate on demonstrating the practicability of our concept by means of the motion retrieval scenario. Our experiments show that one can typically cut down the search space from several hours to a couple of minutes of motion capture data within a fraction of a second.}, } @INCOLLECTION{BaakMuBhSeTh12_DataDrivenDepthTracking_BookChapter, AUTHOR = {Baak, Andreas and M{\"u}ller, Meinard and Bharaj, Gaurav and Seidel, Hans-Peter and Theobalt, Christian}, EDITOR = {Fossati, Andrea and Gall, Juergen and Grabner, Helmut and Ren, Xiaofeng and Konolige, Kurt}, TITLE = {A Data-Driven Approach for Real-Time Full Body Pose Reconstruction from a Depth Camera}, BOOKTITLE = {Consumer Depth Cameras for Computer Vision - Research Topics and Applications}, CHAPTER = {Human Body Analysis}, ADDRESS = {London}, PUBLISHER = {Springer}, SERIES = {Advances in Computer Vision and Pattern Recognition}, ISBN = {978-1-4471-4639-1}, DOI = {10.1007/978-1-4471-4640-7_5}, YEAR = {2012}, PAGES = {71--98}, } @INPROCEEDINGS{BaakMuBhSeTh2011_DataDrivenDepthTracking_ICCV, AUTHOR = {Baak, Andreas and M{\"u}ller, Meinard and Bharaj, Gaurav and Seidel, Hans-Peter and Theobalt, Christian}, TITLE = {A Data-Driven Approach for Real-Time Full Body Pose Reconstruction from a Depth Camera}, BOOKTITLE = {2011 IEEE International Conference on Computer Vision (ICCV)}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Barcelona, Spain}, PUBLISHER = {IEEE}, ISBN = {978-1-4577-1101-5}, DOI = {10.1109/ICCV.2011.6126356}, YEAR = {2011}, PAGES = {1092--1099}, } @INPROCEEDINGS{BaakRMS09_StabilizedTracking_ICCV, AUTHOR = {Baak, Andreas and M{\"u}ller, Meinard and Rosenhahn, Bodo and Seidel, Hans-Peter}, EDITOR = {Cipolla, Roberto and Hebert, Martial and Tang, Xiaoou and Yokoya, Naokazu}, TITLE = {Stabilizing Motion Tracking Using Retrieved Motion Priors}, BOOKTITLE = {Twelfth IEEE International Conference on Computer Vision (ICCV 2009)}, PADDRESS = {Los Alamitos, CA}, ADDRESS = {Kyoto, Japan}, PUBLISHER = {IEEE Computer Society}, ISBN = {978-1-4244-4419-9}, YEAR = {2009}, PAGES = {1428--1435}, } @INPROCEEDINGS{Baboud2011, AUTHOR = {Baboud, Lionel and {\v{C}}ad{\'i}k, Martin and Eisemann, Elmar and Seidel, Hans-Peter}, EDITOR = {Felzenszwalb, Pedro and Forsyth, David and Fua, Pascal}, TITLE = {Automatic Photo-to-Terrain Alignment for the Annotation of Mountain Pictures}, BOOKTITLE = {2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)}, ORGANIZATION = {IEEE}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Colorado Springs, USA}, PUBLISHER = {IEEE}, ISBN = {978-1-4577-0394-2}, DOI = {10.1109/CVPR.2011.5995727}, YEAR = {2011}, PAGES = {41--48}, } @ARTICLE{Baboud2012, AUTHOR = {Baboud, Lionel and Eisemann, Elmar and Seidel, Hans-Peter}, JOURNAL = {IEEE transactions on visualization and computer graphics}, TITLE = {Precomputed Safety Shapes for Efficient and Accurate Height-Field Rendering}, ADDRESS = {Piscataway, NJ}, NUMBER = {11}, PUBLISHER = {IEEE}, VOLUME = {18}, ISBN = {1077-2626}, DOI = {10.1109/TVCG.2011.281}, YEAR = {2012}, PAGES = {1811--1823}, } @INPROCEEDINGS{Bachynskyi2012, AUTHOR = {Bachynskyi, Myroslav and Oulasvirta, Antti and Palmas, Gregorio and Weinkauf, Tino}, TITLE = {Biomechanical Simulation in the Analysis of Aimed Movements}, BOOKTITLE = {Extended Abstracts (Works in Progress) CHI'13}, ORGANIZATION = {Association for Computing Machinery (ACM)}, TYPE = {Extended Abstract}, PADDRESS = {New York}, ADDRESS = {Paris, France}, PUBLISHER = {ACM}, MONTH = {April}, YEAR = {2013}, PAGES = {1--6}, } @INPROCEEDINGS{Bailly2013, AUTHOR = {Bailly, Gilles and Oulasvirta, Antti and Koetzing, Timo and Hoppe, Sabrina}, TITLE = {Menuoptimizer: Interactive optimization of menu systems}, BOOKTITLE = {Proceedings of the 26th annual ACM symposium on User interface software and technology}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, USA}, ADDRESS = {St. Andrews, UK}, PUBLISHER = {ACM}, YEAR = {2013}, PAGES = {331--342}, } @ARTICLE{Banterle2009, AUTHOR = {Banterle, Francesco and Debattista, Kurt and Artusi, Alessandro and Pattanaik, Sumanta and Myszkowski, Karol and Ledda, Patrick and Bloj, Marina and Chalmers, Alan}, EDITOR = {Pauly, Marc and Greiner, G{\"u}nther}, JOURNAL = {Computer Graphics Forum}, TITLE = {High Dynamic Range Imaging and {LDR }Expansion for Generating {HDR} Content}, BOOKTITLE = {EUROGRAPHICS State-of-the-Art Reports}, ADDRESS = {Oxford}, NUMBER = {8}, PUBLISHER = {Blackwell}, VOLUME = {28}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2009.01541.x}, YEAR = {2009}, PAGES = {2343--2367}, ABSTRACT = {In the last few years researches in the field of High Dynamic Range (HDR) Imaging have focused on providing tools for expanding LDR content for the generation of HDR images due to the growing popularity of HDR in applications, such as photography and rendering via Image-Based Lighting, and the imminent arrival of HDR displays to the consumer market. LDR content expansion is required due to the lack of fast and reliable consumer level HDR capture for still images and videos. Furthermore, LDR content expansion, will allow the re-use of legacy LDR stills, videos and LDR applications created, over the last century and more, to be widely available. The use of certain LDR expansion methods, those that are based on the inversion of tone mapping operators, has made it possible to create novel compression algorithms that tackle the problem of the size of HDR content storage, which remains one of the major obstacles to be overcome for the adoption of HDR. These methods are used in conjunction with traditional LDR compression methods and can evolve accordingly. The goal of this report is to provide a comprehensive overview on HDR Imaging, and an in depth review on these emerging topics. Moreover, we are proposing how to classify and to validate them. We will discuss limitations of these methods, and identify remaining challenges for the future.}, } @INPROCEEDINGS{Bargmann2005, AUTHOR = {Bargmann, Robert and Blanz, Volker and Seidel, Hans-Peter}, EDITOR = {Chen, Bing-Yu}, TITLE = {Learning-Based Facial Rearticulation Using Streams of {3D} Scans}, BOOKTITLE = {The 14th Pacific Conference on Computer Graphics and Applications}, PADDRESS = {Taipei, Taiwan}, ADDRESS = {Taipei, Taiwan}, PUBLISHER = {National Taiwan University}, MONTH = {October}, YEAR = {2006}, PAGES = {232--241}, ABSTRACT = {In this paper, we present a new approach that generates synthetic mouth articulations from an audio file and that transfers them to different face meshes. It is based on learning articulations from a stream of 3D scans of a real person acquired by a structured light scanner at 40 three-dimensional frames per second. Correspondence between these scans over several speech sequences is established via optical flow. We propose a novel type of Principal Component Analysis that considers variances only in a sub-region of the face, while retaining the full dimensionality of the original vector space of sample scans. Audio is recorded at the same time, so the head scans can be synchronized with phoneme and viseme information for computing viseme clusters. Given a new audio sequence along with text data, we are able to quickly create in a fully automated fashion an animation synchronized with that new sentence by morphing between the visemes along a path in viseme-space. The methods described in the paper include an automated process for data analysis in streams of 3D scans, and a framework that connects the system to existing static face modeling technology for articulation transfer.}, } @ARTICLE{Bartoli2012, AUTHOR = {Bartoli, Adrien and Magnor, Marcus and Fisher, Bob and Theobalt, Christian}, JOURNAL = {International Journal of Computer Vision}, TITLE = {Editorial for the Special Issue on 3D Data Processing, Visualization and Transmission}, ADDRESS = {New York, NY}, NUMBER = {1}, PUBLISHER = {Springer}, VOLUME = {97}, ISBN = {0920-5691}, DOI = {10.1007/s11263-011-0513-4}, YEAR = {2012}, PAGES = {1--1}, } @INPROCEEDINGS{BasBlaVet03, AUTHOR = {Basso, Curzio and Blanz, Volker and Vetter, Thomas}, TITLE = {Regularized 3D Morphable Models}, BOOKTITLE = {Workshop on Higher-Level Knowledge in 3D Modeling and Motion Analysis at ICCV}, PADDRESS = {-}, ADDRESS = {Nice, France}, PUBLISHER = {-}, YEAR = {2003}, } @MASTERSTHESIS{BazineMaster2010, AUTHOR = {Bazine, Youssef}, TITLE = {Image-based Bilateral Symmetry Estimation}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {February}, YEAR = {2010}, } @MASTERSTHESIS{Bchl2013:HoppeSabrina, AUTHOR = {Hoppe, Sabrina}, TITLE = {Exploring Ant Colony Optimisation for the Keyboard Arrangement Problem}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Bachelor thesis}, MONTH = {March}, YEAR = {2013}, } @MASTERSTHESIS{Bchl2014:ZinsAndreas, AUTHOR = {Zins, Andreas}, TITLE = {Importance sampling using GPU Photon Mapping}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Bachelor thesis}, MONTH = {June}, YEAR = {2014}, } @INPROCEEDINGS{Beigpour2016BMVC, AUTHOR = {Beigpour, Shida}, TITLE = {Multi-view Multi-illuminant Intrinsic Dataset}, BOOKTITLE = {British Machine Vision Conference (BMVC 2016)}, PADDRESS = {England}, ADDRESS = {York, England}, PUBLISHER = {BMVA}, YEAR = {2016}, } @MISC{Bekaert2001_dagstuhl, AUTHOR = {Bekaert, Philippe}, TITLE = {A theoretical comparison of Monte Carlo radiosity algorithms}, HOWPUBLISHED = {Dagstuhl Seminar nr. 01242 on Stochastic Methods in Rendering, Schloss Dagstuhl, Wadern, Germany}, MONTH = {June}, YEAR = {2001}, } @INPROCEEDINGS{Bekaert2001_vmv, AUTHOR = {Bekaert, Philippe and Seidel, Hans-Peter}, EDITOR = {Ertl, Thomas and Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {A Theoretical Comparison of Monte Carlo Radiosity Algorithms}, BOOKTITLE = {Vision, Modeling and Visualization 2001 (VMV-2001)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Stuttgart, Germany}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, MONTH = {November}, ISBN = {3-89838-028-9 1-58603-221-6}, YEAR = {2001}, PAGES = {257--264}, NOTE = {Accepted for publication}, } @TECHREPORT{BekaertSlusallekCoolsHavranSeidel, AUTHOR = {Bekaert, Philippe and Slusallek, Philipp and Cools, Ronald and Havran, Vlastimil and Seidel, Hans-Peter}, TITLE = {A custom designed density estimation method for light transport}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Saarbr{\"u}cken}, NUMBER = {MPI-I-2003-4-004}, MONTH = {September}, YEAR = {2003}, PAGES = {28}, } @INPROCEEDINGS{Bekaert_egrw2002, AUTHOR = {Bekaert, Philippe and Sbert, Mateu and Halton, John}, EDITOR = {Debevec, Paul and Gibson, Simon}, TITLE = {Accelerating Path Tracing by re-using Paths}, BOOKTITLE = {Rendering Techniques 2002}, ORGANIZATION = {Eurographics Association}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Pisa, Italy}, PUBLISHER = {Eurographics}, MONTH = {June}, YEAR = {2002}, PAGES = {124--135}, ABSTRACT = {This paper describes a new acceleration technique for rendering algorithms like path tracing, that use so called gathering random walks. Usually in path tracing, each traced path is used in order to compute a contribution to only a single point on the virtual screen. We propose to combine paths traced through nearby screen points in such a way that each path contributes to multiple screen points in a provably good way. Our approach is unbiased and is not restricted to diffuse light scattering. It complements previous image noise reduction techniques for Monte Carlo ray tracing. We observe speed-ups in the computation of indirect illumination of one order of magnitude.}, } @ARTICLE{Belyaev2002j2, AUTHOR = {Yagou, Hirokazu and Belyaev, Alexander and Wei, Daming}, JOURNAL = {The Journal of Three Dimensional Images}, TITLE = {Shape Deblurring with Unsharp Masking Applied to Mesh Normals}, NUMBER = {4}, VOLUME = {16}, ISBN = {1342-2189}, YEAR = {2002}, PAGES = {79--84}, ABSTRACT = {Unsharp masking is a well-known image sharpening technique. Given an image and its smoothed version, amplifying high frequencies of the image via unsharp masking is achieved by linear extrapolation of the input images. In this paper, we adapt the unsharp masking technique for 3D shape deblurring purposes. Consider a blurred shape represented by a triangle mesh. Usually such a shape results from a 3D data corrupted by noise and then oversmoothed. First we apply unsharp masking to the mesh normals. To smooth the filed of mesh normals we use several local averaging iterations applied to the mesh normals (iterative mean filtering). Then we apply linear extrapolation of the original and smoothed fields of normals. Finally we reconstruct the deblurred mesh by integrating the field of extrapolated normals. We also give a quantitative evaluation of the proposed unsharp masking technique. To perform the evaluation, we use $L^2$ error metrics on mesh vertices and normals. Experimental results show that the unsharp masking technique is effective for shape deblurring.}, } @INPROCEEDINGS{Belyaev2003, AUTHOR = {Bogaevski, Ilia and Lang, Veronique and Belyaev, Alexander and Kunii, Tosiyasu L.}, TITLE = {Color ridges on implicit polynomial surfaces}, BOOKTITLE = {Proceedings GraphiCon 2003}, PADDRESS = {Moscow, Russia}, ADDRESS = {Moscow, Russia}, PUBLISHER = {Moscow State University}, MONTH = {September}, YEAR = {2003}, PAGES = {161--164}, } @ARTICLE{Belyaev2004ridge, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Ridge-valley lines on meshes via implicit surface fitting}, ADDRESS = {New York, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {August}, VOLUME = {23}, YEAR = {2004}, PAGES = {609 -- 612}, NOTE = {(Proc. ACM SIGGRAPH '04)}, ABSTRACT = {We propose a simple and effective method for detecting view- and scale-independent ridge-valley lines defined via first- and second-order curvature derivatives on shapes approximated by dense triangle meshes. A high-quality estimation of high-order surface derivatives is achieved by combining multi-level implicit surface fitting and finite difference approximations. We demonstrate that the ridges and valleys are geometrically and perceptually salient surface features and, therefore, can be potentially used for shape recognition, coding, and quality evaluation purposes.}, } @PROCEEDINGS{BelyaevSGP2007, EDITOR = {Belyaev, Alexander G. and Garland, Michael}, TITLE = {Proceedings of the 5th Eurographics Symposium on Geometry Processing}, ORGANIZATION = {Association of Computing Machinery (ACM)}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Barcelona, Spain}, PUBLISHER = {Eurographics Association}, SERIES = {ACM International Conference Proceeding Series}, VOLUME = {257}, ISBN = {978-3-905673-46-3}, YEAR = {2007}, PAGES = {1--282}, } @INPROCEEDINGS{Belyaev_mos05, AUTHOR = {Belyaev, Alexander and Anoshkina, Elena}, EDITOR = {Martin, Ralph and Bez, Helmut and Sabin, Malcolm}, TITLE = {Detection of Surface Creases in Range Data}, BOOKTITLE = {Mathematics of surfaces XI : 11th IMA International Conference}, PADDRESS = {Berlin, Germany}, ADDRESS = {Loughborough, UK}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3604}, ISBN = {3-540-28225-4}, YEAR = {2005}, PAGES = {50--61}, ABSTRACT = {We propose a fully automatic and view-independent computational procedure for detecting salient curvature extrema in range data. Our method consists of two major steps: (1) smoothing given range data by applying a nonlinear diffusion of normals with automatic thresholding; (2) using a Canny-like non-maximum suppression and hysteresis thresholding operations for detecting crease pixels. A delicate analysis of curvature extrema properties allows us to make those Canny-like image processing operations orientation-independent. The detected patterns of creases can be considered as ``shape fingerprints''. The proposed method can be potentially used for shape recognition, quality evaluation, and matching purposes.}, } @INPROCEEDINGS{Belyaev_sgp06b, AUTHOR = {Belyaev, Alexander}, EDITOR = {Sheffer, Alla and Polthier, Konrad}, TITLE = {On Transfinite Barycentric Coordinates}, BOOKTITLE = {SGP 2006 : Fourth Eurographics/ACM SIGGRAPH Symposium on Geometry Processing}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Cagliari, Sardinia, Italy}, PUBLISHER = {Eurographics}, ISBN = {3-905673-36-3}, YEAR = {2006}, PAGES = {89--99}, ABSTRACT = {A general construction of trans_nite barycentric coordinates is obtained as a simple and natural generalization of Floater's mean value coordinates [Flo03, JSW05b]. The Gordon-Wixom interpolation scheme [GW74] and trans_nite counterparts of discrete harmonic and Wachspress-Warren coordinates are studied as particular cases of that general construction. Motivated by _nite element/volume applications, we study capabilities of trans_nite barycentric interpolation schemes to approximate harmonic and quasi-harmonic functions. Finally we establish and analyze links between trans_nite barycentric coordinates and certain inverse problems of di_erential and convex geometry.}, } @INPROCEEDINGS{Belyaev_vlsm05, AUTHOR = {Galic, Irena and Weickert, Joachim and Welk, Martin and Bruhn, Andres and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Paragios, Nikos and Faugeras, Olivier and Chan, Tony and Schn{\"o}rr, Christoph}, TITLE = {Towards {PDE}-Based Image Compression}, BOOKTITLE = {Variational, geometric, and level set methods in computer vision : Third International Workshop, VLSM 2005}, PADDRESS = {Berlin, Germany}, ADDRESS = {Beijing, China}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3752}, ISBN = {3-540-29348-5}, YEAR = {2005}, PAGES = {37--48}, } @INPROCEEDINGS{benthin:04:FreeFormRT, AUTHOR = {Benthin, Carsten and Wald, Ingo and Slusallek, Philipp}, EDITOR = {van Zijl, Lynette and Marais, Patrick}, TITLE = {{Interactive} {Ray} {Tracing} of {Free-Form} {Surfaces}}, BOOKTITLE = {Proceedings AFRIGRAPH 2004 : 3rd International Conference on Virtual Reality, Computer Graphics, Visualisation and Interaction in Africa}, PADDRESS = {New York, USA}, ADDRESS = {Stellenbosch, South Africa}, PUBLISHER = {ACM}, ISBN = {1-58113-863-6}, YEAR = {2004}, PAGES = {99--106}, ABSTRACT = { Even though the speed of software ray tracing has recently been increased to interactive performance even on standard PCs, these systems usually only supported triangles as geometric primitives. Directly handling free-form surfaces such as spline or subdivision surfaces instead of first tessellating them offers many advantages such as higher precision results, reduced memory requirements, and faster preprocessing due to less primitives. However, existing algorithms for ray tracing free-form surfaces are much too slow for interactive use. In this paper we present a simple and generic approach for ray tracing free-form surfaces together with specific implementations for cubic B\'ezier and Loop subdivision surfaces. We show that our approach allows to increase the performance by more than an order of magnitude, requires only constant memory, and is largely independent on the total number of free-form primitives in a scene. Examples demonstrate that even scene with over one hundred thousand free-form surfaces can be rendered interactively on a single processor at video resolution.}, } @INPROCEEDINGS{Berger2011, AUTHOR = {Berger, Kai and Reshetouski, Ilya and Magnor, Marcus and Ihrke, Ivo}, EDITOR = {Eisert, Peter and Hornegger, Joachim and Polthier, Konrad}, TITLE = {Measuring {BRDFs} of Immersed Materials}, BOOKTITLE = {16th International Workshop on Vision, Modeling and Visualization}, PADDRESS = {Goslar}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Eurographics Association}, ISBN = {978-3-905673-85-2}, YEAR = {2011}, PAGES = {325--330}, } @INPROCEEDINGS{Berner2008, AUTHOR = {Berner, Alexander and Bokeloh, Martin and Wand, Michael and Schilling, Andreas and Seidel, Hans-Peter}, TITLE = {A Graph-Based Approach to Symmetry Detection}, BOOKTITLE = {Symposium on Volume and Point-Based Graphics}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Los Angeles, CA}, PUBLISHER = {Eurographics Association}, YEAR = {2008}, PAGES = {1--8}, } @ARTICLE{Berner2011SubspaceSymmetry, AUTHOR = {Berner, Alexander and Wand, Michael and Mitra, Niloy J. and Mewes, Daniel and Seidel, Hans-Peter}, EDITOR = {Chen, M. and Deussen, O.}, JOURNAL = {Computer Graphics Forum (Proceedings EUROGRAPHICS 2011)}, TITLE = {Shape Analysis with Subspace Symmetries}, BOOKTITLE = {Computer Graphics Forum}, ORGANIZATION = {EG}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell}, MONTH = {April}, SERIES = {Proceedings Eurographics 2011}, VOLUME = {30}, DOI = {10.1111/j.1467-8659.2011.01859.x}, YEAR = {2011}, PAGES = {277--286}, ABSTRACT = {We address the problem of partial symmetry detection, i.e., the identification of building blocks a complex shape is composed of. Previous techniques identify parts that relate to each other by simple rigid mappings, similarity transforms, or, more recently, intrinsic isometries. Our approach generalizes the notion of partial symmetries to more general deformations. We introduce subspace symmetries whereby we characterize similarity by requiring the set of symmetric parts to form a low dimensional shape space. We present an algorithm to discover subspace symmetries based on detecting linearly correlated correspondences among graphs of invariant features. The detected subspace symmetries along with the modeled variations are useful for a variety of applications including shape completion, non-local and non-rigid denoising. We evaluate our technique on various data sets. We show that for models with pronounced surface features, subspace symmetries can be found fully automatically. For complicated cases, a small amount of user input is used to resolve ambiguities. Our technique computes dense correspondences that can subsequently be used in various applications, such as model repair and denoising.}, } @INPROCEEDINGS{bib:Yamauchi:SMI:2005, AUTHOR = {Yamauchi, Hitoshi and Saleem, Waqar and Yoshizawa, Shin and Karni, Zachi and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Spagnuolo, Michaela and Belyaev, A. and Suzuki, Hiromasa}, TITLE = {Towards Stable and Salient Multi-View Representation of 3D Shapes}, BOOKTITLE = {IEEE International Conference on Shape Modeling and Applications 2006 (SMI 2006)}, ORGANIZATION = {IEEE VGTC}, TYPE = {Short Paper}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Matsushima, JAPAN}, PUBLISHER = {IEEE}, MONTH = {June}, ISBN = {0-7695-2591-1}, YEAR = {2006}, PAGES = {265--270}, ABSTRACT = {An approach to automatically select stable and salient representative views of a given 3D object is proposed. Initially, a set of viewpoints are uniformly sampled from the surface of a bounding sphere. The sampled viewpoints are connected to their closest points to form a spherical graph in which each edge is weighted by a similarity measure between the two views from its incident vertices. Partitions of similar views are obtained using a graph partitioning procedure and their ``centroids'' are considered to be their representative views. Finally, the views are ranked based on a saliency measure to form the object's representative views. This leads to a compact, human-oriented 2D description of a 3D object, and as such, is useful both for traditional applications like presentation and analysis of 3D shapes, and for emerging ones like indexing and retrieval in large shape repositories.}, } @INCOLLECTION{bib:Yamauchi:TAOCP2:2004, AUTHOR = {Knuth, Donald E. and Saitou, Hiroaki and Nagao, Takahiro and Matui, Shougo and Matui, Takao and Yamauchi, Hitoshi}, EDITOR = {Arisawa, Makoto and Wada, Eiichi}, TITLE = {3.3.4., The spectral test ; 3.4., Other tyes of random quantities; 3.5., What is a random sequence; 3.6., Summary}, BOOKTITLE = {The Art of Computer Programming. - Volume 2, Seminumerical Algorithms (Japanese Edition)}, CHAPTER = {3.3.4, 3.4., 3.5, 3.6}, ADDRESS = {Tokyo, Sinjyuku}, PUBLISHER = {ASCII}, MONTH = {October}, SERIES = {Addison Wesley programming series}, VOLUME = {2}, ISBN = {4-7561-4543-4}, YEAR = {2004}, PAGES = {85--182,548-576}, NOTE = {This is the Japanese translation of ``The art of computer programming'' by Danld E. Knuth.}, } @MISC{Bihlmaier2003, AUTHOR = {Li, Ming and Bihlmaier, Sabina and Ahrenberg, Lukas and Theobalt, Christian and Magnor, Marcus}, TITLE = {A Synthetic Test Data Set for Rendering/Reconstruction Methods in EE2}, HOWPUBLISHED = {MPEG Input Document M9887, ISO/IEC JTC1/SC29/WG11, Trondheim, Norway}, MONTH = {July}, YEAR = {2003}, } @INPROCEEDINGS{Bischoff2000, AUTHOR = {Bischoff, Stephan and Kobbelt, Leif and Seidel, Hans-Peter}, EDITOR = {Spencer, Stephen N.}, TITLE = {Towards hardware implementation of {L}oop subdivision}, BOOKTITLE = {Proceedings of 2000 SIGGRAPH/Eurographics Workshop on Graphics Hardware}, ORGANIZATION = {ACM SIGGRAPH}, PADDRESS = {New York, USA}, ADDRESS = {Interlaken, Switzerland}, PUBLISHER = {ACM}, MONTH = {August}, ISBN = {1-58113-257-3}, YEAR = {2000}, PAGES = {41--50}, ABSTRACT = {We present a novel algorithm to evaluate and render Loop subdivision surfaces. The algorithm exploits the fact that Loop subdivision surfaces are piecewise polynomial and uses the forward difference technique for efficiently computing uniform samples on the limit surface. The main advantage of our algorithm is that it only requires a small and constant amount of memory that does not depend on the subdivision depth. The simple structure of the algorithm enables a scalable degree of hardware implementation. By low-level parallelization of the computations, we can reduce the critical computation costs to a theoretical minimum of about one {\tt float[3]}-operation per triangle.}, } @ARTICLE{Bittner2002:JVCA, AUTHOR = {Bittner, Jiri and Havran, Vlastimil}, JOURNAL = {The Journal of Visualization and Computer Animation}, TITLE = {Exploiting coherence in hierarchical visibility algorithms}, ADDRESS = {New York}, NUMBER = {5}, PUBLISHER = {Wiley InterScience}, MONTH = {December}, VOLUME = {12}, ISBN = {1049-8907}, YEAR = {2001}, PAGES = {277--286}, } @ARTICLE{BlaAlbHabSeid06, AUTHOR = {Blanz, Volker and Albrecht, Irene and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Szirmay-Kalos, L{\'a}szl{\'o} and Gr{\"o}ller, Eduard}, JOURNAL = {Computer Graphics Forum}, TITLE = {Creating Face Models from Vague Mental Images}, BOOKTITLE = {EUROGRAPHICS 2006 (EG'06)}, ADDRESS = {Oxford, UK}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, SERIES = {Computer Graphics Forum}, VOLUME = {25}, YEAR = {2006}, PAGES = {645--654}, } @INPROCEEDINGS{BlaBasVetPog2003, AUTHOR = {Blanz, Volker and Basso, Curzio and Vetter, Thomas and Poggio, Tomaso}, EDITOR = {Brunet, Pere and Fellner, Dieter W.}, TITLE = {Reanimating Faces in Images and Video}, BOOKTITLE = {EUROGRAPHICS 2003 (EUROGRAPHICS-03) : the European Association for Computer Graphics, 24th Annual Conference}, ORGANIZATION = {The Eurographics Association}, PADDRESS = {Oxford, UK}, ADDRESS = {Granada, Spain}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {22}, ISBN = {0167-7055}, YEAR = {2003}, PAGES = {641--650}, NOTE = {accepted.}, ABSTRACT = {This paper presents a method for photo-realistic animation that can be applied to any face shown in a single image or a video. The technique does not require example data of the person's mouth movements, and the image to be animated is not restricted in pose or illumination. Video reanimation allows for head rotations and speech in the original sequence, but neither of these motions is required. In order to animate novel faces, the system transfers mouth movements and expressions across individuals, based on a common representation of different identities and facial expressions in a vector space of 3D shapes and textures. This space is computed from 3D scans of different neutral faces, and scans of facial expressions. The 3D model's versatility with respect to pose and illumination is conveyed to photo-realistic image and video processing by a framework of analysis and synthesis algorithms: The system automatically estimates 3D shape and all relevant rendering parameters, such as pose, from single images. In video, head pose and mouth movements are tracked automatically. Reanimated with new mouth movements, the 3D face is rendered into the original images.}, } @INPROCEEDINGS{BlaGroPhiVet05, AUTHOR = {Blanz, Volker and Grother, Patrick and Phillips, Jonathon and Vetter, Thomas}, TITLE = {Face Recognition based on Frontal Views generated from Non-Frontal Images}, BOOKTITLE = {2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2005)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {San Diego, CA, USA}, PUBLISHER = {IEEE}, ISBN = {0-7695-2372-2}, YEAR = {2005}, PAGES = {446--453}, } @INPROCEEDINGS{BlaMeVetSei04, AUTHOR = {Blanz, Volker and Mehl, Albert and Vetter, Thomas and Seidel, Hans-Peter}, EDITOR = {Aloimonos, Yiannis and Taubin, Gabriel}, TITLE = {A Statistical Method for Robust 3D Surface Reconstruction from Sparse Data}, BOOKTITLE = {2nd International Symposium on 3D Data Processing, Visualization, and Transmission, 3DPVT 2004}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Thessaloniki, Greece}, PUBLISHER = {IEEE}, ISBN = {0-7695-2}, YEAR = {2004}, PAGES = {293--300}, } @INPROCEEDINGS{BlanzAIHC2007, AUTHOR = {Blanz, Volker}, EDITOR = {Huang, T.S. and Nijholt, A. and Pantic, M. and Pentland, A.}, TITLE = {A Learning-Based High-Level Human Computer Interface for Face Modeling and Animation}, BOOKTITLE = {Artificial Intelligence for Human Computing, ICMI 2006 and IJCAI 2007 International Workshop}, PADDRESS = {Heidelberg, Germany}, ADDRESS = {Banff, Canada and Hyderabad, India}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4451}, ISBN = {978-3-540-72346-2}, YEAR = {2007}, PAGES = {296--315}, } @INPROCEEDINGS{BlanzFG2006, AUTHOR = {Blanz, Volker}, TITLE = {Face Recognition based on a 3D Morphable Model}, BOOKTITLE = {Proceedings of the 7th IEEE International Conference on Automatic Face and Gesture Recognition (FG 2006)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Southampton, UK}, PUBLISHER = {IEEE Computer Society}, ISBN = {0-7695-2503-2}, YEAR = {2006}, PAGES = {617--624}, } @INPROCEEDINGS{BlanzICMI2006, AUTHOR = {Blanz, Volker}, EDITOR = {Quek, F.K.H. and Yang, J. and Massaro, D.W. and Alwan, A.A. and Hazen, T.J.}, TITLE = {Computing human faces for human viewers: automated animation in photographs and paintings}, BOOKTITLE = {Proceedings of the 8th International Conference on Multimodal Interfaces (ICMI 2006)}, PADDRESS = {New York, USA}, ADDRESS = {Banff, Canada}, PUBLISHER = {ACM}, ISBN = {1-59593-541-X}, YEAR = {2006}, PAGES = {249--256}, } @INPROCEEDINGS{BlanzNIPS2006, AUTHOR = {Steinke, Florian and Sch{\"o}lkopf, Bernhard and Blanz, Volker}, EDITOR = {Sch{\"o}lkopf, Bernhard and Platt, John C. and Hoffman, Thomas}, TITLE = {Learning Dense 3D Correspondence}, BOOKTITLE = {Proceedings of the 20th Annual Conference on Neural Information Processing Systems}, PADDRESS = {Cambridge, USA}, ADDRESS = {Vancouver, Canada}, PUBLISHER = {MIT}, ISBN = {0-262-19568-2}, YEAR = {2007}, PAGES = {1313--1320}, } @ARTICLE{BlanzRiesenhuber2006, AUTHOR = {Jiang, X. and Rosen, E. and Zeffiro, T. and VanMeter, J. and Blanz, Volker and Riesenhuber, M.}, JOURNAL = {Neuron}, TITLE = {Evaluation of a Shape-Based Model of Human Face Dicrimination Using fMRI and Behavorial Techniques}, VOLUME = {50}, YEAR = {2006}, PAGES = {159--172}, } @ARTICLE{BlanzVetter2003, AUTHOR = {Blanz, Volker and Vetter, Thomas}, JOURNAL = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, TITLE = {Face Recognition Based on Fitting a 3D Morphable Model}, ADDRESS = {Los Alamitos, USA}, NUMBER = {9}, PUBLISHER = {IEEE}, MONTH = {September}, VOLUME = {25}, ISBN = {0162-8828}, YEAR = {2003}, PAGES = {1063 -- 1074}, ABSTRACT = {This paper presents a method for face recognition across variations in pose ranging from frontal to profile views, and across a wide range of illuminations, including cast shadows and specular reflections. To account for these variations, the algorithm simulates the process of image formation in 3D space, using computer graphics, and it estimates 3D shape and texture of faces from single images. The estimate is achieved by fitting a statistical, morphable model of 3D faces to images. The model is learned from a set of textured 3D scans of heads. We describe the construction of the morphable model, an algorithm to fit the model to images, and a framework for face identification. In this framework, faces are represented by model parameters for 3D shape and texture. We present results obtained with 4488 images from the publicly available CMU-PIE database, and 1940 images from the FERET database.}, } @INPROCEEDINGS{BlaScherVetSei04, AUTHOR = {Blanz, Volker and Scherbaum, Kristina and Vetter, Thomas and Seidel, Hans-Peter}, EDITOR = {Cani, Marie-Paule and Slater, Mel}, TITLE = {Exchanging Faces in Images}, BOOKTITLE = {The European Association for Computer Graphics 25th Annual Conference EUROGRAPHICS 2004}, PADDRESS = {Oxford, UK}, ADDRESS = {Grenoble, France}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {23}, ISBN = {0167-7055}, YEAR = {2004}, PAGES = {669--676}, } @INPROCEEDINGS{BlaScheSei07, AUTHOR = {Blanz, Volker and Scherbaum, Kristina and Seidel, Hans-Peter}, TITLE = {Fitting a Morphable Model to 3D Scans of Faces}, BOOKTITLE = {Eleventh IEEE International Conference on Computer Vision}, PADDRESS = {Rio de Janeiro, Brazil}, ADDRESS = {Rio de Janeiro, Brasil}, PUBLISHER = {IEEE ICCV 2007, Omnipress}, SERIES = {DVD Proceedings}, VOLUME = {CFP07198-CDR}, ISBN = {978-1-4244-1631-8}, YEAR = {2007}, PAGES = {1--8}, ABSTRACT = {This paper presents a top-down approach to 3D data analysis by fitting a Morphable Model to scans of faces. In a unified framework, the algorithm optimizes shape, texture, pose and illumination simultaneously. The algorithm can be used as a core component in face recognition from scans. In an analysis-by-synthesis approach, raw scans are transformed into a PCA-based representation that is robust with respect to changes in pose and illumination. Illumination conditions are estimated in an explicit simulation that involves specular and diffuse components. The algorithm inverts the effect of shading in order to obtain the diffuse reflectance in each point of the facial surface. Our results include illumination correction, surface completion and face recognition on the FRGC database of scans.}, } @TECHREPORT{BlaVetFRVT2002, AUTHOR = {Blanz, Volker and Vetter, Thomas}, TITLE = {Generating Frontal Views from Single, Non-Frontal Images}, INSTITUTION = {Nat. Inst. of Standards and Technology (NIST)}, TYPE = {Face Recognition Vendor Test 2002, Technical Appendices}, ADDRESS = {100 Bureau Drive, Stop 8940, Gaithersburg, MD 20899}, NUMBER = {NISTIR 6965}, MONTH = {March}, YEAR = {2003}, ABSTRACT = {This paper describes a method for generating frontal views of faces, given single images at arbitrary poses and illuminations. The system is based on a Morphable Model of 3D faces, which represents face-specific information extracted from a dataset of 3D scans. It estimates the 3D shape of novel faces from the input images, and completes surface regions that are not visible in the image, due to self occlusion. The reconstructed 3D surface covers the face, the ears, and the upper half of the neck. To generate the frontal views of the reconstructed faces at a standard position, pose, and size, the system uses 3D computer graphics. In the frontal image, the algorithm uses standard lighting conditions, after having compensated the effects of illumination in the original image. The novel drawing parameters are extracted from an example image. This image also provides standard hair, shoulders, and background, which are added to all transformed frontal views.}, } @TECHREPORT{Boekloh2008a, AUTHOR = {Bokeloh, Martin and Berner, Alexander and Wand, Michael and Schilling, Andreas and Seidel, Hans-Peter}, TITLE = {Slippage Features}, INSTITUTION = {Wilhelm Schickard Institut, University of T{\"u}bingen}, ADDRESS = {T{\"u}bingen, Germany}, NUMBER = {WSI-2008-03}, YEAR = {2008}, PAGES = {21}, } @ARTICLE{Bokeloh2008b, AUTHOR = {Bokeloh, Martin and Berner, Alexander and Wand, Michael and Seidel, Hans-Peter and Schilling, Andreas}, EDITOR = {Dutr{\'e}, Philip and Stamminger, Marc}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS 2009)}, TITLE = {Symmetry Detection Using Line Features}, BOOKTITLE = {The European Association for Computer Graphics 30th Annual Conference : EUROGRAPHICS 2009}, ADDRESS = {Oxford}, NUMBER = {2}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {28}, YEAR = {2009}, PAGES = {697--706}, } @ARTICLE{Bokeloh2010, AUTHOR = {Bokeloh, Martin and Wand, Michael and Seidel, Hans-Peter}, EDITOR = {Hoppe, Hugues}, JOURNAL = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH 2010)}, TITLE = {A Connection between Partial Symmetry and Inverse Procedural Modeling}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2010}, ADDRESS = {New York, NY}, NUMBER = {4}, PUBLISHER = {ACM}, SERIES = {ACM Transactions on Graphics}, VOLUME = {29}, ISBN = {0730-0301}, DOI = {10.1145/1778765.1778841}, YEAR = {2010}, PAGES = {104,1--104,10}, } @ARTICLE{Bokeloh2011, AUTHOR = {Bokeloh, Martin and Wand, Michael and Koltun, Vladlen and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics (Proceedings ACM SIGGRAPH Asia)}, TITLE = {Pattern-aware deformation using sliding dockers}, ADDRESS = {New York, NY}, NUMBER = {6}, PUBLISHER = {ACM}, MONTH = {December}, VOLUME = {30}, ISBN = {0730-0301}, DOI = {10.1145/2070781.2024157}, YEAR = {2011}, PAGES = {123:1--123:10}, } @ARTICLE{Bokeloh2012algMod, AUTHOR = {Bokeloh, Martin and Wand, Michael and Seidel, Hans-Peter and Koltun, Vladlen}, JOURNAL = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH)}, TITLE = {An Algebraic Model for Parameterized Shape Editing}, ADDRESS = {New York, NY}, NUMBER = {4}, PUBLISHER = {ACM}, VOLUME = {31}, ISBN = {0730-0301}, DOI = {10.1145/2185520.2185574}, YEAR = {2012}, PAGES = {78:1--78:10}, } @MASTERSTHESIS{Botsch1999_DA, AUTHOR = {Botsch, Mario}, TITLE = {{3-D Gesichtsmodellierung zur Operationsplanung}}, SCHOOL = {Friedrich-Alexander-Universit{\"a}t Erlangen-N{\"u}rnberg}, TYPE = {Master's thesis}, MONTH = {February}, YEAR = {1999}, } @INPROCEEDINGS{Botsch2000_FSSIR, AUTHOR = {Botsch, Mario and R{\"o}ssl, Christian and Kobbelt, Leif}, EDITOR = {Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {Feature Sensitive Sampling for Interactive Remeshing}, BOOKTITLE = {Proceedings of Vision, Modeling, and Visualization (VMV-00)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, MONTH = {November}, ISBN = {3-89838-019-X}, YEAR = {2000}, PAGES = {129--136}, } @INPROCEEDINGS{botsch:egcourse:2006, AUTHOR = {Botsch, Mario and Pauly, Mark and R{\"o}ssl, Christian and Bischoff, Stephan and Kobbelt, Leif}, TITLE = {Geometric Modeling Based on Triangle Meshes}, BOOKTITLE = {Eurographics Tutorial Notes}, ORGANIZATION = {Eurographics}, TYPE = {Tutorial Notes}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Vienna, Austria}, PUBLISHER = {Eurographics}, MONTH = {September}, YEAR = {2006}, PAGES = {180}, ABSTRACT = {In the last years triangle meshes have become increasingly popular and are nowad ays intensively used in many different areas of computer graphics and geometry p rocessing. In classical CAGD irregular triangle meshes developed into a valuable alternative to traditional spline surfaces, since their conceptual simplicity a llows for more flexible and highly efficient processing. This course discusses the whole geometry processing pipeline based on triangle meshes.}, } @INPROCEEDINGS{botsch:egcourse:2007, AUTHOR = {Botsch, Mario and Pauly, Mark and Kobbelt, Leif and Alliez, Pierre and L{\'e}vy, Bruno and Bischoff, Stephan and R{\"o}ssl, Christian}, TITLE = {Geometric modeling based on polygonal meshes}, BOOKTITLE = {Eurographics Tutorial Notes}, TYPE = {Tutorial Notes (revised)}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Crete, Greece}, PUBLISHER = {Eurographics}, YEAR = {2008}, } @INPROCEEDINGS{botsch:sgcourse:2006, AUTHOR = {Botsch, Mario and Pauly, Mark and R{\"o}ssl, Christian and Bischoff, Stephan and Kobbelt, Leif}, TITLE = {Geometric Modeling Based on Triangle Meshes}, BOOKTITLE = {SIGGRAPH Course Notes}, TYPE = {Course Notes}, PADDRESS = {New York, USA}, ADDRESS = {Boston, USA}, PUBLISHER = {ACM}, YEAR = {2006}, ABSTRACT = {In the last years triangle meshes have become increasingly popular and are nowad ays intensively used in many different areas of computer graphics and geometry p rocessing. In classical CAGD irregular triangle meshes developed into a valuable alternative to traditional spline surfaces, since their conceptual simplicity a llows for more flexible and highly efficient processing. This course discusses the whole geometry processing pipeline based on triangle meshes. }, } @INPROCEEDINGS{botsch:sgcourse:2007, AUTHOR = {Botsch, Mario and Pauly, Mark and Kobbelt, Leif and Alliez, Pierre and L{\'e}vy, Bruno and Bischoff, Stephan and R{\"o}ssl, Christian}, TITLE = {Geometric modeling based on polygonal meshes}, BOOKTITLE = {SIGGRAPH 2007 Course Notes 23}, TYPE = {Course Notes (revised)}, PADDRESS = {New York, USA}, ADDRESS = {San Diego, California}, PUBLISHER = {ACM}, YEAR = {2007}, PAGES = {1--181}, NOTE = {revised course notes}, } @MASTERSTHESIS{Brabec1999:LVL, AUTHOR = {Brabec, Stefan}, TITLE = {{Lumigraphen von Lichtquellen}}, SCHOOL = {Friedrich-Alexander-Universit{\"a}t Erlangen-N{\"u}rnberg}, TYPE = {Master's thesis}, MONTH = {March}, YEAR = {1999}, } @INPROCEEDINGS{Brabec2000:HRASSM, AUTHOR = {Brabec, Stefan and Seidel, Hans-Peter}, EDITOR = {Ip, Horace Ho-Shing and Magnenat-Thalmann, Nadia and Lau, Rynson W. H. and Chua, Tat-Seng}, TITLE = {Hardware-accelerated Rendering of Antialiased Shadows with Shadow Maps}, BOOKTITLE = {Proceedings Computer Graphics International 2001}, ORGANIZATION = {City University of Hong Kong, Hong Kong}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Hong Kong, China}, PUBLISHER = {IEEE}, MONTH = {July}, ISBN = {0-7695-1007-8}, YEAR = {2001}, PAGES = {209--214}, ABSTRACT = {We present a hardware-accelerated method for rendering high quality, antialiased shadows using the shadow map approach. Instead of relying on dedicated hardware support for shadow map filtering, we propose a general rendering algorithm that can be used on most graphics workstations. The filtering method softens shadow boundaries by using a technique called percentage closer filtering which is commonly used in software renderers, e.g ray tracing. In this paper we describe how the software algorithm can be efficiently mapped to hardware. In order to achieve real-time or at least interactive frame rates we also propose a slightly modified shadow filtering method that saves valuable hardware resources while still achieving good image quality.}, } @INPROCEEDINGS{Brabec2002:HemiOmni, AUTHOR = {Brabec, Stefan and Annen, Thomas and Seidel, Hans-Peter}, EDITOR = {Vince, John and Earnshaw, Rae}, TITLE = {Shadow Mapping for Hemispherical and Omnidirectional Light Sources}, BOOKTITLE = {Advances in Modelling, Animation and Rendering (Proceedings Computer Graphics International 2002)}, PADDRESS = {London, UK}, ADDRESS = {Bradford, UK}, PUBLISHER = {Springer}, ISBN = {1-85233-654-4}, YEAR = {2002}, PAGES = {397--408}, } @ARTICLE{Brabec2003:PSM, AUTHOR = {Brabec, Stefan and Annen, Thomas and Seidel, Hans-Peter}, JOURNAL = {Journal of Graphics Tools}, TITLE = {Practical Shadow Mapping}, ADDRESS = {Natick, USA}, NUMBER = {4}, PUBLISHER = {A K Peters}, VOLUME = {7}, YEAR = {2003}, PAGES = {9--18}, ABSTRACT = {In this paper we present several methods that can greatly improve image quality when using the shadow mapping algorithm. Shadow artifacts introduced by shadow mapping are mainly due to low resolution shadow maps and/or the limited numerical precision used when performing the shadow test. These problems especially arise when the light source's viewing frustum, from which the shadow map is generated, is not adjusted to the actual camera view. We show how a tight fitting frustum can be computed such that the shadow mapping algorithm concentrates on the visible parts of the scene and takes advantage of nearly the full available precision. Furthermore, we recommend uniformly spaced depth values in contrast to perspectively spaced depths in order to equally sample the scene seen from the light source.}, } @INPROCEEDINGS{Brabec2003:SPG, AUTHOR = {Brabec, Stefan and Seidel, Hans-Peter}, EDITOR = {Brunet, Pere and Fellner, Dieter W.}, TITLE = {Shadow Volumes on Programmable Graphics Hardware}, BOOKTITLE = {EUROGRAPHICS 2003 (EUROGRAPHICS-03) : the European Association for Computer Graphics, 24th Annual Conference}, ORGANIZATION = {Eurographics}, PADDRESS = {Oxford, UK}, ADDRESS = {Granada, Spain}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, SERIES = {Computer Graphics Forum}, VOLUME = {22}, ISBN = {0167-7055}, YEAR = {2003}, PAGES = {433--440}, ABSTRACT = {One of the best choices for fast, high quality shadows is the shadow volume algorithm. However, for real time applications the extraction of silhouette edges can significantly burden the CPU, especially with highly tessellated input geometry or when complex geometry shaders are applied. In this paper we show how this last, expensive part of the shadow volume method can be implemented on programmable graphics hardware. This way, the originally hybrid shadow volumes algorithm can now be reformulated as a purely hardware-accelerated approach. The benefits of this implementation is not only the increase in speed. Firstly, all computations now run on the same hardware resulting in consistent precision within all steps of the algorithm. Secondly, programmable vertex transformations are no longer problematic when applied to shadow casting objects.}, } @PHDTHESIS{BrabecDiss03, AUTHOR = {Brabec, Stefan}, TITLE = {Shadow Techniques for Interactive and Real-Time Applications}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {December}, YEAR = {2003}, } @INPROCEEDINGS{Brabec:2000:ELM, AUTHOR = {Brabec, Stefan and Seidel, Hans-Peter}, EDITOR = {Mehdi, Quasim and Gough, Norman}, TITLE = {Extended Light Maps}, BOOKTITLE = {GAME-ON 2000 / 1st International Conference on Intelligent Games and Simulation}, ORGANIZATION = {Society for Computer Simulation International}, PADDRESS = {San Diego, USA}, ADDRESS = {London, United Kingdom}, PUBLISHER = {Society for Computer Simulation International}, MONTH = {November}, ISBN = {1-56555-210-5}, YEAR = {2000}, PAGES = {10--13}, ABSTRACT = {Todays graphics hardware is capable of performing a large number of operations at very high rates. Since most of the graphics chips are designed in a pipelined fashion, e.g. similar to the OpenGL rendering pipeline, it is necessary to utilize as many processing units as possible to achieve high-quality results while keeping the number of rendering passes needed at a minimum. In this paper we present an algorithm that combines two well known algorithms in a very efficient manner. One is the \textit{shadow mapping} technique that is used to compute a shadow mask to determine lit and shadowed pixels. The second algorithm is called \textit{light mapping} and is a common approach for rendering complex light effects. These two are combined into a single texture map which we call an \textit{extended light map}. The benefit of this approach is that nearly all stages of the graphics pipeline can be used during the shadow map generation phase, which results in better image quality and a reduced number of rendering passes.}, } @INPROCEEDINGS{Brabec:SSS:2002, AUTHOR = {Brabec, Stefan and Seidel, Hans-Peter}, EDITOR = {McCool, Michael and St{\"u}rzlinger, Wolfgang}, TITLE = {Single Sample Soft Shadows Using Depth Maps}, BOOKTITLE = {Graphics Interface 2002}, ORGANIZATION = {Canadian Human-Computer Communications Society}, PADDRESS = {Natick, USA}, ADDRESS = {Calgary, Alberta}, PUBLISHER = {A K Peters}, MONTH = {May}, ISBN = {1-56881-183-7}, YEAR = {2002}, PAGES = {219--228}, ABSTRACT = {In this paper we propose a new method for rendering soft shadows at interactive frame rates. Although the algorithm only uses information obtained from a single light source sample, it is capable of producing subjectively realistic penumbra regions. We do not claim that the proposed method is physically correct but rather that it is aesthetically correct. Since the algorithm operates on sampled representations of the scene, the shadow computation does not directly depend on the scene complexity. Having only a single depth and object ID map representing the pixels seen by the light source, we can approximate penumbrae by searching the neighborhood of pixels warped from the camera view for relevant blocker information. We explain the basic technique in detail, showing how simple observations can yield satisfying results. We also address sampling issues relevant to the quality of the computed shadows, as well as speed-up techniques that are able to bring the performance up to interactive frame rates.}, } @MASTERSTHESIS{Brock2010_MasterThesis, AUTHOR = {Brock, Heike}, TITLE = {Automated Classification of Trampoline Motions Based on Inertial Sensor Input}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {December}, YEAR = {2010}, PAGES = {118}, ABSTRACT = {The automatic segmentation and classification of an unknown motion data stream accord- ing to given motion categories constitutes an important research problem with applica- tions in computer animation, medicine and sports sciences. In this thesis, we consider the scenario of trampoline motions, where an athlete performs a sequence of predefined trampoline jumps. Here, each jump follows certain rules and belongs to a specific motion category such as a pike jump or a somersault. Then, the classification problem consists in automatically segmenting an unknown trampoline motion sequence into its individ- ual jumps and to classify these jumps according to the given motion categories. Since trampoline motions are very fast and spacious while requiring special lighting conditions, it is problematic to capture trampoline motions with video and optical motion capture systems. Inertial sensors that measure accelerations and orientations are more suitable for capturing trampoline motions and therefore have been used for this thesis. However, inertial sensor output is noisy and abstract requiring suitable feature representations that display the characteristics of each motion category without being sensitive to noise and performance variations. A sensor data stream can then be transformed into a feature sequence for classification. For every motion category, a class representation (or in our case, a class motion template) is learned from a class of example motions performed by different actors. The main idea, as employed in this thesis, is to locally compare the fea- ture sequence of the unknown trampoline motion with all given class motion templates using a variant of dynamic time warping (DTW) in the comparison. Then, the unknown motion stream is automatically segmented and locally classified by the class template that best explains the corresponding segment. Extensive experiments have been conducted on trampoline jumps from various athletes for evaluating various feature representations, segmentation and classification.}, } @INPROCEEDINGS{BroxICCVHMWS2007, AUTHOR = {Brox, Thomas and Rosenhahn, Bodo and Cremers, Daniel and Seidel, Hans-Peter}, EDITOR = {Elgammal, Ahmed and Rosenhahn, Bodo and Klette, Reinhard}, TITLE = {Nonparametric Density Estimation with Adaptive Anisotropic Kernels for Human Motion Tracking}, BOOKTITLE = {2nd Workshop on Human Motion}, PADDRESS = {Berlin, Germany}, ADDRESS = {Rio de Janeiro, Brazil}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4814}, ISBN = {3-540-75702-3}, YEAR = {2007}, PAGES = {152--165}, } @ARTICLE{Brusi_cag2002, AUTHOR = {Brusi, Alex and Sbert, Mateu and Bekaert, Philippe and Tobler, Robert and Purgathofer, Werner}, JOURNAL = {Computers and Graphics}, TITLE = {Optimal ray shooting in {Monte Carlo} radiosity}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {2}, PUBLISHER = {Elsevier}, MONTH = {May}, VOLUME = {26}, YEAR = {2002}, PAGES = {351--354}, } @MASTERSTHESIS{BurgardMaster2011, AUTHOR = {Burgard, Wolfgang}, TITLE = {Spectral matching techniques}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {May}, YEAR = {2011}, PAGES = {91}, } @INPROCEEDINGS{BW-HWAMRGS-2006, AUTHOR = {Bokeloh, Martin and Wand, Michael}, TITLE = {Hardware Accelerated Multi-Resolution Geometry Synthesis}, BOOKTITLE = {Proc. Symposium on Interactive 3D Graphics and Games (I3D 06)}, PADDRESS = {New York, USA}, ADDRESS = {Redwood City, USA}, PUBLISHER = {ACM}, YEAR = {2006}, PAGES = {191--198}, } @ARTICLE{cad07sbs, AUTHOR = {Schall, Oliver and Belyaev, Alexander and Seidel, Hans-Peter}, JOURNAL = {Computer-Aided Design}, TITLE = {Error-Guided Adaptive {Fourier-based} Surface Reconstruction}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {5}, PUBLISHER = {Elsevier}, VOLUME = {39}, ISBN = {0010-4485}, DOI = {10.1016/j.cad.2007.02.005}, YEAR = {2007}, PAGES = {421--426}, ABSTRACT = {In this paper, we propose to combine Kazhdan's FFT-based approach to surface reconstruction from oriented points with adaptive subdivision and partition of unity blending techniques. This removes the main drawback of the FFT-based approach which is a high memory consumption for geometrically complex datasets. This allows us to achieve a higher reconstruction accuracy compared with the original global approach. Furthermore, our reconstruction process is guided by a global error control accomplished by computing the Hausdorff distance of selected input samples to intermediate reconstructions. The advantages of our surface reconstruction method include also a more robust surface restoration in regions where the surface folds back to itself.}, } @ARTICLE{cadik12iqm_evaluation, AUTHOR = {{\v{C}}ad{\'i}k, Martin and Herzog, Robert and Mantiuk, Rafal and Myszkowski, Karol and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics (Proc. of ACM SIGGRAPH Asia)}, TITLE = {New Measurements Reveal Weaknesses of Image Quality Metrics in Evaluating Graphics Artifacts}, ADDRESS = {New York, NY}, NUMBER = {6}, PUBLISHER = {ACM}, VOLUME = {31}, ISBN = {0730-0301}, DOI = {10.1145/2366145.2366166}, YEAR = {2012}, PAGES = {147:1--147:10}, } @ARTICLE{Cadik2010, AUTHOR = {Pajak, Dawid and {\v{C}}ad{\'i}k, Martin and Aydin, Tunc Ozan and Okabe, Makoto and Myszkowski, Karol and Seidel, Hans-Peter}, JOURNAL = {The Visual Computer}, TITLE = {Contrast Prescription for Multiscale Image Editing}, ADDRESS = {New York, NY}, PUBLISHER = {Springer}, VOLUME = {26}, ISBN = {0178-2789}, DOI = {10.1007/s00371-010-0485-3}, YEAR = {2010}, PAGES = {739--748}, } @INPROCEEDINGS{Cadik2011, AUTHOR = {{\v{C}}ad{\'i}k, Martin and Aydin, Tunc Ozan and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Rogowitz, Bernice E. and Pappas, Thrasyvoulos N.}, TITLE = {On evaluation of video quality metrics: an {HDR} dataset for computer graphics applications}, BOOKTITLE = {Human Vision and Electronic Imaging XVI (HVEI 2011)}, ORGANIZATION = {SPIE}, PADDRESS = {Bellingham, WA}, ADDRESS = {San Francisco, CA, USA}, PUBLISHER = {Society of Photo-Optical Instrumentation Engineers}, SERIES = {Proceedings of SPIE}, VOLUME = {7865}, ISBN = {978-0-8194-8402-4}, DOI = {10.1117/12.878875}, YEAR = {2011}, PAGES = {78650R:1--78650R:9}, } @ARTICLE{cadik2013learning, AUTHOR = {{\v{C}}ad{\'i}k, Martin and Herzog, Robert and Mantiuk, Rafal and Mantiuk, Radosław and Myszkowski, Karol and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum (Proceedings Pacific Graphics 2013)}, TITLE = {Learning to Predict Localized Distortions in Rendered Images}, NUMBER = {7}, PUBLISHER = {The Eurographics Association and John Wiley \& Sons Ltd.}, VOLUME = {32}, ISBN = {0167-7055}, YEAR = {2013}, PAGES = {10}, ABSTRACT = { In this work, we present an analysis of feature descriptors for objective image quality assessment. We explore a large space of possible features including components of existing image quality metrics as well as many traditional computer vision and statistical features. Additionally, we propose new features motivated by human perception and we analyze visual saliency maps acquired using an eye tracker in our user experiments. The discriminative power of the features is assessed by means of a machine learning framework revealing the importance of each feature for image quality assessment task. Furthermore, we propose a new data-driven full-reference image quality metric which outperforms current state-of-the-art metrics. The metric was trained on subjective ground truth data combining two publicly available datasets. For the sake of completeness we create a new testing synthetic dataset including experimentally measured subjective distortion maps. Finally, using the same machine-learning framework we optimize the parameters of popular existing metrics. }, } @INPROCEEDINGS{Campagna1999_MRIMM, AUTHOR = {Campagna, Swen and Kobbelt, Leif and Schneider, Robert and Seidel, Hans-Peter and Vorsatz, Jens}, EDITOR = {Z{\'a}ra, Jir{\'i}}, TITLE = {Mesh Reduction and Interactive Multiresolution Modeling on Arbitrary Triangle Meshes}, BOOKTITLE = {Proceedings of the 15th Spring Conference on Computer Graphics (SCCG-99)}, PADDRESS = {Bratislava, Slovakia}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {Comenius University}, ISBN = {80-223-1357-2}, YEAR = {1999}, PAGES = {34--44}, } @ARTICLE{Campagna:1998:DES, AUTHOR = {Campagna, Swen and Kobbelt, Leif and Seidel, Hans-Peter}, JOURNAL = {Journal of Graphics Tools}, TITLE = {Directed edges - a scalable reprensentation for triangle meshes}, ADDRESS = {Natick, Mass., USA}, NUMBER = {4}, PUBLISHER = {A K Peters}, VOLUME = {3}, ISBN = {1086-7651}, YEAR = {1998}, PAGES = {1--12}, } @ARTICLE{CarrTheoSig2003, AUTHOR = {Carranza, Joel and Theobalt, Christian and Magnor, Marcus and Seidel, Hans-Peter}, EDITOR = {Hodgins, Jessica K.}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Free-Viewpoint Video of Human Actors}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2003 (SIGGRAPH-03)}, ORGANIZATION = {Association of Computing Machinery (ACM)}, ADDRESS = {New York, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {July}, SERIES = {ACM Transactions on Graphics}, VOLUME = {22}, ISBN = {0730-0301}, YEAR = {2003}, PAGES = {569--577}, NOTE = {(Proc. ACM SIGGRAPH '03)}, ABSTRACT = { In free-viewpoint video, the viewer can interactively choose his viewpoint in \mbox{3-D} space to observe the action of a dynamic real-world scene from arbitrary perspectives. The human body and its motion plays a central role in most visual media and its structure can be exploited for robust motion estimation and efficient visualization. This paper describes a system that uses multi-view synchronized video footage of an actor's performance to estimate motion parameters and to interactively re-render the actor's appearance from any viewpoint. The actor's silhouettes are extracted from synchronized video frames via background segmentation and then used to determine a sequence of poses for a \mbox{3D} human body model. By employing multi-view texturing during rendering, time-dependent changes in the body surface are reproduced in high detail. The motion capture subsystem runs offline, is non-intrusive, yields robust motion parameter estimates, and can cope with a broad range of motion. The rendering subsystem runs at real-time frame rates using ubiquous graphics hardware, yielding a highly naturalistic impression of the actor. The actor can be placed in virtual environments to create composite dynamic scenes. Free-viewpoint video allows the creation of camera fly-throughs or viewing the action interactively from arbitrary perspectives.}, } @ARTICLE{Carstensen2012, AUTHOR = {Carstensen, Carsten and G{\"u}nther, David and Rabus, Hella}, JOURNAL = {SIAM Journal on Numerical Analysis}, TITLE = {Mixed Finite Element Method for a Degenerate Convex Variational Problem from Topology Optimization}, ADDRESS = {Philadelphia, Pa.}, NUMBER = {2}, PUBLISHER = {SIAM}, MONTH = {March}, VOLUME = {50}, ISBN = {1095-7170}, DOI = {10.1137/100806837}, YEAR = {2012}, PAGES = {522--543}, } @BOOK{CDROM-CDROM-Ghali:2001:sigcourse, AUTHOR = {Ghali, Sherif}, EDITOR = {Harrison, Lou}, TITLE = {Object Space Visibility}, BOOKTITLE = {SIGGRAPH 2001 (SIGGRAPH-01), Course Notes CD-ROM}, ORGANIZATION = {SIGGRAPH}, ADDRESS = {New York, USA}, PUBLISHER = {ACM SIGGRAPH}, MONTH = {August}, YEAR = {2001}, } @ARTICLE{cgf02hbk, AUTHOR = {Hisada, Masauki and Belyaev, Alexander and Kunii, Tosiyasu L.}, JOURNAL = {Computer Graphics Forum}, TITLE = {A Skeleton-based Approach for Detection of Perceptually Salient Features on Polygonal Surfaces}, NUMBER = {4}, VOLUME = {21}, YEAR = {2002}, PAGES = {1--12}, ABSTRACT = {The paper presents a skeleton-based approach for robust detection of perceptually salient shape features. Given a shape approximated by a polygonal surface, its skeleton is extracted using a three-dimensional Voronoi diagram technique proposed recently by Amenta et al. Shape creases, ridges and ravines, are detected as curves corresponding to skeletal edges. Salient shape regions are extracted via skeleton decomposition into patches. The approach explores the singularity theory for ridge and ravine detection, combines several filtering methods for skeleton denoising and for selecting perceptually important ridges and ravines, and uses a topological analysis of the skeleton for detection of salient shape regions. }, } @INPROCEEDINGS{cgi03obs, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander and Seidel, Hans-Peter}, TITLE = {Interpolatory Subdivision Curves via Diffusion of Normals}, BOOKTITLE = {Computer Graphics International (CGI 2003)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Tokyo Institute of Technology, Tokyo}, PUBLISHER = {IEEE}, MONTH = {July}, YEAR = {2003}, PAGES = {22--27}, } @INPROCEEDINGS{cgi03yob, AUTHOR = {Yagou, Hirokazu and Ohtake, Yutaka and Belyaev, Alexander}, TITLE = {Mesh Denoising via Iterative Alpha-Trimming and Nonlinear Diffusion of Normals with Automatic Thresholding}, BOOKTITLE = {Computer Graphics International (CGI 2003)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Tokyo, Japan}, PUBLISHER = {IEEE}, MONTH = {July}, YEAR = {2003}, PAGES = {28--33}, } @INPROCEEDINGS{Chen:2005:LSI, AUTHOR = {Chen, Billy and Lensch, Hendrik P. A.}, EDITOR = {Greiner, G{\"u}nther and Hornegger, Joachim and Niemann, Heinrich and Stamminger, Marc}, TITLE = {Light Source Interpolation for Sparsely Sampled Reflectance Fields}, BOOKTITLE = {Vision, Modeling, and Visualization 2005 (VMV'05)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Erlangen, Germany}, PUBLISHER = {Aka}, MONTH = {November}, ISBN = { 3-89838-068-8}, YEAR = {2005}, PAGES = {461--469}, } @INPROCEEDINGS{Chen:2006:MFS, AUTHOR = {Chen, Tongbo and Goesele, Michael and Seidel, Hans-Peter}, TITLE = {Mesostructure from Specularity}, BOOKTITLE = {2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2006)}, PADDRESS = {Los Alamitos, CA, USA}, ADDRESS = {New York, NY, USA}, PUBLISHER = {IEEE}, VOLUME = {2}, ISBN = {0-7695-2597-0}, YEAR = {2006}, PAGES = {1825--1832}, ABSTRACT = {We describe a simple and robust method for surface mesostructure acquisition. Our method builds on the observation that specular reflection is a reliable visual cue for surface mesostructure perception. In contrast to most photometric stereo methods, which take specularities as outliers and discard them, we propose a progressive acquisition system that captures a dense specularity field as the only information for mesostructure reconstruction. Our method can efficiently recover surfaces with fine-scale geometric details from complex real-world objects with a wide variety of reflection properties, including translucent, low albedo, and highly specular objects. We show results for a variety of objects including human skin, dried apricot, orange, jelly candy, black leather and dark chocolate.}, } @INPROCEEDINGS{Chen:2006:PAP, AUTHOR = {Chen, Tongbo and Lensch, Hendrik P. A. and Fuchs, Christian and Seidel, Hans-Peter}, TITLE = {Polarization and Phase-shifting for 3D Scanning of Translucent Objects}, BOOKTITLE = {2007 IEEE Conference on Computer Vision and Pattern Recognition, CVPR'07. - Vol. 4}, ORGANIZATION = {IEEE}, TYPE = {Full paper, oral presentation}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Minneapolis, MN, USA}, PUBLISHER = {IEE}, ISBN = {1-4244-1180-7}, DOI = {10.1109/CVPR.2007.383209}, YEAR = {2007}, PAGES = {1829--1836}, ABSTRACT = {Translucent objects pose a difficult problem for traditional structured light 3D scanning techniques. Subsurface scattering corrupts the range estimation in two ways: by drastically reducing the signal-to-noise ratio and by shifting the intensity peak beneath the surface to a point which does not coincide with the point of incidence. In this paper we analyze and compare two descattering methods in order to obtain reliable 3D coordinates for translucent objects. By using polarization-difference imaging, subsurface scattering can be filtered out because multiple scattering randomizes the polarization direction of light while the surface reflectance partially keeps the polarization direction of the illumination. The descattered reflectance can be used for reliable 3D reconstruction using traditional optical 3D scanning techniques, such as structured light. Phase-shifting is another effective descattering technique if the frequency of the projected pattern is sufficiently high. We demonstrate the performance of these two techniques and the combination of them on scanning real-world translucent objects.}, } @INPROCEEDINGS{Chen:CVPR2008, AUTHOR = {Chen, Tongbo and Seidel, Hans-Peter and Lensch, Hendrik P. A.}, TITLE = {Modulated phase-shifting for {3D} scanning}, BOOKTITLE = {Proceedings of the 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008)}, ORGANIZATION = {IEEE}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Anchorage, Alaska, USA}, PUBLISHER = {IEEE Computer Society}, YEAR = {2008}, } @ARTICLE{ChoiDM2002, AUTHOR = {Choi, Sung Woo}, JOURNAL = {Dissertationes Mathematicae}, TITLE = {Minkowski Sum of Semi-convex Domains in $\mathbb{R}^2$}, VOLUME = {411}, ISBN = {0012-3862}, YEAR = {2002}, PAGES = {1--55}, } @INPROCEEDINGS{ChoiLee2000, AUTHOR = {Choi, Sung Woo and Lee, Seong-Whan}, EDITOR = {Sanfeliu, A. and Villanueva, J. J. and Vanrell, M. and Alqu{\'e}zar, R. and Huang, T. and Serra, J.}, TITLE = {Stability Analysis of Medial Axis Transform under Relative {Hausdorff} Distance}, BOOKTITLE = {Proceedings of the 15th International Conference on Pattern Recognition (ICPR-00)}, ORGANIZATION = {IEEE Computer Society}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Barcelona, Spain}, NUMBER = {3}, PUBLISHER = {IEEE}, MONTH = {September}, ISBN = {0-7695-0750-6}, YEAR = {2000}, PAGES = {139--142}, } @INPROCEEDINGS{ChoiSeidel2001b, AUTHOR = {Choi, Sung Woo and Seidel, Hans-Peter}, EDITOR = {Radig, Bernd and Florczyk, Stefan}, TITLE = {One-sided Stability of Medial Axis Transform}, BOOKTITLE = {Proceedings of Pattern Recognition, 23rd DAGM Symposium}, PADDRESS = {Vienna, Austria}, ADDRESS = {M{\"u}nchen, Germany}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2191}, YEAR = {2001}, PAGES = {132--139}, NOTE = {In press}, ABSTRACT = {Medial axis transform (MAT) is very sensitive to the noise, in the sense that, even if a shape is perturbed only slightly, the Hausdorff distance between the MATs of the original shape and the perturbed one may be large. But it turns out that MAT is stable, if we view this phenomenon with the one-sided Hausdorff distance, rather than with the two-sided Hausdorff distance. In this paper, we show that, if the original domain is weakly injective, which means that the MAT of the domain has no end point which is the center of an inscribed circle osculating the boundary at only one point, the one-sided Hausdorff distance of the original domain's MAT with respect to that of the perturbed one is bounded linearly with the Hausdorff distance of the perturbation. We also show by example that the linearity of this bound cannot be achieved for the domains which are not weakly injective. In particular, these results apply to the domains with the sharp corners, which were excluded in the past. One consequence of these results is that we can clarify theoretically the notion of extracting ``the essential part of the MAT'', which is the heart of the existing pruning methods.}, } @INPROCEEDINGS{ChoiSeidel2001c, AUTHOR = {Choi, Sung Woo and Seidel, Hans-Peter}, EDITOR = {Ertl, Thomas and Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {One-sided stability of {MAT} and its applications}, BOOKTITLE = {Vision, Modeling and Visualization 2001 (VMV-2001)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Stuttgart, Germany}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, MONTH = {November}, YEAR = {2001}, PAGES = {291--298}, ABSTRACT = {Although useful in many applications, the medial axis transform (MAT) has a few fit-falls, one of which is its extreme sensitivity to the boundary perturbation. In this paper, we first summarizes the previous attempts to get around this by bounding the one-sided Hausdorff distance of the MAT with respect to the boundary perturbation. We illustrate these results and their optimality with various examples. Finally, we suggest an application of them in pruning. In particular, we discuss the advantage of the results for the domains which are not weakly injective, over those for the weakly injective ones.}, } @ARTICLE{ChoiSeidel2001d, AUTHOR = {Choi, Sung Woo and Seidel, Hans-Peter}, JOURNAL = {Graphical Models}, TITLE = {Hyperbolic Hausdorff Distance for Medial Axis Transform}, NUMBER = {5}, PUBLISHER = {Academic Press}, MONTH = {September}, VOLUME = {63}, ISBN = {1524-0703}, YEAR = {2001}, PAGES = {369--384}, } @ARTICLE{ChoiSeidelJMIV2002, AUTHOR = {Choi, Sung Woo and Seidel, Hans-Peter}, JOURNAL = {Journal of Mathematical Imaging and Vision}, TITLE = {Linear One-sided Stability of MAT for Weakly Injective Domain}, ADDRESS = {Dordrecht, the Netherlands}, NUMBER = {3}, PUBLISHER = {Kluwer}, MONTH = {November}, VOLUME = {17}, ISBN = {0924-9907}, YEAR = {2002}, PAGES = {237--247}, } @INPROCEEDINGS{ChoiSeidelSM2002, AUTHOR = {Choi, Sung Woo and Seidel, Hans-Peter}, EDITOR = {Lee, Kunwoo and Patrikalakis, Nicholas M.}, TITLE = {Linear One-sided Stability of MAT for Weakly Injective 3D Domain}, BOOKTITLE = {Seventh ACM Symposium on Solid Modeling and Applications (SM-02)}, PADDRESS = {New York, USA}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {ACM}, YEAR = {2002}, PAGES = {344--355}, } @INPROCEEDINGS{CrassinGigaVoxels2009, AUTHOR = {Crassin, Cyril and Neyret, Fabrice and Lefebvre, Sylvain and Eisemann, Elmar}, EDITOR = {Haines, Eric and McGuire, Morgan and Aliaga, Daniel G. and Oliveira, Manuel M.}, TITLE = {GigaVoxels: Ray-guided Streaming for Efficient and Detailed Voxel Rendering}, BOOKTITLE = {Proceedings of I3D 2009 : ACM SIGGRAPH Symposium onInteractive 3D Graphics and Games}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, NY}, ADDRESS = {Boston, Mass.}, PUBLISHER = {ACM}, MONTH = {February}, ISBN = {978-1-60558-429-4}, DOI = {http://doi.acm.org/10.1145/1507149.1507152}, YEAR = {2009}, PAGES = {15--22}, ABSTRACT = {We propose a new approach to efficiently render large volumetric data sets. The system achieves interactive to real-time rendering performance for several billion voxels. Our solution is based on an adaptive data representation depending on the current view and occlusion information, coupled to an efficient ray-casting rendering algorithm. One key element of our method is to guide data production and streaming directly based on information extracted during rendering. Our data structure exploits the fact that in CG scenes, details are often concentrated on the interface between free space and clusters of density and shows that volumetric models might become a valuable alternative as a rendering primitive for real-time applications. In this spirit, we allow a quality/performance trade-off and exploit temporal coherence. We also introduce a mipmapping-like process that allows for an increased display rate and better quality through high quality filtering. To further enrich the data set, we create additional details through a variety of procedural methods. We demonstrate our approach in several scenarios, like the exploration of a 3D scan ($8192^3$ resolution), of hypertextured meshes ($16384^3$ virtual resolution), or of a fractal (theoretically infinite resolution). All examples are rendered on current generation hardware at 20-90 fps and respect the limited GPU memory budget.}, } @ARTICLE{Cui2012, AUTHOR = {Cui, Yan and Schuon, Sebastian and Thrun, Sebastian and Stricker, Didier and Theobalt, Christian}, JOURNAL = {IEEE Transaction on Pattern Analysis and Machine Intelligence}, TITLE = {Algorithms for 3{D} Shape Scanning with a Depth Camera}, ADDRESS = {Piscataway, NJ}, PUBLISHER = {IEEE}, MONTH = {September}, VOLUME = {35}, DOI = {10.1109/TPAMI.2012.190}, YEAR = {2013}, PAGES = {1039--1050}, } @INPROCEEDINGS{CuiHasThoSei09, AUTHOR = {Cui, Yan and Hasler, Nils and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter}, EDITOR = {Kamel, Mohamed and Campilho, Aur{\'e}lio}, TITLE = {Scale Invariant Feature Transform with Irregular Orientation Histogram Binning}, BOOKTITLE = {Image Analysis and Recognition : 6th International Conference, ICIAR 2009}, PADDRESS = {Berlin, Germany}, ADDRESS = {Halifax, Canada}, PUBLISHER = {Springer}, MONTH = {July}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5627}, ISBN = {978-3-642-02610-2}, DOI = {10.1007/978-3-642-02611-9_26}, YEAR = {2009}, PAGES = {258--267}, NOTE = {(to appear)}, ABSTRACT = {The SIFT (Scale Invariant Feature Transform) descriptor is a widely used method for matching image features. However, perfect scale invariance can not be achieved in practice because of sampling artefacts, noise in the image data, and the fact that the computational effort limits the number of analyzed scale space images. In this paper we propose a modification of the descriptor's regular grid of orientation histogram bins to an irregular grid. The irregular grid approach reduces the negative effect of scale error and significantly increases the matching precision for image features. Results with a standard data set are presented that show that the irregular grid approach outperforms the original SIFT descriptor and other state-of-the-art extentions.}, } @ARTICLE{CuKoSt_08PLS, AUTHOR = {Cuntz, Nicolas and Kolb, Andreas and Strzodka, Robert and Weiskopf, Daniel}, JOURNAL = {Computer Graphics Forum (Proc. EuroVis)}, TITLE = {Particle Level Set Advection for the Interactive Visualization of Unsteady {3D} Flow}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {May}, VOLUME = {27}, YEAR = {2008}, PAGES = {719--726}, ABSTRACT = {Typically, flow volumes are visualized by defining their boundary as iso-surface of a level set function. Grid-based level sets offer a good global representation but suffer from numerical diffusion of surface detail, whereas particle-based methods preserve details more accurately but introduce the problem of unequal global representation. The particle level set (PLS) method combines the advantages of both approaches by interchanging the information between the grid and the particles. Our work demonstrates that the PLS technique can be adapted to volumetric dye advection via streak volumes, and to the visualization by time surfaces and path volumes. We achieve this with a modified and extended PLS, including a model for dye injection. A new algorithmic interpretation of PLS is introduced to exploit the efficiency of the GPU, leading to interactive visualization. Finally, we demonstrate the high quality and usefulness of PLS flow visualization by providing quantitative results on volume preservation and by discussing typical applications of 3D flow visualization.}, } @INPROCEEDINGS{cw02ybw, AUTHOR = {Yagou, Hirokazu and Belyaev, Alexander and Wei, Daming}, EDITOR = {Peng, Shietung}, TITLE = {Mesh Median Filter for Smoothing 3-D Polygonal Surfaces}, BOOKTITLE = {Proceedings of the First International Symposium on Cyber Worlds}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Tokyo}, PUBLISHER = {IEEE}, YEAR = {2002}, PAGES = {488--495}, } @ARTICLE{Daehlen:2000:MAO, AUTHOR = {Daehlen, M. and Lyche, Tom and Morken, K. and Schneider, Robert and Seidel, Hans-Peter}, JOURNAL = {Journal of Computational and Applied Mathematics}, TITLE = {Multiresolution analysis over triangles, based on quadratic {Hermite} interpolation}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {1/2}, PUBLISHER = {Elsevier}, MONTH = {July}, VOLUME = {119}, ISBN = {0771-050X}, YEAR = {2000}, PAGES = {97--114}, } @INPROCEEDINGS{DaFrKuMuCl08_ICMI_MultimodalMusicAccess, AUTHOR = {Damm, David and Fremerey, Christian and Kurth, Frank and M{\"u}ller, Meinard and Clausen, Michael}, TITLE = {Multimodal Presentation and Browsing of Music}, BOOKTITLE = {IMCI '08: Proceedings of the 10th International Conference on Multimodal Interfaces}, ORGANIZATION = {ACM}, PADDRESS = {New York, USA}, ADDRESS = {Chania, Crete, Greece}, PUBLISHER = {ACM}, MONTH = {October}, ISBN = {978-1-60558-198-9}, DOI = {10.1145/1452392.1452436}, YEAR = {2008}, PAGES = {205--208}, ABSTRACT = {Recent digitization efforts have led to large music collections, which contain music documents of various modes comprising textual, visual and acoustic data. In this paper, we present a multimodal music player for presenting and browsing digitized music collections consisting of heterogeneous document types. In particular, we concentrate on music documents of two widely used types for representing a musical work, namely visual music representation (scanned images of sheet music) and associated interpretations (audio recordings). We introduce novel user interfaces for multimodal (audio-visual) music presentation as well as intuitive navigation and browsing. Our system offers high quality audio playback with time-synchronous display of the digitized sheet music associated to a musical work. Furthermore, our system enables a user to seamlessly crossfade between various interpretations belonging to the currently selected musical work.}, } @INPROCEEDINGS{Dalal2006, AUTHOR = {Dalal, Ketan and Klein, Allison and Liu, Yunjun and Smith, Kaleigh}, TITLE = {A Spectral Approach to NPR Packing}, BOOKTITLE = {Proceedings of the 4th International Symposium on Non-Photorealistic Animation and Rendering 2006 (NPAR'06)}, PADDRESS = {New York, NY, USA}, ADDRESS = {Annecy, France}, PUBLISHER = {ACM}, ISBN = {1-59593-357-3}, YEAR = {2006}, PAGES = {71--78}, ABSTRACT = { This paper presents improvements in mosaic packing by combining a new tile evenness metric with an efficient, effective tile placement algorithm based on the Fast Fourier Transform. This new packing method applies to existing packing applications and makes possible novel mosaic applications not handled by previous work such as mosaic packings of 3D volumes using temporally repeating animated shapes. Applications of our approach include static 2D mosaic packing, mosaic animations, stippling, and texture generation.}, } @INPROCEEDINGS{Damez2002, AUTHOR = {Damez, Cyrille and Dmitriev, Kirill and Myszkowski, Karol}, EDITOR = {Fellner, Dieter W. and Scopigno, Roberto}, TITLE = {Global Illumination for Interactive Applications and High-Quality Animations}, BOOKTITLE = {Eurographics 2002: State of the Art Reports}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Eurographics}, ISBN = {1017-4565}, YEAR = {2002}, PAGES = {1--24}, } @ARTICLE{Damez2003, AUTHOR = {Damez, Cyrille and Holzschuch, Nicolas and Sillion, Francois}, JOURNAL = {Compter Graphics Forum}, TITLE = {Space-Time Hierarchical Radiosity with Clustering and Higher Order Wavelets}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell}, MONTH = {June}, VOLUME = {23}, ISBN = {0167-7055}, YEAR = {2004}, PAGES = {129--141}, } @INPROCEEDINGS{DammFKMC08_GI-FGIR08_SyncPlayer, AUTHOR = {Damm, David and Fremerey , Christian and Kurth, Frank and M{\"u}ller, Meinard and Clausen, Michael}, EDITOR = {Mandl, Thomas and Fuhr, Norbert and Henrich, Andreas}, TITLE = {{S}ync{P}layer - {M}ultimodale {W}iedergabe, {N}avigation und {S}uche in heterogenen digitalen {M}usikkollektionen}, BOOKTITLE = {Proceedings of the Workshop on Lernen-Wissen-Adaptivit{\"a}t (LWA 2008)}, PADDRESS = {Wuerzburg, Germany}, ADDRESS = {W{\"u}rzburg, Germany}, PUBLISHER = {GI}, MONTH = {October}, YEAR = {2008}, PAGES = {1--8}, } @ARTICLE{DammFTCKM12_DML_IJDL, AUTHOR = {Damm, David and Fremerey, Christian and Thomas, Verena and Clausen, Michael and Kurth, Frank and M{\"u}ller, Meinard}, JOURNAL = {International Journal on Digital Libraries}, TITLE = {A Digital Library Framework for Heterogeneous Music Collections - from Document Acquisition to Cross-Modal Interaction}, ADDRESS = {New York, NY}, NUMBER = {2-3}, PUBLISHER = {Springer}, VOLUME = {12}, ISBN = {1432-5012}, DOI = {10.1007/s00799-012-0087-y}, YEAR = {2012}, PAGES = {53--71}, } @INPROCEEDINGS{DanovaroPSAS_web3d07, AUTHOR = {Danovaro,Emanuele and Papaleo, Laura and Sobrero, Davide and Attene, Marco and Saleem, Waqar}, TITLE = {Advanced remote inspection and download of {3D} shapes}, BOOKTITLE = {Proceedings of the twelfth international conference on {3D} web technology (Web3D '07:)}, PADDRESS = {New York, USA}, ADDRESS = {Perugia, Italy}, PUBLISHER = {ACM}, ISBN = {978-1-59593-652-3}, DOI = {10.1145/1229390.1229399}, YEAR = {2007}, PAGES = {57--60}, ABSTRACT = {Shape inspection options in most of the current online shape repositories provide limited information on the shape of a desired model. In addition, stored models can be downloaded only at the original level of detail (LOD). In this paper, we present our application that combines remote interactive inspection of a digital shape with realtime simplification. Simplification is parameterised, is performed in real-time and the results are again available for inspection. We have embedded the application in a shape repository whereby, having found a suitable simplification, users can download the model at that LOD.}, } @INPROCEEDINGS{Daubert2001, AUTHOR = {Daubert, Katja and Lensch, Hendrik P. A. and Heidrich, Wolfgang and Seidel, Hans-Peter}, EDITOR = {Myszkowski, Karol}, TITLE = {Efficient Cloth Modeling and Rendering}, BOOKTITLE = {Rendering Techniques 2001: Proceedings of the 12th Eurographics Workshop on Rendering}, ORGANIZATION = {Eurographics}, PADDRESS = {Vienna, Austria}, ADDRESS = {London, Great Britain}, PUBLISHER = {Springer}, ISBN = {3-211-83709-4}, YEAR = {2001}, PAGES = {63--70}, ABSTRACT = {Realistic modeling and high-performance rendering of cloth and clothing is a challenging problem. Often these materials are seen at distances where individual stitches and knits can be made out and need to be accounted for. Modeling of the geometry at this level of detail fails due to sheer complexity, while simple texture mapping techniques do not produce the desired quality. In this paper, we describe an efficient and realistic approach that takes into account view-dependent effects such as small displacements causing occlusion and shadows, as well as illumination effects. The method is efficient in terms of memory consumption, and uses a combination of hardware and software rendering to achieve high performance. It is conceivable that future graphics hardware will be flexible enough for full hardware rendering of the proposed method.}, } @INPROCEEDINGS{Daubert2002b, AUTHOR = {Daubert, Katja and Seidel, Hans-Peter}, EDITOR = {Drettakis, George and Seidel, Hans-Peter}, TITLE = {Hardware-Based Volumetric Knit-Wear}, BOOKTITLE = {EUROGRAPHICS 2002}, ORGANIZATION = {EUROGRAPHICS, MPI f{\"u}r Informatik, Universit{\"a}t des Saarlandes}, PADDRESS = {Oxford, UK}, ADDRESS = {Saarbr{\"u}cken, Germany}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, SERIES = {Computer Graphics Forum}, VOLUME = {21}, ISBN = {0167-7055}, YEAR = {2002}, PAGES = {575--584}, ABSTRACT = {We present a hardware-based, volumetric approach for rendering knit wear at very interactive rates. A single stitch is represented by a volumetric texture with each voxel storing the main direction of the strands of yarn inside it. We render the knit wear in layers using an approximation of the Banks model. Our hardware implementation allows specular and diffuse material properties to change from one voxel to the next. This enables us to represent yarn made up of different components or render garments with complicated color patterns. Furthermore, our approach can handle self-shadowing of the stitches, and can easily be adapted to also include view-independent scattering. The resulting shader lends itself naturally to mip-mapping, and requires no reordering of the base geometry, making it versatile and easy to use.}, } @PHDTHESIS{DaubertDiss03, AUTHOR = {Daubert, Katja}, TITLE = {Hardware-Supported Cloth Rendering}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {August}, YEAR = {2003}, } @ARTICLE{Daubert:2003:ELT, AUTHOR = {Daubert, Katja and Heidrich, Wolfgang and Kautz, Jan and Dischler, Jean-Michel and Seidel, Hans-Peter}, JOURNAL = {IEEE Computer Graphics and Applications}, TITLE = {Efficient Light Transport Using Precomputed Visibility}, ADDRESS = {Los Alamitos, USA}, NUMBER = {3}, PUBLISHER = {IEEE}, MONTH = {May}, VOLUME = {23}, YEAR = {2003}, PAGES = {28--37}, ABSTRACT = {Visibility computations are the most time-consuming part of global illumination algorithms. The cost is amplified by the fact that quite often identical or similar information is recomputed multiple times. In particular this is the case when multiple images of the same scene are to be generated under varying lighting conditions and/or viewpoints. But even for a single image with static illumination, the computations could be accelerated by reusing visibility information for many different light paths. In this paper we describe a general method of precomputing, storing, and reusing visibility information for light transport in a number of different types of scenes. In particular, we consider general parametric surfaces, triangle meshes without a global parameterization, and participating media. We also reorder the light transport in such a way that the visibility information is accessed in structured memory access patterns. This yields a method that is well suited for SIMD-style parallelization of the light transport, and can efficiently be implemented both in software and using graphics hardware. We finally demonstrate applications of the method to highly efficient precomputation of BRDFs, bidirectional texture functions, light fields, as well as near-interactive volume lighting.}, } @INPROCEEDINGS{Davydov:1999:CubicSI, AUTHOR = {Davydov, Oleg and N{\"u}rnberger, G{\"u}nther and Zeilfelder, Frank}, EDITOR = {Cohen, Albert and Rabut, Christophe and Schumaker, Larry L.}, TITLE = {Cubic Spline Interpolation on Nested Polygon Triangulations}, BOOKTITLE = {Curve and Surface Fitting, Saint-Malo 1999}, PADDRESS = {Nashville, USA}, ADDRESS = {Saint Malo}, PUBLISHER = {Vanderbilt University}, MONTH = {June}, SERIES = {Innovations in Applied Mathematics}, ISBN = {0-826-51357-3}, YEAR = {2000}, PAGES = {161--170}, } @ARTICLE{DDM2003, AUTHOR = {Damez, Cyrille and Dmitriev, Kirill and Myszkowski, Karol}, JOURNAL = {Computer Graphics Forum}, TITLE = {State of the Art for Global Illumination in Interactive Applications and High-Quality Animations}, ADDRESS = {Oxford, UK}, NUMBER = {1}, PUBLISHER = {Blackwell}, MONTH = {March}, VOLUME = {22}, ISBN = {0167-7055}, YEAR = {2003}, PAGES = {55--77}, ABSTRACT = {Global illumination algorithms are regarded as computationally intensive. This cost is a practical problem when producing animations or when interactions with complex models are required. Several algorithms have been proposed to address this issue. Roughly, two families of methods can be distinguished. The first one aims at providing interactive feedback for lighting design applications. The second one gives higher priority to the quality of results, and therefore relies on offline computations. Recently, impressive advances have been made in both categories. In this report, we present a survey and classification of the most up-to-date of these methods.}, } @INPROCEEDINGS{deAguiar2006_HM07, AUTHOR = {de Aguiar, Edilson and Theobalt, Christian and Stoll, Carsten and Seidel, Hans-Peter}, EDITOR = {Elgammal, A. and Rosenhahn, Bodo and Klette, R.}, TITLE = {Marker-less 3D Feature Tracking for Mesh-based Motion Capture.}, BOOKTITLE = {Human Motion - Understanding, Modeling, Capture and Animation}, PADDRESS = {Berlin, Germany}, ADDRESS = {Rio de Janeiro, Brazil}, PUBLISHER = {Springer}, MONTH = {October}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4814}, ISBN = {978-3-540-75702-3}, YEAR = {2007}, PAGES = {1--15}, ABSTRACT = {We present a novel algorithm that robustly tracks 3D trajectories of features on a moving human who has been recorded with multiple video cameras. Our method does so without special markers in the scene and can be used to track subjects wearing everyday apparel. By using the paths of the 3D points as constraints in a fast mesh deformation approach, we can directly animate a static human body scan such that it performs the same motion as the captured ubject. Our method can therefore be used to directly animate high quality geometry models from unaltered video data which opens the door to new applications in motion capture, 3D Video and computer animation. Since our method does not require a kinematic skeleton and only employs a handful of feature trajectories to generate ifelike animations with realistic surface deformations, it can lso be used to track subjects wearing wide apparel, and even nimals. We demonstrate the performance of our approach using several captured real-world sequences, and also validate its accuracy. }, } @INCOLLECTION{deAguiar2007_book, AUTHOR = {Theobalt, Christian and de Aguiar, Edilson and Magnor, Marcus and Seidel, Hans-Peter}, EDITOR = {Ozaktas, Haldun and Onural, Levent}, TITLE = {Reconstructing Human Shape, Motion and Appearance from Multi-view Video}, BOOKTITLE = {Three-Dimensional Television: Capture, Transmission, and Display}, ADDRESS = {Heidelberg, Germany}, PUBLISHER = {Springer}, MONTH = {November}, YEAR = {2008}, PAGES = {29--58}, ABSTRACT = {XX}, } @INPROCEEDINGS{deAguiar2007_SIBGRAPI, AUTHOR = {de Aguiar, Edilson and Zayer, Rhaleb and Theobalt, Christian and Magnor, Marcus and Seidel, Hans-Peter}, TITLE = {A Simple Framework for Natural Animation of Digitized Models}, BOOKTITLE = {SIBGRAPI'07 - XX Brazilian Symposium on Computer Graphics and Image Processing}, PADDRESS = {Piscataway, USA}, ADDRESS = {Belo Horizonte, Brazil}, PUBLISHER = {IEEE}, MONTH = {October}, DOI = {10.1109/SIBGRA.2007.4368162}, YEAR = {2007}, PAGES = {3--10}, ABSTRACT = {We present a versatile, fast and simple framework to generate animations of scanned human characters from input optical motion capture data. Our method is purely meshbased and requires only a minimum of manual interaction. The only manual step needed to create moving virtual people is the placement of a sparse set of correspondences between the input data and the mesh to be animated. The proposed algorithm implicitly generates realistic body deformations, and can easily transfer motions between human subjects of completely different shape and proportions. We feature a working prototype system that demonstrates that our method can generate convincing lifelike character animations directly from optical motion capture data.}, } @INPROCEEDINGS{deAguiar2008, AUTHOR = {de Aguiar, Edilson and Stoll, Carsten and Ahmed, Naveed and Seidel, Hans-Peter}, EDITOR = {Turk, Greg}, TITLE = {Performance Capture from Sparse Multi-View Video}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2008}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, USA}, NUMBER = {3}, PUBLISHER = {ACM}, SERIES = {ACM Transactions on Graphics}, VOLUME = {27(3)}, YEAR = {2008}, PAGES = {1--10}, ABSTRACT = {This paper proposes a new marker-less approach to capturing human performances from multi-view video. Our algorithm can jointly reconstruct spatio-temporally coherent geometry, motion and textural surface appearance of actors that perform complex and rapid moves. Furthermore, since our algorithm is purely meshbased and makes as few as possible prior assumptions about the type of subject being tracked, it can even capture performances of people wearing wide apparel, such as a dancer wearing a skirt. To serve this purpose our method efficiently and effectively combines the power of surface- and volume-based shape deformation techniques with a new mesh-based analysis-through-synthesis framework. This framework extracts motion constraints from video and makes the laser-scan of the tracked subject mimic the recorded performance. Also small-scale time-varying shape detail is recovered by applying model-guided multi-view stereo to refine the model surface. Our method delivers captured performance data at higher level of detail, is highly versatile, and is applicable to many complex types of scenes that could not be handled by alternative marker-based or marker-free recording techniques.}, } @INPROCEEDINGS{deAguiar2008EG, AUTHOR = {de Aguiar, Edilson and Theobalt, Christian and Thrun, Sebastian and Seidel, Hans-Peter}, EDITOR = {Scopigno, Roberto and Gr{\"o}ller, Eduard}, TITLE = {Automatic Conversion of Mesh Animations into Skeleton-based Animations}, BOOKTITLE = {Computer Graphics Forum (Proceedings Eurographics EG'08)}, ORGANIZATION = {: European Association for Computer Graphics (Eurographics)}, PADDRESS = {Oxford, UK}, ADDRESS = {Hersonissos, Crete, Greece}, NUMBER = {2}, PUBLISHER = {Blackwell}, VOLUME = {27(2)}, YEAR = {2008}, PAGES = {389--397}, } @INPROCEEDINGS{deAguiar3DTVCON2007, AUTHOR = {de Aguiar, Edilson and Zayer, Rhaleb and Theobalt, Christian and Magnor, Marcus and Seidel, Hans-Peter}, EDITOR = {Triantafyllidis, Georgios and Onural, Levent}, TITLE = {Video-driven animation of human body scans}, BOOKTITLE = {IEEE 3DTV Conference}, PADDRESS = {Piscataway, USA}, ADDRESS = {Kos Island, Greece}, PUBLISHER = {IEEE}, YEAR = {2007}, PAGES = {1--4}, ABSTRACT = {We present a versatile, fast and simple framework to generate animations of scanned human characters from input multiview video sequences. Our method is purely mesh-based and requires only a minimum of manual interaction. The proposed algorithm implicitly generates realistic body deformations and can easily transfer motions between human subjects of completely different shape and proportions. We feature a working prototype system that demonstrates that our method can generate convincing lifelike character animations from marker-less optical motion capture data.}, } @INPROCEEDINGS{deAguiarCVMP05, AUTHOR = {de Aguiar, Edilson and Theobalt, Christian and Magnor, Marcus and Seidel, Hans-Peter}, TITLE = {Reconstructing Human Shape and Motion from Multi-View Video}, BOOKTITLE = {2nd European Conference on Visual Media Production (CVMP)}, PADDRESS = {London, UK}, ADDRESS = {London, UK}, PUBLISHER = {The IEE}, MONTH = {December}, ISBN = {0-86341-583-0}, YEAR = {2005}, PAGES = {42--49}, ABSTRACT = {In model-based free-viewpoint video, a detailed representation of the time-varying geometry of a real-word scene is used to generate renditions of it from novel viewpoints. In this paper, we present a method for reconstructing such a dynamic geometry model of a human actor from multi-view video. In a two-step procedure, first the spatio-temporally consistent shape and poses of a generic human body model are estimated by means of a silhouette-based analysis-by-synthesis method. In a second step, subtle details in surface geometry that are specific to each particular time step are recovered by enforcing a color-consistency criterion. By this means, we generate a realistic representation of the time-varying geometry of a moving person that also reproduces these dynamic surface variations.}, } @INPROCEEDINGS{deAguiarCVPR2007, AUTHOR = {de Aguiar, Edilson and Theobalt, Christian and Stoll, Carsten and Seidel, Hans-Peter}, EDITOR = {Baker, Simon and Matas, Jiri and Zabih, Ramin}, TITLE = {Marker-less Deformable Mesh Tracking for Human Shape and Motion Capture}, BOOKTITLE = {IEEE International Conference on Computer Vision and Pattern Recognition (CVPR)}, ORGANIZATION = {IEEE}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Minneapolis, USA}, PUBLISHER = {IEEE}, MONTH = {June}, VOLUME = {6}, ISBN = {1-424-41179-3}, YEAR = {2007}, PAGES = {2502--2509}, ABSTRACT = {We present a novel algorithm to jointly capture the motion and the dynamic shape of humans from multiple video streams without using optical markers. Instead of relying on kinematic skeletons, as traditional motion capture methods, our approach uses a deformable high-quality mesh of a human as scene representation. It jointly uses an image-based \mbox{3D} correspondence estimation algorithm and a fast Laplacian mesh deformation scheme to capture both motion and surface deformation of the actor from the input video footage. As opposed to many related methods, our algorithm can track people wearing wide apparel, it can straightforwardly be applied to any type of subject, e.g. animals, and it preserves the connectivity of the mesh over time. We demonstrate the performance of our approach using synthetic and captured real-world video sequences and validate its accuracy by comparison to the ground truth.}, } @INPROCEEDINGS{DeAguiarTheoPG2004, AUTHOR = {de Aguiar, Edilson and Theobalt, Christian and Magnor, Marcus and Theisel, Holger and Seidel, Hans-Peter}, EDITOR = {Cohen-Or, Daniel and Ko, Hyeong-Seok and Terzopoulos, Demetri and Warren, Joe}, TITLE = {M3 : Marker-free Model Reconstruction and Motion Tracking from 3D Voxel Data}, BOOKTITLE = {12th Pacific Conference on Computer Graphics and Applications, PG 2004}, ORGANIZATION = {IEEE}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Seoul, Korea}, PUBLISHER = {IEEE}, MONTH = {October}, ISBN = {0-7695-2234-3}, YEAR = {2004}, PAGES = {101--110}, ABSTRACT = {In computer animation, human motion capture from video is a widely used technique to acquire motion parameters. The acquisition process typically requires an intrusion into the scene in the form of optical markers which are used to estimate the parameters of motion as well as the kinematic structure of the performer. Marker-free optical motion capture approaches exist, but due to their dependence on a specific type of a priori model they can hardly be used to track other subjects, e.g. animals. To bridge the gap between the generality of marker-based methods and the applicability of marker-free methods we present a flexible non-intrusive approach that estimates both, a kinematic model and its parameters of motion from a sequence of voxel-volumes. The volume sequences are reconstructed from multi-view video data by means of a shape-from-silhouette technique. The described method is well-suited for but not limited to motion capture of human subjects.}, } @INPROCEEDINGS{deAguiar_isvc2006, AUTHOR = {de Aguiar, Edilson and Theobalt, Christian and Seidel, Hans-Peter}, EDITOR = {Bebis, George and Boyle, Richard and Parvin, Bahram and Koracin, Darko and Remagnino, Paolo and Nefian, Ara and Meenakshisundaram, Gopi and Pascucci, Valerio and Zara, Jiri and Molineros, Jose and Theisel, Holger and Malzbender, Tom}, TITLE = {Automatic Learning of Articulated Skeletons from {3D} Marker Trajectories}, BOOKTITLE = {Advances in Visual Computing : Second International Symposium, ISVC 2006, Part I}, PADDRESS = {Berlin, Germany}, ADDRESS = {Lake Tahoe, NV, USA}, PUBLISHER = {Springer}, MONTH = {November}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4291}, ISBN = {3-540-48628-3}, YEAR = {2006}, PAGES = {485--494}, ABSTRACT = {We present a novel fully-automatic approach for estimating an articulated skeleton of a moving subject and its motion from body marker trajectories that have been measured with an optical motion capture system. Our method does not require a priori information about the shape and proportions of the tracked subject, can be applied to arbitrary motion sequences, and renders dedicated initialization poses unnecessary. To serve this purpose, our algorithm first identifies individual rigid bodies by means of a variant of spectral clustering. Thereafter, it determines joint positions at each time step of motion through numerical optimization, reconstructs the skeleton topology, and finally enforces fixed bone length constraints. Through experiments, we demonstrate the robustness and effciency of our algorithm and show that it outperforms related methods from the literature in terms of accuracy and speed.}, } @INPROCEEDINGS{deAguiar_vr2007, AUTHOR = {de Aguiar, Edilson and Theobalt, Christian and Stoll, Carsten and Seidel, Hans-Peter}, EDITOR = {Bowman, Doug and Julier, Simon}, TITLE = {Rapid Animation of Laser-scanned Humans}, BOOKTITLE = {IEEE Virtual Reality 2007}, PADDRESS = {Piscataway, USA}, ADDRESS = {Charlotte, USA}, PUBLISHER = {IEEE}, ISBN = {1-4244-0906-3}, DOI = {10.1109/VR.2007.352486}, YEAR = {2007}, PAGES = {223--226}, ABSTRACT = {We present a simple and ef cient approach to turn laser-scanned human geometry into a realistically moving virtual avatar. Instead of relying on the classical skeleton-based animation pipeline, our method uses a mesh-based Laplacian editing scheme to drive the motion of the scanned model. Our framework elegantly solves the motion retargeting problem and produces realistic non-rigid surface deformation with minimal user interaction. Realistic animations can easily be generated from a variety of input motion descriptions, which we exemplify by applying our method to both marker-free and marker-based motion capture data.}, } @ARTICLE{didyk2008ebvfhdrd, AUTHOR = {Didyk, Piotr and Mantiuk, Rafał and Hein, Matthias and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum}, TITLE = {Enhancement of Bright Video Features for HDR Displays}, NUMBER = {4}, PUBLISHER = {Blackwell}, VOLUME = {27}, DOI = {10.1111/j.1467-8659.2008.01265.x}, YEAR = {2008}, PAGES = {1265--1274}, ABSTRACT = { To utilize the full potential of new high dynamic range (HDR) displays, a system for the enhancement of bright luminous objects in video sequences is proposed. The system classifies clipped (saturated) regions as lights, reflections or diffuse surfaces using a semi-automatic classifier and then enhances each class of objects with respect to its relative brightness. The enhancement algorithm can significantly stretch the contrast of clipped regions while avoiding amplification of noise and contouring. We demonstrate that the enhanced video is strongly preferred to non-enhanced video, and it compares favorably to other methods.}, } @INPROCEEDINGS{Didyk2009, AUTHOR = {Didyk, Piotr and Eisemann, Elmar and Ritschel, Tobias and Myszkowski, Karol and Seidel, Hans-Peter}, TITLE = {A Question of Time: Importance and Possibilities of High Refresh-rates}, BOOKTITLE = {Visual Computing Research Conference}, ORGANIZATION = {Intel Visual Computing Institute}, PADDRESS = {Intel Visual Computing Institute – Saarbruecken, Germany}, ADDRESS = {8-10 December 2009}, PUBLISHER = {Intel Visual Computing Institute}, YEAR = {2009}, PAGES = {1--3}, ABSTRACT = {This work will discuss shortcomings of traditional rendering techniques on today's wide-spread LCD screens. The main observation is that 3D renderings often appear blurred when observed on such a display. Although this might seem to be a shortcoming of the hardware, such blur is actually a consequence of the human visual system perceiving such displays.\\ In this work, we introduce a perception-aware rendering technique that is of very low cost, but significantly improves performance, as well as quality. Especially in conjunction with more recent devices, initially conceived for 3D shutter glasses, our approach achieves significant gains. Besides quality, we show that such approaches even improve task-performance which makes it a crucial component for future interactive applications.}, } @ARTICLE{Didyk2010, AUTHOR = {Didyk, Piotr and Eisemann, Elmar and Ritschel, Tobias and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Akenine-M{\"o}ller, Tomas and Zwicker, Matthias}, JOURNAL = {Computer Graphics Forum (Proceedings EUROGRAPHICS 2010)}, TITLE = {Perceptually-motivated Real-time Temporal Upsampling of {3D} Content for High-refresh-rate Displays}, BOOKTITLE = {EUROGRAPHICS 2010 : The European Association for Computer Graphics 31st Annual Conference}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell}, MONTH = {May}, SERIES = {Computer Graphics Forum}, VOLUME = {29}, DOI = {10.1111/j.1467-8659.2009.01641.x}, YEAR = {2010}, PAGES = {713--722}, ABSTRACT = {High-refresh-rate displays (e.\,g.,~120\,Hz) have recently become available on the consumer market and quickly gain on popularity. One of their aims is to reduce the perceived blur created by moving objects that are tracked by the human eye. However, an improvement is only achieved if the video stream is produced at the same high refresh rate (i.\,e.~120\,Hz). Some devices, such as LCD~TVs, solve this problem by converting low-refresh-rate content (i.\,e.~50\,Hz~PAL) into a higher temporal resolution (i.\,e.~200\,Hz) based on two-dimensional optical flow. In our approach, we will show how rendered three-dimensional images produced by recent graphics hardware can be up-sampled more efficiently resulting in higher quality at the same time. Our algorithm relies on several perceptual findings and preserves the naturalness of the original sequence. A psychophysical study validates our approach and illustrates that temporally up-sampled video streams are preferred over the standard low-rate input by the majority of users. We show that our solution improves task performance on high-refresh-rate displays.}, } @ARTICLE{Didyk2010a, AUTHOR = {Didyk, Piotr and Eisemann, Elmar and Ritschel, Tobias and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Hoppe, Hugues}, JOURNAL = {ACM Transactions on Graphics (Proc. of ACM SIGGRAPH)}, TITLE = {Apparent Display Resolution Enhancement for Moving Images}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2010}, ADDRESS = {New York, NY}, NUMBER = {4}, PUBLISHER = {ACM}, SERIES = {ACM Transactions on Graphics}, VOLUME = {29}, ISBN = {0730-0301}, DOI = {10.1145/1833349.1778850}, YEAR = {2010}, PAGES = {113,1--113,8}, } @INPROCEEDINGS{Didyk2010b, AUTHOR = {Didyk, Piotr and Ritschel, Tobias and Eisemann, Elmar and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Koch, Reinhard and Kolb, Andreas and Rezk-Salama, Christof}, TITLE = {Adaptive Image-space Stereo View Synthesis}, BOOKTITLE = {VMV 2010 : Vision, Modeling \& Visualization}, PADDRESS = {Goslar}, ADDRESS = {Siegen, Germany}, PUBLISHER = {Eurographics Association}, ISBN = {978-3-905673-79-1}, DOI = {10.2312/PE/VMV/VMV10/299-306}, YEAR = {2010}, PAGES = {299--306}, } @MISC{Didyk2011Course, AUTHOR = {Didyk, Piotr and Banterle, Francesco and Artusi, Alessandro and Aydin, Tunc and Eisemann, Elmar and Gutierrez, Diego and Mantiuk, Rafal and Myszkowski, Karol}, TITLE = {Multidimensional Image Retargeting}, HOWPUBLISHED = {ACM Siggraph ASIA 2011 Courses, Hong Kong}, YEAR = {2011}, } @PHDTHESIS{Didyk2012, AUTHOR = {Didyk, Piotr}, TITLE = {Perceptual Display: Exceeding Display Limitations by Exploiting the Human Visual System}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {August}, YEAR = {2012}, } @INCOLLECTION{Didyk2012Chapter, AUTHOR = {Didyk, Piotr and Ritschel, Tobias and Eisemann, Elmar and Myszkowski, Karol}, EDITOR = {Lukac, Ratislav}, TITLE = {Exceeding Physical Limitations: Apparent Display Qualities}, BOOKTITLE = {Perceptual Digital Imaging: Methods and Applications}, ADDRESS = {Boca Raton, FL}, PUBLISHER = {CRC}, ISBN = {9781439868560}, YEAR = {2012}, PAGES = {469--501}, } @INPROCEEDINGS{Didyk2012Cornsweet, AUTHOR = {Didyk, Piotr and Ritschel, Tobias and Eisemann, Elmar and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Rogowitz, Bernice E. and Pappas, Thrasyvoulos N. and de Ridder, Huib}, TITLE = {Apparent Stereo: The Cornsweet Illusion Can Enhance Perceived Depth}, BOOKTITLE = {Human Vision and Electronic Imaging XVII (HVEI)}, PADDRESS = {Bellingham, Washington}, ADDRESS = {Burlingame, CA}, PUBLISHER = {SPIE/IS\&T}, SERIES = {Proceedings of SPIE}, VOLUME = {8291}, ISBN = {9780819489388}, DOI = {10.1117/12.907612}, YEAR = {2012}, PAGES = {1--12}, } @MISC{Didyk2012Course, AUTHOR = {Banterle, Francesco and Artusi, Alessandro and Aydin, Tunc O. and Didyk, Piotr and Eisemann, Elmar and Gutierrez, Diego and Mantiuk, Rafal and Myszkowski, Karol and Ritschel, Tobias}, EDITOR = {Pajarola, Renato and Spagnuolo, Michela}, TITLE = {Mapping Images to Target Devices: Spatial, Temporal, Stereo, Tone, and Color}, BOOKTITLE = {Eurographics 2012 : Tutorials}, ADDRESS = {Aire-la-Ville}, HOWPUBLISHED = {EUROGRAPHICS 2012 - Tutorials}, MONTH = {May}, DOI = {10.2312/conf/EG2012/tutorials/t1}, YEAR = {2012}, PAGES = {T1}, } @ARTICLE{Didyk2012SigAsia, AUTHOR = {Didyk, Piotr and Ritschel, Tobias and Eisemann, Elmar and Myszkowski, Karol and Seidel, Hans-Peter and Matusik, Wojciech}, JOURNAL = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH Asia)}, TITLE = {A Luminance-Contrast-Aware Disparity Model and Applications}, ADDRESS = {New York, NY}, NUMBER = {6}, PUBLISHER = {ACM}, VOLUME = {31}, DOI = {10.1145/2366145.2366203}, YEAR = {2012}, PAGES = {184:1--184:10}, } @MISC{DidykP2010, AUTHOR = {Didyk, Piotr and Eisemann, Elmar and Ritschel, Tobias and Myszkowski, Karol and Seidel, Hans-Peter}, TITLE = {Apparent Display Resolution Enhancement for Moving Images}, HOWPUBLISHED = {WO Patent Application WO/2011/135052 A1}, YEAR = {2011}, } @MISC{DidykP2011, AUTHOR = {Didyk, Piotr and Ritschel, Tobias and Eisemann, Elmar and Myszkowski, Karol and Seidel, Hans-Peter}, TITLE = {Methods and Device for Processing Digital Stereo Image Content}, HOWPUBLISHED = {WO Patent Application Pending}, YEAR = {2011}, } @MISC{DidykP2012, AUTHOR = {Didyk, Piotr and Ritschel, Tobias and Eisemann, Elmar and Myszkowski, Karol and Seidel, Hans-Peter and Matusik, Wojciech}, TITLE = {A Luminance-Contrast-Aware Disparity Model and Applications}, HOWPUBLISHED = {WO Patent Application Pending}, YEAR = {2012}, ABSTRACT = {Binocular disparity is one of the most important depth cues used by the human visual system. Recently developed stereo-perception models allow us to successfully manipulate disparity in order to improve viewing comfort, depth discrimination as well as stereo content compression and display. Nonetheless, all existing models neglect the substantial influence of luminance on stereo perception. Our work is the first to account for the interplay of luminance contrast (magnitude/frequency) and disparity and our model predicts the human response to complex stereo-luminance images. Besides improving existing disparity-model applications (e. g., difference metrics or compression), our approach offers new possibilities, such as joint luminance contrast and disparity manipulation or the optimization of auto-stereoscopic content. We validate our results in a user study, which also reveals the advantage of considering luminance contrast and its significant impact on disparity manipulation techniques.}, } @ARTICLE{DidykREMS2011, AUTHOR = {Didyk, Piotr and Ritschel, Tobias and Eisemann, Elmar and Myszkowski, Karol and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH)}, TITLE = {A Perceptual Model for Disparity}, ADDRESS = {New York, NY}, NUMBER = {4}, PUBLISHER = {ACM}, VOLUME = {30}, DOI = {10.1145/2010324.1964991}, YEAR = {2011}, PAGES = {96:1--96:10}, ABSTRACT = {Binocular disparity is an important cue for the human visual system to recognize spatial layout, both in reality and simulated virtual worlds. This paper introduces a perceptual model of disparity for computer graphics that is used to define a metric to compare a stereo image to an alternative stereo image and to estimate the magnitude of the perceived disparity change. Our model can be used to assess the effect of disparity to control the level of undesirable distortions or enhancements (introduced on purpose). A number of psycho-visual experiments are conducted to quantify the mutual effect of disparity magnitude and frequency to derive the model. Besides difference prediction, other applications include compression, and re-targeting. We also present novel applications in form of hybrid stereo images and backward-compatible stereo. The latter minimizes disparity in order to convey a stereo impression if special equipment is used but produces images that appear almost ordinary to the naked eye. The validity of our model and difference metric is again confirmed in a study.}, } @INPROCEEDINGS{dietrich:04:BoeingSketch, AUTHOR = {Dietrich, Andreas and Wald, Ingo and Slusallek, Philipp}, TITLE = {Interactive Visualization of Exceptionally Complex Industrial CAD Datasets}, BOOKTITLE = {ACM SIGGRAPH 2004: Sketches and Applications}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, USA}, PUBLISHER = {ACM}, YEAR = {2004}, PAGES = {1--1}, } @MISC{dietrich:04:Cover-ISBoeing, AUTHOR = {Dietrich, Andreas and Wald, Ingo and Slusallek, Philipp}, TITLE = {{Interaktive Visualisierung eines hoch komplexen Boeing 777 Modells}}, HOWPUBLISHED = {Cover Image and Short Article on Informatik Spektrum 22(4)}, MONTH = {August}, YEAR = {2004}, PAGES = {394--394}, } @INPROCEEDINGS{dietrich:04:VrmlRT, AUTHOR = {Dietrich, Andreas and Wald, Ingo and Wagner, Markus and Slusallek, Philipp}, EDITOR = {Ikai, Yasushi}, TITLE = {VRML Scene Graphs on an Interactive Ray Tracing Engine}, BOOKTITLE = {IEEE Virtual Reality 2004 : VR 2004}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Chicago, Illinois}, PUBLISHER = {IEEE}, ISBN = {0-7803-8415-6}, YEAR = {2004}, PAGES = {109--116}, ABSTRACT = {With the recent breakthroughs in ray tracing technology, high-quality image generation at interactive rates is finally becoming reality. As a consequence ray tracing will likely play a larger role in visualization systems, enabling the conception and creation of completely new interactive graphical applications.}, } @INPROCEEDINGS{dis03, AUTHOR = {Dodgson, Neil A. and Ivrissimtzis, Ioannis and Sabin, Malcolm}, EDITOR = {Cohen, Albert and Merrien, Jean-Louis and Schumaker, Larry L.}, TITLE = {Characteristics of dual-sqrt(3) subdivision schemes}, BOOKTITLE = {Curve and Surface Fitting: Saint-Malo 2002}, ORGANIZATION = {L' Association Fran{\c{c}}aise d'Approximation (AFA)}, PADDRESS = {Brentwood, USA}, ADDRESS = {St Malo, France}, PUBLISHER = {Nashboro Press}, SERIES = {Proceedings of the 5th Conference on Curves and Surfaces}, VOLUME = {2}, ISBN = {0-9728482-1-5}, YEAR = {2003}, PAGES = {119--128}, } @PHDTHESIS{DissGuentherJohannes2014, AUTHOR = {G{\"u}nther, Johannes}, TITLE = {Ray tracing of dynamic scenes}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, YEAR = {2014}, } @PHDTHESIS{DissReshetouskiIlya2014, AUTHOR = {Reshetouski, Ilya}, TITLE = {Kaleidoscopic Imaging}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, YEAR = {2014}, } @INPROCEEDINGS{dmitrie04ppt, AUTHOR = {Dmitriev, Kirill and Seidel, Hans-Peter}, EDITOR = {Girod, Bernd and Magnor, Marcus and Seidel, Hans-Peter}, TITLE = {Progressive Path Tracing with Lightweight Local Error Estimation}, BOOKTITLE = {Vision, modeling, and visualization 2004 (VMV-04)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Stanford, USA}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, ISBN = {3-89838-058-0}, YEAR = {2004}, PAGES = {249--254}, ABSTRACT = {Adaptive sampling techniques typically applied in path tracing are not progressive. The reason is that they need all the samples used to compute pixel color for error estimation. Thus progressive computation would need to store all the samples for all the pixels, which is too expensive. Absence of progressivity is a big disadvantage of adaptive path tracing algorithms because a user may become aware of some unwanted effects on the image only after quite significant time. We propose a new estimate of local error in path tracing. The new technique happens to be lightweight in terms of both memory and execution time and lends itself very well to progressivity. Also, even thought perceptual error metric is used, it allows changes of any tone mapping parameters during the course of computation. In this case none of the previous effort is lost, error distribution is immediately updated and used for refining the solution.}, } @ARTICLE{dmitriev00lpv, AUTHOR = {Kopylov, Edward and Dmitriev, Kirill}, JOURNAL = {Computers \& Graphics}, TITLE = {Light propagation visualization as a tool for 3D scene analysis in lighting design}, PUBLISHER = {Elsevier}, VOLUME = {24}, YEAR = {2000}, PAGES = {31--39}, ABSTRACT = {This paper is devoted to a designer tool, which is an extension of particle tracing algorithm for analysis of scenes, artifacts, image ghosts, and ray-tracing mechanism itself. The global illumination problem here is considered at the level of light propagation visualization, which takes into account all cognitive benefits of visual representation. Physically accurate particle tracers randomly generate thousands of rays per second to simulate light propagation in a scene considering light as consisting of photons with a constant energy. The proposed tool utilizes and filters the information of how light photons propagate in the scene. Several examples in the paper demonstrate a practical value of obtained photon tracks for scene analysis.}, } @INPROCEEDINGS{dmitriev04acs, AUTHOR = {Dmitriev, Kirill and Annen, Thomas and Krawczyk, Grzegorz and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Lau, Rynson and Baciu, George}, TITLE = {A CAVE System for Interactive Modeling of Global Illumination in Car Interior}, BOOKTITLE = {ACM Symposium on Virtual Reality Software and Technology (VRST 2004)}, PADDRESS = {New York, USA}, ADDRESS = {Hong Kong}, PUBLISHER = {ACM}, YEAR = {2004}, PAGES = {137--145}, ABSTRACT = {Global illumination dramatically improves realistic appearance of rendered scenes, but usually it is neglected in VR systems due to its high costs. In this work we present an efficient global illumination solution specifically tailored for those CAVE applications, which require an immediate response for dynamic light changes and allow for free motion of the observer, but involve scenes with static geometry. As an application example we choose the car interior modeling under free driving conditions. We illuminate the car using dynamically changing High Dynamic Range (HDR) environment maps and use the Precomputed Radiance Transfer (PRT) method for the global illumination computation. We leverage the PRT method to handle scenes with non-trivial topology represented by complex meshes. Also, we propose a hybrid of PRT and final gathering approach for high-quality rendering of objects with complex Bi-directional Reflectance Distribution Function (BRDF). We use this method for predictive rendering of the navigation LCD panel based on its measured BRDF. Since the global illumination computation leads to HDR images we propose a tone mapping algorithm tailored specifically for the CAVE. We employ head tracking to identify the observed screen region and derive for it proper luminance adaptation conditions, which are then used for tone mapping on all walls in the CAVE. We distribute our global illumination and tone mapping computation on all CPUs and GPUs available in the CAVE, which enables us to achieve interactive performance even for the costly final gathering approach.}, } @INPROCEEDINGS{Dmitriev2002, AUTHOR = {Dmitriev, Kirill and Brabec, Stefan and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Debevec, Paul and Gibson, Simon}, TITLE = {Interactive Global Illumination Using Selective Photon Tracing}, BOOKTITLE = {Proceedings of the 13th Eurographics Workshop on Rendering}, ORGANIZATION = {Eurographics}, PADDRESS = {Vienna, Austria}, ADDRESS = {Pisa, Italy}, PUBLISHER = {Eurographics/ACM}, YEAR = {2002}, PAGES = {21--33}, } @TECHREPORT{DmitrievHavranSeidel2004, AUTHOR = {Dmitriev, Kirill and Havran, Vlastimil and Seidel, Hans-Peter}, TITLE = {Faster Ray Tracing with SIMD Shaft Culling}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, TYPE = {Research Report}, ADDRESS = {Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-2004-4-006}, MONTH = {December}, ISBN = {0946-011X}, YEAR = {2004}, PAGES = {13}, ABSTRACT = {This paper presents a generic technique for acceleration of ray tracing of polygonal scenes. We propose scheduling rays in a way that forms pyramidal shafts. We show that under certain conditions fulfilled by the corner rays of a shaft, it is possible to immediately and conservatively answer visibility queries for the inner rays without expensive ray traversal through acceleration data structures (kd-tree in our case). We show that the presented technique is suitable for primary, secondary, and shadow rays.}, } @INPROCEEDINGS{DongGRKS2009:ClusterVisib, AUTHOR = {Dong, Zhao and Grosch, Thorsten and Ritschel, Tobias and Kautz, Jan and Seidel, Hans-Peter}, EDITOR = {Magnor, Marcus and Rosenhahn, Bodo and Theisel, Holger}, TITLE = {Real-time Indirect Illumination with Clustered Visibility}, BOOKTITLE = {Proceedings of the Vision, Modeling, and Visualization Workshop 2009 (VMV 2009)}, PADDRESS = {Magdeburg, Germany}, ADDRESS = {Braunschweig, Germany}, PUBLISHER = {Otto-Von-Guericke-Universit{\"a}t}, ISBN = {978-3-9804874-8-1}, YEAR = {2009}, PAGES = {187--196}, ABSTRACT = {Visibility computation is often the bottleneck when rendering indirect illumination. However, recent methods based on instant radiosity have demonstrated that accurate visibility is not required for indirect illumination. To exploit this insight, we cluster a large number of virtual point lights -- which represent the indirect illumination when using instant radiosity -- into a small number of virtual area lights. This allows us to compute visibility using recent real-time soft shadow algorithms. Such approximate and fractional from-area visibility is faster to compute and avoids banding when compared to exact binary from-point visibility. Our results show, that the perceptual error of this approximation is negligible and that we achieve real-time frame-rates for large and dynamic scenes. }, } @INPROCEEDINGS{DongImVis2007, AUTHOR = {Dong, Zhao and Kautz, Jan and Theobalt, Christian and Seidel, Hans-Peter}, EDITOR = {Alexa, Marc and Ju, Tao and Gortler, Steven}, TITLE = {Interactive Global Illumination Using Implicit Visibility}, BOOKTITLE = {The 15th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2007)}, ORGANIZATION = {IEEE Computer Society}, PADDRESS = {Washington DC, USA}, ADDRESS = {Maui Hawaii, USA}, PUBLISHER = {IEEE Computer Society}, MONTH = {October}, YEAR = {2007}, PAGES = {44--54}, } @MASTERSTHESIS{DongMSc05, AUTHOR = {Dong, Zhao}, TITLE = {Relevant Technology Study on Programmable Graphics Hardware (In Chinese)}, SCHOOL = {Zhejiang University}, TYPE = {Master's thesis}, MONTH = {April}, YEAR = {2005}, NOTE = {Supervisors: Prof. Qunsheng Peng and Associate Prof. Wei Chen}, } @ARTICLE{Dong:2010:VSSM, AUTHOR = {Yang, Baoguang and Dong, Zhao and Feng, Jieqing and Seidel, Hans-Peter and Kautz, Jan}, JOURNAL = {Computer Graphics Forum}, TITLE = {Variance soft shadow mapping}, ADDRESS = {Oxford, UK}, NUMBER = {7}, PUBLISHER = {Blackwell}, MONTH = {October}, VOLUME = {29}, ISBN = {1467-8659}, DOI = {10.1111/j.1467-8659.2010.01800.x}, YEAR = {2010}, PAGES = {2127--2134}, ABSTRACT = {We present variance soft shadow mapping (VSSM) for rendering plausible soft shadow in real-time. VSSM is based on the theoretical framework of percentage-closer soft shadows (PCSS) and exploits recent advances in variance shadow mapping (VSM). Our new formulation allows for the efficient computation of (average) blocker distances, a common bottleneck in PCSS-based methods. Furthermore, we avoid incorrectly lit pixels commonly encountered in VSM-based methods by appropriately subdividing the filter kernel. We demonstrate that VSSM renders highquality soft shadows efficiently (usually over 100 fps) for complex scene settings. Its speed is at least one order of magnitude faster than PCSS for large penumbra.}, } @INPROCEEDINGS{Drago2003b, AUTHOR = {Drago, Frederic and Myszkowski, Karol and Annen, Thomas and Chiba, Norishige}, EDITOR = {Brunet, Pere and Fellner, Dieter W.}, TITLE = {Adaptive Logarithmic Mapping For Displaying High Contrast Scenes}, BOOKTITLE = {The European Association for Computer Graphics 24th Annual Conference: EUROGRAPHICS 2003}, PADDRESS = {Oxford, UK}, ADDRESS = {Granada, Spain}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {22(3)}, YEAR = {2003}, PAGES = {419--426}, ABSTRACT = {We propose a fast, high quality tone mapping technique to display high contrast images on devices with limited dynamic range of luminance values. The method is based on logarithmic compression of luminance values, imitating the human response to light. A bias power function is introduced to adaptively vary logarithmic bases, resulting in good preservation of details and contrast. To improve contrast in dark areas, changes to the gamma correction procedure are proposed. Our adaptive logarithmic mapping technique is capable of producing perceptually tuned images with high dynamic content and works at interactive speeds. We demonstrate a successful application of our technique to a high dynamic range video player which enables to adjust optimal viewing conditions for any kind of display while taking into account the user preferences concerning brightness, contrast compression, and detail reproduction.}, } @BOOK{Dutre_2003book, AUTHOR = {Dutr{\'e}, Philip and Bekaert, Philippe and Bala, Kavita}, TITLE = {Advanced Global Illumination}, ADDRESS = {Natick, USA}, PUBLISHER = {A K Peters}, YEAR = {2003}, PAGES = {340}, } @ARTICLE{Dyken2008, AUTHOR = {Dyken, Christopher and Ziegler, Gernot and Theobalt, Christian and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum}, TITLE = {High-speed Marching Cubes using HistoPyramids}, ADDRESS = {Oxford, UK}, NUMBER = {8}, PUBLISHER = {Blackwell Publishing}, MONTH = {September}, VOLUME = {27}, DOI = {10.1111/j.1467-8659.2008.01182.x}, YEAR = {2008}, PAGES = {2028--2039}, ABSTRACT = {We present an implementation approach for Marching Cubes (MC) on graphics hardware for OpenGL 2.0 or comparable graphics APIs. It currently outperforms all other known graphics processing units (GPU)-based iso-surface extraction algorithms in direct rendering for sparse or large volumes, even those using the recently introduced geometry shader (GS) capabilites. To achieve this, we outfit the Histogram Pyramid (HP) algorithm, previously only used in GPU data compaction, with the capability for arbitrary data expansion. After reformulation of MC as a data compaction and expansion process, the HP algorithm becomes the core of a highly efficient and interactive MC implementation. For graphics hardware lacking GSs, such as mobile GPUs, the concept of HP data expansion is easily generalized, opening new application domains in mobile visual computing. Further, to serve recent developments, we present how the HP can be implemented in the parallel programming language CUDA (compute unified device architecture), by using a novel 1D chunk/layer construction.}, } @INPROCEEDINGS{DY::2010:VSSM, AUTHOR = {Dong, Zhao and Yang, Baoguang}, EDITOR = {Aliaga, Daniel and Oliveira, Manuel}, TITLE = {Variance Soft Shadow Mapping}, BOOKTITLE = {Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D) 2010}, ORGANIZATION = {ACM SIGGRAPH}, ADDRESS = {New York, NY, US}, PUBLISHER = {ACM}, YEAR = {2010}, PAGES = {94}, ABSTRACT = {\emph{Variance shadow map} (VSM) is a kind of pre-filtering shadow mapping method, which owns both good anti-aliasing quality and high performance for rendering hard shadow. However, soft shadow rendering based on VSM is non-trivial and remains unsolved. Motivated by it, in this paper we propose variance soft shadow mapping (VSSM) method for rendering plausible soft shadow. VSSM is based on the theoretical framework of \emph{percentage-closer soft shadows} (PCSS). In order to estimate the average blocker depth for computing penumbra size of each pixel, a novel formula is derived to illustrate how to compute it in VSSM. To tackle the ''non-planarity'' lit problem, which is caused by the \emph{single-bounded} variance-based shadow function, we present a practical pre-filtering kernel adaptive subdivision strategy. Such a divide-and-rule scheme is flexible and quality-controllable for removing incorrect lit. It can be efficiently applied for pre-filtering both the shadow comparison and average blocker depth. The experimental results demonstrate that the quality of \emph{variance soft shadow mapping}(VSSS) is equal with PCSS method in most cases, however its speed is at least one-order of magnitude faster than PCSS for middle-size penumbra.}, } @INPROCEEDINGS{Efremov2005SCCG, AUTHOR = {Efremov, Alexander and Havran, Vlastimil and Seidel, Hans-Peter}, TITLE = {Robust and numerically stable {B{\'e}zier} clipping method for ray tracing {NURBS} surfaces}, BOOKTITLE = {SCCG '05: Proceedings of the 21st Spring Conference on Computer Graphics}, ORGANIZATION = {ACM SIGGRAPH and EUROGRAPHICS}, TYPE = {http://www.acm.org}, PADDRESS = {New York, NY, USA}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {ACM}, MONTH = {May}, ISBN = {1-59593-203-6}, YEAR = {2005}, PAGES = {127--135}, ABSTRACT = {Raytracing has become a popular method for generating realistic images and movies. The progress in hardware development shows that the real time raytracing on a single PC might be possible in the ongoing future. Obviously, that new generation of raytracing based applications will require more visualization precision and flexibility. Most of the modern raytracing based applications only deal with triangles as basic primitives, which brings limitations to an application and may cause visual artifacts to appear. NURBS surface representation is common for most of 3D modeling tools because of its compactness and useful geometric properties of NURBS surfaces. Using the direct raytracing NURBS surfaces, one can achieve better quality of rendered images. Although, many such approaches have already been presented, almost all of them suffer from numerical problems or do not work in some special cases. This paper presents a modified B{\'e}zier clipping method for finding ray - NURBS surface intersection points, which is fast, robust, and numerically stable.}, } @PROCEEDINGS{eg2002, EDITOR = {Drettakis, George and Seidel, Hans-Peter}, TITLE = {EUROGRAPHICS 2002}, PADDRESS = {Oxford, UK}, ADDRESS = {Saarbr{\"u}cken, Germany}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {21}, YEAR = {2002}, PAGES = {656}, } @ARTICLE{Eiko2007, AUTHOR = {Ihrke, Ivo and Ziegler, Gernot and Tevs, Art and Theobalt, Christian and Magnor, Marcus and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH)}, TITLE = {Eikonal Rendering: Efficient Light Transport in Refractive Objects}, ADDRESS = {New York}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {July}, VOLUME = {26}, ISBN = {0730-0301}, DOI = {10.1145/1275808.1276451}, YEAR = {2007}, PAGES = {59--1 - 59-8}, ABSTRACT = {We present a new method for real-time rendering of sophisticated lighting effects in and around refractive objects. It enables us to realistically display refractive objects with complex material properties, such as arbitrarily varying refraction index, inhomogeneous attenuation, as well as spatially-varying anisotropic scattering and reflectance properties. User-controlled changes of lighting positions only require a few seconds of update time. Our method is based on a set of ordinary differential equations derived from the eikonal equation, the main postulate of geometric optics. This set of equations allows for fast casting of bent light rays with the complexity of a particle tracer. Based on this concept, we also propose an efficient light propagation technique using adaptive wavefront tracing. Efficient GPU implementations for our algorithmic concepts enable us to render visual effects that were previously not reproducible in this combination in real-time.}, } @INPROCEEDINGS{Eisemann2009GigaSketch, AUTHOR = {Crassin, Cyril and Neyret, Fabrice and Lefebvre, Sylvain and Sainz, Miguel and Eisemann, Elmar}, TITLE = {Beyond Triangles : GigaVoxels Effects In Video Games}, BOOKTITLE = {SIGGRAPH 2009: Talks}, TYPE = {Technical Sketch}, PADDRESS = {New York, NY}, ADDRESS = {New Orleans, Louisana}, PUBLISHER = {ACM}, MONTH = {August}, ISBN = {978-1-60558-726-4}, YEAR = {2009}, PAGES = {1--1}, ABSTRACT = {Voxel representations are commonly used for scientific data visualization, but also for many special effects involving complex or fuzzy data (e.g., clouds, smoke, foam). Since voxel rendering permits better and easier filtering than triangle-based representations it is also an efficient high-quality choice for complex meshes (with several triangles per pixel) and detailed geometric data (e.g., boats in Pirates of the Caribbean). We have shown in [Crassin et al. 2009] that highly detailed voxel data can be rendered in high quality at real-time rates. The work foreshadows the use of very large volumetric data sets in the context of video-games. Our system, based on ray-casting of a generalized sparse octree structure on GPU, achieves high rendering performance for billions of voxels. To further underline the usefulness in the context of video games, this sketch introduces new features of our system, namely free object instantiation and the mixing with existing triangle scenes. We also demonstrate how to render complex visual effects like depth-of-fields or approximated soft shadows in very efficient ways, exploiting intrinsic properties of our multi-resolution scheme.}, } @INPROCEEDINGS{Eisemann2009IVCR, AUTHOR = {Crassin, Cyril and Neyret, Fabrice and Eisemann, Elmar}, TITLE = {Building with Bricks: CUDA-based GigaVoxel Rendering}, BOOKTITLE = {Visual Computing Research Conference}, PADDRESS = {Saarbr{\"u}cken, Germany}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Intel Visual Computing Institute}, YEAR = {2009}, ABSTRACT = {For a long time, triangles have been considered the state-of-sthe-art primitive for fast interactive applications. Only recently, with the dawn of programmability of graphics cards, different representations emerged. Especially for complex entities, triangles have difficulties in representing convincing details and faithful approximations quickly become costly. In this work we investigate Voxels. Voxels can represent very rich and detailed objects and are of crucial importance in medical contexts. Nonetheless, one major downside is their significant memory consumption. Here, we propose an out-of-core method to deal with large volumes in real-time. Only little CPU interaction is needed which shifts the workload towards the GPU. This makes the use of large voxel data sets even easier than the, usually complicated, triangle-based LOD mechanisms that often rely on the CPU. This simplicity might even foreshadow the use of volume data, in game contexts. The latter we underline by presenting very efficient algorithms to approximate standard effects, such as soft shadows, or depth of field.}, } @ARTICLE{Eisemann2009Visibility, AUTHOR = {Eisemann, Elmar and Paris, Sylvain and Durand, Fredo}, EDITOR = {Funkhouser, Thomas and Hoppe, Hugues}, JOURNAL = {ACM Transactions on Graphics (Proc. of SIGGRAPH 2009)}, TITLE = {A Visibility Algorithm for Converting 3D Meshes into Editable 2D Vector Graphics}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2009}, ADDRESS = {New York, NY}, NUMBER = {3}, PUBLISHER = {ACM}, SERIES = {ACM Transactions on Graphics}, VOLUME = {28}, ISBN = {978-1-60558-726-4}, DOI = {10.1145/1576246.1531389}, YEAR = {2009}, PAGES = {83,1--83,8}, ABSTRACT = {Artists often need to import and embellish 3D models coming from CAD-CAM into 2D vector graphics software to produce, e.g., brochures or manuals. Current automatic solutions tend to result, at best, in a 2D triangle soup and artists often have to trace over 3D renderings. We describe a method to convert 3D models into 2D layered vector illustrations that respect visibility and facilitate further editing. Our core contribution is a visibility method that can partition a mesh into large components that can be layered according to visibility. Because self-occluding objects and objects forming occlusion cycles cannot be represented by layers without being cut, we introduce a new cut algorithm that uses a graph representation of the mesh and curvature-aware geodesic distances.}, } @INPROCEEDINGS{Elek2012a, AUTHOR = {Elek, Oskar and Ritschel, Tobias and Wilkie, Alexander and Seidel, Hans-Peter}, EDITOR = {Brooks, Stephen and Hawkey, Kirstie}, TITLE = {Interactive cloud rendering using temporally-coherent photon mapping}, BOOKTITLE = {Proceedings of Graphics Interface 2012}, ORGANIZATION = {Canadian Information Processing Society}, PADDRESS = {Toronto, Ontario, Canada}, ADDRESS = {Toronto, Canada}, PUBLISHER = {Canadian Information Processing Society}, MONTH = {May}, SERIES = {Graphics Interface 2012}, YEAR = {2012}, PAGES = {141--148}, ABSTRACT = {This paper presents an interactive algorithm for simulation of light transport in clouds. Exploiting the high temporal coherence of the typical illumination and morphology of clouds we build on volumetric photon mapping, which we modify to allow for interactive rendering speeds --- instead of building a fresh irregular photon map for every scene state change we accumulate photon contributions in a regular grid structure. This is then continuously being refreshed by re-shooting only a fraction of the total amount of photons in each frame. To maintain its temporal coherence and low variance, a low-resolution grid is used, and is then upsampled to the density field resolution in each frame. We also present a technique to store and reconstruct the angular illumination information by exploiting properties of the standard Henyey-Greenstein phase function, namely its ability to express anisotropic angular distributions with a single dominating direction. The presented method is physically-plausible, conceptually simple and comparatively easy to implement. Moreover, it operates only on the cloud density field, thus not requiring any precomputation, and handles all light sources typical for the given environment, i.e. where one of the light sources dominates.}, } @ARTICLE{Elek2012b, AUTHOR = {Elek, Oskar and Ritschel, Tobias and Wilkie, Alexander and Seidel, Hans-Peter}, JOURNAL = {Computers \& Graphics}, TITLE = {Interactive cloud rendering using temporally-coherent photon mapping}, ADDRESS = {Amsterdam}, NUMBER = {8}, PUBLISHER = {Elsevier}, MONTH = {October}, VOLUME = {36}, DOI = {10.1016/j.cag.2012.10.002}, YEAR = {2012}, PAGES = {1109--1118}, ABSTRACT = {This work presents a novel interactive algorithm for simulation of light transport in clouds. Exploiting the high temporal coherence of the typical illumination and morphology of clouds we build on volumetric photon mapping, which we modify to allow for interactive rendering speeds -- instead of building a fresh irregular photon map for every scene state change we accumulate photon contributions in a regular grid structure. This is then continuously being refreshed by re-shooting only a fraction of the total amount of photons in each frame. To maintain its temporal coherence and low variance, a low-resolution grid is initially used, and is then upsampled to the density field resolution on a physical basis in each frame. We also present a technique to store and reconstruct the angular illumination information by exploiting properties of the standard Henyey-Greenstein function, namely its ability to express anisotropic angular distributions with a single dominating direction. The presented method is physically-plausible, conceptually simple and comparatively easy to implement. Moreover, it operates only above the cloud density field, thus not requiring any precomputation, and handles all light sources typical for the given environment, i.e. where one of the light sources dominates. }, } @ARTICLE{Elek2013a, AUTHOR = {Elek, Oskar and Ritschel, Tobias and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics and Applications, IEEE}, TITLE = {Real-Time Screen-Space Scattering in Homogeneous Environments}, ADDRESS = {445 Hoes Lane, Piscataway, NJ 08854-4141 USA}, NUMBER = {3}, PUBLISHER = {IEEE}, MONTH = {June}, VOLUME = {33}, ISBN = {0272-1716}, YEAR = {2013}, PAGES = {1--10}, ABSTRACT = {This work presents an approximate algorithm for computing light scattering within homogeneous participating environments in screen space. Instead of simulating the full global illumination in participating media we model the scattering process by a physically-based point spread function. To do this efficiently we apply the point spread function by performing a discrete hierarchical convolution in a texture MIP map. We solve the main problem of this approach, illumination leaking, by designing a custom anisotropic incremental filter. Our solution is fully parallel, runs in hundreds of frames-per-second for usual screen resolutions and is directly applicable in most existing 2D or 3D rendering architectures.}, } @INPROCEEDINGS{Elhayek2010, AUTHOR = {Elhayek, Ahmed and Welk, Martin and Weickert, Joachim}, EDITOR = {Mester, Rudolf and Felsberg, Michael}, TITLE = {Simultaneous Interpolation and Deconvolution Model for the {3-D} Reconstruction of Cell Images}, BOOKTITLE = {Pattern Recognition: 33rd DAGM Symposium}, ORGANIZATION = {the Visual Sensorics \& Information Processing Lab of Goethe University of Frankfurt}, PADDRESS = {Berlin}, ADDRESS = {Frankfurt, Germany}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {6835}, ISBN = {978-3-642-23122-3}, DOI = {10.1007/978-3-642-23123-0_32}, YEAR = {2011}, PAGES = {316--325}, } @INPROCEEDINGS{Elhayek2012, AUTHOR = {Elhayek, Ahmed and Stoll, Carsten and Kim, Kwang-In and Seidel, Hans-Peter and Theobalt, Christian}, EDITOR = {Pinz, Axel and Pock, Thomas and Bischof, Horst and Leberl, Franz}, TITLE = {Feature-Based Multi-Video Synchronization with Subframe Accuracy}, BOOKTITLE = {Pattern Recognition}, PADDRESS = {Berlin}, ADDRESS = {Graz, Austria}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {7476}, ISBN = {978-3-642-32717-9}, DOI = {10.1007/978-3-642-32717-9_27}, YEAR = {2012}, PAGES = {266--275}, } @INPROCEEDINGS{ElHayek2012a, AUTHOR = {Elhayek, Ahmed and Stoll, Carsten and Hasler, Nils and Kim, Kwang-In and Seidel, Hans-Peter and Theobalt, Christian}, TITLE = {Spatio-temporal Motion Tracking with Unsynchronized Cameras}, BOOKTITLE = {IEEE Computer Vision and Pattern Recognition (CVPR)}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Rhode Island, USA}, PUBLISHER = {IEEE}, MONTH = {June}, YEAR = {2012}, PAGES = {1870--1877}, ABSTRACT = {We present a new spatio-temporal method for markerless motion capture. We reconstruct the pose and motion of a character from a multi-view video sequence without requiring the cameras to be synchronized and without aligning captured frames in time. By formulating the model-to-image similarity measure as a temporally continuous functional, we are also able to reconstruct motion in much higher temporal detail than was possible with previous synchronized approaches. By purposefully running cameras unsynchronized we can capture even very fast motion at speeds that off-the-shelf but high quality cameras provide.}, } @INPROCEEDINGS{ELMillerBlanz2006, AUTHOR = {Learned-Miller, Erik G. and Lu, Qifeng and Paisley, Angela and Trainer, Peter and Blanz, Volker and Dedden, Katrin and Miller, Ralph}, EDITOR = {Larsen, Rasmus and Nielsen, Mads and Sporring, Jon}, TITLE = {Detecting Acromegaly: Screening for Disease with a Morphable Model}, BOOKTITLE = {Medical Image Computing and Computer-Assisted Intervention - MICCAI 2006 : 9th International Conference}, PADDRESS = {Berlin, Germany}, ADDRESS = {Copenhagen, Denmark}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4191}, ISBN = {978-3-540-44727-6}, DOI = {10.1007/11866763_61}, YEAR = {2006}, PAGES = {495--503}, } @INPROCEEDINGS{enders2005, AUTHOR = {Enders, Frank and Sauber, Natascha and Merhof, Dorit and Hastreiter, Peter and Nimsky, Christopher and Stamminger, Marc}, EDITOR = {Silva, Cl{\'a}udio T. and Gr{\"o}ller, Eduard and Rushmeier, Holly}, TITLE = {Visualization of White Matter Tracts with Wrapped Streamlines}, BOOKTITLE = {IEEE Visualization 2005 (VIS 2005)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Minneapolis, USA}, PUBLISHER = {IEEE}, MONTH = {October}, ISBN = {0-7803-9462-3}, YEAR = {2005}, PAGES = {51--58}, ABSTRACT = {Diffusion tensor imaging is a magnetic resonance imaging method which has gained increasing importance in neuroscience and especially in neurosurgery. It acquires diffusion properties represented by a symmetric 2nd order tensor for each voxel in the gathered dataset. From the medical point of view, the data is of special interest due to different diffusion characteristics of varying brain tissue allowing conclusions about the underlying structures such as white matter tracts. An obvious way to visualize this data is to focus on the anisotropic areas using the major eigenvector for tractography and rendering lines for visualization of the simulation results. Our approach extends this technique to avoid line representation since lines lead to very complex illustrations and furthermore are mistakable. Instead, we generate surfaces wrapping bundles of lines. Thereby, a more intuitive representation of different tracts is achieved.}, } @ARTICLE{Ershov2004, AUTHOR = {Ershov, Sergey and Durikovic, Roman and Kolchin, Konstantin and Myszkowski, Karol}, JOURNAL = {The Visual Computer}, TITLE = {Reverse engineering approach to appearance-based design of metallic and pearlescent paints}, ADDRESS = {Berlin, Germany}, NUMBER = {8-9}, PUBLISHER = {Springer}, MONTH = {October}, VOLUME = {20}, ISBN = {0178-2789}, YEAR = {2004}, PAGES = {587--600}, ABSTRACT = {We propose a new approach to interactive design of metallic and pearlescent coatings, such as automotive paints and plastic finishes of electronic appliances. This approach includes solving the inverse problem, that is, finding pigment composition of a paint from its bidirectional reflectance distribution function (BRDF) based on a simple paint model. The inverse problem is solved by two consecutive optimizations calculated in realtime on a contemporary PC. Such reverse engineering can serve as a starting point for subsequent design of new paints in terms of appearance attributes that are directly connected to the physical parameters of our model. This allows the user to have a paint composition in parallel with the appearance being designed.}, } @INPROCEEDINGS{EwertM08_CMMR, AUTHOR = {Ewert, Sebastian and M{\"u}ller, Meinard}, TITLE = {Refinement Strategies for Music Synchronization}, BOOKTITLE = {Proceedings of the 5th International Symposium on Computer Music Modeling and Retrieval (CMMR 2008)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Copenhagen, Denmark}, PUBLISHER = {Springer}, MONTH = {May}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5493}, ISBN = {978-87-7606-027-5}, YEAR = {2008}, PAGES = {147--165}, } @INPROCEEDINGS{EwertM11_NoteIntensities_ICASSP, AUTHOR = {Ewert, Sebastian and M{\"u}ller, Meinard}, TITLE = {Estimating Note Intensities in Music Recordings}, BOOKTITLE = {2011 IEEE International Conference on Acoustics, Speech, and Signal Processing}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Prague, Czech}, PUBLISHER = {IEEE}, ISBN = {978-1-4577-0539-7}, DOI = {10.1109/ICASSP.2011.5946421}, YEAR = {2011}, PAGES = {385--388}, } @INPROCEEDINGS{EwertM12_ScoreInformedSourceSeparation_DagstuhlFU, AUTHOR = {Ewert, Sebastian and M{\"u}ller, Meinard}, EDITOR = {M{\"u}ller, Meinard and Goto, Masataka and Schedl, Markus}, TITLE = {Score-Informed Source Separation for Music Signals}, BOOKTITLE = {Multimodal Music Processing}, PADDRESS = {Dagstuhl, Germany}, ADDRESS = {Dagstuhl, Germany}, PUBLISHER = {Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik}, SERIES = {Dagstuhl Follow-Ups}, VOLUME = {3}, YEAR = {2012}, PAGES = {73--94}, } @INPROCEEDINGS{EwertMD09_ReliableAlignments_AMR, AUTHOR = {Ewert, Sebastian and M{\"u}ller, Meinard and Dannenberg, Roger B.}, EDITOR = {Detyniecki, Marcin and Garcia-Serrano, Ana and N{\"u}rnberger, Andreas}, TITLE = {Towards Reliable Partial Music Alignments Using Multiple Synchronization Strategies}, BOOKTITLE = {Adaptive Multimedia Retrieval : Understanding Media and Adapting to the User ; 7th International Workshop, AMR 2009}, PADDRESS = {Berlin}, ADDRESS = {Madrid, Spain}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {6535}, ISBN = {978-3-642-18448-2}, DOI = {10.1007/978-3-642-18449-9_4}, YEAR = {2011}, PAGES = {35--48}, } @INPROCEEDINGS{EwertMG09_HighResAudioSync_ICASSP, AUTHOR = {Ewert, Sebastian and M{\"u}ller, Meinard and Grosche, Peter}, TITLE = {High Resolution Audio Synchronization Using Chroma Onset Features}, BOOKTITLE = {2009 IEEE International Conference on Acoustics, Speech, and Signal Processing : proceedings}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Taipei, Taiwan}, PUBLISHER = {IEEE}, ISBN = {978-1-4244-2353-8}, DOI = {10.1109/ICASSP.2009.4959972}, YEAR = {2009}, PAGES = {1869--1872}, } @ARTICLE{EwertMKMW_CrossVersionAnalysis_IEEE-ToM, AUTHOR = {Ewert, Sebastian and M{\"u}ller, Meinard and Konz, Verena and M{\"u}llensiefen, Daniel and Wiggins, Geraint}, JOURNAL = {IEEE Transactions on Multimedia}, TITLE = {Towards Cross-Version Harmonic Analysis of Music}, ADDRESS = {Piscataway, NJ}, NUMBER = {3-2}, PUBLISHER = {IEEE}, VOLUME = {14}, YEAR = {2012}, PAGES = {770--782}, } @INPROCEEDINGS{EwertMMCW_BeatlesSongs_Dagstuhl, AUTHOR = {Ewert, Sebastian and M{\"u}ller, Meinard and M{\"u}llensiefen, Daniel and Clausen, Michael and Wiggins, Geraint A.}, EDITOR = {Selfridge-Field, Eleanor and Wiering, Frans and Wiggins, Geraint A.}, TITLE = {Case Study ``Beatles Songs'' -- What can be Learned from Unreliable Music Alignments?}, BOOKTITLE = {Knowledge representation for intelligent music processing}, PADDRESS = {Dagstuhl, Germany}, ADDRESS = {Dagstuhl, Germany}, NUMBER = {09051}, PUBLISHER = {LZI}, MONTH = {January}, SERIES = {Dagstuhl Seminar Proceedings}, ISBN = {1862-4405}, DOI = {10.4230/LIPIcs.STACS.2009.1858}, YEAR = {2009}, PAGES = {1--16}, } @INPROCEEDINGS{EwertMueller11_VoiceSeparation_ISMIR, AUTHOR = {Ewert, Sebastian and M{\"u}ller, Meinard}, TITLE = {Score-informed voice separation for piano recordings}, BOOKTITLE = {12th International Society for Music Information Retrieval Conference (ISMIR 2011)}, PADDRESS = {s.l.}, ADDRESS = {Miami, USA}, PUBLISHER = {ISMIR}, YEAR = {2011}, PAGES = {245--250}, } @INPROCEEDINGS{EwertMueller12_ScoreInformedNMF_ICASSP, AUTHOR = {Ewert, Sebastian and M{\"u}ller, Meinard}, TITLE = {Using Score-Informed Constraints for {NMF}-based Source Separation}, BOOKTITLE = {Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Kyoto, Japan}, PUBLISHER = {IEEE}, DOI = {10.1109/ICASSP.2012.6287834}, YEAR = {2012}, PAGES = {129--132}, } @INPROCEEDINGS{Feit2013PianoText, AUTHOR = {Feit, Anna and Oulasvirta, Antti}, TITLE = {PianoText: Transferring Musical Expertise to Text Entry}, BOOKTITLE = {CHI '13 Extended Abstracts on Human Factors in Computing Systems}, ORGANIZATION = {Association for Computing Machinery (ACM)}, TYPE = {Extended Abstract}, ADDRESS = {New York, USA}, PUBLISHER = {ACM}, MONTH = {April}, ISBN = {978-1-4503-1952-2}, DOI = {10.1145/2468356.2479606}, YEAR = {2013}, PAGES = {3043--3046}, ABSTRACT = {We present PianoText, a text entry method based on a piano keyboard with an optimized mapping between notes and chords of music to letters of the English language. PianoText exempli es the idea of transferring musical expertise to a text entry task by computationally searching for mappings between frequent motor patterns while considering their n-gram frequency distributions and respecting constraints a ecting the playability of music. In the Interactivity session, audience members with piano skills can transcribe text with PianoText, and a trained pianist will show that it allows him to generate text at speeds close to that of professional QWERTY-typists}, } @INPROCEEDINGS{Feixas_eg2002short, AUTHOR = {Feixas, Miquel and Rigau, Jaume and Bekaert, Philippe and Sbert, Mateu}, EDITOR = {Navazo, Isabel and Slusallek, Philipp}, TITLE = {Information-Theoretic Oracle Based on Kernel Smoothness for Hierarchical Radiosity}, BOOKTITLE = {Eurographics 2002 Short Presentations}, PADDRESS = {-}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Eurographics}, YEAR = {2002}, PAGES = {325--333}, } @ARTICLE{Fellner:2000:BeitraegeCG, AUTHOR = {Fellner, Dieter W. and Haber, J{\"o}rg and Havemann, Sven and Kobbelt, Leif and Lensch, Hendrik P. A. and M{\"u}ller, Gordon and Peter, Ingmar and Schneider, Robert and Seidel, Hans-Peter and Stra{\ss}er, Wolfgang}, JOURNAL = {Informationstechnik und Technische Informatik}, TITLE = {{Beitr{\"a}ge der Computergraphik zur Realisierung eines verallgemeinerten Dokumentbegriffs}}, ADDRESS = {Munich, Germany}, NUMBER = {6}, PUBLISHER = {Oldenbourg}, MONTH = {December}, VOLUME = {42}, YEAR = {2000}, PAGES = {8--18}, } @INPROCEEDINGS{FremereyMC10_RepeatsJumps_ISMIR, AUTHOR = {Fremerey, Christian and M{\"u}ller, Meinard and Clausen, Michael}, EDITOR = {Downie, J. Stephen and Veltkamp, Remco C.}, TITLE = {Handling Repeats and Jumps in Score-Performance Synchronization}, BOOKTITLE = {Proceedings of the 11th International Society for Music Information Retrieval Conference (ISMIR 2010)}, PADDRESS = {s.l.}, ADDRESS = {Utrecht, Netherlands}, PUBLISHER = {ISMIR}, ISBN = {978-90-393-53813}, YEAR = {2010}, PAGES = {243--248}, } @INPROCEEDINGS{FremereyMC_SheetMusicAndAudio_Dagstuhl, AUTHOR = {Fremerey, Christian and M{\"u}ller, Meinard and Clausen, Michael}, EDITOR = {Selfridge-Field, Eleanor and Wiering, Frans and Wiggins, Geraint A.}, TITLE = {Towards Bridging the Gap between Sheet Music and Audio}, BOOKTITLE = {Knowledge representation for intelligent music processing}, PADDRESS = {Dagstuhl, Germany}, ADDRESS = {Dagstuhl, Germany}, NUMBER = {09051}, PUBLISHER = {LZI}, SERIES = {Dagstuhl Seminar Proceedings}, ISBN = {1862-4405}, DOI = {10.4230/LIPIcs.STACS.2009.1858}, YEAR = {2009}, PAGES = {1--11}, } @INPROCEEDINGS{FremereyMKE08_ISMIR, AUTHOR = {Fremerey, Christian and M{\"u}ller, Meinard and Kurth, Frank and Clausen, Michael}, EDITOR = {Bello, Juan Pablo and Chew, Elaine and Turnbull, Douglas}, TITLE = {Automatic Mapping of Scanned Sheet Music to Audio Recordings}, BOOKTITLE = {Proceedings of the 9th International Conference on Music Information Retrieval (ISMIR 2008)}, ORGANIZATION = {Sun, Gracenote, MusicIP}, PADDRESS = {Philadelphia, USA}, ADDRESS = {Philadelphia, USA}, PUBLISHER = {ISMIR}, MONTH = {September}, ISBN = {978-0-615-24849-3}, YEAR = {2008}, PAGES = {413--418}, } @INPROCEEDINGS{friedrich:06:RTG, AUTHOR = {Friedrich, Heiko and G{\"u}nther, Johannes and Dietrich, Andreas and Scherbaum, Michael and Seidel, Hans-Peter and Slusallek, Philipp}, TITLE = {Exploring the Use of Ray Tracing for Future Games}, BOOKTITLE = {ACM SIGGRAPH Video Game Symposium sandbox '06: Proceedings of the 2006 ACM SIGGRAPH symposium on Videogames}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, NY, USA}, ADDRESS = {Boston, MA, USA}, PUBLISHER = {ACM}, MONTH = {July}, ISBN = {1-59593-386-7}, DOI = {10.1145/1183316.1183323}, YEAR = {2006}, PAGES = {41--50}, ABSTRACT = {Rasterization hardware and computer games have always been tightly connected: The hardware implementation of rasterization has made complex interactive 3D games possible while requirements for future games drive the development of increasingly parallel GPUs and CPUs. Interestingly, this development -- together with important algorithmic improvements -- also enabled \emph{ray tracing\/} to achieve realtime performance recently. In this paper we explore the opportunities offered by ray tracing based game technology in the context of current and expected future performance levels. In particular, we are interested in simulation-based graphics that avoids pre-computations and thus enables the interactive production of advanced visual effects and increased realism necessary for future games. In this context we analyze the advantages of ray tracing and demonstrate first results from several ray tracing based game projects. We also discuss ray tracing API issues and present recent developments that support interactions and dynamic scene content. We end with an outlook on the different options for hardware acceleration of ray tracing.}, } @ARTICLE{Fuchs-2007-DED, AUTHOR = {Fuchs, Christian and Chen, Tongbo and Goesele, Michael and Theisel, Holger and Seidel, Hans-Peter}, JOURNAL = {Computers and Graphics}, TITLE = {Density Estimation for Dynamic Volumes}, ADDRESS = {Radarweg 29, Amsterdam 1043 NX}, NUMBER = {2}, PUBLISHER = {Elsevier}, MONTH = {April}, VOLUME = {31}, ISBN = {0097-8493}, DOI = {10.1016/j.cag.2006.11.014}, YEAR = {2007}, PAGES = {205--211}, ABSTRACT = {We propose a new approach to capture the volumetric density of dynamic scattering media instantaneously with a single image. The volume is probed with a set of laser lines and the scattered intensity is recorded by a conventional camera. We then determine the density along the laser lines taking the scattering properties of the media into account. A specialized approximation technique reconstructs the full density field in the volume. We apply the technique to capture the volumetric density of participating media such as smoke.}, } @ARTICLE{Fuchs2005a, AUTHOR = {Fuchs, Martin and Blanz, Volker and Lensch, Hendrik P. A. and Seidel, Hans-Peter}, JOURNAL = {IEEE Transactions on Visualization and Computer Graphics}, TITLE = {Reflectance from Images: A Model-Based Approach for Human Faces}, ADDRESS = {Los Alamitos, USA}, NUMBER = {3}, PUBLISHER = {IEEE}, MONTH = {May}, VOLUME = {11}, ISBN = {1077-2626}, YEAR = {2005}, PAGES = {296--305}, ABSTRACT = { In this paper, we present an image-based framework that acquires the reflectance properties of a human face. A range scan of the face is not required. Based on a morphable face model, the system estimates the 3D shape, and establishes point-to-point correspondence across images taken from different viewpoints, and across different individuals' faces. % This provides a common parameterization of all reconstructed surfaces that can be used to compare and transfer BRDF data between different faces. Shape estimation from images compensates deformations of the face during the measurement process, such as facial expressions. In the common parameterization, regions of homogeneous materials on the face surface can be defined a-priori. We apply analytical BRDF models to express the reflectance properties of each region, and we estimate their parameters in a least-squares fit from the image data. For each of the surface points, the diffuse component of the BRDF is locally refined, which provides high detail. % We present results for multiple analytical BRDF models, rendered at novel orientations and lighting conditions.}, } @INPROCEEDINGS{Fuchs2005b, AUTHOR = {Fuchs, Martin and Blanz, Volker and Seidel, Hans-Peter}, EDITOR = {Deussen, Oliver and Keller, Alexander and Bala, Kavita and Dutr{\'e}, Philip and Fellner, Dieter W. and Spencer, Stephen N.}, TITLE = {Bayesian Relighting}, BOOKTITLE = {Rendering Techniques 2005: Eurographics Symposium on Rendering}, ORGANIZATION = {Co-sponsored by ACM SIGGRAPH and EUROGRAPHICS Association}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Konstanz, Germany}, PUBLISHER = {Eurographics}, MONTH = {July}, SERIES = {Rendering Techniques}, ISBN = {3-905673-23-1}, YEAR = {2005}, PAGES = {157--164}, ABSTRACT = { We present a simple method for relighting real objects viewed from a fixed camera position. Instead of setting up a calibrated measurement device, such as a light stage, we manually sweep a spotlight over the walls of a white room, illuminating the object indirectly. In contrast to previous methods, we use arbitrary and unknown angular distributions of incoming light. Neither the incident light nor the reflectance function need to be represented explicitly in our approach.\\ % The new method relies on images of a probe object, for instance a black snooker ball, placed near the target object. Pictures of the probe in a novel illumination are decomposed into a linear combination of measured images of the probe. Then, a linear combination of images of the target object with the same coefficients produces a synthetic image with the new illumination. We use a simple Bayesian approach to find the most plausible output image, given the picture of the probe and the statistics observed in the dataset of samples.\\ % Our results for a variety of novel illuminations, including synthetic lighting by relatively narrow light sources as well as natural illuminations, demonstrate that the new technique is a useful, low cost alternative to existing techniques for a broad range of objects and materials.}, } @ARTICLE{Fuchs2007a, AUTHOR = {Fuchs, Martin and Blanz, Volker and Lensch, Hendrik P. A. and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics (TOG)}, TITLE = {Adaptive sampling of reflectance fields}, ADDRESS = {New York, USA}, NUMBER = {2}, PUBLISHER = {ACM}, MONTH = {June}, VOLUME = {26}, ISBN = {0730-0301}, DOI = {10.1145/1243980.1243984}, YEAR = {2007}, PAGES = {1--18}, ABSTRACT = {Image-based relighting achieves high quality in rendering, but it requires a large number of measurements of the reflectance field. This article discusses sampling techniques that improve on the trade-offs between measurement effort and reconstruction quality. Specifically, we (i) demonstrate that sampling with point lights and from a sparse set of incoming light directions creates artifacts which can be reduced significantly by employing extended light sources for sampling, (ii) propose a sampling algorithm which incrementally chooses light directions adapted to the properties of the reflectance field being measured, thus capturing significant features faster than fixed-pattern sampling, and (iii) combine reflectance fields from two different light domain resolutions. We present an automated measurement setup for well-defined angular distributions of the incident, indirect illumination. It is based on programmable spotlights with controlled aperture that illuminate the walls around the scene.}, } @INPROCEEDINGS{Fuchs2007b, AUTHOR = {Fuchs, Martin and Lensch, Hendrik P. A. and Blanz, Volker and Seidel, Hans-Peter}, EDITOR = {Cohen-Or, Daniel and Slav{\'i}k, Pavel}, TITLE = {Superresolution Reflectance Fields: Synthesizing images for intermediate light directions}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, ORGANIZATION = {The European Association for Computer Graphics}, PADDRESS = {Oxford, UK}, ADDRESS = {Prague, Czech Republic}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, VOLUME = {26(3)}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2007.01067.x}, YEAR = {2007}, PAGES = {447--456}, ABSTRACT = {Captured reflectance fields tend to provide a relatively coarse sampling of the incident light directions. As a result, sharp illumination features, such as highlights or shadow boundaries, are poorly reconstructed during relighting; highlights are disconnected, and shadows show banding artefacts. In this paper, we propose a novel interpolation technique for 4D reflectance fields that reconstructs plausible images even for non-observed light directions. Given a sparsely sampled reflectance field, we can effectively synthesize images as they would have been obtained from denser sampling. The processing pipeline consists of three steps: (1) segmentation of regions where intermediate lighting cannot be obtained by blending, (2) appropriate flow algorithms for highlights and shadows, plus (3) a final reconstruction technique that uses image-based priors to faithfully correct errors that might be introduced by the segmentation or flow step. The algorithm reliably reproduces scenes that contain specular highlights, interreflections, shadows or caustics.}, } @INPROCEEDINGS{Fuchs2008, AUTHOR = {Fuchs, Martin and Chen, Tongbo and Wang, Oliver and Raskar, Ramesh and Seidel, Hans-Peter and Lensch, Hendrik P. A.}, EDITOR = {Magnor, Marcus and Rosenhahn, Bodo and Theisel, Holger}, TITLE = {A Shaped Temporal Filter Camera}, BOOKTITLE = {Proceedings of the Vision, Modeling, and Visualization Workshop 2009 (VMV 2009)}, PADDRESS = {Magdeburg, Germany}, ADDRESS = {Braunschweig, Germany}, PUBLISHER = {Otto-Von-Guericke-Universit{\"a}t}, ISBN = {978-3-9804874-8-1}, YEAR = {2009}, PAGES = {177--186}, ABSTRACT = {Digital movie cameras only perform a discrete sampling of real-world imagery. While spatial sampling effects are well studied in the literature, there has not been as much work in regards to temporal sampling. As cameras get faster and faster, the need for conventional frame-rate video that matches the abilities of human perception remains. In this article, we introduce a system with controlled temporal sampling behavior. It transforms a high fps input stream into a conventional speed output video in real-time. % We investigate the effect of different temporal sampling kernels and demonstrate that extended, overlapping kernels can mitigate aliasing artifacts. Furthermore, NPR effects, such as enhanced motion blur, can be achieved. By applying Fourier transforms in the temporal domain, we can also obtain novel tools for analyzing and visualizing time dependent effects. % We demonstrate the effect of different sampling kernels in creating enhanced movies and stills of fast motion. }, } @ARTICLE{Fuchs2009, AUTHOR = {Fuchs, Martin and Chen, Tongbo and Wang, Oliver and Raskar, Ramesh and Seidel, Hans-Peter and Lensch, Hendrik P. A.}, JOURNAL = {Computers \& Graphics}, TITLE = {Real-time temporal shaping of high-speed video streams}, ADDRESS = {Amsterdam}, NUMBER = {5}, PUBLISHER = {Elsevier}, MONTH = {June}, VOLUME = {34}, ISBN = {0097-8493}, DOI = {10.1016/j.cag.2010.05.017}, YEAR = {2010}, PAGES = {575--584}, NOTE = {CAD/GRAPHICS 2009; Extended papers from the 2009 Sketch-Based Interfaces and Modeling Conference; Vision, Modeling \& Visualization }, ABSTRACT = {Digital movie cameras only perform a discrete sampling of real-world imagery. While spatial sampling effects are well studied in the literature, there has not been as much work in regards to temporal sampling. As cameras get faster and faster, the need for conventional frame-rate video that matches the abilities of human perception remains. In this article, we introduce a system with controlled temporal sampling behavior. It transforms a high fps input stream into a conventional speed output video in real-time. We investigate the effect of different temporal sampling kernels and demonstrate that extended, overlapping kernels can mitigate aliasing artifacts. Furthermore, NPR effects, such as enhanced motion blur, can be achieved. By applying Fourier transforms in the temporal domain, we can also obtain novel tools for analyzing and visualizing time dependent effects. We study the properties of both contemporary and idealized display devices and demonstrate the effect of different sampling kernels in creating enhanced movies and stills of fast motion.}, } @PHDTHESIS{Fuchs2009:Thesis, AUTHOR = {Fuchs, Christian}, TITLE = {Capturing and Reconstructing the Appearance of Complex 3D Scenes}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {March}, YEAR = {2009}, ABSTRACT = {In this thesis, we present our research on new acquisition methods for reflectance properties of real-world objects. Specifically, we first show a method for acquiring spatially varying densities in volumes of translucent, gaseous material with just a single image. This makes the method applicable to constantly changing phenomena like smoke without the use of high-speed camera equipment. Furthermore, we investigated how two well known techniques -- synthetic aperture confocal imaging and algorithmic descattering -- can be combined to help looking through a translucent medium like fog or murky water. We show that the depth at which we can still see an object embedded in the scattering medium is increased. In a related publication, we show how polarization and descattering based on phase-shifting can be combined for efficient 3D~scanning of translucent objects. Normally, subsurface scattering hinders the range estimation by offsetting the peak intensity beneath the surface away from the point of incidence. With our method, the subsurface scattering is reduced to a minimum and therefore reliable 3D~scanning is made possible. Finally, we present a system which recovers surface geometry, reflectance properties of opaque objects, and prevailing lighting conditions at the time of image capture from just a small number of input photographs. While there exist previous approaches to recover reflectance properties, our system is the first to work on images taken under almost arbitrary, changing lighting conditions. This enables us to use images we took from a community photo collection website.}, } @MASTERSTHESIS{FuchsThesis2004, AUTHOR = {Fuchs, Christian}, TITLE = {Acquisition of Subsurface Scattering Objects}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {September}, YEAR = {2004}, } @MASTERSTHESIS{FuchsThesis2004, AUTHOR = {Fuchs, Martin}, TITLE = {Reflectance of Human Faces: Image-Based Measurement and Modeling}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {February}, YEAR = {2004}, ABSTRACT = {An image-based acquisition pipeline for the reflective properties of a human face is presented, proposing an approach which extracts geometry and a spatially varying BRDF of a human face from few measurements in calibrated point light conditions. Applying the morphable face model introduced by Blanz-Vetter for the estimation of geometry in each of the input images, we gain an image-based geometry estimation which does not require range scans of the individual face, and obtain a parameterization of the face surface, which is consistent for all human faces. By means of non-linear optimization, we recover spatially varying parameters for an analytic BRDF model; the resulting BRDF function, together with the estimated geometry, creates a relightable representation of the face. The set of images used for the reflectance measurement is identical to the set of images used for the geometry estimation. Several BRDF models (Cook-Torrance, Lafortune, Ward, and a custom phe\-nom\-e\-no\-logical model) are compared in an experiment.}, } @INPROCEEDINGS{Fuchs:2005:EMH, AUTHOR = {Fuchs, Christian and Goesele, Michael and Chen, Tongbo and Seidel, Hans-Peter}, EDITOR = {Buhler, Juan}, TITLE = {An Empirical Model for Heterogeneous Translucent Objects}, BOOKTITLE = {SIGGRAPH 2005 Sketches}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, USA}, PUBLISHER = {ACM SIGGRAPH}, YEAR = {2005}, PAGES = {1--1}, } @INPROCEEDINGS{Fuchs:2006:VDS, AUTHOR = {Fuchs, Christian and Chen, Tongbo and Goesele, Michael and Theisel, Holger and Seidel, Hans-Peter}, EDITOR = {M{\"o}ller, Torsten and Machiraju, Raghu and Chen, Min-Syan and Ertl, Thomas}, TITLE = {Volumetric Density Capture From a Single Image}, BOOKTITLE = {Volume Graphics 2006 : Eurographics / IEEE VGTC Workshop Proceedings ; Fifth International Workshop on Volume Graphic}, ORGANIZATION = {Eurographics / IEEE Computer Society VGTC}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Boston, USA}, PUBLISHER = {Eurographics}, ISBN = {3-905673-41-X}, YEAR = {2006}, PAGES = {17--22}, } @ARTICLE{Fuchs:2008:CCD, AUTHOR = {Fuchs, Christian and Heinz, Michael and Levoy, Marc and Seidel, Hans-Peter and Lensch, Hendrik P. A.}, JOURNAL = {Computer Graphics Forum (Proc. Eurographics Symposium on Rendering)}, TITLE = {Combining Confocal Imaging and Descattering}, ADDRESS = {Geneva, Switzerland}, NUMBER = {4}, PUBLISHER = {EG}, MONTH = {June}, VOLUME = {27}, YEAR = {2008}, PAGES = {1245--1253}, } @INPROCEEDINGS{Fuchs:Mimic, AUTHOR = {Fuchs, Thomas and Haber, J{\"o}rg and Seidel, Hans-Peter}, TITLE = {MIMIC --- {A} Language for Specifying Facial Animations}, BOOKTITLE = {WSCG '2004 : the 12th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2004 ; short communication papers proceedings}, PADDRESS = {Plzen, Czech Republic}, ADDRESS = {Plzen, Czech Republic}, NUMBER = {1/3}, PUBLISHER = {UNION Agency}, MONTH = {February}, SERIES = {Journal of WSCG}, VOLUME = {12}, ISBN = {80-903100-5-2}, YEAR = {2004}, PAGES = {71--78}, ABSTRACT = {This paper introduces a versatile language for specifying facial animations. The language MIMIC can be used together with any facial animation system that employs animation parameters varying over time to control the animation. In addition to the automatic alignment of individual actions, the user can fine-tune the temporal alignment of actions relatively to each other. A set of pre-defined functions can be used to control oscillatory behavior of actions. Temporal constraints are resolved automatically by the MIMIC compiler. We describe the grammar of MIMIC, give some hints on the implementation of the MIMIC compiler, and show some examples of animation code together with snapshots from the resulting animation.}, } @ARTICLE{Fuchs_2007_TPRFD, AUTHOR = {Fuchs, Martin and Raskar, Ramesh and Seidel, Hans-Peter and Lensch, Hendrik P. A.}, JOURNAL = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH)}, TITLE = {Towards Passive {6D} Reflectance Field Displays}, ADDRESS = {New York, NY, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {August}, VOLUME = {27}, ISBN = {0730-0301}, DOI = {10.1145/1360612.1360657}, YEAR = {2008}, PAGES = {58}, ABSTRACT = { Traditional flat screen displays present 2D images. 3D and 4D displays have been proposed making use of lenslet arrays to shape a fixed outgoing light field for horizontal or bidirectional parallax. In this article, we present different designs of multi-dimensional displays which passively react to the light of the environment behind. The prototypes physically implement a reflectance field and generate different light fields depending on the incident illumination, for example light falling through a window. We discretize the incident light field using an optical system, and modulate it with a 2D pattern, creating a flat display which is view \emph{and} illumination-dependent. It is free from electronic components. For distant light and a fixed observer position, we demonstrate a passive optical configuration which directly renders a 4D reflectance field in the real-world illumination behind it. We further propose an optical setup that allows for projecting out different angular distributions depending on the incident light direction. Combining multiple of these devices we build a display that renders a 6D experience, where the incident 2D illumination influences the outgoing light field, both in the spatial and in the angular domain. Possible applications of this technology are time-dependent displays driven by sunlight, object virtualization and programmable light benders / ray blockers without moving parts.}, } @INPROCEEDINGS{FunckGP2007, AUTHOR = {von Funck, Wolfram and Theisel, Holger and Seidel, Hans-Peter}, EDITOR = {Belyaev, A.G. and Garland, M.}, TITLE = {Elastic secondary deformations by vector field integration}, BOOKTITLE = {Proceedings of the 5th Eurographics Symposium on Geometry Processing}, PADDRESS = {New York, NY, USA}, ADDRESS = {Barcelona, Spain}, PUBLISHER = {ACM}, SERIES = {ACM International Conference Proceeding Series}, VOLUME = {257}, YEAR = {2007}, PAGES = {99--108}, } @INPROCEEDINGS{FunckPCCGA2007, AUTHOR = {von Funck, Wolfram and Theisel, Holger and Seidel, Hans-Peter}, EDITOR = {Alexa, M. and Gortler, S.J. and Ju, T.}, TITLE = {Explicit control of vector field based shape deformations}, BOOKTITLE = {Proceedings of the Pacific Conference on Computer Graphics and Applications, Pacific Graphics 2007}, PADDRESS = {Los Alamos, USA}, ADDRESS = {Maui, Hawaii}, PUBLISHER = {IEEE Computer Society}, ISBN = {978-0-7695-3009-3}, YEAR = {2007}, PAGES = {291--300}, } @INPROCEEDINGS{FunckTheiselSeidel2007, AUTHOR = {von Funck, Wolfram and Theisel, Holger and Seidel, Hans-Peter}, EDITOR = {Martin, Ralph and Sabin, Malcolm and Winkler, Joab}, TITLE = {Implicit Boundary Control of Vector Field Based Shape Deformations}, BOOKTITLE = {Mathematics of Surfaces XII : 12th IMA International Conference}, PADDRESS = {Berlin, Germany}, ADDRESS = {Sheffield, UK}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4647}, ISBN = {3-540-73842-8}, DOI = {10.1007/978-3-540-73843-5_10}, YEAR = {2007}, PAGES = {154--165}, ABSTRACT = {We present a shape deformation approach which preserves volume, prevents self-intersections and allows for exact control of the deformation impact. The volume preservation and prevention of selfintersections are achieved by utilizing the method of Vector Field Based Shape Deformations. This method produces physically plausible deformations efficiently by integrating formally constructed divergence-free vector fields, where the region of influence is described by implicitly defined shapes. We introduce an implicit representation of deformation boundaries, which allows for an exact control of the deformation: By placing the boundaries directly on the shape surface, the user can specify precisely where the shape should be deformed and where not. The simple polygonal representation of the boundaries allows for a GPU implementation, which is able to deform high-resolution meshes in real-time.}, } @ARTICLE{FunckTransVCG2008, AUTHOR = {von Funck, Wolfram and Weinkauf, Tino and Theisel, Holger and Seidel, Hans-Peter}, JOURNAL = {IEEE Transactions on Visualization and Computer Graphics (Proc. IEEE Visualization)}, TITLE = {Smoke surfaces: An interactive flow visualization technique inspired by real-world flow experiments}, ADDRESS = {Los Alamos, USA}, NUMBER = {6}, PUBLISHER = {IEEE Society}, MONTH = {November}, VOLUME = {14}, YEAR = {2008}, PAGES = {1396--1403}, } @INPROCEEDINGS{Gall2006c, AUTHOR = {Gall, J{\"u}rgen and Rosenhahn, Bodo and Seidel, Hans-Peter}, EDITOR = {Chang, Long-Wen and Lie, Wen-Nung}, TITLE = {Robust Pose Estimation with {3D} Textured Models}, BOOKTITLE = {Advances in Image and Video Technology, First Pacific Rim Symposium, PSIVT 2006}, ORGANIZATION = {IEEE}, PADDRESS = {Berlin, Germany}, ADDRESS = {Hsinchu, Taiwan}, PUBLISHER = {Springer}, MONTH = {December}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4319}, ISBN = {978-3-540-68297-4}, YEAR = {2006}, PAGES = {84--95}, ABSTRACT = {Estimating the pose of a rigid body means to determine the rigid body motion in the 3D space from 2D images. For this purpose, it is reasonable to make use of existing knowledge of the object. Our approach exploits the 3D shape and the texture of the tracked object in form of a 3D textured model to establish 3D-2D correspondences for pose estimation. While the surface of the 3D free-form model is matched to the contour extracted by segmentation, additional reliable correspondences are obtained by matching local descriptors of interest points between the textured model and the images. The fusion of these complementary features provides a robust pose estimation. Moreover, the initial pose is automatically detected and the pose is predicted for each frame. Using the predicted pose as shape prior makes the contour extraction less sensitive. The performance of our method is demonstrated by stereo tracking experiments. }, } @INPROCEEDINGS{Gall2007a, AUTHOR = {Gall, J{\"u}rgen and Rosenhahn, Bodo and Seidel, Hans-Peter}, EDITOR = {Hamprecht, Leo and Schn{\"o}rr, Christoph and J{\"a}hne, Bernd}, TITLE = {Clustered Stochastic Optimization for Object Recognition and Pose Estimation}, BOOKTITLE = {29th Annual Symposium of the German Association for Pattern Recognition (DAGM'07)}, PADDRESS = {Berlin}, ADDRESS = {Heidelberg, Germany}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4713}, YEAR = {2007}, PAGES = {32--41}, ABSTRACT = {We present an approach for estimating the 3D position and in case of articulated objects also the joint configuration from segmented 2D images. The pose estimation without initial information is a challenging optimization problem in a high dimensional space and is essential for texture acquisition and initialization of model-based tracking algorithms. Our method is able to recognize the correct object in the case of multiple objects and estimates its pose with a high accuracy. The key component is a particle-based global optimization method that converges to the global minimum similar to simulated annealing. After detecting potential bounded subsets of the search space, the particles are divided into clusters and migrate to the most attractive cluster as the time increases. The performance of our approach is verified by means of real scenes and a quantative error analysis for image distortions. Our experiments include rigid bodies and full human bodies.}, } @INCOLLECTION{Gall2007b, AUTHOR = {Gall, J{\"u}rgen and Rosenhahn, Bodo and Seidel, Hans-Peter}, EDITOR = {Klette, Reinhard and Metaxas, Dimitris and Rosenhahn, Bodo}, TITLE = {An Introduction to Interacting Simulated Annealing}, BOOKTITLE = {Human Motion - Understanding, Modeling, Capture and Animation}, ADDRESS = {Heidelberg}, PUBLISHER = {Springer}, ISBN = {978-1-4020-6692-4}, YEAR = {2008}, PAGES = {319--345}, ABSTRACT = {Human motion capturing can be regarded as an optimization problem where one searches for the pose that minimizes a previously defined error function based on some image features. Most approaches for solving this problem use iterative methods like gradient descent approaches. They work quite well as long as they do not get distracted by local optima. We introduce a novel approach for global optimization that is suitable for the tasks as they occur during human motion capturing. We call the method interacting simulated annealing since it is based on an interacting particle system that converges to the global optimum similar to simulated annealing. We provide a detailed mathematical discussion that includes convergence results and annealing properties. Moreover, we give two examples that demonstrate possible applications of the algorithm, namely a global optimization problem and a multi-view human motion capturing task including segmentation, prediction, and prior knowledge. A quantative error analysis also indicates the performance and the robustness of the interacting simulated annealing algorithm.}, } @INCOLLECTION{Gall2007c, AUTHOR = {Gehrig, Stefan and Hern{\'a}n, Badino and Gall, J{\"u}rgen}, EDITOR = {Klette, Reinhard and Metaxas, Dimitris and Rosenhahn, Bodo}, TITLE = {Accurate and Model-Free Pose Estimation of Crash Test Dummies}, BOOKTITLE = {Human Motion - Understanding, Modeling, Capture and Animation}, ADDRESS = {Heidelberg}, PUBLISHER = {Springer}, ISBN = {978-1-4020-6692-4}, YEAR = {2008}, PAGES = {453--473}, ABSTRACT = {In this chapter, we present a model-free pose estimation algorithm to estimate the relative pose of a rigid object. In the context of human motion, a rigid object can be either a limb, the head, or the back. In most pose estimation algorithms, the object of interest covers a large image area. We focus on pose estimation of objects covering a field of view of less than 5$^\circ$\ by 5$^\circ$\ using stereo vision. With this new algorithm suitable for small objects, we investigate the effect of the object size on the pose accuracy. In addition, we introduce an object tracking technique that is insensitive to partial occlusion. We are particularly interested in human motion in this context focusing on crash test dummies. The main application for this method is the analysis of crash video sequences. For a human motion capture system, a connection of the various limbs can be done in an additional step. The ultimate goal is to fully obtain the motion of crash test dummies in a vehicle crash. This would give information on which body part is exposed to what kind of forces and rotational forces could be determined as well. Knowing all this, car manufacturers can optimize the passive safety components to reduce forces on the dummy and ultimately on the real vehicle passengers. Since camera images for crash videos contain the whole crash vehicle, the size of the crash test dummies is relatively small in our experiments. For these experiments, mostly high-speed cameras with high resolution are used. However, the method described here easily extends to real-time robotics applications with smaller VGA-size images, where relative pose estimation is needed, {e.g.}\ for manipulator control.}, } @ARTICLE{Gall2007JMIV, AUTHOR = {Gall, J{\"u}rgen and Potthoff, J{\"u}rgen and Schn{\"o}rr, Christoph and Rosenhahn, Bodo and Seidel, Hans-Peter}, JOURNAL = {Journal of Mathematical Imaging and Vision}, TITLE = {Interacting and Annealing Particle Filters: Mathematics and a Recipe for Applications}, ADDRESS = {Netherlands}, NUMBER = {1}, PUBLISHER = {Springer}, VOLUME = {28}, ISBN = {0924-9907}, DOI = {10.1007/s10851-007-0007-8}, YEAR = {2007}, PAGES = {1--18}, ABSTRACT = {Interacting and annealing are two powerful strategies that are applied in different areas of stochastic modelling and data analysis. Interacting particle systems approximate a distribution of interest by a finite number of particles where the particles interact between the time steps. In computer vision, they are commonly known as particle filters. Simulated annealing, on the other hand, is a global optimization method derived from statistical mechanics. A recent heuristic approach to fuse these two techniques for motion capturing has become known as annealed particle filter. In order to analyze these techniques, we rigorously derive in this paper two algorithms with annealing properties based on the mathematical theory of interacting particle systems. Convergence results and sufficient parameter restrictions enable us to point out limitations of the annealed particle filter. Moreover, we evaluate the impact of the parameters on the performance in various experiments, including the tracking of articulated bodies from noisy measurements. Our results provide a general guidance on suitable parameter choices for different applications.}, } @INPROCEEDINGS{Gall2008, AUTHOR = {Gall, J{\"u}rgen and Rosenhahn, Bodo and Seidel, Hans-Peter}, TITLE = {Drift-free Tracking of Rigid and Articulated Objects}, BOOKTITLE = {IEEE Conference on Computer Vision and Pattern Recognition}, ORGANIZATION = {Institute of Electrical and Electronics Engineers}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Anchorage, USA}, PUBLISHER = {IEEE Computer Society}, ISBN = {978-1-4244-2242-5}, DOI = {10.1109/CVPR.2008.4587558}, YEAR = {2008}, PAGES = {1--8}, ABSTRACT = {Model-based 3D tracker estimate the position, rotation, and joint angles of a given model from video data of one or multiple cameras. They often rely on image features that are tracked over time but the accumulation of small errors results in a drift away from the target object. In this work, we address the drift problem for the challenging task of human motion capture and tracking in the presence of multiple moving objects where the error accumulation becomes even more problematic due to occlusions. To this end, we propose an analysis-by-synthesis framework for articulated models. It combines the complementary concepts of patch-based and region-based matching to track both structured and homogeneous body parts. The performance of our method is demonstrated for rigid bodies, body parts, and full human bodies where the sequences contain fast movements, self-occlusions, multiple moving objects, and clutter. We also provide a quantitative error analysis and comparison with other model-based approaches. }, } @INPROCEEDINGS{Gall2008b, AUTHOR = {Gall, J{\"u}rgen and Rosenhahn, Bodo and Gehrig, Stefan and Seidel, Hans-Peter}, EDITOR = {Rigoll, Gerhard}, TITLE = {Model-Based Motion Capture for Crash Test Video Analysis}, BOOKTITLE = {Pattern Recognition}, PADDRESS = {Heidelberg, Germany}, ADDRESS = {Munich, Germany}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5096}, ISBN = {978-3-540-69320-8}, DOI = {10.1007/978-3-540-69321-5_10}, YEAR = {2008}, PAGES = {92--101}, ABSTRACT = {In this work, we propose a model-based approach for estimating the 3D position and orientation of a dummy's head for crash test video analysis. Instead of relying on photogrammetric markers which provide only sparse 3D measurements, features present in the texture of the object's surface are used for tracking. In order to handle also small and partially occluded objects, the concepts of region-based and patch-based matching are combined for pose estimation. For a qualitative and quantitative evaluation, the proposed method is applied to two multi-view crash test videos captured by high-speed cameras. }, } @ARTICLE{Gall2008c, AUTHOR = {Gall, J{\"u}rgen and Rosenhahn, Bodo and Brox, Thomas and Seidel, Hans-Peter}, JOURNAL = {International Journal of Computer Vision}, TITLE = {Optimization and Filtering for Human Motion Capture - a Multi-Layer Framework}, ADDRESS = {New York, NY}, NUMBER = {1-2}, PUBLISHER = {Springer}, VOLUME = {87}, ISBN = {0920-5691}, DOI = {10.1007/s11263-008-0173-1}, YEAR = {2010}, PAGES = {75--92}, ABSTRACT = {Local optimization and filtering have been widely applied to model-based 3D human motion capture. Global stochastic optimization has recently been proposed as promising alternative solution for tracking and initialization. In order to benefit from optimization and filtering, we introduce a multi-layer framework that combines stochastic optimization, filtering, and local optimization. While the first layer relies on interacting simulated annealing and some weak prior information on physical constraints, the second layer refines the estimates by filtering and local optimization such that the accuracy is increased and ambiguities are resolved over time without imposing restrictions on the dynamics. In our experimental evaluation, we demonstrate the significant improvements of the multi-layer framework and provide quantitative 3D pose tracking results for the complete \texttt{HumanEva-II} dataset. The paper further comprises a comparison of global stochastic optimization with particle filtering, annealed particle filtering, and local optimization.}, } @ARTICLE{Gall2009a, AUTHOR = {Brox, Thomas and Rosenhahn, Bodo and Gall, J{\"u}rgen and Cremers, Daniel}, JOURNAL = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, TITLE = {Combined Region and Motion-based {3D} Tracking of Rigid and Articulated Objects}, ADDRESS = {Piscataway, NJ}, NUMBER = {3}, PUBLISHER = {IEEE}, VOLUME = {32}, ISBN = {0162-8828}, DOI = {10.1109/TPAMI.2009.32}, YEAR = {2010}, PAGES = {402--415}, ABSTRACT = {In this paper, we propose the combined use of complementary concepts for 3D tracking: region fitting on one side, and dense optical flow as well as tracked SIFT features on the other. Both concepts are chosen such that they can compensate for the shortcomings of each other. While tracking by the object region can prevent the accumulation of errors, optical flow and SIFT can handle larger transformations. Whereas segmentation works best in case of homogeneous objects, optical flow computation and SIFT tracking rely on sufficiently structured objects. We show that a sensible combination yields a general tracking system that can be applied in a large variety of scenarios without the need to manually adjust weighting parameters.}, } @INPROCEEDINGS{Gall2009b, AUTHOR = {Gall, J{\"u}rgen and Stoll, Carsten and de Aguiar, Edilson and Theobalt, Christian and Rosenhahn, Bodo and Seidel, Hans-Peter}, TITLE = {Motion Capture Using Joint Skeleton Tracking and Surface Estimation}, BOOKTITLE = {2009 IEEE Conference on Computer Vision and Pattern Recognition : CVPR 2009}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Miami, USA}, PUBLISHER = {IEEE}, ISBN = {978-1-4244-3992-8}, DOI = {10.1109/CVPR.2009.5206755}, YEAR = {2009}, PAGES = {1746--1753}, ABSTRACT = {This paper proposes a method for capturing the performance of a human or an animal from a multi-view video sequence. Given an articulated template model and silhouettes from a multi-view image sequence, our approach recovers not only the movement of the skeleton, but also the possibly non-rigid temporal deformation of the 3D surface. While large scale deformations or fast movements are captured by the skeleton pose and approximate surface skinning, true small scale deformations or non-rigid garment motion are captured by fitting the surface to the silhouette. We further propose a novel optimization scheme for skeleton-based pose estimation that exploits the skeleton's tree structure to split the optimization problem into a local one and a lower dimensional global one. We show on various sequences that our approach can capture the 3D motion of animals and humans accurately even in the case of rapid movements and wide apparel like skirts.}, } @INPROCEEDINGS{Gall2009c, AUTHOR = {Gall, J{\"u}rgen and Lempitsky, Victor}, TITLE = {Class-Specific {Hough} Forests for Object Detection}, BOOKTITLE = {2009 IEEE Conference on Computer Vision and Pattern Recognition : CVPR 2009}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Miami, Florida}, PUBLISHER = {IEEE}, ISBN = {978-1-4244-3992-8}, DOI = {10.1109/CVPR.2009.5206740}, YEAR = {2009}, PAGES = {1022--1029}, ABSTRACT = {We present a method for the detection of instances of an object class, such as cars or pedestrians, in natural images. Similarly to some previous works, this is accomplished via generalized Hough transform, where the detections of individual object parts cast probabilistic votes for possible locations of the centroid of the whole object; the detection hypotheses then correspond to the maxima of the Hough image that accumulates the votes from all parts. However, whereas the previous methods detect object parts using generative codebooks of part appearances, we take a more discriminative approach to object part detection. Towards this end, we train a class-specific Hough forest, which is a random forest that directly maps the image patch appearance to the probabilistic vote about the possible location of the object centroid. We demonstrate that Hough forests improve the results of the Hough-transform object detection significantly and achieve state-of-the-art performance for several classes and datasets.}, } @PHDTHESIS{Gall2009:Thesis, AUTHOR = {Gall, J{\"u}rgen}, TITLE = {Filtering and Optimization Strategies for Markerless Human Motion Capture with Skeleton-based Shape Models}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {July}, YEAR = {2009}, } @MASTERSTHESIS{GallDipl05, AUTHOR = {Gall, J{\"u}rgen}, TITLE = {Generalised Annealed Particle Filter - Mathematical Framework, Algorithms and Applications}, SCHOOL = {University of Mannheim}, TYPE = {Master's thesis}, MONTH = {December}, YEAR = {2005}, } @INPROCEEDINGS{GallISVC2005, AUTHOR = {Gall, J{\"u}rgen and Rosenhahn, Bodo and Brox, Thomas and Seidel, Hans-Peter}, EDITOR = {Bebis, George and Boyle, Richard and Parvin, Bahram and Koracin, Darko and Remagnino, Paolo and Nefian, Ara and Meenakshisundaram, Gopi and Pascucci, Valerio and Zara, Jiri and Molineros, Jose and Theisel, Holger and Malzbender, Tom}, TITLE = {Learning for Multi-view {3D} Tracking in the Context of Particle Filters}, BOOKTITLE = {Advances in Visual Computing : Second International Symposium, ISVC 2006, Part II}, PADDRESS = {Berlin, Germany}, ADDRESS = {Lake Tahoe, NV, USA}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4292}, ISBN = {978-3-540-48626-8}, YEAR = {2006}, PAGES = {59--69}, ABSTRACT = {In this paper we present an approach to use prior knowledge in the particle filter framework for 3D tracking, i.e. estimating the state parameters such as joint angles of a 3D object. The probability of the object’s states, including correlations between the state parameters, is learned a priori from training samples. We introduce a framework that integrates this knowledge into the family of particle filters and particularly into the annealed particle filter scheme. Furthermore, we show that the annealed particle filter also works with a variational model for level set based image segmentation that does not rely on background subtraction and, hence, does not depend on a static background. In our experiments, we use a four camera set-up for tracking the lower part of a human body by a kinematic model with 18 degrees of freedom. We demonstrate the increased accuracy due to the prior knowledge and the robustness of our approach to image distortions. Finally, we compare the results of our multi-view tracking system quantitatively to the outcome of an industrial marker based tracking system.}, } @INPROCEEDINGS{Garg:2006:SP, AUTHOR = {Garg, Gaurav Garg and Talvala, Eino-Ville and Levoy, Marc and Lensch, Hendrik P. A.}, EDITOR = {Anenine-M{\"o}ller, Thomas and Heidrich, Wolfgang}, TITLE = {Symmetric Photography: Exploiting Data-sparseness in Reflectance Fields}, BOOKTITLE = {Rendering Techniques 2006: Eurographics Symposium on Rendering}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Nicosia, Cyprus}, PUBLISHER = {Eurographics Association}, MONTH = {June}, ISBN = {3-905673-35-5}, YEAR = {2006}, PAGES = {251--262}, } @ARTICLE{Garrido2013, AUTHOR = {Garrido, Pablo and Valgaerts, Levi and Wu, Chenglei and Theobalt, Christian}, JOURNAL = {ACM Transactions on Graphics (Proc. of ACM SIGGRAPH Asia)}, TITLE = {Reconstructing Detailed Dynamic Face Geometry from Monocular Video}, ADDRESS = {New York, USA}, NUMBER = {6}, PUBLISHER = {ACM}, MONTH = {November}, VOLUME = {32}, ISBN = {0730-0301}, DOI = {10.1145/2508363.2508380}, YEAR = {2013}, PAGES = {158:1--158:10}, } @ARTICLE{GAURAV2012, AUTHOR = {Bharaj, Gaurav and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter and Theobalt, Christian}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS 2012)}, TITLE = {Automatically Rigging Multi-component Characters}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, ADDRESS = {Oxford}, NUMBER = {2}, PUBLISHER = {Blackwell}, VOLUME = {31}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2012.03034.x}, YEAR = {2012}, PAGES = {755--764}, } @ARTICLE{Genzhi2013, AUTHOR = {Nils Hasler and Christian Theobalt}, JOURNAL = {IEEE T. Cybernetics}, TITLE = {Free-Viewpoint Video of Human Actors Using Multiple Handheld Kinects}, VOLUME = {43(5)}, YEAR = {2013}, PAGES = {1370--1382}, } @PHDTHESIS{Ghali1999, AUTHOR = {Ghali, Sherif}, TITLE = {A Geometric Framework for Computer Graphics Addressing Modeling, Visibility, and Shadows}, SCHOOL = {University of Toronto}, TYPE = {Doctoral dissertation}, MONTH = {June}, YEAR = {1999}, ABSTRACT = {The main question this dissertation addresses is the following: Is it possible to design a computer graphics API such that modeling primitives, computing visibility, and generating shadows from point, linear, and area light sources can be conveniently and concisely expressed? The thesis answers this question in the affirmative by describing a framework for geometric computing in computer graphics. The classes in the layered system constituting the framework are described using the UML notation and each algorithm presented is encapsulated in a member method of a class in the hierarchy. We identify a number of abstractions for object--space graphics such as transparent visibility and opaque visibility. These abstractions are somewhat harder to implement than standard rasterized abstractions as they rely on graphs and planar maps. Nevertheless, these notions prove to be fundamental in this work on object--space graphics and also appear to be fundamental for computer graphics in general. We propose that clients of a graphics API such as the one presented here should be relieved from the onus of computing shadows and we show that the computation of shadows can be automated and encapsulated in the framework. We address illumination under a point, a linear, and an area light source in space. We also fully address modeling, visibility, and shadow problems in the plane. Planar problems both give us valuable intuition before tackling the problems in space and are useful for graphical environments such as mazes. The thesis also proposes ways for minimizing objects in a geometric framework. We show that a variation on the winged--edge data structure can be encapsulated to represent topology and describe how a programming language supporting genericity allows us to instantiate the topological classes and their iterators for use in modeling a scene, in representing its view in object--space, and in representing the scene when its topology is refined to include shadow edges. The computation is done entirely in object--space. Some of the advantages of object--space computation are that the shadow edges are determined symbolically, the time spent on shading is proportional to the visible features of the scene, and the output is both concise and device--independent.}, } @INPROCEEDINGS{Ghali:2000:EGSTAR, AUTHOR = {Ghali, Sherif and Fiume, Eugene and Seidel, Hans-Peter}, TITLE = {Shadow Computation: A Unified Perspective}, BOOKTITLE = {European Association for Computer Graphics 21st Annual Conference (Eurographics-00), State of The Art Reports}, TYPE = {STARs}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Interlaken, Switzerland}, PUBLISHER = {Eurographics}, MONTH = {August}, YEAR = {2000}, PAGES = {1--17}, ABSTRACT = {Methods for solving shadow problems by solving instances of visibility problems have long been known and exploited. There are, however, other potent uses of such a reduction of shadow problems, several of which we explore in this paper. Specifically, we describe algorithms that use a resolution--independent, or object--space, visibility structure for the computation of object--space shadows under point, linear, and area light sources. The connection between object--space visibility and shadow computation is well--known in computer graphics. We show how that fundamental observation can be recast and generalized within an object--space visibility structure. The edges in such a structure contain exactly the information needed to determine shadow edges under a point light source. Also, the locations along a linear or an area light source at which visibility changes (termed critical points and critical lines) provide the necessary information for computing shadow edges resulting from linear and area light sources. Not only are instances of all shadow problems thus reduced to visibility problems, but instances of shadow problems under linear and area light sources are also reduced to instances of shadow generation under point and linear light sources, respectively.}, } @INCOLLECTION{Ghali:2000:sigcourse, AUTHOR = {Blythe, David and Ghali, Sherif and Kettner, Lutz and Sowizral, Henry}, EDITOR = {Spencer, Steven N.}, TITLE = {Migrating to an Object-Oriented Graphics API}, BOOKTITLE = {SIGGRAPH 2000 (SIGGRAPH-00), Course Notes CD-ROM}, ADDRESS = {New York, USA}, PUBLISHER = {ACM SIGGRAPH}, MONTH = {July}, ISBN = {1-58113-276-X}, YEAR = {2000}, ABSTRACT = {We provide an analysis of the elements needed in an object--oriented scene graph API and give a contrasting, non--competing, exposition of how such elements are implemented in modern graphics and geometry API's. The objectives are to show the sensibility of the adopted design options and to give the flavors, both common and distinct, of various modern scene graph API's.}, } @INPROCEEDINGS{Ghali:2000:VMV, AUTHOR = {Ghali, Sherif and Fiume, Eugene and Seidel, Hans-Peter}, EDITOR = {Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {Object-Space, Connectivity-Preserving, Shadow Computation}, BOOKTITLE = {Proceedings of Vision, Modeling, and Visualization (VMV-00)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, MONTH = {November}, ISBN = {1-58603-104-x}, YEAR = {2000}, PAGES = {281--289}, ABSTRACT = {Known shadow algorithms can be classified as either mapping techniques or as geometric techniques. Both involve computing visibility from a viewer located at the light source, but whereas algorithms in the first category compute a texture to be mapped on the surfaces in the scene, algorithms in the second category destruct the scene geometry to build lit and unlit polygon lists. We describe in this paper an algorithm that lies in the second category, but one that is non--destructive. Namely, the algorithm we propose ensures that all connectivity in the scene remains intact and thus that adjacency information, which is important in a solid modeling environment, remains intact.}, } @INPROCEEDINGS{gmp02yb, AUTHOR = {Yoshizawa, Shin and Belyaev, Alexander}, EDITOR = {Suzuki, Hiromasa and Martin, Ralph}, TITLE = {Fair Triangle Mesh Generation via Discrete Elastica}, BOOKTITLE = {Proceedings of the 2nd Biennial International Conference on Geometric Modeling and Processing}, ORGANIZATION = {RIKEN (The Institute of Physical and Chemical Research), Japa}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Wako, Saitama, Japan}, PUBLISHER = {IEEE}, MONTH = {July}, ISBN = {0-7695-1674-2}, YEAR = {2002}, PAGES = {119--123}, ABSTRACT = {Surface fairing, generating free-form surfaces satisfying aesthetic requirements, is important for many computer graphics and geometric modeling applications. A common approach for fair surface design consists of minimization of fairness measures penalizing large curvature values and curvature oscillations. The paper develops a numerical approach for fair surface modeling via curvature-driven evolutions of triangle meshes. Consider a smooth surface each point of which moves in the normal direction with speed equal to a function of curvature and curvature derivatives. Chosen the speed function properly, the evolving surface converges to a desired shape minimizing a given fairness measure. Smooth surface evolutions are approximated by evolutions of triangle meshes. A tangent speed component is used to improve the quality of the evolving mesh and to increase computational stability. Contributions of the paper include also an improved method for estimating the mean curvature. }, } @INPROCEEDINGS{gmp02yob, AUTHOR = {Yagou, Hirokazu and Ohtake, Yutaka and Belyaev, Alexander}, EDITOR = {Suzuki, Hiromasa and Martin, Ralph}, TITLE = {Mesh Smoothing via Mean and Median Filtering Applied to Face Normals}, BOOKTITLE = {Geometric Modeling and Processing}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {RIKEN, Saitama, Japan}, PUBLISHER = {IEEE}, ISBN = {0-7695-1674-2}, YEAR = {2002}, PAGES = {124--131}, } @INPROCEEDINGS{gmp06sbs, AUTHOR = {Schall, Oliver and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Kim, Myung-Soo and Shimada, Kenji}, TITLE = {Adaptive Fourier-Based Surface Reconstruction}, BOOKTITLE = {Geometric modeling and processing - GMP 2006 : 4th International Conference}, PADDRESS = {Berlin, Germany}, ADDRESS = {Pittsburgh, PA, USA}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4077}, ISBN = {3-540-36711-X}, YEAR = {2006}, PAGES = {34--44}, ABSTRACT = {In this paper, we combine Kazhdan's FFT-based approach to surface reconstruction from oriented points with adaptive subdivision and partition of unity blending techniques. The advantages of our surface reconstruction method include a more robust surface restoration in regions where the surface bends close to itself and a lower memory consumption. The latter allows us to achieve a higher reconstruction accuracy than the original global approach. Furthermore, our reconstruction process is guided by a global error control achieved by computing the Hausdorff distance of selected input samples to intermediate reconstructions.}, } @INPROCEEDINGS{Goesele1999, AUTHOR = {Goesele, Michael and Stuerzlinger, Wolfgang}, EDITOR = {Z{\'a}ra, Jir{\'i}}, TITLE = {Semantic Constraints for Scene Manipulation}, BOOKTITLE = {Proceedings of the 15th Spring Conference on Computer Graphics (SCCG-99)}, PADDRESS = {Bratislava, Slovakia}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {Comenius University}, ISBN = {80-223-1357-2}, YEAR = {1999}, PAGES = {140--146}, ABSTRACT = {The creation of object models for computer graphics applications, such as interior design or the generation of animations is a labour-intensive process. Today's computer aided design (CAD) programs address the problem of creating geometric object models quite well. But almost all users find common tasks, such as quickly furnishing a room, hard to accomplish. One of the basic reasons is that manipulation of objects often does not yield the expected results. This paper presents a new system that exploits knowledge about natural behavior of objects to provide simple and intuitive interaction techniques for object manipulation. Semantic constraints are introduced, which encapsulate such `common knowledge' about objects. Furthermore, we present a new way to automatically infer a scene hierarchy by dynamically grouping objects according to their constraint relationships.}, } @INPROCEEDINGS{GoeseleICCV2007, AUTHOR = {Goesele, Michael and Snavely, Noah and Curless, Brian and Hoppe, Hugues and Seitz, Steven M.}, TITLE = {Multi-View Stereo for Community Photo Collections}, BOOKTITLE = {Proceedings of the 11th International Conference on Computer Vision (ICCV 2007)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Rio de Janeiro, Brazil}, PUBLISHER = {IEEE}, YEAR = {2007}, PAGES = {265--270}, } @PROCEEDINGS{GoeseleKautzLangLenschSeidel2003, AUTHOR = {Goesele, Michael and Kautz, Jan and Lang, Jochen and Lensch, Hendrik P. A. and Seidel, Hans-Peter}, EDITOR = {Goesele, Michael and Kautz, Jan and Lang, Jochen and Lensch, Hendrik P. A. and Seidel, Hans-Peter}, TITLE = {7th ACM Symposium on Solid Modeling and Applications; Tutorial T2: A Framework for the Acquisition, Processing and Interactive Display of High Quality 3D Models}, PADDRESS = {Saarbr{\"u}cken, Germany}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Max-Planck-Institut f{\"u}r Informatik}, MONTH = {June}, VOLUME = {T2}, YEAR = {2002}, PAGES = {51}, NOTE = {Also published as MPI Research Report MPI-I-2002-4-001 }, } @INPROCEEDINGS{GoeseleVMV2007, AUTHOR = {Goesele, Michael}, EDITOR = {Lensch, Hendrik P.A. and Rosenhahn, Bodo and Seidel, Hans-Peter and Slusallek, Philipp and Weickert, Joachim}, TITLE = {Images, Images, Billions of Images}, BOOKTITLE = {Proceedings of the Vision, Modeling, and Visualization Conference 2007 (VMV 2007)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Aka GmbH}, ISBN = {978-3-89838-085-0}, YEAR = {2007}, PAGES = {117--118}, } @MASTERSTHESIS{Goesele:1998:IKV, AUTHOR = {Goesele, Michael}, TITLE = {{Interaktive Konstruktion von Dreidimensionalen Szenen}}, SCHOOL = {Universit{\"a}t Ulm}, TYPE = {Master's thesis}, YEAR = {1998}, } @INPROCEEDINGS{Goesele:2000:BPS, AUTHOR = {Goesele, Michael and Lensch, Hendrik P. A. and Heidrich, Wolfgang and Seidel, Hans-Peter}, EDITOR = {Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {Building a Photo Studio for Measurement Purposes}, BOOKTITLE = {Proceedings of Vision, Modeling, and Visualization (VMV-00)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, MONTH = {November}, ISBN = {1-58603-104-x}, YEAR = {2000}, PAGES = {231--238}, ABSTRACT = {A digital photo studio was built to generate high quality real world input data for various image-based rendering and vision algorithms. Special attention was paid to carefully control the lighting conditions in order to be able to acquire exact data about the surface properties of objects using readily available digital camera technology. This paper discusses the specific demands and requirements that arise from these goals for the equipment in the photo studio. Furthermore, we describe the typical workflow for one of our current projects, thereby illustrating the interoperation between the different devices.}, } @INPROCEEDINGS{Goesele:2001:CCH, AUTHOR = {Goesele, Michael and Heidrich, Wolfgang and Seidel, Hans-Peter}, TITLE = {Color Calibrated High Dynamic Range Imaging with {ICC} Profiles}, BOOKTITLE = {Proceedings of the 9th Color Imaging Conference Color Science and Engineering: Systems, Technologies, Applications}, PADDRESS = {Springfield, USA}, ADDRESS = {Scottsdale, USA}, PUBLISHER = {Society for Imaging Science and Technology}, ISBN = {0-89208-235-6}, YEAR = {2001}, PAGES = {286--290}, ABSTRACT = {High dynamic range (HDR) imaging has become a powerful tool in computer graphics, and is being applied to scenarios like simulation of different film responses, motion blur, and image-based illumination. The HDR images for these applications are typically generated by combining the information from multiple photographs taken at different exposure settings. Unfortunately, the color calibration of these images has so far been limited to very simplistic approaches such as a simple white balance algorithm. More sophisticated methods used for device-independent color representations are not easily applicable because they inherently assume a limited dynamic range. In this paper, we introduce a novel approach for constructing HDR images directly from low dynamic range images that were calibrated using an ICC input profile.}, } @INPROCEEDINGS{Goesele:2001:EBD, AUTHOR = {Goesele, Michael and Heidrich, Wolfgang and Seidel, Hans-Peter}, TITLE = {Entropy-Based Dark Frame Subtraction}, BOOKTITLE = {Proceedings of PICS 2001: Image Processing, Image Quality, Image Capture, Systems Conference}, ORGANIZATION = {The Society for Imaging Science and Technology (IS\&T)}, PADDRESS = {Springfield, VA, USA}, ADDRESS = {Montreal, Canada}, PUBLISHER = {IS\&T}, MONTH = {April}, ISBN = {0-89208-232-1}, YEAR = {2001}, PAGES = {293--298}, ABSTRACT = {Noise due to dark current is a serious limitation for taking long exposure time images with a CCD digital camera. Current solutions have serious drawbacks: interpolation of pixels with high dark current leads to smoothing effects or other artifacts -- especially if a large number of pixels are corrupted. Due to the exponential temperature dependence of the dark current, dark frame subtraction works best for temperature controlled high end CCD imaging systems. On the physical level, two independent signals (charge generated by photons hitting the CCD and by the dark current) are added. Due to its random distribution, adding (or subtracting) the dark current noise signal increases the entropy of the resulting image. The entropy is minimal if the dark current signal is not present at all. A dark frame is a good representation of the dark current noise. As the generated dark current depends on the temperature equally for all pixels, a noisy image can be cleaned by the subtraction of a scaled dark frame. The scaling factor can be determined in an optimization step which tries to minimize the entropy of the cleaned image. We implemented a software system that effectively removes dark current noise even from highly corrupted images. The resulting images contain almost no visible artifacts since only the noise signal is removed. This extends the range of usable exposure times of digital cameras without temperature control systems by about one to two orders of magnitude.}, } @INPROCEEDINGS{Goesele:2003:A3R, AUTHOR = {Goesele, Michael and Fuchs, Christian and Seidel, Hans-Peter}, EDITOR = {Rioux, Marc and Godin, Guy and Boulanger, Pierre}, TITLE = {Accuracy of 3D Range Scanners by Measurement of the Slanted Edge Modulation Transfer Function}, BOOKTITLE = {4th International Conference on 3-D Digital Imaging and Modeling}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Banff, Canada}, PUBLISHER = {IEEE}, YEAR = {2003}, PAGES = {37--44}, ABSTRACT = {We estimate the accuracy of a 3D~range scanner in terms of its spatial frequency response. We determine a scanner's modulation transfer function (MTF) in order to measure its frequency response. A slanted edge is scanned from which we derive a superresolution edge profile. Its Fourier transform is compared to the Fourier transform of an ideal edge in order to determine the MTF of the device. This allows us to determine how well small details can be acquired by the 3D~scanner. We report the results of several measurements with two scanners under various conditions.}, } @ARTICLE{Goesele:2003:ALS, AUTHOR = {Goesele, Michael and Granier, Xavier and Heidrich, Wolfgang and Seidel, Hans-Peter}, EDITOR = {Hodgins, Jessica K.}, JOURNAL = {ACM Trans. Graphics (Proc. ACM SIGGRAPH'03)}, TITLE = {Accurate Light Source Acquisition and Rendering}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2003 (SIGGRAPH-03)}, ORGANIZATION = {Association of Computing Machinery (ACM)}, ADDRESS = {New York, USA}, NUMBER = {3}, PUBLISHER = {ACM}, SERIES = {ACM Transactions on Graphics}, VOLUME = {22}, YEAR = {2003}, PAGES = {621--630}, ABSTRACT = {Realistic image synthesis requires both complex and realistic models of real-world light sources and efficient rendering algorithms to deal with them. In this paper, we describe a processing pipeline for dealing with complex light sources from acquisition to global illumination rendering. We carefully design optical filters to guarantee high precision measurements of real-world light sources. We discuss two practically feasible setups that allow us to measure light sources with different characteristics. Finally, we introduce an efficient importance sampling algorithm for our representation that can be used, for example, in conjunction with Photon Maps.}, } @ARTICLE{Goesele:2004:DAT, AUTHOR = {Goesele, Michael and Lensch, Hendrik P. A. and Lang, Jochen and Fuchs, Christian and Seidel, Hans-Peter}, EDITOR = {Marks, Joe}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {DISCO - Acquisition of Translucent Objects}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2004}, ADDRESS = {New York, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {August}, SERIES = {ACM Transactions on Graphics}, VOLUME = {23}, ISBN = {0730-0301}, YEAR = {2004}, PAGES = {835--844}, NOTE = {(Proc. ACM SIGGRAPH '04)}, ABSTRACT = { Translucent objects are characterized by diffuse light scattering beneath the object's surface. Light enters and leaves an object at possibly distinct surface locations. This paper presents the first method to acquire this transport behavior for arbitrary inhomogeneous objects. Individual surface points are illuminated in our DISCO measurement facility and the object's impulse response is recorded with a high-dynamic range video camera. The acquired data is resampled into a hierarchical model of the object's light scattering properties. Missing values are consistently interpolated resulting in measurement-based, complete and accurate representations of real translucent objects which can be rendered with various algorithms.}, } @PHDTHESIS{Goesele:2004:NAT, AUTHOR = {Goesele, Michael}, TITLE = {New Acquisition Techniques for Real Objects and Light Sources in Computer Graphics}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {July}, YEAR = {2004}, ABSTRACT = {Accurate representations of objects and light sources in a scene model are a crucial prerequisite for realistic image synthesis using computer graphics techniques. This thesis presents techniques for the efficient acquisition of real world objects and real world light sources, as well as an assessment of the quality of the acquired models. Making use of color management techniques, we setup an appearance reproduction pipeline that ensures best-possible reproduction of local light reflection with the available input and output devices. We introduce a hierarchical model for the subsurface light transport in translucent objects, derive an acquisition methodology, and acquire models of several translucent objects that can be rendered interactively. Since geometry models of real world objects are often acquired using 3D range scanners, we also present a method based on the concept of modulation transfer functions to evaluate their accuracy. In order to illuminate a scene with realistic light sources, we propose a method to acquire a model of the near-field emission pattern of a light source with optical prefiltering. We apply this method to several light sources with different emission characteristics and demonstrate the integration of the acquired models into both, global illumination as well as hardware-accelerated rendering systems.}, } @BOOK{Goesele:2004:NAT2, AUTHOR = {Goesele, Michael}, TITLE = {New Acquisition Techniques for Real Objects and Light Sources in Computer Graphics}, ADDRESS = {Norderstedt}, PUBLISHER = {Books on Demand}, MONTH = {December}, ISBN = {3-8334-1489-8}, YEAR = {2004}, PAGES = {184}, ABSTRACT = {Accurate representations of objects and light sources in a scene model are a crucial prerequisite for realistic image synthesis using computer graphics techniques. This thesis presents techniques for the efficient acquisition of real world objects and real world light sources, as well as an assessment of the quality of the acquired models. Making use of color management techniques, we setup an appearance reproduction pipeline that ensures best-possible reproduction of local light reflection with the available input and output devices. We introduce a hierarchical model for the subsurface light transport in translucent objects, derive an acquisition methodology, and acquire models of several translucent objects that can be rendered interactively. Since geometry models of real world objects are often acquired using 3D range scanners, we also present a method based on the concept of modulation transfer functions to evaluate their accuracy. In order to illuminate a scene with realistic light sources, we propose a method to acquire a model of the near-field emission pattern of a light source with optical prefiltering. We apply this method to several light sources with different emission characteristics and demonstrate the integration of the acquired models into both, global illumination as well as hardware-accelerated rendering systems.}, } @INPROCEEDINGS{Goesele:2004:VOC, AUTHOR = {Goesele, Michael and Lensch, Hendrik P. A. and Seidel, Hans-Peter}, TITLE = {Validation of Color Managed 3D Appearance Acquisition}, BOOKTITLE = {Color science and engineering: systems, technologies, applications : final program and proceedings of IS\&T and SID ; the 12th Color Imaging Conference}, PADDRESS = {Springfield, USA}, ADDRESS = {Scottsdale, Arizona, USA}, PUBLISHER = {IS\&T}, ISBN = {0-89208-254-2}, YEAR = {2004}, PAGES = {265--270}, ABSTRACT = {Image-based appearance acquisition algorithms are able to generate realistic 3D models of real objects but have previously not taken care of calibrated color space. We integrate a color managed high-dynamic range imaging technique into a recent appearance acquisition algorithm and generate models in CIE XYZ color space. We compare the final models with spectrophotometric measurements and compute difference images between renderings and ground truth images. Displayed renderings and printouts are compared to the original objects under identical illumination conditions to evaluate and validate the complete appearance reproduction pipeline. Working in CIE XYZ color space allows for expressing the perceivable differences in a standardized measure.}, } @ARTICLE{Goldluecke2007, AUTHOR = {Goldluecke, Bastian and Ihrke, Ivo and Linz, Christian and Magnor, Marcus}, JOURNAL = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, TITLE = {Weighted minimal hypersurface reconstruction}, ADDRESS = {Los Alamitos, CA, USA}, NUMBER = {7}, PUBLISHER = {IEEE}, MONTH = {July}, VOLUME = {29}, ISBN = {0162-8828}, DOI = {10.1109/TPAMI.2007.1146}, YEAR = {2007}, PAGES = {1194--1208}, } @MISC{GoldlueckeMPEG2002, AUTHOR = {Goldluecke, Bastian and Magnor, Marcus and Li, Ming and Theobalt, Christian}, TITLE = {EE2 - Methods for Model-based Scene Reconstruction and Real-Time Free Viewpoint Rendering}, HOWPUBLISHED = {MPEG Input Document M9145, ISO/IEC JTC1/SC29/WG1, Awaji Island, Japan, December 2002}, MONTH = {December}, YEAR = {2002}, } @INCOLLECTION{GoSt10MG, AUTHOR = {G{\"o}ddeke, Dominik and Strzodka, Robert}, EDITOR = {Kurzak, Jakub and Bader, David A. and Dongarra, Jack J.}, TITLE = {Mixed Precision {GPU}-multigrid Solvers with Strong Smoothers}, BOOKTITLE = {Scientific Computing with Multicore and Accelerators}, CHAPTER = {7}, ADDRESS = {Boca Raton, Calif.}, PUBLISHER = {CRC Press}, MONTH = {December}, SERIES = {Chapman \& Hall/CRC Computational Science}, VOLUME = {10}, ISBN = {978-1-439-82536-5}, YEAR = {2010}, PAGES = {131--147}, } @ARTICLE{GoSt11CR, AUTHOR = {G{\"o}ddeke, Dominik and Strzodka, Robert}, JOURNAL = {IEEE Transactions on Parallel and Distributed Systems}, TITLE = {Cyclic Reduction Tridiagonal Solvers on {GPUs} Applied to Mixed Precision Multigrid}, ADDRESS = {Piscataway, NJ}, NUMBER = {1}, PUBLISHER = {IEEE}, MONTH = {January}, VOLUME = {22}, DOI = {10.1109/TPDS.2010.61}, YEAR = {2011}, PAGES = {22--32}, } @ARTICLE{GoStMo_07scalability, AUTHOR = {G{\"o}ddeke, Dominik and Strzodka, Robert and Mohd-Yusof, Jamaludin and McCormick, Patrick and Buijssen, Sven H.M. and Grajewski, Matthias and Turek, Stefan}, JOURNAL = {Parallel Computing}, TITLE = {Exploring weak scalability for {FEM} calculations on a {GPU}-enhanced cluster}, NUMBER = {10-11}, PUBLISHER = {Elsevier}, MONTH = {November}, VOLUME = {33}, YEAR = {2007}, PAGES = {685--699}, ABSTRACT = {The first part of this paper surveys co-processor approaches for commodity based clusters in general, not only with respect to raw performance, but also in view of their system integration and power consumption. We then extend previous work on a small GPU cluster by exploring the heterogeneous hardware approach for a large-scale system with up to 160 nodes. Starting with a conventional commodity based cluster we leverage the high bandwidth of graphics processing units (GPUs) to increase the overall system bandwidth that is the decisive performance factor in this scenario. Thus, even the addition of low-end, out of date GPUs leads to improvements in both performance- and power-related metrics.}, } @ARTICLE{GoStMo_08GPUcluster, AUTHOR = {G{\"o}ddeke, Dominik and Strzodka, Robert and Mohd-Yusof, Jamaludin and McCormick, Patrick and Wobker, Hilmar and Becker, Christian and Turek, Stefan}, JOURNAL = {International Journal of Computational Science and Engineering}, TITLE = {Using {GPUs} to Improve Multigrid Solver Performance on a Cluster}, NUMBER = {1}, PUBLISHER = {Inderscience}, VOLUME = {4}, YEAR = {2008}, PAGES = {36--55}, } @ARTICLE{GoStTu07mixedPrec, AUTHOR = {G{\"o}ddeke, Dominik and Strzodka, Robert and Turek, Stefan}, JOURNAL = {International Journal of Parallel, Emergent and Distributed Systems}, TITLE = {Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in {FEM} simulations}, NUMBER = {4}, PUBLISHER = {Taylor \& Francis}, MONTH = {January}, VOLUME = {22}, YEAR = {2007}, PAGES = {221--256}, ABSTRACT = {In this survey paper, we compare native double precision solvers with emulated- and mixed- precision solvers of linear systems of equations as they typically arise in finite element discretisations. The emulation utilises two single float numbers to achieve higher precision, while the mixed precision iterative refinement computes residuals and updates the solution vector in double precision but solves the residual systems in single precision. Both techniques have been known since the 1960s, but little attention has been devoted to their performance aspects. Motivated by changing paradigms in processor technology and the emergence of highly parallel devices with outstanding single float performance, we adapt the emulation and mixed precision techniques to coupled hardware configurations, where the parallel devices serve as scientific co-processors. The performance advantages are examined with respect to speedups over a native double precision implementation (time aspect) and reduced area requirements for a chip (space aspect). The paper begins with an overview of the theoretical background, algorithmic approaches and suitable hardware architectures. We then employ several conjugate gradient and multigrid solvers and study their behaviour for different parameter settings of the iterative refinement technique. Concrete speedup factors are evaluated on the coupled hardware configuration of a general-purpose CPU and a graphics processor. The dual performance aspect of potential area savings is assessed on a field programmable gate array. In the last part, we test the applicability of the proposed mixed precision schemes with ill-conditioned matrices. We conclude that the mixed precision approach works very well with the parallel co-processors gaining speedup factors of four to five, and area savings of three to four, while maintaining the same accuracy as a reference solver executing everything in double precision.}, } @ARTICLE{GoWoSt_09FEASTSolid, AUTHOR = {G{\"o}ddeke, Dominik and Wobker, Hilmar and Strzodka, Robert and Mohd-Yusof, Jamaludin and McCormick, Patrick and Turek, Stefan}, JOURNAL = {International Journal of Computational Science and Engineering}, TITLE = {Co-Processor Acceleration of an Unmodified Parallel Solid Mechanics Code with {FEASTGPU}}, ADDRESS = {Gen{\`e}ve}, NUMBER = {4}, PUBLISHER = {Inderscience}, MONTH = {November}, VOLUME = {4}, ISBN = {1742-7185}, DOI = {10.1504/IJCSE.2009.029162}, YEAR = {2009}, PAGES = {254--269}, } @INPROCEEDINGS{Granados2008, AUTHOR = {Granados, Miguel and Seidel, Hans-Peter and Lensch, Hendrik P. A.}, EDITOR = {Shaw, Chris and Bartram, Lyn}, TITLE = {Background inpainting in non-time image sequences}, BOOKTITLE = {Proceedings of the Graphics Interface 2008 Conference}, ORGANIZATION = {The Canadian Human-Computer Communications Society}, PADDRESS = {New York, NY, USA}, ADDRESS = {Windsor, Ontario, Canada}, PUBLISHER = {ACM Press}, SERIES = {ACM International Conference Proceeding Series}, ISBN = {978-1-56881-423-0}, DOI = {http://doi.acm.org/10.1145/1375714.1375721}, YEAR = {2008}, PAGES = {33--40}, ABSTRACT = {We address the problem of reconstructing the background of a scene from a set of photographs featuring several occluding objects. We assume that the photographs are obtained from the same viewpoint and under similar illumination conditions. Our approach is to define the background as a composite of the input photographs. Each possible composite is assigned a cost, and the resulting cost function is minimized. We penalize deviations from the following two model assumptions: background objects are stationary, and background objects are more likely to appear across the photographs. We approximate object stationariness using a motion boundary consistency term, and object likelihood using probability density estimates. The penalties are combined using an entropy-based weighting function. Furthermore, we constraint the solution space in order to avoid composites that cut through objects. The cost function is minimized using graph cuts, and the final result is composed using gradient domain fusion. We demonstrate the application of our method to the recovering of clean, unoccluded shots of crowded public places, as well as to the removal of ghosting artifacts in the reconstruction of high dynamic range images from multi-exposure sequences. Our contribution is the definition of an automatic method for consistent background estimation from multiple exposures featuring occluders, and its application to the problem of ghost removal in high dynamic range image reconstruction.}, } @INPROCEEDINGS{Granados2010, AUTHOR = {Granados, Miguel and Adjin, Boris and Wand, Michael and Theobalt, Christian and Seidel, Hans-Peter and Lensch, Hendrik P. A.}, TITLE = {Optimal {HDR} reconstruction with linear digital cameras}, BOOKTITLE = {2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010). - Pt. 1}, PADDRESS = {Piscataway, NJ}, ADDRESS = {San Francisco, USA}, PUBLISHER = {IEEE}, ISBN = {978-1-4244-6983-3}, DOI = {10.1109/CVPR.2010.5540208}, YEAR = {2010}, PAGES = {215--222}, ABSTRACT = {Given a multi-exposure sequence of a scene, our aim is to recover the absolute irradiance falling onto a linear camera sensor. The established approach is to perform a weighted average of the scaled input exposures. However, there is no clear consensus on the appropriate weighting to use. We propose a weighting function that produces statistically optimal estimates under the assumption of compound- Gaussian noise. Our weighting is based on a calibrated camera model that accounts for all noise sources. This model also allows us to simultaneously estimate the irradiance and its uncertainty. We evaluate our method on simulated and real world photographs, and show that we consistently improve the signal-to-noise ratio over previous approaches. Finally, we show the effectiveness of our model for optimal exposure sequence selection and HDR image denoising.}, } @TECHREPORT{Granados2011TR, AUTHOR = {Granados, Miguel and Kim, Kwang and Theobalt, Christan}, TITLE = {How not to be seen - Video inpainting in crowded scenes}, INSTITUTION = {Max-Planck-Institut fuer Informatik}, TYPE = {Research Report}, ADDRESS = {Saarbruecken}, NUMBER = {MPI-I-2011-4-001}, MONTH = {February}, YEAR = {2011}, PAGES = {12}, ABSTRACT = {Removing dynamic objects from videos is an extremely challenging problem that even visual effects professionals often solve with time-consuming manual frame-by-frame editing. We propose a new approach to video completion that can deal with complex scenes containing dynamic background and non-periodical moving objects. We build upon the idea that the spatio-temporal hole left by a removed object can be filled with data available on other regions of the video where the occluded objects were visible. Video completion is performed by solving a large combinatorial problem that searches for an optimal pattern of pixel offsets from occluded to unoccluded regions. Our contribution includes an energy functional that generalizes well over different scenes with stable parameters, and that has the desirable convergence properties for a graph-cut-based optimization. We provide an interface to guide the completion process that both reduces computation time and allows for efficient correction of small errors in the result. We demonstrate that our approach can effectively complete complex, high-resolution occlusions that are greater in difficulty than what existing methods have shown.}, } @ARTICLE{granados2012a, AUTHOR = {Granados, Miguel and Tompkin, James and Kim, Kwang In and Grau, Oliver and Kautz, Jan and Theobalt, Christian}, JOURNAL = {Computer Graphics Forum (Proc. of EUROGRAPHICS)}, TITLE = {How Not to Be Seen - Object Removal from Videos of Crowded Scenes}, ADDRESS = {Hoboken}, NUMBER = {2}, PUBLISHER = {Wiley-Blackwell}, MONTH = {July}, VOLUME = {31}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2012.03000.x}, YEAR = {2012}, PAGES = {219--228}, ABSTRACT = {Removing dynamic objects from videos is an extremely challenging problem that even visual effects professionals often solve with time-consuming manual frame-by-frame editing. We propose a new approach to video completion that can deal with complex scenes containing dynamic background and non-periodical moving objects. We build upon the idea that the spatio-temporal hole left by a removed object can be filled with data available on other regions of the video where the occluded objects were visible. Video completion is performed by solving a large combinatorial problem that searches for an optimal pattern of pixel offsets from occluded to unoccluded regions. Our contribution includes an energy functional that generalizes well over different scenes with stable parameters, and that has the desirable convergence properties for a graph-cut-based optimization. We provide an interface to guide the completion process that both reduces computation time and allows for efficient correction of small errors in the result. We demonstrate that our approach can effectively complete complex, high-resolution occlusions that are greater in difficulty than what existing methods have shown.}, } @INPROCEEDINGS{granados2012b, AUTHOR = {Granados, Miguel and Kim, Kwang In and Tompkin, James and Kautz, Jan and Theobalt, Christian}, EDITOR = {Fitzgibbon, Andrew and Lazebnik, Svetlana and Perona, Pietro and Sato, Yoichi and Schmid, Cordelia}, TITLE = {Background Inpainting for Videos with Dynamic Objects and a Free-Moving Camera}, BOOKTITLE = {Proceedings of the 12th European Conference on Computer Vision}, PADDRESS = {Berlin}, ADDRESS = {Florence, Italy}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {7572}, ISBN = {978-3-642-33717-8}, DOI = {10.1007/978-3-642-33718-5_20}, YEAR = {2012}, PAGES = {682--695}, } @ARTICLE{Granados2013, AUTHOR = {Granados, Miguel and Kim, Kwang In and Tompkin, James and Theobalt, Christian}, JOURNAL = {ACM Trans. Graph.}, TITLE = {Automatic Noise Modeling for Ghost-free HDR Reconstruction}, ADDRESS = {New York, NY, USA}, NUMBER = {6}, PUBLISHER = {ACM}, MONTH = {November}, VOLUME = {32}, ISBN = {0730-0301}, DOI = {10.1145/2508363.2508410}, YEAR = {2013}, PAGES = {201:1--201:10}, ABSTRACT = {High dynamic range reconstruction of dynamic scenes requires careful handling of dynamic objects to prevent ghosting. However, in a recent review, Srikantha et al. [2012] conclude that "there is no single best method and the selection of an approach depends on the user's goal". We attempt to solve this problem with a novel approach that models the noise distribution of color values. We estimate the likelihood that a pair of colors in different images are observations of the same irradiance, and we use a Markov random field prior to reconstruct irradiance from pixels that are likely to correspond to the same static scene object. Dynamic content is handled by selecting a single low dynamic range source image and hand-held capture is supported through homography-based image alignment. Our noise-based reconstruction method achieves better ghost detection and removal than state-of-the-art methods for cluttered scenes with large object displacements. As such, our method is broadly applicable and helps move the field towards a single method for dynamic scene HDR reconstruction.}, } @PHDTHESIS{GranadosThesis2013, AUTHOR = {Granados, Miguel}, TITLE = {Advanced Editing Methods for Image and Video Sequences}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {February}, YEAR = {2013}, ABSTRACT = {In the context of image and video editing, this thesis proposes methods for modifying the semantic content of a recorded scene. Two different editing problems are approached: First, the removal of ghosting artifacts from high dynamic range (HDR) images recovered from exposure sequences, and second, the removal of objects from video sequences recorded with and without camera motion. These editings need to be performed in a way that the result looks plausible to humans, but without having to recover detailed models about the content of the scene, e.g. its geometry, reflectance, or illumination. The proposed editing methods add new key ingredients, such as camera noise models and global optimization frameworks, that help achieving results that surpass the capabilities of state-of-the-art methods. Using these ingredients, each proposed method defines local visual properties that approximate well the specific editing requirements of each task. These properties are then encoded into a energy function that, when globally minimized, produces the required editing results. The optimization of such energy functions corresponds to Bayesian inference problems that are solved efficiently using graph cuts. The proposed methods are demonstrated to outperform other state-of-the-art methods. Furthermore, they are demonstrated to work well on complex real-world scenarios that have not been previously addressed in the literature, i.e., highly cluttered scenes for HDR deghosting, and highly dynamic scenes and unconstrained camera motion for object removal from videos. }, } @INPROCEEDINGS{Granier:2003:IVO, AUTHOR = {Granier, Xavier and Goesele, Michael and Heidrich, Wolfgang and Seidel, Hans-Peter}, EDITOR = {Rokne, Jon and Klein, Reinhard and Wang, Wenping}, TITLE = {Interactive Visualization of Complex Real-World Light Sources}, BOOKTITLE = {11th Pacific Conference on Computer Graphics and Applications (PG-03)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Canmore, Canada}, PUBLISHER = {IEEE}, YEAR = {2003}, PAGES = {59--66}, ABSTRACT = {Interactive visualization of complex, real-world light sources has so far not been feasible. In this paper, we present an hardware accelerated direct lighting algorithm based on a recent high quality light source acquisition technique. By introducing an approximate reconstruction of the exact model, a multi-pass rendering approach, and a compact data representation, we are able to achieve interactive frame rates. The method is part of the processing pipeline from light source acquisition to high quality lighting of a virtual world.}, } @INPROCEEDINGS{Greeff2005a, AUTHOR = {Greeff, Mard{\'e} and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Skala, Vaclav}, TITLE = {Nailing and Pinning: Adding Constraints to Inverse Kinematics}, BOOKTITLE = {The 13th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2005 in co-operation with EUROGRAPHICS W S C G ' 2005 ; Short Papers}, PADDRESS = {Plzen, Czech Republic}, ADDRESS = {Plzen, Czech Republic}, PUBLISHER = {UNION Agency}, MONTH = {February}, SERIES = {Short Paper Proceedings}, ISBN = {80-903100-9-5}, YEAR = {2005}, PAGES = {125--128}, ABSTRACT = {Inverse kinematics is commonly applied to compute the resulting movement of an avatar for a prescribed target pose. The motion path computed by inverse kinematics, however, often differs from the expected or desired result due to an underconstrained parameter space of the degrees-of-freedom of all joints. In such cases, it is necessary to introduce additional constraints, for instance by locking a joint's position and/or rotation. We present a method to fix a joint in terms of position and/or rotation and explain how to incorporate these constraints into the inverse kinematics solution. }, } @INPROCEEDINGS{Grochulla2011, AUTHOR = {Grochulla, Martin and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter}, EDITOR = {Gagalowicz, Andr{\'e} and Philips, Wilfried}, TITLE = {Using Spatially Distributed Patterns for Multiple View Camera Calibration}, BOOKTITLE = {Computer Vision/Computer Graphics Collaboration Techniques: 5th International Conference, MIRAGE 2011}, ORGANIZATION = {INRIA}, PADDRESS = {Berlin}, ADDRESS = {Rocquencourt, France}, PUBLISHER = {Springer}, MONTH = {October}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {6930}, ISBN = {978-3-642-24135-2}, DOI = {10.1007/978-3-642-24136-9}, YEAR = {2011}, PAGES = {110--121}, ABSTRACT = {This paper presents an approach to intrinsic and extrinsic camera parameter calibration from a series of photographs or from video. For the reliable and accurate estimation of camera parameters it is common to use specially designed calibration patterns. However, using a single pattern, a globally consistent calibration is only possible from positions and viewing directions from where this single pattern is visible. To overcome this problem, the presented approach uses multiple coded patterns that can be distributed over a large area. A connection graph representing visible patterns in multiple views is generated, which is used to estimate globally consistent camera parameters for the complete scene. The approach is evaluated on synthetic and real-world ground truth examples. Furthermore, the approach is applied to calibrate the stereo-cameras of a robotic head on a moving platform.}, } @INPROCEEDINGS{Grochulla2012a, AUTHOR = {Li, Zhao and Herfet, Thorsten and Grochulla, Martin and Thorm{\"a}hlen, Thorsten}, TITLE = {Multiple active speaker localization based on audio-visual fusion in two stages}, BOOKTITLE = {2012 IEEE Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI)}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Hamburg, Germany}, PUBLISHER = {IEEE}, MONTH = {November}, ISBN = {978-1-4673-2510-3}, DOI = {10.1109/MFI.2012.6343015}, YEAR = {2012}, PAGES = {262--268}, ABSTRACT = {Localization of multiple active speakers in natural environments with only two microphones is a challenging problem. Reverberation degrades performance of speaker localization based exclusively on directional cues. The audio modality alone has problems with localization accuracy while the video modality alone has problems with false speaker activity detections. This paper presents an approach based on audiovisual fusion in two stages. In the first stage, speaker activity is detected based on the audio-visual fusion which can handle false lip movements. In the second stage, a Gaussian fusion method is proposed to integrate the estimates of both modalities. As a consequence, the localization accuracy and robustness compared to the audio/video modality alone is significantly increased. Experimental results in various scenarios confirmed the improved performance of the proposed system.}, } @INPROCEEDINGS{Grochulla2012b, AUTHOR = {Li, Zhao and Herfet, Thorsten and Grochulla, Martin and Thorm{\"a}hlen, Thorsten}, TITLE = {Audio-Visual Multiple Active Speaker Localisation in Reverberant Environments}, BOOKTITLE = {15th International Conference on Digital Audio Effects (DAFx-12)}, PADDRESS = {York, UK}, ADDRESS = {York, UK}, MONTH = {September}, YEAR = {2012}, PAGES = {1--8}, ABSTRACT = {Localisation of multiple active speakers in natural environments with only two microphones is a challenging problem. Reverberation degrades the performance of speaker localisation based exclusively on directional cues. This paper presents an approach based on audio-visual fusion. The audio modality performs the multiple speaker localisation using the {\em Skeleton} method, energy weighting, and precedence effect filtering and weighting. The video modality performs the active speaker detection based on the analysis of the lip region of the detected speakers. The audio modality alone has problems with localisation accuracy, while the video modality alone has problems with false detections. The estimation results of both modalities are represented as probabilities in the azimuth domain. A Gaussian fusion method is proposed to combine the estimates in a late stage. As a consequence, the localisation accuracy and robustness compared to the audio/video modality alone is significantly increased. Experimental results in different scenarios confirmed the improved performance of the proposed method.}, } @INPROCEEDINGS{Grosch2007, AUTHOR = {Grosch, Thorsten and Eble, Tobias and Mueller, Stefan}, EDITOR = {Spencer, Stephen N.}, TITLE = {Consistent Interactive Augmentation of Live Camera Images with Correct Near-field Illumination}, BOOKTITLE = {VRST 2007 (ACM Symposium on Virtual Reality Software and Technology)}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York}, ADDRESS = {Newport Beach, California, USA}, PUBLISHER = {ACM}, MONTH = {November}, ISBN = {978-1-59593-863-3}, YEAR = {2007}, PAGES = {125--132}, ABSTRACT = {Inserting virtual objects in real camera images with correct lighting is an active area of research. Current methods use a high dynamic range camera with a fish-eye lens to capture the incoming illumination. The main problem with this approach is the limitation to distant illumination. Therefore, the focus of our work is a real-time description of both near - and far-field illumination for interactive movement of virtual objects in the camera image of a real room. The daylight, which is coming in through the windows, produces a spatially varying distribution of indirect light in the room; therefore a near-field description of incoming light is necessary. Our approach is to measure the daylight from outside and to simulate the resulting indirect light in the room. To accomplish this, we develop a special dynamic form of the irradiance volume for real-time updates of indirect light in the room and combine this with importance sampling and shadow maps for light from outside. This separation allows object movements with interactive frame rates (10--17 fps). To verify the correctness of our approach, we compare images of synthetic objects with real objects.}, } @PHDTHESIS{Grosche2012, AUTHOR = {Grosche, Peter Matthias}, TITLE = {Signal Processing Methods for Beat Tracking, Music Segmentation, and Audio Retrieval}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {November}, YEAR = {2012}, ABSTRACT = {The goal of music information retrieval (MIR) is to develop novel strategies and techniques for organizing, exploring, accessing, and understanding music data in an efficient manner. The conversion of waveform-based audio data into semantically meaningful feature representations by the use of digital signal processing techniques is at the center of MIR and constitutes a difficult field of research because of the complexity and diversity of music signals. In this thesis, we introduce novel signal processing methods that allow for extracting musically meaningful information from audio signals. As main strategy, we exploit musical knowledge about the signals' properties to derive feature representations that show a significant degree of robustness against musical variations but still exhibit a high musical expressiveness. We apply this general strategy to three different areas of MIR: Firstly, we introduce novel techniques for extracting tempo and beat information, where we particularly consider challenging music with changing tempo and soft note onsets. Secondly, we present novel algorithms for the automated segmentation and analysis of folk song field recordings, where one has to cope with significant fluctuations in intonation and tempo as well as recording artifacts. Thirdly, we explore a cross-version approach to content-based music retrieval based on the query-by-example paradigm. In all three areas, we focus on application scenarios where strong musical variations make the extraction of musically meaningful information a challenging task. }, } @INPROCEEDINGS{GroscheM09_PLP_WASPAA, AUTHOR = {Grosche, Peter and M{\"u}ller, Meinard}, TITLE = {Computing predominant local periodicity information in music recordings}, BOOKTITLE = {2009 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics}, PADDRESS = {Piscataway, NJ}, ADDRESS = {New Paltz NY}, PUBLISHER = {IEEE}, ISBN = {978-1-4244-3679-8}, DOI = {10.1109/ASPAA.2009.5346544}, YEAR = {2009}, PAGES = {33--36}, } @INPROCEEDINGS{GroscheM09_Tempogram_ISMIR, AUTHOR = {Grosche, Peter and M{\"u}ller, Meinard}, TITLE = {A mid-level representation for capturing dominant tempo and pulse information in music recordings}, BOOKTITLE = {10th International Society for Music Information Retrieval Conference : ISMIR 2009}, PADDRESS = {s.l.}, ADDRESS = {Kobe, Japan}, PUBLISHER = {ISMIR}, YEAR = {2009}, PAGES = {189--194}, } @ARTICLE{GroscheM11_PredominantLocalPulseInformation_TASLP, AUTHOR = {Grosche, Peter and M{\"u}ller, Meinard}, JOURNAL = {IEEE Transactions on Audio, Speech, and Language Processing}, TITLE = {Extracting Predominant Local Pulse Information from Music Recordings}, ADDRESS = {Piscataway, NJ}, NUMBER = {6}, PUBLISHER = {IEEE}, VOLUME = {19}, DOI = {10.1109/TASL.2010.2096216}, YEAR = {2011}, PAGES = {1688--1701}, } @INPROCEEDINGS{GroscheMK10_TempogramCyclic_ICASSP, AUTHOR = {Grosche, Peter and M{\"u}ller, Meinard and Kurth, Frank}, EDITOR = {Scott, Douglas C.}, TITLE = {Cyclic Tempogram - a Mid-level Tempo Representation For Music Signals}, BOOKTITLE = {2010 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2010). - Pt. 7}, PADDRESS = {Piscataway, NJ.}, ADDRESS = {Dallas, Texas, USA}, PUBLISHER = {IEEE}, ISBN = {978-1-4244-4295-9}, DOI = {10.1109/ICASSP.2010.5495219}, YEAR = {2010}, PAGES = {5522--5525}, } @INPROCEEDINGS{GroscheMS10_BeatTrackingErrors_ISMIR, AUTHOR = {Grosche, Peter and M{\"u}ller, Meinard and Sapp, Craig Stuart}, EDITOR = {Downie, J. Stephen and Veltkamp, Remco C.}, TITLE = {What makes beat tracking difficult? {A} case study on {C}hopin {M}azurkas}, BOOKTITLE = {Proceedings of the 11th International Society for Music Information Retrieval Conference (ISMIR 2010)}, PADDRESS = {s.l.}, ADDRESS = {Utrecht, Netherlands}, PUBLISHER = {ISMIR}, ISBN = {978-90-393-53813}, YEAR = {2010}, PAGES = {649--654}, } @INPROCEEDINGS{GroscheMS12_ContentBasedMusicRetrieval_DagstuhlFU, AUTHOR = {Grosche, Peter and M{\"u}ller, Meinard and Serr{\`a}, Joan}, EDITOR = {M{\"u}ller, Meinard and Goto, Masataka and Schedl, Markus}, TITLE = {Audio Content-Based Music Retrieval}, BOOKTITLE = {Multimodal Music Processing}, PADDRESS = {Dagstuhl, Germany}, ADDRESS = {Dagstuhl, Germany}, PUBLISHER = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, SERIES = {Dagstuhl Follow-Ups}, VOLUME = {3}, YEAR = {2012}, PAGES = {157--174}, } @INPROCEEDINGS{GroscheMueller12_Fingerprints_ICASSP, AUTHOR = {Grosche, Peter and M{\"u}ller, Meinard}, TITLE = {Toward Musically-Motivated Audio Fingerprints}, BOOKTITLE = {Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Kyoto, Japan}, PUBLISHER = {IEEE}, YEAR = {2012}, PAGES = {93--96}, } @INPROCEEDINGS{GroscheMueller12_RetrievalShingles_ICASSP, AUTHOR = {Grosche, Peter and M{\"u}ller, Meinard}, TITLE = {Toward Characteristic Audio Shingles for Efficient Cross-Version Music Retrieval}, BOOKTITLE = {Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Kyoto, Japan}, PUBLISHER = {IEEE}, YEAR = {2012}, PAGES = {473--476}, } @INPROCEEDINGS{GroscheSMA12_StructureAudioFingerprint_ISMIR, AUTHOR = {Grosche, Peter and Serr{\`a}, Joan and M{\"u}ller, Meinard and Arcos, Josep Ll.}, TITLE = {Structure-based audio fingerprinting for music retrieval}, BOOKTITLE = {Proceedings of the 13th International Conference on Music Information Retrieval (ISMIR)}, PADDRESS = {Canada}, ADDRESS = {Porto, Portugal}, PUBLISHER = {International Society for Music Information Retrieval}, YEAR = {2012}, PAGES = {55--60}, } @ARTICLE{GroscheSMR12_Transcription_AAA, AUTHOR = {Grosche, Peter and Schuller, Bj{\"o}rn and M{\"u}ller, Meinard and Rigoll, Gerhard}, JOURNAL = {Acta Acustica united with Acustica}, TITLE = {Automatic Transcription of Recorded Music}, NUMBER = {2}, PUBLISHER = {Hirzel}, VOLUME = {98}, YEAR = {2012}, PAGES = {199--215}, } @INCOLLECTION{guenther12a, AUTHOR = {G{\"u}nther, David and Reininghaus, Jan and Prohaska, Steffen and Weinkauf, Tino and Hege, Hans-Christian}, EDITOR = {Peikert, Ronald and Hauser, Helwig and Car, Hamish and Fuchs, Raphael}, TITLE = {Efficient Computation of a Hierarchy of Discrete 3{D} Gradient Vector Fields}, BOOKTITLE = {Topological Methods in Data Analysis and Visualization II}, ADDRESS = {New York, NY}, PUBLISHER = {Springer}, SERIES = {Mathematics and VIsualization}, ISBN = {978-3-642-23174-2}, DOI = {10.1007/978-3-642-23175-9_2}, YEAR = {2012}, PAGES = {15--29}, ABSTRACT = {This paper introduces a novel combinatorial algorithm to compute a hierarchy of discrete gradient vector fields for three-dimensional scalar fields. The hierarchy is defined by an importance measure and represents the combinatorial gradient flow at different levels of detail. The presented algorithm is based on Forman’s discrete Morse theory, which guarantees topological consistency and algorithmic robustness. In contrast to previous work, our algorithm combines memory and runtime efficiency. It thereby lends itself to the analysis of large data sets. A discrete gradient vector field is also a compact representation of the underlying extremal structures – the critical points, separation lines and surfaces. Given a certain level of detail, an explicit geometric representation of these structures can be extracted using simple and fast graph algorithms.}, } @ARTICLE{guenther12b, AUTHOR = {G{\"u}nther, David and Seidel, Hans-Peter and Weinkauf, Tino}, JOURNAL = {Computer Graphics Forum}, TITLE = {Extraction of Dominant Extremal Structures in Volumetric Data Using Separatrix Persistence}, ADDRESS = {Oxford, UK}, NUMBER = {8}, PUBLISHER = {Blackwell}, MONTH = {December}, VOLUME = {31}, ISBN = {1467-8659}, DOI = {10.1111/j.1467-8659.2012.03222.x}, YEAR = {2012}, PAGES = {2554--2566}, ABSTRACT = {Extremal lines and surfaces are features of a 3D scalar field where the scalar function becomes minimal or maximal with respect to a local neighborhood. These features are important in many applications, e.g., computer tomography, fluid dynamics, cell biology. We present a novel topological method to extract these features using discrete Morse theory. In particular, we extend the notion of Separatrix Persistence from 2D to 3D, which gives us a robust estimation of the feature strength for extremal lines and surfaces. Not only does it allow us to determine the most important (parts of) extremal lines and surfaces, it also serves as a robust filtering measure of noise-induced structures. Our purely combinatorial method does not require derivatives or any other numerical computations.}, } @PHDTHESIS{guenther12phd, AUTHOR = {G{\"u}nther, David}, TITLE = {Topological Analysis of Discrete Scalar Data}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {December}, YEAR = {2012}, PAGES = {153}, ABSTRACT = {This thesis presents a novel computational framework that allows for a robust extraction and quantification of the Morse-Smale complex of a scalar field given on a 2- or 3-dimensional manifold. The proposed framework is based on Forman's discrete Morse theory, which guarantees the topological consistency of the computed complex. Using a graph theoretical formulation of this theory, we present an algorithmic library that computes the Morse-Smale complex combinatorially with an optimal complexity of $O(n^2)$ and efficiently creates a multi-level representation of it. We explore the discrete nature of this complex, and relate it to the smooth counterpart. It is often necessary to estimate the feature strength of the individual components of the Morse-Smale complex -- the critical points and separatrices. To do so, we propose a novel output-sensitive strategy to compute the persistence of the critical points. We also extend this wellfounded concept to separatrices by introducing a novel measure of feature strength called separatrix persistence. We evaluate the applicability of our methods in a wide variety of application areas ranging from computer graphics to planetary science to computer and electron tomography.}, } @ARTICLE{Guenther2009, AUTHOR = {Wald, Ingo and Mark, William R. and G{\"u}nther, Johannes and Boulos, Solomon and Ize, Thiago and Hunt, Warren and Parker, Steven G. and Sh{\'i}rley, Peter}, JOURNAL = {Computer Graphics Forum}, TITLE = {State of the Art in Ray Tracing Animated Scenes}, ADDRESS = {Oxford, UK}, NUMBER = {6}, PUBLISHER = {Blackwell}, VOLUME = {28}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2008.01313.x}, YEAR = {2009}, PAGES = {1691--1722}, } @ARTICLE{Guenther2012pld, AUTHOR = {G{\"u}nther, David and Reininghaus, Jan and Wagner, Hubert and Hotz, Ingrid}, JOURNAL = {The Visual Computer}, TITLE = {Efficient computation of 3{D} {M}orse-{S}male complexes and persistent homology using discrete {M}orse theory}, ADDRESS = {New York, NY}, NUMBER = {10}, PUBLISHER = {Springer}, MONTH = {October}, VOLUME = {28}, ISBN = {0178-2789}, DOI = {10.1007/s00371-012-0726-8}, YEAR = {2012}, PAGES = {959--969}, } @ARTICLE{Guenther2014, AUTHOR = {G{\"u}nther, Tobias and Schulze, Maik and {Martinez~Esturo}, Janick and R{\"o}ssl, Christian and Theisel, Holger}, JOURNAL = {Comput. Graph. Forum (Proc. EuroVis)}, TITLE = {Opacity Optimization for Surfaces}, NUMBER = {3}, VOLUME = {33}, YEAR = {2014}, } @INPROCEEDINGS{guenther:04:RTPM, AUTHOR = {G{\"u}nther, Johannes and Wald, Ingo and Slusallek, Philipp}, EDITOR = {Keller, Alexander and Jensen, Henrik Wann}, TITLE = {{Realtime} Caustics using Distributed Photon Mapping}, BOOKTITLE = {Rendering Techniques 2004 : Eurographics Symposium on Rendering}, ORGANIZATION = {Eurographics Association}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Norkoeping, Sweden}, PUBLISHER = {Eurographics}, MONTH = {June}, ISBN = {3-905673-12-6}, YEAR = {2004}, PAGES = {111--121}, ABSTRACT = {With the advancements in realtime ray tracing and new global illumination algorithms we are now able to render the most important illumination effects at interactive rates. One of the major remaining issues is the fast and efficient simulation of caustic illumination, such as e.g. the illumination from a car headlight. The photon mapping algorithm is a simple and robust approach that generates high-quality results and is the preferred algorithm for computing caustic illumination. However, photon mapping has a number of properties that make it rather slow on today s processors. Photon mapping has also been notoriously difficult to parallelize efficiently. In this paper, we present a detailed analysis of the performance issues of photon mapping together with signifi- cant performance improvements for all aspects of the photon mapping technique. The solution forms a complete framework for realtime photon mapping that efficiently combines realtime ray tracing, optimized and improved photon mapping algorithms, and efficient parallelization across commodity PCs. The presented system achieves realtime photon mapping performance of up to 22 frames per second on non-trivial scenes, while still allowing for interactively updating all aspects of the scene, including lighting, material properties, and geometry.}, } @INPROCEEDINGS{guenther:05:EAR, AUTHOR = {G{\"u}nther, Johannes and Chen, Tongbo and Goesele, Michael and Wald, Ingo and Seidel, Hans-Peter}, EDITOR = {Greiner, G{\"u}nther and Hornegger, Joachim and Niemann, Heinrich and Stamminger, Marc}, TITLE = {Efficient Acquisition and Realistic Rendering of Car Paint}, BOOKTITLE = {Vision, Modeling, and Visualization 2005 (VMV'05)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Erlangen, Germany}, PUBLISHER = {Aka}, MONTH = {November}, ISBN = {3-89838-068-8}, YEAR = {2005}, PAGES = {487--494}, ABSTRACT = {The outside appearance of cars is mostly defined through only two distinct materials -- glass and car paint. While glass can rather easily be simulated by the simple physical laws of reflection and refraction, modeling car paint is more challenging. In this paper we present a framework for the efficient acquisition and realistic rendering of real-world car paint. This is achieved by building an easy-to-reproduce measuring setup, fitting the measured data to a general BRDF model for car paint, adding a component for simulating the sparkling effect of metallic paints, and rendering using a specially designed shader in a realtime ray tracer.}, } @ARTICLE{guenther:06:IRTSA, AUTHOR = {G{\"u}nther, Johannes and Friedrich, Heiko and Seidel, Hans-Peter and Slusallek, Philipp}, JOURNAL = {The Visual Computer}, TITLE = {Interactive ray tracing of skinned animations}, BOOKTITLE = {Pacific Graphics 2006}, ADDRESS = {Secaucus, NJ, USA}, NUMBER = {9-11}, PUBLISHER = {Springer}, MONTH = {September}, SERIES = {The Visual Computer}, VOLUME = {22}, ISBN = {0178-2789}, YEAR = {2006}, PAGES = {785--792}, ABSTRACT = {Recent high-performance ray tracing implementations have already achieved interactive performance on a single PC even for highly complex scenes. However, so far these approaches have been limited to mostly static scenes due to the large cost of updating the necessary spatial index structures after modifying scene geometry. In this paper we present an approach that avoids these updates almost completely for the case of skinned models as typically used in computer games. We assume that the characters are built from meshes with an underlying skeleton structure, where the set of joint angles defines the character's pose and determines the skinning parameters. Based on a sampling of the possible pose space we build a static fuzzy kd-tree for each skeleton segment in a fast preprocessing step. This fuzzy kd-trees are then organized in a top-level kd-tree. Together with the skeleton's affine transformations this multi-level kd-tree allows for fast and efficient scene traversal at runtime while arbitrary combinations of animation sequences can be applied interactively to the joint angles. We achieve real-time ray tracing performance of up to 15 frames per second at $1024 \times 1024$ resolution even on a single processor core.}, } @ARTICLE{guenther:06:modecomp, AUTHOR = {G{\"u}nther, Johannes and Friedrich, Heiko and Wald, Ingo and Seidel, Hans-Peter and Slusallek, Philipp}, EDITOR = {Szirmay-Kalos, L{\'a}szl{\'o} and Gr{\"o}ller, Eduard}, JOURNAL = {Computer Graphics Forum}, TITLE = {Ray Tracing Animated Scenes using Motion Decomposition}, BOOKTITLE = {EUROGRAPHICS 2006 (EG'06)}, ADDRESS = {Oxford, UK}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, SERIES = {Computer Graphics Forum}, VOLUME = {25}, ISBN = {0167-7055}, YEAR = {2006}, PAGES = {517--525}, ABSTRACT = {Though ray tracing has recently become interactive, its high precomputation time for building spatial indices usually limits its applications to walkthroughs of static scenes. This is a major limitation, as most applications demand support for dynamically animated models. In this paper, we present a new approach to ray trace a special but important class of dynamic scenes, namely models whose connectivity does not change over time and for which the space of all possible poses is known in advance. We support these kinds of models by introducing two new concepts: primary motion decomposition, and fuzzy kd-trees. We analyze the space of poses and break the model down into submeshes with similar motion. For each of these submeshes and for every time step, we calculate a best affine transformation through a least square approach. Any residual motion is then captured in a {\bf single} ``fuzzy kd-tree'' for the entire animation. Together, these techniques allow for ray tracing animations {\em without} rebuilding the spatial index structures for the submeshes, resulting in interactive frame rates of 5 to 15 fps even on a single CPU.}, } @INPROCEEDINGS{guenther:07:BVHonGPU, AUTHOR = {G{\"u}nther, Johannes and Popov, Stefan and Seidel, Hans-Peter and Slusallek, Philipp}, EDITOR = {Keller, Alexander and Christensen, Per}, TITLE = {Realtime Ray Tracing on GPU with BVH-based Packet Traversal}, BOOKTITLE = {IEEE/Eurographics Symposium on Interactive Ray Tracing 2007}, ORGANIZATION = {IEEE, Eurographics}, PADDRESS = {Piscataway, USA}, ADDRESS = {Ulm, Germany}, PUBLISHER = {IEEE}, YEAR = {2007}, PAGES = {113--118}, ABSTRACT = {Recent GPU ray tracers can already achieve performance competitive to that of their CPU counterparts. Nevertheless, these systems can not yet fully exploit the capabilities of modern GPUs and can only handle medium-sized, static scenes. In this paper we present a BVH-based GPU ray tracer with a parallel packet traversal algorithm using a shared stack. We also present a fast, CPU-based BVH construction algorithm which very accurately approximates the surface area heuristic using streamed binning while still being one order of magnitude faster than previously published results. Furthermore, using a BVH allows us to push the size limit of supported scenes on the GPU: We can now ray trace the 12.7~million triangle \textsc{Power Plant} at 1024$\times$1024 image resolution with 3~fps, including shading and shadows.}, } @INPROCEEDINGS{Gumhold-ik05, AUTHOR = {Gumhold, Stefan and Karni, Zachi and Isenburg, Martin and Seidel, Hans-Peter}, TITLE = {Predictive Point-Cloud Compression}, BOOKTITLE = {Proceedings of the Sixth Israel-Korea Bi-National Conference}, PADDRESS = {Haifa, Israel}, ADDRESS = {Haifa, Israel}, PUBLISHER = {Technion}, YEAR = {2005}, PAGES = {125--129}, } @INPROCEEDINGS{Gumhold-sig05s, AUTHOR = {Gumhold, Stefan and Karni, Zachi and Isenburg, Martin and Seidel, Hans-Peter}, TITLE = {Predictive Point-Cloud Compression}, BOOKTITLE = {SIGGRAPH 2005 Technical Sketches}, PADDRESS = {USA}, ADDRESS = {Los Angeles, USA}, PUBLISHER = {ACM}, YEAR = {2005}, } @INPROCEEDINGS{Gumhold2004, AUTHOR = {Gumhold, Stefan}, EDITOR = {Girod, Bernd and Magnor, Marcus and Seidel, Hans-Peter}, TITLE = {Hierarchical Shape-Adaptive Quantization for Geometry Compression}, BOOKTITLE = {Vision, modeling, and visualization 2004 (VMV-04)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Stanford, USA}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, MONTH = {November}, ISBN = {3-89838-058-0}, YEAR = {2004}, PAGES = {293--298}, ABSTRACT = {The compression of polygonal mesh geometry is still an active field of research as in 3d no theoretical bounds are known. This work proposes a geometry coding method based on predictive coding. Instead of using the vertex to vertex distance as distortion measurement, an approximation to the Hausdorffdistance is used resulting in additional degrees of freedom. These are exploited by a new adaptive quantization approach, which is independent of the encoding order. The achieved compression rates are similar to those of entropy based optimization but with a significantly faster compression performance.}, } @INPROCEEDINGS{Gumhold2005, AUTHOR = {Gumhold, Stefan}, TITLE = {Optimizing Markov Models with Applications to Triangular Connectivity Coding}, BOOKTITLE = {Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05)}, ORGANIZATION = {ACM, SIAM}, PADDRESS = {Philadelphia, USA}, ADDRESS = {Vancouver, Canada}, PUBLISHER = {SIAM}, MONTH = {January}, ISBN = {0-89871-585-7}, YEAR = {2005}, PAGES = {331--338}, } @ARTICLE{Gumhold2005VDPM, AUTHOR = {Gumhold, Stefan}, JOURNAL = {Computer Aided Geometric Design}, TITLE = {Truly Selective Polygonal Mesh Hierarchies with Error Control}, NUMBER = {5}, VOLUME = {22}, YEAR = {2005}, PAGES = {424--443}, } @INPROCEEDINGS{Haber2009, AUTHOR = {Seidel, Hans-Peter}, TITLE = {Relighting Objects from Image Collections}, BOOKTITLE = {2009 IEEE Conference on Computer Vision and Pattern Recognition : CVPR 2009}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Miami, Florida}, PUBLISHER = {IEEE}, ISBN = {978-1-4244-3992-8}, DOI = {10.1109/CVPR.2009.5206753}, YEAR = {2009}, PAGES = {627--634}, } @TECHREPORT{HaberSchmittKosterSeidel2004, AUTHOR = {Haber, J{\"o}rg and Schmitt, Carina and Koster, Martin and Seidel, Hans-Peter}, TITLE = {Modeling Hair using a Wisp Hair Model}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, TYPE = {Research Report}, ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-2004-4-001}, PUBLISHER = {AG 4 - Seidel}, MONTH = {May}, ISBN = {0946-011X}, YEAR = {2004}, PAGES = {40}, ABSTRACT = {We describe a tool for interactively designing virtual hairstyles. The underlying hair model is efficient enough to render different hairstyles in real time. One of the major problems of modeling human hair is the large number of hair strands in a hairstyle. Despite of increasing hardware and graphics performance, it is still difficult to display about 100,000 hair strands at a sufficient speed for real time applications. Our approach to this problem is to combine single hair strands to hair wisps. Each hair wisp is represented by a 2D triangle strip that is textured with color and alpha maps. To achieve a higher degree of realism, our modeling system takes into account both hair-head collisions and hair-hair collisions.}, } @PHDTHESIS{Haber:1999:BIWAK, AUTHOR = {Haber, J{\"o}rg}, TITLE = {{Konstruktion und Implementierung eines neuen Verfahrens zur Kompression von Bilddaten}}, SCHOOL = {Technische Universit{\"a}t M{\"u}nchen}, TYPE = {Doctoral dissertation}, ADDRESS = {Munich, Germany}, PUBLISHER = {Herbert Utz}, MONTH = {May}, YEAR = {1999}, NOTE = {ISBN: 3-89675-576-5}, } @INPROCEEDINGS{Haber:2001:F2F, AUTHOR = {Haber, J{\"o}rg and K{\"a}hler, Kolja and Albrecht, Irene and Yamauchi, Hitoshi and Seidel, Hans-Peter}, TITLE = {{Face to Face: From Real Humans to Realistic Facial Animation}}, BOOKTITLE = {Proceedings of the 3rd Israel-Korea Binational Conference on Geometrical Modeling and Computer Graphics}, PADDRESS = {Seoul, Korea}, ADDRESS = {Seoul, Korea}, PUBLISHER = {Kyung Moon}, MONTH = {October}, ISBN = {89-7282-527-1}, YEAR = {2001}, PAGES = {73--82}, ABSTRACT = {We present a system for photo-realistic facial modeling and animation, which includes several tools that facilitate necessary tasks such as mesh processing, texture registration, and assembling of facial components. The resulting head model reflects the anatomical structure of the human head including skull, skin, and muscles. Semiautomatic generation of high-quality models from scan data for physics-based animation becomes possible with little effort. A state-of-the-art speech synchronization technique is integrated into our system, resulting in realistic speech animations that can be rendered at real-time frame rates on current PC hardware.}, } @INPROCEEDINGS{Haber:2001:PGCS, AUTHOR = {Haber, J{\"o}rg and Myszkowski, Karol and Yamauchi, Hitoshi and Seidel, Hans-Peter}, EDITOR = {Chalmers, Alan and Rhyne, Theresa-Marie}, TITLE = {{Perceptually Guided Corrective Splatting}}, BOOKTITLE = {The European Association for Computer Graphics 22th Annual Conference: EUROGRAPHICS 2001}, ORGANIZATION = {Eurographics}, PADDRESS = {Oxford, UK}, ADDRESS = {Manchester, UK}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {20(3)}, ISBN = {0167-7055}, YEAR = {2001}, PAGES = {C142--C152}, ABSTRACT = { One of the basic difficulties with interactive walkthroughs is the high quality rendering of object surfaces with non-diffuse light scattering characteristics. Since full ray tracing at interactive rates is usually impossible, we render a precomputed global illumination solution using graphics hardware and use remaining computational power to correct the appearance of non-diffuse objects on-the-fly. The question arises, how to obtain the best image quality as perceived by a human observer within a limited amount of time for each frame. We address this problem by enforcing corrective computation for those non-diffuse objects that are selected using a computational model of visual attention. We consider both the saliency- and task-driven selection of those objects and benefit from the fact that shading artifacts of ``unattended'' objects are likely to remain unnoticed. We use a hierarchical image-space sampling scheme to control ray tracing and splat the generated point samples. The resulting image converges progressively to a ray traced solution if the viewing parameters remain unchanged. Moreover, we use a sample cache to enhance visual appearance if the time budget for correction has been too low for some frame. We check the validity of the cached samples using a novel criterion suited for non-diffuse surfaces and reproject valid samples into the current view.}, } @INPROCEEDINGS{Haber:2001:SARLSDS, AUTHOR = {Haber, J{\"o}rg and Zeilfelder, Frank and Davydov, Oleg and Seidel, Hans-Peter}, EDITOR = {Ertl, Thomas and Joy, Ken and Varshney, Amitabh}, TITLE = {{Smooth Approximation and Rendering of Large Scattered Data Sets}}, BOOKTITLE = {Proceedings of IEEE Visualization 2001}, ORGANIZATION = {IEEE Computer Society}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {San Diego, USA}, PUBLISHER = {IEEE}, MONTH = {October}, ISBN = {0-7803-7200-X}, YEAR = {2001}, PAGES = {341--347;571}, ABSTRACT = { We present an efficient method to automatically compute a smooth approximation of large functional scattered data sets given over arbitrarily shaped planar domains. Our approach is based on the construction of a $C^1$-continuous bivariate cubic spline and our method offers optimal approximation order. Both local variation and non-uniform distribution of the data are taken into account by using local polynomial least squares approximations of varying degree. Since we only need to solve small linear systems and no triangulation of the scattered data points is required, the overall complexity of the algorithm is linear in the total number of points. Numerical examples dealing with several real world scattered data sets with up to millions of points demonstrate the efficiency of our method. The resulting spline surface is of high visual quality and can be efficiently evaluated for rendering and modeling. In our implementation we achieve real-time frame rates for typical fly-through sequences and interactive frame rates for recomputing and rendering a locally modified spline surface.}, } @PROCEEDINGS{Haber:2002:FAMtut, AUTHOR = {Haber, J{\"o}rg and Magnenat-Thalmann, Nadia and Terzopoulos, Demetri and Vetter, Thomas and Blanz, Volker and K{\"a}hler, Kolja}, EDITOR = {Haber, J{\"o}rg and Magnenat-Thalmann, Nadia and Terzopoulos, Demetri and Vetter, Thomas and Blanz, Volker and K{\"a}hler, Kolja}, TITLE = {{Facial Modeling and Animation - Eurographics 2002 Tutorial Notes}}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Eurographics}, MONTH = {September}, VOLUME = {T2}, ISBN = {1017-4565}, YEAR = {2002}, PAGES = {137}, } @BOOK{Haber:2003:FAMtut, AUTHOR = {Haber, J{\"o}rg and Terzopoulos, Demetri and Magnenat-Thalmann, Nadia and Blanz, Volker}, EDITOR = {Hubbold, Roger and Ureña, Carlos and Vinacua, Alvar}, TITLE = {Facial Modeling and Animation - {Eurographics} 2003 {Tutorial} {Notes}}, ADDRESS = {-}, PUBLISHER = {Eurographics}, MONTH = {September}, ISBN = {1017-4656}, YEAR = {2003}, PAGES = {131}, ABSTRACT = {In this tutorial we present an overview of the concepts and current techniques that have been developed to model and animate human faces. We introduce the research area of facial modeling and animation by its history and applications. As a necessary prerequisite for facial modeling, data acquisition is discussed in detail. We describe basic concepts of facial animation and present different approaches including parametric models, performance-, physics-, and image-based methods. State-of-the-art techniques such as MPEG-4 facial animation parameters, mass-spring networks for skin models, and face space representations are part of these approaches. We furthermore discuss texturing of head models and rendering of skin and hair, addressing problems related to texture synthesis, bump mapping with graphics hardware, and dynamics of hair. Typical applications for facial modeling and animation such as speech synchronization, head morphing, and forensic applications are presented and explained.}, } @INPROCEEDINGS{Haber:COH, AUTHOR = {Haber, J{\"o}rg and Stamminger, Marc and Seidel, Hans-Peter}, EDITOR = {Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {{Customized Object Hierarchies}}, BOOKTITLE = {{Proceedings of Vision, Modeling, and Visualization (VMV-00)}}, PADDRESS = {Berlin, Germany}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, MONTH = {November}, ISBN = {3-89838-019-X}, YEAR = {2000}, PAGES = {255--262}, ABSTRACT = {Object hierarchies are useful for different rendering applications. In hierarchical radiosity, for instance, the quality of lighting simulations can be improved through well-adapted object hierarchies. Using a different criterion for constructing the hierarchies may lead to significant speed-ups for typical ray tracing applications. In this paper we introduce a new method for automatically creating object hierarchies. Our algorithm inserts all scene objects sequentially into the hierarchy created so far. The insertion decision is based on a user-defined cost function. Thus the algorithm can be guided to create customized object hierarchies appropriate to the desired application. In addition, a global optimization may be used to improve the completed hierarchy even further. During this optimization step ill-formed groups are eliminated by breaking up or splitting. The results obtained with our method demonstrate the benefit of customized hierarchies over traditional ones. }, } @INPROCEEDINGS{Haber:EACMPOH, AUTHOR = {Haber, J{\"o}rg and Stamminger, Marc and Seidel, Hans-Peter}, EDITOR = {Barsky, Brian A. and Shinagawa, Yoshihisa and Wang, Wenping}, TITLE = {{Enhanced Automatic Creation of Multi-Purpose Object Hierarchies}}, BOOKTITLE = {{Proceedings of the 8th Pacific Conference on Computer Graphics and Applications (PG-00)}}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Hong Kong, China}, PUBLISHER = {IEEE}, MONTH = {October}, ISBN = {0-7695-0868-5}, YEAR = {2000}, PAGES = {52--61;437}, ABSTRACT = {Using well-adapted object hierarchies can support the rendering of large scenes in different ways. For instance, the quality of the lighting simulation may be improved, or the computational cost for rendering may be reduced. However, the meaning of ``well-adapted'' depends heavily on the criterion due to which the hierarchy has been constructed. Different applications typically have different demands like low average intersection cost for a ray tracer or grouping objects with similar material properties or surface orientation for hierarchical radiosity. In this paper we propose a new algorithm for the automatic creation of object hierarchies. The hierarchies are constructed by sequentially inserting all scene objects into the hierarchy created so far. By basing the insertion decision on a cost function defined by the user, the method can be guided to create hierarchies tailored to the desired application. The results can be improved significantly by running a global optimization on the completed hierarchy. During this optimization step we perform a re-grouping of the objects in the hierarchy. Any ill-formed groups that were created during the initial algorithm are subject to being eliminated by our global optimization.}, } @INPROCEEDINGS{Haber:ILBG, AUTHOR = {Haber, J{\"o}rg and Seidel, Hans-Peter}, TITLE = {{Using an Enhanced LBG Algorithm to Reduce the Codebook Error inVector Quantization}}, BOOKTITLE = {{Proceedings of Computer Graphics International 2000 (CGI-00)}}, ORGANIZATION = {Computer Graphics Society (CGS)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Geneva, Switzerland}, PUBLISHER = {IEEE}, MONTH = {June}, ISBN = {0-7695-0643-7}, YEAR = {2000}, PAGES = {99--104}, ABSTRACT = {In this paper we present a modification of the well-known LBG algorithm for the generation of codebooks in vector quantization. Our algorithm, denoted as the ILBG algorithm, reduces the codebook error of the LBG algorithm drastically in typical applications. In our experiments we were able to achieve up to 75\,\% reduction of the codebook error in only a few additional iteration steps. In the context of lossy image compression this error reduction leads to an increase of\/ 2--3~dB of the peak-signal-to-noise-ratio (PSNR) in turn.}, } @INCOLLECTION{Haber:Medusa, AUTHOR = {Haber, J{\"o}rg}, EDITOR = {Plesser, Theo and Macho, Volker}, TITLE = {{MEDUSA} - A Facial Modeling and Animation System}, BOOKTITLE = {Forschung und wissenschaftliches Rechnen - Beitr{\"a}ge zum Heinz-Billing-Preis 2001}, ADDRESS = {G{\"o}ttingen, Germany}, NUMBER = {58}, PUBLISHER = {Gesellschaft f{\"u}r Wissenschaftliche Datenverarbeitung G{\"o}ttingen}, ISBN = {0176-2516}, YEAR = {2003}, PAGES = {13--28}, } @ARTICLE{Haber:PBSTP, AUTHOR = {Haber, J{\"o}rg and Magnor, Marcus and Seidel, Hans-Peter}, JOURNAL = {Transactions on Graphics}, TITLE = {Physically based Simulation of Twilight Phenomena}, ADDRESS = {New York, USA}, NUMBER = {4}, PUBLISHER = {ACM}, MONTH = {October}, VOLUME = {24}, ISBN = {0730-0301}, YEAR = {2005}, PAGES = {1353--1373}, ABSTRACT = {We present a physically based approach to compute the colors of the sky during the twilight period before sunrise and after sunset. The simulation is based on the theory of light scattering by small particles. A realistic atmosphere model is assumed, consisting of air molecules, aerosols, and water. Air density, aerosols, and relative humidity vary with altitude. In addition, the aerosol component varies in composition and particle size distribution. This allows us to realistically simulate twilight phenomena for a wide range of different climate conditions. Besides considering multiple Rayleigh and Mie scattering, we take into account wavelength-dependent refraction of direct sunlight as well as the shadow of the Earth. Incorporating several optimizations into the radiative transfer simulation, a photo-realistic hemispherical twilight sky is computed in less than two hours on a conventional PC. The resulting radiometric data is useful, for instance, for high-dynamic range environment mapping, outdoor global illumination calculations, mesopic vision research and optical aerosol load probing.}, } @BOOK{CDROM-Haber:SIGCOURSE2004, AUTHOR = {Haber, J{\"o}rg and Terzopoulos, Demetri and Parke, Frederic I. and Williams, Lance and Blanz, Volker and Borshukov, George}, TITLE = {Course 5: {Facial} Modeling and Animation}, BOOKTITLE = {ACM SIGGRAPH 2004 Full Conference DVD-ROM : DISC 1, Art Gallery - Papers ; Courses}, ORGANIZATION = {ACM SIGGRAPH}, ADDRESS = {New York, USA}, PUBLISHER = {ACM}, MONTH = {August}, ISBN = {1-581-13896-2}, YEAR = {2004}, PAGES = {140}, } @MISC{handsonor2013, AUTHOR = {Sridhar, Srinath}, TITLE = {HandSonor: A Customizable Vision-based Control Interface for Musical Expression}, HOWPUBLISHED = {Extended Abstract, CHI 2013}, MONTH = {April}, ISBN = {978-1-4503-1952-2/13/04}, YEAR = {2013}, PAGES = {1--6}, ABSTRACT = {The availability of electronic audio synthesizers has led to the development of many novel control interfaces for music synthesis. The importance of the human hand as a communication channel makes it a natural candidate for such a control interface. In this paper I present HandSonor, a novel non-contact and fully customizable control interface that uses the motion of the hand for music synthesis. HandSonor uses images from multiple cameras to track the realtime, articulated 3D motion of the hand without using markers or gloves. I frame the problem of transforming hand motion into music as a parameter mapping problem for a range of instruments. I have built a graphical user interface (GUI) to allow users to dynamically select instruments and map the corresponding parameters to the motion of the hand. I present results of hand motion tracking, parameter mapping and realtime audio synthesis which show that users can play music using HandSonor.}, } @TECHREPORT{HangelbroekNuernbergerRoesslSeidelZeilfelder2003, AUTHOR = {Hangelbroek, Thomas and N{\"u}rnberger, G{\"u}nther and R{\"o}ssl, Christian and Seidel, Hans-Peter and Zeilfelder, Frank}, TITLE = {The Dimension of C^1 Splines of Arbitrary Degree on a Tetrahedral Partition}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Saarbr{\"u}cken}, NUMBER = {MPI-I-2003-4-005}, MONTH = {April}, YEAR = {2003}, PAGES = {39}, } @INPROCEEDINGS{HasAsbRosOhmSei06, AUTHOR = {Hasler, Nils and Asbach, Mark and Rosenhahn, Bodo and Ohm, Jens-Rainer and Seidel, Hans-Peter}, EDITOR = {Kobbelt, Leif and Kuhlen, Torsten and Aach, Til and Westermann, R{\"u}diger}, TITLE = {Physically Based Tracking of Cloth}, BOOKTITLE = {11th International Fall Workshop on Vision, Modeling, and Visualization 2006 ({VMV} 2006)}, ORGANIZATION = {European Association for Computer Graphics (Eurographics)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Aachen, Germany}, PUBLISHER = {IOS}, MONTH = {November}, ISBN = {1-58603-688-2}, YEAR = {2006}, PAGES = {49--56}, ABSTRACT = {In this work a method for tracking fabrics in videos is proposed which, unlike most other cloth tracking algorithms, employs an analysis-by-synthesis approach. That is tracking consists of optimising a set of parameters of a mass-sp ring model that is used to simulate the textile, defining on the one hand the fabric properties and on the other the positions of a limited number of constrained points of the simulated cloth. To improve the tracking accuracy and to overcome the inherently chaotic behaviour of the real fabric several methods to track features on the cloth's surfa ce and the best way to influence the simulation are evaluated.}, } @INPROCEEDINGS{HasHas07, AUTHOR = {Hasler, Nils and Hasler, Klaus-Peter}, EDITOR = {Hamprecht, Fred and Schn{\"o}rr, Christoph and J{\"a}hne, Bernd}, TITLE = {Short-Term Tide Prediction}, BOOKTITLE = {Pattern Recognition : 29th DAGM Symposium}, PADDRESS = {Berlin, Germany}, ADDRESS = {Heidelberg, Germany}, PUBLISHER = {Springer}, MONTH = {September}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4713}, ISBN = {3-540-74933-2}, DOI = {10.1007/978-3-540-74936-3}, YEAR = {2007}, PAGES = {375--384}, ABSTRACT = {Ever since the first fishermen ventured into the sea, tides have been the subject of intense human observation. As a result computational models and `tide predicting ma chines', mechanical computers for predicting tides have been developed over 100 year s ago. In this work we propose a statistical model for short-term prediction of sea levels at high tide in the tide influenced part of the Weser at Vegesack. The predic tions are made based on water level measurements taken at different locations downri ver and in the German Bight. The system has been integrated tightly into the decisio n making process at the Bremen Dike Association on the Right Bank of the Weser.}, } @INPROCEEDINGS{Hasler2007, AUTHOR = {Hasler, Nils and Rosenhahn, Bodo and Asbach, Mark and Ohm, Jens-Rainer and Seidel, Hans-Peter}, TITLE = {An Analysis-by-Synthesis Approach to Tracking of Textiles}, BOOKTITLE = {IEEE Workshop on Motion and Video Computing ({WMVC} 2007)}, ORGANIZATION = {IEEE}, PADDRESS = {Los Alamitos, CA, USA}, ADDRESS = {Austin, USA}, PUBLISHER = {IEEE Computer Society}, MONTH = {February}, VOLUME = {0}, YEAR = {2007}, PAGES = {25}, ABSTRACT = {Despite strong interest in cloth simulation on the one hand and tracking of deformable objects on the other, little effort has been put into tracking cloth motion by modelling the fabric. Here, an analysis-by-synthesis approach to tracking textiles is proposed which, by fitting a simulated textile to a set of contours, is able to reconstruct the 3D-cloth configuration. Fitting is accomplished by optimising the parameters of the mass-spring model that is used to simulate the textile as well as the positions of a limited number of constrained points. To improve tracking accuracy and to overcome the inherently chaotic behaviour of the real fabric several techniques for tracking features on the cloth's surface and the best way for them to influence the simulation are evaluated.}, } @ARTICLE{Hasler2009, AUTHOR = {Hasler, Nils and Stoll, Carsten and Sunkel, Martin and Rosenhahn, Bodo and Seidel, Hans-Peter}, EDITOR = {Dutr{\'e}, Philip and Stamminger, Marc}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS 2009)}, TITLE = {A Statistical Model of Human Pose and Body Shape}, BOOKTITLE = {The European Association for Computer Graphics 30th Annual Conference : EUROGRAPHICS 2009}, ADDRESS = {Oxford}, NUMBER = {2}, PUBLISHER = {Blackwell}, MONTH = {March}, SERIES = {Computer Graphics Forum}, VOLUME = {28}, YEAR = {2009}, PAGES = {337--346}, ABSTRACT = {Generation and animation of realistic humans is an essential part of many projects in today’s media industry. Especially, the games and special effects industry heavily depend on realistic human animation. In this work a unified model that describes both, human pose and body shape is introduced which allows us to accurately model muscle deformations not only as a function of pose but also dependent on the physique of the subject. Coupled with the model’s ability to generate arbitrary human body shapes, it severely simplifies the generation of highly realistic character animations. A learning based approach is trained on approximately 550 full body 3D laser scans taken of 114 subjects. Scan registration is performed using a non-rigid deformation technique. Then, a rotation invariant encoding of the acquired exemplars permits the computation of a statistical model that simultaneously encodes pose and body shape. Finally, morphing or generating meshes according to several constraints simultaneously can be achieved by training semantically meaningful regressors.}, } @INPROCEEDINGS{Hasler2010Multilinear, AUTHOR = {Hasler, Nils and Ackermann, Hanno and Rosenhahn, Bodo and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter}, TITLE = {Multilinear Pose and Body Shape Estimation of Dressed Subjects from Image Sets}, BOOKTITLE = {2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010). - Pt. 3}, PADDRESS = {Piscataway, NJ}, ADDRESS = {San Francisco, USA}, PUBLISHER = {IEEE}, MONTH = {June}, ISBN = {978-1-424-46984-0}, DOI = {10.1109/CVPR.2010.5539853}, YEAR = {2010}, PAGES = {1823--1830}, } @INPROCEEDINGS{Hasler2012, AUTHOR = {Ye, G. and Liu, Yebin and Hasler, Nils and Ji, X. and Dai, Q. and Theobalt, Christian}, EDITOR = {Fitzgibbon, A. and Lazebnik, S. and Perona, P. and Sato, Y. and Schmid, C.}, TITLE = {Performance Capture of Interacting Characters with Handheld Kinects}, BOOKTITLE = {12th European Conference on Computer Vision (ECCV)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Firenze, Italia}, PUBLISHER = {Springer}, MONTH = {October}, YEAR = {2012}, PAGES = {828--841}, } @PHDTHESIS{HaslerPhD2010, AUTHOR = {Hasler, Nils}, TITLE = {Modelling human pose and shape based on a database of human {3D} scans}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {June}, YEAR = {2010}, PAGES = {106}, } @INPROCEEDINGS{HasRosSei07, AUTHOR = {Hasler, Nils and Rosenhahn, Bodo and Seidel, Hans-Peter}, EDITOR = {Gagalowicz, Andr{\'e} and Philips, Wilfried}, TITLE = {Reverse Engineering Garments}, BOOKTITLE = {Computer Vision/Computer Graphics Collaboration Techniques : Third International Conference; {MIRAGE} 2007}, PADDRESS = {Berlin, Germany}, ADDRESS = {Rocquencourt, France}, PUBLISHER = {Springer}, MONTH = {March}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4418}, ISBN = {3-540-71456-1}, DOI = {10.1007/978-3-540-71457-6_19}, YEAR = {2007}, PAGES = {200--211}, ABSTRACT = {Segmenting garments from humanoid meshes or point clouds is a challenging problem with applications in the textile industry and in model based motion capturing. In this work we present a physically based template-matching technique for the automatic extraction of garment dimensions from 3D meshes or point clouds of dressed humans. The successfull identification of garment dimensions also allows the semantic segmentation of the mesh into naked and dressed parts.}, } @INPROCEEDINGS{HasRosThoWanGalSei09Audio, AUTHOR = {Hasler, Nils and Rosenhahn, Bodo and Thorm{\"a}hlen, Thorsten and Wand, Michael and Gall, J{\"u}rgen and Seidel, Hans-Peter}, TITLE = {Markerless Motion Capture with Unsynchronized Moving Cameras}, BOOKTITLE = {2009 IEEE Conference on Computer Vision and Pattern Recognition : CVPR 2009}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Miami, USA}, PUBLISHER = {IEEE}, MONTH = {June}, ISBN = {978-1-4244-3992-8}, DOI = {10.1109/CVPRW.2009.5206859}, YEAR = {2009}, PAGES = {224--231}, ABSTRACT = {In this work we present an approach for markerless motion capture (MoCap) of articulated objects, which are recorded with multiple unsynchronized moving cameras. Instead of using fixed (and expensive) hardware synchronized cameras, this approach allows us to track people with off-the-shelf handheld video ca\-me\-ras. To prepare a sequence for motion capture, we first reconstruct the static background and the position of each camera using Structure-from-Motion (SfM). Then the cameras are registered to each other using the reconstructed static background geometry. Camera synchronization is achieved via the audio streams recorded by the ca\-me\-ras in parallel. Finally, a markerless MoCap approach is applied to recover positions and joint configurations of subjects. Feature tracks and dense background geometry are further used to stabilize the MoCap. The ex\-pe\-ri\-ments show examples with highly challenging indoor and outdoor scenes.}, } @ARTICLE{HasStoThoRosSei09HiddenBody, AUTHOR = {Hasler, Nils and Stoll, Carsten and Thorm{\"a}hlen, Thorsten and Rosenhahn, Bodo and Seidel, Hans-Peter}, JOURNAL = {Computers \& Graphics}, TITLE = {Estimating Body Shape of Dressed Humans}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {3}, PUBLISHER = {Elsevier}, VOLUME = {33}, ISBN = {0097-8493}, DOI = {10.1016/j.cag.2009.03.026}, YEAR = {2009}, PAGES = {211--216}, ABSTRACT = {The paper presents a method to estimate the detailed 3D body shape of a person even if heavy or loose clothing is worn. The approach is based on a space of human shapes, learned from a large database of registered body scans. Together with this database we use as input a 3D scan or model of the person wearing clothes and apply a fitting method, based on ICP (iterated closest point) registration and Laplacian mesh deformation. The statistical model of human body shapes enforces that the model stays within the space of human shapes. The method therefore allows us to compute the most likely shape and pose of the subject, even if it is heavily occluded or body parts are not visible. Several experiments demonstrate the applicability and accuracy of our approach to recover occluded or missing body parts from 3D laser scans.}, } @INPROCEEDINGS{HasThoRosSei10Skeleton, AUTHOR = {Hasler, Nils and Thorm{\"a}hlen, Thorsten and Rosenhahn, Bodo and Seidel, Hans-Peter}, EDITOR = {Varshney, Amitabh and Wyman, Chris and Aliaga, Daniel and Oliveira, Manuel M.}, TITLE = {Learning Skeletons for Shape and Pose}, BOOKTITLE = {Proceedings I3D 2010 : ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, NY}, ADDRESS = {Washington DC, USA}, PUBLISHER = {ACM}, MONTH = {February}, ISBN = {978-1-60558-939-8}, DOI = {10.1145/1730804.1730809}, YEAR = {2010}, PAGES = {23--30}, } @PROCEEDINGS{Hauth_et_al_02, AUTHOR = {Hauth, Michael and Etzmuss, Olaf and Eberhardt, Bernd and Klein, Reinhard and Sarlette, Ralf and Sattler, Mirko and Daubert, Katja and Kautz, Jan}, EDITOR = {Hauth, Michael and Etzmuss, Olaf and Eberhardt, Bernd and Klein, Reinhard and Sarlette, Ralf and Sattler, Mirko and Daubert, Katja and Kautz, Jan}, TITLE = {{Cloth Animation and Rendering -- Eurographics 2002 Tutorial Notes}}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Eurographics}, MONTH = {September}, VOLUME = {T3}, ISBN = {1017-4565}, YEAR = {2002}, PAGES = {36}, } @ARTICLE{Havran2001, AUTHOR = {Havran, Vlastimil and Bittner, Jiri}, JOURNAL = {Journal of WSCG}, TITLE = {On Improving KD-Trees for Ray Shooting}, ADDRESS = {Czech Republic}, NUMBER = {1}, PUBLISHER = {University of West Bohemia}, MONTH = {February}, VOLUME = {10}, ISBN = {1213-6972}, YEAR = {2002}, PAGES = {209--216}, ABSTRACT = {Efficient ray shooting algorithm is inherently required by many computer graphics algorithms, particularly in image synthesis. Practical ray shooting algorithms aiming at the average-case complexity use some underlying spatial data structure such as $kd$-tree. We show the new termination criteria algorithm that improves the space and time complexity of the $kd$-tree construction. It provides efficient ray-shooting queries and does not require any specific constants from a user. Further, we show how to apply a novel clipping algorithm into the $kd$-tree within construction phase in order to improve its properties.}, } @INPROCEEDINGS{Havran2002:SCCG, AUTHOR = {Szirmay-Kalos, L{\'a}szl{\'o} and Havran, Vlastimil and Bal{\'a}zs, Benedek and Sz{\'e}csi, L{\'a}szl{\'o}}, EDITOR = {Chalmers, Alan}, TITLE = {On the Efficiency of Ray-shooting Acceleration Schemes}, BOOKTITLE = {Proceedings of the 18th Spring Conference on Computer Graphics (SCCG 2002)}, PADDRESS = {New York, USA}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {ACM Siggraph}, ISBN = {1-58113-608-0}, YEAR = {2002}, PAGES = {89--98}, ABSTRACT = {This paper examines the efficency of different ray-shooting acceleration schemes, including the uniform space subdivision, octree and kd-tree. We use simple computational model , which assume that the objects are uniformly distributed in space. The efficiency is characterized by two measures, including the expected number of ray-object intersections needed to identified the first intersected object, and the expected number of steps on the space partitioning data structure. We can come to the interesting conclusion that these numbers are constant and are independent of the number of objects in the scene. The number of intersections is determined by how well the cells of the partitioning data structure enclose the objects. Such analysis helps to understand why kd-tree is better than octree and uniform space subdivision and provides hints to improve their implementation.}, } @ARTICLE{Havran2003:CGA, AUTHOR = {Havran, Vlastimil and Purgathofer, Werner}, JOURNAL = {Computers \& Graphics}, TITLE = {On Comparing Ray Shooting Algorithms}, ADDRESS = {New York, USA}, NUMBER = {4}, PUBLISHER = {Elsevier}, VOLUME = {27}, YEAR = {2003}, PAGES = {593--604}, ABSTRACT = { In this paper we discuss a methodology for comparing various ray shooting algorithms through a set of experiments performed on a set of scenes. We develop a computational model for ray shooting algorithms, which allows us to map any particular ray shooting algorithm to the computational model. Further, we develop a performance model for ray shooting algorithms, which establishes the correspondence between the computational model and the running time of the ray shooting algorithm for a sequence of ray shooting queries. Based on these computational and performance models, we propose a set of parameters describing the use of a ray shooting algorithm in applications. These parameters allows us to make a fair comparison of various ray shooting algorithms for the same set of input data, \ie, the same scene and the same sequence of ray shooting queries, but virtually independently of hardware and implementation issues. Under certain conditions, the proposed comparison methodology enables cross-comparison of published research work without reimplementation of other ray shooting algorithms.}, } @INPROCEEDINGS{Havran2003:EGSR, AUTHOR = {Havran, Vlastimil and Damez, Cyrille and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Christensen, Per and Cohen-Or, Daniel}, TITLE = {An Efficient Spatio-Temporal Architecture for Animation Rendering}, BOOKTITLE = {Rendering Techniques 2003 : 14th Eurographics Workshop on Rendering}, ORGANIZATION = {Association of Computing Machinery (ACM)}, PADDRESS = {New York, USA}, ADDRESS = {Leuven, Belgium}, PUBLISHER = {ACM}, MONTH = {June}, ISBN = {1-58113-754-0}, YEAR = {2003}, PAGES = {106--117}, ABSTRACT = {Producing high quality animations featuring rich object appearance and compelling lighting effects is very time consuming using traditional frame-by-frame rendering systems. In this paper we present a rendering architecture for computing multiple frames at once by exploiting the coherence between image samples in the temporal domain. For each sample representing a given point in the scene we update its view-dependent components for each frame and add its contribution to pixels identified through the compensation of camera and object motion. This leads naturally to a high quality motion blur and significantly reduces the cost of illumination computations. The required visibility information is provided using a custom ray tracing acceleration data structure for multiple frames simultaneously. We demonstrate that precise and costly global illumination techniques such as bidirectional path tracing become affordable in this rendering architecture.}, } @INPROCEEDINGS{Havran2003:SCCG, AUTHOR = {Havran, Vlastimil and Bittner, Jiri and Seidel, Hans-Peter}, EDITOR = {Joy, Kenneth I.}, TITLE = {Exploiting Temporal Coherence in Ray Casted Walkthroughs}, BOOKTITLE = {Proceedings of the 19th Spring Conference on Computer Graphics 2003 (SCCG 03)}, PADDRESS = {New York, USA}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {ACM}, MONTH = {April}, YEAR = {2003}, PAGES = {164--172}, ABSTRACT = {We present a technique that aims at exploiting temporal coherence of ray casted walkthroughs. Our goal is to reuse ray/object intersections computed in the last frame of the walkthrough for acceleration of ray casting in the current frame. In particular we aim at eliminating the ray traversal and computing only a single ray/object intersection per pixel. If our technique does not succeed in determining visibility, it falls back to the classical ray traversal. Visible point samples from the last frame are reprojected to the current frame. To identify whether these samples can be reused we apply splatting and epipolar geometry constraints. We discuss two additional techniques that handle correct appearance of small objects. We conducted a series of tests on walkthroughs of building interiors. Our method succeeded in determining visibility of more than 78\% of pixels. For these pixels only a single ray/object intersection is executed. The frame rate is increased by up to 47\%. Finally, we argue that the achieved speedup is relatively significant by comparing the performance of our algorithm to the ``ideal'' ray shooting algorithm.}, } @INPROCEEDINGS{Havran2005eg05, AUTHOR = {Havran, Vlastimil and Herzog, Robert and Seidel, Hans-Peter}, EDITOR = {Alexa, Marc and Marks, Joe}, JOURNAL = {Computer Graphics Forum}, TITLE = {Fast Final Gathering via Reverse Photon Mapping}, BOOKTITLE = {The European Association for Computer Graphics 26th Annual Conference : EUROGRAPHICS 2005}, PADDRESS = {Oxford, UK}, ADDRESS = {Dublin, Ireland}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {August}, SERIES = {Computer Graphics Forum}, VOLUME = {24}, ISBN = {0167-7055}, YEAR = {2005}, PAGES = {323--333}, ABSTRACT = {We present a new algorithm for computing indirect illumination based on density estimation similarly to photon mapping. We accelerate the search for final gathering by reorganizing the computation in the reverse order. We use two trees that organize spatially not only the position of photons but also the position of final gather rays. The achieved speedup is algorithmic, the performance improvement takes advantage of logarithmic complexity of searching in trees. The algorithm requires almost no user settings unlike many known acceleration techniques for photon mapping. The image quality is the same as for traditional photon mapping with final gathering, since the algorithm does not approximate or interpolate. Optionally, the algorithm can be combined with other techniques such as density control and importance sampling. The algorithm creates a coherent access pattern to the main memory. This further improves on performance and also allows us to use efficient external data structures to alleviate the increased memory requirements.}, } @INPROCEEDINGS{Havran2005egsrEM, AUTHOR = {Havran, Vlastimil and Smyk, Miloslaw and Krawczyk, Grzegorz and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Deussen, Oliver and Keller, Alexander and Bala, Kavita and Dutr{\'e}, Philip and Fellner, Dieter W. and Spencer, Stephen N.}, TITLE = {Interactive System for Dynamic Scene Lighting using Captured Video Environment Maps}, BOOKTITLE = {Rendering Techniques 2005: Eurographics Symposium on Rendering}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Konstanz, Germany}, PUBLISHER = {Eurographics}, MONTH = {June}, ISBN = {3-905673-23-1}, YEAR = {2005}, PAGES = {31--42,311}, ABSTRACT = {We present an interactive system for fully dynamic scene lighting using captured high dynamic range (HDR) video environment maps. The key component of our system is an algorithm for efficient decomposition of HDR video environment map captured over hemisphere into a set of representative directional light sources, which can be used for the direct lighting computation with shadows using graphics hardware. The resulting lights exhibit good temporal coherence and their number can be adaptively changed to keep a constant framerate while good spatial distribution (stratification) properties are maintained. We can handle a large number of light sources with shadows using a novel technique which reduces the cost of BRDF-based shading and visibility computations. We demonstrate the use of our system in a mixed reality application in which real and synthetic objects are illuminated by consistent lighting at interactive framerates.}, } @INPROCEEDINGS{Havran2005egsrRM, AUTHOR = {Havran, Vlastimil and Bittner, Jiri and Herzog, Robert and Seidel, Hans-Peter}, EDITOR = {Deussen, Oliver and Keller, Alexander and Bala, Kavita and Dutr{\'e}, Philip and Fellner, Dieter W. and Spencer, Stephen N.}, TITLE = {Ray Maps for Global Illumination}, BOOKTITLE = {Rendering Techniques 2005: Eurographics Symposium on Rendering}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Konstanz, Germany}, PUBLISHER = {Eurographics}, MONTH = {June}, ISBN = {3-905673-23-1}, YEAR = {2005}, PAGES = {43--54,311}, ABSTRACT = {We describe a novel data structure for representing light transport called ray map. The ray map extends the concept of photon maps: it stores not only photon impacts but the whole photon paths. We demonstrate the utility of ray maps for global illumination by eliminating boundary bias and reducing topological bias of density estimation in global illumination. Thanks to the elimination of boundary bias we could use ray maps for fast direct visualization with the image quality being close to that obtained by the expensive final gathering step. We describe in detail our implementation of the ray map using a lazily constructed kD-tree. We also present several optimizations bringing the ray map query performance close to the performance of the photon map.}, } @INPROCEEDINGS{Havran2005SCCG, AUTHOR = {Havran, Vlastimil and Neummann, Attila and Zotti, Georg and Purgathofer, Werner and Seidel, Hans-Peter}, TITLE = {On Cross-Validation and Resampling of BRDF Data Measurements}, BOOKTITLE = {SCCG '05: Proceedings of the 21st Spring Conference on Computer Graphics}, ORGANIZATION = {ACM SIGGRAPH and EUROGRAPHICS}, PADDRESS = {New York, NY, USA}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {ACM}, MONTH = {May}, ISBN = {1-59593-203-6}, YEAR = {2005}, PAGES = {161--168}, ABSTRACT = {We discuss the validation of BTF data measurements by means used for BRDF measurements. First, we show how to apply the Helmholtz reciprocity and isotropy for a single data set. Second, we discuss a cross-validation for BRDF measurement data obtained from two different measurement setups, where the measurements are not calibrated or the level of accuracy is not known. We show the practical problems encountered and the solutions we have used to validate physical setup for four material samples. We describe a novel coordinate system suitable for resampling the BRDF data from one data set to another data set. Further, we show how the perceptually uniform color space CIELab is used for cross-comparison of BRDF data measurements, which were not calibrated.}, } @ARTICLE{Havran2010CGF, AUTHOR = {Havran, Vlastimil and Filip, Jiri and Myszkowski, Karol}, JOURNAL = {Computer Graphics Forum}, TITLE = {Bidirectional Texture Function Compression based on the Multilevel Vector Quantization}, ADDRESS = {Oxford, UK}, NUMBER = {1}, PUBLISHER = {Blackwell}, MONTH = {January}, VOLUME = {29}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2009.01585.x}, YEAR = {2010}, PAGES = {175--190}, } @INPROCEEDINGS{HavranRT2006, AUTHOR = {Havran, Vlastimil and Herzog, Robert and Seidel, Hans-Peter}, EDITOR = {Wald, Ingo and Parker, Steven G.}, TITLE = {On the Fast Construction of Spatial Hierarchies for Ray Tracing}, BOOKTITLE = {Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing}, PADDRESS = {Piscataway, USA}, ADDRESS = {Salt Lake City, UT, USA}, PUBLISHER = {IEEE}, MONTH = {September}, ISBN = {1-4244-0693-5}, YEAR = {2006}, PAGES = { 71--80 }, ABSTRACT = {In this paper we address the problem of fast construction of spatial hierarchies for ray tracing with applications in animated environments including non-rigid animations. We discuss properties of currently used techniques with $O(N \log N)$ construction time for kd-trees and bounding volume hierarchies. Further, we will propose a hybrid data structure blending a spatial kd-tree with bounding volume primitives. We will keep our novel hierarchical data structures algorithmically efficient and comparable with kd-trees by using a cost model based on surface area heuristics. Although the time complexity $O(N \log N)$ is a lower bound required for construction of any spatial hierarchy, which corresponds to sorting based on comparisons, using an approximate method based on space discretization, we propose a new hierarchical data structures with expected $O(N \log\log N)$ time complexity. We also discuss the constants behind the construction algorithms of spatial hierarchies that are important in practice. We document the performance of our algorithms by results obtained from nine different scenes.}, } @INPROCEEDINGS{HAW-BSRISAOP-2006, AUTHOR = {Huang, Qi-Xing and Adams, Bart and Wand, Michael}, EDITOR = {Fellner, Dieter and Spencer, Stephen}, TITLE = {Bayesian Surface Reconstruction via Iterative Scan Alignment to an Optimized Prototype}, BOOKTITLE = {SGP 2007 : Fifth Eurographics Symposium on Geometry Processing}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Barcelona, Spain}, PUBLISHER = {Eurographics Association}, ISBN = {978-3-905673-46-3}, YEAR = {2007}, PAGES = {213--223}, } @INPROCEEDINGS{HDI:2010:VolumeCaustics, AUTHOR = {Hu, Wei and Dong, Zhao and Ihrke, Ivo and Grosch, Thorsten and Yuan, Guodong and Seidel, Hans-Peter}, EDITOR = {Varshney, Amitabh and Wyman, Chris and Aliaga, Daniel and Oliveira, Manuel M.}, TITLE = {Interactive Volume Caustics in Single-Scattering Media}, BOOKTITLE = {Proceedings I3D 2010 : ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games}, ORGANIZATION = {ACM SIGGRAPH}, PADDRESS = {New York, NY}, ADDRESS = {Washington DC, US}, PUBLISHER = {ACM}, ISBN = {978-1-60558-939-8}, DOI = {10.1145/1730804.1730822}, YEAR = {2010}, PAGES = {109--117}, ABSTRACT = {Volume caustics are intricate illumination patterns formed by light first interacting with a specular surface and subsequently being scattered inside a participating medium. Although this phenomenon can be simulated by existing techniques, image synthesis is usually non-trivial and time-consuming. Motivated by interactive applications, we propose a novel volume caustics rendering method for single-scattering participating media. Our method is based on the observation that line rendering of illumination rays into the screen buffer establishes a direct light path between the viewer and the light source. This connection is introduced via a single scattering event for every pixel affected by the line primitive. Since the GPU is a parallel processor, the radiance contributions of these light paths to each of the pixels can be computed and accumulated independently. The implementation of our method is straightforward and we show that it can be seamlessly integrated with existing methods for rendering participating media. We achieve high-quality results at real-time frame rates for large and dynamic scenes containing homogeneous participating media. For inhomogeneous media, our method achieves interactive performance that is close to real-time. Our method is based on a simplified physical model and can thus be used for generating physically plausible previews of expensive lighting simulations quickly.}, } @BOOK{HDRtextBook2010, AUTHOR = {Reinhard, Erik and Ward, Greg and Pattanaik, Summant and Debevec, Paul and Heidrich, Wolfgang and Myszkowski, Karol}, TITLE = {High Dynamic Range Imaging: Acquisition, Display, and Image-based Lighting}, ADDRESS = {Burlington, MA}, PUBLISHER = {Elsevier (Morgan Kaufmann)}, EDITION = {2nd}, SERIES = {The Morgan Kaufmann series in Computer Graphics}, ISBN = {978-0-12-374914-7}, YEAR = {2010}, PAGES = {649}, } @INPROCEEDINGS{Heidrich1999, AUTHOR = {Heidrich, Wolfgang and Seidel, Hans-Peter}, EDITOR = {Rockwood, Alyn}, TITLE = {Realistic, Hardware-accelerated Shading and Lighting}, BOOKTITLE = {Computer Graphics (SIGGRAPH-99) : Conference proceedings}, ORGANIZATION = {ACM Siggraph}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, USA}, PUBLISHER = {ACM}, MONTH = {August}, YEAR = {1999}, PAGES = {171--178}, ABSTRACT = { With fast 3D graphics becoming more and more available even on low end platforms, the focus in hardware-accelerated rendering is beginning to shift towards higher quality rendering and additional functionality instead of simply higher performance implementations based on the traditional graphics pipeline. In this paper we present techniques for realistic shading and lighting using computer graphics hardware. In particular, we discuss multipass methods for high quality local illumination using physically-based reflection models, as well as techniques for the interactive visualization of non-diffuse global illumination solutions. These results are then combined with normal mapping for increasing the visual complexity of rendered images. Although the techniques presented in this paper work at interactive frame rates on contemporary graphics hardware, we also discuss some modifications of the rendering pipeline that help to further improve both performance and quality of the proposed methods.}, } @INPROCEEDINGS{Heidrich1999a, AUTHOR = {Heidrich, Wolfgang and Lensch, Hendrik P. A. and Cohen, Michael and Seidel, Hans-Peter}, EDITOR = {Lischinski, Dani and Larson, Gregory Ward}, TITLE = {Light Field Techniques for Reflections and Refractions}, BOOKTITLE = {Rendering Techniques '99: Proceedings of the 10th Eurographics Workshop on Rendering (EGRW-99)}, ORGANIZATION = {EUROGRAPHICS}, PADDRESS = {Vienna, Austria}, ADDRESS = {Granada, Spain}, PUBLISHER = {Springer}, MONTH = {June}, YEAR = {1999}, PAGES = {187--196}, ABSTRACT = { Reflections and refractions are important visual effects that have long been considered too costly for interactive applications. Although most contemporary graphics hardware supports reflections off curved surfaces in the form of environment maps, refractions in thick, solid objects cannot be handled with this approach, and even for reflections the simplifying assumptions of environment maps sometimes produce visible artifacts. Only recently have researchers developed techniques for the interactive rendering of true reflections and refractions in curved objects. This paper introduces a new, light field based approach to achieving this goal. The method is based on a strict decoupling of geometry and illumination, and hardware support for all stages of the technique is possible through existing extensions of the OpenGL rendering pipeline. In addition we also discuss storage issues and introduce methods for handling vector-quantized data with graphics hardware.}, } @TECHREPORT{HeidrichGoesele02, AUTHOR = {Heidrich, Wolfgang and Goesele, Michael}, TITLE = {Image-Based Measurement of Light Sources With Correct Filtering}, INSTITUTION = {University of British Columbia, Department of Computer Science}, TYPE = {Technical Report}, ADDRESS = {Vancouver, BC, Canada}, NUMBER = {TR-2001-08}, MONTH = {July}, YEAR = {2002}, PAGES = {9}, ABSTRACT = {In this document we explore the theory and potential experimental setups for measuring the near field of a complex luminary. This work extends on near field photometry by taking filtering issues into account. The physical measurement setups described here have not been tested at the time of writing this document, we simply describe several possibilities here. Once actual tests have been performed, the results will be published elsewhere.}, } @INPROCEEDINGS{Heidrich:1999:APT, AUTHOR = {Heidrich, Wolfgang and Westermann, R{\"u}diger and Seidel, Hans-Peter and Ertl, Thomas}, EDITOR = {Hodgins, Jessica and Foley, James}, TITLE = {Applications of Pixel Textures in Visualization and Realistic Image Synthesis}, BOOKTITLE = {Proceedings of the 1999 ACM Symposium on Interactive 3D Graphics (I3DG-99)}, ORGANIZATION = {ACM}, PADDRESS = {New York, USA}, ADDRESS = {Atlanta, USA}, PUBLISHER = {ACM}, MONTH = {April}, YEAR = {1999}, PAGES = {127--134}, } @PHDTHESIS{Heidrich:1999:HQS, AUTHOR = {Heidrich, Wolfgang}, TITLE = {High-quality Shading and Lighting for Hardware-accelerated Rendering}, SCHOOL = {Universit{\"a}t Erlangen-N{\"u}rnberg}, TYPE = {Doctoral dissertation}, ADDRESS = {Munich, Germany}, PUBLISHER = {Herbert Utz}, MONTH = {April}, YEAR = {1999}, } @INPROCEEDINGS{Heidrich:1999:WRL, AUTHOR = {Heidrich, Wolfgang and Schirmacher, Hartmut and K{\"u}ck, Hendrik and Seidel, Hans-Peter}, EDITOR = {Skala, Vaclav}, TITLE = {A Warping-based Refinement of Lumigraphs}, BOOKTITLE = {Proceedings of the 7th International Conference in Central Europe on Computer Graphics, Visualization and Interactive Digital Media (WSCG-99)}, PADDRESS = {Plzen, Czech Republic}, ADDRESS = {Plzen, Czech Republic}, PUBLISHER = {University of West Bohemia}, MONTH = {February}, YEAR = {1999}, PAGES = {102--109}, ABSTRACT = {Light elds and Lumigraphs have recently received a lot of attention in the computer graphics community, since they allow to render scenes from a database of images very e ciently. While warping based approaches are still too slow to achieve truly interactive frame rates, Lumigraph rendering can easily achieve tens of frames per second in full screen on a contemporary graphics workstation. On the down side, high resolution Lumigraphs require large amounts of storage and are expensive to acquire, while low resolutions yield low quality images with lots of blurring. In this paper, we propose to re ne an initial sparse Lumigraph through the use of a specialized warping algorithm. This algorithm increases the resolution of the Lumigraph by inserting new views, which can then be used to generate higher quality images through normal quadri-linear interpolation. This way, storage requirements and acquisition costs remain low, but image quality is increased drastically.}, } @INPROCEEDINGS{Heidrich:2000:EGSTAR, AUTHOR = {Heidrich, Wolfgang}, TITLE = {Interactive Display of Global Illumination Solutions for Non-Diffuse Environments}, BOOKTITLE = {European Association for Computer Graphics 21st Annual Conference (Eurographics-00), State of The Art Reports}, ORGANIZATION = {Eurographics}, TYPE = {STARs}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Interlaken, Switzerland}, PUBLISHER = {Eurographics}, MONTH = {August}, YEAR = {2000}, PAGES = {1--19}, ABSTRACT = {Methods for solving shadow problems by solving instances of visibility problems have long been known and exploited. There are, however, other potent uses of such a reduction of shadow problems, several of which we explore in this paper. Specifically, we describe algorithms that use a resolution--independent, or object--space, visibility structure for the computation of object--space shadows under point, linear, and area light sources. The connection between object--space visibility and shadow computation is well--known in computer graphics. We show how that fundamental observation can be recast and generalized within an object--space visibility structure. The edges in such a structure contain exactly the information needed to determine shadow edges under a point light source. Also, the locations along a linear or an area light source at which visibility changes (termed critical points and critical lines) provide the necessary information for computing shadow edges resulting from linear and area light sources. Not only are instances of all shadow problems thus reduced to visibility problems, but instances of shadow problems under linear and area light sources are also reduced to instances of shadow generation under point and linear light sources, respectively.}, } @INPROCEEDINGS{Heidrich:2000:IMG, AUTHOR = {Heidrich, Wolfgang and Daubert, Katja and Kautz, Jan and Seidel, Hans-Peter}, EDITOR = {Akeley, Kurt}, TITLE = {Illuminating Micro Geometry Based on Precomputed Visibility}, BOOKTITLE = {Proceedings of SIGGRAPH 2000 (SIGGRAPH-00)}, ORGANIZATION = {ACM Siggraph}, PADDRESS = {New York, USA}, ADDRESS = {New Orleans, USA}, PUBLISHER = {ACM}, MONTH = {July}, SERIES = {Computer Graphics Proceedings, Annual Conference Series}, VOLUME = {2000}, ISBN = {1-58113-208-5}, YEAR = {2000}, PAGES = {455--464}, } @INCOLLECTION{Heidrich:2000:MFI, AUTHOR = {Heidrich, Wolfgang and Eisert, Peter and Stamminger, Marc and Scheel, Annette}, EDITOR = {Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich}, TITLE = {Models for Illumination and Reflection}, BOOKTITLE = {Principles of 3D Image Analysis and Synthesis}, CHAPTER = {5.1}, ADDRESS = {Boston, Massachusetts}, PUBLISHER = {Kluwer}, MONTH = {January}, ISBN = {0-7923-7850-4}, YEAR = {2000}, PAGES = {204--213}, } @INPROCEEDINGS{Heidrich:2000:SSM, AUTHOR = {Heidrich, Wolfgang and Brabec, Stefan and Seidel, Hans-Peter}, EDITOR = {P{\'e}roche, Bernard and Rushmeier, Holly}, TITLE = {Soft Shadow Maps for Linear Lights}, BOOKTITLE = {Rendering Techniques 2000, Proceedings of the 11th Eurographics Workshop on Rendering}, ORGANIZATION = {Eurographics}, PADDRESS = {Vienna, Austria}, ADDRESS = {Brno, Czech Republic}, PUBLISHER = {Springer}, MONTH = {June}, SERIES = {Springer Computer Science}, ISBN = {3-211-83535-0}, YEAR = {2000}, PAGES = {269--280}, ABSTRACT = {Soft shadows and penumbra regions generated by extended light sources such as linear and area lights are visual effects that significantly con-tribute to the realism of a scene. In interactive applications, shadow computations are mostly performed by either the shadow volume or the shadow map algorithm. Variants of these methods for soft shadows exist, but they require a significant number of samples on the light source, thereby dramatically increasing rendering times.\\In this paper we present a modification to the shadow map algorithm that allows us to render soft shadows for linear light sources of a high visual fidelity with a very small number of light source samples. This algorithm is well suited for both software and hardware rendering.}, } @INCOLLECTION{Heidrich:2000:TM, AUTHOR = {Heidrich, Wolfgang}, EDITOR = {Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich}, TITLE = {Texture Models}, BOOKTITLE = {Principles of 3D Image Analysis and Synthesis}, CHAPTER = {5.3}, ADDRESS = {Boston, USA}, PUBLISHER = {Kluwer}, MONTH = {January}, ISBN = {0-7923-7850-4}, YEAR = {2000}, PAGES = {223--232}, } @INCOLLECTION{Helten2013_FullBodyMotionCapture_LNCS, AUTHOR = {Helten, Thomas and Baak, Andreas and M{\"u}ller, Meinard and Theobalt, Christian}, EDITOR = {Grzegorzek, Marcin and Theobalt, Christian and Koch, Reinhard and Kolb, Andreas}, TITLE = {Full-Body Human Motion Capture from Monocular Depth Images}, BOOKTITLE = {Time-of-Flight and Depth Imaging Sensors, Algorithms, and Applications}, CHAPTER = {Human-Centered Depth Imaging}, ADDRESS = {Berlin}, PUBLISHER = {Springer}, SERIES = {LNCS}, VOLUME = {8200}, ISBN = {978-3-642-44963-5}, YEAR = {2013}, PAGES = {188--206}, } @PHDTHESIS{Helten2013_PhDThesis, AUTHOR = {Helten, Thomas}, TITLE = {Processing and Tracking Human Motions Using Optical, Inertial, and Depth Sensors}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Saarl{\"a}ndische Universit{\"a}ts- und Landesbibliothek}, MONTH = {October}, YEAR = {2013}, ABSTRACT = {The processing of human motion data constitutes an important strand of research with many applications in computer animation, sport science and medicine. Currently, there exist various systems for recording human motion data that employ sensors of different modalities such as optical, inertial and depth sensors. Each of these sensor modalities have intrinsic advantages and disadvantages that make them suitable for capturing specific aspects of human motions as, for example, the overall course of a motion, the shape of the human body, or the kinematic properties of motions. In this thesis, we contribute with algorithms that exploit the respective strengths of these different modalities for comparing, classifying, and tracking human motion in various scenarios. First, we show how our proposed techniques can be employed, \textit{e.\,g.}, for real-time motion reconstruction using efficient cross-modal retrieval techniques. Then, we discuss a practical application of inertial sensors-based features to the classification of trampoline motions. As a further contribution, we elaborate on estimating the human body shape from depth data with applications to personalized motion tracking. Finally, we introduce methods to stabilize a depth tracker in challenging situations such as in presence of occlusions. Here, we exploit the availability of complementary inertial-based sensor information.}, } @INPROCEEDINGS{HeltenBBMST13_PersonalizedDepthTracker_3DV, AUTHOR = {Helten, Thomas and Baak, Andreas and Bharaj, Gaurav and M{\"u}ller, Meinard and Seidel, Hans-Peter and Theobalt, Christian}, TITLE = {Personalization and Evaluation of a Real-time Depth-based Full Body Tracker}, BOOKTITLE = {Proceedings of the 3rd joint 3DIM/3DPVT Conference (3DV)}, PADDRESS = {?}, ADDRESS = {Seattle, USA}, PUBLISHER = {Conference Publishing Services}, SERIES = {IEEE Conference Proceedings}, DOI = {10.1109/3DV.2013.44}, YEAR = {2013}, PAGES = {279--286}, ABSTRACT = {Reconstructing a three-dimensional representation of human motion in real-time constitutes an important research topic with applications in sports sciences, human-computer-interaction, and the movie industry. In this paper, we contribute with a robust algorithm for estimating a personalized human body model from just two sequentially captured depth images that is more accurate and runs an order of magnitude faster than the current state-of-the-art procedure. Then, we employ the estimated body model to track the pose in real-time from a stream of depth images using a tracking algorithm that combines local pose optimization and a stabilizing database look-up. Together, this enables accurate pose tracking that is more accurate than previous approaches. As a further contribution, we evaluate and compare our algorithm to previous work on a comprehensive benchmark dataset containing more than 15 minutes of challenging motions. This dataset comprises calibrated marker-based motion capture data, depth data, as well as ground truth tracking results and is publicly available for research purposes. }, } @ARTICLE{HeltenBMS11_ClassificationTrampolineJumps_SE, AUTHOR = {Helten, Thomas and Brock, Heike and M{\"u}ller, Meinard and Seidel, Hans-Peter}, JOURNAL = {Sports Engineering}, TITLE = {Classification of trampoline jumps using inertial sensors}, ADDRESS = {New York, NY}, NUMBER = {2-4}, PUBLISHER = {Springer}, VOLUME = {14}, DOI = {10.1007/s12283-011-0081-4}, YEAR = {2011}, PAGES = {155--164}, } @INPROCEEDINGS{HeltenMTWS11_Cross-modalComparison, AUTHOR = {Helten, Thomas and M{\"u}ller, Meinard and Tautges, Jochen and Weber, Andreas and Seidel, Hans-Peter}, EDITOR = {Mester, Rudolf and Felsberg, Michael}, TITLE = {Towards Cross-modal Comparison of Human Motion Data}, BOOKTITLE = {Pattern Recognition : 33rd DAGM Symposium}, PADDRESS = {Berlin}, ADDRESS = {Frankfurt/Main, Germany}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {6835}, ISBN = {978-3-642-23122-3}, DOI = {0.1007/978-3-642-23123-0_7}, YEAR = {2011}, PAGES = {61--70}, } @INPROCEEDINGS{HeltenMuSeTh13_InertialDepthTracker_ICCV, AUTHOR = {Helten, Thomas and M{\"u}ller, Meinard and Seidel, Hans-Peter and Theobalt, Christian}, TITLE = {Real-time Body Tracking with One Depth Camera and Inertial Sensors}, BOOKTITLE = {The IEEE International Conference on Computer Vision (ICCV)}, PADDRESS = {?}, ADDRESS = {Sydney, Australia}, MONTH = {December}, SERIES = {The IEEE International Conference on Computer Vision (ICCV)}, YEAR = {2013}, PAGES = {1105--1112}, ABSTRACT = {In recent years, the availability of inexpensive depth cameras, such as the Microsoft Kinect, has boosted the research in monocular full body skeletal pose tracking. Unfortunately, existing trackers often fail to capture poses where a single camera provides insufficient data, such as non-frontal poses, and all other poses with body part occlusions. In this paper, we present a novel sensor fusion approach for real-time full body tracking that succeeds in such difficult situations. It takes inspiration from previous tracking solutions, and combines a generative tracker and a discriminative tracker retrieving closest poses in a database. In contrast to previous work, both trackers employ data from a low number of inexpensive body-worn inertial sensors. These sensors provide reliable and complementary information when the monocular depth information alone is not sufficient. We also contribute by new algorithmic solutions to best fuse depth and inertial data in both trackers. One is a new visibility model to determine global body pose, occlusions and usable depth correspondences and to decide what data modality to use for discriminative tracking. We also contribute with a new inertial-based pose retrieval, and an adapted late fusion step to calculate the final body pose. }, } @INPROCEEDINGS{Herzog08EG, AUTHOR = {Herzog, Robert and Kinuwaki, Shinichi and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Scopigno, Roberto and Gr{\"o}ller, Eduard}, TITLE = {{Render2MPEG:} A Perception-based Framework Towards Integrating Rendering and Video Compression}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, PADDRESS = {Oxford, UK}, ADDRESS = {Crete, Greece}, NUMBER = {2}, PUBLISHER = {Blackwell}, VOLUME = {27(2)}, YEAR = {2008}, PAGES = {183--192}, ABSTRACT = {Currently 3D animation rendering and video compression are completely independent processes even if rendered frames are streamed on-the-fly within a client-server platform. In such scenario, which may involve time-varying transmission bandwidths and different display characteristics at the client side, dynamic adjustment of the rendering quality to such requirements can lead to a better use of server resources. In this work, we present a framework where the renderer and MPEG codec are coupled through a straightforward interface that provides precise motion vectors from the rendering side to the codec and perceptual error thresholds for each pixel in the opposite direction. The perceptual error thresholds take into account bandwidth-dependent quantization errors resulting from the lossy compression as well as image content-dependent luminance and spatial contrast masking. The availability of the discrete cosine transform (DCT) coefficients at the codec side enables to use advanced models of the human visual system (HVS) in the perceptual error threshold derivation without incurring any significant cost. Those error thresholds are then used to control the rendering quality and make it well aligned with the compressed stream quality. In our prototype system we use the lightcuts technique developed by Walter et al., which we enhance to handle dynamic image sequences, and an MPEG-2 implementation. Our results clearly demonstrate many advantages of coupling the rendering with video compression in terms of faster rendering. Furthermore, temporally coherent rendering leads to a reduction of temporal artifacts.}, } @MASTERSTHESIS{Herzog2005, AUTHOR = {Herzog, Robert}, TITLE = {Advanced Density Estimation Techniques for Global Illumination}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {October}, YEAR = {2005}, ABSTRACT = {In this thesis we present two new methods, \emph{reverse photon mapping} and the \emph{ray map}, intended to improve or accelerate the global illumination computation in synthetic scenes by taking advantage of the vast memory resources of modern PCs. After a review of the physics of light and the basics of global illumination with a brief theoretical introduction to statistical density estimation, we describes the fundamentals of photon mapping as a specific application of density estimation in computer graphics. Besides the classical photon mapping algorithm, several novel enhancements and ideas are discussed. Furthermore, an overview and a comparison of a variety of search data structures applicable to photon mapping and a detailed description including pseudo code for our new proposed kd-tree structure are provided in the thesis. }, } @ARTICLE{Herzog2008, AUTHOR = {Herzog, Robert and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Dutr{\'e}, Philip and Stamminger, Marc}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS 2009)}, TITLE = {Anisotropic Radiance-Cache Splatting for Efficiently Computing High-Quality Global Illumination with Lightcuts}, BOOKTITLE = {The European Association for Computer Graphics 30th Annual Conference : EUROGRAPHICS 2009}, ADDRESS = {Oxford}, NUMBER = {2}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {28}, YEAR = {2009}, PAGES = {259--268}, ABSTRACT = {Computing global illumination in complex scenes is even with todays computational power a demanding task. In this work we propose a novel irradiance caching scheme that combines the advantages of two state-of-the-art algorithms for high-quality global illumination rendering: \emph{lightcuts}, an adaptive and hierarchical instant-radiosity based algorithm and the widely used (ir)radiance caching algorithm for sparse sampling and interpolation of (ir)radiance in object space. Our adaptive radiance caching algorithm is based on anisotropic cache splatting, which adapts the cache footprints not only to the magnitude of the illumination gradient computed with lightcuts but also to its orientation allowing larger interpolation errors along the direction of coherent illumination while reducing the error along the illumination gradient. Since lightcuts computes the direct and indirect lighting seamlessly, we use a two-layer radiance cache, to store and control the interpolation of direct and indirect lighting individually with different error criteria. In multiple iterations our method detects cache interpolation errors above the visibility threshold of a pixel and reduces the anisotropic cache footprints accordingly. We achieve significantly better image quality while also speeding up the computation costs by one to two orders of magnitude with respect to the well-known photon mapping with (ir)radiance caching procedure. }, } @PHDTHESIS{HerzogDiss2010, AUTHOR = {Herzog, Robert}, TITLE = {Exploiting Coherence in Lighting and Shading Computations}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {April}, YEAR = {2010}, PAGES = {219}, ABSTRACT = {Computing global illumination (GI) in virtual scenes becomes increasingly attractive even for real-time applications nowadays. GI delivers important cues in the perception of 3D virtual scenes, which is important for material and architectural design. Therefore, for photo-realistic rendering in the design and even the game industry, GI has become indispensable. While the computer simulation of realistic global lighting is well-studied and often considered as solved, computing it efficiently is not. Saving computation costs is therefore the main motivation of current research in GI. Efficient algorithms have to take various aspects into account, such as the algorithmic complexity and convergence, its mapping to parallel processing hardware, and the knowledge of certain lighting properties including the capabilities of the human visual system. In this dissertation we exploit both low-level and high-level coherence in the practical design of GI algorithms for a variety of target applications ranging from high-quality production rendering to dynamic real-time rendering. We also focus on automatic rendering-accuracy control to approximate GI in such a way that the error is perceptually unifi ed in the result images, thereby taking not only into account the limitations of the human visual system but also later video compression with an MPEG encoder. In addition, this dissertation provides many ideas and supplementary material, which complements published work and could be of practical relevance.}, } @INPROCEEDINGS{HerzogEG2007, AUTHOR = {Herzog, Robert and Havran, Vlastimil and Kinuwaki, Shinichi and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Cohen-Or, Daniel and Slavik, Pavel}, TITLE = {Global Illumination using Photon Ray Splatting}, BOOKTITLE = {The European Association for Computer Graphics 28th Annual Conference: EUROGRAPHICS 2007}, ORGANIZATION = {The European Association for Computer Graphics}, PADDRESS = {Oxford, UK}, ADDRESS = {Prague, Czech Republic}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {26(3)}, ISBN = {0167-7055}, YEAR = {2007}, PAGES = {503--513}, ABSTRACT = {We present a novel framework for efficiently computing the indirect illumination in diffuse and moderately glossy scenes using density estimation techniques. Many existing global illumination approaches either quickly compute an overly approximate solution or perform an orders of magnitude slower computation to obtain high-quality results for the indirect illumination. The proposed method improves photon density estimation and leads to significantly better visual quality in particular for complex geometry, while only slightly increasing the computation time. We perform direct splatting of photon rays, which allows us to use simpler search data structures. Since our density estimation is carried out in ray space rather than on surfaces, as in the commonly used photon mapping algorithm, the results are more robust against geometrically incurred sources of bias. This holds also in combination with final gathering where photon mapping often overestimates the illumination near concave geometric features. In addition, we show that our photon splatting technique can be extended to handle moderately glossy surfaces and can be combined with traditional irradiance caching for sparse sampling and filtering in image space.}, } @ARTICLE{HerzogEG2011, AUTHOR = {Pajak, Dawid and Herzog, Robert and Myszkowski, Karol and Eisemann, Elmar and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum (Proc. of EUROGRAPHICS)}, TITLE = {Scalable Remote Rendering with Depth and Motion-flow Augmented Streaming}, BOOKTITLE = {Computer Graphics Forum}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell}, VOLUME = {30}, DOI = {10.1111/j.1467-8659.2011.01871.x}, YEAR = {2011}, PAGES = {415--424}, ABSTRACT = {In this work, we focus on efficient compression and streaming of frames rendered from a dynamic 3D model. Remote rendering and on-the-fly streaming become increasingly attractive for interactive applications. Data is kept confidential and only images are sent to the client. Even if the client's hardware resources are modest, the user can interact with state-of-the-art rendering applications executed on the server. Our solution focuses on augmented video information, e.g., by depth, which is key to increase robustness with respect to data loss, image reconstruction, and is an important feature for stereo vision and other client-side applications. Two major challenges arise in such a setup. First, the server workload has to be controlled to support many clients, second the data transfer needs to be efficient. Consequently, our contributions are twofold. First, we reduce the server-based computations by making use of sparse sampling and temporal consistency to avoid expensive pixel evaluations. Second, our data-transfer solution takes limited bandwidths into account, is robust to information loss, and compression and decompression are efficient enough to support real-time interaction. Our key insight is to tailor our method explicitly for rendered 3D content and shift some computations on client GPUs, to better balance the server/client workload. Our framework is progressive, scalable, and allows us to stream augmented high-resolution (e.g., HD-ready) frames with small bandwidth on standard hardware.}, } @INPROCEEDINGS{HerzogI3D2010, AUTHOR = {Herzog, Robert and Eisemann, Elmar and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Varshney, Amitabh and Wyman, Chris and Aliaga, Daniel and Oliveira, Manuel M.}, TITLE = {Spatio-temporal Upsampling on the {GPU}}, BOOKTITLE = {Proceedings I3D 2010 : ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games}, ORGANIZATION = {ACM SIGGRAPH}, PADDRESS = {New York, NY}, ADDRESS = {Washington DC}, PUBLISHER = {ACM}, ISBN = {978-1-60558-939-8}, DOI = {10.1145/1730804.1730819}, YEAR = {2010}, PAGES = {91--98}, ABSTRACT = {Pixel processing is becoming increasingly expensive for real-time applications due to the complexity of today's shaders and high-resolution framebuffers. However, most shading results are spatially or temporally coherent, which allows for sparse sampling and reuse of neighboring pixel values. This paper proposes a simple framework for spatio-temporal upsampling on modern GPUs. In contrast to previous work, which focuses either on temporal or spatial processing on the GPU, we exploit coherence in both. Our algorithm combines adaptive motion-compensated filtering over time and geometry-aware upsampling in image space. It is robust with respect to high-frequency temporal changes, and achieves substantial performance improvements by limiting the number of recomputed samples per frame. At the same time, we increase the quality of spatial upsampling by recovering missing information from previous frames. This temporal strategy also allows us to ensure that the image converges to a higher quality result.}, } @INPROCEEDINGS{HerzogPG2007, AUTHOR = {Herzog, Robert and Seidel, Hans-Peter}, EDITOR = {Alexa, Marc and Ju, Tao and Gortler, Steven}, TITLE = {Lighting Details Preserving Photon Density Estimation}, BOOKTITLE = {The 15th Pacific Conference on Computer Graphics and Application}, ORGANIZATION = {IEEE Computer Society}, PADDRESS = {New York, USA}, ADDRESS = {Maui, Hawaii, USA}, PUBLISHER = {IEEE Computer Society}, MONTH = {October}, YEAR = {2007}, PAGES = {407--410}, ABSTRACT = {Standard density estimation approaches suffer from visible bias due to low-pass filtering of the lighting function. Therefore, most photon density estimation methods have been used primarily with inefficient Monte Carlo final gathering to achieve high-quality results for the indirect illumination. We present a density estimation technique for efficiently computing all-frequency global illumination in diffuse and moderately glossy scenes. In particular, we compute the direct, indirect, and caustics illumination during photon tracing from the light sources. Since the high frequencies in the illumination often arise from visibility changes and surface normal variations, we consider a kernel that takes these factors into account. To efficiently detect visibility changes, we introduce a hierarchical voxel data structure of the scene geometry, which is generated on GPU. Further, we preserve the surface orientation by computing the density estimation in ray space.}, } @TECHREPORT{HerzogReport2007, AUTHOR = {Herzog, Robert and Havran, Vlastimil and Kinuwaki, Shinichi and Myszkowski, Karol and Seidel, Hans-Peter}, TITLE = {Global Illumination using Photon Ray Splatting}, INSTITUTION = {MPI Informatik}, TYPE = {Research Report}, ADDRESS = {Saarbruecken, Germany}, NUMBER = {MPI-I-2007-4-007}, MONTH = {May}, YEAR = {2007}, PAGES = {66}, ABSTRACT = {We present a novel framework for efficiently computing the indirect illumination in diffuse and moderately glossy scenes using density estimation techniques. A vast majority of existing global illumination approaches either quickly computes an approximate solution, which may not be adequate for previews, or performs a much more time-consuming computation to obtain high-quality results for the indirect illumination. Our method improves photon density estimation, which is an approximate solution, and leads to significantly better visual quality in particular for complex geometry, while only slightly increasing the computation time. We perform direct splatting of photon rays, which allows us to use simpler search data structures. Our novel lighting computation is derived from basic radiometric theory and requires only small changes to existing photon splatting approaches. Since our density estimation is carried out in ray space rather than on surfaces, as in the commonly used photon mapping algorithm, the results are more robust against geometrically incurred sources of bias. This holds also in combination with final gathering where photon mapping often overestimates the illumination near concave geometric features. In addition, we show that our splatting technique can be extended to handle moderately glossy surfaces and can be combined with traditional irradiance caching for sparse sampling and filtering in image space.}, } @ARTICLE{hids02a, AUTHOR = {Hassan, Mohamed and Ivrissimtzis, Ioannis and Dodgson, Neil A. and Sabin, Malcolm}, JOURNAL = {Computer Aided Geometric Design}, TITLE = {An Interpolating 4-point $C^2$ Ternary Stationary Subdivision Scheme}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {1}, PUBLISHER = {Elsevier}, MONTH = {February}, VOLUME = {19}, YEAR = {2002}, PAGES = {1--18}, } @ARTICLE{Hildebrandt2013, AUTHOR = {von Tycowicz, Christoph and Schulz, Christian and Seidel, Hans-Peter and Hildebrandt, Klaus}, JOURNAL = {ACM Transactions on Graphics (Proceedings of SIGGRAPH Asia 2013)}, TITLE = {An Efficient Construction of Reduced Deformable Objects}, NUMBER = {6}, PUBLISHER = {ACM}, MONTH = {November}, VOLUME = {32}, DOI = {10.1145/2508363.2508392}, YEAR = {2013}, PAGES = {213:1--213:10}, ABSTRACT = {Many efficient computational methods for physical simulation are based on model reduction. We propose new model reduction techniques for the \emph{approximation of reduced forces} and for the \emph{construction of reduced shape spaces of deformable objects} that accelerate the construction of a reduced dynamical system, increase the accuracy of the approximation, and simplify the implementation of model reduction. Based on the techniques, we introduce schemes for real-time simulation of deformable objects and interactive deformation-based editing of triangle or tet meshes. We demonstrate the effectiveness of the new techniques in different experiments with elastic solids and shells and compare them to alternative approaches.}, } @ARTICLE{HNRSZ:2004, AUTHOR = {Hangelbroek, Thomas and N{\"u}rnberger, G{\"u}nther and R{\"o}ssl, Christian and Seidel, Hans-Peter and Zeilfelder, Frank}, JOURNAL = {Journal of Approximation Theory}, TITLE = {Dimension of C1-splines on Type-6 Tetrahedral Partitions}, ADDRESS = {San Diego}, NUMBER = {2}, PUBLISHER = {Academic Press}, VOLUME = {131}, ISBN = {0021-9045}, YEAR = {2004}, PAGES = {157--184}, ABSTRACT = {We consider a linear space of piecewise polynomials in three variables which are globally smooth, i.e. trivariate C1-splines of arbitrary polynomial degree. The splines are defined on type-6 tetrahedral partitions, which are natural generalizations of the fourdirectional mesh. By using Bernstein-B´ezier techniques, we analyze the structure of the spaces and establish formulae for the dimension of the smooth splines on such uniform type partitions.}, } @INPROCEEDINGS{Hoggan2013, AUTHOR = {Hoggan, Eve and Nacenta, Miguel and Kristensson, Per Ola and Williamson, John and Oulasvirta, Antti and Lehtio, Anu}, TITLE = {Multi-touch pinch gestures: performance and ergonomics}, BOOKTITLE = {Proceedings of the 2013 ACM international conference on Interactive tabletops and surfaces (ITS'13)}, PADDRESS = {New York, USA}, ADDRESS = {St. Andrews, UK}, PUBLISHER = {ACM}, YEAR = {2013}, PAGES = {219--222}, } @ARTICLE{Hollaender2011, AUTHOR = {Holl{\"a}nder, Matthias and Ritschel, Tobias and Boubekeur, Tamy and Eisemann, Elmar}, JOURNAL = {Computer Graphics Forum (Proc. Eurographics Symposium on Rendering 2011)}, TITLE = {ManyLoDs: Parallel Many-View Level-of-Detail Selection for Real-Time Global Illumination}, NUMBER = {4}, VOLUME = {30}, YEAR = {2011}, PAGES = {1233}, } @INPROCEEDINGS{HuaHeiBla03, AUTHOR = {Huang, Jennifer and Heisele, Bernd and Blanz, Volker}, EDITOR = {Kittler, Josef and Nixon, Mark S.}, TITLE = {Component-based Face Recognition with 3D Morphable Models}, BOOKTITLE = {International Conference on Audio- and Video-Based Biometric Person Authentication (AVBPA-03)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Surrey, UK}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2688}, YEAR = {2003}, PAGES = {27--34}, NOTE = {accepted}, } @ARTICLE{Hullin2010, AUTHOR = {Hullin, Matthias B. and Hanika, Johannes and Lensch, Hendrik P. A. and Kautz, Jan and Seidel, Hans-Peter}, EDITOR = {Hoppe, Hugues}, JOURNAL = {ACM Transactions on Graphics (Proceedings of SIGGRAPH 2010)}, TITLE = {Acquisition and Analysis of Bispectral Bidirectional Reflectance Distribution Functions}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2010}, ORGANIZATION = {Association for Computing Machinery (ACM)}, ADDRESS = {New York, NY}, NUMBER = {4}, PUBLISHER = {ACM}, MONTH = {July}, SERIES = {ACM Transactions on Graphics}, VOLUME = {29}, ISBN = {0730-0301}, DOI = {10.1145/1833349.1778834}, YEAR = {2010}, PAGES = {97,1--97,7}, ABSTRACT = {In fluorescent materials, light from a certain band of incident wavelengths is reradiated at longer wavelengths, i.e., with a reduced per-photon energy. While fluorescent materials are common in everyday life, they have received little attention in computer graphics. Especially, no bidirectional reradiation measurements of fluorescent materials have been available so far. In this paper, we extend the well-known concept of the bidirectional reflectance distribution function (BRDF) to account for energy transfer between wavelengths, resulting in a Bispectral Bidirectional Reflectance and Reradiation Distribution Function (bispectral BRRDF). Using a bidirectional and bispectral measurement setup, we acquire reflectance and reradiation data of a variety of fluorescent materials, including vehicle paints, paper and fabric, and compare their renderings with RGB, RGBxRGB, and spectral BRDFs. Our acquisition is guided by a principal component analysis on complete bispectral data taken under a sparse set of angles. We show that in order to faithfully reproduce the full bispectral information for all other angles, only a very small number of wavelength pairs needs to be measured at a high angular resolution.}, } @ARTICLE{Hullin2011, AUTHOR = {Hullin, Matthias B. and Lensch, Hendrik P. A. and Raskar, Ramesh and Seidel, Hans-Peter and Ihrke, Ivo}, EDITOR = {Deussen, Oliver and Chen, Min}, JOURNAL = {Computer Graphics Forum (Proceedings EUROGRAPHICS 2011)}, TITLE = {Dynamic Display of {BRDFs}}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, ORGANIZATION = {Eurographics}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell}, VOLUME = {30}, DOI = {10.1111/j.1467-8659.2011.01859.x}, YEAR = {2011}, PAGES = {475--483}, } @INPROCEEDINGS{Hullin2011ETech, AUTHOR = {Hullin, Matthias and Lensch, Hendrik and Raskar, Ramesh and Seidel, Hans-Peter and Ihrke, Ivo}, TITLE = {A Dynamic {BRDF} Display}, BOOKTITLE = {SIGGRAPH Emerging Technologies}, PADDRESS = {Vancouver}, ADDRESS = {Vancouver}, PUBLISHER = {ACM}, YEAR = {2011}, } @PHDTHESIS{HullinPhD2010, AUTHOR = {Hullin, Matthias B.}, TITLE = {Reconsidering Light Transport -- Acquisition and Display of Real-World Reflectance and Geometry}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {December}, YEAR = {2010}, PAGES = {123}, ABSTRACT = {In this thesis, we cover three scenarios that violate common simplifying assumptions about the nature of light transport. We begin with the first ingredient to any 3D rendering: a geometry model. Most 3D scanners require the object-of-interest to show diffuse reflectance. The further a material deviates from the Lambertian model, the more likely these setups are to produce corrupted results. By placing a traditional laser scanning setup in a participating (in particular, fluorescent) medium, we have built a light sheet scanner that delivers robust results for a wide range of materials, including glass. Further investigating the phenomenon of fluorescence, we notice that, despite its ubiquity, it has received moderate attention in computer graphics. In particular, to date no data-driven reflectance models of fluorescent materials have been available. To describe the wavelength-shifting reflectance of fluorescent materials, we define the bispectral bidirectional reflectance and reradiation distribution function (BRRDF), for which we introduce an image-based measurement setup as well as an effcient acquisition scheme. Finally, we envision a computer display that shows materials instead of colours, and present a prototypical device that can exhibit anisotropic reflectance distributions similar to com- mon models in computer graphics.}, } @INPROCEEDINGS{HullinSIGGRAPH08, AUTHOR = {Hullin, Matthias B. and Fuchs, Martin and Ihrke, Ivo and Seidel, Hans-Peter and Lensch, Hendrik P. A.}, TITLE = {Fluorescent Immersion Range Scanning}, BOOKTITLE = {ACM Transactions on Graphics (Proceedings of SIGGRAPH 2008)}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {August}, VOLUME = {27}, ISBN = {0730-0301}, DOI = {10.1145/1360612.1360686}, YEAR = {2008}, PAGES = {87:1--87:10}, ABSTRACT = {The quality of a 3D range scan should not depend on the surface properties of the object. Most active range scanning techniques, however, assume a diffuse reflector to allow for a robust detection of incident light patterns. In our approach we embed the object into a fluorescent liquid. By analyzing the light rays that become visible due to fluorescence rather than analyzing their reflections off the surface, we can detect the intersection points between the projected laser sheet and the object surface for a wide range of different materials. For transparent objects we can even directly depict a slice through the object in just one image by matching its refractive index to the one of the embedding liquid. This enables a direct sampling of the object geometry without the need for computational reconstruction. This way, a high-resolution 3D volume can be assembled simply by sweeping a laser plane through the object. We demonstrate the effectiveness of our light sheet range scanning approach on a set of objects manufactured from a variety of materials and material mixes, including dark, translucent and transparent objects.}, } @INPROCEEDINGS{HullinVMV2008, AUTHOR = {Hullin, Matthias B. and Fuchs, Martin and Ihrke, Ivo and Ajdin, Boris and Seidel, Hans-Peter and Lensch, Hendrik P. A.}, EDITOR = {Deussen, Oliver and Keim, Daniel and Saupe, Dietmar}, TITLE = {Direct Visualization of Real-World Light Transport}, BOOKTITLE = {13th International Fall Workshop on Vision, Modeling and Visualization}, PADDRESS = {Heidelberg}, ADDRESS = {Konstanz, Germany}, PUBLISHER = {Akademische Verlagsgesellschaft AKA}, MONTH = {October}, ISBN = {978-3-89838-609-8}, YEAR = {2008}, PAGES = {363--371}, ABSTRACT = {Light transport in complex scenes with possibly intricate optical properties is difficult to grasp intuitively. The study of light transport has so far mainly been conducted by indirect observations. Cameras or human observers typically only sense the radiance reflected from a scene, i.e. the light directly emitted or reflected from the last bounce of a possibly much longer light path. Models for the propagation of light, however, typically assume light waves or rays, concepts which so far have been communicated in an abstract way using formulas or sketches. In this paper, we propose the use of fluorescent fluids for direct visualization of light transport in the real world. In the fluorescent fluid the traces of light become visible as a small fraction of the energy transported along the ray is scattered out towards the viewer. We demonstrate this visualization for direct illumination effects such as reflections and refractions at various surfaces, as well as for global effects such as subsurface light transport in translucent material, caustics, or interreflections. As this allows for the inspection of entire light paths, rather than the last scattering event, we believe that this novel visualization can help to intuitively explain the phenomena of light transport to students and experts alike.}, } @INPROCEEDINGS{i3dKlehm2013, AUTHOR = {Klehm, Oliver and Ihrke, Ivo and Seidel, Hans-Peter and Eisemann, Elmar}, EDITOR = {Olano, Marc and Otaduy, Miguel A. and Meenakshisundaram, Gopi and Yoon, Sung-Eui}, TITLE = {Volume Stylizer: Tomography-based Volume Painting}, BOOKTITLE = {Proc. ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (i3D)}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, NY}, ADDRESS = {Orlando, USA}, PUBLISHER = {ACM}, MONTH = {March}, ISBN = {978-1-4503-1956-0}, DOI = {10.1145/2448196.2448222}, YEAR = {2013}, PAGES = {161--168}, ABSTRACT = {Volumetric phenomena are an integral part of standard rendering, yet, no suitable tools to edit characteristic properties are available so far. Either simulation results are used directly, or modifications are high-level, e.g., noise functions to influence appearance. Intuitive artistic control is not possible. We propose a solution to stylize single-scattering volumetric effects. Emission, scattering and extinction become amenable to artistic control while preserving a smooth and coherent appearance when changing the viewpoint. Our approach lets the user define a number of target views to be matched when observing the volume from this perspective. Via an analysis of the volumetric rendering equation, we can show how to link this problem to tomographic reconstruction.}, } @ARTICLE{idhs02a, AUTHOR = {Ivrissimtzis, Ioannis and Dodgson, Neil A. and Hassan, Mohamed and Sabin, Malcolm}, JOURNAL = {Computer Aided Geometric Design}, TITLE = {The refinability of the 4-point scheme}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {4}, PUBLISHER = {Elsevier}, MONTH = {April}, VOLUME = {19}, YEAR = {2002}, PAGES = {235--238}, } @ARTICLE{idhs02b, AUTHOR = {Ivrissimtzis, Ioannis and Dodgson, Neil A. and Hassan, Mohamed and Sabin, Malcolm}, JOURNAL = {International Journal Shape Modeling}, TITLE = {On the Geometry of Recursive Subdivision}, NUMBER = {1}, MONTH = {June}, VOLUME = {8}, YEAR = {2002}, PAGES = {23--42}, } @INPROCEEDINGS{ids02a, AUTHOR = {Ivrissimtzis, Ioannis and Dodgson, Neil A. and Sabin, Malcolm}, EDITOR = {Wyvill, Geoff}, TITLE = {Recursive Subdivision and Hypergeometric Functions}, BOOKTITLE = {Proceedings of the Shape Modeling International 2002}, PADDRESS = {USA}, ADDRESS = {Banff, Alberta, Canada}, PUBLISHER = {IEEE}, MONTH = {May}, YEAR = {2002}, PAGES = {29--34}, } @TECHREPORT{ids02b, AUTHOR = {Ivrissimtzis, Ioannis and Sabin, Malcolm and Dodgson, Neil A.}, TITLE = {On the support of recursive subdivision}, INSTITUTION = {Cambridge University}, TYPE = {Research Report}, ADDRESS = {Cambridge, UK}, NUMBER = {UCAM-CL-TR-544}, MONTH = {September}, ISBN = {1476-2986}, YEAR = {2002}, PAGES = {20}, } @TECHREPORT{ids02c, AUTHOR = {Ivrissimtzis, Ioannis and Dodgson, Neil A. and Sabin, Malcolm}, TITLE = {A generative classification of mesh refinement rules with lattice transformations}, INSTITUTION = {Cambridge University}, TYPE = {Research Report}, ADDRESS = {Cambridge, UK}, NUMBER = {UCAM-CL-TR-542}, MONTH = {September}, ISBN = {1476-2986}, YEAR = {2002}, PAGES = {13}, } @ARTICLE{ids2004a, AUTHOR = {Ivrissimtzis, Ioannis and Dodgson, Neil A. and Sabin, Malcolm}, JOURNAL = {Computer Aided Geometric Design}, TITLE = {A generative classification of mesh refinement rules with lattice transformations}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {1}, PUBLISHER = {Elsevier}, VOLUME = {21}, ISBN = {0167-8396}, YEAR = {2004}, PAGES = {99--109}, } @INCOLLECTION{ids2004b, AUTHOR = {Ivrissimtzis, Ioannis and Dodgson, Neil A. and Sabin, Malcolm}, EDITOR = {Dodgson, Neil A. and Floater, Michael S. and Sabin, Malcolm}, TITLE = {sqrt(5)-subdivision}, BOOKTITLE = {Advances in Multiresolution for Geometric Modelling}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Springer}, SERIES = {Mathematics and Visualization}, ISBN = {3-540-21462-3}, YEAR = {2004}, PAGES = {285--299}, } @INPROCEEDINGS{Ihrke2004a, AUTHOR = {Ihrke, Ivo and Magnor, Marcus}, TITLE = {Image-Based Tomographic Reconstruction of Flames}, BOOKTITLE = {Proc. of SCA}, PADDRESS = {Grenoble}, ADDRESS = {Grenoble}, PUBLISHER = {EG}, YEAR = {2004}, PAGES = {367--375}, } @INPROCEEDINGS{Ihrke2004b, AUTHOR = {Ihrke, Ivo and Ahrenberg, Lukas and Magnor, Marcus}, TITLE = {External camera calibration for synchronized multi-video systems}, BOOKTITLE = {Proc. of WSCG}, PADDRESS = {Plzen}, ADDRESS = {Plzen}, YEAR = {2004}, PAGES = {537--544}, } @INPROCEEDINGS{Ihrke2005a, AUTHOR = {Ihrke, Ivo and Magnor, Marcus}, TITLE = {Adaptive Grid Optical Tomography}, BOOKTITLE = {Proc. of VVG}, PADDRESS = {Edinburgh}, ADDRESS = {Edinburgh}, YEAR = {2005}, PAGES = {141--148}, } @INPROCEEDINGS{Ihrke2005b, AUTHOR = {Ihrke, Ivo and Goldl{\"u}cke, Bastian, and Magnor, Marcus}, TITLE = {Reconstructing the Geometry of Flowing Water}, BOOKTITLE = {Proc. of ICCV}, PADDRESS = {Beijing}, ADDRESS = {Beijing}, YEAR = {2005}, PAGES = {1--8}, } @INPROCEEDINGS{Ihrke2006, AUTHOR = {Ihrke, Ivo and Magnor, Marcus}, TITLE = {Adaptive Grid Optical Tomography}, BOOKTITLE = {Graphical Models}, PADDRESS = {unknown}, ADDRESS = {unknown}, PUBLISHER = {Elsevier}, YEAR = {2006}, PAGES = {484--495}, } @INPROCEEDINGS{Ihrke2008, AUTHOR = {Ihrke, Ivo and Stich, Timo and Gottschlich, Heiko and Magnor, Marcus and Seidel, Hans-Peter}, TITLE = {Fast Incident Light Field Acquisition and Rendering}, BOOKTITLE = {Journal of WSCG}, PADDRESS = {Plzen}, ADDRESS = {Plzen}, PUBLISHER = {??}, YEAR = {2008}, PAGES = {25--32}, } @INPROCEEDINGS{Ihrke2008c, AUTHOR = {Ihrke, Ivo and Kutulakos, Kyros, and Lensch, Hendrik and Magnor, Marcus and Heidrich, Wolfgang}, TITLE = {State of the Art in Transparent and Specular Object Reconstruction}, BOOKTITLE = {EUROGRAPHICS Star Proceedings}, PADDRESS = {unknown}, ADDRESS = {Crete, Greece}, PUBLISHER = {EG}, YEAR = {2008}, PAGES = {87--108}, } @ARTICLE{Ihrke2009, AUTHOR = {Atcheson, Bradley and Heidrich, Wolfgang and Ihrke, Ivo}, JOURNAL = {Experiments in Fluids}, TITLE = {An Evaluation of Optical Flow Algorithms for Background Oriented Schlieren Imaging}, BOOKTITLE = {Experiments in Fluids}, ADDRESS = {Berlin}, NUMBER = {3}, PUBLISHER = {Springer}, MONTH = {March}, VOLUME = {46}, ISBN = {0723-4864}, DOI = {10.1007/s00348-008-0572-7}, YEAR = {2009}, PAGES = {467--476}, } @INCOLLECTION{Ihrke2009a, AUTHOR = {Ihrke, Ivo and Berger, Kai and Atcheson, Bradley and Magnor, Marcus and Heidrich, Wolfgang}, TITLE = {Tomographic Reconstruction and Efficient Rendering of Refractive Gas Flows}, BOOKTITLE = {Notes on Numerical Fluid Mechanics and Multidisciplinary Design}, ADDRESS = {Berlin/Heidelberg}, PUBLISHER = {Springer}, YEAR = {2009}, PAGES = {145--154}, } @INPROCEEDINGS{Ihrke2009b, AUTHOR = {Bradley, Derek and Atcheson, Bradley and Ihrke, Ivo and Heidrich, Wolfgang}, TITLE = {Synchronization and Rolling Shutter Compensation for Consumer Video Camera Arrays}, BOOKTITLE = {Proc. of PROCAMS}, PADDRESS = {unknown}, ADDRESS = {Miami}, YEAR = {2009}, PAGES = {1--8}, } @INPROCEEDINGS{Ihrke2009d, AUTHOR = {Berger, Kai and Ihrke, Ivo and Atcheson, Bradley and Heidrich Wolfgang and Magnor, Marcus}, EDITOR = {Magnor, Marcus and Rosenhahn, Bodo and Theisel, Holger}, TITLE = {Tomographic 4D Reconstruction of Gas Flows in the Presence of Occluders}, BOOKTITLE = {Proceedings of the Vision, Modeling, and Visualization Workshop 2009 (VMV 2009)}, PADDRESS = {Magdeburg, Germany}, ADDRESS = {Braunschweig, Germany}, PUBLISHER = {Otto-Von-Guericke-Universit{\"a}t}, ISBN = {978-3-9804874-8-1}, YEAR = {2009}, PAGES = {29--36}, } @INPROCEEDINGS{Ihrke2009SPIE, AUTHOR = {Ihrke, Matthias and Ritschel, Tobias and Smith, Kaleigh and Grosch, Thorsten and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Rogowitz, Bernice E. and Pappas, Thrasyvoulos N.}, TITLE = {A Perceptual Evaluation of 3D Unsharp Masking}, BOOKTITLE = {Human Vision and Electronic Imaging XIV}, PADDRESS = {Bellingham, Washington}, ADDRESS = {San Jose, CA}, PUBLISHER = {SPIE}, MONTH = {January}, SERIES = {Proceedings of SPIE}, VOLUME = {7240}, ISBN = {9780819474902}, DOI = {10.1117/12.809026}, YEAR = {2009}, PAGES = {72400R:1--72400R:12}, ABSTRACT = {Much research has gone into developing methods for enhancing the contrast of displayed 3D scenes. In the current study, we investigated the perceptual impact of an algorithm recently proposed by Ritschel et al.1 that provides a general technique for enhancing the perceived contrast in synthesized scenes. Their algorithm extends traditional image-based Unsharp Masking to a 3D scene, achieving a scene-coherent enhancement. We conducted a standardized perceptual experiment to test the proposition that a 3D unsharp enhanced scene was superior to the original scene in terms of perceived contrast and preference. Furthermore, the impact of different settings of the algorithm’s main parameters enhancement-strength (¸) and gradient size (¾) were studied in order to provide an estimate of a reasonable parameter space for the method. All participants preferred a clearly visible enhancement over the original, non-enhanced scenes and the setting for objectionable enhancement was far above the preferred settings. The effect of the gradient size ¾ was negligible. The general pattern found for the parameters provides a useful guideline for designers when making use of 3D Unsharp Masking: as a rule of thumb they can easily determine the strength for which they start to perceive an enhancement and use twice this value for a good effect. Since the value for objectionable results was twice as large again, artifacts should not impose restrictions on the applicability of this rule.}, } @INPROCEEDINGS{Ihrke2010a, AUTHOR = {Wetzstein, Gordon and Ihrke, Ivo and Heidrich, Wolfgang}, TITLE = {Sensor Saturation in {Fourier} Multiplexed Imaging}, BOOKTITLE = {2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010). - Pt. 1}, PADDRESS = {Piscataway, NJ}, ADDRESS = {San Francisco}, PUBLISHER = {IEEE}, ISBN = {978-1-424-46984-0}, DOI = {10.1109/CVPR.2010.5540166}, YEAR = {2010}, PAGES = {545--552}, } @INPROCEEDINGS{Ihrke2010b, AUTHOR = {Ihrke, Ivo and Wetzstein, Gordon and Heidrich, Wolfgang}, TITLE = {A Theory of Plenoptic Multiplexing}, BOOKTITLE = {2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010). - Pt. 1}, PADDRESS = {Piscataway, NJ}, ADDRESS = {San Francisco}, PUBLISHER = {IEEE}, ISBN = {978-1-424-46984-0}, DOI = {10.1109/CVPR.2010.5540174}, YEAR = {2010}, PAGES = {483--490}, } @ARTICLE{Ihrke2010c, AUTHOR = {Ihrke, Ivo and Kutulakos, Kyros and Lensch, Hendrik and Magnor, Marcus and Heidrich, Wolfgang}, JOURNAL = {Computer Graphics Forum}, TITLE = {Transparent and Specular Object Reconstruction}, BOOKTITLE = {Computer Graphics Forum}, ADDRESS = {Oxford, UK}, NUMBER = {8}, PUBLISHER = {Blackwell}, VOLUME = {29}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2010.01753.x}, YEAR = {2010}, PAGES = {2400--2426}, } @INCOLLECTION{Ihrke2011, AUTHOR = {Ihrke, Ivo}, TITLE = {Opacity}, BOOKTITLE = {Encyclopedia of Computer Vision}, ADDRESS = {Berlin/Heidelberg}, PUBLISHER = {Springer}, YEAR = {2014}, } @INPROCEEDINGS{Ihrke2012, AUTHOR = {Ihrke, Ivo and Reshetouski, Ilya and Manakov, Alkhazur and Seidel, Hans-Peter}, TITLE = {Three-Dimensional Kaleidoscopic Imaging}, BOOKTITLE = {Proc. OSA Computational Optical Sensing and Imaging}, PADDRESS = {Monterey}, ADDRESS = {Monterey, CA}, PUBLISHER = {OSA}, YEAR = {2012}, PAGES = {1--3}, } @INPROCEEDINGS{Ihrke2012a, AUTHOR = {Ihrke, Ivo and Reshetouski, Ilya and Manakov, Alkhazur and Tevs, Art and Wand, Michael and Seidel, Hans-Peter}, TITLE = {A Kaleidoscopic Approach to Surround Geometry and Reflectance Acquisition}, BOOKTITLE = {IEEE CVPR Workshops on Computational Cameras and Displays}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Providence, RI}, PUBLISHER = {IEEE}, MONTH = {June}, DOI = {10.1109/CVPRW.2012.6239347}, YEAR = {2012}, PAGES = {29--36}, } @PHDTHESIS{Ihrke2012b, AUTHOR = {Ihrke, Ivo}, TITLE = {Computational Optical Measurement and Display: Case Studies in Plenoptic Imaging and Projection}, SCHOOL = {Universite de Bordeaux}, TYPE = {Habilitation thesis}, MONTH = {December}, YEAR = {2012}, PAGES = {228}, ABSTRACT = {Advances in imaging technology have to a large extent shaped scientific progress in the last 200 years. While progress in imaging technology originated in, and forced the development of, the field of optics, the design paradigm for optical instruments has always placed the human observer at the center of its efforts. With the advent of electronic computation in the second half of the 20th century, optical design could be elevated to a new level by exploiting computer-aided design and automated optimization procedures. However, only in recent years have computers become so powerful, and at the same time so small and inexpensive, that imaging technology, storage and transmission have become completely digitized. This move has not yet reached its full potential since the human observer is still considered the target of optimization, whereas in fact, today's primary observers are computers. It is this insight that enables an entirely new approach to optics and measurement instrumentation. Images no longer have to mimic what the human brain is accustomed to interpret as an image of the world, i.e. integrals over ray bundles of a restricted subset of the electro-magnetic spectrum. Instead, sensing mechanisms can be designed that re-distribute directional, spatial, temporal and wavelength information to essentially agnostic sensor elements serving as simple photon collectors. The questions of how such redistribution can be arranged for, which performance characteristics are to be expected of such devices, and how these novel sensing means can be used for measurement purposes form the basis and contents of this thesis. In particular examples, investigations into these larger questions are explored in detail. Through these studies we arrive at a larger picture of the current state of affairs: We have glimpsed at the exciting possibilities of computational optical imaging, however, we have seen a mountain of formidable size and difficulty, the ascend of which will require significant effort. This is how the subtitle of this thesis is to be understood.}, } @PHDTHESIS{IhrkePhD2007, AUTHOR = {Ihrke, Ivo}, TITLE = {Reconstruction and Rendering of Time-Varying Natural Phenomena}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {May}, YEAR = {2007}, } @INPROCEEDINGS{iigs2005, AUTHOR = {Isenburg, Martin and Ivrissimtzis, Ioannis and Gumhold, Stefan and Seidel, Hans-Peter}, EDITOR = {J{\"u}ttler, Bert}, TITLE = {Geometry prediction for high degree polygons}, BOOKTITLE = {21st Spring Conference on Computer Graphics (SCCG 2005)}, PADDRESS = {Bratislava, Slovakia}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {Comenius University}, ISBN = {80-223-2057-9}, YEAR = {2005}, PAGES = {147--152}, } @INPROCEEDINGS{ijlls05, AUTHOR = {Ivrissimtzis, Ioannis and Jeong, Won-Ki and Lee, Seungyong and Lee, Yunjin and Seidel, Hans-Peter}, TITLE = {Surface Reconstruction with Neural Meshes}, BOOKTITLE = {6th International Conference on Mathematical Methods for Curves and Surfaces}, PADDRESS = {Brentwood, USA}, ADDRESS = {Tromso, Norway}, PUBLISHER = {Nashboro Press}, ISBN = {0-9728482-4-X}, YEAR = {2005}, PAGES = {223--242}, } @INPROCEEDINGS{ijs03, AUTHOR = {Ivrissimtzis, Ioannis and Jeong, Won-Ki and Seidel, Hans-Peter}, EDITOR = {Kim, Myung-Soo}, TITLE = {Using growing cell structures for surface reconstruction}, BOOKTITLE = {Shape Modeling International 2003 (SMI 2003)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Seoul, Korea}, PUBLISHER = {IEEE}, MONTH = {May}, ISBN = {0-7695-1909-1}, YEAR = {2003}, PAGES = {78--86}, } @INPROCEEDINGS{ik03bo, AUTHOR = {Belyaev, Alexander and Ohtake, Yutaka}, TITLE = {A comparison of mesh smoothing methods}, BOOKTITLE = {Israel-Korea Bi-National Conference on Geometric Modeling and Computer Graphics}, PADDRESS = {Tel Aviv, Israel}, ADDRESS = {Tel-Aviv, Israel}, PUBLISHER = {Tel Aviv University}, YEAR = {2003}, PAGES = {83--87}, } @INPROCEEDINGS{illjs04, AUTHOR = {Ivrissimtzis, Ioannis and Lee, Yunjin and Lee, Seungyong and Jeong, Won-Ki and Seidel, Hans-Peter}, EDITOR = {Aloimonos, Yiannis and Taubin, Gabriel}, TITLE = {Neural Mesh Ensembles}, BOOKTITLE = {2nd International Symposium on 3D Data Processing, Visualization, and Transmission, 3DPVT 2004}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Thessaloniki, Greece}, PUBLISHER = {IEEE}, ISBN = {0-7695-2223-8}, YEAR = {2004}, PAGES = {308--315}, } @INPROCEEDINGS{irs02a, AUTHOR = {Ivrissimtzis, Ioannis and R{\"o}ssl, Christian and Seidel, Hans-Peter}, EDITOR = {Coquillart, Sabine and Shum, Heung-Yeung and Hu, Shi-Min}, TITLE = {A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding}, BOOKTITLE = {Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2002)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Beijing, China}, PUBLISHER = {IEEE}, ISBN = {0-7695-1784-6}, YEAR = {2002}, PAGES = {294--303}, ABSTRACT = {We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the mesh into two submeshes which are encoded separately in a recursive process. We introduce a novel data structure for triangle mesh encoding, a binary tree with positive integer weights assigned to its nodes. The length of the initial strip is stored in the root of the binary tree, while the encoding of the left and right submesh are stored in the left and right subtree, respectively. We find a simple criterion determining which objects of this data structure correspond to triangle meshes. As the algorithm implicitly traverses the triangles of the mesh, it can be classified into the family of Edgebreaker like encoding schemes. Hence, the compression ratios, both in the form of theoretical upper bounds and practical results are similar to the Edgebreaker's, while the simplicity and flexibility of the algorithm makes it particularly suitable for applications where the connectivity encoding is only a small part of the problem at hand.}, } @INCOLLECTION{IRS:2003:TBDS, AUTHOR = {Ivrissimtzis, Ioannis and R{\"o}ssl, Christian and Seidel, Hans-Peter}, EDITOR = {Brunnett, Guido and Hamann, Bernd and M{\"u}ller, Heinrich}, TITLE = {Tree-based Data Structures for Triangle Mesh Connectivity Encoding}, BOOKTITLE = {Geometric Modeling for Scientific Visualization}, ADDRESS = {Heidelberg, Germany}, PUBLISHER = {Springer}, YEAR = {2003}, PAGES = {171--187}, } @INPROCEEDINGS{is02a, AUTHOR = {Ivrissimtzis, Ioannis and Seidel, Hans-Peter}, EDITOR = {Suzuki, Hiromasa and Martin, Ralph}, TITLE = {Polyhedra Operators for Mesh Refinement}, BOOKTITLE = {Proceedings of Geometric Modeling and Processing 2002}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Wako, Saitama, Japan}, PUBLISHER = {IEEE}, MONTH = {July}, YEAR = {2002}, PAGES = {132--137}, } @INPROCEEDINGS{is03, AUTHOR = {Ivrissimtzis, Ioannis and Seidel, Hans-Peter}, EDITOR = {Wilson, Michael J. and Martin, Ralph}, TITLE = {Combinatorial Properties of Subdivision Meshes}, BOOKTITLE = {Mathematics of surfaces : 10th IMA International Conference}, ORGANIZATION = {Institute of Mathematics and its Applications}, PADDRESS = {Berlin, Germany}, ADDRESS = {Leeds, UK}, PUBLISHER = {Springer}, MONTH = {September}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {2768}, ISBN = {0302-9743}, YEAR = {2003}, PAGES = {73--84}, } @ARTICLE{is2004a, AUTHOR = {Ivrissimtzis, Ioannis and Seidel, Hans-Peter}, JOURNAL = {Computing}, TITLE = {Evolutions of Polygons in the Study of Subdivision Surfaces}, ADDRESS = {Vienna, Austria}, NUMBER = {1-2}, PUBLISHER = {Springer}, VOLUME = {72}, ISBN = {0010-485X}, YEAR = {2004}, PAGES = {93--103}, } @ARTICLE{isd2004, AUTHOR = {Ivrissimtzis, Ioannis and Sabin, Malcolm and Dodgson, Neil A.}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {On the support of recursive subdivision}, ADDRESS = {New York, USA}, NUMBER = {4}, PUBLISHER = {ACM}, VOLUME = {23}, ISBN = {0730-0301}, YEAR = {2004}, PAGES = {1043--1060}, } @ARTICLE{ISPM2006, AUTHOR = {Theobalt, Christian and Ahmed, Naveed and Ziegler, Gernot and Seidel, Hans-Peter}, JOURNAL = {IEEE Signal Processing Magazine}, TITLE = {High-quality Reconstruction of Virtual Actors from Multi-view Video Streams}, ADDRESS = {New York}, NUMBER = {6}, PUBLISHER = {IEEE Signal Processing Society}, MONTH = {November}, VOLUME = {24}, ISBN = {1053-5888}, DOI = {10.1109/MSP.2007.905701}, YEAR = {2007}, PAGES = {45--57}, } @INPROCEEDINGS{iss03, AUTHOR = {Ivrissimtzis, Ioannis and Shrivastava, Kanishka and Seidel, Hans-Peter}, EDITOR = {Cohen, Albert and Merrien, Jean-Louis and Schumaker, Larry L.}, TITLE = {Subdivision Rules for General Meshes}, BOOKTITLE = {Curve and Surface Fitting: Saint-Malo 2002}, ORGANIZATION = {L' Association Fran{\c{c}}aise d'Approximation (AFA)}, PADDRESS = {Brentwood, USA}, ADDRESS = {St Malo, France}, PUBLISHER = {Nashboro Press}, SERIES = {Proceedings of the 5th Conference on Curves and Surfaces}, VOLUME = {2}, ISBN = {0-9728482-1-5}, YEAR = {2003}, PAGES = {229--238}, } @TECHREPORT{IvrissimtzisJeongLeeLeeSeidel2004, AUTHOR = {Ivrissimtzis, Ioannis and Jeong, Won-Ki and Lee, Seungyong and Lee, Yunjin and Seidel, Hans-Peter}, TITLE = {Neural Meshes: Surface Reconstruction with a Learning Algorithm}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, TYPE = {Research Report}, ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-2004-4-005}, PUBLISHER = {AG 4 - Seidel}, MONTH = {October}, ISBN = {0946-011X}, YEAR = {2004}, PAGES = {22}, ABSTRACT = {In this paper we propose a Learning algorithm for surface reconstruction. Our algorithm simulates an incrementally expanding neural network which learns a point cloud through a competitive learning process. The topology is learned through statistics based operators which create boundaries and merge them to create handles. We study the algorithm theoretically, analyzing statistically its main components, and experimentally, using an extensive range of input data sets.}, } @TECHREPORT{IvrissimtzisJeongSeidel2003, AUTHOR = {Ivrissimtzis, Ioannis and Jeong, Won-Ki and Seidel, Hans-Peter}, TITLE = {Neural Meshes: Statistical Learning Methods in Surface Reconstruction}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Saarbr{\"u}cken}, NUMBER = {MPI-I-2003-4-007}, MONTH = {April}, YEAR = {2003}, PAGES = {23}, } @ARTICLE{ivris_singerman_04, AUTHOR = {Ivrissimtzis, Ioannis and Singerman, David}, JOURNAL = {European Journal of Combinatorics}, TITLE = {Regular maps and principal congruence subgroups of Hecke groups}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {3-4}, PUBLISHER = {Elsevier}, MONTH = {April}, VOLUME = {26}, ISBN = {0195-6698}, YEAR = {2005}, PAGES = {437--456}, } @INPROCEEDINGS{izs2004a, AUTHOR = {Ivrissimtzis, Ioannis and Zayer, Rhaleb and Seidel, Hans-Peter}, EDITOR = {Giannini, Franca and Pasko, Alexander}, TITLE = {Polygonal decomposition of the 1-ring neighborhood of the {Catmull-Clark} scheme}, BOOKTITLE = {Shape Modeling International 2004 (SMI 2004)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Genoa, Italy}, PUBLISHER = {IEEE}, MONTH = {June}, ISBN = {0-7695-2075-8}, YEAR = {2004}, PAGES = {101--109}, } @ARTICLE{izs2005a, AUTHOR = {Ivrissimtzis, Ioannis and Zayer, Rhaleb and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics \& Geometry}, TITLE = {Polygonal decompositions of quadrilateral subdivision meshes}, ADDRESS = {Moscow, Russia}, NUMBER = {1}, PUBLISHER = {Moscow Engineering Physics Institute (MEPhI)}, VOLUME = {7}, ISBN = {1811-8992}, YEAR = {2005}, PAGES = {16--30}, ABSTRACT = {We study a polygonal decomposition of the 1-ring neighborhood of a quadrilateral mesh. This decomposition corresponds to the eigenvectors of a matrix with circulant blocks, thus, it is suitable for the study of subdivision schemes. First, we calculate the extent of the local mesh area we have to consider in order to get a geometrically meaningful decomposition. Then we concentrate on the Catmull-Clark scheme and decompose the 1-ring neighborhood into 2n planar 2n-gons, which under subdivision scheme transform into 4n planar n-gons coming in pairs of coplanar polygons and quadruples of parallel polygons. We calculate the eigenvalues and eigenvectors of the transformations of these configurations showing their relation with the tangent plane and the curvature properties of the subdivision surface. Using direct computations on circulant-block matrices we show how the same eigenvalues can be analytically deduced from the subdivision matrix.}, } @ARTICLE{jacobson12a, AUTHOR = {Jacobson, Alec and Weinkauf, Tino and Sorkine, Olga}, JOURNAL = {Computer Graphics Forum}, TITLE = {Smooth Shape-Aware Functions with Controlled Extrema}, ADDRESS = {Oxford, UK}, NUMBER = {5}, PUBLISHER = {Blackwell Publ.}, MONTH = {July}, VOLUME = {31}, DOI = {10.1111/j.1467-8659.2012.03163.x}, YEAR = {2012}, PAGES = {1577--1586}, ABSTRACT = {Functions that optimize Laplacian-based energies have become popular in geometry processing, e.g. for shape deformation, smoothing, multiscale kernel construction and interpolation. Minimizers of Dirichlet energies, or solutions of Laplace equations, are harmonic functions that enjoy the maximum principle, ensuring no spurious local extrema in the interior of the solved domain occur. However, these functions are only C0 at the constrained points, which often causes smoothness problems. For this reason, many applications optimize higher-order Laplacian energies such as biharmonic or triharmonic. Their minimizers exhibit increasing orders of continuity but lose the maximum principle and show oscillations. In this work, we identify characteristic artifacts caused by spurious local extrema, and provide a framework for minimizing quadratic energies on manifolds while constraining the solution to obey the maximum principle in the solved region. Our framework allows the user to specify locations and values of desired local maxima and minima, while preventing any other local extrema. We demonstrate our method on the smoothness energies corresponding to popular polyharmonic functions and show its usefulness for fast handle-based shape deformation, controllable color diffusion, and topologically-constrained data smoothing.}, } @INPROCEEDINGS{Jain2010Lines, AUTHOR = {Jain, Arjun and Kurz, Christian and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter}, TITLE = {Exploiting Global Connectivity Constraints for Reconstruction of {3D} Line Segment from Images}, BOOKTITLE = {2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010). - Pt. 2}, PADDRESS = {Piscataway, NJ}, ADDRESS = {San Francisco, USA}, PUBLISHER = {IEEE}, MONTH = {June}, ISBN = {978-1-424-46984-0}, DOI = {10.1109/CVPR.2010.5539781}, YEAR = {2010}, PAGES = {1586--1593}, } @ARTICLE{Jain2010MovieReshape, AUTHOR = {Jain, Arjun and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter and Theobalt, Christian}, EDITOR = {Drettakis, George}, JOURNAL = {ACM Transactions on Graphics (Proceedings of SIGGRAPH Asia 2010)}, TITLE = {MovieReshape: Tracking and Reshaping of Humans in Videos}, BOOKTITLE = {Proceedings of ACM SIGGRAPH Asia 2010}, ADDRESS = {New York, NY}, NUMBER = {6}, PUBLISHER = {ACM}, SERIES = {ACM Transactions on Graphics}, VOLUME = {29}, ISBN = {0730-0301}, DOI = {10.1145/1866158.1866174}, YEAR = {2010}, PAGES = {148,1--148,10}, } @INPROCEEDINGS{JainCVPR2011, AUTHOR = {Pishchulin, Leonid and Jain, Arjun and Wojek, Christian and Andriluka, Mykhaylo and Thorm{\"a}hlen, Thorsten and Schiele, Bernt}, TITLE = {Learning people detection models from few training samples}, BOOKTITLE = {IEEE Computer Vision and Pattern Recognition (CVPR)}, ORGANIZATION = {IEEE}, PADDRESS = {IEEE}, ADDRESS = {Colorado Springs, USA}, PUBLISHER = {IEEE}, YEAR = {2011}, PAGES = {1473--1480}, } @ARTICLE{JainEG2012, AUTHOR = {Jain, Arjun and Thorm{\"a}hlen, Thorsten and Ritschel, Tobias and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS 2012)}, TITLE = {Exploring Shape Variations by 3{D}-Model Decomposition and Part-based Recombination}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, ADDRESS = {Oxford}, NUMBER = {2}, PUBLISHER = {Blackwell}, VOLUME = {31}, YEAR = {2012}, PAGES = {631--640}, } @ARTICLE{JainSA2012, AUTHOR = {Jain, Arjun and Thorm{\"a}hlen, Thorsten and Ritschel, Tobias and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH)}, TITLE = {Material Memex: Automatic Material Suggestions for 3{D} Objects}, BOOKTITLE = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH Asia)}, ADDRESS = {New York, USA}, NUMBER = {5}, PUBLISHER = {ACM}, MONTH = {November}, SERIES = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH Asia)}, VOLUME = {31}, YEAR = {2012}, PAGES = {143:1--143:8}, } @MASTERSTHESIS{Jansen2010, AUTHOR = {Jansen, Silke}, TITLE = {Symmetry Detection in Images Using Belief Propagation}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {July}, YEAR = {2010}, PAGES = {61}, ABSTRACT = {In this thesis a general approach for detection of symmetric structures in images is presented. Rather than relying on some feature points to extract symmetries, symmetries are described using a probabilistic formulation of image self-similarity. Using a Markov random fi eld we obtain a joint probability distribution describing all assignments of the image to itself. Due to the high dimensionality of this joint distribution, we do not examine this distribution directly, but approximate its marginals in order to gather information about the symmetries with the image. In the case of perfect symmetries this approximation is done using belief propagation. A novel variant of belief propagation is introduced allowing for reliable approximations when dealing with approximate symmetries. We apply our approach to several images ranging from perfect synthetic symmetries to real-world scenarios, demonstrating the capabilities of probabilistic frameworks for symmetry detection.}, } @ARTICLE{jcise02ob, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander}, JOURNAL = {Journal of Computing and Information Science in Engineering}, TITLE = {Dual-Primal Mesh Optimization for Polygonized Implicit Surfaces with Sharp Features}, NUMBER = {4}, MONTH = {December}, VOLUME = {2}, ISBN = {1530-9827}, YEAR = {2002}, PAGES = {277--284}, ABSTRACT = {A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a better approximation of the implicit surface than the standard Marching Cubes mesh (in our experiments we use VTK Marching Cubes). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices are placed on the implicit surface and the mesh dual to the modified dual mesh is considered. Finally the vertex positions of that ``double dual'' mesh are optimized by minimizing a quadratic energy measuring a deviation of the mesh normals from the implicit surface normals computed at the vertices of the modified dual mesh. In order to achieve an accurate approximation of fine surface features, these basic steps are combined with adaptive mesh subdivision and curvature-weighted vertex resampling. The proposed method outperforms approaches based on the mesh evolution paradigm in speed and accuracy.}, } @TECHREPORT{Jenke2007, AUTHOR = {Jenke, Philipp and Wand, Michael and Stra{\ss}er, Wolfgang}, TITLE = {Efficient Surface Reconstruction for Piecewise Smooth Objects}, INSTITUTION = {Wilhelm Schickard Institut, University of T{\"u}bingen}, TYPE = {Technical Report}, ADDRESS = {T{\"u}bingen}, NUMBER = {WSI-2007-05}, YEAR = {2007}, PAGES = {17}, } @INPROCEEDINGS{Jenke2008, AUTHOR = {Jenke, Philipp and Wand, Michael and Stra{\ss}er, Wolfgang}, EDITOR = {Deussen, Oliver and Keim, Daniel and Saupe, Dietmar}, TITLE = {Patch-Graph Reconstruction for Piecewise Smooth Surfaces}, BOOKTITLE = {Proceedings Vision, Modeling and Visualization (VMV 2008)}, PADDRESS = {Heidelberg}, ADDRESS = {Konstanz, Germany}, PUBLISHER = {Akademische Verlagsgesellschaft AKA}, ISBN = {978-3-89838-609-8}, YEAR = {2008}, PAGES = {3--12}, } @ARTICLE{Jeong2002:DDSSR, AUTHOR = {Jeong, Won-Ki and Kim, Chang-Hun}, JOURNAL = {Graphical Models}, TITLE = {Direct reconstruction of displaced subdivision surface from unorganized points}, ADDRESS = {San Diego, USA}, NUMBER = {2}, PUBLISHER = {Academic Press}, MONTH = {March}, VOLUME = {64}, ISBN = {1524-0703}, YEAR = {2002}, PAGES = {78--93}, } @INPROCEEDINGS{Jeong2002:SSS, AUTHOR = {Jeong, Won-Ki and K{\"a}hler, Kolja and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Coquillart, Sabine and Shum, Heung-Yeung and Hu, Shi-Min}, TITLE = {Subdivision Surface Simplification}, BOOKTITLE = {Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2002)}, ORGANIZATION = {Tsinghua University}, TYPE = {Poster}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Beijing, China}, PUBLISHER = {IEEE}, MONTH = {October}, ISBN = {0-7695-1784-6}, YEAR = {2002}, PAGES = {477--480}, } @INPROCEEDINGS{Jeong:AGSSHM, AUTHOR = {Jeong, Won-Ki and K{\"a}hler, Kolja and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {McCool, Michael and St{\"u}rzlinger, Wolfgang}, TITLE = {{Automatic Generation of Subdivision Surface Head Models from Point Cloud Data}}, BOOKTITLE = {Graphics Interface 2002}, ORGANIZATION = {Canadian Human-Computer Communications Society}, PADDRESS = {Natick, USA}, ADDRESS = {Calgary, Canada}, PUBLISHER = {A K Peters}, MONTH = {May}, ISBN = {1-56881-183-7}, YEAR = {2002}, PAGES = {181--188}, ABSTRACT = {An automatic procedure is presented to generate a multiresolution head model from sampled surface data. A generic control mesh serves as the starting point for a fitting algorithm that approximates the points in an unstructured set of surface samples, e.g.~a point cloud obtained directly from range scans of an individual. A hierarchical representation of the model is generated by repeated refinement using subdivision rules and measuring displacements to the input data. Key features of our method are the fully automated construction process, the ability to deal with noisy and incomplete input data, and no requirement for further processing of the scan data after registering the range images into a single point cloud.}, } @INPROCEEDINGS{Jeong:DRODSSFUP:01, AUTHOR = {Jeong, Won-Ki and Kim, Chang-Hun}, TITLE = {Direct reconstruction of displaced subdivision surface from unorganized points}, BOOKTITLE = {Proceedings of the 9th Pacific Conference on Computer Graphics and Applications (PG-01)}, ORGANIZATION = {Information Processing Society of Japan(IPSJ)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Tokyo, Japan}, PUBLISHER = {IEEE}, ISBN = {0-7695-1227-5}, YEAR = {2001}, PAGES = {160--168}, } @INCOLLECTION{JGTECV2005, AUTHOR = {Brabec, Stefan and Annen, Thomas and Seidel, Hans-Peter}, EDITOR = {Barzel, Ronan}, TITLE = {Practical Shadow Mapping}, BOOKTITLE = {Graphics Tools: The JGT Editors' Choice}, TYPE = {Book Chapter}, ADDRESS = {Wellesley, MA, USA}, PUBLISHER = {A K Peters}, MONTH = {August}, ISBN = {1568812469}, YEAR = {2005}, PAGES = {217--228}, ABSTRACT = {In this paper, we present several methods that can greatly improve image quality when using the shadow mapping algorithm. Shadow artifacts introduced by shadow mapping are mainly due to low resolution shadow maps and/or the limited numerical precision used when performing the shadow test. These problems especially arise when the light source’s viewing frustum, from which the shadow map is generated, is not adjusted to the actual camera view. We show how a tight-fitting frustum can be computed such that the shadow mapping algorithm concentrates on the visible parts of the scene and takes advantage of nearly the full available precision. Furthermore, we recommend uniformly spaced depth values in contrast to perspectively spaced depths in order to equally sample the scene seen from the light source.}, } @ARTICLE{JiangBlanzToole07, AUTHOR = {Jiang, Fang and Blanz, Volker and O'Toole, Alice J.}, JOURNAL = {Vision Research}, TITLE = {The role of familiarity in three-dimensional view transferability of face identity adaptation}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {4}, PUBLISHER = {Elsevier}, MONTH = {February}, VOLUME = {47}, ISBN = {0042-6989}, YEAR = {2007}, PAGES = {525--531}, } @ARTICLE{JiangBlanzToole2006, AUTHOR = {Jiang, Fang and Blanz, Volker and O'Toole, Alice J.}, JOURNAL = {Psychological Science}, TITLE = {Probing the Visual Representation of Faces With Adaption. A View From the Other Side of the Mean.}, NUMBER = {6}, VOLUME = {17}, YEAR = {2006}, PAGES = {493--500}, } @INPROCEEDINGS{JiangGKM11_Chord_AES, AUTHOR = {Jiang, Nanzhu and Grosche, Peter and Konz, Verena and M{\"u}ller, Meinard}, TITLE = {Analyzing Chroma Feature Types for Automated Chord Recognition}, BOOKTITLE = {Proceedings of the AES 42nd International Conference: Semantic Audio}, PADDRESS = {s.l.}, ADDRESS = {Ilmenau, Germany}, PUBLISHER = {AES}, YEAR = {2011}, PAGES = {285--294}, } @INPROCEEDINGS{Jimenez05, AUTHOR = {Jim{\'e}nez, Juan-Roberto and Myszkowski, Karol and Pueyo, Xavier}, TITLE = {Interactive Global Illumination in Dynamic Participating Media Using Selective Photon Tracing}, BOOKTITLE = {SCCG '05: Proceedings of the 21st Spring Conference on Computer Graphics}, PADDRESS = {New York, NY, USA}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {ACM}, ISBN = {1-59593-203-6}, YEAR = {2005}, PAGES = {211--218}, ABSTRACT = {Global illumination in dynamic participating media is expensive, but in many applications interactivity is required. We use selective photon tracing to compute global illumination, which enables us to update mostly those photon paths that are affected by changes in the media. We enhance this technique by eliminating the need of shooting corrective photons, which leads to a significant speed-up. Also, we adaptively control spatial traced photon density in those regions in which photon-media intersection is more likely. This enables better control of local reconstruction of global illumination. Using our technique we achieve interactive speeds on a simple desktop PC.}, } @INPROCEEDINGS{jis2003, AUTHOR = {Jeong, Won-Ki and Ivrissimtzis, Ioannis and Seidel, Hans-Peter}, EDITOR = {Rokne, Jon and Klein, Reinhard and Wang, Wenping}, TITLE = {Neural Meshes: Statistical Learning based on Normals}, BOOKTITLE = {11th Pacific Conference on Computer Graphics and Applications (PG-03)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Canmore, Alberta, Canada}, PUBLISHER = {IEEE}, MONTH = {October}, ISBN = {0-7695-2028-6}, YEAR = {2003}, PAGES = {404--408}, } @ARTICLE{JWB-BPCR-2006, AUTHOR = {Jenke, Philipp and Wand, Michael and Bokeloh, Martin and Schilling, Andreas and Stra{\ss}er, Wolfgang}, JOURNAL = {Computer Graphics forum}, TITLE = {Bayesian Point Cloud Reconstruction}, ADDRESS = {Oxford, UK}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, VOLUME = {25}, YEAR = {2006}, PAGES = {379--388}, ABSTRACT = {In this paper, we propose a novel surface reconstruction technique based on Bayesian statistics: The measurement process as well as prior assumptions on the measured objects are modeled as probability distributions and Bayes' rule is used to infer a reconstruction of maximum probability. The key idea of this paper is to define both measurements and reconstructions as point clouds and describe all statistical assumptions in terms of this finite dimensional representation. This yields a discretization of the problem that can be solved using numerical optimization techniques. The resulting algorithm reconstructs both topology and geometry in form of a well-sampled point cloud with noise removed. In a final step, this representation is then converted into a triangle mesh. The proposed approach is conceptually simple and easy to extend. We apply the approach to reconstruct piecewise-smooth surfaces with sharp features and examine the performance of the algorithm on different synthetic and real-world data sets.}, } @PHDTHESIS{KaehlerDiss03, AUTHOR = {K{\"a}hler, Kolja}, TITLE = {A Head Model with Anatomical Structure for Facial Modeling and Animation}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {May}, YEAR = {2003}, } @INPROCEEDINGS{Kaehler:2002:HS, AUTHOR = {K{\"a}hler, Kolja and Haber, J{\"o}rg and Yamauchi, Hitoshi and Seidel, Hans-Peter}, EDITOR = {Spencer, Stephen N.}, TITLE = {{Head shop: Generating animated head models with anatomical structure}}, BOOKTITLE = {Proceedings of the 2002 ACM SIGGRAPH Symposium on Computer Animation}, ORGANIZATION = {Association of Computing Machinery (ACM)}, PADDRESS = {New York, USA}, ADDRESS = {San Antonio, USA}, PUBLISHER = {ACM SIGGRAPH}, MONTH = {July}, ISBN = {1-58113-573-4}, YEAR = {2002}, PAGES = {55--64}, ABSTRACT = {We present a versatile construction and deformation method for head models with anatomical structure, suitable for real-time physics-based facial animation. The model is equipped with landmark data on skin and skull, which allows us to deform the head in anthropometrically meaningful ways. On any deformed model, the underlying muscle and bone structure is adapted as well, such that the model remains completely animatable using the same muscle contraction parameters. We employ this general technique to fit a generic head model to imperfect scan data, and to simulate head growth from early childhood to adult age.}, } @ARTICLE{Kaehler:2003:RD, AUTHOR = {K{\"a}hler, Kolja and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Hodgins, Jessica K.}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Reanimating the Dead: Reconstruction of Expressive Faces from Skull Data}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2003 (SIGGRAPH-03)}, ORGANIZATION = {Association of Computing Machinery (ACM)}, ADDRESS = {New York, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {July}, SERIES = {ACM Transactions on Graphics}, VOLUME = {22}, ISBN = {0730-0301}, YEAR = {2003}, PAGES = {554--561}, NOTE = {(Proc. ACM SIGGRAPH '03)}, ABSTRACT = { Facial reconstruction for postmortem identification of humans from their skeletal remains is a challenging and fascinating part of forensic art. The former look of a face can be approximated by predicting and modeling the layers of tissue on the skull. This work is as of today carried out solely by physical sculpting with clay, where experienced artists invest up to hundreds of hours to craft a reconstructed face model. Remarkably, one of the most popular tissue reconstruction methods bears many resemblances with surface fitting techniques used in computer graphics, thus suggesting the possibility of a transfer of the manual approach to the computer. In this paper, we present a facial reconstruction approach that fits an anatomy-based virtual head model, incorporating skin and muscles, to a scanned skull using statistical data on skull / tissue relationships. The approach has many advantages over the traditional process: a reconstruction can be completed in about an hour from acquired skull data; also, variations such as a slender or a more obese build of the modeled individual are easily created. Last not least, by matching not only skin geometry but also virtual muscle layers, an animatable head model is generated that can be used to form facial expressions beyond the neutral face typically used in physical reconstructions.}, } @INPROCEEDINGS{Kaehler:dms:2001, AUTHOR = {K{\"a}hler, Kolja and Haber, J{\"o}rg and Seidel, Hans-Peter}, TITLE = {Shaping muscles for facial animation}, BOOKTITLE = {Proceedings of the International Workshop on Deformable Modeling and Soft Tissue Simulation 2001}, ORGANIZATION = {research center caesar}, PADDRESS = {n/a}, ADDRESS = {Bonn, Germany}, PUBLISHER = {n/a}, YEAR = {to appear}, PAGES = {0--0}, NOTE = {to appear}, } @INPROCEEDINGS{Kaehler:DRDTMR, AUTHOR = {K{\"a}hler, Kolja and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Ip, Horace Ho-Shing and Magnenat-Thalmann, Nadia and Lau, Rynson W. H. and Chua, Tat-Seng}, TITLE = {{Dynamic Refinement of Deformable Triangle Meshes for Rendering}}, BOOKTITLE = {Proceedings Computer Graphics International 2001}, ORGANIZATION = {IEEE Computer Society}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Hong Kong}, PUBLISHER = {IEEE}, MONTH = {July}, ISBN = {0-7695-1007-8}, YEAR = {2001}, PAGES = {285--290}, ABSTRACT = { We present a method to adaptively refine an irregular triangle mesh as it deforms in real-time. The method increases surface smoothness in regions of high deformation by splitting triangles in a fashion similar to one or two steps of Loop subdivision. The refinement is computed for an arbitrary triangle mesh and the subdivided triangles are simply passed to the rendering engine, leaving the mesh itself unchanged. The algorithm can thus be easily plugged into existing systems to enhance visual appearance of animated meshes. The refinement step has very low computational overhead and is easy to implement. We demonstrate the use of the algorithm in our physics-based facial animation system.}, } @ARTICLE{Kaehler:DRTVC:2001, AUTHOR = {K{\"a}hler, Kolja and Haber, J{\"o}rg and Seidel, Hans-Peter}, JOURNAL = {The Visual Computer}, TITLE = {Dynamically refining animated triangle meshes for rendering}, ADDRESS = {Berlin, Germany}, NUMBER = {5}, PUBLISHER = {Springer}, MONTH = {August}, VOLUME = {19}, ISBN = {0178-2789}, YEAR = {2003}, PAGES = {310--318}, ABSTRACT = {We present a method to dynamically apply local refinements to an irregular triangle mesh as it deforms in real-time. The method increases surface smoothness in regions of high deformation by splitting triangles in a fashion similar to one or two steps of Loop subdivision. The refinement is computed for an arbitrary triangle mesh and the subdivided triangles are simply passed to the rendering engine, leaving the mesh itself unchanged. The algorithm can thus be easily plugged into existing systems to enhance visual appearance of animated meshes. The refinement step has very low computational overhead and is easy to implement. We demonstrate the use of the algorithm in our physics-based facial animation system.}, } @INPROCEEDINGS{Kaehler:GBMMFA:01, AUTHOR = {K{\"a}hler, Kolja and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Watson, Benjamin and Buchanan, John W.}, TITLE = {{Geometry-based Muscle Modeling for Facial Animation}}, BOOKTITLE = {Proceedings Graphics Interface 2001 (GI-2001)}, ORGANIZATION = {Canadian Human-Computer Communications Society}, PADDRESS = {San Francisco, USA}, ADDRESS = {Ottawa, Ontario}, PUBLISHER = {Morgan Kaufmann}, MONTH = {June}, ISBN = {0-9688808-0-0}, YEAR = {2001}, PAGES = {37--46}, ABSTRACT = {We present a muscle model and methods for muscle construction that allow to easily create animatable facial models from given face geometry. Using our editing tool, one can interactively specify coarse outlines of the muscles, which are then automatically created to fit the face geometry. Our muscle model incorporates different types of muscles and the effects of bulging and intertwining muscle fibers. The influence of muscle contraction onto the skin is simulated using a mass-spring system that connects the skull, muscle, and skin layers of our model.}, } @ARTICLE{Kalojanov2012, AUTHOR = {Kalojanov, Javor and Bokeloh, Martin and Wand, Michael and Guibas, Leonidas and Seidel, Hans-Peter and Slusallek, Philipp}, JOURNAL = {Computer Graphics Forum (Proc. Eurographics Symposium on Geometry Processing)}, TITLE = {Microtiles: {Extracting} Building Blocks from Correspondences}, ADDRESS = {Oxford}, NUMBER = {5}, PUBLISHER = {Blackwell}, VOLUME = {31}, YEAR = {2012}, PAGES = {1597--1606}, } @ARTICLE{Kamradt2007, AUTHOR = {Kamradt, J{\"o}rn and Jung, Volker and Wahrheit, Kerstin and Tolosi, Laura and Rahnenf{\"u}hrer, J{\"o}rg and Schilling, Martin and Walker, Robert and Davis, Sean and Stoeckle, Michael and Meltzer, Paul and Wullich, Bernd}, JOURNAL = {PLOSone}, TITLE = {Detection of Novel Amplicons in Prostate Cancer by Comprehensive Genomic Profiling of Prostate Cancer Cell Lines Using Oligonucleotide-Based ArrayCGH}, ADDRESS = {San Francisco, USA}, NUMBER = {8}, PUBLISHER = {Public Library of Science}, MONTH = {August}, VOLUME = {2}, DOI = {10.1371/journal.pone.0000769}, YEAR = {2007}, PAGES = {1--7}, } @INPROCEEDINGS{Kautz2000AGR, AUTHOR = {Kautz, Jan and McCool, Michael}, EDITOR = {Fels, Sidney and Poulin, Pierre}, TITLE = {Approximation of Glossy Reflection with Prefiltered Environment Maps}, BOOKTITLE = {Proceedings of Graphics Interface 2000 (GI-00)}, ORGANIZATION = {CHCCS}, PADDRESS = {Toronto, Canada}, ADDRESS = {Montreal, Canada}, PUBLISHER = {Canadian Information Processing Society}, MONTH = {May}, ISBN = {0-9695338-9-6}, YEAR = {2000}, PAGES = {119--126}, } @INPROCEEDINGS{Kautz2000UAP, AUTHOR = {Kautz, Jan and V{\`a}zquez, Pere-Pau and Heidrich, Wolfgang and Seidel, Hans-Peter}, EDITOR = {P{\'e}roche, Bernard and Rushmeier, Holly}, TITLE = {A Unified Approach to Prefiltered Environment Maps}, BOOKTITLE = {Rendering Techniques 2000, Proceedings of the 11th Eurographics Workshop on Rendering}, ORGANIZATION = {Eurographics}, PADDRESS = {Vienna, Austria}, ADDRESS = {Brno, Czech Republic}, PUBLISHER = {Springer}, MONTH = {June}, SERIES = {Springer Computer Science}, ISBN = {3-211-83535-0}, YEAR = {2000}, PAGES = {185--196}, } @INPROCEEDINGS{Kautz2000:TIB, AUTHOR = {Kautz, Jan and Seidel, Hans-Peter}, EDITOR = {Spencer, Stephen N.}, TITLE = {Towards Interactive Bump Mapping with Anisotropic Shift-Variant {BRDFs}}, BOOKTITLE = {Proceedings of 2000 SIGGRAPH/Eurographics Workshop on Graphics Hardware}, ORGANIZATION = {ACM SIGGRAPH}, PADDRESS = {New York, USA}, ADDRESS = {Interlaken, Switzerland}, PUBLISHER = {ACM}, MONTH = {August}, ISBN = {1-58113-257-3}, YEAR = {2000}, PAGES = {51--58}, } @PHDTHESIS{KautzDiss03, AUTHOR = {Kautz, Jan}, TITLE = {Realistic, Real-Time Shading and Rendering of Objects with Complex Materials}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {December}, YEAR = {2002}, } @MASTERSTHESIS{Kautz:1999:HRW, AUTHOR = {Kautz, Jan}, TITLE = {Hardware Rendering with Bidirectional Reflectances}, SCHOOL = {Friedrich-Alexander-Universit{\"a}t Erlangen-N{\"u}rnberg}, TYPE = {Master's thesis}, MONTH = {January}, YEAR = {1999}, } @INPROCEEDINGS{Kautz:1999:IRW, AUTHOR = {Kautz, Jan and McCool, Michael}, EDITOR = {Lischinski, Dani and Larson, Gregory Ward}, TITLE = {Interactive Rendering with Arbitrary {BRDFs} using Separable Approximations}, BOOKTITLE = {Rendering Techniques '99: Proceedings of the 10th Eurographics Workshop on Rendering (EGRW-99)}, ORGANIZATION = {Eurographics}, PADDRESS = {Vienna, Austria}, ADDRESS = {Granada, Spain}, PUBLISHER = {Springer}, MONTH = {June}, ISBN = {3-211-83382-X}, YEAR = {1999}, PAGES = {247--260}, } @MASTERSTHESIS{Kautz:1999:MT, AUTHOR = {Kautz, Jan}, TITLE = {Interactive Glossy Reflection with Arbitrary {BRDFs}}, SCHOOL = {University of Waterloo, Canada}, TYPE = {Master's thesis}, MONTH = {October}, YEAR = {1999}, } @INPROCEEDINGS{Kautz:2001:HAD, AUTHOR = {Kautz, Jan and Seidel, Hans-Peter}, EDITOR = {Watson, Benjamin and Buchanan, John W.}, TITLE = {Hardware Accelerated Displacement Mapping for Image Based Rendering}, BOOKTITLE = {Proceedings Graphics Interface 2001 (GI-2001)}, ORGANIZATION = {Canadian Human-Computer Communications Society}, PADDRESS = {San Francisco, USA}, ADDRESS = {Ottawa, Canada}, PUBLISHER = {Morgan Kaufmann}, MONTH = {June}, ISBN = {0-96888-080-0}, YEAR = {2001}, PAGES = {61--70}, } @INPROCEEDINGS{Kautz:2001:RTB, AUTHOR = {Kautz, Jan and Heidrich, Wolfgang and Seidel, Hans-Peter}, TITLE = {Real-Time Bump Map Synthesis}, BOOKTITLE = {Proceedings of the Eurographics/SIGGRAPH Workshop on Graphics Hardware 2001}, ORGANIZATION = {Eurographics/SIGGRAPH}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, USA}, PUBLISHER = {ACM}, MONTH = {August}, YEAR = {2001}, PAGES = {109--114}, } @INPROCEEDINGS{Kautz:2002:FAB, AUTHOR = {Kautz, Jan and Sloan, Peter-Pike and Snyder, John}, EDITOR = {Debevec, Paul and Gibson, Simon}, TITLE = {Fast Arbitrary {BRDF} Shading for Low-Frequency Lighting Using Spherical Harmonics}, BOOKTITLE = {Proceedings of the 13th Eurographics Workshop on Rendering}, ORGANIZATION = {Eurographics}, PADDRESS = {San Francisco, USA}, ADDRESS = {Pisa, Italy}, PUBLISHER = {ACM}, MONTH = {June}, ISBN = {1-58113-534-3}, YEAR = {2002}, PAGES = {291--296}, ABSTRACT = {Real-time shading using general (e.g., anisotropic) BRDFs has so far been limited to a few point or directional light sources. We extend such shading to smooth, area lighting using a low-order spherical harmonic basis for the lighting environment. We represent the 4D product function of BRDF times the cosine factor (dot product of the incident lighting and surface normal vectors) as a 2D table of spherical harmonic coefficients. Each table entry represents, for a single view direction, the integral of this product function times lighting on the hemisphere expressed in spherical harmonics. This reduces the shading integral to a simple dot product of 25 component vectors, easily evaluatable on PC graphics hardware. Non-trivial BRDF models require rotating the lighting coefficients to a local frame at each point on an object, currently forming the computational bottleneck. Real-time results can be achieved by fixing the view to allow dynamic lighting or vice versa. We also generalize a previous method for precomputed radiance transfer to handle general BRDF shading. This provides shadows and interreflections that respond in real-time to lighting changes on a preprocessed object of arbitrary material (BRDF) type.}, } @INPROCEEDINGS{Kautz:2002:UDS, AUTHOR = {Kautz, Jan and Daubert, Katja and Seidel, Hans-Peter}, TITLE = {User-Defined Shading Models for VR Applications}, BOOKTITLE = {OpenSG 2002 -- 1. OpenSG Symposium}, TYPE = {Workshop Paper}, PADDRESS = {Darmstadt, Germany}, ADDRESS = {Darmstadt, Germany}, PUBLISHER = {OpenSG}, MONTH = {January}, YEAR = {2002}, PAGES = {1--5}, } @INPROCEEDINGS{Kautz:2003:MTW, AUTHOR = {Kautz, Jan and Lensch, Hendrik P. A. and Goesele, Michael and Lang, Jochen and Seidel, Hans-Peter}, EDITOR = {Feretti, Marco}, TITLE = {Modeling the World: The Virtualization Pipeline}, BOOKTITLE = {Proceedings of the 12th International Conference on Image Analysis and Processing (ICIAP' 03)}, ORGANIZATION = {IEEE}, TYPE = {Invited Talk}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Mantova, Italy}, PUBLISHER = {IEEE}, MONTH = {September}, SERIES = {International Conference on Image Analysis and Processing}, ISBN = {0-7695-1948-2}, YEAR = {2003}, PAGES = {166--175}, } @ARTICLE{Kautz:2003:RTH, AUTHOR = {Kautz, Jan and Seidel, Hans-Peter}, JOURNAL = {Journal of Graphics Tools}, TITLE = {Real-Time Halftoning}, ADDRESS = {Natick, USA}, NUMBER = {4}, PUBLISHER = {A K Peters}, MONTH = {August}, VOLUME = {7}, ISBN = {1086-7651}, YEAR = {2003}, PAGES = {27--32}, ABSTRACT = {We present a real-time hardware accelerated method for rendering objects using halftoning. It is solely based on texture mapping and creates the impression of a printed image, although the lighting and the objects can be changed and manipulated on-the-fly.}, } @BOOK{Kautz:phdbook:2003, AUTHOR = {Kautz, Jan}, TITLE = {Realistic, Real-Time Shading and Rendering of Objects with Complex Materials}, ADDRESS = {G{\"o}ttingen, Germany}, PUBLISHER = {Cuvillier}, MONTH = {April}, ISBN = {3-89873-767-5}, YEAR = {2003}, PAGES = {204}, ABSTRACT = {A long sought goal in computer graphics is to create images as realistically as possible but at the same time as quickly as possible. Many problems have to be solved in order to achieve this goal. This dissertation focuses on solving one of the main problems in real-time image synthesis: realistic shading of objects with complex optical material properties. To this end, we develop a set of new techniques and algorithms using graphics hardware. These algorithms achieve results in real-time, which are of comparable quality to offline rendering and were previously considered impossible to achieve in real-time. In particular, we propose new algorithms for bump mapping and shadowing in bump maps, several techniques for glossy reflections using environment maps, self-shadowing and interreflections for environment mapped objects, as well as displacement mapping.}, } @PHDTHESIS{Kautz:PhD:2003, AUTHOR = {Kautz, Jan}, TITLE = {Realistic, Real-Time Shading and Rendering of Objects with Complex Materials}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {G{\"o}ttingen, Germany}, PUBLISHER = {Cuvillier}, MONTH = {April}, YEAR = {2003}, ABSTRACT = {A long sought goal in computer graphics is to create images as realistically as possible but at the same time as quickly as possible. Many problems have to be solved in order to achieve this goal. This dissertation focuses on solving one of the main problems in real-time image synthesis: realistic shading of objects with complex optical material properties. To this end, we develop a set of new techniques and algorithms using graphics hardware. These algorithms achieve results in real-time, which are of comparable quality to offline rendering and were previously considered impossible to achieve in real-time. In particular, we propose new algorithms for bump mapping and shadowing in bump maps, several techniques for glossy reflections using environment maps, self-shadowing and interreflections for environment mapped objects, as well as displacement mapping.}, } @INPROCEEDINGS{Kellnhofer2013, AUTHOR = {Kellnhofer, Petr and Ritschel, Tobias and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Holzschuch, Nicolas and Rusinkiewicz, Szymon}, TITLE = {Optimizing Disparity for Motion in Depth}, BOOKTITLE = {Computer Graphics Forum (Proc. Eurographics Symposium on Rendering 2013)}, ORGANIZATION = {EUROGRAPHICS Association}, PADDRESS = {Oxford, UK}, ADDRESS = {Zaragoza, Spain}, NUMBER = {4}, PUBLISHER = {Blackwell}, MONTH = {June}, VOLUME = {32}, DOI = {10.1111/cgf.12160}, YEAR = {2013}, PAGES = {143--152}, ABSTRACT = {Beyond the careful design of stereo acquisition equipment and rendering algorithms, disparity post-processing has recently received much attention, where one of the key tasks is to compress the originally large disparity range to avoid viewing discomfort. The perception of dynamic stereo content however, relies on reproducing the full disparity-time volume that a scene point undergoes in motion. This volume can be strongly distorted in manipulation, which is only concerned with changing disparity at one instant in time, even if the temporal coherence of that change is maintained. We propose an optimization to preserve stereo motion of content that was subject to an arbitrary disparity manipulation, based on a perceptual model of temporal disparity changes. Furthermore, we introduce a novel 3D warping technique to create stereo image pairs that conform to this optimized disparity map. The paper concludes with perceptual studies of motion reproduction quality and task performance in a simple game, showing how our optimization can achieve both viewing comfort and faithful stereo motion.}, } @INPROCEEDINGS{Kellnhofer2014a, AUTHOR = {Kellnhofer, Petr and Ritschel, Tobias and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Woods, Andrew J. and Holliman, Nicolas S. and Favalora, Gregg E.}, TITLE = {Improving Perception of Binocular Stereo Motion on 3D Display Devices}, BOOKTITLE = {Proc. of SPIE-IS\&T Electronic Imaging}, PADDRESS = {PO Box 10, Bellingham WA 98227-0010 USA}, ADDRESS = {San Francisco, CA, USA}, NUMBER = {901116-1}, PUBLISHER = {SPIE}, MONTH = {March}, SERIES = {Stereoscopic Displays and Applications XXV}, VOLUME = {9011}, DOI = {doi:10.1117/12.2032389}, YEAR = {2014}, ABSTRACT = {This paper studies the presentation of moving stereo images on different display devices. We address three representative issues. First, we propose temporal compensation for the Pulfrich effect found when using anaglyph glasses. Second, we describe, how content-adaptive capture protocols can reduce false motion-in-depth sensation for time-multiplexing based displays. Third, we conclude with a recommendation how to improve rendering of synthetic stereo animations. }, } @INPROCEEDINGS{Kellnhofer2014b, AUTHOR = {Dąbała, Łukasz and Kellnhofer, Petr and Ritschel, Tobias and Didyk, Piotr and Templin, Krzysztof and Rokyta, Przemysław and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {L{\'e}vy, B. and Kautz, J.}, TITLE = {Manipulating refractive and reflective binocular disparity}, BOOKTITLE = {Computer Graphics Forum}, PADDRESS = {9600 Garsington Road, Oxford, OX4 2DQ U.K.}, ADDRESS = {Strasbourg, France}, NUMBER = {2}, PUBLISHER = {John Wiley \& Sons Ltd.}, MONTH = {May}, VOLUME = {33}, DOI = {10.1111/cgf.12290}, YEAR = {2014}, PAGES = {53--62}, ABSTRACT = {Presenting stereoscopic content on 3D displays is a challenging task, usually requiring manual adjustments. A number of techniques have been developed to aid this process, but they account for binocular disparity of surfaces that are diffuse and opaque only. However, combinations of transparent as well as specular materials are common in the real and virtual worlds, and pose a significant problem. For example, excessive disparities can be created which cannot be fused by the observer. Also, multiple stereo interpretations become possible, e. g., for glass, that both reflects and refracts, which may confuse the observer and result in poor 3D experience. In this work, we propose an efficient method for analyzing and controlling disparities in computer-generated images of such scenes where surface positions and a layer decomposition are available. Instead of assuming a single per-pixel disparity value, we estimate all possibly perceived disparities at each image location. Based on this representation, we define an optimization to find the best per-pixel camera parameters, assuring that all disparities can be easily fused by a human. A preliminary perceptual study indicates, that our approach combines comfortable viewing with realistic depiction of typical specular scenes. }, } @INPROCEEDINGS{Kellnhofer2015, AUTHOR = {Kellnhofer, Petr and Ritschel, Tobias and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Rogowitz, Bernice E. and Pappas, Thrasyvoulos N. and Ridder, Huib de}, TITLE = {A Transformation-Aware Perceptual Image Metric}, BOOKTITLE = {Proc. of SPIE-IS\&T Electronic Imaging}, PADDRESS = {PO Box 10, Bellingham WA 98227-0010 USA}, ADDRESS = {San Francisco, CA, USA}, PUBLISHER = {SPIE}, MONTH = {April}, SERIES = {Human Vision and Electronic Imaging XX}, VOLUME = {9394}, ISBN = {9781628414844}, DOI = {10.1117/12.2076754}, YEAR = {2015}, NOTE = {Human Vision and Electronic Imaging XX, edited by Bernice E. Rogowitz; Thrasyvoulos N. Pappas; Huib de Ridder,, Proc. of SPIE-IS\&T Electronic Imaging, SPIE Vol. 9394 · © 2015 SPIE-IS\&T, doi: 10.1117/12.2076754}, ABSTRACT = {Predicting human visual perception has several applications such as compression, rendering, editing and retargeting. Current approaches however, ignore the fact that the human visual system compensates for geometric transformations, e. g., we see that an image and a rotated copy are identical. Instead, they will report a large, false-positive difference. At the same time, if the transformations become too strong or too spatially incoherent, comparing two images indeed gets increasingly difficult. Between these two extrema, we propose a system to quantify the effect of transformations, not only on the perception of image differences, but also on saliency. To this end, we first fit local homographies to a given optical flow field and then convert this field into a field of elementary transformations such as translation, rotation, scaling, and perspective. We conduct a perceptual experiment quantifying the increase of difficulty when compensating for elementary transformations. Transformation entropy is proposed as a novel measure of complexity in a flow field. This representation is then used for applications, such as comparison of non-aligned images, where transformations cause threshold elevation, and detection of salient transformations.}, } @ARTICLE{kellnhofer:2014c:DarkStereo, AUTHOR = {Kellnhofer, Petr and Ritschel, Tobias and Vangorp, Peter and Myszkowski, Karol and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Applied Perception}, TITLE = {Stereo Day-for-Night: Retargeting Disparity for Scotopic Vision}, ADDRESS = {New York}, NUMBER = {3}, PUBLISHER = {ACM}, VOLUME = {11}, ISBN = {1544-3558}, DOI = {10.1145/2644813}, YEAR = {2014}, ABSTRACT = {Several approaches attempt to reproduce the appearance of a scotopic low-light night scene on a photopic display ("day-for-night") by introducing color desaturation, loss of acuity and the Purkinje shift towards blue colors. We argue that faithful stereo reproduction of night scenes on photopic stereo displays requires manipulation of not only color but also binocular disparity. To this end, we performed a psychophysics experiment to devise a model of disparity at scotopic luminance levels. Using this model, we can match binocular disparity of a scotopic stereo content displayed on a photopic monitor to the disparity that would be perceived if the scene was actually scotopic. The model allows for real-time computation of common stereo content as found in interactive applications such as simulators or computer games.}, } @INPROCEEDINGS{Kerber2007_1, AUTHOR = {Kerber, Jens and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Sbert, Mateu}, TITLE = {Feature Preserving Depth Compression of Range Images}, BOOKTITLE = {Proceedings of the 23rd Spring Conference on Computer Graphics}, PADDRESS = {Slovakia}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {Comenius University, Slovakia}, MONTH = {April}, ISBN = {978-80-223-2292-8}, YEAR = {2007}, PAGES = {110--114}, NOTE = {Winner 2nd best SCCG 2007 paper award}, ABSTRACT = {In this paper we present a new and efficient method for the depth-compression of range images in a feature preserving way. Given a range image (a depth field), the problem studied in the paper consists of achieving a high compression of the depth data while preserving (or even enhancing) perceptually important features of the image. Our approach works in the gradient domain. It combines a linear rescaling scheme with a simple enhancing technique applied to the gradient of the image. The new depth field is obtained from the enhanced and rescaled derivatives of initial range image. By four parameters a user can steer the compression ratio and the amount of details to be perceivable in the outcome. Experiments have shown that our method works very well even for high compression ratios. Applications can be of artistic nature e.g. embossment, engraving or carving.}, } @MASTERSTHESIS{Kerber2007_2, AUTHOR = {Kerber, Jens}, TITLE = {Digital Art of Bas-Relief Sculpting}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {August}, YEAR = {2007}, ABSTRACT = {In this thesis, we present a semi-automatic method for the generation of bas-reliefs from a given shape. A Bas-reliefs is an artistic sculptural representation of a three dimensional scene which possesses a negligible depth. The main idea behind our method is to work with a range image, whose depth interval size is compressed in a feature preserving way. Our approach operates in the gradient domain, whereas we also present an extension which works on the Laplacian. The algorithm relies on the achievements of High-Dynamic-Range-Compression and adapts necessary elements to our purpose. We manipulate the partial derivatives of the range image rather than the image data itself. These derivatives are compressed by applying an attenuation function which leads to a relative convergence of the entries. By a feature enhancing technique we boost small details in order to keep them perceivable in the result. In the end, the compressed and enhanced partial derivatives are recombined to the final bas-relief. The results exhibit a very small depth range but still contain perceptually important details. A user can specify the desired compression ratio and steer the relevance of small features in the outcome. The approach is intuitive, fast and works very well for high compression ratios as experiments have shown. Possible applications are of artistic nature like sculpting, embossment, engraving or carving.}, } @ARTICLE{Kerber2010_1, AUTHOR = {Kerber, Jens and Tevs, Art and Zayer, Rhaleb and Belyaev, Alexander and Seidel, Hans-Peter}, JOURNAL = {Computer-Aided Design and Applications (Special issue: CAD in the Arts)}, TITLE = {Real-time Generation of Digital Bas-Reliefs}, ADDRESS = {Tampa}, NUMBER = {4}, PUBLISHER = {Computer-Aided Design and Applications}, MONTH = {May}, VOLUME = {7}, ISBN = {1686-4360}, DOI = {10.3722/cadaps.2010.465-478}, YEAR = {2010}, PAGES = {465--478}, ABSTRACT = {Bas-relief is a form of sculpture where carved or chiseled forms protrude partially and shallowly from the background. Occupying an intermediate place between painting and full 3D sculpture, bas-relief sculpture exploits properties of human visual perception in order to maintain perceptually salient 3D information. In this paper, we present two methods for automatic bas-relief generation from 3D digital shapes. Both methods are inspired by techniques developed for high dynamic range image compression and have the bilateral filter as the main ingredient. We demonstrate that the methods are capable of preserving fine shape features and achieving good compression without compromising the quality of surface details. For artists, bas-relief generation starts from managing the viewer's point of view and compositing the scene. Therefore we strive in our work to streamline this process by focusing on easy and intuitive user interaction which is paramount to artistic applications. Our algorithms allow for real time computation thanks to our implementation on graphics hardware. Besides interactive production of stills, this work offers the possibility for generating bas-relief animations. Last but not least, we explore the generation of artistic reliefs that mimic cubism in painting.}, } @INPROCEEDINGS{Kerber2010_2, AUTHOR = {Kerber, Jens and Bokeloh, Martin and Wand, Michael and Kr{\"u}ger, Jens and Seidel, Hans-Peter}, EDITOR = {Koch, Reinhard and Kolb, Andreas and Rezk-Salama, Christof}, TITLE = {Feature Preserving Sketching of Volume Data}, BOOKTITLE = {VMV 2010 : Vision, Modeling \& Visualization}, PADDRESS = {Goslar}, ADDRESS = {Siegen, Germany}, PUBLISHER = {Eurographics Association}, MONTH = {November}, ISBN = {978-3-905673-79-1}, YEAR = {2010}, PAGES = {195--202}, ABSTRACT = {In this paper, we present a novel method for extracting feature lines from volume data sets. This leads to a reduction of visual complexity and provides an abstraction of the original data to important structural features. We employ a new iteratively reweighted least-squares approach that allows us to detect sharp creases and to preserve important features such as corners or intersection of feature lines accurately. Traditional least-squares methods This is important for both visual quality as well as reliable further processing in feature detection algorithms. Our algorithm is efficient and easy to implement, and nevertheless effective and robust to noise. We show results for a number of different data sets.}, } @INPROCEEDINGS{Kerber2011_1, AUTHOR = {Kerber, Jens and Wand, Michael and Kr{\"u}ger, Jens and Seidel, Hans-Peter}, EDITOR = {Eisert, Peter and Hornegger, Joachim and Polthier, Konrad}, TITLE = {Partial Symmetry Detection in Volume Data}, BOOKTITLE = {16th International Workshop on Vision, Modeling and Visualization}, PADDRESS = {Goslar}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Eurographics Association}, MONTH = {October}, ISBN = {978-3-905673-85-2}, YEAR = {2011}, PAGES = {41--48}, ABSTRACT = {In this paper, we present an algorithm for detecting partial Euclidean symmetries in volume data. Our algorithm finds subsets in voxel data that map to each other approximately under translations, rotations, and reflections. We implement the search for partial symmetries efficiently and robustly using a feature-based approach: We first reduce the volume to salient line features and then create transformation candidates from matching only local configurations of these line networks. Afterwards, only a shortlist of transformation candidates need to be verified using expensive dense volume matching. We apply our technique on both synthetic test scenes as well as real CT scans and show that we can recover a large amount of partial symmetries for complexly structured volume data sets.}, } @ARTICLE{Kerber2012_2, AUTHOR = {Kerber, Jens and Wang, Meili and Chang, Jian and Zhang, Jian J. and Belyaev, Alexander and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum}, TITLE = {Computer Assisted Relief Generation - A Survey}, NUMBER = {8}, PUBLISHER = {Blackwell Publishing Ltd}, MONTH = {December}, VOLUME = {31}, ISBN = {1467-8659}, YEAR = {2012}, PAGES = {2363--2377}, ABSTRACT = {In this paper we present an overview of the achievements accomplished to date in the field of computer aided relief generation. We delineate the problem, classify different solutions, analyze similarities, investigate the development and review the approaches according to their particular relative strengths and weaknesses. Moreover, we describe remaining challenges and point out prospective extensions. In consequence this survey is likewise addressed to researchers and artists through providing valuable insights into the theory behind the different concepts in this field and augmenting the options available among the methods presented with regard to practical application.}, } @ARTICLE{Kerber2013_1, AUTHOR = {Kerber, Jens and Bokeloh, Martin and Wand, Michael and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum}, TITLE = {Scalable Symmetry Detection for Urban Scenes}, ADDRESS = {Oxford}, NUMBER = {1}, PUBLISHER = {Blackwell}, VOLUME = {32}, DOI = {10.1111/j.1467-8659.2012.03226.x}, YEAR = {2013}, PAGES = {3--15}, } @PHDTHESIS{Kerber2013_2, AUTHOR = {Kerber, Jens}, TITLE = {Of Assembling Small Sculptures and Disassembling Large Geometry}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {September}, YEAR = {2013}, PAGES = {116}, ABSTRACT = {This thesis describes the research results and contributions that have been achieved during the author’s doctoral work. It is divided into two independent parts, each of which is devoted to a particular research aspect. The first part covers the true-to-detail creation of digital pieces of art, so-called relief sculptures, from given 3D models. The main goal is to limit the depth of the contained objects with respect to a certain perspective without compromising the initial three-dimensional impression. Here, the preservation of significant features and especially their sharpness is crucial. Therefore, it is necessary to overemphasize fine surface details to ensure their perceptibility in the more complanate relief.Our developments are aimed at amending the flexibility and user-friendliness during the generation process. The main focus is on providing real-time solutions with intuitive usability that make it possible to create precise, lifelike andaesthetic results. These goals are reached by a GPU implementation, the use of efficient filtering techniques, and the replacement of user defined parameters by adaptive values. Our methods are capable of processing dynamic scenes and allow the generation of seamless artistic reliefs which can be composed of multiple elements. The second part addresses the analysis of repetitive structures, so-called symmetries, within very large data sets. The automatic recognition of components and their patterns is a complex correspondence problem which has numerous applications ranging from information visualization over compression to automatic scene understanding. Recent algorithms reach their limits with a growing amount of data, since their runtimes rise quadratically. Our aim is to make even massive data sets manageable. Therefore, it is necessary to abstract features and to develop a suitable, low-dimensional descriptor which ensures an efficient, robust, and purposive search. A simple inspection of the proximity within the descriptor space helps to significantly reduce the number of necessary pairwise comparisons. Our method scales quasi-linearly and allows a rapid analysis of data sets which could not be handled by prior approaches because of their size.}, } @INPROCEEDINGS{Kerber_SMI2009, AUTHOR = {Kerber, Jens and Tevs, Art and Zayer, Rhaleb and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Yong, Jun-Hai and Spagnuolo, Michela and Wang, Wenping}, TITLE = {Feature Sensitive Bas Relief Generation}, BOOKTITLE = {SMI 2009 : IEEE International Conference on Shape Modeling and Applications Proceedings}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Beijing, China}, PUBLISHER = {IEEE}, MONTH = {June}, ISBN = {978-1-4244-4068-9}, DOI = {10.1109/SMI.2009.5170176}, YEAR = {2009}, PAGES = {148--154}, ABSTRACT = {Among all forms of sculpture, bas-relief is arguably the closest to painting. Although inherently a two dimensional sculpture, a bas-relief suggests a visual spatial extension of the scene in depth through the combination of composition, perspective, and shading. Most recently, there have been significant results on digital bas-relief generation but many of the existing techniques may wash out high level surface detail during the compression process. The primary goal of this work is to address the problem of fine features by tailoring a filtering technique that achieves good compression without compromising the quality of surface details. As a secondary application we explore the generation of artistic relief which mimic cubism in painting and we show how it could be used for generating Picasso like portraits.}, } @ARTICLE{kim2007asaipi, AUTHOR = {Kim, Bohyoung and Lee, Kyoung Ho and Kim, Kil Joong and Mantiuk, Rafał and Kim, Hye-ri and Kim, Young Hoon}, JOURNAL = {American Journal of Roentgenology}, TITLE = {Artifacts in Slab Average-Intensity-Projection Images Reformatted from JPEG 2000 Compressed Thin-Section Abdominal CT Data Sets}, PUBLISHER = {American Roentgen Ray Society}, VOLUME = {190}, DOI = {10.2214/AJR.07.3405}, YEAR = {2008}, PAGES = {W342--W350}, ABSTRACT = {OBJECTIVE. The objective of our study was to assess the effects of compressing source thin-section abdominal CT images on final transverse average-intensity-projection (AIP) images. MATERIALS AND METHODS. At reversible, 4:1, 6:1, 8:1, 10:1, and 15:1 Joint Photographic Experts Group (JPEG) 2000 compressions, we compared the artifacts in 20 matching compressed thin sections (0.67 mm), compressed thick sections (5 mm), and AIP images (5 mm) reformatted from the compressed thin sections. The artifacts were quantitatively measured with peak signal-to-noise ratio (PSNR) and a perceptual quality metric (High Dynamic Range Visual Difference Predictor [HDR-VDP]). By comparing the compressed and original images, three radiologists independently graded the artifacts as 0 (none, indistinguishable), 1 (barely perceptible), 2 (subtle), or 3 (significant). Friedman tests and exact tests for paired proportions were used. RESULTS. At irreversible compressions, the artifacts tended to increase in the order of AIP, thick-section, and thin-section images in terms of PSNR (p < 0.0001), HDR-VDP (p < 0.0001), and the readers' grading (p < 0.01 at 6:1 or higher compressions). At 6:1 and 8:1, distinguishable pairs (grades 1-3) tended to increase in the order of AIP, thick-section, and thin-section images. Visually lossless threshold for the compression varied between images but decreased in the order of AIP, thick-section, and thin-section images (p < 0.0001). CONCLUSION. Compression artifacts in thin sections are significantly attenuated in AIP images. On the premise that thin sections are typically reviewed using an AIP technique, it is justifiable to compress them to a compression level currently accepted for thick sections.}, } @ARTICLE{Kim2011, AUTHOR = {Kim, Min H. and Ritschel, Tobias and Kautz, Jan}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Edge-Aware Color Appearance}, ADDRESS = {New York, NY}, NUMBER = {2}, PUBLISHER = {ACM}, MONTH = {August}, VOLUME = {30}, ISBN = {0730-0301}, DOI = {10.1145/1944846.1944853}, YEAR = {2011}, PAGES = {13:1--13:9}, } @INPROCEEDINGS{Kim2012, AUTHOR = {Kim, Kwang In and Tompkin, James and Theobald, Martin and Kautz, Jan and Theobalt, Christian}, EDITOR = {Fitzgibbon, Andrew W. and Lazebnik, Svetlana and Perona, Pietro and Sato, Yoichi and Schmid, Cordelia}, TITLE = {Match Graph Construction for Large Image Databases}, BOOKTITLE = {12th European Conference on Computer Vision}, PADDRESS = {New York}, ADDRESS = {Florence, Italy}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {7572}, ISBN = {978-3-642-33711-6}, YEAR = {2012}, PAGES = {272--285}, ABSTRACT = {How best to efficiently establish correspondence among a large set of images or video frames is an interesting unanswered question. For large databases, the high computational cost of performing pair-wise image matching is a major problem. However, for many applications, images are inherently sparsely connected, and so current techniques try to correctly estimate small potentially matching subsets of databases upon which to perform expensive pair-wise matching. Our contribution is to pose the identification of potential matches as a link prediction problem in an image correspondence graph, and to propose an effective algorithm to solve this problem. Our algorithm facilitates incremental image matching: initially, the match graph is very sparse, but it becomes dense as we alternate between link prediction and verification. We demonstrate the effectiveness of our algorithm by comparing it with several existing alternatives on large-scale databases. Our resulting match graph is useful for many different applications. As an example, we show the benefits of our graph construction method to a label propagation application which propagates user-provided sparse object labels to other instances of that object in large image collections.}, } @INPROCEEDINGS{KimCchaTheThr08, AUTHOR = {Kim, Y. M. and Chan, D. and Theobalt, Christian and Thrun, S.}, TITLE = {Design and Calibration of a Multi-view TOF Sensor Fusion System}, BOOKTITLE = {IEEE CVPR Workshop on Time-of-flight Computer Vision}, PADDRESS = {Piscataway, USA}, ADDRESS = {Anchorage, USA}, PUBLISHER = {IEEE}, YEAR = {2008}, PAGES = {1--7}, } @INPROCEEDINGS{KimChoiLee2000, AUTHOR = {Kim, Young-Min and Choi, Sung Woo and Lee, Seong-Whan}, EDITOR = {Sanfeliu, A. and Villanueva, J. J. and Vanrell, M. and Alqu{\'e}zar, R. and Huang, T. and Serra, J.}, TITLE = {Fast Scene Change Detection Using Direct Feature Extraction from {MPEG} Compressed Videos}, BOOKTITLE = {Proceedings of the 15th International Conference on Pattern Recognition (ICPR-00)}, ORGANIZATION = {IEEE Computer Society}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Barcelona, Spain}, NUMBER = {3}, PUBLISHER = {IEEE}, MONTH = {September}, ISBN = {0-7695-0750-6}, YEAR = {2000}, PAGES = {178--181}, } @INPROCEEDINGS{KimTheDieKosMicThu09, AUTHOR = {Kim, Y. M. and Theobalt, Christian and Diebel, J. and Kosecka, J. and Micusik, B. and Thrun, S.}, EDITOR = {Hilton, Adrian and Masuda, Takeshi and Shu, Chang}, TITLE = {Multi-view Image and ToF Sensor Fusion for Dense 3D Reconstruction}, BOOKTITLE = {IEEE Workshop on 3-D Digital Imaging and Modeling (3DIM)}, PADDRESS = {Piscataway, USA}, ADDRESS = {Kyoto, Japan}, PUBLISHER = {IEEE}, YEAR = {2009}, PAGES = {1542--1549}, } @PROCEEDINGS{Kobbelt01, EDITOR = {Reif, Ulrich and Kobbelt, Leif}, TITLE = {Subdivision algorithms [Sudivision Workshop at Schloss Dagstuhl]}, PADDRESS = {Amsterdam, The Netherlands}, ADDRESS = {Dagstuhl, Germany}, NUMBER = {5}, PUBLISHER = {Elsevier}, SERIES = {Computer Aided Geomtric Design}, VOLUME = {18}, YEAR = {2001}, PAGES = {381--502}, } @INPROCEEDINGS{KOBBELT1998_IMRMA, AUTHOR = {Kobbelt, Leif and Campagna, Swen and Vorsatz, Jens and Seidel, Hans-Peter}, TITLE = {Interactive Multiresolution Modeling on Arbitrary Meshes}, BOOKTITLE = {Proceedings of the ACM Conference on Computer Graphics (SIGGRAPH-98)}, PADDRESS = {New York, USA}, ADDRESS = {Orlando,USA}, PUBLISHER = {ACM}, ISBN = {0-201-30988-2}, YEAR = {1998}, PAGES = {105--114}, } @ARTICLE{KOBBELT1999_MHUTM, AUTHOR = {Kobbelt, Leif and Vorsatz, Jens}, JOURNAL = {Computational Geometry}, TITLE = {Multiresolution hierarchies on unstructured triangle meshes}, NUMBER = {1-3}, PUBLISHER = {Elsevier}, VOLUME = {14}, YEAR = {1999}, PAGES = {5--24}, } @ARTICLE{Kobbelt1999_RERVD, AUTHOR = {Westermann, R{\"u}diger and Kobbelt, Leif and Ertl, Thomas}, JOURNAL = {The Visual Computer}, TITLE = {Real-time Exploration of Regular Volume Data by Adaptive Reconstruction of Iso-Surfaces}, BOOKTITLE = {The Visual Computer}, ADDRESS = {?}, NUMBER = {2}, PUBLISHER = {Springer}, SERIES = {The Visual Computer}, VOLUME = {15}, YEAR = {1999}, PAGES = {100--111}, ABSTRACT = {We propose an adaptive approach for the fast reconstruction of isosurfaces from regular volume data at arbitrary levels of detail. The algorithm has been designed to enable real-time navigation through complex structures while providing user-adjustable resolution levels. Since adaptive on-the-fly reconstruction and rendering is performed from a hierarchical octree representation of the volume data, the method does not depend on preprocessing with respect to a specific isovalue, thus the user can browse interactively through the set of all possible isosurfaces. Special attention is paid to the fixing of cracks in the surface where the adaptive reconstruction level changes and to the efficient estimation of the isosurface's curvature. }, } @INPROCEEDINGS{KOBBELT1999_S3SFA, AUTHOR = {Kobbelt, Leif and Seidel, Hans-Peter}, TITLE = {sqrt(3)-Subdivision and Forward Adaptive Refinement}, BOOKTITLE = {Proceedings of the Israelian/Korean workshop on Geometric Modeling and Computer Graphics}, PADDRESS = {???}, ADDRESS = {???}, PUBLISHER = {???}, YEAR = {1999}, PAGES = {245--252}, } @ARTICLE{Kobbelt2000_DFVS, AUTHOR = {Kobbelt, Leif}, JOURNAL = {The Visual Computer}, TITLE = {Discrete fairing and variational subdivision for freeform surface design}, ADDRESS = {Berlin, Germany}, NUMBER = {3/4}, PUBLISHER = {Springer}, VOLUME = {16}, ISBN = {0178-2789}, YEAR = {2000}, PAGES = {142--158}, } @INPROCEEDINGS{Kobbelt2000_IAPCT, AUTHOR = {Kobbelt, Leif and Botsch, Mario}, EDITOR = {Gross, Markus and Hopgood, F. R. A.}, TITLE = {An Interactive Approach to Point Cloud Triangulation}, BOOKTITLE = {Proceedings of the European Association for Computer Graphics 21st Annual Conference (Eurographics-00)}, ORGANIZATION = {Eurographics}, PADDRESS = {Oxford, UK}, ADDRESS = {Interlaken, Switzerland}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {19}, YEAR = {2000}, PAGES = {479--487}, } @INPROCEEDINGS{KOBBELT2000_MSDMD, AUTHOR = {Kobbelt, Leif and Bareuther,Thilo and Seidel, Hans-Peter}, EDITOR = {Gross, Markus and Hopgood, F. R. A.}, TITLE = {Multiresolution Shape Deformations for Meshes with Dynamic Vertex Connectivity}, BOOKTITLE = {Proceedings of the European Association for Computer Graphics 21st Annual Conference (Eurographics-00)}, PADDRESS = {Oxford, UK}, ADDRESS = {Interlaken, Switzerland}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {19}, YEAR = {2000}, PAGES = {249--260}, } @INPROCEEDINGS{Kobbelt2000_S3S, AUTHOR = {Kobbelt, Leif}, EDITOR = {Akeley, Kurt}, TITLE = {$\sqrt{3}$-subdivision}, BOOKTITLE = {Proceedings of SIGGRAPH 2000 (SIGGRAPH-00)}, ORGANIZATION = {ACM SIGGRAPH}, PADDRESS = {New York, USA}, ADDRESS = {New Orleans, USA}, PUBLISHER = {ACM}, SERIES = {Computer Graphics Proceedings, Annual Conference Series}, VOLUME = {2000}, ISBN = {1-58113-208-5}, YEAR = {2000}, PAGES = {103--112}, } @INPROCEEDINGS{Kobbelt2001:FSSEVD, AUTHOR = {Kobbelt, Leif and Botsch, Mario and Schwanecke, Ulrich and Seidel, Hans-Peter}, EDITOR = {Fiume, Eugene}, TITLE = {Feature Sensitive Surface Extraction from Volume Data}, BOOKTITLE = {Computer Graphics (SIGGRAPH-2001): Conference Proceedings}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, USA}, PUBLISHER = {ACM}, YEAR = {2001}, PAGES = {57--66}, } @INPROCEEDINGS{Kobbelt:GMBPM:00, AUTHOR = {Kobbelt, Leif and Bischoff, Stephan and Botsch, Mario and K{\"a}hler, Kolja and R{\"o}ssl, Christian and Schneider, Robert and Vorsatz, Jens}, TITLE = {Geometric Modeling Based on Polygonal Meshes}, BOOKTITLE = {Tutorials of the European Association for Computer Graphics 21st Annual Conference (Eurographics-00)}, ORGANIZATION = {European Association for Computer Graphics}, TYPE = {Tutorial}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Interlaken, Switzerland}, PUBLISHER = {Eurographics}, MONTH = {August}, YEAR = {2000}, PAGES = {1--47}, ABSTRACT = {While traditional computer aided design (CAD) is mainly based on piecewise polynomial surface representations, the recent advances in the efficient handling of polygonal meshes have made available a set of powerful techniques which enable sophisticated modeling operations on freeform shapes. In this tutorial we are going to give a detailed introduction into the various techniques that have been proposed over the last years. Those techniques address important issues such as surface generation from discrete samples (e.g. laser scans) or from control meshes (ab initio design); complexity control by adjusting the level of detail of a given 3D-model to the current application or to the available hardware resources; advanced mesh optimization techniques that are based on the numerical simulation of physical material (e.g. membranes or thin plates) and finally the generation and modification of hierarchical representations which enable sophisticated multiresolution modeling functionality. }, } @INPROCEEDINGS{Kondratieva2004, AUTHOR = {Kondratieva, Polina and Havran, Vlastimil and Seidel, Hans-Peter}, EDITOR = {Bubak, Marian and van Albada, Geert Dick and Sloot, Peter M. A. and Dongarra, Jack J.}, TITLE = {Effective Use of Procedural Shaders in Animated Scenes}, BOOKTITLE = {Computational Science, ICCS 2004 : 4th International Conference}, PADDRESS = {Berlin, Germany}, ADDRESS = {Krak{\'o}w, Poland}, PUBLISHER = {Springer}, MONTH = {June}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3039}, ISBN = {3-540-22129-8}, YEAR = {2004}, PAGES = {164--172}, } @INPROCEEDINGS{KonzM10_MusicEducation_CSEDU, AUTHOR = {Konz, Verena and M{\"u}ller, Meinard}, EDITOR = {Cordeiro, Jos{\'e} and Shishkov, Boris and Verbraeck, Alexander and Helfert, Markus}, TITLE = {Introducing the {I}nterpretation {S}witcher Interface to Music Education}, BOOKTITLE = {Proceedings of the 2nd International Conference on Computer Supported Education (CSEDU). - Vol. 2}, PADDRESS = {Setubal}, ADDRESS = {Valencia, Spain}, PUBLISHER = {INSTICC}, ISBN = {978-989-674-024-5}, YEAR = {2010}, PAGES = {135--140}, } @ARTICLE{KonzM12_CrossVersionApproach_DagstuhlFollowUps, AUTHOR = {Konz, Verena and M{\"u}ller, Meinard}, JOURNAL = {Multimodal Music Processing (Dagstuhl Seminar 11041), Dagstuhl Follow-Ups}, TITLE = {A Cross-Version Approach for Harmonic Analysis of Music Recordings}, PUBLISHER = {Dagstuhl}, MONTH = {January}, VOLUME = {3}, YEAR = {2012}, PAGES = {53--72}, } @INPROCEEDINGS{KonzME10_MultiPerspectiveEvaluation_ISMIR, AUTHOR = {Konz, Verena and M{\"u}ller, Meinard and Ewert, Sebastian}, EDITOR = {Downie, J. Stephen and Veltkamp, Remco C.}, TITLE = {A Multi-Perspective Evaluation Framework for Chord Recognition}, BOOKTITLE = {Proceedings of the 11th International Society for Music Information Retrieval Conference (ISMIR 2010)}, PADDRESS = {s.l.}, ADDRESS = {Utrecht, Netherlands}, PUBLISHER = {ISMIR}, ISBN = {978-90-393-53813}, YEAR = {2010}, PAGES = {9--14}, } @ARTICLE{KonzMK13_ChordLabellingAppassionata_JNMR, AUTHOR = {Konz, Verena and M{\"u}ller, Meinard and Kleinertz, Rainer}, JOURNAL = {Journal of New Music Research}, TITLE = {A Cross-Version Chord Labelling Approach for Exploring Harmonic Structures - A Case Study on {Beethoven}'s {Appassionata}}, NUMBER = {1}, MONTH = {January}, VOLUME = {42}, DOI = {10.1080/09298215.2012.750369}, YEAR = {2013}, PAGES = {1--17}, } @INPROCEEDINGS{Kosov2009realvar, AUTHOR = {Kosov, Sergey and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter}, EDITOR = {Bebis, George and Boyle, Richard and Parvin, Bahram and Koracin, Darko and Kuno, Yoshinori and Wang, Junxian and Pajarola, Renato and Lindstrom, Peter and Silva, Cl{\'a}udio T. and Encarna{\c{c}}ão, Miguel L. and Silva, Cl{\'a}udio T. and Coming, Daniel S.}, TITLE = {Accurate Real-Time Disparity Estimation with Variational Methods}, BOOKTITLE = {Advances in Visual Computing : 5th International Symposium, ISVC 2009}, PADDRESS = {Berlin, Germany}, ADDRESS = {Las Vegas, USA}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5875}, DOI = {10.1007/978-3-642-10331-5_74}, YEAR = {2009}, PAGES = {796--807}, } @INPROCEEDINGS{Kosov2010recog, AUTHOR = {Kosov, Sergey and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter}, TITLE = {Rapid Stereo-Vision Enhanced Face Recognition}, BOOKTITLE = {2010 IEEE International Conference on Image Processing : ICIP 2010}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Hong Kong}, PUBLISHER = {IEEE}, MONTH = {September}, ISBN = {978-1-4244-7992-4}, DOI = {10.1109/ICIP.2010.5652010}, YEAR = {2010}, PAGES = {2437--2440}, } @INPROCEEDINGS{KosovICIP2009, AUTHOR = {Kosov, Sergey and Scherbaum, Kristina and Faber, Kamil and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter}, TITLE = {Rapid Stereo-Vision Enhanced Face Detection}, BOOKTITLE = {2009 IEEE International Conference on Image Processing : ICIP 2009 proceedings}, ORGANIZATION = {IEEE}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Cairo, Egypt}, PUBLISHER = {IEEE}, MONTH = {November}, ISBN = {978-1-4244-5655-0}, DOI = {10.1109/ICIP.2009.5413675}, YEAR = {2009}, PAGES = {1221--1224}, } @INPROCEEDINGS{Koster:RTRHH, AUTHOR = {Koster, Martin and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Cohen-Or, Daniel and Jain, Lakhmi and Magnenat-Thalmann, Nadia}, TITLE = {Real-Time Rendering of Human Hair using Programmable Graphics Hardware}, BOOKTITLE = {Computer graphics international (CGI 2004)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Crete, Greece}, PUBLISHER = {IEEE}, MONTH = {June}, ISBN = {0-7695-2171-1}, YEAR = {2004}, PAGES = {248--256}, ABSTRACT = {We present a hair model together with rendering algorithms suitable for real-time rendering. In our approach, we take into account the major lighting factors contributing to a realistic appearance of human hair: anisotropic reflection and self-shadowing. To deal with the geometric complexity of human hair, we combine single hair fibers into hair wisps, which are represented by textured triangle strips. Our rendering algorithms use OpenGL extensions to achieve real-time performance on recent commodity graphics boards. We demonstrate the applicability of our hair model for a variety of different hairstyles.}, } @MASTERSTHESIS{Kozlov2014, AUTHOR = {Kozlov, Yeara}, TITLE = {Analysis of Energy Regularization for Harmonic Surface Deformation}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {April}, YEAR = {2014}, ABSTRACT = {Recently it has been shown that regularization can be beneficial for a variety of geometry processing methods on discretized domains. Linear energy regularization, proposed by Martinez Esturo et al. [MRT14], creates a global, linear regularization term which is strongly coupled with the deformation energy. It can be computed interactively, with little impact on runtime. This work analyzes the effects of linear energy regularization on harmonic surface deformation, proposed by Zayer et al. [ZRKS05]. Harmonic surface deformation is a variational technique for gradient domain surface manipulation. This work demonstrate that linear energy regularization can overcome some of the inherent limitations associated with this technique, can effectively reduce common artifacts associated with this method, eliminating the need for costly non-linear regularization, and expanding the modeling capabilities for harmonic surface deformation.}, } @INPROCEEDINGS{Krawczyk05EG, AUTHOR = {Krawczyk, Grzegorz and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Alexa, Marc and Marks, Joe}, TITLE = {Lightness Perception in Tone Reproduction for High Dynamic Range Images}, BOOKTITLE = {The European Association for Computer Graphics 26th Annual Conference : EUROGRAPHICS 2005}, PADDRESS = {Oxford, UK}, ADDRESS = {Dublin, Ireland}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {24(3)}, YEAR = {2005}, PAGES = {635--645}, } @INPROCEEDINGS{Krawczyk2004, AUTHOR = {Krawczyk, Grzegorz and Mantiuk, Rafał and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {B{\"u}lthoff, Heinrich and Rushmeier, Holly}, TITLE = {Lightness Perception Inspired Tone Mapping}, BOOKTITLE = {Proceedings of the 1st Symposium on Applied Perception in Graphics and Visualization (APGV 2004)}, ORGANIZATION = {ACM SIGGRAPH}, ADDRESS = {New York, USA}, PUBLISHER = {ACM}, MONTH = {August}, ISBN = {1-58113-914-4}, YEAR = {2004}, PAGES = {172--173}, } @INPROCEEDINGS{Krawczyk2005sccg, AUTHOR = {Krawczyk, Grzegorz and Myszkowski, Karol and Seidel, Hans-Peter}, TITLE = {Perceptual Effects in Real-Time Tone Mapping}, BOOKTITLE = {SCCG '05: Proceedings of the 21st Spring Conference on Computer Graphics}, PADDRESS = {New York, NY, USA}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {ACM}, YEAR = {2005}, PAGES = {195--202}, ABSTRACT = {Tremendous progress in the development and accessibility of high dynamic range (HDR) technology that has happened just recently results in fast proliferation of HDR synthetic image sequences and captured HDR video. When properly processed, such HDR data can lead to very convincing and realistic results even when presented on traditional low dynamic range (LDR) display devices. This requires real-time local contrast compression (tone mapping) with simultaneous modeling of important in HDR image perception effects such as visual acuity, glare, day and night vision. We propose a unified model to include all those effects into a common computational framework, which enables an efficient implementation on currently available graphics hardware. We develop a post processing module which can be added as the final stage of any real-time rendering system, game engine, or digital video player, which enhances the realism and believability of displayed image streams.}, } @INPROCEEDINGS{krawczyk2006ba, AUTHOR = {Krawczyk, Grzegorz and Mantiuk, Rafał and Zdrojewska, Dorota and Seidel, Hans-Peter}, TITLE = {Brightness Adjustment for HDR and Tone Mapped Images}, BOOKTITLE = {15th Pacific Conference on Computer Graphics and Applications}, PADDRESS = {New York, USA}, ADDRESS = {Maui, Hawaii}, PUBLISHER = {IEEE}, YEAR = {2007}, PAGES = {373--381}, } @INPROCEEDINGS{Krawczyk2006spie, AUTHOR = {Krawczyk, Grzegorz and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Rogowitz, Bernice E. and Pappas, Thrasyvoulos N. and Daly, Scott J.}, TITLE = {Computational Model of Lightness Perception in High Dynamic Range Imaging}, BOOKTITLE = {Human Vision and Electronic Imaging X, IS\&T/SPIE's 18th Annual Symposium on Electronic Imaging (2006)}, PADDRESS = {Bellingham, USA}, ADDRESS = {San Jose, CA, USA}, NUMBER = {1}, PUBLISHER = {SPIE}, MONTH = {January}, SERIES = {SPIE}, VOLUME = {6057}, ISBN = {0277-786X}, YEAR = {2006}, PAGES = {1--12}, ABSTRACT = {An anchoring theory of lightness perception by Gilchrist et al. [1999] explains many characteristics of human visual system such as lightness constancy and its spectacular failures which are important in the perception of images. The principal concept of this theory is the perception of complex scenes in terms of groups of consistent areas (frameworks). Such areas, following the gestalt theorists, are defined by the regions of common illumination. The key aspect of the image perception is the estimation of lightness within each framework through the anchoring to the luminance perceived as white, followed by the computation of the global lightness. In this paper we provide a computational model for automatic decomposition of HDR images into frameworks. We derive a tone mapping operator which predicts lightness perception of the real world scenes and aims at its accurate reproduction on low dynamic range displays. Furthermore, such a decomposition into frameworks opens new grounds for local image analysis in view of human perception. }, } @INPROCEEDINGS{KrawczykEG2007, AUTHOR = {Krawczyk, Grzegorz and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Cohen-Or, Daniel and Slavik, Pavel}, TITLE = {Contrast Restoration by Adaptive Countershading}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, ORGANIZATION = {The European Association for Computer Graphics}, PADDRESS = {Oxford, UK}, ADDRESS = {Prague, Czech Republic}, NUMBER = {3}, PUBLISHER = {Blackwell}, VOLUME = {26(3)}, YEAR = {2007}, PAGES = {581--590}, ABSTRACT = {We address the problem of communicating contrasts in images degraded with respect to their original due to processing with computer graphics algorithms. Such degradation can happen during the tone mapping of high dynamic range images, or while rendering scenes with low contrast shaders or with poor lighting. Inspired by a family of known perceptual illusions: Craik-O'Brien-Cornsweet, we enhance contrasts by modulating brightness at the edges to create countershading proles. We generalize unsharp masking by coupling it with a multi-resolution local contrast metric to automatically create the countershading proles from the sub-band components which are individually adjusted to each corrected feature to best enhance contrast with respect to the reference. Additionally, we employ a visual detection model to assure that our enhancements are not perceived as objectionable halo artifacts. The overall appearance of images remains mostly unchanged and the enhancement is achieved within the available dynamic range. We use our method to post-correct tone mapped images and improve images using their depth information.}, } @PHDTHESIS{KrawczykPhD2007, AUTHOR = {Krawczyk, Grzegorz Marek}, TITLE = {Perception-inspired tone mapping}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {November}, YEAR = {2007}, } @ARTICLE{Kris04, AUTHOR = {Krislock, Nathan and Lang, Jochen and Varah, Jim and Pai, Dinesh K. and Seidel, Hans-Peter}, JOURNAL = {IEEE Transactions on Robotics}, TITLE = {Local compliance estimation via positive semi-definite constrained least squares}, NUMBER = {6}, VOLUME = {20}, YEAR = {2004}, PAGES = {1007--1011}, } @ARTICLE{KruegerTMW08_MotionTensor_JVRB, AUTHOR = {Kr{\"u}ger, Bj{\"o}rn and Tautges, Jochen and M{\"u}ller, Meinard and Weber, Andreas}, JOURNAL = {Journal of Virtual Reality and Broadcasting}, TITLE = {Multi-Mode Tensor Representation of Motion Data}, ADDRESS = {D{\"u}sseldorf, Germany}, NUMBER = {5}, PUBLISHER = {Herder, Jens}, MONTH = {August}, VOLUME = {5}, ISBN = {1860-2037}, YEAR = {2008}, PAGES = {1--13}, ABSTRACT = {In this paper, we investigate how a multilinear model can be used to represent human motion data. Based on technical modes (referring to degrees of freedom and number of frames) and natural modes that typically appear in the context of a motion capture session (referring to actor, style, and repetition), the motion data is encoded in form of a high-order tensor. This tensor is then reduced by using N-mode singular value decomposition. Our experiments show that the reduced model approximates the original motion better then previously introduced PCA-based approaches. Furthermore, we discuss how the tensor representation may be used as a valuable tool for the synthesis of new motions.}, } @INPROCEEDINGS{KST_VMV_Klehm2012, AUTHOR = {Klehm, Oliver and Reshetouski, Ilya and Eisemann, Elmar and Seidel, Hans-Peter and Ihrke, Ivo}, EDITOR = {G{\"o}sele, Michael and Grosch, Thorsten and Preim, Bernhard and Theisel, Holger and T{\"o}nnies, Klaus-Dietz}, TITLE = {Interactive Geometry-Aware Segmentation for the Decomposition of Kaleidoscopic Images}, BOOKTITLE = {17th International Workshop on Vision, Modeling and Visualization}, PADDRESS = {Goslar, Germany}, ADDRESS = {Magdeburg, Germany}, PUBLISHER = {Eurographics Association}, MONTH = {November}, DOI = {10.2312/PE/VMV/VMV12/009-014}, YEAR = {2012}, PAGES = {009--014}, ABSTRACT = {Mirror systems have recently emerged as an alternative low-cost multi-view imaging solution. The use of these systems critically depends on the ability to compute the background of a multiply mirrored object. The images taken in such systems show a fractured, patterned view, making edge-guided segmentation difficult. Further, global illumination and light attenuation due to the mirrors make standard segmentation techniques fail. We therefore propose a system that allows a user to do the segmentation manually. We provide convenient tools that enable an interactive segmentation of kaleidoscopic images containing three-dimensional objects. Hereby, we explore suitable interaction and visualization schemes to guide the user. To achieve interactivity, we employ the GPU in all stages of the application, such as 2D/3D rendering as well as segmentation.}, } @INPROCEEDINGS{kuhn12a, AUTHOR = {Kuhn, Alexander and R{\"o}ssl, Christian and Weinkauf, Tino and Theisel, Holger}, EDITOR = {Hauser, Helwig and Kobourov, Stephen and Qu, Huamin}, TITLE = {A Benchmark for Evaluating {FTLE} Computations}, BOOKTITLE = {IEEE Pacific Visualization Symposium 2012}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Songdo, Korea}, PUBLISHER = {IEEE}, ISBN = {978-1-4673-0864-9}, DOI = {10.1109/PacificVis.2012.6183582}, YEAR = {2012}, PAGES = {121--128}, ABSTRACT = {The Finite Time Lyapunov Exponent (FTLE) has become a widespread tool for analyzing unsteady flow behavior. For its computation, several numerical methods have been introduced, which provide trade-offs between performance and accuracy. In order to decide which methods and parameter settings are suitable for a particular application, an evaluation of the different FTLE methods is necessary. We propose a general benchmark for FTLE computation, which consists of a number of 2D time-dependent flow fields and error measures. Evaluating the accuracy of a numerically computed FTLE field requires a ground truth, which is not available for realistic flow data sets, since such fields can generally not be described in a closed form. To overcome this, we introduce approaches to create non-trivial vector fields with a closed-form formulation of the FTLE field. Using this, we introduce a set of benchmark flow data sets that resemble relevant geometric aspects of Lagrangian structures, but have an analytic solution for FTLE. Based on this ground truth, we perform a comparative evaluation of three standard FTLE concepts. We suggest error measures based on the variance of both, the fields and the extracted ridge structures.}, } @MASTERSTHESIS{KurmankhojayevMaster, AUTHOR = {Kurmankhojayev, Daniyar}, TITLE = {Capturing Human Motion by a Depth Camera using a Sum of Gaussians body model}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {December}, YEAR = {2012}, PAGES = {62}, } @INPROCEEDINGS{KurthDFMC08_ECDL, AUTHOR = {Kurth, Frank and Damm, David and Fremerey, Christian and M{\"u}ller, Meinard and Clausen, Michael}, TITLE = {A Framework for Managing Multimodal Digitized Music Collections}, BOOKTITLE = {Proceedings of the 12th European Conference on Research and Advanced Technology for Digital Libraries}, PADDRESS = {Berlin, Germany}, ADDRESS = {Aarhus, Denmark}, PUBLISHER = {Springer}, MONTH = {September}, SERIES = {Lecture Notes In Computer Science}, VOLUME = {5173}, ISBN = {978-3-540-87598-7}, DOI = {10.1007/978-3-540-87599-4_35}, YEAR = {2008}, PAGES = {334--345}, } @INPROCEEDINGS{Kurz2009a, AUTHOR = {Kurz, Christian and Thorm{\"a}hlen, Thorsten and Rosenhahn, Bodo and Seidel, Hans-Peter}, EDITOR = {Bebis, George and Boyle, Richard and Parvin, Bahram and Koracin, Darko and Kuno, Yoshinori and Wang, Junxian and Pajarola, Renato and Lindstrom, Peter and Hinkenjann, Andr{\'e} and Encarna{\c{c}}ão, Miguel L. and Silva, Cl{\'a}udio T. and Coming, Daniel S.}, TITLE = {Exploiting Mutual Camera Visibility in Multi-camera Motion Estimation}, BOOKTITLE = {Advances in Visual Computing : 5th International Symposium, ISVC 2009}, PADDRESS = {Berlin, Germany}, ADDRESS = {Las Vegas, USA}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5875}, ISBN = {978-3-642-10330-8}, DOI = {10.1007/978-3-642-10331-5_37}, YEAR = {2009}, PAGES = {391--402}, ABSTRACT = {This paper addresses the estimation of camera motion and 3D reconstruction from image sequences for multiple independently moving cameras. If multiple moving cameras record the same scene, a camera is often visible in another camera's field of view. This poses a constraint on the position of the observed camera, which can be included into the conjoined optimization process. The paper contains the following contributions: Firstly, a fully automatic detection and tracking algorithm for the position of a moving camera in the image sequence of another moving camera is presented. Secondly, a sparse bundle adjustment algorithm is introduced, which includes this additional constraint on the position of the tracked camera. Since the additional constraints minimize the geometric error at the boundary of the reconstructed volume, the total reconstruction accuracy can be improved significantly. Experiments with synthetic and challenging real world scenes show the improved performance of our fully automatic method.}, } @INPROCEEDINGS{Kurz2009b, AUTHOR = {Kurz, Christian and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter}, TITLE = {Scene-aware Video Stabilization by Visual Fixation}, BOOKTITLE = {6th European Conference for Visual Media Production (CVMP)}, ORGANIZATION = {The Foundry}, PADDRESS = {Piscataway, NJ}, ADDRESS = {London, UK}, PUBLISHER = {IEEE}, ISBN = {978-0-7695-3893-8/09}, DOI = {DOI 10.1109/CVMP.2009.9}, YEAR = {2009}, PAGES = {1--6}, ABSTRACT = {Visual fixation is employed by humans and some animals to keep a specific 3D location at the center of the visual gaze. Inspired by this phenomenon in nature, this paper explores the idea to transfer this mechanism to the context of video stabilization for a hand-held video camera. A novel approach is presented that stabilizes a video by fixating on automatically extracted 3D target points. This approach is different from existing automatic solutions that stabilize the video by smoothing. To determine the 3D target points, the recorded scene is analyzed with a state-of-the-art structure-from-motion algorithm, which estimates camera motion and reconstructs a 3D point cloud of the static scene objects. Special algorithms are presented that search either virtual or real 3D target points, which back-project close to the center of the image for as long a period of time as possible. The stabilization algorithm then transforms the original images of the sequence so that these 3D target points are kept exactly in the center of the image, which, in case of real 3D target points, produces a perfectly stable result at the image center. The approach is evaluated on a variety of videos taken with a hand-held camera in natural scenes.}, } @INPROCEEDINGS{Kurz2010cvmp, AUTHOR = {Kurz, Christian and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter and Ritschel, Tobias and Eisemann, Elmar}, TITLE = {Camera Motion Style Transfer}, BOOKTITLE = {7th European Conference on Visual Media Production (CVMP)}, PADDRESS = {Los Alamitos, CA}, ADDRESS = {London, UK}, PUBLISHER = {IEEE Computer Society}, MONTH = {November}, ISBN = {978-1-4244-8872-8}, DOI = {0.1109/CVMP.2010.9}, YEAR = {2010}, PAGES = {9--16}, } @ARTICLE{Kurz2010jvrb, AUTHOR = {Kurz, Christian and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter}, JOURNAL = {Journal of Virtual Reality and Broadcasting}, TITLE = {Visual Fixation for {3D} Video Stabilization}, NUMBER = {2}, MONTH = {February}, VOLUME = {8}, ISBN = {1860-2037}, YEAR = {2011}, PAGES = {1--12}, ABSTRACT = {Visual fixation is employed by humans and some animals to keep a specific 3D location at the center of the visual gaze. Inspired by this phenomenon in nature, this paper explores the idea to transfer this mechanism to the context of video stabilization for a hand-held video camera. A novel approach is presented that stabilizes a video by fixating on automatically extracted 3D target points. This approach is different from existing automatic solutions that stabilize the video by smoothing. To determine the 3D target points, the recorded scene is analyzed with a state-of-the-art structure-from-motion algorithm, which estimates camera motion and reconstructs a 3D point cloud of the static scene objects. Special algorithms are presented that search either virtual or real 3D target points, which back-project close to the center of the image for as long a period of time as possible. The stabilization algorithm then transforms the original images of the sequence so that these 3D target points are kept exactly in the center of the image, which, in case of real 3D target points, produces a perfectly stable result at the image center. Furthermore, different methods of additional user interaction are investigated. It is shown that the stabilization process can easily be controlled and that it can be combined with state-of-the-art tracking techniques in order to obtain a powerful image stabilization tool. The approach is evaluated on a variety of videos taken with a hand-held camera in natural scenes.}, } @INPROCEEDINGS{Kurz2011, AUTHOR = {Kurz, Christian and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter}, EDITOR = {Gagalowicz, Andr{\'e} and Philips, Wilfried}, TITLE = {Bundle Adjustment for Stereoscopic 3{D}}, BOOKTITLE = {Computer Vision/Computer Graphics Collaboration Techniques: 5th International Conference, MIRAGE 2011}, ORGANIZATION = {INRIA}, PADDRESS = {Berlin}, ADDRESS = {Rocquencourt, France}, PUBLISHER = {Springer}, MONTH = {October}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {6930}, ISBN = {978-3-642-24135-2}, DOI = {10.1007/978-3-642-24136-9_1}, YEAR = {2011}, PAGES = {1--12}, ABSTRACT = {The recent resurgence of stereoscopic 3D films has triggered a high demand for post-processing tools for stereoscopic image sequences. Camera motion estimation, also known as structure-from-motion (SfM) or match-moving, is an essential step in the post-processing pipeline. In order to ensure a high accuracy of the estimated camera parameters, a bundle adjustment algorithm should be employed. We present a new stereo camera model for bundle adjustment. It is designed to be applicable to a wide range of cameras employed in today's movie productions. In addition, we describe how the model can be integrated efficiently into the sparse bundle adjustment framework, enabling the processing of stereoscopic image sequences with traditional efficiency and improved accuracy. Our camera model is validated by synthetic experiments, on rendered sequences, and on a variety of real-world video sequences.}, } @ARTICLE{Kurz2013, AUTHOR = {Kurz, Christian and Ritschel, Tobias and Seidel, Hans-Peter}, JOURNAL = {Journal of Virtual Reality and Broadcasting}, TITLE = {Generating Realistic Camera Shake for Virtual Scenes}, ADDRESS = {Cologne}, NUMBER = {7}, PUBLISHER = {Hochschulbibliothekszentrum des Landes Nordrhein-Westfalen, K{\"o}ln (HBZ)}, MONTH = {December}, VOLUME = {10}, ISBN = {1860-2037}, YEAR = {2013}, PAGES = {1--13}, ABSTRACT = {When depicting both virtual and physical worlds, the viewer's impression of presence in these worlds is strongly linked to camera motion. Plausible and artist-controlled camera movement can substantially increase scene immersion. While physical camera motion exhibits subtle details of position, rotation, and acceleration, these details are often missing for virtual camera motion. In this work, we analyze camera movement using signal theory. Our system allows us to stylize a smooth user-defined virtual base camera motion by enriching it with plausible details. A key component of our system is a database of videos filmed by physical cameras. These videos are analyzed with a camera-motion estimation algorithm (structure-from-motion) and labeled manually with a specific style. By considering spectral properties of location, orientation and acceleration, our solution learns camera motion details. Consequently, an arbitrary virtual base motion, defined in any conventional animation package, can be automatically modified according to a user-selected style. In an animation package the camera motion base path is typically defined by the user via function curves. Another possibility is to obtain the camera path by using a mixed reality camera in motion capturing studio. As shown in our experiments, the resulting shots are still fully artist-controlled, but appear richer and more physically plausible.}, } @ARTICLE{Kurz2014, AUTHOR = {Kurz, Christian and Xiaokun, Wu and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum}, TITLE = {Symmetry-aware Template Deformation and Fitting}, PUBLISHER = {John Wiley \& Sons}, MONTH = {March}, ISBN = {1467-8659}, DOI = {10.1111/cgf.12344}, YEAR = {2014}, NOTE = {Early View (Online Version of Record published before inclusion in an issue)}, } @INPROCEEDINGS{Kwon2011, AUTHOR = {Kwon, Younghee and Kim, Kwang In and Kim, Jin Hyung and Theobalt, Christian}, TITLE = {Efficient learning-based image enhancement: application to super-resolution and compression artifact removal}, BOOKTITLE = {British Machine Vision Conference 2012}, PADDRESS = {No address}, ADDRESS = {University of Surrey, Guildford}, YEAR = {2012}, PAGES = {1--13}, } @PHDTHESIS{Langer08, AUTHOR = {Langer, Torsten}, TITLE = {On Generalized Barycentric Coordinates and Their Applications in Geometric Modeling}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {December}, YEAR = {2008}, ABSTRACT = {Generalized barycentric coordinate systems allow us to express the position of a point in space with respect to a given polygon or higher dimensional polytope. In such a system, a coordinate exists for each vertex of the polytope such that its vertices are represented by unit vectors $\vect{e}_i$ (where the coordinate associated with the respective vertex is 1, and all other coordinates are 0). Coordinates thus have a geometric meaning, which allows for the simplification of a number of tasks in geometry processing. Coordinate systems with respect to triangles have been around since the 19\textsuperscript{th} century, and have since been generalized; however, all of them have certain drawbacks, and are often restricted to special types of polytopes. We eliminate most of these restrictions and introduce a definition for 3D mean value coordinates that is valid for arbitrary polyhedra in $\realspace{3}$, with a straightforward generalization to higher dimensions. Furthermore, we extend the notion of barycentric coordinates in such a way as to allow Hermite interpolation and investigate the capabilities of generalized barycentric coordinates for constructing generalized B\'ezier surfaces. Finally, we show that barycentric coordinates can be used to obtain a novel formula for curvature computation on surfaces.}, } @ARTICLE{LangerCAGD2007, AUTHOR = {Langer, Torsten and Belyaev, Alexander and Seidel, Hans-Peter}, JOURNAL = {Computer Aided Geometric Design}, TITLE = {Exact and Interpolatory Quadratures for Curvature Tensor Estimation}, ADDRESS = {Amsterdam}, NUMBER = {8-9}, PUBLISHER = {Elsevier}, MONTH = {November}, VOLUME = {24}, ISBN = {0167-8396}, DOI = {10.1016/j.cagd.2006.09.006}, YEAR = {2007}, PAGES = {443--463}, ABSTRACT = { The computation of the curvature of smooth surfaces has a long history in differential geometry and is essential for many geometric modeling applications such as feature detection. We present a novel approach to calculate the mean curvature from arbitrary normal curvatures. Then, we demonstrate how the same method can be used to obtain new formulae to compute the Gaussian curvature and the curvature tensor. The idea is to compute the curvature integrals by a weighted sum by making use of the periodic structure of the normal curvatures to make the quadratures exact. Finally, we derive an approximation formula for the curvature of discrete data like meshes and show its convergence if quadratically converging normals are available.}, } @INPROCEEDINGS{LangerC&S2007, AUTHOR = {Langer, Torsten and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Chenin, Patrick and Lyche, Tom and Schumaker, Larry L.}, TITLE = {Mean Value Coordinates for Arbitrary Spherical Polygons and Polyhedra in $\mathbb{R}^3$}, BOOKTITLE = {Curve and Surface Design: Avignon 2006}, PADDRESS = {Brentwood, USA}, ADDRESS = {Avignon, France}, PUBLISHER = {Nashboro}, SERIES = {Modern Methods in Mathematics}, ISBN = {978-0-9728482-7-5}, YEAR = {2007}, PAGES = {193--202}, ABSTRACT = {Since their introduction, mean value coordinates have enjoyed ever increasing popularity in computer graphics and computational mathematics because they exhibit a variety of good properties. Most importantly, they are defined in the whole plane which allows interpolation and extrapolation without restrictions. Recently, mean value coordinates were generalized to spheres and to $\mathbb{R}^3$. We show that these spherical and 3D mean value coordinates are well defined on the whole sphere and the whole space $\mathbb{R}^3$, respectively.}, } @INPROCEEDINGS{LangerEG08, AUTHOR = {Langer, Torsten and Seidel, Hans-Peter}, EDITOR = {Drettakis, George and Scopigno, Roberto}, TITLE = {Higher Order Barycentric Coordinates}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, ORGANIZATION = {The European Association for Computer Graphics (Eurographics), Foundation for Research and Technology - Hellas (FORTH)}, PADDRESS = {Oxford, UK}, ADDRESS = {Crete, Greece}, NUMBER = {2}, PUBLISHER = {Blackwell}, VOLUME = {27(2)}, YEAR = {2008}, PAGES = {459--466}, ABSTRACT = {In recent years, a wide range of generalized barycentric coordinates has been suggested. However, all of them lack control over derivatives. We show how the notion of barycentric coordinates can be extended to specify derivatives at control points. This is also known as Hermite interpolation. We introduce a method to modify existing barycentric coordinates to higher order barycentric coordinates and demonstrate, using higher order mean value coordinates, that our method, although conceptually simple and easy to implement, can be used to give easy and intuitive control at interactive frame rates over local space deformations such as rotations.}, } @INPROCEEDINGS{LangerGMP08, AUTHOR = {Langer, Torsten and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Chen, Falai and J{\"u}ttler, Bert}, TITLE = {Mean Value {B\'e}zier Maps}, BOOKTITLE = {Advances in Geometric Modeling and Processing}, PADDRESS = {Berlin}, ADDRESS = {Hangzhou, China}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4975}, ISBN = {978-3-540-79245-1/0302-9743}, YEAR = {2008}, PAGES = {231--243}, ABSTRACT = {Bernstein polynomials are a classical tool in Computer Aided Design to create smooth maps with a high degree of local control. They are used for the construction of B\'ezier surfaces, free-form deformations, and many other applications. However, classical Bernstein polynomials are only defined for simplices and parallelepipeds. These can in general not directly capture the shape of arbitrary objects. Instead, a tessellation of the desired domain has to be done first. We construct smooth maps on arbitrary sets of polytopes such that the restriction to each of the polytopes is a Bernstein polynomial in mean value coordinates (or any other generalized barycentric coordinates). In particular, we show how smooth transitions between different domain polytopes can be ensured. }, } @INPROCEEDINGS{LangerMoS07, AUTHOR = {Langer, Torsten and Seidel, Hans-Peter}, EDITOR = {Martin, Ralph and Sabin, Malcolm and Winkler, Joab}, TITLE = {Mean Value {B{\'e}zier} Surfaces}, BOOKTITLE = {Mathematics of Surfaces XII}, PADDRESS = {Berlin, Germany}, ADDRESS = {Sheffield, England}, PUBLISHER = {Springer}, MONTH = {September}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4647}, ISBN = {3-540-73842-8}, DOI = {10.1007/978-3-540-73843-5_16}, YEAR = {2007}, PAGES = {263--274}, ABSTRACT = {B\'ezier surfaces are an important design tool in Computer Aided Design. They are parameterized surfaces where the parameterization can be represented as a homogeneous polynomial in barycentric coordinates. Usually, Wachspress coordinates are used to obtain tensor product B\'ezier surfaces over rectangular domains. Recently, Floater introduced mean value coordinates as an alternative to Wachspress coordinates. When used to construct B\'ezier patches, they offer additional control points without raising the polynomial degree. We investigate the potential of mean value coordinates to design mean value B\'ezier surfaces.}, } @INPROCEEDINGS{LangerSCCG05, AUTHOR = {Langer, Torsten and Belyaev, Alexander and Seidel, Hans-Peter}, TITLE = {Asymptotic Analysis of Discrete Normals and Curvatures of Polylines}, BOOKTITLE = {SCCG '05: Proceedings of the 21st spring conference on Computer graphics}, TYPE = {Extended Abstract}, PADDRESS = {New York, NY, USA}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {ACM}, MONTH = {May}, ISBN = {1-59593-203-6}, YEAR = {2005}, PAGES = {229--232}, ABSTRACT = {Accurate estimations of geometric properties of a smooth curve from its discrete approximation are important for many computer graphics and computer vision applications. To assess and improve the quality of such an approximation, we assume that the curve is known in general form. Then we can represent the curve by a Taylor series expansion and compare its geometric properties with the corresponding discrete approximations. In turn we can either prove convergence of these approximations towards the true properties as the edge lengths tend to zero, or we can get hints on how to eliminate the error. In this paper, we propose and study discrete schemes for estimating tangent and normal vectors as well as for estimating curvature and torsion of a smooth 3D curve approximated by a polyline. Thereby we make some interesting findings about connections between (smooth) classical curves and certain estimation schemes for polylines.}, } @INPROCEEDINGS{LangerSGP05, AUTHOR = {Langer, Torsten and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Desbrun, Mathieu and Pottmann, Helmut}, TITLE = {Exact and Approximate Quadratures for Curvature Tensor Estimation}, BOOKTITLE = {Third Eurographics Symposium on Geometry Processing (Poster Proceedings)}, TYPE = {Extended Abstract}, ADDRESS = {Aire-la-Ville, Switzerland}, PUBLISHER = {Eurographics}, MONTH = {July}, ISBN = {3-905673-24-X/1727-8384}, YEAR = {2005}, PAGES = {14--15}, } @INPROCEEDINGS{LangerSGP06, AUTHOR = {Langer, Torsten and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Fellner, Dieter W. and Spencer, Stephen N. and Sheffer, Alla and Polthier, Konrad}, TITLE = {Spherical Barycentric Coordinates}, BOOKTITLE = {SGP 2006 : Fourth Eurographics/ACM SIGGRAPH Symposium on Geometry Processing}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Cagliari, Sardinia, Italy}, PUBLISHER = {Eurographics}, MONTH = {June}, ISBN = {3-905673-36-3}, YEAR = {2006}, PAGES = {81--88}, ABSTRACT = {We develop spherical barycentric coordinates. Analogous to classical, planar barycentric coordinates that describe the positions of points in a plane with respect to the vertices of a given planar polygon, spherical barycentric coordinates describe the positions of points on a sphere with respect to the vertices of a given spherical polygon. In particular, we introduce spherical mean value coordinates that inherit many good properties of their planar counterparts. Furthermore, we present a construction that gives a simple and intuitive geometric interpretation for classical barycentric coordinates, like Wachspress coordinates, mean value coordinates, and discrete harmonic coordinates. One of the most interesting consequences is the possibility to construct mean value coordinates for arbitrary polygonal meshes. So far, this was only possible for triangular meshes. Furthermore, spherical barycentric coordinates can be used for all applications where only planar barycentric coordinates were available up to now. They include B\'ezier surfaces, parameterization, free-form deformations, and interpolation of rotations.}, } @INPROCEEDINGS{LangerVMV05, AUTHOR = {Langer, Torsten and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Greiner, G{\"u}nther and Hornegger, Joachim and Niemann, Heinrich and Stamminger, Marc}, TITLE = {Exact and Approximate Quadratures for Curvature Tensor Estimation}, BOOKTITLE = {Vision, Modeling, and Visualization 2005 (VMV'05)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Erlangen, Germany}, PUBLISHER = {Aka}, MONTH = {November}, ISBN = {3-89838-068-8}, YEAR = {2005}, PAGES = {421--428}, ABSTRACT = {Accurate estimations of geometric properties of a surface from its discrete approximation are important for many computer graphics and geometric modeling applications. In this paper, we derive exact quadrature formulae for mean curvature, Gaussian curvature, and the Taubin integral representation of the curvature tensor. The exact quadratures are then used to obtain reliable estimates of the curvature tensor of a smooth surface approximated by a dense triangle mesh. The proposed method is fast and easy to implement. It is highly competitive with conventional curvature tensor estimation approaches. Additionally, we show that the curvature tensor approximated as proposed by us converges towards the true curvature tensor as the edge lengths tend to zero. }, } @INPROCEEDINGS{LangEtal2003a, AUTHOR = {Lang, Jochen and Pai, Dinesh K. and Seidel, Hans-Peter}, TITLE = {Scanning Large-Scale Articulated Deformation}, BOOKTITLE = {Graphics Interface 2003 (GI-03)}, PADDRESS = {Natick, USA}, ADDRESS = {Halifax, Canada}, PUBLISHER = {A K Peters}, ISBN = {1-56881-207-8}, YEAR = {2003}, PAGES = {265--272}, } @INPROCEEDINGS{LangPaiWoodham2002a, AUTHOR = {Lang, Jochen and Pai, Dinesh K. and Woodham, Robert J.}, TITLE = {Robotic Acquisition of Deformable Models}, BOOKTITLE = {International Conference on Robotics and Automation}, PADDRESS = {Piscataway, USA}, ADDRESS = {Washington, D.C., USA}, PUBLISHER = {IEEE}, MONTH = {May}, ISBN = {0-7803-7272-7}, YEAR = {2002}, PAGES = {933--938}, } @ARTICLE{LangPaiWoodham2002b, AUTHOR = {Lang, Jochen and Pai, Dinesh K. and Woodham, Robert J.}, JOURNAL = {The International Journal of Robotics Research}, TITLE = {Acquisition of Elastic Models for Interactive Simulation}, ADDRESS = {Thousand Oaks}, NUMBER = {8}, PUBLISHER = {Sage}, MONTH = {August}, VOLUME = {21}, YEAR = {2002}, PAGES = {713--733}, } @INPROCEEDINGS{LaTeWaSeCVPR11, AUTHOR = {Lasowski, Ruxandra and Tevs, Art and Wand, Michael and Seidel, Hans-Peter}, EDITOR = {Felzenszwalb, Pedro and Forsyth, David and Fua, Pascal}, TITLE = {Wavelet Belief Propagation for Large Scale Inference Problems}, BOOKTITLE = {2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Colorado Springs, USA}, PUBLISHER = {IEEE}, ISBN = {978-1-4577-0394-2}, DOI = {10.1109/CVPR.2011.5995489}, YEAR = {2011}, PAGES = {1921--1928}, } @INPROCEEDINGS{LaTeWaSe_ICCV09, AUTHOR = {Lasowski, Ruxandra and Tevs, Art and Seidel, Hans-Peter and Wand, Michael}, EDITOR = {Cipolla, Roberto and Hebert, Martial and Tang, Xiaoou and Yokoya, Naokazu}, TITLE = {A Probabilistic Framework for Partial Intrinsic Symmetries in Geometric Data}, BOOKTITLE = {Twelfth IEEE International Conference on Computer Vision (ICCV 2009)}, PADDRESS = {Los Alamitos, CA}, ADDRESS = {Kyoto, Japan}, PUBLISHER = {IEEE Computer Society}, YEAR = {2009}, PAGES = {963--970}, } @ARTICLE{LDB2008, AUTHOR = {Liu, Xinguo and Dong, Zhao and Bao, Hujun and Peng, Qunsheng}, JOURNAL = {The Visual Computer}, TITLE = {Caustic spot light for rendering caustics}, ADDRESS = {Heidelberg}, NUMBER = {7-9}, PUBLISHER = {Springer Berlin / Heidelberg}, MONTH = {July}, VOLUME = {24}, ISBN = {0178-2789}, DOI = {10.1007/s00371-008-0229-9}, YEAR = {2008}, PAGES = {485--494}, ABSTRACT = {It is difficult to render caustic patterns at interactive frame rates. This paper introduces new rendering techniques that relax current constraints, allowing scenes with moving, non-rigid scene objects, rigid caustic objects, and rotating directional light sources to be rendered in real-time with GPU hardware acceleration. Because our algorithm estimates the intensity and the direction of caustic light, rendering of non-Lambertian surfaces is supported. Previous caustics algorithms have separated the problem into pre-rendering and rendering phases, storing intermediate results in data structures such as photon maps or radiance transfer functions. Our central idea is to use specially parameterized spot lights, called caustic spot lights (CSLs), as the intermediate representation of a twophase algorithm. CSLs are flexible enough that a small number can approximate the light leaving a caustic object, yet simple enough that they can be efficiently evaluated by a pixel shader program during accelerated rendering.We extend our approach to support changing lighting direction by further dividing the pre-rendering phase into per-scene and per-frame components: the per-frame phase computes frame-specific CSLs by interpolating between CSLs that were pre-computed with differing light directions.}, } @INPROCEEDINGS{Lee-gmp06, AUTHOR = {Lee, Yunjin and Yoon, Mincheol and Lee, Seungyong and Ivrissimtzis, Ioannis and Seidel, Hans-Peter}, EDITOR = {Kim, Myung-Soo and Shimada, Kenji}, TITLE = {Ensembles for Normal and Surface Reconstructions}, BOOKTITLE = {Geometric Modeling and Processing - GMP 2006}, PADDRESS = {Berlin, Germany}, ADDRESS = {Pittsburgh, Pennsylvania, USA}, PUBLISHER = {Springer}, SERIES = {Springer Lecture Notes in Computer Science}, VOLUME = {4077}, ISBN = {3-540-36711-X}, DOI = {10.1007/11802914_2}, YEAR = {2006}, PAGES = {17--33}, ABSTRACT = {The majority of the existing techniques for surface reconstruction and the closely related problem of normal estimation are deterministic. Their main advantages are the speed and, given a reasonably good initial input, the high quality of the reconstructed surfaces. Nevertheless, their deterministic nature may hinder them from effectively handling incomplete data with noise and outliers. In our previous work [1], we applied a statistical technique, called ensembles, to the problem of surface reconstruction. We showed that an ensemble can improve the performance of a deterministic algorithm by putting it into a statistics based probabilistic setting. In this paper, with several experiments, we further study the suitability of ensembles in surface reconstruction, and also apply ensembles to normal estimation. We experimented with a widely used normal estimation technique [2] and Multi-level Partitions of Unity implicits for surface reconstruction [3], showing that normal and surface ensembles can successfully be combined to handle noisy point sets.}, } @INPROCEEDINGS{Lee-sgp06, AUTHOR = {Lee, Yunjin and Lee, Seungyong and Ivrissimtzis, Ioannis and Seidel, Hans-Peter}, EDITOR = {Fellner, Dieter W. and Spencer, Stephen N. and Sheffer, Alla and Polthier, Konrad}, TITLE = {Overfitting Control for Surface Reconstruction}, BOOKTITLE = {SGP 2006 : Fourth Eurographics Symposium on Geometry Processing}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Cagliari, Sardinia, Italy}, PUBLISHER = {Eurographics}, MONTH = {June}, ISBN = {3-905673-36-3}, YEAR = {2006}, PAGES = {231--234}, ABSTRACT = {This paper proposes a general framework for overfitting control in surface reconstruction from noisy point data. The problem we deal with is how to create a model that will capture as much detail as possible and simultaneously avoid reproducing the noise of the input points. The proposed framework is based on extra-sample validation. It is fully automatic and can work in conjunction with any surface reconstruction algorithm. We test the framework with a Radial Basis Function algorithm, Multi-level Partition of Unity implicits, and the Power Crust algorithm.}, } @INPROCEEDINGS{Lee2004a, AUTHOR = {Ahn, Minsu and Lee, Seungyong and Seidel, Hans-Peter}, EDITOR = {Scopigno, Roberto and Zorin, Denis and Fellner, Dieter W. and Spencer, Stephen N.}, TITLE = {Connectivity transformation for mesh metamorphosis}, BOOKTITLE = {SGP 2004 (SGP-04) : Symposium on Geometry Processing}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Nice, France}, PUBLISHER = {Eurographics}, SERIES = {Eurographics / ACM SIGGRAPH Symposium Proceedings}, ISBN = {3-905673-13-4/1727-8384}, YEAR = {2004}, PAGES = {77--84}, } @ARTICLE{Lee2009, AUTHOR = {Lee, Sungkil and Eisemann, Elmar and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics (Proc. of SIGGRAPH ASIA 2009)}, TITLE = {Depth-of-Field Rendering with Multiview Synthesis}, BOOKTITLE = {Proceedings of ACM SIGGRAPH Asia 2009}, ADDRESS = {New York, NY}, NUMBER = {5}, PUBLISHER = {ACM}, SERIES = {ACM Transactions on Graphics}, VOLUME = {28}, DOI = {10.1145/1618452.1618480}, YEAR = {2009}, PAGES = {134,1--134,6}, } @ARTICLE{Lee2010lensblur, AUTHOR = {Lee, Sungkil and Eisemann, Elmar and Seidel, Hans-Peter}, EDITOR = {Hoppe, Hugues}, JOURNAL = {ACM Transactions on Graphics (Proceedings of SIGGRAPH 2010)}, TITLE = {Real-time Lens Blur Effects and Focus Control}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2010}, ADDRESS = {New York, NY}, NUMBER = {4}, PUBLISHER = {ACM}, MONTH = {July}, SERIES = {ACM Transactions on Graphics}, VOLUME = {29}, ISBN = {0730-0301}, DOI = {10.1145/1778765.1778802}, YEAR = {2010}, PAGES = {65,1--65,7}, ABSTRACT = {We present a novel rendering system for defocus-blur and lens effects. It supports physically-based rendering and outperforms previous approaches by involving a novel GPU-based tracing method. Our solution achieves more precision than competing real-time solutions and our results are mostly indistinguishable from offline rendering. Our method is also more general and can integrate advanced simulations, such as simple geometric lens models enabling various lens aberration effects. These latter are crucial for realism, but are often employed in artistic contexts too. We show that available artistic lenses can be simulated by our method. In this spirit, our work introduces an intuitive control over depth-of-field effects. The physical basis is crucial as a starting point to enable new artistic renderings based on a generalized focal surface to emphasize particular elements in the scene while retaining a realistic look. Our real-time solution provides realistic, as well as plausible expressive results.}, } @ARTICLE{LeeKimChoi2000, AUTHOR = {Lee, Seong-Whan and Kim, Young-Min and Choi, Sung Woo}, JOURNAL = {IEEE Transactions on Multimedia}, TITLE = {Fast Scene Change Detection Using Direct Feature Extraction from {MPEG} Compressed Videos}, ADDRESS = {Los Alamitos, USA}, NUMBER = {4}, PUBLISHER = {IEEE}, MONTH = {December}, VOLUME = {2}, YEAR = {2000}, PAGES = {240--254}, } @INPROCEEDINGS{LeeMeshScissoring04, AUTHOR = {Lee, Yunjin and Lee, Seungyong and Shamir, Ariel and Cohen-Or, Daniel and Seidel, Hans-Peter}, EDITOR = {Cohen-Or, Daniel and Ko, Hyeong-Seok and Terzopoulos, Demetri and Warren, Joe}, TITLE = {Intelligent Mesh Scissoring Using 3D Snakes}, BOOKTITLE = {12th Pacific Conference on Computer Graphics and Applications, PG 2004}, ORGANIZATION = {Pacific Graphics}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Seoul, Korea}, PUBLISHER = {IEEE}, ISBN = {0-7695-2234-3}, YEAR = {2004}, PAGES = {279--287}, } @INCOLLECTION{LeeMeshScissoring05, AUTHOR = {Lee, Yunjin and Lee, Seungyong and Shamir, Ariel and Cohen-Or, Daniel and Seidel, Hans-Peter}, EDITOR = {Kobbelt, Leif}, JOURNAL = {Computer Aided Geometric Design}, TITLE = {Mesh Scissoring with Minima Rule and Part Salience}, BOOKTITLE = {Geometry processing}, ORGANIZATION = {Computer Aided Geometric Design}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {5}, PUBLISHER = {Elsevier}, SERIES = {Computer Aided Geometric Design}, VOLUME = {22}, YEAR = {2005}, PAGES = {444--465}, } @INPROCEEDINGS{Lehtinen2012, AUTHOR = {Lehtinen, Ville and Oulasvirta, Antti and Nurmi, Petteri and Salovaara, Antti}, TITLE = {Dynamic Tactile Guidance for Visual Search Tasks}, BOOKTITLE = {25th ACM Symposium on User Interface Software and Technology (UIST 2012)}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, NY}, ADDRESS = {Boston, USA}, PUBLISHER = {ACM}, ISBN = {978-1-4503-1580-7}, DOI = {10.1145/2380116.2380173}, YEAR = {2012}, PAGES = {1--8}, } @INPROCEEDINGS{Lehtinen2012b, AUTHOR = {Lehtinen, Ville and Oulasvirta, Antti and Nurminen, Antti}, TITLE = {Integrating Spatial Sensing to an Interactive Mobile 3{D} Map}, BOOKTITLE = {IEEE 8th Symposium on 3{D} User Interfaces (3{DUI}'12)}, ORGANIZATION = {IEEE}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Orange County, USA}, PUBLISHER = {IEEE}, YEAR = {2012}, PAGES = {11--14}, } @INPROCEEDINGS{Lehtinen:2003:MRT, AUTHOR = {Lehtinen, Jaakko and Kautz, Jan}, EDITOR = {Spencer, Stephen N.}, TITLE = {Matrix Radiance Transfer}, BOOKTITLE = {ACM SIGGRAPH 2003 Symposium on Interactive 3D Graphics}, ORGANIZATION = {Association of Computing Machinery (ACM)}, PADDRESS = {New York, USA}, ADDRESS = {Monterey, USA}, PUBLISHER = {ACM}, MONTH = {April}, ISBN = {1-58113-645-5}, YEAR = {2003}, PAGES = {59--64}, ABSTRACT = {Precomputed Radiance Transfer allows interactive rendering of objects illuminated by low-frequency environment maps, including self-shadowing and interreflections. The expensive integration of incident lighting is partially precomputed and stored as matrices. Incorporating anisotropic, glossy BRDFs into precomputed radiance transfer has been previously shown to be possible, but none of the previous methods offer real-time performance. We propose a new method, \textit{matrix radiance transfer}, which significantly speeds up exit radiance computation and allows anisotropic BRDFs. We generalize the previous radiance transfer methods to work with a matrix representation of the BRDF and optimize exit radiance computation by expressing the exit radiance in a new, directionally locally supported basis set instead of the spherical harmonics. To determine exit radiance, our method performs four dot products per vertex in contrast to previous methods, where a full matrix-vector multiply is required. Image quality can be controlled by adapting the number of basis functions. We compress our radiance transfer matrices through principal component analysis (PCA). We show that it is possible to render directly from the PCA representation, which also enables the user to trade interactively between quality and speed.}, } @ARTICLE{LeKnSt_06Glift, AUTHOR = {Lefohn, Aaron E. and Kniss, Joe and Strzodka, Robert and Sengupta, Shubhabrata and Owens, John D.}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Glift: An abstraction for generic, efficient {GPU} data structures}, NUMBER = {1}, MONTH = {January}, VOLUME = {25}, YEAR = {2006}, PAGES = {1--37}, ABSTRACT = {This paper presents Glift, an abstraction and generic template library for defining complex, random-access graphics processor (GPU) data structures. Like modern CPU data structure libraries, Glift enables GPU programmers to separate algorithms from data structure definitions; thereby greatly simplifying algorithmic development and enabling reusable and interchangeable data structures. We characterize a large body of previously published GPU data structures in terms of our abstraction and present several new GPU data structures. The structures, a stack, quadtree, and octree, are explained using simple Glift concepts and implemented using reusable Glift components. We also describe two applications of these structures not previously demonstrated on GPUs: adaptive shadow maps and octree 3D paint. Lastly, we show that our example Glift data structures perform comparably to handwritten implementations while requiring only a fraction of the programming effort.}, } @ARTICLE{Lensch2001:SBA, AUTHOR = {Lensch, Hendrik P. A. and Heidrich, Wolfgang and Seidel, Hans-Peter}, JOURNAL = {Graphical Models}, TITLE = {A Silhouette-Based Algorithm for Texture Registration and Stitching}, ADDRESS = {San Diego}, NUMBER = {4}, PUBLISHER = {Academic Press}, MONTH = {July}, VOLUME = {63}, ISBN = {1524-0703}, YEAR = {2001}, PAGES = {245--262}, ABSTRACT = {In this paper a system is presented that automatically registers and stitches textures acquired from multiple photographic images onto the surface of a given corresponding 3D model. Within this process the camera position, direction and field of view must be determined for each of the images. For this registration, which aligns a 2D image to a 3D model we present an efficient hardware-accelerated silhouette-based algorithm working on different image resolutions that accurately registers each image without any user interaction. Besides the silhouettes, also the given texture information can be used to improve accuracy by comparing one stitched texture to already registered images resulting in a global multi-view optimization. After the 3D-2D registration for each part of the 3D model's surface the view is determined which provides the best available texture. Textures are blended at the borders of regions assigned to different views.}, } @INPROCEEDINGS{Lensch2002a, AUTHOR = {Lensch, Hendrik P. A. and Daubert, Katja and Seidel, Hans-Peter}, EDITOR = {Greiner, G{\"u}nther and Niemann, Heinrich and Ertl, Thomas and Girod, Bernd and Seidel, Hans-Peter}, TITLE = {Interactive Semi-Transparent Volumetric Textures}, BOOKTITLE = {Proceedings of Vision, Modeling, and Visualization VMV 2002}, PADDRESS = {Amsterdam, The Netherlands}, ADDRESS = {Erlangen, Germany}, PUBLISHER = {IOS Press}, ISBN = {3-89838-034-3}, YEAR = {2002}, PAGES = {505--512}, ABSTRACT = {Volumetric textures are often used to increase the visual complexity of an object without increasing the polygon count. Although it is much more efficient in terms of memory to store only the volume close to the surface and to determine the overall shape by a triangle mesh, rendering is much more complicated compared to a single volume. We present a new rendering method for volumetric textures which allows highest quality at interactive rates even for semi-transparent volumes. The method is based on 3D texture mapping where hundreds of planes orthogonal to the viewing direction are rendered back to front slicing the 3D surface volume. This way we are able to correctly display semi-transparent objects and generate precise silhouettes. The core problem is to calculate the intersection of prisms formed by extruding the triangles of the mesh along their normals and the rendering planes. We present two solutions, a hybrid and a purely hardware-based approach.}, } @INPROCEEDINGS{Lensch2003:PS, AUTHOR = {Lensch, Hendrik P. A. and Lang, Jochen and S{\'a}, Asla M. and Seidel, Hans-Peter}, EDITOR = {Brunet, Pere and Fellner, Dieter W.}, TITLE = {Planned Sampling of Spatially Varying {BRDFs}}, BOOKTITLE = {EUROGRAPHICS 2003 (EUROGRAPHICS-03) : the European Association for Computer Graphics, 24th Annual Conference}, PADDRESS = {Oxford, Uk}, ADDRESS = {Granada, Spain}, PUBLISHER = {Blackwell}, MONTH = {September}, ISBN = {0167-7055}, YEAR = {2003}, PAGES = {473--482}, } @BOOK{LenschVMV2007, EDITOR = {Lensch, Hendrik P. A. and Rosenhahn, Bodo and Seidel, Hans-Peter and Slusallek, Philipp and Weickert, Joachim}, TITLE = {Vision, Modeling, and Visualization}, ADDRESS = {Max-Planck-Gesellschaft}, PUBLISHER = {Die Deutsche Bibliothek}, ISBN = {978-3-940739-00-1}, YEAR = {2007}, PAGES = {261}, } @MASTERSTHESIS{Lensch:1999:THA, AUTHOR = {Lensch, Hendrik P. A.}, TITLE = {Techniques for Hardware-Accelerated Light Field Rendering}, SCHOOL = {Friedrich-Alexander-Universit{\"a}t Erlangen-N{\"u}rnberg}, TYPE = {Master's thesis}, MONTH = {July}, YEAR = {1999}, } @INPROCEEDINGS{Lensch:2000:ATR, AUTHOR = {Lensch, Hendrik P. A. and Heidrich, Wolfgang and Seidel, Hans-Peter}, EDITOR = {Barsky, Brian A. and Shinagawa, Yoshihisa and Wang, Wenping}, TITLE = {Automated Texture Registration and Stitching for Real World Models}, BOOKTITLE = {Proceedings of the 8th Pacific Conference on Computer Graphics and Applications (PG-00)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Hong Kong, China}, PUBLISHER = {IEEE}, MONTH = {October}, ISBN = {0-7695-0868-5}, YEAR = {2000}, PAGES = {317--326}, ABSTRACT = { In this paper a system is presented which automatically registers and stitches textures acquired from multiple photographic images onto the surface of a given corresponding 3D model. Within this process the camera position, direction and field of view must be determined for each of the images. For this registration, which aligns a 2D image to a 3D model we present an efficient hardware-accelerated silhouette-based algorithm working on different image resolutions that accurately registers each image without any user interaction. Besides the silhouettes, also the given texture information can be used to improve accuracy by comparing one stitched texture to already registered images resulting in a global multi-view optimization. After the 3D-2D registration for each part of the 3D model's surface the view is determined which provides the best available texture. Textures are blended at the borders of regions assigned to different views.}, } @INPROCEEDINGS{Lensch:2001:3MA, AUTHOR = {Lensch, Hendrik P. A. and Kautz, Jan and Goesele, Michael and Seidel, Hans-Peter}, EDITOR = {Fellner, Dieter W. and Fuhr, Norbert and Witten, Ian}, TITLE = {{3D} Model Acquisition Including Reflection Properties}, BOOKTITLE = {Proceedings of the ECDL Workshop Generalized Documents}, PADDRESS = {Darmstadt}, ADDRESS = {Darmstadt, Germany}, PUBLISHER = {Selbstverlag}, YEAR = {2001}, PAGES = {1--6}, ABSTRACT = {The measurement of accurate material properties is an important step towards the inclusion of realistic objects in digital documents. Many real-world objects are composed of a number of materials with subtle changes even within a single material. We present an image-based measuring method that robustly detects the different materials of real objects and fits an average bidirectional reflectance distribution function (BRDF) to each of them. In order to model the local changes as well, we project the measured data for each surface point into a basis formed by the recovered BRDFs leading to a truly spatially varying BRDF representation. A compact, high quality model of a real object can be generated with relatively few input data.}, } @INPROCEEDINGS{Lensch:2001:DAGM, AUTHOR = {Lensch, Hendrik P. A. and Goesele, Michael and Seidel, Hans-Peter}, TITLE = {A Framework for the Acquisition, Processing and Interactive Display of High Quality 3D Models}, BOOKTITLE = {Tutorial Notes of the DAGM 2001}, TYPE = {Research Report}, PADDRESS = {Saarbr{\"u}cken, Germany}, ADDRESS = {Munich, Germany}, PUBLISHER = {Max-Planck-Institut f{\"u}r Informatik}, YEAR = {2001}, PAGES = {1--39}, ABSTRACT = {This tutorial highlights some recent results on the acquisition and interactive display of high quality 3D models. For further use in photorealistic rendering or object recognition, a high quality representation must capture two different things: the shape of the model represented as a geometric description of its surface and on the other hand the appearance of the material or materials it is made of, e.g. the object's color, texture, or reflection properties. The tutorial shows how computer vision and computer graphics techniques can be seamlessly integrated into a single framework for the acquisition, processing, and interactive display of high quality 3D models.}, } @INPROCEEDINGS{Lensch:2001:IRS, AUTHOR = {Lensch, Hendrik P. A. and Kautz, Jan and Goesele, Michael and Heidrich, Wolfgang and Seidel, Hans-Peter}, EDITOR = {Gortler, Steven and Myszkowski, Karol}, TITLE = {Image-Based Reconstruction of Spatially Varying Materials}, BOOKTITLE = {Rendering Techniques 2001: Proceedings of the 12th Eurographics Workshop on Rendering}, PADDRESS = {Vienna, Austria}, ADDRESS = {London, Great Britain}, PUBLISHER = {Springer}, ISBN = {3-211-83709-4}, YEAR = {2001}, PAGES = {104--115}, ABSTRACT = {The measurement of accurate material properties is an important step towards photorealistic rendering. Many real-world objects are composed of a number of materials that often show subtle changes even within a single material. Thus, for photorealistic rendering both the general surface properties as well as the spatially varying effects of the object are needed. We present an image-based measuring method that robustly detects the different materials of real objects and fits an average bidirectional reflectance distribution function (BRDF) to each of them. In order to model the local changes as well, we project the measured data for each surface point into a basis formed by the recovered BRDFs leading to a truly spatially varying BRDF representation. A high quality model of a real object can be generated with relatively few input data. The generated model allows for rendering under arbitrary viewing and lighting conditions and realistically reproduces the appearance of the original object.}, } @INCOLLECTION{Lensch:2001:MSV, AUTHOR = {Lensch, Hendrik P. A.}, EDITOR = {Marschner, Steve and Ramamoorthi, Ravi}, TITLE = {Measuring spatial variation with complex BRDFs}, BOOKTITLE = {Acquiring Material Models Unsing Inverse Rendering (Course 39)}, CHAPTER = {5}, ADDRESS = {New York, USA}, PUBLISHER = {ACM SIGGRAPH}, MONTH = {July}, SERIES = {ACM Siggraph Course Notes}, VOLUME = {39}, YEAR = {2002}, PAGES = {80--113}, } @INPROCEEDINGS{Lensch:2001:Web3D, AUTHOR = {Lensch, Hendrik P. A. and Kautz, Jan and Goesele, Michael and Seidel, Hans-Peter}, TITLE = {A Framework for the Acquisition, Processing, Transmission, and Interactive Display of High Quality 3D Models on the Web}, BOOKTITLE = {Tutorial Notes of the Web3D Conference 2001}, PADDRESS = {Paderborn, Germany}, ADDRESS = {Paderborn, Germany}, PUBLISHER = {Web3D Consortium}, YEAR = {2001}, PAGES = {1--13}, NOTE = {Also published as Research Report MPI-I-2001-4-002, Max-Planck-Institut f{\"u}r Informatik, Saarbr{\"u}cken, Germany.}, ABSTRACT = {Digital documents often require highly detailed representations of real world objects. This is especially true for advanced e-commerce applications and other multimedia data bases like online encyclopaedias or virtual museums. Their further success will strongly depend on advances in the field of high quality object representation, distribution and rendering. This tutorial highlights some recent results on the acquisition and interactive display of high quality 3D models and shows how these results can be seamlessly integrated with previous work into a single framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the Web.}, } @INPROCEEDINGS{Lensch:2002:IRI, AUTHOR = {Lensch, Hendrik P. A. and Goesele, Michael and Bekaert, Philippe and Kautz, Jan and Magnor, Marcus and Lang, Jochen and Seidel, Hans-Peter}, EDITOR = {Coquillart, Sabine and Shum, Heung-Yeung and Hu, Shi-Min}, TITLE = {Interactive Rendering of Translucent Objects}, BOOKTITLE = {Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2002)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Beijing, China}, PUBLISHER = {IEEE}, YEAR = {2002}, PAGES = {214--224}, ABSTRACT = { This paper presents a rendering method for translucent objects, in which view point and illumination can be modified at interactive rates. In a preprocessing step the impulse response to incoming light impinging at each surface point is computed and stored in two different ways: The local effect on close-by surface points is modeled as a per-texel filter kernel that is applied to a texture map representing the incident illumination. The global response (i.e. light shining through the object) is stored as vertex-to-vertex throughput factors for the triangle mesh of the object. During rendering, the illumination map for the object is computed according to the current lighting situation and then filtered by the precomputed kernels. The illumination map is also used to derive the incident illumination on the vertices which is distributed via the vertex-to-vertex throughput factors to the other vertices. The final image is obtained by combining the local and global response. We demonstrate the performance of our method for several models. }, } @ARTICLE{Lensch:2003:IRO, AUTHOR = {Lensch, Hendrik P. A. and Goesele, Michael and Bekaert, Philippe and Kautz, Jan and Magnor, Marcus and Lang, Jochen and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum}, TITLE = {Interactive Rendering of Translucent Objects}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell}, MONTH = {June}, VOLUME = {22}, ISBN = {0167-7055}, YEAR = {2003}, PAGES = {195--205}, ABSTRACT = {This paper presents a rendering method for translucent objects, in which viewpoint and illumination can be modified at interactive rates. In a preprocessing step, the impulse response to incoming light impinging at each surface point is computed and stored in two different ways: The local effect on close-by surface points is modeled as a per-texel filter kernel that is applied to a texture map representing the incident illumination. The global response (i.e. light shining through the object) is stored as vertex-to-vertex throughput factors for the triangle mesh of the object. During rendering, the illumination map for the object is computed according to the current lighting situation and then filtered by the precomputed kernels. The illumination map is also used to derive the incident illumination on the vertices which is distributed via the vertex-to-vertex throughput factors to the other vertices. The final image is obtained by combining the local and global response. We demonstrate the performance of our method for several models.}, } @INPROCEEDINGS{Lensch:2003:VRO, AUTHOR = {Lensch, Hendrik P. A. and Kautz, Jan and Goesele, Michael and Lang, Jochen and Seidel, Hans-Peter}, TITLE = {Virtualizing Real-World Objects}, BOOKTITLE = {Computer Graphics International (CGI 2003)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Tokyo, Japan}, PUBLISHER = {IEEE}, YEAR = {2003}, PAGES = {134--141}, } @PHDTHESIS{Lensch:2004:EIA, AUTHOR = {Lensch, Hendrik P. A.}, TITLE = {Efficient, Image-Based Appearance Acquisition of Real-World Objects}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {G{\"o}ttingen, Germany}, PUBLISHER = {Cuvillier}, MONTH = {March}, YEAR = {2004}, ABSTRACT = {Two ingredients are necessary to synthesize realistic images: an accurate rendering algorithm and, equally important, high-quality models in terms of geometry {\em and} reflection properties. In this dissertation we focus on capturing the appearance of real world objects. The acquired model must represent both the geometry and the reflection properties of the object in order to create new views of the object with novel illumination. Starting from scanned 3D geometry, we measure the reflection properties (BRDF) of the object from images taken under known viewing and lighting conditions. The BRDF measurement require only a small number of input images and is made even more efficient by a view planning algorithm. In particular, we propose algorithms for efficient image-to-geometry registration, and an image-based measurement technique to reconstruct spatially varying materials from a sparse set of images using a point light source. Moreover, we present a view planning algorithm that calculates camera and light source positions for optimal quality and efficiency of the measurement process. Relightable models of real-world objects are requested in various fields such as movie production, e-commerce, digital libraries, and virtual heritage.}, } @MISC{Lensch:2007:CRT, AUTHOR = {Lensch, Hendrik P. A. and Goesele, Michael and M{\"u}ller, Gero}, TITLE = {Capturing Reflectance - From Theory to Practice}, HOWPUBLISHED = {Tutorial Notes of Eurographics 2007}, MONTH = {September}, YEAR = {2007}, PAGES = {23}, NOTE = {Eurographics Tutorial Notes}, } @ARTICLE{Lensch:3OP:2002, AUTHOR = {Lensch, Hendrik P. A. and Goesele, Michael and Kautz, Jan and Seidel, Hans-Peter}, JOURNAL = {Informationstechnik und Technische Informatik}, TITLE = {The 3D Object Pipeline - Capturing, Processing and Interactive Display of Objects with Complex Appearance}, ADDRESS = {Munich, Germany}, NUMBER = {6}, PUBLISHER = {Oldenbourg}, VOLUME = {44}, ISBN = {0944-2774}, YEAR = {2002}, PAGES = {322--330}, ABSTRACT = {This article highlights some recent results on the capture and interactive display of high quality 3D models with complex appearance. For use in photorealistic rendering or object recognition, a high quality model must capture two things: the shape of the object represented as a geometric description of its surface and the appearance of the materials it is made of, e.g. the object's color, texture, or reflection properties. The article shows how computer vision and computer graphics techniques can be seamlessly integrated into a 3D object pipeline for capturing, processing, and interactive display of objects with complex appearance.}, } @ARTICLE{Lensch:DCR:2002, AUTHOR = {Lensch, Hendrik P. A. and Goesele, Michael and Seidel, Hans-Peter}, JOURNAL = {D-Lib Magazine}, TITLE = {Digital Collections of Real World Objects}, NUMBER = {2}, MONTH = {February}, VOLUME = {8}, ISBN = {1082-9873}, YEAR = {2002}, ABSTRACT = {Real world objects, such as works of art, archeological artifacts and even common everyday objects, exhibit large variations in color due to the way light is reflected from their surfaces. A high quality digitization method must be capable of capturing these effects if the digital models generated from the real objects are to look realistic. In this article, we present an efficient method for acquiring high quality models of real world objects. The resulting digital models can be viewed under arbitrary viewing and lighting conditions. The efficient acquisition technique, small size, high quality, and versatility of the generated models make this technique well suited for large digital collections.}, } @ARTICLE{Lensch:FAP:2001, AUTHOR = {Lensch, Hendrik P. A. and Goesele, Michael and Seidel, Hans-Peter}, JOURNAL = {Festschrift zum 60. Geburtstag von Wolfgang Stra{\ss}er}, TITLE = {A Framework for the Acquisition, Processing and Interactive Display of High Quality {3D} Models}, ADDRESS = {T{\"u}bingen, Germany}, PUBLISHER = {Wilhelm-Schickard-Institut f{\"u}r Informatik}, VOLUME = {WSI-2001-20}, ISBN = {0946-3852}, YEAR = {2001}, PAGES = {131--166}, } @ARTICLE{Lensch:IRS:2003, AUTHOR = {Lensch, Hendrik P. A. and Kautz, Jan and Goesele, Michael and Heidrich, Wolfgang and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Image-Based Reconstruction of Spatial Appearance and Geometric Detail}, ADDRESS = {New York, USA}, NUMBER = {2}, PUBLISHER = {ACM}, MONTH = {April}, VOLUME = {22}, YEAR = {2003}, PAGES = {234--257}, ABSTRACT = {Real-world objects are usually composed of a number of different materials that often show subtle changes even within a single material. Photorealistic rendering of such objects requires accurate measurements of the reflection properties of each material, as well as the spatially varying effects. We present an image-based measuring method that robustly detects the different materials of real objects and fits an average bidirectional reflectance distribution function (BRDF) to each of them. In order to model local changes as well, we project the measured data for each surface point into a basis formed by the recovered BRDFs leading to a truly spatially varying BRDF representation. Real-world objects often also have fine geometric detail that is not represented in an acquired mesh. To increase the detail, we derive normal maps even for non-Lambertian surfaces using our measured BRDFs. A high quality model of a real object can be generated with relatively little input data. The generated model allows for rendering under arbitrary viewing and lighting conditions and realistically reproduces the appearance of the original object.}, } @INPROCEEDINGS{Levieux2012, AUTHOR = {Levieux, Philippe and Tompkin, James and Kautz, Jan}, EDITOR = {Kautz, Jan}, TITLE = {Interactive Viewpoint Video Textures}, BOOKTITLE = {9th European Conference on Visual Media Production}, ORGANIZATION = {ACM}, PADDRESS = {New York}, ADDRESS = {London, UK}, PUBLISHER = {ACM}, MONTH = {December}, ISBN = {978-1-4503-1311-7}, YEAR = {2012}, PAGES = {11--17}, ABSTRACT = {We propose an approach to interactively explore video textures from different viewpoints. Scenes can be played back continuously and in a temporally coherent fashion from any camera location along a path. Our algorithm takes as input short videos from a set of discrete camera locations, and does not require contemporaneous capture – data is acquired by moving a single camera. We analyze this data to find optimal transitions within each video (equivalent to video textures) and to find good transition points between spatially distinct videos. We propose a spatio-temporal view synthesis approach that dynamically creates intermediate frames to maintain temporal coherence. We demonstrate our approach on a variety of scenes with stochastic or repetitive motions, and we analyse the limits of our approach and failure-case artifacts.}, } @INPROCEEDINGS{Li2004HAPH, AUTHOR = {Li, Ming and Magnor, Marcus and Seidel, Hans-Peter}, EDITOR = {Cani, Marie-Paule and Slater, Mel}, JOURNAL = {Computer Graphics Forum}, TITLE = {Hardware-Accelerated Rendering of Photo Hulls}, BOOKTITLE = {The European Association for Computer Graphics 25th Annual Conference EUROGRAPHICS 2004}, PADDRESS = {Oxford, UK}, ADDRESS = {Grenoble, France}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {23}, ISBN = {0167-7055}, YEAR = {2004}, PAGES = {635--642}, } @ARTICLE{Li2012, AUTHOR = {Li, Guannan and Wu, Chenglei and Stoll, Carsten and Liu, Yebin and Varanasi, Kiran and Dai, Qionghai and Theobalt, Christian}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, TITLE = {Capturing Relightable Human Performances under General Uncontrolled Illumination}, VOLUME = {32}, YEAR = {2013}, PAGES = {1--8}, } @ARTICLE{Li2012, AUTHOR = {Wang, Liang and Li, Chuan}, JOURNAL = {IEEE Transactions on Cybernetics}, TITLE = {Spectrum-based Kernel Length Estimation for Gaussian Process Classification}, ADDRESS = {USA}, PUBLISHER = {IEEE}, MONTH = {July}, VOLUME = {PP}, ISBN = {2168-2267}, DOI = {10.1109/TCYB.2013.2273077}, YEAR = {2013}, } @ARTICLE{Liao2012, AUTHOR = {Liao, Bin and Xiao, Chunxia and Liu, Meng and Dong, Zhao and Peng, Qunsheng}, JOURNAL = {Visual Computer}, TITLE = {Fast hierarchical animated object decomposition using approximately invariant signature}, ADDRESS = {New York, NY}, NUMBER = {4}, PUBLISHER = {Springer}, VOLUME = {28}, ISBN = {0178-2789}, DOI = {10.1007/s00371-011-0625-4}, YEAR = {2012}, PAGES = {387--399}, } @ARTICLE{Lieng2012, AUTHOR = {Lieng, Henrik and Tompkin, James and Kautz, Jan}, JOURNAL = {Computer Graphics Forum (Proc. of EUROGRAPHICS)}, TITLE = {Interactive Multi-perspective Imagery from Photos and Videos}, NUMBER = {2pt1}, PUBLISHER = {Wiley}, MONTH = {May}, VOLUME = {31}, YEAR = {2012}, PAGES = {285--293}, } @INPROCEEDINGS{LinLipRogTheMag10, AUTHOR = {Linz, Christian and Lipski, Christian and Rogge, Lorezn and Theobalt, Christian and Magnor, Marcus}, EDITOR = {Schreer, Oliver and Hilton, Adrian and Trucco, Emanuele}, TITLE = {Space-time Visual Effects as a Post-Production Process}, BOOKTITLE = {3DVP'10 : proceedings of the 2010 ACM Workshop on 3D Video Processing}, PADDRESS = {New York, NJ}, ADDRESS = {Firenze, Italy}, PUBLISHER = {ACM}, ISBN = {978-1-4503-0159-6}, YEAR = {2010}, PAGES = {1--6}, } @INPROCEEDINGS{Lintu:2007:MWM, AUTHOR = {Lintu, Andrei and Lensch, Hendrik P. A. and Magnor, Marcus and Lee, Ting-Hui and El-Abed, Sascha and Seidel, Hans-Peter}, EDITOR = {Corradi, Romano L.M. and Manchado, Arturo and Soker, Noam}, TITLE = {Multi-wavelength-based Method to de-project Gas and Dust Distributions of several Planetary Nebulae}, BOOKTITLE = {Proceedings of Asymmetrical Planetary Nebulae IV}, PADDRESS = {USA}, ADDRESS = {La Palma, Spain}, PUBLISHER = {ADS}, MONTH = {June}, YEAR = {2008}, PAGES = {1--6}, } @INPROCEEDINGS{Lintu:2007:REA, AUTHOR = {Lintu, Andrei and Lensch, Hendrik P. A. and Magnor, Marcus and El-Abed, Sasha and Seidel, Hans-Peter}, EDITOR = {Hege, H.-C. and Machiraju, R. and M{\"o}ller, T. and Sramek, M.}, TITLE = {3D Reconstruction of Emission and Absorption in Planetary Nebulae}, BOOKTITLE = {IEEE/EG International Symposium on Volume Graphics}, ORGANIZATION = {IEEE, Eurographics}, PADDRESS = {Natick, USA}, ADDRESS = {Prague, Czech Republic}, PUBLISHER = {A. K. Peters}, MONTH = {September}, ISBN = {978-1-56881-367-7}, DOI = {10.2312/VG/VG07/009-016}, YEAR = {2007}, PAGES = {9--16}, ABSTRACT = {This paper addresses the problem of reconstructing the 3D structure of planetary nebulae from 2D observations. Assuming axial symmetry, our method jointly reconstructs the distribution of dust and ionized gas in the nebulae from observations at two different wavelengths. In an inverse rendering framework we optimize for the emission and absorption densities which are correlated to the gas and dust distribution present in the nebulae. First, the density distribution of the dust component is estimated based on an infrared image, which traces only the dust distribution due to its intrinsic temperature. In a second step, we optimize for the gas distribution by comparing the rendering of the nebula to the visible wavelength image. During this step, besides the emission of the ionized gas, we further include the effect of absorption and scattering due to the already estimated dust distribution. Using the same approach, we can as well start with a radio image from which the gas distribution is derived without absorption, then deriving the dust distribution from the visible wavelength image considering absorption and scattering. The intermediate steps and the final reconstruction results are visualized at real-time frame rates using a volume renderer. Using our method we recover both gas and dust density distributions present in the nebula by exploiting the distinct absorption or emission parameters at different wavelengths.}, } @INPROCEEDINGS{Lintu:2007:RNS, AUTHOR = {Lintu, Andrei and Hoffmann, Lars and Magnor, Marcus and Lensch, Hendrik P. A. and Seidel, Hans-Peter}, EDITOR = {Lensch, Hendrik P. A. and Rosenhahn, Bodo and Seidel, Hans-Peter and Slusallek, Philipp and Weickert, Joachim}, TITLE = {3D Reconstruction of Reflection Nebulae from a Single Image}, BOOKTITLE = {Vision, Modeling, and Visualization}, PADDRESS = {Saarbr{\"u}cken, Germany}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {MPI Informatik, AKA}, MONTH = {November}, ISBN = {978-3-940739-00-1}, YEAR = {2007}, PAGES = {109--116}, ABSTRACT = {This paper presents a method for reconstructing the 3D distribution of dust densities in reflection nebulae based on a single input image using an analysisby- synthesis approach. In a reflection nebula, light is typically emitted from a central star and then scattered and partially absorbed by the nebula’s dust particles. We model the light transport in this kind of nebulae by considering absorption and single scattering only. While the core problem of reconstructing an arbitrary 3D volume of dust particles from a 2D image would be ill-posed we demonstrate how the special configuration of light transport paths in reflection nebulae allows us to produce non-exact but plausible 3D volumes. Our reconstruction is driven by an iterative non-linear optimization method, which renders an image in each step with the current estimate of dust densities and then updates the density values to minimize the error to the input image. The recovered volumetric datasets can be used in astrophysical research as well as planetarium visualizations.}, } @INPROCEEDINGS{Liu2006PSIVT, AUTHOR = {Liu, Gang and Klette, Reinhard and Rosenhahn, Bodo}, EDITOR = {Chang, Long-Wen and Lie, Wen-Nung}, TITLE = {Collinearity and Coplanarity Constraints for Structure from Motion}, BOOKTITLE = {Advances in Image and Video Technology, First Pacific Rim Symposium, PSIVT 2006}, ORGANIZATION = {IEEE}, PADDRESS = {Berlin, Germany}, ADDRESS = {Hsinchu, Taiwan}, PUBLISHER = {Springer}, MONTH = {December}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4319}, ISBN = {978-3-540-68297-4}, YEAR = {2006}, PAGES = {13--23}, ABSTRACT = {Structure from motion (SfM) comprises techniques for estimating 3D structures from uncalibrated 2D image sequences. This work focuses on two contributions: Firstly, a stability analysis is performed and the error propagation of image noise is studied. Secondly, to stabilize SfM, we present two optimization schemes by using a priori knowledge about collinearity or coplanarity of feature points in the scene.}, } @INPROCEEDINGS{LiuCVPR2011, AUTHOR = {Liu, Yebin and Stoll, Carsten and Gall, J{\"u}rgen and Seidel, Hans-Peter and Theobalt, Christian}, EDITOR = {Felzenszwalb, Pedro and Forsyth, David and Fua, Pascal}, TITLE = {Markerless Motion Capture of Interacting Characters Using Multi-view Image Segmentation}, BOOKTITLE = {2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)}, ORGANIZATION = {IEEE}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Colorado Springs, USA}, PUBLISHER = {IEEE}, ISBN = {978-1-4577-0394-2}, DOI = {10.1109/CVPR.2011.5995424}, YEAR = {2011}, PAGES = {1249--1256}, } @ARTICLE{LiuPami2013, AUTHOR = {Stoll, Carsten and Theobalt, Christian and Seidel, Hans-Peter}, JOURNAL = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, TITLE = {Markerless Motion Capture of Multiple Characters Using Multiview Image Segmentation}, NUMBER = {11}, PUBLISHER = {IEEE}, MONTH = {November}, VOLUME = {35}, YEAR = {2013}, PAGES = {2720--2735}, } @INPROCEEDINGS{Li:2003:ImprovedHAVH, AUTHOR = {Li, Ming and Magnor, Marcus and Seidel, Hans-Peter}, EDITOR = {Ertl, Thomas and Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich and Seidel, Hans-Peter and Steinbach, Eckehard and Westermann, R{\"u}diger}, TITLE = {Improved Hardware-Accelerated Visual Hull Rendering}, BOOKTITLE = {Vision, Modeling and Visualization 2003 (VMV-03) : proceedings}, PADDRESS = {Berlin, Germany}, ADDRESS = {Munich, Germany}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, ISBN = {3-89838-048-3}, YEAR = {2003}, PAGES = {151--158}, ABSTRACT = {The visual hull is an efficient shape approximation for the purpose of reconstructing and visualizing dynamic objects. Recently, rapid progress in graphics hardware development has made it possible to render visual hulls from a set of silhouette images in real-time. In this paper we present several new algorithms to improve the generality and quality of hardware-accelerated visual hull rendering. First, a multi-pass approach employs texture objects and the stencil buffer to enable the visual hull rendering algorithm to deal with arbitrary numbers of input images. Secondly, flexible programmability of state-of-the-art graphics hardware is exploited to achieve smooth transitions between textures from different reference views projected onto visual hulls. In addition, visibility problems with projective texture mapping are solved by using the shadow mapping technique. We test our rendering algorithms on various off-the-shelf graphics cards and achieve real-time frame rates. }, } @PHDTHESIS{Li:Diss04:NVSUsingVH, AUTHOR = {Li, Ming}, TITLE = {Towards Real-Time Novel View Synthesis Using Visual Hulls}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {September}, YEAR = {2004}, ABSTRACT = {This thesis discusses fast novel view synthesis from multiple images taken from different viewpoints. We propose several new algorithms that take advantage of modern graphics hardware to create novel views. Although different approaches are explored, one geometry representation, the visual hull, is employed throughout our work. First the visual hull plays an auxiliary role and assists in reconstruction of depth maps that are utilized for novel view synthesis. Then we treat the visual hull as the principal geometry representation of scene objects. A hardwareaccelerated approach is presented to reconstruct and render visual hulls directly from a set of silhouette images. The reconstruction is embedded in the rendering process and accomplished with an alpha map trimming technique. We go on by combining this technique with hardware-accelerated CSG reconstruction to improve the rendering quality of visual hulls. Finally, photometric information is exploited to overcome an inherent limitation of the visual hull. All algorithms are implemented on a distributed system. Novel views are generated at interactive or real-time frame rates.}, } @INPROCEEDINGS{Li:GI04:HybridVH, AUTHOR = {Li, Ming and Magnor, Marcus and Seidel, Hans-Peter}, EDITOR = {Heidrich, Wolfgang and Balakrishnan, Ravin}, TITLE = {A Hybrid Hardware-Accelerated Algorithm for High Quality Rendering of Visual Hulls}, BOOKTITLE = {Graphics Interface 2004}, PADDRESS = {Mississauga, Canada}, ADDRESS = {London, Canada}, PUBLISHER = {Canadian Information Processing Society}, ISBN = {1-56881-227-2}, YEAR = {2004}, PAGES = {41--48}, ABSTRACT = {In this paper, a novel hybrid algorithm is presented for the fast construction and high-quality rendering of visual hulls. We combine the strengths of two complementary hardware-accelerated approaches: direct constructive solid geometry (CSG) rendering and texture mapping-based visual cone trimming. The former approach completely eliminates the aliasing artifacts inherent in the latter, whereas the rapid speed of the latter approach compensates for the performance deficiency of the former. Additionally, a new view-dependent texture mapping method is proposed. This method makes efficient use of graphics hardware to perform per-fragment blending weight computation, which yields better rendering quality. Our rendering algorithm is integrated in a distributed system that is capable of acquiring synchronized video streams and rendering visual hulls in real time or at interactive frame rates from up to eight reference views. }, } @ARTICLE{lsaclrs:2005, AUTHOR = {Lipman, Yaron and Sorkine, Olga and Alexa, Marc and Cohen-Or, Daniel and Levin, David and R{\"o}ssl, Christian and Seidel, Hans-Peter}, JOURNAL = {International Journal of Shape Modeling}, TITLE = {Laplacian Framework for Interactive Mesh Editing}, NUMBER = {1}, PUBLISHER = {World Scientific}, VOLUME = {11}, ISBN = {0218-6543}, YEAR = {2005}, PAGES = {43--61}, ABSTRACT = {Recent works in geometric modeling show the advantage of local differential coordinates in various surface processing applications. In this paper we review recent methods that advocate surface representation via differential coordinates as a basis to interactive mesh editing. One of the main challenges in editing a mesh is to retain the visual appearance of the surface after applying various modifications. The differential coordinates capture the local geometric details and therefore are a natural surface representation for editing applications. The coordinates are obtained by applying a linear operator to the mesh geometry. Given suitable deformation constraints, the mesh geometry is reconstructed from the differential representation by solving a sparse linear system. The differential coordinates are not rotation-invariant and thus their rotation must be explicitly handled in order to retain the correct orientation of the surface details. We review two methods for computing the local rotations: the first estimates them heuristically using a deformation which only preserves the underlying smooth surface, and the second estimates the rotations implicitly through a variational representation of the problem. We show that the linear reconstruction system can be solved fast enough to guarantee interactive response time thanks to a precomputed factorization of the coefficient matrix. We demonstrate that this approach enables to edit complex meshes while retaining the shape of the details in their natural orientation.}, } @INPROCEEDINGS{LSCLRS2004, AUTHOR = {Lipman, Yaron and Sorkine, Olga and Cohen-Or, Daniel and Levin, David and R{\"o}ssl, Christian and Seidel, Hans-Peter}, EDITOR = {Giannini, Franca and Pasko, Alexander}, TITLE = {Differential Coordinates for Interactive Mesh Editing}, BOOKTITLE = {Shape Modeling International 2004 (SMI 2004)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Genova, Italy}, PUBLISHER = {IEEE}, ISBN = {0-7695-1909-1}, YEAR = {2004}, PAGES = {181--190}, ABSTRACT = {One of the main challenges in editing a mesh is to retain the visual appearance of the surface after applying various modifications. In this paper we advocate the use of linear differential coordinates as means to preserve the high-frequency detail of the surface. The differential coordinates represent the details and are defined by a linear transformation of the mesh vertices. This allows the reconstruction of the edited surface by solving a linear system that satisfies the reconstruction of the local details in least squares sense. Since the differential coordinates are defined in a global coordinate system they are not rotation-invariant. To compensate for that, we rotate them to agree with the rotation of an approximated local frame. We show that the linear least squares system can be solved fast enough to guarantee interactive response time thanks to a precomputed factorization of the coefficient matrix. We demonstrate that our approach enables to edit complex detailed meshes while keeping the shape of the details in their natural orientation. }, } @ARTICLE{Luerig2000_HSDSP, AUTHOR = {L{\"u}rig, Christoph and Kobbelt, Leif and Ertl, Thomas}, JOURNAL = {Graphical Models}, TITLE = {Hierachical solutions for the deformable surface problem in visualization}, ADDRESS = {San Diego, USA}, NUMBER = {1}, PUBLISHER = {Academic Press}, VOLUME = {62}, ISBN = {1524-0703}, YEAR = {2000}, PAGES = {2--18}, } @INPROCEEDINGS{lylis2005, AUTHOR = {Lee, Yunjin and Yoon, Mincheol and Lee, Seungyong and Ivrissimtzis, Ioannis and Seidel, Hans-Peter}, EDITOR = {Gotsman, Craig and Manocha, Dinesh and Wu, Enhua}, TITLE = {Ensembles for Surface Reconstruction}, BOOKTITLE = {Proceedings of the 13th Pacific Conference on Computer Graphics and Applications}, TYPE = {Short paper}, ADDRESS = {Macao}, PUBLISHER = {Welfare Printing Ltd}, MONTH = {October}, ISBN = {99937-710-6-6}, YEAR = {2005}, PAGES = {125--127}, } @INPROCEEDINGS{Magnor03:CSD, AUTHOR = {Magnor, Marcus and Seidel, Hans-Peter}, EDITOR = {Kim, Myung-Soo}, TITLE = {Capturing the shape of a dynamic world - fast !}, BOOKTITLE = {Shape Modeling International 2003 (SMI 2003)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Seoul, Korea}, PUBLISHER = {IEEE}, MONTH = {May}, ISBN = {0-7695-1909-1}, YEAR = {2003}, PAGES = {3--9}, } @INPROCEEDINGS{MagnorEtAlSIGCourse2005, AUTHOR = {Magnor, Marcus and Pollefeys, Marc and Matusik, Woijciech and Cheung, German and Theobalt, Christian}, TITLE = {Video-based Rendering}, BOOKTITLE = {ACM SIGGRAPH 2005 Course Notes}, ORGANIZATION = {ACM SIGGRAPH}, TYPE = {Course}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, USA}, PUBLISHER = {ACM SIGGRAPH}, MONTH = {July}, ISBN = {1-59593-099-X}, YEAR = {2005}, } @INCOLLECTION{Magnor:2000:IBR, AUTHOR = {Magnor, Marcus and Heidrich, Wolfgang}, EDITOR = {Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich}, TITLE = {Image-Based Rendering}, BOOKTITLE = {Principles of 3D Image Analysis and Synthesis}, CHAPTER = {5.4}, ADDRESS = {Boston, USA}, PUBLISHER = {Kluwer}, MONTH = {January}, ISBN = {0-7923-7850-4}, YEAR = {2000}, PAGES = {232--241}, } @INPROCEEDINGS{Manakov2011, AUTHOR = {Manakov, Alkhazur and Seidel, Hans-Peter and Ihrke, Ivo}, EDITOR = {Eisert, Peter and Hornegger, Joachim and Polthier, Konrad}, TITLE = {A Mathematical Model and Calibration Procedure for Galvanometric Laser Scanning Systems}, BOOKTITLE = {16th International Workshop on Vision, Modeling and Visualization}, PADDRESS = {Goslar, Germany}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Eurographics Association}, ISBN = {978-3-905673-85-2}, YEAR = {2011}, PAGES = {207--214}, } @ARTICLE{Manakov2013, AUTHOR = {Manakov, Alkhazur and Restrepo, John F. and Klehm, Oliver and Heged{\"u}s, Ramon and Eisemann, Elmar and Seidel, Hans-Peter and Ihrke, Ivo}, JOURNAL = {ACM Trans. Graph. (Proc. ACM SIGGRAPH 2013)}, TITLE = {A Reconfigurable Camera Add-on for High Dynamic Range, Multi-Spectral, Polarization, and Light-Field Imaging}, ADDRESS = {New York, NY, USA}, NUMBER = {4}, PUBLISHER = {ACM}, VOLUME = {32}, ISBN = {0730-0301}, DOI = {10.1145/2461912.2461937}, YEAR = {2013}, PAGES = {47:1--47:14}, NOTE = {We propose a non-permanent add-on that enables plenoptic imaging with standard cameras. Our design is based on a physical copying mechanism that multiplies a sensor image into a number of identical copies that still carry the plenoptic information of interest. Via different optical filters, we can then recover the desired information. A minor modification of the design also allows for aperture sub-sampling and, hence, light-field imaging. As the filters in our design are exchangeable, a reconfiguration for different imaging purposes is possible. We show in a prototype setup that high dynamic range, multispectral, polarization, and light-field imaging can be achieved with our design. }, ABSTRACT = {We propose a non-permanent add-on that enables plenoptic imaging with standard cameras. Our design is based on a physical copying mechanism that multiplies a sensor image into a number of identical copies that still carry the plenoptic information of interest. Via different optical filters, we can then recover the desired information. A minor modification of the design also allows for aperture sub-sampling and, hence, light-field imaging. As the filters in our design are exchangeable, a reconfiguration for different imaging purposes is possible. We show in a prototype setup that high dynamic range, multispectral, polarization, and light-field imaging can be achieved with our design. }, } @ARTICLE{Mantiuk2002, AUTHOR = {Mantiuk, Rafał and Pattanaik, Sumant and Myszkowski, Karol}, JOURNAL = {Archives of Theoretical and Applied Computer Science}, TITLE = {Using Environment Mapping for Interactive Global Illumination Computation in Dynamic Diffuse Environments}, NUMBER = {4}, VOLUME = {14}, YEAR = {2002}, PAGES = {263--275}, ABSTRACT = {In this paper we present a hardware based rendering approach, which gives plausible approximation of global illumination at nearly interactive frame rates. Global illumination is computed by combining direct light with indirect light. Direct light is computed in GPU, whereas indirect light is computed using a mix of CPU and GPU calculations. We expect that future generation of GPU would be capable of doing all of the indirect light computation, thus will provide real-time performance. Our algorithm computes global illumination by iterative computation of irradiance from multiple bounces. We are able to compute plausible approximation of indirect light for static and dynamic scenes involving both moving objects and changing light sources. The accuracy of our solution can progressively improve as computation time is increased.}, } @INPROCEEDINGS{Mantiuk2003b, AUTHOR = {Mantiuk, Rafał and Myszkowski, Karol and Pattanaik, Sumant}, EDITOR = {Joy, Kenneth I.}, TITLE = {Attention Guided MPEG Compression for Computer Animations}, BOOKTITLE = {Proceedings of the 19th Spring Conference on Computer Graphics 2003 (SCCG 03)}, PADDRESS = {New York, USA}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {ACM}, YEAR = {2003}, PAGES = {262--267}, } @ARTICLE{Mantiuk2004HDREnc, AUTHOR = {Mantiuk, Rafał and Krawczyk, Grzegorz and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Marks, Joe}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Perception-motivated High Dynamic Range Video Encoding}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2004}, ADDRESS = {New York, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {July}, SERIES = {ACM Transactions on Graphics}, VOLUME = {23}, ISBN = {0730-0301}, YEAR = {2004}, PAGES = {733--741}, NOTE = {(Proc. ACM SIGGRAPH '04)}, ABSTRACT = {Due to rapid technological progress in high dynamic range (HDR) video capture and display, the efficient storage and transmission of such data is crucial for the completeness of any HDR imaging pipeline. We propose a new approach for inter-frame encoding of HDR video, which is embedded in the well-established MPEG-4 video compression standard. The key component of our technique is luminance quantization that is optimized for the contrast threshold perception in the human visual system. The quantization scheme requires only 10--11 bits to encode 12 orders of magnitude of visible luminance range and does not lead to perceivable contouring artifacts. Besides video encoding, the proposed quantization provides perceptually-optimized luminance sampling for fast implementation of any global tone mapping operator using a lookup table. To improve the quality of synthetic video sequences, we introduce a coding scheme for discrete cosine transform (DCT) blocks with high contrast. We demonstrate the capabilities of HDR video in a player, which enables decoding, tone mapping, and applying post-processing effects in real-time. The tone mapping algorithm as well as its parameters can be changed interactively while the video is playing. We can simulate post-processing effects such as glare, night vision, and motion blur, which appear very realistic due to the usage of HDR data.}, } @INPROCEEDINGS{Mantiuk2004HDRVDP, AUTHOR = {Mantiuk, Rafał and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Thissen, Wil and Wieringa, Peter and Pantic, Maja and Ludema, Marcel}, TITLE = {Visible Difference Predictor for High Dynamic Range Images}, BOOKTITLE = {2004 IEEE International Conference on Systems, Man \& Cybernetics}, PADDRESS = {Piscataway, USA}, ADDRESS = {Hague, The Netherlands}, PUBLISHER = {IEEE}, MONTH = {October}, VOLUME = {3}, ISBN = {0-7803-8567-5}, YEAR = {2004}, PAGES = {2763--2769}, ABSTRACT = {Since new imaging and rendering systems commonly use physically accurate lighting information in the form of High-Dynamic Range data, there is a need for an automatic visual quality assessment of the resulting images. In this work we extend the Visual Difference Predictor (VDP) developed by Daly to handle HDR data. This let us predict if a human observer is able to perceive differences for a pair of HDR images under the adaptation conditions corresponding to the real scene observation.}, } @INPROCEEDINGS{mantiuk2004::contrast, AUTHOR = {Mantiuk, Rafał and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Malik, Jitendra and Koenderink, Jan J.}, TITLE = {A perceptual framework for contrast processing of high dynamic range images}, BOOKTITLE = {APGV '05: Proceedings of the 2nd Symposium on Applied Perception in Graphics and Visualization}, PADDRESS = {New York, USA}, ADDRESS = {Coruna, Spain}, PUBLISHER = {ACM}, MONTH = {August}, ISBN = {1-59593-139-2}, YEAR = {2005}, PAGES = {87--94}, ABSTRACT = { In this work we propose a framework for image processing in a visual response space, in which contrast values directly correlate with their visibility in an image. Our framework involves a transformation of an image from luminance space to a pyramid of low-pass contrast images and then to the visual response space. After modifying response values, the transformation can be reversed to produce the resulting image. To predict the visibility of suprathreshold contrast, we derive a transducer function for the full range of contrast levels that can be found in High Dynamic Range images. We show that a complex contrast compression operation, which preserves textures of small contrast, is reduced to a linear scaling in the proposed visual response space.}, } @INPROCEEDINGS{Mantiuk2005, AUTHOR = {Mantiuk, Rafał and Daly, Scott J. and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Rogowitz, Bernice E. and Pappas, Thrasyvoulos N. and Daly, Scott J.}, TITLE = {Predicting Visible Differences in High Dynamic Range Images - Model and its Calibration}, BOOKTITLE = {Human Vision and Electronic Imaging X, IS\&T/SPIE's 17th Annual Symposium on Electronic Imaging (2005)}, PADDRESS = {Bellingham, USA}, ADDRESS = {San Jose, California USA}, PUBLISHER = {SPIE}, MONTH = {January}, SERIES = {SPIE Proceedings Series}, VOLUME = {5666}, ISBN = {0277-786X}, YEAR = {2005}, PAGES = {204--214}, ABSTRACT = { New imaging and rendering systems commonly use physically accurate lighting information in the form of high-dynamic range (HDR) images and video. HDR images contain actual colorimetric or physical values, which can span 14 orders of magnitude, instead of 8-bit renderings, found in standard images. The additional precision and quality retained in HDR visual data is necessary to display images on advanced HDR display devices, capable of showing contrast of 50,000:1, as compared to the contrast of 700:1 for LCD displays. With the development of high-dynamic range visual techniques comes a need for an automatic visual quality assessment of the resulting images. In this paper we propose several modifications to the Visual Difference Predicator (VDP). The modifications improve the prediction of perceivable differences in the full visible range of luminance and under the adaptation conditions corresponding to real scene observation. The proposed metric takes into account the aspects of high contrast vision, like scattering of the light in the optics (OTF), nonlinear response to light for the full range of luminance, and local adaptation. To calibrate our HDR~VDP we perform experiments using an advanced HDR display, capable of displaying the range of luminance that is close to that found in real scenes.}, } @INPROCEEDINGS{Mantiuk2005:LossyCompression, AUTHOR = {Mantiuk, Rafał and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Rogowitz, Bernice E. and Pappas, Thrasyvoulos N. and Daly, Scott J.}, TITLE = {Lossy compression of high dynamic range images and video}, BOOKTITLE = {Human Vision and Electronic Imaging XI}, PADDRESS = {Bellingham, USA}, ADDRESS = {San Jose, USA}, PUBLISHER = {SPIE}, MONTH = {February}, SERIES = {SPIE}, VOLUME = {6057}, YEAR = {2006}, PAGES = {60570V}, ABSTRACT = { Most common image and video formats have been designed to work with existing output devices, like LCD or CRT monitors. As display technology makes progress, these formats no longer represent the data that new devices can display. Therefore a shift towards higher precision image and video formats is imminent. To overcome limitations of common image and video formats, such as JPEG, PNG or MPEG, we propose a novel color space, which can accommodate an extended dynamic range and guarantees the precision that is below the visibility threshold. The proposed color space, which is derived from contrast detection data, can represent the full range of luminance values and the complete color gamut that is visible to the human eye. We show that only minor changes are required to the existing encoding algorithms to accommodate the new color space and therefore greatly enhance information content of the visual data. We demonstrate this with two compression algorithms for High Dynamic Range (HDR) visual data: for static images and for video. We argue that the proposed HDR representation is a simple and universal way to encode visual data independent of the display or capture technology.}, } @ARTICLE{Mantiuk2006, AUTHOR = {Mantiuk, Rafał}, JOURNAL = {Forschung und wissenschaftliches Rechnen}, TITLE = {High Dynamic Range Imaging: Towards the Limits of the Human Visual Perception}, PUBLISHER = {Gesellschaft fuer wissenschaftliche Datenverarbeitung mbH Goettingen}, VOLUME = {72}, YEAR = {2007}, PAGES = {11--27}, } @ARTICLE{Mantiuk2006:ContrastDomain, AUTHOR = {Mantiuk, Rafał and Myszkowski, Karol and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Applied Perception}, TITLE = {A Perceptual Framework for Contrast Processing of High Dynamic Range Images}, ADDRESS = {New York, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {July}, VOLUME = {3}, YEAR = {2006}, PAGES = {286--308}, NOTE = {This is a revised and extended version of the publication of the same title in the Proceedings of Second Symposium on Applied Perception in Graphics and Visualization 2005}, ABSTRACT = { Image processing often involves an image transformation into a domain that is better correlated with visual perception, such as the wavelet domain, image pyramids, multi-scale contrast representations, contrast in retinex algorithms, and chroma, lightness and colorfulness predictors in color appearance models. Many of these transformations are not ideally suited for image processing that significantly modifies an image. For example, the modification of a single band in a multi-scale model leads to an unrealistic image with severe halo artifacts. Inspired by gradient domain methods we derive a framework that imposes constraints on the entire set of contrasts in an image for a full range of spatial frequencies. This way, even severe image modifications do not reverse the polarity of contrast. The strengths of the framework are demonstrated by aggressive contrast enhancement and a visually appealing tone mapping which does not introduce artifacts. Additionally, we perceptually linearize contrast magnitudes using a custom transducer function. The transducer function has been derived especially for the purpose of HDR images, based on the contrast discrimination measurements for high contrast stimuli.}, } @INPROCEEDINGS{Mantiuk2006:hdrmpeg, AUTHOR = {Mantiuk, Rafał and Efremov, Alexander and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Dorsey, Julie}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Backward Compatible High Dynamic Range MPEG Video Compression}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2006}, PADDRESS = {New York, USA}, ADDRESS = {Boston, MA, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {July}, SERIES = {ACM Transactions on Graphics}, VOLUME = {25(3)}, ISBN = {0730-0301}, YEAR = {2006}, PAGES = {713--723}, NOTE = {Proc. of ACM SIGGRAPH '06}, ABSTRACT = { To embrace the imminent transition from traditional low-contrast video (LDR) content to superior high dynamic range (HDR) content, we propose a novel backward compatible HDR video compression (HDR~MPEG) method. We introduce a compact reconstruction function that is used to decompose an HDR video stream into a residual stream and a standard LDR stream, which can be played on existing MPEG decoders, such as DVD players. The reconstruction function is finely tuned to the content of each HDR frame to achieve strong decorrelation between the LDR and residual streams, which minimizes the amount of redundant information. The size of the residual stream is further reduced by removing invisible details prior to compression using our HDR-enabled filter, which models luminance adaptation, contrast sensitivity, and visual masking based on the HDR content. Designed especially for DVD movie distribution, our HDR~MPEG compression method features low storage requirements for HDR content resulting in a 30\% size increase to an LDR video sequence. The proposed compression method does not impose restrictions or modify the appearance of the LDR or HDR video. This is important for backward compatibility of the LDR stream with current DVD appearance, and also enables independent fine tuning, tone mapping, and color grading of both streams.}, } @INPROCEEDINGS{Mantiuk2007hdrivc, AUTHOR = {Mantiuk, Rafał and Krawczyk, Grzegorz and Myszkowski, Karol and Seidel, Hans-Peter}, TITLE = {High Dynamic Range Image and Video Compression - Fidelity Matching Human Visual Performance}, BOOKTITLE = {IEEE International Conference on Image Processing (ICIP 2007)}, ORGANIZATION = {IEEE}, PADDRESS = {New York, NY}, ADDRESS = {San Antonio, TX, USA}, PUBLISHER = {IEEE}, MONTH = {September}, VOLUME = {1}, ISBN = {978-1-4244-1437-6}, DOI = {10.1109/ICIP.2007.4378878}, YEAR = {2007}, PAGES = {9--12}, ABSTRACT = {Vast majority of digital images and video material stored today can capture only a fraction of visual information visible to the human eye and does not offer sufficient quality to fully exploit capabilities of new display devices. High dynamic range (HDR) image and video formats encode the full visible range of luminance and color gamut, thus offering ultimate fidelity, limited only by the capabilities of the human eye and not by any existing technology. In this paper we demonstrate how existing image and video compression standards can be extended to encode HDR content efficiently. This is achieved by a custom color space for encoding HDR pixel values that is derived from the visual performance data. We also demonstrate how HDR image and video compression can be designed so that it is backward compatible with existing formats.}, } @ARTICLE{Mantiuk2007mgtmo, AUTHOR = {Mantiuk, Rafał and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, TITLE = {Modeling a Generic Tone-mapping Operator}, NUMBER = {2}, PUBLISHER = {Blackwell}, VOLUME = {27}, YEAR = {2008}, PAGES = {699--708}, ABSTRACT = {Although several new tone-mapping operators are proposed each year, there is no reliable method to validate their performance or to tell how different they are from one another. In order to analyze and understand the behavior of tone-mapping operators, we model their mechanisms by fitting a generic operator to an HDR image and its tone-mapped LDR rendering. We demonstrate that the majority of both global and local tone-mapping operators can be well approximated by computationally inexpensive image processing operations, such as a perpixel tone curve, a modulation transfer function and color saturation adjustment. The results produced by such a generic tone-mapping algorithm are often visually indistinguishable from much more expensive algorithms, such as the bilateral filter. We show the usefulness of our generic tone-mapper in backward-compatible HDR image compression, the black-box analysis of existing tone mapping algorithms and the synthesis of new algorithms that are combination of existing operators.}, } @INCOLLECTION{Mantiuk2007MPEG, AUTHOR = {Mantiuk, Rafał}, EDITOR = {Hoefflinger, Bernd}, TITLE = {HDR Image and Video Compression}, BOOKTITLE = {High-Dynamic-Range (HDR) Vision}, ADDRESS = {Heidelberg}, PUBLISHER = {Springer}, SERIES = {Springer Series in Advanced Microelectronics (26)}, ISBN = {978-3-540-44432-9}, YEAR = {2007}, PAGES = {179--192}, } @INPROCEEDINGS{Mantiuk2007spie, AUTHOR = {Mantiuk, Rafał and Krawczyk, Grzegorz and Mantiuk, Radoslaw and Seidel, Hans-Peter}, EDITOR = {Rogowitz, Bernice E. and Pappas, Thrasyvoulos N. and Daly, Scott J.}, TITLE = {High Dynamic Range Imaging Pipeline: Perception-Motivated Representation of Visual Content}, BOOKTITLE = {Human Vision and Electronic Imaging XII}, PADDRESS = {Bellingham, WA, USA}, ADDRESS = {San Jose, CA, USA}, PUBLISHER = {SPIE}, MONTH = {January}, SERIES = {SPIE}, VOLUME = {6492}, ISBN = {9780819466051}, DOI = {10.1117/12.713526}, YEAR = {2007}, PAGES = {649212}, ABSTRACT = {The advances in high dynamic range (HDR) imaging, especially in the display and camera technology, have a significant impact on the existing imaging systems. The assumptions of the traditional low-dynamic range imaging, designed for paper print as a major output medium, are ill suited for the range of visual material that is shown on modern displays. For example, the common assumption that the brightest color in an image is white can be hardly justified for high contrast LCD displays, not to mention next generation HDR displays, that can easily create bright highlights and the impression of self-luminous colors. We argue that high dynamic range representation can encode images regardless of the technology used to create and display them, with the accuracy that is only constrained by the limitations of the human eye and not a particular output medium. To facilitate the research on high dynamic range imaging, we have created a software package (http://pfstools.sourceforge.net/), capable of handling HDR data on all stages of image and video processing. The software package is available as open source under the General Public License and includes solutions for high quality image acquisition from multiple exposures, a range of tone mapping algorithms and a visual difference predictor for HDR images. We demonstrate how particular elements of the imaging pipeline can be interfaced using standard features of the operating system. Examples of shell scripts demonstrate how the software can be used for processing single images as well as video sequences.}, } @ARTICLE{Mantiuk2008, AUTHOR = {Kim, Kil Joong and Kim, Bohyoung and Lee, Kyoung Ho and Kim, Tae Jung and Mantiuk, Rafał and Kang, Heung-Sik and Kim, Young Hoon}, JOURNAL = {American Journal of Roentgenology}, TITLE = {Regional Difference in Compression Artifacts in Low-Dose Chest CT Images: Effects of Mathematical and Perceptual Factors}, VOLUME = {191}, DOI = {10.2214/AJR.07.2502}, YEAR = {2008}, PAGES = {W30--W37}, } @ARTICLE{Mantiuk2008datmo, AUTHOR = {Mantiuk, Rafał and Daly, Scott and Kerofsky, Louis}, JOURNAL = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH)}, TITLE = {Display Adaptive Tone Mapping}, NUMBER = {3}, PUBLISHER = {ACM}, VOLUME = {27}, DOI = {10.1145/1360612.1360667}, YEAR = {2008}, PAGES = {68}, ABSTRACT = { We propose a tone mapping operator that can minimize visible contrast distortions for a range of output devices, ranging from e-paper to HDR displays. The operator weights contrast distortions according to their visibility predicted by the model of the human visual system. The distortions are minimized given a display model that enforces constraints on the solution. We show that the problem can be solved very efficiently by employing higher order image statistics and quadratic programming. Our tone mapping technique can adjust image or video content for optimum contrast visibility taking into account ambient illumination and display characteristics. We discuss the differences between our method and previous approaches to the tone mapping problem.}, } @ARTICLE{Mantiuk2008rdca, AUTHOR = {Kil Joong Kim and Bohyoung Kim and Kyoung Ho Lee and Tae Jung Kim and Rafał Mantiuk and Heung-Sik Kang and Young Hoon Kim}, JOURNAL = {American Journal of Roentgenology}, TITLE = {Regional Difference in Compression Artifacts in Low-Dose Chest CT Images: Effects of Mathematical and Perceptual Factors}, VOLUME = {191}, DOI = {10.2214/AJR.07.2502}, YEAR = {2008}, PAGES = {W30--W37}, } @ARTICLE{Mantiuk2008:ppajpeg200, AUTHOR = {Kim, Bohyoung and Lee, Kyoung Ho and Kim, Kil Joong and Mantiuk, Rafał and Hahn, Seokyung and Kim, Tae Jung and Kim, Young Hoon}, JOURNAL = {American Journal of Roentgenology}, TITLE = {Prediction of Perceptible Artifacts in JPEG 2000-Compressed Chest CT Images Using Mathematical and Perceptual Quality Metrics}, PUBLISHER = {American Roentgen Ray Society}, MONTH = {February}, VOLUME = {190}, DOI = {10.2214/AJR.07.2502}, YEAR = {2008}, PAGES = {328--334}, } @ARTICLE{Mantiuk2009EG, AUTHOR = {Mantiuk, Radoslaw and Mantiuk, Rafał and Tomaszewska, Anna and Heidrich, Wolfgang}, EDITOR = {Dutr{\'e}, Philip and Stamminger, Marc}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS 2009)}, TITLE = {Color Correction for Tone Mapping}, BOOKTITLE = {The European Association for Computer Graphics 30th Annual Conference : EUROGRAPHICS 2009}, ADDRESS = {Oxford}, NUMBER = {2}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {28}, YEAR = {2009}, PAGES = {193--202}, } @PHDTHESIS{MantiukPhD06, AUTHOR = {Mantiuk, Rafał}, TITLE = {High-Fidelity Imaging - The Computational Models of the Human Visual System in High Dynamic Range Video Video Compression, Visible Difference Prediction and Image Processing}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {December}, YEAR = {2006}, } @INPROCEEDINGS{marmitt:04:IsoIsec, AUTHOR = {Marmitt, Gerd and Kleer, Andreas and Friedrich, Heiko and Wald, Ingo and Slusallek, Philipp}, EDITOR = {Girod, Bernd and Magnor, Marcus and Seidel, Hans-Peter}, TITLE = {{Fast} and {Accurate} {Ray-Voxel} {Intersection} {Techniques} for {Iso-Surface} {Ray} {Tracing}}, BOOKTITLE = {Vision, modeling, and visualization 2004 (VMV-04)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Stanford, USA}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, ISBN = {3-89838-058-0}, YEAR = {2004}, PAGES = {429--435}, ABSTRACT = { Visualizing iso-surfaces of volumetric data sets is becoming increasingly important for many practical applications. One crucial task in iso-surface ray tracing is to find the correct intersection of a ray with the trilinear-interpolated implicit surface defined by the data values at the vertices of a given voxel. Currently available solutions are either accurate but slow or they provide fast but only approximate solutions. In this paper, we analyze the available techniques and present a new intersection algorithm. We compare and evaluate the new algorithm against previous approaches using both synthetic test cases and real world data sets. The new algorithm is roughly three times faster but provides the same image quality and better numerical stability as previous accurate solutions. }, } @INPROCEEDINGS{MartinezEsturo2008, AUTHOR = {Martinez Esturo, Janick and R{\"o}ssl, Christian and Theisel, Holger}, TITLE = {Multiple Aligned Characteristic Curves for Surface Fairing}, BOOKTITLE = {Advances in Visual Computing}, PADDRESS = {Berlin, Germany}, ADDRESS = {http://www.isvc.net/}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5358}, ISBN = {978-3-540-89638-8}, DOI = {10.1007/978-3-540-89639-5_110}, YEAR = {2008}, PAGES = {1157--1166}, ABSTRACT = {Characteristic curves like isophotes, reflection lines and reflection circles are well–established concepts which have been used for automatic fairing of both parametric and piecewise linear surfaces. However, the result of the fairing strongly depends on the choice of a particular family of characteristic curves: isophotes or reflection lines may look perfect for a certain orientation of viewing and projection direction, but still have imperfections for other directions. Therefore, fairing methods are necessary which consider multiple families of characteristic curves. To achieve this, we first introduce a new way of controlling characteristic curves directly on the surface. Based on this, we introduce a fairing scheme which incorporates several families of characteristic curves simultaneously. We confirm effectiveness of our method for a number of test data sets.}, } @INPROCEEDINGS{MartinezEsturo2010, AUTHOR = {Martinez Esturo, Janick and R{\"o}ssl, Christian and Theisel, Holger}, TITLE = {Continuous Deformations of Implicit Surfaces}, BOOKTITLE = {Proc. VMV}, PADDRESS = {Neutraubling, Germany}, ADDRESS = {Siegen, Germany}, PUBLISHER = {Eurographics}, YEAR = {2010}, } @INPROCEEDINGS{MartinezEsturo2011, AUTHOR = {Martinez Esturo, Janick and R{\"o}ssl, Christian and Fr{\"o}hlich, Stefan and Botsch, Mario and Theisel, Holger}, TITLE = {Pose Correction by Space-Time Integration}, BOOKTITLE = {Proc. VMV}, PADDRESS = {Neutraubling, Germany}, ADDRESS = {Berlin}, PUBLISHER = {Eurographics}, YEAR = {2011}, } @INPROCEEDINGS{MartinezEsturo2011, AUTHOR = {{Martinez~Esturo}, Janick and R{\"o}ssl, Christian and Botsch, Mario and Theisel, Holger}, TITLE = {Pose Correction by Space-Time Integration}, BOOKTITLE = {Proc. VMV}, PADDRESS = {Neutraubling, Germany}, ADDRESS = {Berlin}, PUBLISHER = {Eurographics}, YEAR = {2011}, } @ARTICLE{MartinezEsturo2012, AUTHOR = {Martinez Esturo, Janick and R{\"o}ssl, Christian and Theisel, Holger}, JOURNAL = {LNCS}, TITLE = {Continuous Deformations by Isometry Preserving Shape Integration}, NUMBER = {1}, VOLUME = {6920}, YEAR = {2012}, PAGES = {456--472}, } @INPROCEEDINGS{MartinezEsturo2013, AUTHOR = {Martinez Esturo, Janick and Schulze, Maik and R{\"o}ssl, Christian and Theisel, Holger}, TITLE = {Poisson-based Tools for Flow Visualization}, BOOKTITLE = {Proc. PacificVis}, PADDRESS = {Washington, USA}, ADDRESS = {Sydney}, PUBLISHER = {IEEE}, YEAR = {2013}, PAGES = {241--248}, } @ARTICLE{MartinezEsturo2013a, AUTHOR = {Martinez Esturo, Janick and R{\"o}ssl, Christian and Theisel, Holger}, JOURNAL = {LNCS}, TITLE = {Generalized Metric Energies for Continuous Shape Deformation}, NUMBER = {1}, VOLUME = {8177}, YEAR = {2014}, PAGES = {135--157}, } @ARTICLE{MartinezEsturo2013b, AUTHOR = {Martinez Esturo, Janick and Schulze, Maik and R{\"o}ssl, Christian and Theisel, Holger}, JOURNAL = {Comput. Graph. Forum (Proc. Eurographics)}, TITLE = {Global Selection of Stream Surfaces}, NUMBER = {2}, VOLUME = {32}, YEAR = {2013}, PAGES = {113--122}, } @ARTICLE{MartinezEsturo2014, AUTHOR = {Martinez Esturo, Janick and R{\"o}ssl, Christian and Theisel, Holger}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Smoothed Quadratic Energies on Meshes}, YEAR = {2014}, } @MASTERSTHESIS{Master2013:El-Soumsoumani, AUTHOR = {El-Soumsoumani, Hassan}, TITLE = {Audio Source Separation Methods with Application to Music Signals}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {June}, YEAR = {2013}, } @MASTERSTHESIS{Master2013:Elham, AUTHOR = {Afsari Yeganeh, Elham}, TITLE = {Human Motion Alignment Using a Depth Camera}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {April}, YEAR = {2013}, } @MASTERSTHESIS{MasterBock, AUTHOR = {Bock, Andreas}, TITLE = {Rapid Variant Generation of Multi-Component Images}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, YEAR = {2012}, } @MASTERSTHESIS{MasterParks, AUTHOR = {Parks, Justin}, TITLE = {Detecting Structural Regularity in Perspective Images}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, YEAR = {2012}, } @MASTERSTHESIS{MasterSaikia2012, AUTHOR = {Saikia, Himangshu}, TITLE = {A Stochastic Procedural Modelling Tool for Architectural Structures}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {December}, YEAR = {2012}, } @MASTERSTHESIS{MasterScharfstein, AUTHOR = {Scharfstein, Andi}, TITLE = {Determining Tempo Characteristics of Expressive Music Recordings: An Algorithmic Approach}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, YEAR = {2009}, } @MASTERSTHESIS{MasterThesisDriedgerJonathan, AUTHOR = {Driedger, Jonathan}, TITLE = {Time-scale modification algorithms for music audio signals}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @MASTERSTHESIS{MasterThesisJiangNanzhu, AUTHOR = {Jiang, Nanzhu}, TITLE = {An Analysis of Automated Chord Recognition Procedures for Music Recordings}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @MASTERSTHESIS{MasterthesisLiuShuyan, AUTHOR = {Liu, Shuyan}, TITLE = {Efficient Visualization of Short Routes}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @MASTERSTHESIS{MasterThesisMartensAlexander, AUTHOR = {Martens, Alexander}, TITLE = {Data-driven Cloth Animation}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @MASTERSTHESIS{MasterThesisMorbachChristian, AUTHOR = {Morbach, Christian}, TITLE = {DIFICOM-GPU: A Distance Field Computation Technique on the Graphics Processing Unit}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @MASTERSTHESIS{MasterThesisNachevNayden, AUTHOR = {Nachev, Nayden}, TITLE = {Sacliency-driven optimization for categorial data visualization}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @MASTERSTHESIS{MasterThesisOsthofMarkus, AUTHOR = {Osthof, Markus}, TITLE = {Autonomous Bidirectional Pixels}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @MASTERSTHESIS{MasterThesisPirmoradianEbad, AUTHOR = {Pirmoradian, Ebad}, TITLE = {Monocular Performance Capture via ToF Camera}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @MASTERSTHESIS{MasterThesisPraetzlichThomas, AUTHOR = {Pr{\"a}tzlich, Thomas}, TITLE = {A Cross-Version Approach for Novelty Detection in Music Recordings}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, YEAR = {2012}, } @MASTERSTHESIS{MasterThesisRehmsenOle, AUTHOR = {Rehmsen, Ole}, TITLE = {Automatic Reenactment of Movie Scenes by Image-based Face Transfer}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @MASTERSTHESIS{MasterThesisReuterAlexander, AUTHOR = {Reuter, Alexander}, TITLE = {Parametric {PSF} calibration for arbitrary lenses}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @MASTERSTHESIS{MasterThesisStypRekowskiPhilipp, AUTHOR = {von Styp-Rekowsky, Philipp}, TITLE = {Towards Time-Adaptive Feature Design in Music Signal Processing}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saaralndes}, YEAR = {2011}, } @MASTERSTHESIS{MasterThesisYousefiMohammad, AUTHOR = {Yousefi, Mohammad Reza}, TITLE = {Generating Detailed Face Models by Controlled Lighting}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @MASTERSTHESIS{MasterThesisZuoZhe, AUTHOR = {Zuo, Zhe}, TITLE = {Towards Automated Segmentation of Repetitive Music Recordings}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2011}, } @INPROCEEDINGS{McCool:1999:TS, AUTHOR = {McCool, Michael and Heidrich, Wolfgang}, EDITOR = {Kaufman, Arie and Stra{\ss}er, Wolfgang}, TITLE = {Texture Shaders}, BOOKTITLE = {Eurographics/SIGGRAPH Workshop on Graphics Hardware}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, USA}, PUBLISHER = {ACM}, YEAR = {1999}, PAGES = {117--126}, } @ARTICLE{MehBlaHi04, AUTHOR = {Mehl, Albert and Blanz, Volker and Hickel, R.}, JOURNAL = {Journal of Dental Research}, TITLE = {Automatic CAD-Design of Occlusal Inlay Surfaces using the Biogeneric Tooth Model}, ADDRESS = {Alexandria, USA}, PUBLISHER = {International \& American Associations for Dental Research, HighWire Press}, VOLUME = {83}, ISBN = {1544-0591}, YEAR = {2004}, } @ARTICLE{MehlBla05a, AUTHOR = {Mehl, Albert and Blanz, Volker}, JOURNAL = {Int J Comput Dent}, TITLE = {A new approach for automatic reconstruction of occlusal surfaces with the biogeneric tooth model}, VOLUME = {8}, YEAR = {2005}, PAGES = {13--25}, } @ARTICLE{MehlBla05b, AUTHOR = {Mehl, Albert and Blanz, Volker and Hickel, R.}, JOURNAL = {Deutsche Zahn{\"a}rztliche Zeitschrift}, TITLE = {{Was ist der "Durchschnittszahn"? - Ein mathematisches Verfahren f{\"u}r die automatische Berechnung einer repr{\"a}sentativen Kaufl{\"a}che}}, NUMBER = {6}, VOLUME = {60}, YEAR = {2005}, PAGES = {335--341}, } @ARTICLE{MehlBlaHi03, AUTHOR = {Mehl, Albert and Blanz, Volker and Hickel, R.}, JOURNAL = {Journal of Dental Research}, TITLE = {Biogeneric Tooth - a New Mathematical Approach of CAD Reconstruction of Occlusal Surfaces.}, VOLUME = {82}, YEAR = {2003}, PAGES = {Abstr. 1354}, } @ARTICLE{MehlBlaHi04b, AUTHOR = {Mehl, Albert and Blanz, Volker and Hickel, R.}, JOURNAL = {Eur J Oral Sci}, TITLE = {Biogeneric Tooth - A New Mathematical Representation for Tooth Morphology in case of lower first Molars.}, YEAR = {2003}, } @INPROCEEDINGS{Mertens:ERL:2003, AUTHOR = {Mertens, Tom and Kautz, Jan and Bekaert, Philippe and Seidel, Hans-Peter and Van Reeth, Frank}, EDITOR = {Rokne, Jon and Klein, Reinhard and Wang, Wenping}, TITLE = {Efficient Rendering of Local Subsurface Scattering}, BOOKTITLE = {11th Pacific Conference on Computer Graphics and Applications (PG-03)}, TYPE = {Paper}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Canmore, Canada}, PUBLISHER = {IEEE}, MONTH = {October}, YEAR = {2003}, PAGES = {51--58}, } @INPROCEEDINGS{Mertens:IRT:2003, AUTHOR = {Mertens, Tom and Kautz, Jan and Bekaert, Philippe and Seidel, Hans-Peter and Van Reeth, Frank}, EDITOR = {Christensen, Per and Cohen-Or, Daniel}, TITLE = {Interactive Rendering of Translucent Deformable Objects}, BOOKTITLE = {Rendering Techniques 2003 : 14th Eurographics Workshop on Rendering}, ORGANIZATION = {EG/ACM SIGGRAPH}, TYPE = {Full Paper}, PADDRESS = {New York, USA}, ADDRESS = {Leuven, Belgium}, PUBLISHER = {ACM}, MONTH = {June}, ISBN = {1727-3463}, YEAR = {2003}, PAGES = {130--140}, } @MASTERSTHESIS{MewesThesis2013, AUTHOR = {Mewes, Daniel}, TITLE = {Semantic Structuring of Shapes and other Visual Data}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {August}, YEAR = {2013}, ABSTRACT = {Crowd-sourced data bases such as Flickr for images or Google 3D Warehouse for 3D meshes provide vast amounts of shape data. While the shapes in these databases come annotated with user-provided semantic labels, those annotations are noisy and inconsistent. Organizing these data sets by semantic criteria therefore remains a difficult task. We explore techniques that use machine learning for finding out how images and 3D meshes can be associated with the corresponding semantic labels. We present how an existing method for large-scale image annotation ("WSABIE" by Weston et al. 2011) can be extended to support a multi modal setting, in which we can learn a joint semantic structuring of both meshes and images.}, } @MASTERSTHESIS{Milch2003, AUTHOR = {Milch, Marco}, TITLE = {A Practical Global Illumination Solution for Animation Rendering}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, YEAR = {2003}, } @ARTICLE{Milliez2013, AUTHOR = {Milliez, Antoine and Wand, Michael and Cani, Marie-Paule and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum}, TITLE = {Mutable elastic models for sculpting structured shapes}, NUMBER = {2pt1}, MONTH = {May}, VOLUME = {32}, YEAR = {2013}, PAGES = {21--30}, } @INPROCEEDINGS{Ming2001a, AUTHOR = {Li, Ming}, EDITOR = {J. Salvador, S{\'a}nchez and Filiberto, Pla}, TITLE = {Correspondence Analysis Between The Image Formation Pipelines of Graphics and Vision}, BOOKTITLE = {Proceedings of the IX Spanish Symposium on Pattern Recognition and Image Analysis}, ORGANIZATION = {Universitat Jaume I}, PADDRESS = {Castell{\'o}n, Spain}, ADDRESS = {Benicasim(Castell{\'o}n), Spain}, PUBLISHER = {Publications de la Universitat Jaume I.}, MONTH = {May}, ISBN = {84-8021-350-72}, YEAR = {2001}, PAGES = {187--192}, ABSTRACT = {Augmented Reality can merge the computer-generated objects into the real image or video sequences, one key issue is to keep the geometric consistency between the real and virtual objects. This is achieved by using the camera parameters recovered from the real image to render the virtual objects. Camera parameters' recovery is a basic problem in the area of computer vision. On the other hand, rendering is the major concern of computer graphics. Ususally in these two areas different image formation pipelines are used. This paper presents a side-by-side comparison between the pipelines, in order to make it easier to setup the recovered camera parameters to do the rendering for AR applications. Some experiment results are shown to verify the correctness of the analysis.}, } @INCOLLECTION{mingle04obs, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Dodgson, Neil A. and Floater, Michael S. and Sabin, Malcolm}, TITLE = {Multi-scale and Adaptive CS-RBFs for Shape Reconstruction from Cloud of Points}, BOOKTITLE = {Advances in Multiresolution for Geometric Modelling}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Springer}, ISBN = {3-540-21462-3}, YEAR = {2005}, PAGES = {143--154}, } @INPROCEEDINGS{Ming:2002:CombineStereoAndVH, AUTHOR = {Li, Ming and Schirmacher, Hartmut and Magnor, Marcus and Seidel, Hans-Peter}, EDITOR = {Ostermann, Joern and Zhuang, Xinhua}, TITLE = {Combining Stereo and Visual Hull Information for On-line Reconstruction and Rendering of Dynamic Scenes}, BOOKTITLE = {Proceedings of the 5th Conference on Multimedia Signal Processing}, ORGANIZATION = {IEEE}, PADDRESS = {Piscataway, USA}, ADDRESS = {St. Thomas, US Virgin Islands}, PUBLISHER = {IEEE}, ISBN = {0-7803-7713-3}, YEAR = {2002}, PAGES = {9--12}, ABSTRACT = {In this paper, we present a novel system which combines depth-from-stereo and visual hull reconstruction for acquiring dynamic real-world scenes at interactive rates. First, we use the silhouettes from multiple views to construct a polyhedral visual hull as an initial estimate of the object in the scene. The visual hull is then used to limit the disparity range during depth-from-stereo computation. The restricted search range improves both speed and quality of the stereo reconstruction. In return, stereo information can compensate for some of the inherent drawbacks of the visual hull method, such as inability to reconstruct surface details and concave regions. Our system achieves a reconstruction frame rate of 4 fps.}, } @INPROCEEDINGS{Ming:GI03:HAVH, AUTHOR = {Li, Ming and Magnor, Marcus and Seidel, Hans-Peter}, EDITOR = {M{\"o}ller, Torsten and Ware, Colin}, TITLE = {Hardware-Accelerated Visual Hull Reconstruction and Rendering}, BOOKTITLE = {Graphics Interface 2003 (GI-03)}, ORGANIZATION = {Canadian Human-Computer Communications Society}, PADDRESS = {Natick, USA}, ADDRESS = {Halifax, Canada}, PUBLISHER = {A K Peters}, ISBN = {1-56881-207-8}, YEAR = {2003}, PAGES = {65--71}, ABSTRACT = {We present a novel algorithm for simultaneous visual hull reconstruction and rendering by exploiting off-the-shelf graphics hardware. The reconstruction is accomplished by projective texture mapping in conjunction with alpha test. Parallel to the reconstruction, rendering is also carried out in the graphics pipeline. We texture the visual hull view-dependently with the aid of fragment shaders, such as nVIDIA's register combiners. Both reconstruction and rendering are done in a single rendering pass. We achieve frame rates of more than 80 fps on a standard PC equipped with a commodity graphics card. The performance is significantly faster than previously reported performances of similar systems.}, } @ARTICLE{Ming:WSCG2003:OnlineRenderingVH, AUTHOR = {Li, Ming and Magnor, Marcus and Seidel, Hans-Peter}, JOURNAL = {Journal of WSCG}, TITLE = {Online Accelerated Rendering of Visual Hulls in Real Scenes}, NUMBER = {2}, PUBLISHER = {UNION Agency - Science Press}, VOLUME = {11}, ISBN = {1213-6972}, YEAR = {2003}, PAGES = {290--297}, ABSTRACT = {This paper presents an online system which is capable of reconstructing and rendering dynamic objects in real scenes. We reconstruct visual hulls of the objects by using a shape-from-silhouette approach. During rendering, a novel blending scheme is employed to compose multiple background images. Visibility artifacts on the dynamic object are removed by using opaque projective texture mapping. We also propose a dynamic texture packing technique to improve rendering performance by exploiting region-of-interest information. Our system takes multiple live or pre-recorded video streams as input. It produces realistic real-time rendering results of dynamic objects in their surrounding natural environment in which the user can freely navigate.}, } @MISC{Mitra2012, AUTHOR = {Mitra, Niloy J. and Pauly, Mark and Wand, Michael and Ceylan, Duygu}, TITLE = {Symmetry in 3{D} Geometry: Extraction and Applications. Eurographics State-of-the-art Report (STAR), 2012}, HOWPUBLISHED = {Eurographics State-of-the-Art-Report (STAR)}, YEAR = {2012}, } @MISC{Mitra2013, AUTHOR = {Mitra, Niloy and Wand, Michael and Zhang, Hao (Richard) and Cohen-Or, Daniel and Bokeloh, Martin}, TITLE = {Structure-Aware Shape Processing}, HOWPUBLISHED = {Eurographics 2013 State-of-the-Art Report (STAR)}, YEAR = {2013}, } @ARTICLE{Mitra2013, AUTHOR = {Mitra, Niloy J. and Pauly, Mark and Wand, Michael and Ceylan, Duygu}, JOURNAL = {Computer Graphics Forum}, TITLE = {Symmetry in 3{D} Geometry: Extraction and Applications}, NUMBER = {6}, VOLUME = {32}, YEAR = {2013}, PAGES = {1--23}, } @ARTICLE{MIV2008, AUTHOR = {Galic, Irena and Weickert, Joachim and Welk, Martin and Bruhn, Andr{\'e}s and Belyaev, Alexander and Seidel, Hans-Peter}, JOURNAL = {Journal of Mathematical Imaging and Vision}, TITLE = {Image compression with anisotropic diffusion}, ADDRESS = {Netherlands}, NUMBER = {2-3}, PUBLISHER = {Springer}, MONTH = {July}, VOLUME = {31}, ISBN = {0924-9907}, YEAR = {2008}, PAGES = {255--269}, } @INPROCEEDINGS{mpihandtracker2013, AUTHOR = {Sridhar, Srinath and Oulasvirta, Antti and Theobalt, Christian}, TITLE = {Interactive Markerless Articulated Hand Motion Tracking Using RGB and Depth Data}, BOOKTITLE = {IEEE International Conference on Computer Vision (ICCV)}, PADDRESS = {USA}, ADDRESS = {Sydney, Australia}, PUBLISHER = {IEEE}, YEAR = {2013}, } @INPROCEEDINGS{Mueller11_MIR_AES, AUTHOR = {M{\"u}ller, Meinard}, TITLE = {New Developments in Music Information Retrieval}, BOOKTITLE = {Proceedings of the AES 42nd International Conference: Semantic Audio}, PADDRESS = {s.l.}, ADDRESS = {Ilmenau, Germany}, PUBLISHER = {AES}, YEAR = {2011}, PAGES = {11--20}, } @ARTICLE{Mueller2008, AUTHOR = {Kurth, Frank and M{\"u}ller, Meinard}, JOURNAL = {IEEE Transactions on Audio, Speech, and Language Processing}, TITLE = {Efficient Index-Based Audio Matching}, NUMBER = {2}, PUBLISHER = {IEEE}, MONTH = {February}, VOLUME = {16}, ISBN = {1558-7916}, DOI = {10.1109/TASL.2007.911552}, YEAR = {2008}, PAGES = {382--395}, ABSTRACT = {Given a large audio database of music recordings, the goal of classical audio identification is to identify a particular audio recording by means of a short audio fragment. Even though recent identification algorithms show a significant degree of robustness towards noise, MP3 compression artifacts, and uniform temporal distortions, the notion of similarity is rather close to the identity. In this paper, we address a higher level retrieval problem, which we refer to as audio matching: given a short query audio clip, the goal is to automatically retrieve all excerpts from all recordings within the database that musically correspond to the query. In our matching scenario, opposed to classical audio identification, we allow semantically motivated variations as they typically occur in different interpretations of a piece of music. To this end, this paper presents an efficient and robust audio matching procedure that works even in the presence of significant variations, such as nonlinear temporal, dynamical, and spectral deviations, where existing algorithms for audio identification would fail. Furthermore, the combination of various deformation- and fault-tolerance mechanisms allows us to employ standard indexing techniques to obtain an efficient, index-based matching procedure, thus providing an important step towards semantically searching large-scale real-world music collections.}, } @INPROCEEDINGS{MuellerA08_ICASSP, AUTHOR = {M{\"u}ller, Meinard and Appelt, Daniel}, TITLE = {Path-constrained Partial Music Synchronization}, BOOKTITLE = {2008 IEEE International Conference on Acoustics, Speech, and Signal Processing}, ORGANIZATION = {IEEE}, PADDRESS = {IEEE}, ADDRESS = {Las Vegas, Nevada, U.S.A.}, PUBLISHER = {IEEE}, MONTH = {April}, ISBN = {1-4244-1484-9}, DOI = {10.1109/ICASSP.2008.4517547}, YEAR = {2008}, PAGES = {65--68}, } @INPROCEEDINGS{MuellerBS09_MocapAnnotation_SCA, AUTHOR = {M{\"u}ller, Meinard and Baak, Andreas and Seidel, Hans-Peter}, EDITOR = {Grinspun, Eitan and Hodgins, Jessica and Fellner, Dieter and Spencer, Stephen}, TITLE = {Efficient and Robust Annotation of Motion Capture Data}, BOOKTITLE = {Symposium on Computer Animation 2009 : ACM SIGGRAPH / Eurographics Symposium Proceedings}, PADDRESS = {New York, NY}, ADDRESS = {New Orleans, LA}, PUBLISHER = {ACM}, MONTH = {August}, ISBN = {978-1-60558-610-6}, DOI = {10.1145/1599470.1599473}, YEAR = {2009}, PAGES = {17--26}, } @ARTICLE{MuellerCKEF10_Sync_ISR, AUTHOR = {M{\"u}ller, Meinard and Clausen, Michael and Konz, Verena and Ewert, Sebastian and Fremerey, Christian}, JOURNAL = {Interdisciplinary Science Reviews}, TITLE = {A Multimodal Way of Experiencing and Exploring Music}, ADDRESS = {London, UK}, NUMBER = {2}, PUBLISHER = {Maney}, VOLUME = {35}, ISBN = {0308-0188}, DOI = {10.1179/030801810X12723585301110}, YEAR = {2010}, PAGES = {138--153}, } @INPROCEEDINGS{MuellerD12_DataDrivenSoundTrackGeneration_DagstuhlFU, AUTHOR = {M{\"u}ller, Meinard and Driedger, Jonathan}, EDITOR = {M{\"u}ller, Meinard and Goto, Masataka and Schedl, Markus}, TITLE = {Data-Driven Sound Track Generation}, BOOKTITLE = {Multimodal Music Processing}, PADDRESS = {Dagstuhl, Germany}, ADDRESS = {Dagstuhl, Germany}, PUBLISHER = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, SERIES = {Dagstuhl Follow-Ups}, VOLUME = {3}, YEAR = {2012}, PAGES = {175--194}, } @INPROCEEDINGS{MuellerE08_ISMIR, AUTHOR = {M{\"u}ller, Meinard and Ewert, Sebastian}, EDITOR = {Bello, Juan Pablo and Chew, Elaine and Turnbull, Douglas}, TITLE = {Joint Structure Analysis with Applications to Music Annotation and Synchronization}, BOOKTITLE = {Proceedings of the 9th International Conference on Music Information Retrieval (ISMIR 2008)}, PADDRESS = {Philadelphia, USA}, ADDRESS = {Philadelphia, Pennsylvania, USA}, MONTH = {September}, ISBN = {978-0-615-24849-3}, YEAR = {2008}, PAGES = {389--394}, } @INPROCEEDINGS{MuellerEK09_ChromaFeaturesRobust_ICASSP, AUTHOR = {M{\"u}ller, Meinard and Ewert, Sebastian and Kreuzer, Sebastian}, TITLE = {Making Chroma Features More Robust to Timbre Changes}, BOOKTITLE = {2009 IEEE International Conference on Acoustics, Speech, and Signal Processing : proceedings}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Taipei, Taiwan}, PUBLISHER = {IEEE}, MONTH = {April}, ISBN = {978-1-4244-2354-5}, DOI = {10.1109/ICASSP.2009.4959974}, YEAR = {2009}, PAGES = {1877--1880}, } @ARTICLE{MuellerEKR11_MusicProcessing_IEEE-JSTSP, AUTHOR = {M{\"u}ller, Meinard and Ellis, Daniel P. W. and Klapuri, Anssi and Richard, Gaël}, JOURNAL = {IEEE Journal on Selected Topics in Signal Processing}, TITLE = {Signal Processing for Music Analysis}, ADDRESS = {Piscataway, NJ}, NUMBER = {6}, PUBLISHER = {IEEE}, VOLUME = {5}, DOI = {10.1109/JSTSP.2011.2112333}, YEAR = {2011}, PAGES = {1088--1110}, } @ARTICLE{MuellerEKRS11_Editorial_IEEE-JSTSP, AUTHOR = {M{\"u}ller, Meinard and Ellis, Daniel P. W. and Klapuri, Anssi and Richard, Gaël and Sagayama, Shigeki}, JOURNAL = {IEEE Journal on Selected Topics in Signal Processing}, TITLE = {Introduction to the Special Issue on Music Signal Processing}, ADDRESS = {Piscataway, NJ}, NUMBER = {6}, PUBLISHER = {IEEE}, VOLUME = {5}, DOI = {10.1109/JSTSP.2011.2165109}, YEAR = {2011}, PAGES = {1085--1087}, } @ARTICLE{MuellerEwert10_CRP_TASLP, AUTHOR = {M{\"u}ller, Meinard and Ewert, Sebastian}, JOURNAL = {IEEE Transactions on Audio, Speech, and Language Processing}, TITLE = {Towards Timbre-Invariant Audio Features for Harmony-Based Music}, ADDRESS = {Piscataway, NJ-}, NUMBER = {3}, PUBLISHER = {IEEE}, VOLUME = {18}, ISBN = {1558-7916}, DOI = {10.1109/TASL.2010.2041394}, YEAR = {2010}, PAGES = {649--662}, } @INPROCEEDINGS{MuellerEwert11_ChromaToolbox_ISMIR, AUTHOR = {M{\"u}ller, Meinard and Ewert, Sebastian}, TITLE = {{Chroma} {Toolbox}: {MATLAB} implementations for extracting variants of chroma-based audio features}, BOOKTITLE = {12th International Society for Music Information Retrieval Conference (ISMIR 2011)}, PADDRESS = {s.l.}, ADDRESS = {Miami, USA}, PUBLISHER = {ISMIR}, YEAR = {2011}, PAGES = {215--220}, } @INPROCEEDINGS{MuellerG12_FolkSongSegmentation_ITG, AUTHOR = {M{\"u}ller, Meinard and Grosche, Peter}, TITLE = {Automated Segmentation of Folk Song Field Recordings}, BOOKTITLE = {Proceedings of the ITG Conference on Speech Communication}, PADDRESS = {-}, ADDRESS = {Braunschweig, Germany}, YEAR = {2012}, PAGES = {1--4}, } @ARTICLE{MuellerGD11_MultimodalMusic_DagstuhlReport, AUTHOR = {M{\"u}ller, Meinard and Goto, Masataka and Dixon, Simon}, JOURNAL = {Dagstuhl Reports}, TITLE = {Multimodal Music Processing ({Dagstuhl} {Seminar} 11041)}, ADDRESS = {Dagstuhl}, NUMBER = {1}, PUBLISHER = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, VOLUME = {1}, ISBN = {2192-5283}, DOI = {10.4230/DagRep.1.1.68}, YEAR = {2011}, PAGES = {68--101}, } @INPROCEEDINGS{MuellerGJ11_MusicStructureFitness_ISMIR, AUTHOR = {M{\"u}ller, Meinard and Grosche, Peter and Jiang, Nanzhu}, TITLE = {A Segment-Based Fitness Measure for Capturing Repetitive Structures of Music Recordings}, BOOKTITLE = {12th International Society for Music Information Retrieval Conference (ISMIR 2011)}, PADDRESS = {Canada}, ADDRESS = {Miami, USA}, PUBLISHER = {ISMIR}, YEAR = {2011}, PAGES = {615--620}, } @PROCEEDINGS{MuellerGS12_MultimodalMusicProcessing_DagstuhlFU, EDITOR = {M{\"u}ller, Meinard and Goto, Masataka and Schedl, Markus}, TITLE = {Multimodal Music Processing}, PADDRESS = {Dagstuhl, Germany}, ADDRESS = {Dagstuhl, Germany}, PUBLISHER = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, SERIES = {Dagstuhl Follow-Ups}, VOLUME = {3}, YEAR = {2011}, PAGES = {1--245}, } @INPROCEEDINGS{MuellerGW10_FolkSongPerformances_ACM-MIR, AUTHOR = {M{\"u}ller, Meinard and Grosche, Peter and Wiering, Frans}, EDITOR = {Wang, James Z. and Boujemaa, Nozha and Ramirez, Nuria Oliver and Natsev, Apostol}, TITLE = {Automated analysis of performance variations in folk song recordings}, BOOKTITLE = {Proceedings of the 2010 ACM SIGMM International Conference on Multimedia Information Retrieval : MIR 2010}, PADDRESS = {New York, NY}, ADDRESS = {Philadelphia, Pennsylvania, USA}, PUBLISHER = {ACM}, ISBN = {978-1-60558-815-5}, DOI = {10.1145/1743384.1743429}, YEAR = {2010}, PAGES = {247--256}, } @INPROCEEDINGS{MuellerGW_FolkSongAnnotation_ISMIR, AUTHOR = {M{\"u}ller, Meinard and Grosche, Peter and Wiering, Frans}, TITLE = {Robust Segmentation and Annotation of Folk Song Recordings}, BOOKTITLE = {10th International Society for Music Information Retrieval Conference : ISMIR 2009}, PADDRESS = {s.l.}, ADDRESS = {Kobe, Japan}, PUBLISHER = {ISMIR}, YEAR = {2009}, PAGES = {735--740}, } @INPROCEEDINGS{MuellerGW_FolkSong_Dagstuhl, AUTHOR = {M{\"u}ller, Meinard and Grosche, Peter and Wiering, Frans}, EDITOR = {Selfridge-Field, Eleanor and Wiering, Frans and Wiggins, Geraint A.}, TITLE = {Towards Automated Processing of Folk Song Recordings}, BOOKTITLE = {Knowledge representation for intelligent music processing}, PADDRESS = {Dagstuhl, Germany}, ADDRESS = {Dagstuhl, Germany}, NUMBER = {09051}, PUBLISHER = {LZI}, SERIES = {Dagstuhl Seminar Proceedings}, ISBN = {1862-4405}, YEAR = {2009}, PAGES = {1--15}, } @ARTICLE{MuellerJ08_CycSeq_DM, AUTHOR = {M{\"u}ller, Meinard and Jimbo, Masakazu}, JOURNAL = {Discrete Mathematics}, TITLE = {Cyclic Sequences of k-subsets with Distinct Consecutive Unions}, NUMBER = {2-3}, PUBLISHER = {Elsevier}, VOLUME = {308}, DOI = {10.1016/j.disc.2006.11.062}, YEAR = {2008}, PAGES = {457--464}, ABSTRACT = {In this paper, we investigate cyclic sequences which contain as elements all k-subsets of {0,1,...,n-1} exactly once such that the unions of any two consecutive k-subsets of this sequences are pairwise distinct. Furthermore, if Y is some prescribed subset of the power set of {0,1,...,n-1}, we require that all unions are in Y. In particular, we are interested in the case where Y consists of all subsets of order having the same parity as k. Among others, we show the existence of such cyclic sequences for k=2,3,...,7 and sufficiently large n. This kind of combinatorial problems is motivated from applications in combinatorial group testing. From our results, one obtains error detecting group testing procedures for items having the 2-consecutive positive property.}, } @ARTICLE{MuellerJG13_StructureAnaylsis_IEEE-TASLP, AUTHOR = {M{\"u}ller, Meinard and Jiang, Nanzhu and Grosche, Peter}, JOURNAL = {IEEE Transactions on Audio, Speech \& Language Processing}, TITLE = {A Robust Fitness Measure for Capturing Repetitions in Music Recordings With Applications to Audio Thumbnailing}, NUMBER = {3}, VOLUME = {21}, YEAR = {2013}, PAGES = {531--543}, } @INPROCEEDINGS{MuellerJiang12_ScapePlot_ISMIR, AUTHOR = {M{\"u}ller, Meinard and Jiang, Nanzhu}, TITLE = {A scape plot representation for visualizing repetitive structures of music recordings}, BOOKTITLE = {13th International Society for Music Information Retrieval Conference (ISMIR 2012)}, PADDRESS = {Canada}, ADDRESS = {Porto, Portugal}, PUBLISHER = {FEUP Edi{\c{c}}{\~{o}}es}, YEAR = {2012}, PAGES = {097--102}, } @INCOLLECTION{MuellerK11_InterpretationsForschung_Schott, AUTHOR = {M{\"u}ller, Meinard and Konz, Verena}, EDITOR = {von Loesch, Heinz and Weinzierl, Stefan}, TITLE = {{Automatisierte} {Methoden} zur {Unterst{\"u}tzung} der {Interpretationsforschung}}, BOOKTITLE = {Gemessene Interpretation}, ADDRESS = {Mainz, Germany}, PUBLISHER = {Schott Verlag}, SERIES = {Klang und Begriff}, VOLUME = {4}, ISBN = {978-3-7957-0771-2}, YEAR = {2011}, PAGES = {1--12}, } @INPROCEEDINGS{MuellerKJZ11_MultiPerspectiveInterface_ICMC, AUTHOR = {M{\"u}ller, Meinard and Konz, Verena and Jiang, Nanzhu and Zuo, Zhe}, EDITOR = {Adkins, Monty and Isaacs, Ben}, TITLE = {A Multi-perspective User Interface for Music Signal Analysis}, BOOKTITLE = {Proceedings of the International Computer Music Conference (ICMC 2011)}, PADDRESS = {San Francisco, CA}, ADDRESS = {Huddersfield, UK}, PUBLISHER = {The International Computer Music Association}, ISBN = {978-0-9845274-0-3}, YEAR = {2011}, PAGES = {205--211}, } @INPROCEEDINGS{MuellerKSEC_TempoParametersFromRecordings_ISMIR, AUTHOR = {M{\"u}ller, Meinard and Konz, Verena and Scharfstein, Andi and Ewert, Sebastian and Clausen, Michael}, TITLE = {Towards Automated Extraction of Tempo Parameters from Expressive Music Recordings}, BOOKTITLE = {10th International Society for Music Information Retrieval Conference : ISMIR 2009}, PADDRESS = {s.l.}, ADDRESS = {Kobe, Japan}, PUBLISHER = {ISMIR}, MONTH = {October}, YEAR = {2009}, PAGES = {69--74}, } @INPROCEEDINGS{MuellerPD12_TempoCrossVersion_ISMIR, AUTHOR = {M{\"u}ller, Meinard and Pr{\"a}tzlich, Thomas and Driedger, Jonathan}, EDITOR = {Gouyon, Fabien and Herrera, Perfecto and Martins, Luis Gustavo and M{\"u}ller, Meinard}, TITLE = {A cross-version approach for stabilizing tempo-based novelty detection}, BOOKTITLE = {13th International Society for Music Information Retrieval Conference (ISMIR 2012)}, PADDRESS = {Canada}, ADDRESS = {Porto, Portugal}, PUBLISHER = {FEUP Edi{\c{c}}{\~{o}}es}, YEAR = {2012}, PAGES = {427--432}, } @INPROCEEDINGS{MullerDR08_Evolution_DAGM, AUTHOR = {M{\"u}ller, Meinard and Demuth, Bastian and Rosenhahn, Bodo}, EDITOR = {Rigoll, Gerhard}, TITLE = {An Evolutionary Approach for Learning Motion Class Patterns}, BOOKTITLE = {Pattern Recognition}, ORGANIZATION = {DAGM}, PADDRESS = {Berlin, Germany}, ADDRESS = {Munich, Germany}, PUBLISHER = {Springer}, MONTH = {June}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5096}, ISBN = {978-3-540-69320-8}, DOI = {10.1007/978-3-540-69321-5_37}, YEAR = {2008}, PAGES = {365--374}, } @ARTICLE{Myszkowski2000a, AUTHOR = {Myszkowski, Karol and Rokita, Przemyslaw and Tawara, Takehiro}, JOURNAL = {IEEE Transactions on Visualization and Computer Graphics}, TITLE = {Perception-Based Fast Rendering and Antialiasing of Walkthrough Sequences}, ADDRESS = {Los Alamitos, USA}, NUMBER = {4}, PUBLISHER = {IEEE}, MONTH = {October}, VOLUME = {6}, ISBN = {1077-2626}, YEAR = {2000}, PAGES = {360--379}, ABSTRACT = { In this paper, we consider accelerated rendering of high quality walkthrough animation sequences along predefined paths. To improve rendering performance we use a combination of: a hybrid ray tracing and Image-Based Rendering (IBR) technique, and a novel perception-based antialiasing technique. In our rendering solution we derive as many pixels as possible using inexpensive IBR techniques without affecting the animation quality. A perception-based spatiotemporal Animation Quality Metric (AQM) is used to automatically guide such a hybrid rendering. The Image Flow (IF) obtained as a by-product of the IBR computation is an integral part of the AQM. The final animation quality is enhanced by an efficient spatiotemporal antialiasing, which utilizes the IF to perform a motion-compensated filtering. The filter parameters have been tuned using the AQM predictions of animation quality as perceived by the human observer. These parameters adapt locally to the visual pattern velocity.}, } @ARTICLE{Myszkowski2000b, AUTHOR = {Myszkowski, Karol and Kunii, Tosiyasu L.}, JOURNAL = {The Visual Computer}, TITLE = {A Case Study Towards Validation of Global Illumination Algorithms: Progressive Hierarchical Radiosity with Clustering}, ADDRESS = {Berlin, Germany}, NUMBER = {5}, PUBLISHER = {Springer}, VOLUME = {16}, ISBN = {0178-2789}, YEAR = {2000}, PAGES = {271--288}, ABSTRACT = {The paper consists of two main parts: presentation of an efficient global illumination algorithm and description of its extensive experimental validation. In the first part, a hybrid of cluster-based hierarchical and progressive radiosity techniques is proposed, which does not require storing links between interacting surfaces and clusters. The clustering does not rely on input geometry, but is performed on the basis of local position in the scene for a pre-meshed scene model. The locality of the resulting clusters improves the accuracy of form factor calculations, and increases the number of possible high-level energy transfers between clusters within an imposed error bound. Limited refinement of the hierarchy of light interactions is supported without compromising the quality of shading when intermediate images are produced immediately upon user request. In the second part, a multi-stage validation procedure is proposed and results obtained using the presented algorithm are discussed. At first, experimental validation of the algorithm against analytically-derived and measured real-world data is performed to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then the algorithm performance and rendering quality is tested by a direct comparison of the virtual and real-world images of a complex environment.}, } @INPROCEEDINGS{Myszkowski2000c, AUTHOR = {Ershov, Sergey and Kolchin, Konstantin and Myszkowski, Karol}, EDITOR = {Chalmers, Alan and Rhyne, Theresa-Marie}, TITLE = {Rendering Pearlescent Appearance Based on Paint-Composition Modeling}, BOOKTITLE = {The European Association for Computer Graphics 22th Annual Conference: EUROGRAPHICS 2001}, ORGANIZATION = {Eurographics}, PADDRESS = {Oxford, UK}, ADDRESS = {Manchester, UK}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {20(3)}, YEAR = {2001}, PAGES = {227--238}, } @INCOLLECTION{Myszkowski2000d, AUTHOR = {Myszkowski, Karol}, EDITOR = {McNamara, Ann and Chalmers, Alan}, TITLE = {Chapter 4: Perception-driven Global Illumination and Rendering Computation, and Chapter 6: Perception-driven rendering of high-quality walkthrough animations}, BOOKTITLE = {Image quality metrics (Course 44)}, ORGANIZATION = {Association of Computing Machinery (ACM)}, CHAPTER = {4 and 6}, ADDRESS = {New York, USA}, PUBLISHER = {ACM SIGGRAPH}, MONTH = {July}, SERIES = {ACM Siggraph Course Notes}, VOLUME = {44}, ISBN = {1-58113-276-X}, YEAR = {2000}, PAGES = {43--59~and~75-81}, } @PROCEEDINGS{Myszkowski2000egwr, EDITOR = {Gortler, Steven and Myszkowski, Karol}, TITLE = {Rendering Techniques 2001: Proceedings of the 12th Eurographics Workshop on Rendering}, ORGANIZATION = {Eurographics}, PADDRESS = {Wien}, ADDRESS = {University College London}, PUBLISHER = {Springer}, MONTH = {August}, SERIES = {Springer Computer Science}, ISBN = {3-211-83709-4}, YEAR = {2001}, PAGES = {1--347}, } @ARTICLE{Myszkowski2001a, AUTHOR = {Drago, Frederic and Myszkowski, Karol}, JOURNAL = {Computers \& Graphics}, TITLE = {Validation Proposal for Global Illumination and Rendering Techniques}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {3}, PUBLISHER = {Elsevier}, VOLUME = {25}, ISBN = {0097-8493}, YEAR = {2001}, PAGES = {511--518}, ABSTRACT = {The goal of this study is to develop a complete set of data characterizing geometry, luminaires, and surfaces of a non-trivial existing environment for testing global illumination and rendering techniques. This paper briefly discusses the process of data acquisition. Also, the results of experiments on evaluating lighting simulation accuracy, and rendering fidelity for a Density Estimation Particle Tracing algorithm are presented. The importance of using the BRDF of surfaces in place of the more commonly used specular and diffuse reflectance coefficients is investigated for the test scene. The results obtained are contrasted with an ``artistic approach'' in which a skilled artist manually sets all reflectance characteristics to obtain a visually pleasant appearance that corresponds to the existing environment.}, } @ARTICLE{Myszkowski2001Aizu, AUTHOR = {Myszkowski, Karol}, JOURNAL = {The Journal of Three Dimensional Images}, TITLE = {Applications of the Visual Differences Predictor in Global Illumination Computation}, ADDRESS = {Hon-Komagome 5-16-9, Bunkyo-ku, 113-8622 Tokyo-To}, NUMBER = {4}, PUBLISHER = {3D Forum}, MONTH = {December}, VOLUME = {15}, ISBN = {1342-2189}, YEAR = {2001}, PAGES = {57--64}, ABSTRACT = {We investigate applications of the Visible Difference Predictor (VDP) to steer global illumination computation. We use the VDP to monitor the progression of computation as a function of time for major global illumination algorithms. Based on the results obtained, we propose a novel global illumination algorithm which is a hybrid of stochastic (density estimation) and deterministic (adaptive mesh refinement) techniques used in an optimized sequence to reduce the differences between the intermediate and final images as predicted by the VDP. Also, the VDP is applied to decide upon stopping conditions for global illumination simulation, when further continuation of computation does not contribute to perceivable changes in the quality of the resulting images.}, } @INPROCEEDINGS{Myszkowski2001b, AUTHOR = {Myszkowski, Karol and Tawara, Takehiro and Akamine, Hiroyuki and Seidel, Hans-Peter}, EDITOR = {Fiume, Eugene}, TITLE = {Perception-Guided Global Illumination Solution for Animation Rendering}, BOOKTITLE = {Computer Graphics (SIGGRAPH-2001): Conference Proceedings}, ORGANIZATION = {Association of Computing Machinery (ACM)}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, USA}, PUBLISHER = {ACM}, SERIES = {Annual Conference Series}, ISBN = {1-58113-292-1}, YEAR = {2001}, PAGES = {221--230}, } @INCOLLECTION{Myszkowski2001e, AUTHOR = {Myszkowski, Karol}, EDITOR = {McNamara, Ann and Chalmers, Alan}, TITLE = {Chapter 6: Applications in Rendering and Animation}, BOOKTITLE = {ACM Siggraph 2001, Course Notes: Seeing is Believing: Reality Perception in Modeling, Rendering and Animation}, TYPE = {Book and CD-ROM}, ADDRESS = {New York, USA}, PUBLISHER = {ACM Siggraph}, SERIES = {ACM Siggraph 2001, Course Notes}, VOLUME = {21}, YEAR = {2001}, PAGES = {1--52}, } @PHDTHESIS{Myszkowski2001hab, AUTHOR = {Myszkowski, Karol}, TITLE = {Efficient and Predictive Realistic Image Synthesis}, SCHOOL = {Warsaw Institute of Technology}, TYPE = {Habilitation thesis}, ADDRESS = {Warsaw, Poland}, PUBLISHER = {Oficyna Wydawnicza Politechniki Warszawskiej}, MONTH = {May}, YEAR = {2001}, NOTE = {ISSN 0137-2343}, ABSTRACT = {Synthesis of realistic images which predict the appearance of the real world has many applications including architecture and interior design, illumination engineering, environmental assessment, special effects and film production, along with many others. Due to costly global illumination computation, which is required for the prediction of appearance, physically-based rendering still remains the domain of research laboratories, and is rarely used in industrial practice. The main goal of this work is to analyze problems and provide solutions towards making predictive rendering an efficient and practical tool. First, existing global illumination techniques are discussed, then efficient solutions which handle complex geometry, multiple light sources, and arbitrary light scattering characteristics are proposed. Since real-time lighting computation is not affordable for complex environments, techniques of lighting storage and real-time reconstruction using pre-calculated results are developed. Special attention is paid to the solutions which use perception-guided algorithms to improve their performance. This makes it possible to focus the computation on readily visible scene details, and to stop it when further improvement of the image quality cannot be perceived by the human observer. Also, by better use of perception-motivated physically-based partial solutions, meaningful images can be presented to the user at the early stages of computation. Since many algorithms make simplifying assumptions about the underlying physical model in order to achieve gains in rendering performance, a validation procedure for testing lighting simulation accuracy and image quality is proposed. To check the requirement of appearance predictability imposed on the developed algorithms, the rendered images are compared against the corresponding real-world views.}, } @INPROCEEDINGS{Myszkowski2003, AUTHOR = {Drago, Frederic and Martens, William and Myszkowski, Karol and Chiba, Norishige}, EDITOR = {Rogowitz, Bernice E. and Pappas, Thrasyvoulos}, TITLE = {Design of a Tone Mapping Operator for High Dynamic Range Images Based upon Psychophysical Evaluation and Preference Mapping}, BOOKTITLE = {Human Vision and Electronic Imaging VIII (HVEI-03)}, PADDRESS = {Bellinghan, USA}, ADDRESS = {Santa Clara, USA}, PUBLISHER = {SPIE}, MONTH = {April}, SERIES = {SPIE proceedings}, VOLUME = {5007}, YEAR = {2003}, PAGES = {321--331}, ABSTRACT = {A tone mapping algorithm for displaying high contrast scenes was designed on the basis of the results of experimental tests using human subjects. Systematic perceptual evaluation of several existing tone mapping techniques revealed that the most ``natural'' appearance was determined by the presence in the output image of detailed scenery features often made visible by limiting contrast and by properly reproducing brightness. Taking these results into account, we developed a system to produce images close to the ideal preference point for high dynamic range input image data. Of the algorithms that we tested, only the Retinex algorithm was capable of retrieving detailed scene features hidden in high luminance areas while still preserving a good contrast level. This paper presents changes made to Retinex algorithm for processing high dynamic range images, and a further integration of the Retinex with specialized tone mapping algorithms that enables the production of images that appear as similar as possible to the viewer's perception of actual scenes.}, } @INPROCEEDINGS{Myszkowski2007, AUTHOR = {Mantiuk, Radoslaw and Zdrojewska, Dorota and Tomaszewska, Anna and Mantiuk, Rafał and Myszkowski, Karol}, EDITOR = {Myszkowski, Karol}, TITLE = {Selected Problems of High Dynamic Range Video Compression and GPU-based Contrast Domain Tone Mapping}, BOOKTITLE = {SCCG '08: Proceedings of the 24th Spring Conference on Computer Graphics}, PADDRESS = {New York, USA}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {ACM}, MONTH = {April}, YEAR = {2008}, PAGES = {11--18}, ABSTRACT = {The main goal of High Dynamic Range Imaging (HDRI) is precise reproduction of real world appearance in terms of intensity levels and color gamut at all stages of image and video processing from acquisition to display. In our work, we investigate the problem of lossy HDR image and video compression and provide a number of novel solutions, which are optimized for storage efficiency or backward compatibility with existing compression standards. To take advantage of HDR information even for traditional low-dynamic range displays, we design tone mapping algorithms, which adjust HDR contrast ranges in a scene to those available in typical display devices.}, } @INCOLLECTION{Myszkowski2007HDRbook1, AUTHOR = {Krawczyk, Grzegorz and Myszkowski, Karol and Brosch, Daniel}, EDITOR = {Hoefflinger, Bernd}, TITLE = {HDR Tone Mapping}, BOOKTITLE = {High-Dynamic-Range (HDR) Vision}, ADDRESS = {Heidelberg}, PUBLISHER = {Springer}, SERIES = {Springer Series in Advanced Microelectronics (26)}, ISBN = {978-3-540-44432-9}, YEAR = {2007}, PAGES = {147--178}, } @INCOLLECTION{Myszkowski2007HDRBook2, AUTHOR = {Goesele, Michael and Myszkowski, Karol}, EDITOR = {Hoefflinger, Bernd}, TITLE = {HDR Applications in Computer Graphics}, BOOKTITLE = {High-Dynamic-Range (HDR) Vision}, ADDRESS = {Heidelberg}, PUBLISHER = {Springer}, SERIES = {Springer Series in Advanced Microelectronics (26)}, ISBN = {78-3-540-44432-9}, YEAR = {2007}, PAGES = {193--210}, } @BOOK{Myszkowski2008, AUTHOR = {Myszkowski, Karol and Mantiuk, Rafał and Krawczyk, Grzegorz}, TITLE = {High Dynamic Range Video}, ADDRESS = {San Rafael, USA}, PUBLISHER = {Morgan \& Claypool Publishers}, SERIES = {Synthesis Digital Library of Engineering and Computer Science}, ISBN = {9781598292145}, YEAR = {2008}, PAGES = {158}, ABSTRACT = {As new displays and cameras offer enhanced color capabilities, there is a need to extend the precision of digital content. High Dynamic Range (HDR) imaging encodes images and video with higher than normal 8 bit-per-color-channel precision, enabling representation of the complete color gamut and the full visible range of luminance.However, to realize transition from the traditional toHDRimaging, it is necessary to develop imaging algorithms that work with the high-precision data. Tomake such algorithms effective and feasible in practice, it is necessary to take advantage of the limitations of the human visual system by aligning the data shortcomings to those of the human eye, thus limiting storage and processing precision. Therefore, human visual perception is the key component of the solutions we discuss in this book. This book presents a complete pipeline for HDR image and video processing from acquisition, through compression and quality evaluation, to display. At the HDR image and video acquisition stage specialized HDR sensors or multi-exposure techniques suitable for traditional cameras are discussed. Then, we present a practical solution for pixel values calibration in terms of photometric or radiometric quantities, which are required in some technically oriented applications. Also, we cover the problem of efficient image and video compression and encoding either for storage or transmission purposes, including the aspect of backward compatibility with existing formats. Finally, we review existing HDR display technologies and the associated problems of image contrast and brightness adjustment. For this purpose tone mapping is employed to accommodate HDR content to LDR devices. Conversely, the so-called inverse tone mapping is required to upgrade LDR content for displaying on HDR devices. We overview HDR-enabled image and video quality metrics, which are needed to verify algorithms at all stages of the pipeline. Additionally, we cover successful examples of the HDR technology applications, in particular, in computer graphics and computer vision. The goal of this book is to present all discussed components of the HDR pipeline with the main focus on video. For some pipeline stages HDR video solutions are either not well established or do not exist at all, in which case we describe techniques for single HDR images. In such cases we attempt to select the techniques, which can be extended into temporal domain. Whenever needed, relevant background information on human perception is given, which enables better understanding of the design choices behind the discussed algorithms and HDR equipment. Table of Contents: Introduction / Representation of an HDR Image / HDR Image and Video Acquisition / HDR Image Quality / HDR Image, Video, and Texture Compression / Tone Reproduction / HDR Display Devices / LDR2HDR: Recovering Dynamic Range in Legacy Content / HDRI in Computer Graphics / Software}, } @BOOK{Myszkowski2008APGV, EDITOR = {Creem-Regehr, Sarah and Myszkowski, Karol}, TITLE = {Symposium on Applied Perception in Graphics and Visualization}, ADDRESS = {New York, USA}, PUBLISHER = {ACM}, YEAR = {2008}, PAGES = {157}, } @BOOK{Myszkowski2008SCCG, EDITOR = {Myszkowski, Karol}, TITLE = {Proceedings of the 24th Spring Conference on Computer Graphics (SCCG '08)}, ADDRESS = {New York, USA}, PUBLISHER = {ACM}, YEAR = {2008}, PAGES = {211}, } @INPROCEEDINGS{MyszkowskiSCCG2002, AUTHOR = {Myszkowski, Karol}, EDITOR = {Chalmers, Alan}, TITLE = {Perception-Based Global Illumination, Rendering, and Animation Techniques}, BOOKTITLE = {Proceedings of the 18th Spring Conference on Computer Graphics (SCCG 2002)}, PADDRESS = {New York, USA}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {ACM Siggraph}, ISBN = {1-58113-608-0}, YEAR = {2002}, PAGES = {13--24}, } @INPROCEEDINGS{MyszkowskiSpie2002, AUTHOR = {Myszkowski, Karol and Tawara, Takehiro and Seidel, Hans-Peter}, EDITOR = {Rogowitz, Bernice E. and Pappas, Thrasyvoulos}, TITLE = {Using Animation Quality Metric to Improve Efficiency of Global Illumination Computation for Dynamic Environments}, BOOKTITLE = {Proceedings of 7th SPIE Conference Human Vision and Electronic Imaging}, PADDRESS = {Washington, USA}, ADDRESS = {San Jose, USA}, PUBLISHER = {SPIE}, SERIES = {SPIE Proceedings Series}, VOLUME = {4662}, ISBN = {0-8194-4402-2}, YEAR = {2002}, PAGES = {187--196}, } @INPROCEEDINGS{nahmedMirage2007, AUTHOR = {Ahmed, Naveed and Theobalt, Christian and Seidel, Hans-Peter}, EDITOR = {Gagalowicz, Andr{\'e} and Philips, Wilfried}, TITLE = {Spatio-temporal Reflectance Sharing for Relightable 3D Video}, BOOKTITLE = {Computer Vision/Computer Graphics Collaboration Techniques : Third International Conference ; {MIRAGE} 2007}, PADDRESS = {Berlin, Germany}, ADDRESS = {Rocquencourt, France}, PUBLISHER = {Springer}, MONTH = {March}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4418}, ISBN = {978-3-540-71456-9}, DOI = {10.1007/978-3-540-71457-6_5}, YEAR = {2007}, PAGES = {47--58}, ABSTRACT = {In our previous work, we have shown that by means of a model based approach, relightable free viewpoint videos of human actors can be reconstructed from only a handful of multi view video streams recorded under calibrated illumination. To achieve this purpose, we employ a marker free motion capture approach to measure dynamic human scene geometry. Reflectance samples for each surface point are captured by exploiting the fact that, due to the person's motion, each surface location is, over time, exposed to the acquisition sensors under varying orientations. Although this is the first setup of its kind to measure surface reflectance from footage of arbitrary human performances, our approach may lead to a biased sampling of surface reflectance since each surface point is only seen under a limited number of half vector directions. We thus propose in this paper a novel algorithm that reduces the bias in BRDF estimates of a single surface point by cleverly taking into account reflectance samples from other surface locations made of similar material. We demonstrate the improvements achieved with this spatio temporal reflectance sharing approach both visually and quantitatively.}, } @INPROCEEDINGS{NahmedVRST2005, AUTHOR = {Ahmed, Naveed and de Aguiar, Edilson and Theobalt, Christian and Magnor, Marcus and Seidel, Hans-Peter}, TITLE = {Automatic Generation of Personalized Human Avatars from Multi-View Video}, BOOKTITLE = {VRST '05: Proceedings of the ACM symposium on Virtual reality software and technology}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, USA}, ADDRESS = {Monterey, USA}, PUBLISHER = {ACM}, MONTH = {December}, ISBN = {1-59593-098-1}, YEAR = {2005}, PAGES = {257--260}, } @INPROCEEDINGS{NaveedCVPR08a, AUTHOR = {Ahmed, Naveed and Theobalt, Christian and R{\"o}ssl, Christian and Thrun, Sebastian and Seidel, Hans-Peter}, TITLE = {Dense Correspondence Finding for Parametrization-free Animation Reconstruction from Video}, BOOKTITLE = {IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2008)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Anchorage, Alaska}, PUBLISHER = {IEEE Computer Society}, YEAR = {2008}, PAGES = {1--8}, ABSTRACT = {We present a dense 3D correspondence finding method that enables spatio-temporally coherent reconstruction of surface animations from multi-view video data. Given as input a sequence of shape-from-silhouette volumes of a moving subject that were reconstructed for each time frame individually, our method establishes dense surface correspondences between subsequent shapes independently of surface discretization. This is achieved in two steps: first, we obtain sparse correspondences from robust optical features between adjacent frames. Second, we generate dense correspondences which serve as map between respective surfaces. By applying this procedure subsequently to all pairs of time steps we can trivially align one shape with all others. Thus, the original input can be reconstructed as a sequence of meshes with constant connectivity and small tangential distortion. We exemplify the performance and accuracy of our method using several synthetic and captured real-world sequences.}, } @INPROCEEDINGS{NaveedCVPR08b, AUTHOR = {Ahmed, Naveed and Theobalt, Christian and Dobrev, Petar and Seidel, Hans-Peter and Thrun, Sebastian}, TITLE = {Robust Fusion of Dynamic Shape and Normal Capture for High-quality Reconstruction of Time-varying Geometry}, BOOKTITLE = {IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2008)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Anchorage, Alaska}, PUBLISHER = {IEEE Computer Society}, MONTH = {June}, YEAR = {2008}, PAGES = {1--8}, ABSTRACT = {We present a new passive approach to capture time-varying scene geometry in large acquisition volumes from multi-view video. It can be applied to reconstruct complete moving models of human actors that feature even slightest dynamic geometry detail, such as wrinkles and folds in clothing, and that can be viewed from 360 degrees. Starting from multi-view video streams recorded under calibrated lighting, we first perform marker-less human motion capture based on a smooth template with no high-frequency surface detail. Subsequently, surface reflectance and time-varying normal fields are estimated based on the coarse template shape. The main contribution of this work is a new statistical approach to solve the non-trivial problem of transforming the captured normal field that is defined over the smooth non-planar 3D template into true 3D displacements. Our spatio-temporal reconstruction method outputs displaced geometry that is accurate at each time step of video and temporally smooth, even if the input data are affected by noise.}, } @MASTERSTHESIS{Naveed:MT:2004, AUTHOR = {Ahmed, Naveed}, TITLE = {BRDF Reconstruction from Video Streams of Multi-View Recordings}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {August}, YEAR = {2004}, ABSTRACT = {Synthesizing photorealistic images is an active area of research in computer graphics. Image based rendering combined with inverse rendering methods is used to generate photorealistic images from real world images under novel illumination conditions. Traditionally, very high-quality real world images of static objects, obtained under known viewing and lighting conditions are used in inverse rendering for the measurement of surface reflectance properties. This thesis focuses on surface material reconstruction of dynamic objects from video streams of multi-view recordings. Working with fairly low resolution movie streams of a dynamic object recorded in known viewing conditions and a geometry model tracked through all time steps, we approximate the best light source configuration, and measure the bidirectional reflectance distribution function of the object. We construct diffuse and specular maps for the whole sequence, and a diffuse correction map for each time step. We have applied our method to sequences of a human actor and are now able to synthesize views of the actor in arbitrary poses under arbitrary lighting conditions.}, } @INPROCEEDINGS{Neff2006a, AUTHOR = {Neff, Michael and Seidel, Hans-Peter}, EDITOR = {Perales, Francisco Jos{\'e} and Fisher, Robert B.}, TITLE = {Modeling Relaxed Hand Shape for Character Animation}, BOOKTITLE = {Articulated motion and deformable objects : 4th International Conference, AMDO 2006}, PADDRESS = {Berlin, Germany}, ADDRESS = {Port d'Andratx, Spain}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4069}, ISBN = {3-540-36031-X}, DOI = {10.1007/11789239_27}, YEAR = {2006}, PAGES = {262--270}, ABSTRACT = {We present a technique for modeling the deformations that occur to hand pose under the influence of gravity when the hand is kept in a relaxed state. A dynamic model of the hand is built using Proportional- Derivative controllers as a first order approximation to muscles. A process for tuning the model to match the relaxed hand shape of subjects is discussed. Once the model is tuned, it can be used to sample the space of all possible arm orientations and samples of wrist and finger angles are taken. From these samples, a kinematic model of passive hand deformation is built. Either the tuned dynamic model or the kinematic model can be used to generate final animations. These techniques increase the realism of gesture animation, where the character often maintains a relaxed hand.}, } @INPROCEEDINGS{Neff2007, AUTHOR = {Neff, Michael and Albrecht, Irene and Seidel, Hans-Peter}, EDITOR = {Cohen-Or, Daniel and Slavik, Pavel}, TITLE = {Layered performance animation with correlation maps}, BOOKTITLE = {Eurographics 2007}, ORGANIZATION = {European Association for Computer Graphics}, PADDRESS = {Oxford, UK}, ADDRESS = {Prague, Czech Republic}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {26}, YEAR = {2007}, PAGES = {675--684}, } @ARTICLE{Neff2008, AUTHOR = {Neff, Michael and Kipp, Michael and Albrecht, Irene and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Gesture Modeling and Animation Based on a Probabilistic Recreation of Speaker Style}, NUMBER = {1}, VOLUME = {27}, YEAR = {2008}, PAGES = {5}, } @ARTICLE{Neumann2013, AUTHOR = {Neumann, Thomas and Varanasi, Kiran and Hasler, Nils and Wacker, Marcus and Magnor, Markus and Theobalt, Christian}, JOURNAL = {Computer Graphics Forum (Proceedings EUROGRAPHICS 2013)}, TITLE = {Capture and Statistical Modeling of Arm-Muscle Deformations}, BOOKTITLE = {Proceedings of the 34th Annual Conference of the European Association for Computer Graphics}, ADDRESS = {Geneve, Switzerland}, PUBLISHER = {Eurographics Association}, MONTH = {May}, SERIES = {Computer Graphics Forum}, VOLUME = {32}, YEAR = {2013}, ABSTRACT = {We present a comprehensive data-driven statistical model for skin and muscle deformation of the human shoulder-arm complex. Skin deformations arise from complex bio-physical effects such as non-linear elasticity of muscles, fat, and connective tissue; and vary with physiological constitution of the subjects and external forces applied during motion. Thus, they are hard to model by direct physical simulation. Our alternative approach is based on learning deformations from multiple subjects performing different exercises under varying external forces. We capture the training data through a novel multi-camera approach that is able to reconstruct fine-scale muscle detail in motion. The resulting reconstructions from several people are aligned into one common shape parametrization, and learned using a semi-parametric non-linear method. Our learned data-driven model is fast, compact and controllable with a small set of intuitive parameters - pose, body shape and external forces, through which a novice artist can interactively produce complex muscle deformations. Our method is able to capture and synthesize fine-scale muscle bulge effects to a greater level of realism than achieved previously. We provide quantitative and qualitative validation of our method. }, } @ARTICLE{Nguyen2012, AUTHOR = {Nguyen, Chuong and Ritschel, Tobias and Myszkowski, Karol and Eisemann, Elmar and Seidel, Hans-Peter}, EDITOR = {Cignoni, P. and Ertl, T.}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, TITLE = {3{D} Material Style Transfer}, BOOKTITLE = {Computer Graphics Forum (Proc. of EUROGRAPHICS)}, ORGANIZATION = {Eurographics Association}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell Publishing Ltd}, MONTH = {May}, SERIES = {Computer Graphics Forum}, VOLUME = {31}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2012.03022.x}, YEAR = {2012}, PAGES = {431--438}, ABSTRACT = {This work proposes a technique to transfer the material style or mood from a guide source such as an image or video onto a target 3D scene. It formulates the problem as a combinatorial optimization of assigning discrete materials extracted from the guide source to discrete objects in the target 3D scene. The assignment is optimized to fulfill multiple goals: overall image mood based on several image statistics; spatial material organization and grouping as well as geometric similarity between objects that were assigned to similar materials. To be able to use common uncalibrated images and videos with unknown geometry and lighting as guides, a material estimation derives perceptually plausible reflectance, specularity, glossiness, and texture. Finally, results produced by our method are compared to manual material assignments in a perceptual study.}, } @ARTICLE{Nguyen2013, AUTHOR = {Nguyen, Chuong and Scherzer, Daniel and Ritschel, Tobias and Seidel, Hans-Peter}, EDITOR = {Navazo, I. and Poulin, I.}, JOURNAL = {Computer Graphics Forum (Proceedings EUROGRAPHICS 2013)}, TITLE = {Material Editing in Complex Scenes by Surface Light Field Manipulation and Reflectance Optimization}, BOOKTITLE = {Computer Graphics Forum (Proc. of EUROGRAPHICS)}, ORGANIZATION = {Eurographics Association}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell}, MONTH = {May}, SERIES = {Computer Graphics Forum}, VOLUME = {32}, YEAR = {2013}, ABSTRACT = {This work addresses the challenge of intuitive appearance editing in scenes with complex geometric layout and complex, spatially-varying indirect lighting. In contrast to previous work, that aimed to edit surface reflectance, our system allows a user to freely manipulate the surface light field. It then finds the best surface reflectance that ``explains'' the surface light field manipulation. Instead of classic $\mathcal L_2$ fitting of reflectance to a combination of incoming and exitant illumination, our system infers a sparse $\mathcal L_0$ change of shading parameters instead. Consequently, our system does not require ``diffuse'' or ``glossiness'' brushes or any such understanding of the underlying reflectance parametrization. Instead, it infers reflectance changes from scribbles made by a single simple color brush tool alone: Drawing a highlight will increase Phong specular; blurring a mirror reflection will decrease glossiness; etc. A sparse-solver framework operating on a novel point-based, pre-convolved lighting representation in combination with screen-space edit upsampling allows to perform editing interactively on a GPU.}, } @ARTICLE{NoRM_EG2012, AUTHOR = {Herzog, Robert and {\v{C}}ad{\'i}k, Martin and Aydin, Tun{\c{c}} and Kim, Kwang-In and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Cignoni, P. and Ertl, T.}, JOURNAL = {Computer Graphics Forum (Proceedings EUROGRAPHICS 2012)}, TITLE = {{NoRM}: No-Reference Image Quality Metric for Realistic Image Synthesis}, BOOKTITLE = {Computer Graphics Forum (Proc. of EUROGRAPHICS)}, ORGANIZATION = {Eurographics Association}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell Publishing Ltd}, VOLUME = {31}, ISBN = {0167-7055}, YEAR = {2012}, PAGES = {545--554}, ABSTRACT = {Synthetically generating images and video frames of complex 3D scenes using some photo-realistic rendering software is often prone to artifacts and requires expert knowledge to tune the parameters. The manual work required for detecting and preventing artifacts can be automated through objective quality evaluation of synthetic images. Most practical objective quality assessment methods of natural images rely on a ground-truth reference, which is often not available in rendering applications. While general purpose no-reference image quality assessment is a difficult problem, we show in a subjective study that the performance of a dedicated no-reference metric as presented in this paper can match the state-of-the-art metrics that do require a reference. This level of predictive power is achieved exploiting information about the underlying synthetic scene (e.g., 3D surfaces, textures) instead of merely considering color, and training our learning framework with typical rendering artifacts. We show that our method successfully detects various non-trivial types of artifacts such as noise and clamping bias due to insufficient virtual point light sources, and shadow map discretization artifacts. We also briefly discuss an inpainting method for automatic correction of detected artifacts.}, } @ARTICLE{nrsz:qiqpp:2004, AUTHOR = {N{\"u}rnberger, G{\"u}nther and R{\"o}ssl, Christian and Zeilfelder, Frank and Seidel, Hans-Peter}, JOURNAL = {Computer Aided Geometric Design}, TITLE = {Quasi-Interpolation by Quadratic Piecewise Polynomials in Three Variables}, ADDRESS = {Amsterdam, The Netherlands}, PUBLISHER = {Elsevier}, VOLUME = {22}, YEAR = {2005}, PAGES = {221--249}, ABSTRACT = {A quasi-interpolation method for quadratic piecewise polynomials in three variables is described which can be used for the efficient reconstruction and visualization of gridded volume data. We analyze the smoothness properties of the trivariate splines. We prove that the splines yield nearly optimal approximation order while simultaneously its piecewise derivatives provide optimal approximation of the derivatives of smooth functions. The constants of the corresponding error bounds are given explicitly. Numerical tests confirm the results and the efficiency of the method.}, } @INPROCEEDINGS{nrz:avignon:2007, AUTHOR = {N{\"u}rnberger, G{\"u}nther and R{\"o}ssl, Christian and Zeilfelder, Frank}, EDITOR = {Chenin, Patrick and Lyche, Tom and Schumaker, Larry L.}, TITLE = {High-quality rendering of iso-surfaces extracted from quadratic super splines}, BOOKTITLE = {Curve and Surface Design: Avignon 2006}, PADDRESS = {Brentwood, TN, USA}, ADDRESS = {Avignon, France}, PUBLISHER = {Nashboro Press}, SERIES = {Modern Methods in Mathematics}, ISBN = {978-0-9728482-7-5}, YEAR = {2007}, PAGES = {203--212}, ABSTRACT = {The extraction of iso-surfaces from discrete volume data is an important and well-studied problem with many applications. %% We present a new method for extraction and high-quality rendering of iso-surfaces which are explicitly represented by quadratic bivariate splines with interpolating properties. %% The approach is based on trivariate quadratic super splines as a non-discrete volumetric model of the gridded samples. The piecewise triangular domain of the interpolatory spline surfaces is determined in terms of an application of the marching cubes algorithm and an appropriate remeshing. %% Our results show that the combination of the spline surface model with a natural normal field obtained from the volumetric splines leads to high-quality renderings of these approximative iso-surfaces suitable for the applications in Computer Graphics.}, } @ARTICLE{Nuernberger:2000:InterpolSS, AUTHOR = {N{\"u}rnberger, G{\"u}nther and Zeilfelder, Frank}, JOURNAL = {Journal of Computational and Applied Mathematics}, TITLE = {Interpolation by spline spaces on classes of triangulations}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {1/2}, PUBLISHER = {Elsevier}, MONTH = {May}, VOLUME = {119}, ISBN = {0377-0427}, YEAR = {2000}, PAGES = {347--376}, } @ARTICLE{Ohtake-gm06b, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander and Seidel, Hans-Peter}, JOURNAL = {Graphical Models}, TITLE = {A composite approach to meshing scattered data}, ADDRESS = {San Diego, CA, USA}, NUMBER = {3}, PUBLISHER = {ACM}, VOLUME = {68}, ISBN = {1524-0703}, YEAR = {2006}, PAGES = {255--267}, ABSTRACT = {In this paper, we propose a new method for approximating an unorganized set of points scattered over a piecewise smooth surface by a triangle mesh. The method is based on the Garland-Heckbert local quadric error minimization strategy. First an adaptive spherical cover and auxiliary points corresponding to the cover elements are generated. Then the intersections between the spheres of the cover are analyzed and the auxiliary points are connected. Finally the resulting mesh is cleaned from nonmanifold parts. The method allows us to control the approximation accuracy, process noisy data, and reconstruct sharp edges and corners. Further, the vast majority of the triangles of the generated mesh have their aspect ratios close to optimal. Thus our approach integrates the mesh reconstruction, smoothing, decimation, feature restoration, and remeshing stages together.}, } @ARTICLE{Ohtake-gmod05, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander and Seidel, Hans-Peter}, JOURNAL = {Graphical Models}, TITLE = {3D scattered data interpolation and approximation with multilevel compactly supported RBFs}, NUMBER = {3}, PUBLISHER = {Elsevier}, VOLUME = {67}, YEAR = {2005}, PAGES = {150--165}, ABSTRACT = {In this paper, we propose a hierarchical approach to 3D scattered data interpolation and approximation with compactly supported radial basis functions. Our numerical experiments suggest that the approach integrates the best aspects of scattered data fitting with locally and globally supported basis functions. Employing locally supported functions leads to an efficient computational procedure, while a coarse-to-fine hierarchy makes our method insensitive to the density of scattered data and allows us to restore large parts of missed data. Given a point cloud distributed over a surface, we first use spatial down sampling to construct a coarse-to-fine hierarchy of point sets. Then we interpolate (approximate) the sets starting from the coarsest level. We interpolate (approximate) a point set of the hierarchy, as an offsetting of the interpolating function computed at the previous level. The resulting fitting procedure is fast, memory efficient, and easy to implement.}, } @ARTICLE{Ohtake-gmod06a, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander and Seidel, Hans-Peter}, JOURNAL = {Graphical Models}, TITLE = {Sparse surface reconstruction with adaptive partition of unity and radial basis functions}, NUMBER = {1}, PUBLISHER = {Elsevier}, MONTH = {January}, VOLUME = {68}, YEAR = {2006}, PAGES = {15--24}, ABSTRACT = {A new implicit surface fitting method for surface reconstruction from scattered point data is proposed. The method combines an adaptive partition of unity approximation with least-squares RBF fitting and is capable of generating a high quality surface reconstruction. Given a set of points scattered over a smooth surface, first a sparse set of overlapped local approximations is constructed. The partition of unity generated from these local approximants already gives a faithful surface reconstruction. The final reconstruction is obtained by adding compactly supported RBFs. The main feature of the developed approach consists of using various regularization schemes which lead to economical, yet accurate surface reconstruction.}, } @INPROCEEDINGS{Ohtake-sgp05, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander and Alexa, Marc}, EDITOR = {Desbrun, Mathieu and Pottman, H.}, TITLE = {Sparse Low-degree Implicit Surfaces with Applications to High Quality Rendering, Feature Extraction, and Smoothing}, BOOKTITLE = {Eurographics Symposium on Geometry Processing 2005}, ORGANIZATION = {Eurographics Association}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Vienna, Austria}, PUBLISHER = {Eurographics}, YEAR = {2005}, PAGES = {149--158}, ABSTRACT = {We propose a new surface representation delivering an accurate approximation to a set of points scattered over a smooth surface by {\bf S}parse {\bf L}ow-degree {\bf IM}plicits ({\bf SLIM}). The SLIM surface representation consists of a sparse multi-scale set of nonconforming surface primitives which are blended along view rays during the rendering phase. This new representation leads to an interactive real-time visualization of large-size models and delivers a better rendering quality than standard splatting techniques based on linear primitives. Further, SLIM allows us to achieve a fast and accurate estimation of surface curvature and curvature derivatives and, therefore, is very suitable for many non-photorealistic rendering tasks. Applications to ray-tracing and surface smoothing are also considered.}, } @INPROCEEDINGS{Ohtake-spm05, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander and Seidel, Hans-Peter}, TITLE = {An Integrating Approach to Meshing Scattered Point Data}, BOOKTITLE = {ACM Symposium on Solid and Physical Modeling (SPM 2005)}, PADDRESS = {USA}, ADDRESS = {Cambridge, MA, USA}, PUBLISHER = {ACM}, MONTH = {June}, YEAR = {2005}, PAGES = {61--69}, } @ARTICLE{Okabe2009, AUTHOR = {Okabe, Makoto and Anjyo, Ken and Igarashi, Takeo and Seidel, Hans-Peter}, EDITOR = {Dutr{\'e}, Philip and Stamminger, Marc}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS 2009)}, TITLE = {Animating Pictures of Fluid using Video Examples}, BOOKTITLE = {The European Association for Computer Graphics 30th Annual Conference : EUROGRAPHICS 2009}, ADDRESS = {Oxford}, NUMBER = {2}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {28}, ISBN = {0167-7055}, YEAR = {2009}, PAGES = {677--686}, } @INPROCEEDINGS{Olberding2013, AUTHOR = {Olberding, Simon and Yeo, Kian Peen and Nanayakkara, Suranga and Steimle, J{\"u}rgen}, TITLE = {{A}ugmented{F}orearm: Exploring the Design Space of a Display-enhanced Forearm}, BOOKTITLE = {Proc. 4th International Conference on Augmented Human (AH'13)}, PADDRESS = {New York, USA}, ADDRESS = {Stuttgart, Germany}, PUBLISHER = {ACM}, YEAR = {2013}, } @INPROCEEDINGS{Olberding:2013:CMS:2501988.2502048, AUTHOR = {Olberding, Simon and Tiab, John and Steimle, J{\"u}rgen}, TITLE = {A Cuttable Multi-touch Sensor}, BOOKTITLE = {26th Annual ACM Symposium on User Interface Software and Technology}, PADDRESS = {New York, USA}, ADDRESS = {St. Andrews, Scotland, United Kingdom}, PUBLISHER = {ACM}, YEAR = {2013}, } @ARTICLE{Oulasvirta2012, AUTHOR = {Oulasvirta, Antti}, JOURNAL = {IEEE Pervasive Computing}, TITLE = {Rethinking Experimental Designs for Field Evaluations}, ADDRESS = {Piscataway, NJ}, NUMBER = {4}, PUBLISHER = {IEEE}, VOLUME = {11}, YEAR = {2012}, PAGES = {60--67}, } @ARTICLE{Oulasvirta2012toap, AUTHOR = {Oulasvirta, Antti and Nurminen, Antti and Suomalainen, Tiia}, JOURNAL = {ACM Transactions on Applied Perception}, TITLE = {How Real is Real Enough? {O}ptimal Reality Sampling for Fast Recognition of Mobile Imagery}, ADDRESS = {New York, USA}, NUMBER = {4}, PUBLISHER = {ACM}, VOLUME = {9}, YEAR = {2012}, PAGES = {100--118}, } @INPROCEEDINGS{Oulasvirta2012ubicomp, AUTHOR = {Oulasvirta, Antti and Pihlajamaa, Aurora and Perki{\"o}, Jukka and V{\"a}h{\"a}kangas, Taneli and Debarshi, Ray and Hasu, Tero and Vainio, Niklas and Myllym{\"a}ki, Petri}, TITLE = {Long-term effects of ubiquitous surveillance in the home}, BOOKTITLE = {The 14th International Conference on Ubiquitous Computing (Ubicomp 2012)}, ORGANIZATION = {ACM}, PADDRESS = {New York, USA}, ADDRESS = {Pittsburgh, USA}, PUBLISHER = {ACM}, DOI = {10.1145/2370216.2370224}, YEAR = {2012}, PAGES = {41--50}, } @INPROCEEDINGS{Oulasvirta2013icm, AUTHOR = {Oulasvirta, Antti and Roos, Teemu and Modig, Arttu and Lepp{\"a}nen, Laura}, TITLE = {Information Capacity of Full-body Movements}, BOOKTITLE = {ACM SIGCHI Conference on Human Factors in Computing Systems (CHI'13)}, PADDRESS = {New York, USA}, ADDRESS = {Paris, France}, PUBLISHER = {ACM}, YEAR = {2013}, } @INPROCEEDINGS{Oulasvirta2013rotations, AUTHOR = {Hoggan, Eve and Williamson, John and Oulasvirta, Antti and Nacenta, Miguel and Kristensson, Per Ola and Lehti{\"o}, Anu}, TITLE = {Multi-touch Rotations Gestures: Performance and Ergonomics}, BOOKTITLE = {ACM SIGCHI Conference on Human Factors in Computing Systems (CHI'13)}, TYPE = {Note}, PADDRESS = {New York, USA}, ADDRESS = {Paris, France}, PUBLISHER = {ACM}, YEAR = {2013}, } @INPROCEEDINGS{Oulasvirta2013tablet, AUTHOR = {Oulasvirta, Antti and Reichel, Anna and Bachynskyi, Myroslav and Li, Wenbin and Zhang, Yan and Kristensson, Per Ola and Vertanen, Keith}, TITLE = {Improving Two-thumb Text Entry on Touchscreen Devices}, BOOKTITLE = {ACM SIGCHI Conference on Human Factors in Computing Systems (CHI'13)}, PADDRESS = {New York, USA}, ADDRESS = {Paris, France}, PUBLISHER = {ACM}, YEAR = {2013}, } @INPROCEEDINGS{Pajak2010, AUTHOR = {Pajak, Dawid and {\v{C}}ad{\'i}k, Martin and Aydin, Tunc Ozan and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Rogowitz, Bernice and Pappas, Thrasyvoulous N.}, TITLE = {Visual Maladaptation in Contrast Domain}, BOOKTITLE = {Human Vision and Electronic Imaging XV}, PADDRESS = {Bellingham, WA}, ADDRESS = {San Jose, CA, USA}, PUBLISHER = {Society of Photo-Optical Instrumentation Engineers}, SERIES = {Proceedings of SPIE}, VOLUME = {7527}, ISBN = {9780819479204}, DOI = {10.1117/12.844934}, YEAR = {2010}, PAGES = {10,1--10,12}, } @MISC{Patent_Hasler2011, AUTHOR = {Hasler, Nils and Stoll, Carsten and Theobalt, Christian and Seidel, Hans-Peter}, TITLE = {Method and System for tracking an object in a sequence of digital video images}, HOWPUBLISHED = {WO Patent Application WO/2012/156141 A1}, MONTH = {March}, YEAR = {2011}, } @MISC{Patent_Hullin2011-1, AUTHOR = {Hullin, Matthias and Lee, Sungkil and Eisemann, Elmar and Seidel, Hans-Peter}, TITLE = {Physically-based Real Time Lens Flare Rendering}, HOWPUBLISHED = {WO Patent Application Pending}, MONTH = {January}, YEAR = {2011}, } @MISC{Patent_Hullin2011-2, AUTHOR = {Hullin, Matthias and Seidel, Hans-Peter and Lensch, Hendrik and Ihrke, Ivo}, TITLE = {Dynamic Display of BRDFs}, HOWPUBLISHED = {WO Patent Application Pending}, MONTH = {February}, YEAR = {2011}, } @MISC{Patent_Jain2012, AUTHOR = {Jain, Arjun and Thorm{\"a}hlen, Thorsten and Ritschel, Tobias and Seidel, Hans-Peter}, TITLE = {A system for automatic material suggestions for 3D objects}, HOWPUBLISHED = {WO Patent Application Pending}, MONTH = {October}, YEAR = {2012}, } @MISC{Patent_Kim2012, AUTHOR = {Kim, Kwang In and Theobalt, Christian and Tompkin, James and Kautz, Jan}, TITLE = {Videoscapes: Exploring Sparse, Unstructed Vidoe Collections}, HOWPUBLISHED = {WO Patent Application Pending}, MONTH = {March}, YEAR = {2012}, } @MISC{Patent_Klehm2012, AUTHOR = {Klehm, Oliver and Manakov, Alkhazur and Heged{\"u}s, Ramon and Ihrke, Ivo and Restrepo, John}, TITLE = {Reconfigurable Kaleidoscopic Multiplexing for Multi-Spectral, Directional, Polarimetric, and Extended Speed Snapshot Imaging on Standard Sensors}, HOWPUBLISHED = {WO Patent Application Pending}, MONTH = {April}, YEAR = {2013}, } @MISC{Patent_Thormaehlen2011, AUTHOR = {Thorm{\"a}hlen, Thorsten and Theobalt, Christian and Seidel, Hans-Peter}, TITLE = {Method and Device for Tracking and Reshaping a Human Shaped Figure in an Digital Video}, HOWPUBLISHED = {WO Patent Application WO/2013/072617 A1}, MONTH = {June}, YEAR = {2012}, } @INPROCEEDINGS{PaulusMK10_MusicStructure-STAR_ISMIR, AUTHOR = {Paulus, Jouni and M{\"u}ller, Meinard and Klapuri, Anssi}, EDITOR = {Downie, J. Stephen and Veltkamp, Remco C.}, TITLE = {Audio-based Music Structure Analysis}, BOOKTITLE = {Proceedings of the 11th International Society for Music Information Retrieval Conference (ISMIR 2010)}, PADDRESS = {s.l.}, ADDRESS = {Utrecht, Netherlands}, PUBLISHER = {ISMIR}, ISBN = {978-90-393-53813}, YEAR = {2010}, PAGES = {625--636}, } @INPROCEEDINGS{pbg05sbs, AUTHOR = {Schall, Oliver and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Pauly, Mark and Zwicker, Matthias}, TITLE = {Robust Filtering of Noisy Scattered Point Data}, BOOKTITLE = {IEEE/Eurographics Symposium on Point-Based Graphics}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Stony Brook, New York, USA}, PUBLISHER = {Eurographics}, YEAR = {2005}, PAGES = {71--77}, ABSTRACT = {In this paper, we develop a method for robust filtering of a noisy set of points sampled from a smooth surface. The main idea of the method consists of using a kernel density estimation technique for point clustering. Specifically, we use a mean-shift based clustering procedure. With every point of the input data we associate a local likelihood measure capturing the probability that a 3D point is located on the sampled surface. The likelihood measure takes into account the normal directions estimated at the scattered points. Our filtering procedure suppresses noise of different amplitudes and allows for an easy detection of outliers which are then automatically removed by simple thresholding. The remaining set of maximum likelihood points delivers an accurate point-based approximation of the surface. We also show that while some established meshing techniques often fail to reconstruct the surface from original noisy point scattered data, they work well in conjunction with our filtering method.}, } @ARTICLE{peikert2012, AUTHOR = {Peikert, Ronald and G{\"u}nther, David and Weinkauf, Tino}, JOURNAL = {Physica D: Nonlinear Phenomena}, TITLE = {Comment on "{S}econd derivative ridges are straight lines and the implications for computing Lagrangian Coherent Structures, {Physica D 2012.05.006}"}, NUMBER = {1}, PUBLISHER = {Elsevier}, MONTH = {January}, VOLUME = {242}, DOI = {10.1016/j.physd.2012.09.002}, YEAR = {2013}, PAGES = {65--66}, } @INPROCEEDINGS{pg02ybs, AUTHOR = {Yoshizawa, Shin and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Coquillart, Sabine and Shum, Heung-Yeung and Hu, Shi-Min}, TITLE = {A Simple Approach to Interactive Free-Form Shape Deformations}, BOOKTITLE = {Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2002)}, ORGANIZATION = {Tsinghua University}, TYPE = {Poster}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Beijing, China}, PUBLISHER = {IEEE}, MONTH = {October}, ISBN = {0-7695-1784-6}, YEAR = {2002}, PAGES = {471--474}, ABSTRACT = {In this paper, we propose a set of free-form shape deformation techniques. The basic technique can be described as follows. Given a surface represented by a mesh and a control point, for every mesh vertex let us consider the difference between the control point and the vertex. The vertex is shifted by a displacement equal to the difference times a scale factor where the scale factor is given by a function depending nonlinearly on the difference. The function is bump-shaped and depends on a number of parameters. Varying the parameters leads to a rich palette of shape deformations. The proposed techniques include also shape deformations with multiple (real, auxiliary, and virtual) control points and constrained, directional, and anisotropic deformations. We demonstrate how that the proposed set of techniques allows a user to edit a given shape interactively and intuitively. The techniques use no mesh connectivity information and, therefore, can be applied directly to a shape given as a cloud of points.}, } @PROCEEDINGS{PG1999, EDITOR = {Kim, Myung-Soo and Seidel, Hans-Peter}, TITLE = {Proceedings of Pacific Graphics 1999}, ORGANIZATION = {IEEE Computer Society}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Seoul, Korea}, PUBLISHER = {IEEE}, YEAR = {1999}, } @PHDTHESIS{PhDThesis2011Bokeloh, AUTHOR = {Bokeloh, Martin}, TITLE = {Symmetry in {3D} Shapes - Analysis and Applications to Model Synthesis}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {November}, YEAR = {2011}, PAGES = {134}, } @PHDTHESIS{PhDThesis2011Dong, AUTHOR = {Dong, Zhao}, TITLE = {Visually Pleasing Real-time Global Illumination Rendering for Fully-dynamic Scenes}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {March}, YEAR = {2011}, PAGES = {168}, } @PHDTHESIS{PhDThesis2011Ziegler, AUTHOR = {Ziegler, Gernot}, TITLE = {{GPU} Data Structures for Graphics and Vision}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {May}, YEAR = {2011}, PAGES = {176}, } @PHDTHESIS{PhDThesis2013:Shaheen_Mohammed, AUTHOR = {Shaheen, Mohammed}, TITLE = {Cache based Optimization of Stencil Computations An Algorithmic Approach}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {November}, YEAR = {2013}, } @PHDTHESIS{PhDThesisBaak, AUTHOR = {Baak, Andreas}, TITLE = {Retrieval-based Approaches for Tracking and Reconstructing Human Motions}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {November}, YEAR = {2012}, } @PHDTHESIS{PhDThesisKonzVerena, AUTHOR = {Konz, Verena}, TITLE = {Automated Methods for Audio-Based Music Analysis with Applications to Musicology}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {November}, YEAR = {2012}, } @PHDTHESIS{PhDThesis:Jain,Arjun, AUTHOR = {Jain, Arjun}, TITLE = {Data-driven Methods for Interactive Visual Content Creation and Manipulation}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, YEAR = {2014}, } @INPROCEEDINGS{PonsBaHeMuSeRo10_MultisensorFusion_CVPR, AUTHOR = {Pons-Moll, Gerard and Baak, Andreas and Helten, Thomas and M{\"u}ller, Meinard and Seidel, Hans-Peter and Rosenhahn, Bodo}, TITLE = {Multisensor-fusion for {3D} Full-Body Human Motion Capture}, BOOKTITLE = {2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010). - Pt. 1}, PADDRESS = {Piscataway, NJ}, ADDRESS = {San Francisco, CA, USA}, PUBLISHER = {IEEE}, ISBN = {978-1-424-46984-0}, DOI = {10.1109/CVPR.2010.5540153}, YEAR = {2010}, PAGES = {663--670}, } @INPROCEEDINGS{PonsMollBaGaMuSeRo2011_OutdoorMocap_ICCV, AUTHOR = {Pons-Moll, Gerard and Baak, Andreas and Gall, J{\"u}rgen and Leal-Taix{\'e}, Laura and M{\"u}ller, Meinard and Seidel, Hans-Peter and Rosenhahn, Bodo}, TITLE = {Outdoor Human Motion Capture using Inverse Kinematics and von {Mises-Fisher} Sampling}, BOOKTITLE = {2011 IEEE International Conference on Computer Vision (ICCV)}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Barcelona, Spain}, PUBLISHER = {IEEE}, ISBN = {978-1-4577-1101-5}, DOI = {10.1109/ICCV.2011.6126375}, YEAR = {2011}, PAGES = {1243--1250}, } @INPROCEEDINGS{popov:06:ESC, AUTHOR = {Popov, Stefan and G{\"u}nther, Johannes and Seidel, Hans-Peter and Slusallek, Philipp}, EDITOR = {Wald, Ingo and Parker, Steven G.}, TITLE = {Experiences with Streaming Construction of {SAH} KD-Trees}, BOOKTITLE = {Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing}, ORGANIZATION = {IEEE}, PADDRESS = {Piscataway, USA}, ADDRESS = {Salt Lake City, USA}, PUBLISHER = {IEEE}, MONTH = {September}, ISBN = {1-4244-0693-5}, YEAR = {2006}, PAGES = {89--94}, NOTE = {Best Paper Award}, ABSTRACT = {A major reason for the recent advancements in ray tracing performance is the use of optimized acceleration structures, namely kd-trees based on the surface area heuristic (SAH). Though algorithms exist to build these search trees in $O(n\log n)$, the construction times for larger scenes are still high and do not allow for rebuilding the kd-tree every frame to support dynamic changes. In this paper we propose modifications to previous kd-tree construction algorithms that significantly increase the coherence of memory accesses during construction of the kd-tree. Additionally we provide theoretical and practical results regarding \emph{conservatively} sub-sampling of the SAH cost function.}, } @INPROCEEDINGS{popov:07:GPURT, AUTHOR = {Popov, Stefan and G{\"u}nther, Johannes and Seidel, Hans-Peter and Slusallek, Philipp}, EDITOR = {Cohen-Or, Daniel and Slavik, Pavel}, JOURNAL = {Computer Graphics Forum}, TITLE = {Stackless KD-Tree Traversal for High Performance {GPU} Ray Tracing}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, ORGANIZATION = {European Association for Computer Graphics}, PADDRESS = {Oxford, UK}, ADDRESS = {Prague, Czech Republic}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, VOLUME = {26(3)}, YEAR = {2007}, PAGES = {415--424}, ABSTRACT = {Significant advances have been achieved for realtime ray tracing recently, but realtime performance for complex scenes still requires large computational resources not yet available from the CPUs in standard PCs. Incidentally, most of these PCs also contain modern GPUs that do offer much larger raw compute power. However, limitations in the programming and memory model have so far kept the performance of GPU ray tracers well below that of their CPU counterparts. In this paper we present a novel packet ray traversal implementation that completely eliminates the need for maintaining a stack during kd-tree traversal and that reduces the number of traversal steps per ray. While CPUs benefit moderately from the stackless approach, it improves GPU performance significantly. We achieve a peak performance of over 16 million rays per second for reasonably complex scenes, including complex shading and secondary rays. Several examples show that with this new technique GPUs can actually outperform equivalent CPU based ray tracers.}, } @MISC{Pouli2012a, AUTHOR = {Pouli, Tania and Reinhard, Erik}, TITLE = {Example-Based Color Image Manipulation and Enhancement}, HOWPUBLISHED = {SIGGRAPH Course Notes}, MONTH = {August}, YEAR = {2012}, PAGES = {1--112}, } @INPROCEEDINGS{pouli:2012, AUTHOR = {Pouli, Tania and Subramanian, Sriram}, TITLE = {Mobile Projectors versus Mobile Displays: an Assessment of Task Performance}, BOOKTITLE = {Proceedings of the ACM Symposium on Applied Perception (SAP'12)}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, California, USA}, PUBLISHER = {ACM}, MONTH = {August}, ISBN = {978-1-4503-1431-2}, DOI = {10.1145/2338676.2338698}, YEAR = {2012}, PAGES = {103--110}, ABSTRACT = {Mobile projectors are gaining momentum, with many pocket sized products reaching the market and projector phones being close to production. Although the usefulness of such devices for entertainment, collaboration as well as many other tasks is obvious, it is not yet clear how their limitations in terms of image quality, brightness and jitter due to hand motion might affect performance. To answer these questions, we conduct two experiments based on traditional psychophysical methods. Using a visual search and a text reading study we compare task performance on a mobile phone display and a mobile projector. In addition, we examine whether performance is affected when devices are handheld rather than placed on a stable surface. We find that the perceived task difficulty is worse on the mobile projector cases for both tasks, while only in the visual search task leads to quantitatively worse performance. In contrast, we find that the stability of the projection plays no role in task performance but tasks performed on a handheld device may be perceived as harder to complete.}, } @MISC{Quigley:2013:VVC:2468356.2468826, AUTHOR = {Steimle, J{\"u}rgen}, TITLE = {Visions and Visioning in CHI: CHI 2013 Special Interest Group Meeting}, HOWPUBLISHED = {CHI '13 Extended Abstracts on Human Factors in Computing Systems}, YEAR = {2013}, } @ARTICLE{Reinert2012, AUTHOR = {Reinert, Bernhard and Ritschel, Tobias and Seidel, Hans-Peter}, EDITOR = {Bregler, Chris and Sander, Pedro and Wimmer, Michael}, JOURNAL = {Computer Graphics Forum (Proc. Pacific Graphics)}, TITLE = {Homunculus Warping: Conveying importance using self-intersection-free non-homogeneous mesh deformation}, BOOKTITLE = {20th Pacific Conference on Computer Graphics and Applications}, ADDRESS = {New York, NY, USA}, NUMBER = {7-2}, PUBLISHER = {John Wiley \& Sons, Inc.}, MONTH = {September}, SERIES = {Computer Graphics Forum (Proc. Pacific Graphics)}, VOLUME = {31}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2012.03209.x}, YEAR = {2012}, PAGES = {2165--2171}, } @INPROCEEDINGS{Reinert2013, AUTHOR = {Reinert, Bernhard and Ritschel, Tobias and Seidel, Hans-Peter}, TITLE = {Interactive By-example Design of Artistic Packing Layouts}, BOOKTITLE = {ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2013}, PADDRESS = {New York, NY, USA}, ADDRESS = {Hong Kong, China}, NUMBER = {6}, PUBLISHER = {ACM}, MONTH = {November}, SERIES = {ACM Transactions on Graphics}, VOLUME = {32}, DOI = {10.1145/2508363.2508409}, YEAR = {2013}, ABSTRACT = {We propose an approach to “pack” a set of two-dimensional graphical primitives into a spatial layout that follows artistic goals. We formalize this process as projecting from a high-dimensional feature space into a 2D layout. Our system does not expose the control of this projection to the user in form of sliders or similar interfaces. Instead, we infer the desired layout of all primitives from interactive placement of a small subset of example primitives. To produce a pleasant distribution of primitives with spatial extend, we produce a pleasant distribution of primitives with spatial extend, we propose a novel generalization of Centroidal Voronoi Tesselation which equalizes the distances between boundaries of nearby primitives. Compared to previous primitive distribution approaches our GPU implementation achieves both better fidelity and asymptotically higher speed. A user study evaluates the system’s usability.}, } @ARTICLE{Reinhard2012, AUTHOR = {Reinhard, Erik and Pouli, Tania and Kunkel, Timo and Long, Ben and Ballestad, Anders and Damberg, Gerwin}, JOURNAL = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH Asia)}, TITLE = {Calibrated Image Appearance Reproduction}, ADDRESS = {New York}, NUMBER = {6}, PUBLISHER = {ACM}, MONTH = {November}, VOLUME = {31}, ISBN = {0730-0301}, DOI = {10.1145/2366145.2366220}, YEAR = {2012}, PAGES = {201:1--201:11}, ABSTRACT = {Managing the appearance of images across different display environments is a difficult problem, exacerbated by the proliferation of high dynamic range imaging technologies. Tone reproduction is often limited to luminance adjustment and is rarely calibrated against psychophysical data, while color appearance modeling addresses color reproduction in a calibrated manner, albeit over a limited luminance range. Only a few image appearance models bridge the gap, borrowing ideas from both areas. Our take on scene reproduction reduces computational complexity with respect to the state-of-the-art, and adds a spatially varying model of lightness perception. The predictive capabilities of the model are validated against all psychophysical data known to us, and visual comparisons show accurate and robust reproduction for challenging high dynamic range scenes.}, } @INCOLLECTION{Reinhard2012, AUTHOR = {Sundstedt, Veronica and Bernhard, Matthias and Stavrakis, Efstathios and Reinhard, Erik and Wimmer, Michael}, TITLE = {Visual Attention and Gaze Behavior in Games: An Object-based Approach}, BOOKTITLE = {Game Analytics: Maximizing the Value of Player Data}, ADDRESS = {New York}, PUBLISHER = {Springer}, YEAR = {2013}, PAGES = {543--583}, } @INPROCEEDINGS{Reinhard2012a, AUTHOR = {Kiser, Chris and Reinhard, Erik and Tocci, Mike and Tocci, Nora}, TITLE = {Real Time Automated Tone Mapping System for {HDR} Video}, BOOKTITLE = {Proceedings of the IEEE International Conference on Image Processing}, ORGANIZATION = {IEEE}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Orlando, Florida}, PUBLISHER = {IEEE}, MONTH = {September}, YEAR = {2012}, PAGES = {2749--2752}, ABSTRACT = {Tone Mapping of HDR Images has been studied extensively since the introduction of digital HDR capture methods. However, until recently HDR video has not been realized in a viable form as that given by Tocci et al.[1], which will lead to readily available HDR video cameras. Because they capture video with much broader dynamic range than can currently be displayed, these cameras present a unique challenge. In order to maintain backward-compatibility with legacy broadcast, recording, and display equipment, HDR video cameras need to provide a real-time tonemapped LDR video stream without the benefit of post-processing steps. The purpose of this research is to present a complete TMO solution that can be implemented in real time hardware to yield a high-quality automated LDR video stream suitable for direct use by today’s recording, broadcast, and display equipment.}, } @INPROCEEDINGS{Reinhard2012c, AUTHOR = {Zhang, Yang and Reinhard, Erik and Bull, Dave}, TITLE = {Perceptually Lossless High Dynamic Range Image Compression with {JPEG} 2000}, BOOKTITLE = {Proceedings of the IEEE International Conference on Image Processing}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Orlando, Florida}, PUBLISHER = {IEEE}, MONTH = {September}, DOI = {10.1109/ICIP.2012.6467045}, YEAR = {2012}, PAGES = {1057--1060}, } @INPROCEEDINGS{Reinhard2012d, AUTHOR = {Reinhard, Erik}, TITLE = {Example-Based Image Manipulation}, BOOKTITLE = {Proceedings of the 6th European Conference on Colour in Graphics, Imaging and Video (CGIV 2012)}, PADDRESS = {Springfield, VA}, ADDRESS = {Amsterdam}, PUBLISHER = {IS\&T}, ISBN = {978-0-89208-299-5}, YEAR = {2012}, PAGES = {1--4}, ABSTRACT = {Many color-related image adjustments can be conveniently executed by exposing at most a small number of parameters to the user. Examples are tone reproduction, contrast enhancements, gamma correction and white balancing. Others require manual touch-ups, applied by means of brush strokes. More recently, a new class of algorithms has emerged, which transfers specific image attributes from one or more example images to a target. These attributes do not have to be well-defined and concepts that are difficult to quantify with a small set of parameters, such as the “mood” of an image, can be instilled upon a target image simply through the mechanism of selecting appropriate examples. This makes example-based image manipulation a particularly suitable paradigm in creative applications, but also finds uses in more technical tasks such as stereo pair correction,video compression, image colorization, panorama stitching and creating night-time images out of day-light shots.}, } @INPROCEEDINGS{Reinhard2012e, AUTHOR = {Zhang, Yang and Reinhard, Erik and Agrafiotis, Dimitris and Bull, Dave}, TITLE = {Image and Video Compression for {HDR} Content}, BOOKTITLE = {SPIE Conference on Applications of Digital Image Processing XXXV}, ORGANIZATION = {SPIE}, PADDRESS = {Bellingham, WA}, ADDRESS = {San Diego}, PUBLISHER = {SPIE}, VOLUME = {8499}, ISBN = {9780819492166}, DOI = {10.1117/12.931500}, YEAR = {2012}, PAGES = {0H1--0H13}, ABSTRACT = {High Dynamic Range (HDR) technology can offer high levels of immersion with a dynamic range meeting and exceeding that of the Human Visual System (HVS). A primary drawback with HDR images and video is that memory and bandwidth requirements are significantly higher than for conventional images and video. Many bits can be wasted coding redundant imperceptible information. The challenge is therefore to develop means for efficiently compressing HDR imagery to a manageable bit rate without compromising perceptual quality. In this paper, we build on previous work of ours and propose a compression method for both HDR images and video, based on an HVS optimised wavelet subband weighting method. The method has been fully integrated into a JPEG 2000 codec for HDR image compression and implemented as a pre-processing step for HDR video coding (an H.264 codec is used as the host codec for video compression). Experimental results indicate that the proposed method outperforms previous approaches and operates in accordance with characteristics of the HVS, tested objectively using a HDR Visible Difference Predictor (VDP). Aiming to further improve the compression performance of our method, we additionally present the results of a psychophysical experiment, carried out with the aid of a high dynamic range display, to determine the difference in the noise visibility threshold between HDR and Standard Dynamic Range (SDR) luminance edge masking. Our findings show that noise has increased visibility on the bright side of a luminance edge. Masking is more consistent on the darker side of the edge.© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.}, } @BOOK{Reinhard2013, AUTHOR = {Pouli, Tania and Reinhard, Erik and Cunningham, Douglas W}, TITLE = {Image Statistics in Visual Computing}, ADDRESS = {Natick, MA}, PUBLISHER = {A K Peters}, MONTH = {December}, YEAR = {2013}, PAGES = {366}, } @ARTICLE{Reinhard2013a, AUTHOR = {Reinhard, Erik and Efros, Alexei and Kautz, Jan and Seidel, Hans-Peter}, JOURNAL = {Proceedings of the IEEE}, TITLE = {On Visual Realism of Synthesized Imagery}, ADDRESS = {New York}, NUMBER = {9}, PUBLISHER = {IEEE}, MONTH = {September}, VOLUME = {101}, ISBN = {0018-9219}, YEAR = {2013}, } @ARTICLE{reininghaus12a, AUTHOR = {Reininghaus, Jan and G{\"u}nther, David and Hotz, Ingrid and Weinkauf, Tino and Seidel, Hans-Peter}, JOURNAL = {ArXiv}, TITLE = {Combinatorial Gradient Fields for 2{D} Images with Empirically Convergent Separatrices}, ADDRESS = {Ithaca, NJ}, PUBLISHER = {Cornell University Library}, VOLUME = {1208.6523v1}, YEAR = {2012}, PAGES = {1--17}, ABSTRACT = {This paper proposes an efficient probabilistic method that computes combinatorial gradient fields for two dimensional image data. In contrast to existing algorithms, this approach yields a geometric Morse-Smale complex that converges almost surely to its continuous counterpart when the image resolution is increased. This approach is motivated using basic ideas from probability theory and builds upon an algorithm from discrete Morse theory with a strong mathematical foundation. While a formal proof is only hinted at, we do provide a thorough numerical evaluation of our method and compare it to established algorithms. }, } @ARTICLE{reininghaus12b, AUTHOR = {Reininghaus, Jan and Kasten, Jens and Weinkauf, Tino and Hotz, Ingrid}, JOURNAL = {IEEE Transactions on Visualization and Computer Graphics}, TITLE = {Efficient Computation of Combinatorial Feature Flow Fields}, ADDRESS = {Los Alamitos, CA}, NUMBER = {9}, PUBLISHER = {IEEE Computer Society}, MONTH = {September}, VOLUME = {18}, ISBN = {1077-2626}, DOI = {10.1109/TVCG.2011.269}, YEAR = {2012}, PAGES = {1563--1573}, ABSTRACT = {We propose a combinatorial algorithm to track critical points of 2D time-dependent scalar fields. Existing tracking algorithms such as Feature Flow Fields apply numerical schemes utilizing derivatives of the data, which makes them prone to noise and involve a large number of computational parameters. In contrast, our method is robust against noise since it does not require derivatives, interpolation, and numerical integration. Furthermore, we propose an importance measure that combines the spatial persistence of a critical point with its temporal evolution. This leads to a time-aware feature hierarchy, which allows us to discriminate important from spurious features. Our method requires only a single, easy-to-tune computational parameter and is naturally formulated in an out-of-core fashion, which enables the analysis of large data sets. We apply our method to synthetic data and data sets from computational fluid dynamics and compare it to the stabilized continuous Feature Flow Field tracking algorithm. }, } @INPROCEEDINGS{Reshetouski2011, AUTHOR = {Reshetouski, Ilya and Manakov, Alkhazur and Seidel, Hans-Peter and Ihrke, Ivo}, EDITOR = {Felzenszwalb, Pedro and Forsyth, David and Fua, Pascal}, TITLE = {Kaleidoscopic Imaging of Three-Dimensional Objects}, BOOKTITLE = {2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Colorado Springs, USA}, PUBLISHER = {IEEE}, ISBN = {978-1-4577-0394-2}, DOI = {10.1109/CVPR.2011.5995579}, YEAR = {2011}, PAGES = {353--360}, } @INPROCEEDINGS{Reuter2012, AUTHOR = {Reuter, Alexander and Seidel, Hans-Peter and Ihrke, Ivo}, TITLE = {BlurTags: Spatially Varying PSF Estimation with Out-of-Focus Patterns}, BOOKTITLE = {WSCG Communication Papers}, PADDRESS = {Plzen}, ADDRESS = {Plzen}, MONTH = {June}, YEAR = {2012}, PAGES = {239--248}, } @TECHREPORT{Rhaleb2004, AUTHOR = {Zayer, Rhaleb and R{\"o}ssl, Christian and Seidel, Hans-Peter}, TITLE = {r-Adaptive Parameterization of Surfaces}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, TYPE = {Research Report}, ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-2004-4-004}, PUBLISHER = {AG 4 - Seidel}, MONTH = {June}, ISBN = {0946-011X}, YEAR = {2004}, PAGES = {16}, ABSTRACT = {Surface mesh parameterization is a fundamental tool in computer graphics, required for applications like e.g. texture mapping, remeshing and morphing. Linear parameterization methods are of particular interest. Their simplicity, efficiency and robustness, enables the processing of detailed, large meshes. In practice, however, the current linear schemes are limited to producing (quasi-)conformal parameterizations and hence may suffer from considerable distortion e.g. in length and area. We present a novel approach to effectively reduce parametric distortion. Our algorithm is simple, efficient and robust, as it requires only the solution of a sparse linear system. We smoothly adapt an existing quasi-conformal parameterization with respect to different flow quantities such as areas, angles or edge lengths. Our adaptive strategy offers a flexible means for controlling distortion based on error equidistribution. We show how this method can be extended from the planar setting to spherical parameterizations, a problem which recently attracted a lot of interest.}, } @INPROCEEDINGS{Rhodin2013, AUTHOR = {Rhodin, Helge and Breu{\ss}, Michael}, EDITOR = {Kuijper, Arjan and Bredies, Kristian and Pock, Thomas and Bischof, Horst}, TITLE = {A Mathematically Justified Algorithm for Shape from Texture}, BOOKTITLE = {Fourth International Conference on Scale Space and Variational Methods in Computer Vision, 2013}, PADDRESS = {Berlin, Germany}, ADDRESS = {Schloss Seggau, Graz region, AustriaJune 2nd-6th 201}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {7893}, ISBN = {978-3-642-38266-3}, DOI = {10.1007/978-3-642-38267-3_25}, YEAR = {2013}, PAGES = {294--305}, ABSTRACT = {In this paper we propose a new continuous Shape from Texture (SfT) model for piecewise planar surfaces. It is based on the assumptions of texture homogeneity and perspective camera projection. We show that in this setting an unidirectional texture analysis suffices for performing SfT. With carefully chosen approximations and a separable representation, novel closed-form formulas for the surface orientation in terms of texture gradients are derived. On top of this model, we propose a SfT algorithm based on spatial derivatives of the dominant local spatial frequency in the source image. The method is motivated geometrically and it is justified rigorously by error estimates. The reliability of the algorithm is evaluated by synthetic and real world experiments.}, } @ARTICLE{Richardt2012, AUTHOR = {Richardt, Christian and Stoll, Carsten and Dodgson, Neil A. and Seidel, Hans-Peter and Theobalt, Christian}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, TITLE = {Coherent Spatiotemporal Filtering, Upsampling and Rendering of {RGBZ} Videos}, NUMBER = {2.1}, PUBLISHER = {John Wiley \& Sons, Inc.}, MONTH = {May}, VOLUME = {31}, ISBN = {0167-7055}, YEAR = {2012}, PAGES = {247--256}, ABSTRACT = {Sophisticated video processing effects require both image and geometry information. We explore the possibility to augment a video camera with a recent infrared time-of-flight depth camera, to capture high-resolution RGB and low-resolution, noisy depth at video frame rates. To turn such a setup into a practical RGBZ video camera, we develop efficient data filtering techniques that are tailored to the noise characteristics of IR depth cameras. We first remove typical artefacts in the RGBZ data and then apply an efficient spatiotemporal denoising and upsampling scheme. This allows us to record temporally coherent RGBZ videos at interactive frame rates and to use them to render a variety of effects in unprecedented quality. We show effects such as video relighting, geometry-based abstraction and stylisation, background segmentation and rendering in stereoscopic 3D.}, } @ARTICLE{Richardt2014, AUTHOR = {Richardt, Christian and Lopez-Moreno, Jorge and Bousseau, Adrien and Agrawala, Maneesh and Drettakis, George}, JOURNAL = {Computer Graphics Forum (Proceedings of EGSR 2014)}, TITLE = {Vectorising Bitmaps into Semi-Transparent Gradient Layers}, NUMBER = {4}, PUBLISHER = {John Wiley \& Sons Ltd.}, MONTH = {July}, VOLUME = {33}, ISBN = {1467-8659}, DOI = {10.1111/cgf.12408}, YEAR = {2014}, PAGES = {11--19}, ABSTRACT = {We present an interactive approach for decompositing bitmap drawings and studio photographs into opaque and semi-transparent vector layers. Semi-transparent layers are especially challenging to extract, since they require the inversion of the non-linear compositing equation. We make this problem tractable by exploiting the parametric nature of vector gradients, jointly separating and vectorising semi-transparent regions. Specifically, we constrain the foreground colours to vary according to linear or radial parametric gradients, restricting the number of unknowns and allowing our system to efficiently solve for an editable semi-transparent foreground. We propose a progressive workflow, where the user successively selects a semi-transparent or opaque region in the bitmap, which our algorithm separates as a foreground vector gradient and a background bitmap layer. The user can choose to decompose the background further or vectorise it as an opaque layer. The resulting layered vector representation allows a variety of edits, such as modifying the shape of highlights, adding texture to an object or changing its diffuse colour.}, } @INPROCEEDINGS{Richter2012, AUTHOR = {Richter, Michal and Varanasi, Kiran and Hasler, Nils and Theobalt, Christian}, TITLE = {Real-time Reshaping of Humans}, BOOKTITLE = {Proceedings of the 3rd Joint Conference on 3D imaging, data processing, visualization and transmission (3DIMPVT)}, PADDRESS = {2001 L Street N.W., Suite 700 Washington, USA 20036-4928}, ADDRESS = {Zurich, Switzerland}, PUBLISHER = {IEEE Conference Publishing Services (CPS)}, YEAR = {2012}, PAGES = {340--347}, } @INPROCEEDINGS{Rigau_sccg2001, AUTHOR = {Rigau, Jaume and Feixas, Miquel and Bekaert, Philippe and Sbert, Mateu}, EDITOR = {Kunii, Tosiyasu L.}, TITLE = {View-Dependent Information Theory Measures for Pixel Sampling and Scene Discretization in Flatland}, BOOKTITLE = {Proceedings of the Spring Conference on Computer Graphics}, PADDRESS = {Bratislava, Slovak Republic}, ADDRESS = {Budmerice, Slovak Republic}, PUBLISHER = {Comenius University}, MONTH = {May}, YEAR = {2001}, PAGES = {231--238}, } @ARTICLE{rigort2012, AUTHOR = {Rigort, Alexander and G{\"u}nther, David and Hegerl, Reiner and Baum, Daniel and Weber, Britta and Prohaska, Steffen and Medalia, Ohad and Baumeister, Wolfgang and Hege, Hans-Christian}, JOURNAL = {Journal of Structural Biology}, TITLE = {Automated segmentation of electron tomograms for a quantitative description of actin filaments networks}, NUMBER = {1}, PUBLISHER = {Elsevier}, MONTH = {January}, VOLUME = {177}, ISBN = {1047-8477}, DOI = {10.1016/j.jsb.2011.08.012}, YEAR = {2012}, PAGES = {135--144}, } @ARTICLE{Ritschel08Sig, AUTHOR = {Ritschel, Tobias and Smith, Kaleigh and Ihrke, Matthias and Grosch, Thorsten and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Turk, Greg}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {3D Unsharp Masking for Scene Coherent Enhancement}, BOOKTITLE = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH)}, ADDRESS = {New York, USA}, NUMBER = {3}, PUBLISHER = {ACM}, VOLUME = {27(3)}, YEAR = {2008}, PAGES = {1--8}, } @INPROCEEDINGS{Ritschel2007CSSM, AUTHOR = {Ritschel, Tobias and Grosch, Thorsten and Kautz, Jan and Seidel, Hans-Peter}, EDITOR = {Shaw, Chris and Bartram, Lyn}, TITLE = {Interactive Global Illumination Based on Coherent Surface Shadow Maps}, BOOKTITLE = {Proceedings Graphics Interface, May 2008}, PADDRESS = {New York}, ADDRESS = {Windsor, Ontario, Canada}, PUBLISHER = {ACM}, MONTH = {May}, SERIES = {ACM International Conference Proceeding Series}, ISBN = {978-1-56881-423-0}, YEAR = {2008}, PAGES = {185--192}, } @INPROCEEDINGS{Ritschel2007ISM, AUTHOR = {Ritschel, Tobias and Grosch, Thorsten and Kim, Min H. and Seidel, Hans-Peter and Dachsbacher, Carsten and Kautz, Jan}, TITLE = {Imperfect Shadow Maps for Efficient Computation of Indirect Illumination}, BOOKTITLE = {Proceedings of ACM SIGGRAPH Asia 2008}, PADDRESS = {New York}, ADDRESS = {Singapore}, PUBLISHER = {ACM}, YEAR = {2008}, } @ARTICLE{Ritschel2009EG, AUTHOR = {Ritschel, Tobias and Ihrke, Matthias and Frisvad, Jeppe Revall and Coppens, Joris and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Dutr{\'e}, Philip and Stamminger, Marc}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS 2009)}, TITLE = {Temporal Glare: {Real-time} Dynamic Simulation of the Scattering in the Human Eye}, BOOKTITLE = {The European Association for Computer Graphics 30th Annual Conference : EUROGRAPHICS 2009}, ADDRESS = {Oxford}, NUMBER = {2}, PUBLISHER = {Blackwell}, MONTH = {March}, SERIES = {Computers Graphics Forum}, VOLUME = {28}, YEAR = {2009}, PAGES = {183--192}, ABSTRACT = {Glare is a consequence of light scattered within the human eye when looking at bright light sources. This effect can be exploited for tone mapping since adding glare to the depiction of high-dynamic range (HDR) imagery on a low-dynamic range (LDR) medium can dramatically increase perceived contrast. Even though most, if not all, subjects report perceiving glare as a bright pattern that fluctuates in time, up to now it has only been modeled as a static phenomenon. We argue that the temporal properties of glare are a strong means to increase perceived brightness and to produce realistic and attractive renderings of bright light sources. Based on the anatomy of the human eye, we propose a model that enables real-time simulation of dynamic glare on a GPU. This allows an improved depiction of HDR images on LDR media for interactive applications like games, feature films, or even by adding movement to initially static HDR images. By conducting psychophysical studies, we validate that our method improves perceived brightness and that dynamic glare-renderings are often perceived as more attractive depending on the chosen scene.}, } @PHDTHESIS{Ritschel2009Thesis, AUTHOR = {Ritschel, Tobias}, TITLE = {Perceptually-motivated, Interactive Rendering and Editing of Global Illumination}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {December}, YEAR = {2009}, ABSTRACT = {This thesis proposes several new perceptually-motivated techniques to synthesize, edit and enhance depiction of three-dimensional virtual scenes. Finding algorithms that fit the perceptually economic middle ground between artistic depiction and full physical simulation is the challenge taken in this work. First, we will present three interactive global illumination rendering approaches that are inspired by perception to efficiently depict important light transport. Those methods have in common to compute global illumination in large and fully dynamic scenes allowing for light, geometry, and material changes at interactive or real-time rates. Further, this thesis proposes a tool to edit reflections, that allows to bend physical laws to match artistic goals by exploiting perception. Finally, this work contributes a post-processing operator that depicts high contrast scenes in the same way as artists do, by simulating it ``seen'' through a dynamic virtual human eye in real-time.}, } @ARTICLE{Ritschel2010SigDeform, AUTHOR = {Ritschel, Tobias and Thorm{\"a}hlen, Thorsten and Dachsbacher, Carsten and Kautz, Jan and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Interactive On-Surface Signal Deformation}, ADDRESS = {New York, NY}, NUMBER = {4}, PUBLISHER = {ACM}, MONTH = {July}, VOLUME = {29}, ISBN = {0730-0301}, DOI = {10.1145/1778765.1778773}, YEAR = {2010}, PAGES = {36,1--36,8}, } @ARTICLE{Ritschel2011ISM2, AUTHOR = {Ritschel, Tobias and Eisemann, Elmar and Ha, Inwoo and Kim, James D. K. and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum (Proc. Eurographics Symposium on Rendering)}, TITLE = {Making imperfect shadow maps view-adaptive: {High-quality} global illumination in large dynamic scenes}, ADDRESS = {Oxford, UK}, NUMBER = {8}, PUBLISHER = {Blackwell}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {30}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2011.01998.x}, YEAR = {2011}, PAGES = {2258--2269}, } @ARTICLE{Ritschel2012Afterimages, AUTHOR = {Ritschel, Tobias and Eisemann, Elmar}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS 2012)}, TITLE = {A Computational Model of Afterimages}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell}, MONTH = {May}, VOLUME = {31}, YEAR = {2012}, PAGES = {529--534}, } @ARTICLE{Ritschel2012STAR, AUTHOR = {Ritschel, Tobias and Dachsbacher, Carsten and Grosch, Thorsten and Kautz, Jan}, JOURNAL = {Computer Graphics Forum}, TITLE = {State of the Art in Interactive Global Illumination}, ADDRESS = {Oxford}, NUMBER = {1}, PUBLISHER = {Blackwel}, VOLUME = {31}, YEAR = {2012}, PAGES = {160--188}, } @ARTICLE{RitschelEGSKD2009:MicroRendering, AUTHOR = {Ritschel, Tobias and Engelhardt, Thomas and Grosch, Thorsten and Seidel, Hans-Peter and Kautz, Jan and Dachsbacher, Carsten}, JOURNAL = {ACM Transactions on Graphics (Proc. of SIGGRAPH ASIA 2009)}, TITLE = {Micro-Rendering for Scalable, Parallel Final Gathering}, BOOKTITLE = {Proceedings of ACM SIGGRAPH Asia 2009}, ADDRESS = {New York, NY}, NUMBER = {5}, PUBLISHER = {ACM}, SERIES = {ACM Transactions on Graphics}, VOLUME = {28}, DOI = {10.1145/1661412.1618478}, YEAR = {2009}, PAGES = {132,1--132,8}, ABSTRACT = {Recent approaches to global illumination for dynamic scenes achieve interactive frame rates by using coarse approximations to geometry, lighting, or both, which limits scene complexity and rendering quality. High-quality global illumination renderings of complex scenes are still limited to methods based on ray tracing. While conceptually simple, these techniques are computationally expensive. We present an efficient and scalable method to compute global illumination solutions at interactive rates for complex and dynamic scenes. Our method is based on parallel final gathering running entirely on the GPU. At each final gathering location we perform micro-rendering: we traverse and rasterize a hierarchical point-based scene representation into an importance-warped micro-buffer, which allows for BRDF importance sampling. The final reflected radiance is computed at each gathering location using the micro-buffers and is then stored in image-space. We can trade quality for speed by reducing the sampling rate of the gathering locations in conjunction with bilateral upsampling. We demonstrate the applicability of our method to interactive global illumination, the simulation of multiple indirect bounces, and to final gathering from photon maps. }, } @INPROCEEDINGS{RitschelGS2009:SSDO, AUTHOR = {Ritschel, Tobias and Grosch, Thorsten and Seidel, Hans-Peter}, EDITOR = {Haines, Eric and McGuire, Morgan and Spencer, Stephen N.}, TITLE = {Approximating Dynamic Global Illumination in Image Space}, BOOKTITLE = {ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games : proceedings I3D 2009}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, NY}, ADDRESS = {Boston, MA, USA}, PUBLISHER = {ACM}, MONTH = {February}, ISBN = {978-1-60558-429-4}, DOI = {10.1145/1507149.1507161}, YEAR = {2009}, PAGES = {75--82}, ABSTRACT = {Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficient implementations are used extensively in production. Recent methods approximate AO between nearby geometry in screen space (SSAO). The key observation described in this paper is, that screen-space occlusion methods can be used to compute many more types of effects than just occlusion, such as directional shadows and indirect color bleeding. The proposed generalization has only a small overhead compared to classic SSAO, approximates direct and one-bounce light transport in screen space, can be combined with other methods that simulate transport for macro structures and is visually equivalent to SSAO in the worst case without introducing new artifacts. Since our method works in screen space, it does not depend on the geometric complexity. Plausible directional occlusion and indirect lighting effects can be displayed for large and fully dynamic scenes at real-time frame rates.}, } @ARTICLE{RitschelSigAsia2009, AUTHOR = {Ritschel, Tobias and Okabe, Makoto and Thorm{\"a}hlen, Thorsten and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics (Proc. of SIGGRAPH Asia 2009)}, TITLE = {Interactive Reflection Editing}, BOOKTITLE = {Proceedings of ACM SIGGRAPH Asia 2009}, ADDRESS = {New York, NY}, NUMBER = {5}, PUBLISHER = {ACM}, MONTH = {December}, SERIES = {ACM Transactions on Computer Graphics}, VOLUME = {28}, DOI = {10.1145/1661412.1618475}, YEAR = {2009}, PAGES = {129,1--129,7}, } @INPROCEEDINGS{RitschelTMS2012, AUTHOR = {Ritschel, Tobias and Templin, Krzysztof and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Asente, Paul and Grimm, Cindy}, TITLE = {Virtual Passepartouts}, BOOKTITLE = {Non-Photorealistic Animation and Rendering (NPAR)}, ORGANIZATION = {Eurographics Association}, PADDRESS = {Goslar, Germany}, ADDRESS = {Annecy, France}, PUBLISHER = {Eurographics Association}, ISBN = {978-3-905673-90-6}, DOI = {10.2312/PE/NPAR/NPAR12/057-063}, YEAR = {2012}, PAGES = {57--63}, ABSTRACT = {In traditional media, such as photography and painting, a cardboard sheet with a cutout (called \emph{passepartout}) is frequently placed on top of an image. One of its functions is to increase the depth impression via the ``looking-through-a-window'' metaphor. This paper shows how an improved 3D~effect can be achieved by using a \emph{virtual passepartout}: a 2D framing that selectively masks the 3D shape and leads to additional occlusion events between the virtual world and the frame. We introduce a pipeline to design virtual passepartouts interactively as a simple post-process on RGB images augmented with depth information. Additionally, an automated approach finds the optimal virtual passepartout for a given scene. Virtual passepartouts can be used to enhance depth depiction in images and videos with depth information, renderings, stereo images and the fabrication of physical passepartouts.}, } @INPROCEEDINGS{Robertini2013, AUTHOR = {Robertini, Nadia and Neumann, Thomas and Varanasi, Kiran and Theobalt, Christian}, TITLE = {Capture of Arm-Muscle Deformations using a Depth-Camera}, BOOKTITLE = {10th European Conference on Visual Media Production}, PADDRESS = {New York, USA}, ADDRESS = {London, England}, PUBLISHER = {ACM}, YEAR = {2013}, } @INPROCEEDINGS{Roessl1999_AVDCT, AUTHOR = {R{\"o}ssl, Christian and Kobbelt, Leif}, EDITOR = {Girod, Bernd and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {Approximation and Visualization of Discrete Curvature on Triangulated Surfaces}, BOOKTITLE = {Proceedings of the 4th Conference on Vision, Modeling, and Visualization (VMV-99)}, ORGANIZATION = {SFB 603, Graduate Research Center, in cooperation with IEEE Signal Processing Society and Gesellschaft f{\"u}r Informatik}, PADDRESS = {Sankt Augustin, Germany}, ADDRESS = {Erlangen, Germany}, PUBLISHER = {infix}, ISBN = {3-89601-015-8}, YEAR = {1999}, PAGES = {339--346}, ABSTRACT = {Triangle meshes are a facile and effective representation for many kinds of surfaces. In order to rate the quality of a surface, the calculation of geometric curvatures as there are defined for smooth surfaces is useful and necessary for a variety of applications. We investigate an approach to locally approximate the first and second fundamental forms at every (inner) vertex of a triangle mesh. We use locally isometric divided difference operators, where we compare two variants of parameterizations (tangent plane and exponential map) by testing on elementary analytic surfaces. We further describe a technique for visualizing the resulting curvature data. A simple median filter is used to effectively filter noise from the input data. According to application dependent requirements a global or a per-vertex local color coding can be provided. The user may interactively modify the color transfer function, enabling him or her to visually evaluate the quality of triangulated surfaces.}, } @MASTERSTHESIS{Roessl1999_DA, AUTHOR = {R{\"o}ssl, Christian}, TITLE = {{Semi-Automatische Methoden f{\"u}r die Rekonstruktion von CAD-Modellen aus Punktdaten}}, SCHOOL = {Friedrich-Alexander-Universit{\"a}t Erlangen-N{\"u}rnberg}, TYPE = {Master's thesis}, MONTH = {August}, YEAR = {1999}, } @INPROCEEDINGS{Roessl1999_EFLTS, AUTHOR = {R{\"o}ssl, Christian and Kobbelt, Leif and Seidel, Hans-Peter}, EDITOR = {Butz, Andreas and Kr{\"u}ger, Antonio and Olivier, Patrick}, TITLE = {Extraction of feature lines on triangulated surfaces using morphological operators}, BOOKTITLE = {Smart Graphics (AAAI Spring Symposium-00)}, ORGANIZATION = {American Association for Artificial Intelligence}, TYPE = {Technical Report SS-00-04, Stanford University}, PADDRESS = {Menlo Park, USA}, ADDRESS = {Stanford, USA}, PUBLISHER = {AAAI Press}, SERIES = {Technical Report / SS / American Association for Artificial Intelligence}, VOLUME = {00-04}, ISBN = {1-57735-110-X}, YEAR = {2000}, PAGES = {71--75}, ABSTRACT = {Triangle meshes are a popular representation of surfaces in computer graphics. Our aim is to detect feature on such surfaces. Feature regions distinguish themselves by high curvature. We are using discrete curvature analysis on triangle meshes to obtain curvature values in every vertex of a mesh. These values are then thresholded resulting in a so called binary feature vector. By adapting morphological operators to triangle meshes, noise and artifacts can be removed from the feature. We introduce an operator that determines the skeleton of the feature region. This skeleton can then be converted into a graph representing the desired feature. Therefore a description of the surface's geometrical characteristics is constructed.}, } @INPROCEEDINGS{Roessl1999_LARTS, AUTHOR = {R{\"o}ssl, Christian and Kobbelt, Leif and Seidel, Hans-Peter}, EDITOR = {Skala, Vaclav}, TITLE = {Line Art Rendering of Triangulated Surfaces using Discrete Lines of Curvature}, BOOKTITLE = {Proceedings of the 8th International Conference in Central Europe on Computer Graphics, Visualization and Interactive Digital Media (WSCG-00)}, ORGANIZATION = {EUROGRAPHICS and IFIP WG 5.10}, PADDRESS = {Plzen, Czech Republic}, ADDRESS = {Plzen, Czech Republic}, PUBLISHER = {University of West Bohemia}, ISBN = {80-7082-612-6}, YEAR = {2000}, PAGES = {168--175}, ABSTRACT = {In recent years, several techniques have been proposed for automatically producing line-art illustrations. In this paper a new non photo-realistic rendering scheme for triangulated surfaces is presented. In contrast to prior approaches with parametric surfaces, there is no global parameterization for triangle meshes. So a new approach is made to automatically generate a direction field for the strokes. Discrete curvature analysis on such meshes allows to estimate differential parameters. Lines of curvature are then constructed to be used as strokes. Using triangulated surfaces allows to render aesthetically pleasing line drawings from a huge class of models. Besides, experiments show that even real time visualization is possible.}, } @INPROCEEDINGS{Roessl2000:LAR, AUTHOR = {R{\"o}ssl, Christian and Kobbelt, Leif}, EDITOR = {Barsky, Brian A. and Shinagawa, Yoshihisa and Wang, Wenping}, TITLE = {Line-Art Rendering of {3D}-Models}, BOOKTITLE = {Proceedings of the 8th Pacific Conference on Computer Graphics and Applications (PG-00)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Hong Kong, China}, PUBLISHER = {IEEE}, ISBN = {0-7695-0868-5}, YEAR = {2000}, PAGES = {87--96}, ABSTRACT = {We present an interactive system for computer aided generation of line art drawings to illustrate 3D models that are given as triangulated surfaces. In a preprocessing step an enhanced 2D view of the scene is computed by sampling for every pixel the shading, the normal vectors and the principal directions obtained from discrete curvature analysis. Then streamlines are traced in the 2D direction fields and are used to define line strokes. In order to reduce noise artifacts the user may interactively select sparse reference lines and the system will automatically fill in additional strokes. By exploiting the special structure of the streamlines an intuitive and simple tone mapping algorithm can be derived to generate the final rendering.}, } @INPROCEEDINGS{Roessl2000_RSITS, AUTHOR = {R{\"o}ssl, Christian and Kobbelt, Leif and Seidel, Hans-Peter}, EDITOR = {Lyche, Tom and Schumaker, Larry L.}, TITLE = {Recovering Structural Information from Triangulated Surfaces}, BOOKTITLE = {Mathematical Methods for Curves and Surfaces: Oslo 2000}, PADDRESS = {Nashville, USA}, ADDRESS = {Oslo, Norway}, PUBLISHER = {Vanderbilt University}, ISBN = {0-8265-1378-6}, YEAR = {2001}, PAGES = {423--432}, ABSTRACT = {We present a technique for recovering structural information from triangular meshes that can then be used for segmentation, e.g. in reverse engineering applications. In a preprocessing step, we detect feature regions on the surface by classifying the vertices according to some discrete curvature measure. Then we apply a skeletonization algorithm for extracting feature lines from these regions. To achieve this, we generalize the concept of morphological operators to unorganized triangle meshes, providing techniques for noise reduction on the binary feature classification and for skeletonization. The necessary operations are easy to implement, robust, and can be executed efficiently on a mesh data structure.}, } @TECHREPORT{RoesslIvrissimtzisSeidel2003, AUTHOR = {R{\"o}ssl, Christian and Ivrissimtzis, Ioannis and Seidel, Hans-Peter}, TITLE = {Tree-based triangle mesh connectivity encoding}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Saarbr{\"u}cken}, NUMBER = {MPI-I-2003-4-008}, MONTH = {April}, YEAR = {2003}, PAGES = {25}, } @INPROCEEDINGS{RoesslZeilfelderNuernbergerSeidel2003, AUTHOR = {R{\"o}ssl, Christian and Zeilfelder, Frank and N{\"u}rnberger, G{\"u}nther and Seidel, Hans-Peter}, EDITOR = {Turk, Greg and van Wijk, Jarke and Moorhead, Robert}, TITLE = {Visualization of Volume Data with Quadratic Super Splines}, BOOKTITLE = {IEEE Visualization 2003 (VIS-03)}, ORGANIZATION = {IEEE Computer Society}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Seattle, USA}, PUBLISHER = {IEEE}, MONTH = {October}, YEAR = {2003}, PAGES = {393--400}, ABSTRACT = { We develop a new approach to reconstruct non-discrete models from gridded volume samples. As a model, we use quadratic trivariate super splines on a uniform tetrahedral partition . The approximating splines are determined in a natural and completely symmetric way by averaging local data samples, such that appropriate smoothness conditions are automatically satisfied. On each tetrahedron of , the quasi-interpolating spline is a polynomial of total degree two which provides several advantages including efficient computation, evaluation and visualization of the model. We apply Bernstein-B´ezier techniques well-known in CAGD to compute and evaluate the trivariate spline and its gradient. With this approach the volume data can be visualized efficiently e.g. with isosurface raycasting. Along an arbitrary ray the splines are univariate, piecewise quadratics and thus the exact intersection for a prescribed isovalue can be easily determined in an analytic and exact way. Our results confirm the efficiency of the quasi-interpolating method and demonstrate high visual quality for rendered isosurfaces.}, } @TECHREPORT{RoesslZeilfelderNuernbergerSeidel2003a, AUTHOR = {R{\"o}ssl, Christian and Zeilfelder, Frank and N{\"u}rnberger, G{\"u}nther and Seidel, Hans-Peter}, TITLE = {Visualization of Volume Data with Quadratic Super Splines}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Saarbr{\"u}cken}, NUMBER = {MPI-I-2003-4-006}, MONTH = {April}, YEAR = {2003}, PAGES = {15}, } @PHDTHESIS{Roessl:2005:thesis, AUTHOR = {R{\"o}ssl, Christian}, TITLE = {New Techniques for the Modeling, Processing and Visualization of Surfaces and Volumes}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {July}, YEAR = {2005}, } @INPROCEEDINGS{Roessl:TBTMCE:2002, AUTHOR = {R{\"o}ssl, Christian and Ivrissimtzis, Ioannis and Seidel, Hans-Peter}, EDITOR = {Cohen, Albert and Merrien, Jean-Louis and Schumaker, Larry L.}, TITLE = {Tree-based Triangle Mesh Connectivity Encoding}, BOOKTITLE = {Curve and Surface Fitting: Saint-Malo 2002}, PADDRESS = {Brentwood, USA}, ADDRESS = {Saint Malo, France}, PUBLISHER = {Nashboro Press}, ISBN = {0-9728482-1-5}, YEAR = {2003}, PAGES = {345--354}, ABSTRACT = {We present a divide and conquer algorithm for triangle mesh connectivity encoding. As the algorithm traverses the mesh it constructs a weighted binary tree that holds all information required for reconstruction. This representation can be used for compression.We derive a new iterative single-pass decoding algorithm, and we show how to exploit the tree data structure for generating stripifications for efficient rendering that come with a guaranteed cost saving.}, } @INPROCEEDINGS{Roman:2006:MPI, AUTHOR = {Rom{\'a}n, Augusto and Lensch, Hendrik P. A.}, EDITOR = {Akenine-M{\"o}ller, Thomas and Heidrich, Wolfgang}, TITLE = {Automatic Multiperspective Images}, BOOKTITLE = {Rendering Techniques 2006: Eurographics Symposium on Rendering}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Nicosia, Cyprus}, PUBLISHER = {Eurographics Association}, MONTH = {June}, ISBN = {3-905673-35-5}, YEAR = {2006}, PAGES = {161--171}, } @INCOLLECTION{RomBlaBasVet04, AUTHOR = {Romdhani, Sami and Blanz, Volker and Basso, Curzio and Vetter, Thomas}, EDITOR = {Li, Stan Z. and Jain, Anil K.}, TITLE = {Morphable Models of Faces}, BOOKTITLE = {Handbook of Face Recognition}, CHAPTER = {10}, ADDRESS = {New York, USA}, PUBLISHER = {Springer}, ISBN = {0-387-40595-X}, YEAR = {2005}, PAGES = {217--245}, } @ARTICLE{RosenhahnAlgorithmika2004, AUTHOR = {Rosenhahn, Bodo and Perwass, Christian and Sommer Gerald}, JOURNAL = {Algorithmica}, TITLE = {Free-form pose estimation by using twist representations}, ADDRESS = {New York}, PUBLISHER = {Springer}, VOLUME = {38}, ISBN = {00453-003-1044-3}, YEAR = {2004}, PAGES = {91--113}, } @INPROCEEDINGS{RosenhahnAMDO2008, AUTHOR = {Schmaltz, Christian and Rosenhahn, Bodo and Brox, Thomas and Weickert, Joachim and Wietzke, Lennart and Sommer, Gerald}, EDITOR = {L\'opez, Francisco J.P. and Fisher, Robert B.}, TITLE = {Dealing with self-occlusion in region based motion capture by means of internal regions}, BOOKTITLE = {Proceedings of the 5th International Conference on Articulated Motion and Deformable Objects (AMDO 2008)}, PADDRESS = {Heidelberg, Germany}, ADDRESS = {Port d'Andratx, Mallorca, Spain}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5098}, ISBN = {978-3-540-70516-1}, YEAR = {2008}, PAGES = {102--111}, } @INPROCEEDINGS{RosenhahnCAIP2005, AUTHOR = {Rosenhahn, Bodo and He, Lei and Klette, Reinhard}, EDITOR = {Gagalowicz, Andre and Philips, Wilfried}, TITLE = {Automatic human model generation}, BOOKTITLE = {Computer analysis of images and patterns : 11th International Conference, CAIP 2005, Versailles, France, September 5-8, 2005 Computer Analysis of Images and Patterns 11th Int. Conference}, TYPE = {Full paper}, PADDRESS = {Berlin, Germany}, ADDRESS = {Versailles, France}, PUBLISHER = {Springer}, MONTH = {September}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3691}, ISBN = {3-540-28969-0}, YEAR = {2005}, PAGES = {41--48}, ABSTRACT = {The contribution presents an integrated system for automatic acquisition of a human torso model, using different input images. The output model consists of two free-form surface patches (with texture maps) for the torso and the arms. Also, the positions for the neck joint on the torso, and six joint positions on the arms (for the wrist, elbow and shoulder) are determined automatically. We present reconstruction results, and, as application, a simple tracking system for arm movements. }, } @INPROCEEDINGS{RosenhahnCGIV2005, AUTHOR = {Rosenhahn, Bodo and Ho, Harvey and Klette, Reinhard}, EDITOR = {Sarfraz, M and Wand, Y and Banissi, E}, TITLE = {Texture driven pose estimation}, BOOKTITLE = {Computer Graphics, Imaging and Visualization : New Trends (CGIV 05)}, ORGANIZATION = {IEEE Computer Society}, TYPE = {Full paper}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Beijing, China}, PUBLISHER = {IEEE}, ISBN = {0-7695-2392-7}, YEAR = {2005}, PAGES = {271--277}, ABSTRACT = {This article presents a 2D-3D pose estimation algorithm which relies on texture information on the surface mesh of an object model. The textured surface mesh is rendered in a virtual image and a modified block matching algorithm is applied to determine correspondences between midpoints of surface patches to points in an image. This is used in a point-based 2D-3D pose estimation algorithm to determine the pose and orientation of a 3D object with respect to given image data. We present experiments on various image sequences and show advantages of the chosen approach (e.g., in the context of varying backgrounds, noise or partial occlusions).}, } @INPROCEEDINGS{RosenhahnCVPR2007, AUTHOR = {Rosenhahn, Bodo and Brox, Thomas and Seidel, Hans-Peter}, TITLE = {Scaled Motion Dynamics for Markerless Motion Capture}, BOOKTITLE = {2007 IEEE Conference on Computer Vision and Pattern Recognition, CVPR'07. - Vol. 3}, PADDRESS = {Piscataway, NJ, USA}, ADDRESS = {Minneapolis, Minnesota}, PUBLISHER = {IEEE}, ISBN = {1-4244-1180-7}, DOI = {10.1109/CVPR.2007.383128}, YEAR = {2007}, PAGES = {1203--1210}, } @INPROCEEDINGS{RosenhahnCVPR2008, AUTHOR = {Rosenhahn, Bodo and Schmaltz, Christian and Brox, Thomas and Weickert, Joachim and Cremers, Daniel and Seidel, Hans-Peter}, TITLE = {Markerless motion capture of man-machine interaction}, BOOKTITLE = {IEEE Conference on Computer Vision and Pattern Recognition}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Anchorage, AK, USA}, YEAR = {2008}, PAGES = {1--8}, } @INPROCEEDINGS{RosenhahnDAGM2005a, AUTHOR = {Rosenhahn, Bodo and Kersting, Uwe and Smith, Andrew and Gurney, Jason and Brox, Thomas and Klette, Reinhard}, EDITOR = {Kropatsch, Walter and Sablatnig, Robert and Hanbury, Allan}, TITLE = {A system for marker-less human motion estimation}, BOOKTITLE = {Pattern recognition : 27th DAGM Symposium}, TYPE = {Full paper}, PADDRESS = {Berlin, Germany}, ADDRESS = {Vienna, Austria}, PUBLISHER = {Springer}, MONTH = {September}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3663}, ISBN = {3-540-28703-5}, YEAR = {2005}, PAGES = {230--237}, ABSTRACT = {In this contribution we present a silhouette based human motion estimation system. The system components contain silhouette extraction based on level sets, a correspondence module, which relates image data to model data and a pose estimation module. Experiments are done in a four camera setup and we estimate the model components with 21 degrees of freedom in two frames per second. Finally, we perform a comparison of the motion estimation system with a marker based tracking system to perform a quantitative error analysis. The results show the applicability of the system for marker-less sports movement analysis.}, } @INPROCEEDINGS{RosenhahnDAGM2005b, AUTHOR = {Rosenhahn, Bodo and Brox, Thomas and Weickert, Joachim}, EDITOR = {Kropatsch, Walter and Sablatnig, Robert and Hanbury, Allan}, TITLE = {Three-Dimensional Shape Knowledge for Joint Image Segmentation and Pose Estimation}, BOOKTITLE = {Pattern recognition : 27th DAGM Symposium}, TYPE = {Full paper}, PADDRESS = {Berlin, Germany}, ADDRESS = {Vienna, Austria}, PUBLISHER = {Springer}, MONTH = {September}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3663}, ISBN = {3-540-28703-5}, YEAR = {2005}, PAGES = {109--116}, ABSTRACT = {This paper presents the integration of 3D shape knowledge into a variational model for level set based image segmentation and tracking. Having a 3D surface model of an object that is visible in the image of a calibrated camera, the object contour stemming from the segmentation is applied to estimate the 3D pose parameters, whereas the object model projected to the image plane helps in a top-down manner to improve the extraction of the contour and the region statistics. The present approach clearly states all model assumptions in a single energy functional. This keeps the model manageable and allows further extensions for the future. While common alternative segmentation approaches that integrate 2D shape knowledge face the problem that an object can look very different from various viewpoints, a 3D free form model ensures that for each view the model can perfectly fit the data in the image. Moreover, one solves the higher level problem of determining the object pose including its distance to the camera. Experiments demonstrate the performance of the method.}, } @INPROCEEDINGS{RosenhahnDAGM2006a, AUTHOR = {Rosenhahn, Bodo and Kersting, Uwe and Powell, Katie and Seidel, Hans-Peter}, EDITOR = {Franke, Katrin and M{\"u}ller, Klaus-Robert and Nickolay, Bertram and Sch{\"a}fer, Ralf}, TITLE = {Cloth X-Ray: {MoCap} of People Wearing Textiles}, BOOKTITLE = {Pattern Recognition : 28th DAGM Symposium}, PADDRESS = {Berlin, Germany}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Springer}, MONTH = {September}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4174}, ISBN = {978-3-540-44412-1}, YEAR = {2006}, PAGES = {495--504}, ABSTRACT = {The contribution presents an approach for motion capturing (MoCap) of dressed people. A cloth draping method is embedded in a silhouette based MoCap system and an error functional is formalized to minimize image errors with respect to silhouettes, pose and kinematic chain parameters, the cloth draping components and external wind forces. We report on various experiments with two types of clothes, namely a skirt and a pair of shorts. Finally we compare the angles of the MoCap system with results from a commercially available marker based tracking system. The experiments show, that we are basically within the error range of marker based tracking systems, though body parts are occluded with cloth.}, } @INPROCEEDINGS{RosenhahnDAGM2006B, AUTHOR = {Brox, Thomas and Rosenhahn, Bodo and Kersting, Uwe and Cremers, Daniel}, EDITOR = {Franke, Katrin and M{\"u}ller, Klaus-Robert and Nickolay, Bertram and Sch{\"a}fer, Ralf}, TITLE = {Nonparametric Density Estimation for Human Pose Tracking}, BOOKTITLE = {Pattern Recognition : 28th DAGM Symposium}, PADDRESS = {Berlin, Germany}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4174}, ISBN = {978-3-540-44412-1}, YEAR = {2006}, PAGES = {546--555}, ABSTRACT = {The present paper considers the supplement of prior knowledge about joint angle configurations in the scope of 3-D human pose tracking. Training samples obtained from an industrial marker based tracking system are used for a nonparametric Parzen density estimation in the 12-dimensional joint configuration space. These learned probability densities constrain the image-driven joint angle estimates by drawing solutions towards familiar configurations. This prevents the method from producing unrealistic pose estimates due to unreliable image cues. Experiments on sequences with a human leg model reveal a considerably increased robustness, particularly in the presence of disturbed images and occlusions. We gratefully acknowledge funding by the DFG project CR250/1 and the Max-Planck Center for visual computing and communication.}, } @INPROCEEDINGS{RosenhahnDAGM2007, AUTHOR = {Rosenhahn, Bodo and Brox, Thomas and Cremers, Daniel and Seidel, Hans-Peter}, EDITOR = {Hamprecht, Fred and Schn{\"o}rr, Christoph and Jaehne, Bernd}, TITLE = {Online Smoothing for Markerless Motion Capture}, BOOKTITLE = {Pattern Recognition}, PADDRESS = {Heidelberg}, ADDRESS = {Heidelberg, Germany}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4713}, ISBN = {3540749330}, YEAR = {2007}, PAGES = {163--172}, } @INPROCEEDINGS{RosenhahnDAGM2008, AUTHOR = {Rosenhahn, Bodo and Schmaltz, Christian and Brox, Thomas and Weickert, Joachim and Seidel, Hans-Peter}, EDITOR = {Rigoll, Gerhard}, TITLE = {Staying well grounded in markerless motion capture}, BOOKTITLE = {Proceedings of the 30th DAGM Symposium}, PADDRESS = {Heidelberg}, ADDRESS = {M{\"u}nchen, Germany}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5096}, ISBN = {978-3-540-69320-8}, YEAR = {2008}, PAGES = {385--395}, } @INPROCEEDINGS{RosenhahnECCV2006, AUTHOR = {Brox, Thomas and Rosenhahn, Bodo and Cremers, Daniel and Seidel, Hans-Peter}, EDITOR = {Leonarids, Ales and Bishof, Horst and Prinz, Axel}, TITLE = {High Accuracy Optical Flow Serves {3-D} Pose Tracking: Exploiting Contour and Flow Based Constraints}, BOOKTITLE = {Computer vision - ECCV 2006 : 9th European Conference on Computer Vision; Part II}, PADDRESS = {Berlin, Germany}, ADDRESS = {Graz, Austria}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {3952}, ISBN = {978-3-540-33834-5}, YEAR = {2006}, PAGES = {98--111}, ABSTRACT = {Tracking the 3-D pose of an object needs correspondences between 2-D features in the image and their 3-D counterparts in the object model. A large variety of such features has been suggested in the literature. All of them have drawbacks in one situation or the other since their extraction in the image and/or the matching is prone to errors. In this paper, we propose to use two complementary types of features for pose tracking, such that one type makes up for the shortcomings of the other. Aside from the object contour, which is matched to a free-form object surface, we suggest to employ the optic flow in order to compute additional point correspondences. Optic flow estimation is a mature research field with sophisticated algorithms available. Using here a high quality method ensures a reliable matching. In our experiments we demonstrate the performance of our method and in particular the improvements due to the optic flow. We gratefully acknowledge funding by the German Research Foundation (DFG) and the Max Planck Center for Visual Computing and Communication.}, } @INCOLLECTION{RosenhahnHMCh11-2007, AUTHOR = {Brox, Thomas and Rosenhahn, Bodo and Cremers, Daniel}, EDITOR = {Rosenhahn, Bodo and Klette, Reinhard and Metaxas, Dimitris}, TITLE = {Contours, Optic Flow, and Prior Knowledge: Cues for Capturing {3D} Human Motion in Videos}, BOOKTITLE = {Human Motion - Modeling, Tracking, Capture and Animation}, CHAPTER = {11}, ADDRESS = {Dordrecht, The Netherlands}, PUBLISHER = {Springer}, SERIES = {Computational Imaging and Vision}, VOLUME = {36}, ISBN = {978-1-4020-6692-4}, YEAR = {2008}, PAGES = {265--293}, } @INCOLLECTION{RosenhahnHMCh12-2007, AUTHOR = {Rosenhahn, Bodo and Kersting, Uwe and Powell, Katie and Brox, Thomas and Seidel, Hans-Peter}, EDITOR = {Rosenhahn, Bodo and Klette, Reinhard and Metaxas, Dimitris}, TITLE = {Tracking Clothed People}, BOOKTITLE = {Human Motion Understanding,. Modeling, Capture and Animation}, CHAPTER = {12}, ADDRESS = {Dordrecht, The Netherlands}, PUBLISHER = {Springer}, SERIES = {Computational Imaging and Vision}, VOLUME = {36}, ISBN = {978-1-4020-6692-4}, YEAR = {2008}, PAGES = {295--317}, } @BOOK{RosenhahnHMWS2007, EDITOR = {Elgammal, Ahmed and Rosenhahn, Bodo and Klette, Reinhard}, TITLE = {2nd Workshop: Human Motion - Understanding, Modeling, Capture and Animation}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4814}, ISBN = {3-540-75702-3}, YEAR = {2007}, PAGES = {327}, } @INPROCEEDINGS{RosenhahnIbPRIA2007, AUTHOR = {Schmaltz, Christian and Rosenhahn, Bodo and Brox, Thomas and Cremers, Daniel and Weickert, Joachim and Wietzke, Lennart and Sommer, Gerald}, EDITOR = {Marti, J. and Benedi, J.-M. and Mendonca, A.M. and Serrat, J.}, TITLE = {Region-based pose tracking}, BOOKTITLE = {Proceedings of the 3rd Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA 2007)}, PADDRESS = {Berlin}, ADDRESS = {Girona, Spain}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4478}, YEAR = {2007}, PAGES = {56--63}, } @ARTICLE{RosenhahnIJCV2005, AUTHOR = {Rosenhahn, Bodo and Perwass, Christian and Sommer, Gerald}, JOURNAL = {International Journal of Computer Vision}, TITLE = {Pose Estimation of Free-form Contours}, ADDRESS = {Heidelberg, Germany}, NUMBER = {3}, PUBLISHER = {Kluwer}, MONTH = {May}, VOLUME = {62}, ISBN = {0920-5691}, YEAR = {2005}, PAGES = {267--289}, ABSTRACT = {In this article we discuss the 2D-3D pose estimation problem of 3D free-form contours. In our scenario we observe objects of any 3D shape in an image of a calibrated camera. Pose estimation means to estimate the relative position and orientation (containing a rotation and translation) of the 3D object to the reference camera system. The fusion of modeling free-form contours within the pose estimation problem is achieved by using the conformal geometric algebra. The conformal geometric algebra is a geometric algebra which models entities as stereographically projected entities in a homogeneous model. This leads to a linear description of kinematics on the one hand and projective geometry on the other hand. To model free-form contours in the conformal framework we use twists to model cycloidal curves as twist-depending functions and interpret n-times nested twist generated curves as functions generated by 3D Fourier descriptors. This means, we use the twist concept to apply a spectral domain representation of 3D contours within the pose estimation problem. We will show that twist representations of objects can be numerically efficient and easily be applied to the pose estimation problem. The pose problem itself is formalized as implicit problem and we gain constraint equations, which have to be fulfilled with respect to the unknown rigid body motion. Several experiments visualize the robustness and real-time performance of our algorithms.}, } @ARTICLE{RosenhahnIJCV2007, AUTHOR = {Rosenhahn, Bodo and Brox, Thomas and Weickert, Joachim}, JOURNAL = {International Journal of Computer Vision}, TITLE = {Three-Dimensional Shape Knowledge for Joint Image Segmentation and Pose Tracking}, ADDRESS = {New York}, NUMBER = {3}, PUBLISHER = {Springer}, VOLUME = {73}, ISBN = {11263-006-9965-3}, YEAR = {2007}, PAGES = {243--262}, } @INPROCEEDINGS{RosenhahnISVC2008, AUTHOR = {Han, Dong and Rosenhahn, Bodo and Gehrig, Stefan and Seidel, Hans-Peter}, EDITOR = {Bebis, G. and Boyle, R.D. and Parvin, B. and Koracin, D. and Remagnino, P. and Porikli, F. M. and Peters, J. and Klosowski, J.T. and Arns, L.L. and Chun, Y.K. and Rhyne, T.-M. and Monroe, L.}, TITLE = {Combined registration methods for pose estimation}, BOOKTITLE = {Proceedings of the 4th International Symposium on Advances in Visual Computing (ISVC 2008)}, PADDRESS = {Berlin}, ADDRESS = {Las Vegas, NV, USA}, NUMBER = {Part I}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5358}, ISBN = {9738-3-540-89638-8}, YEAR = {2008}, PAGES = {913--924}, } @INPROCEEDINGS{RosenhahnIWCIA2006, AUTHOR = {Rosenhahn, Bodo and Brox, Thomas and Cremers, Daniel and Seidel, Hans-Peter}, EDITOR = {Reulke, Ralf and Eckhardt, Ulrich and Flach, Boris and Knauer, Uwe and Polthier, Konrad}, TITLE = {A Comparison of Shape Matching Methods for Contour Based Pose Estimation}, BOOKTITLE = {Combinatorial image analysis : 11th International Workshop, IWCIA 2006}, PADDRESS = {Berlin, Germany}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4040}, ISBN = {3-540-35153-1}, YEAR = {2006}, PAGES = {263--276}, ABSTRACT = {In this paper, we analyze two conceptionally different approaches for shape matching: the well-known iterated closest point (ICP) algorithm and variational shape registration via level sets. For the latter, we suggest to use a numerical scheme which was introduced in the context of optic flow estimation. For the comparison, we focus on the application of shape matching in the context of pose estimation of 3-D objects by means of their silhouettes in stereo camera views. It turns out that both methods have their specific shortcomings. With the possibility of the pose estimation framework to combine correspondences from two different methods, we show that such a combination improves the stability and convergence behavior of the pose estimation algorithm. We gratefully acknowledge funding by the DFG project CR250/1 and the Max-Planck Center for visual computing and communication.}, } @ARTICLE{RosenhahnJMIV2004a, AUTHOR = {Rosenhahn, Bodo and Sommer, Gerald}, JOURNAL = {Journal of Mathematical Imaging and Vision}, TITLE = {Pose Estimation in Conformal Geometric Algebra. Part I: The stratification of mathematical spaces}, ADDRESS = {Heidelberg, Germany}, NUMBER = {1}, PUBLISHER = {Springer Science+Business Media B.V.}, MONTH = {January}, VOLUME = {22}, ISBN = {0924-9907}, YEAR = {2005}, PAGES = {27--48}, ABSTRACT = {2D-3D pose estimation means to estimate the relative position and orientation of a 3D object with respect to a reference camera system. This work has its main focus on the theoretical foundations of the 2D-3D pose estimation problem: We discuss the involved mathematical spaces and their interaction within higher order entities. To cope with the pose problem (how to compare 2D projective image features with 3D Euclidean object features), the principle we propose is to reconstruct image features (e.g. points or lines) to one dimensional higher entities (e.g. 3D projection rays or 3D reconstructed planes) and express constraints in the 3D space. It turns out that the stratification hierarchy [11] introduced by Faugeras is involved in the scenario. But since the stratification hierarchy is based on pure point concepts a new algebraic embedding is required when dealing with higher order entities. The conformal geometric algebra (CGA) [24] is well suited to solve this problem, since it subsumes the involved mathematical spaces. Operators are defined to switch entities between the algebras of the conformal space and its Euclidean and projective subspaces. This leads to another interpretation of the stratification hierarchy, which is not restricted to be based solely on point concepts. This work summarizes the theoretical foundations needed to deal with the pose problem. Therefore it contains mainly basics of Euclidean, projective and conformal geometry. Since especially conformal geometry is not well known in computer science, we recapitulate the mathematical concepts in some detail. We believe that this geometric model is useful also for many other computer vision tasks and has been ignored so far. Applications of these foundations are presented in Part II [36].}, } @ARTICLE{RosenhahnJMIV2005b, AUTHOR = {Rosenhahn, Bodo and Sommer, Gerald}, JOURNAL = {Journal of Mathematical Imaging and Vision}, TITLE = {Pose Estimation in Conformal Geometric Algebra. Part II: Real-Time pose estimation using extended feature concepts}, ADDRESS = {Heidelberg, Germany}, NUMBER = {1}, PUBLISHER = {Springer Science+Business Media B.V.}, MONTH = {January}, VOLUME = {22}, ISBN = {0924-9907 }, YEAR = {2005}, PAGES = {49--70}, ABSTRACT = {Part II uses the foundations of Part I [35] to define constraint equations for 2D-3D pose estimation of different corresponding entities. Most articles on pose estimation concentrate on specific types of correspondences, mostly between points, and only rarely use line correspondences. The first aim of this part is to extend pose estimation scenarios to correspondences of an extended set of geometric entities. In this context we are interested to relate the following (2D) image and (3D) model types: 2D point/3D point, 2D line/3D point, 2D line/3D line, 2D conic/3D circle, 2D conic/3D sphere. Furthermore, to handle articulated objects, we describe kinematic chains in this context in a similar manner. We ensure that all constraint equations end up in a distance measure in the Euclidean space, which is well posed in the context of noisy data. We also discuss the numerical estimation of the pose. We propose to use linearized twist transformations which result in well conditioned and fast solvable systems of equations. The key idea is not to search for the representation of the Lie group, describing the rigid body motion, but for the representation of their generating Lie algebra. This leads to real-time capable algorithms.}, } @ARTICLE{RosenhahnKI2005, AUTHOR = {Rosenhahn, Bodo and Brox, Thomas and Kersting, Uwe and Smith, Andrew and Gurney, Jason and Klette, Reinhard}, JOURNAL = {K{\"u}nstliche Intelligenz}, TITLE = {A system for marker-less motion capture}, ADDRESS = {Bremen, Germany}, NUMBER = {1}, PUBLISHER = {Boettcher IT Verlag}, MONTH = {January}, VOLUME = {20}, YEAR = {2006}, PAGES = {45--51}, ABSTRACT = {In this contribution we present a silhouette based human motion capture system. The system components contain silhouette extraction based on level sets, a correspondence module, which relates image data to model data and a pose estimation module. Experiments are done in different camera setups and we estimate the model components with 21 degrees of freedom in up to two frames per second. To evaluate the stability of the proposed algorithm we perform a comparison of the motion estimation system with a marker based tracking system. The results show the applicability of the system for marker-less sports movement analysis. We finally present extensions for motion capture in complex environments, with changing lighting conditions and cluttered background. This paper is an extended version of [21] which was awarded the DAGM Main Prize on the annual symposium of the German pattern recognition society (DAGM) in Vienna, 2005.}, } @BOOK{RosenhahnKletteMetaxas07, EDITOR = {Rosenhahn, Bodo and Klette, Reinhard and Metaxas, Dimitris}, TITLE = {Human Motion - Understanding, Modeling, Capture and Animation}, ADDRESS = {Dordrecht, The Netherlands}, PUBLISHER = {Springer}, SERIES = {Computational Imaging and Vision}, VOLUME = {36}, ISBN = {978-1-4020-6692-4}, YEAR = {2008}, PAGES = {633}, } @ARTICLE{RosenhahnMVA2006, AUTHOR = {Rosenhahn, Bodo and Kersting, Uwe and Powell, Katie and Klette, Reinhard and Klette, Gisela and Seidel, Hans-Peter}, JOURNAL = {Machine Vision and Applications}, TITLE = {A system for articulated tracking incorporating a clothing model}, ADDRESS = {Berlin, Germany}, NUMBER = {1}, PUBLISHER = {Springer}, VOLUME = {18}, ISBN = {14321769}, YEAR = {2007}, PAGES = {25--40}, ABSTRACT = {In this paper an approach for motion capture of dressed people is presented. A cloth draping method is incorporated in a silhouette based motion capture system. This leads to a simultaneous estimation of pose, joint angles, cloth draping parameters and wind forces. An error functional is formalized to minimize the involved parameters simultaneously. This allows for reconstruction of the underlying kinematic structure, even though it is covered with fabrics. Finally, a quantitative error analysis is performed. Pose results are compared with results obtained from a commercially available marker based tracking system. The deviations have a magnitude of three degrees which indicates a reasonably stable approach.}, } @INPROCEEDINGS{RosenhahnRobVis2008, AUTHOR = {Rosenhahn, Bodo and Brox, Thomas and Cremers, Daniel and Seidel, Hans-Peter}, EDITOR = {Sommer, Gerald and Klette, Reinhard}, TITLE = {Modeling and tracking line-contrained mechanical systems}, BOOKTITLE = {Robot Vision, 2nd International Workshop}, PADDRESS = {Berlin}, ADDRESS = {Auckland, New Zealand}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4931}, ISBN = {978-3-540-78156-1}, YEAR = {2008}, PAGES = {98--110}, } @INPROCEEDINGS{RosenhahnTwist2006, AUTHOR = {Sommer, Gerald and Rosenhahn, Bodo and Perwass, Christian}, EDITOR = {Klette, Reinhard and Kozera, Ryszard and Noakes, Lyle and Weickert, Joachim}, TITLE = {The Twist Representation of Free-form Objects}, BOOKTITLE = {Geometric Properties from Incomplete Data}, PADDRESS = {Berlin, Germany}, ADDRESS = {Dagstuhl, Wadern, Germany}, PUBLISHER = {Springer}, SERIES = {Computational Imaging and Vision}, VOLUME = {31}, ISBN = {978-1-4020-3857-0 (Print)}, YEAR = {2006}, PAGES = {3--22}, } @INPROCEEDINGS{Ruotsalo2013, AUTHOR = {Ruotsalo, Tuukka, and Athukorala, Kumaripaba and Glowacka, Dorota and Konyushkova, Ksenia and Oulasvirta, Antti and Kaipainen, Samuli and Kaski, Samuel and Jacucci, Giulio}, TITLE = {Supporting exploratory search tasks with interactive user modeling}, BOOKTITLE = {Proc. ASIS\&T’13}, ORGANIZATION = {ASIST}, PADDRESS = {New York}, ADDRESS = {Long Beach, USA}, PUBLISHER = {ASIST}, YEAR = {2013}, } @ARTICLE{Rupprecht2013, AUTHOR = {Theobalt, Christian}, JOURNAL = {3DV}, TITLE = {3D Semantic Parameterization for Human Shape Modeling: Application to 3D Animation}, ADDRESS = {Seattle, Washington, USA}, VOLUME = {2013}, ISBN = {13769706}, YEAR = {2013}, PAGES = {255--262}, } @ARTICLE{RusHasKleRos09, AUTHOR = {Russell, James and Hasler, Nils and Klette, Reinhard and Rosenhahn, Bodo}, JOURNAL = {Ecology}, TITLE = {Automatic track recognition of footprints for identifying cryptic species}, ADDRESS = {Ithaca, USA}, NUMBER = {7}, PUBLISHER = {Ecological Society of America}, VOLUME = {90}, ISBN = {0012-9658}, DOI = {10.1890/08-1069.1}, YEAR = {2009}, PAGES = {2007--2013}, } @ARTICLE{rzns:qss:2004, AUTHOR = {R{\"o}ssl, Christian and Zeilfelder, Frank and N{\"u}rnberger, G{\"u}nther and Seidel, Hans-Peter}, JOURNAL = {IEEE Transactions on Visualization and Computer Graphics}, TITLE = {Reconstruction of Volume Data with Quadratic Super Splines}, ADDRESS = {Los Alamitos, USA}, NUMBER = {4}, PUBLISHER = {IEEE}, VOLUME = {10}, YEAR = {2004}, PAGES = {397--409}, ABSTRACT = {We propose a new approach to reconstruct nondiscrete models from gridded volume samples. As a model, we use quadratic trivariate super splines on a uniform tetrahedral partition. We discuss the smoothness and approximation properties of our model and compare to alternative piecewise polynomial constructions. We observe as a non-standard phenomenon that the derivatives of our splines yield optimal approximation order for smooth data, while the theoretical error of the values is nearly optimal due to the averaging rules. Our approach enables efficient reconstruction and visualization of the data. As the piecewise polynomials are of the lowest possible total degree two, we can efficiently determine exact ray intersections with an iso-surface for ray-casting. Moreover, the optimal approximation properties of the derivatives allow to simply sample the necessary gradients directly from the polynomial pieces of the splines. Our results confirm the efficiency of the quasi-interpolating method and demonstrate high visual quality for rendered isosurfaces.}, } @INPROCEEDINGS{rzns:sagvd:04, AUTHOR = {R{\"o}ssl, Christian and Zeilfelder, Frank and N{\"u}rnberger, G{\"u}nther and Seidel, Hans-Peter}, EDITOR = {Elber, Gershon and Patrikalakis, Nick and Brunet, Pere}, TITLE = {Spline Approximation of General Volumetric Data}, BOOKTITLE = {Proceedings of the 9th ACM Symposium on Solid Modeling and Applications (SM 2004)}, ORGANIZATION = {Eurographics/ACM SIGGRAPH}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Genova, Italy}, PUBLISHER = {Eurographics}, ISBN = {3-905673-55-X}, YEAR = {2004}, PAGES = {71--82}, ABSTRACT = {We present an efficient algorithm for approximating huge general volumetric data sets, i.e.~the data is given over arbitrarily shaped volumes and consists of up to millions of samples. The method is based on cubic trivariate splines, i.e.~piecewise polynomials of total degree three defined w.r.t. uniform type-6 tetrahedral partitions of the volumetric domain. Similar as in the recent bivariate approximation approaches, the splines in three variables are automatically determined from the discrete data as a result of a two-step method, where local discrete least squares polynomial approximations of varying degrees are extended by using natural conditions, i.e.the continuity and smoothness properties which determine the underlying spline space. The main advantages of this approach with linear algorithmic complexity are as follows: no tetrahedral partition of the volume data is needed, only small linear systems have to be solved, the local variation and distribution of the data is automatically adapted, Bernstein-B{\'e}zier techniques well-known in Computer Aided Geometric Design (CAGD) can be fully exploited, noisy data are automatically smoothed. Our numerical examples with huge data sets for synthetic data as well as some real-world data confirm the efficiency of the methods, show the high quality of the spline approximation, and illustrate that the rendered iso-surfaces inherit a visual smooth appearance from the volume approximating splines.}, } @TECHREPORT{Saleem2008, AUTHOR = {Saleem, Waqar and Patan{\`e}, Giuseppe and Spagnuolo, Michela and Falcidieno, Bianca and Seidel, Hans-Peter}, TITLE = {On continuously approximating discretely sampled view descriptors}, INSTITUTION = {Istituto di Matematica Applicata e Tecnologie Informatiche}, TYPE = {Research Report}, ADDRESS = {Genova}, NUMBER = {7/2008.}, MONTH = {July}, YEAR = {2008}, PAGES = {8}, } @PHDTHESIS{Saleem2010, AUTHOR = {Saleem, Waqar}, TITLE = {Digital Processing and Managemnt Tools for {2D} and {3D} Shape Repositories}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2010}, } @ARTICLE{Saleem2011, AUTHOR = {Saleem, Waqar and Belyaev, Alexander and Wang, Danyi and Seidel, Hans-Peter}, JOURNAL = {Computers \& Graphics}, TITLE = {On visual complexity of {3D} shapes}, ADDRESS = {Amsterdam}, NUMBER = {3}, PUBLISHER = {Elsevier}, VOLUME = {35}, ISBN = {0097-8493}, DOI = {10.1016/j.cag.2011.03.006}, YEAR = {2011}, PAGES = {580--585}, } @TECHREPORT{SaleemIMATI-report2008, AUTHOR = {W. Saleem and G. Patan{\`e} and M. Spagnuolo and B. Falcidieno and H.-P. Seidel}, TITLE = {On continuously approximating discretely sampled view descriptors}, INSTITUTION = {Istituto di matematica applicata e tecnologie informatiche (CNR-IMATI)}, TYPE = {Technical Report}, ADDRESS = {Genova, Italy}, NUMBER = {7/2008}, YEAR = {2008}, PAGES = {0}, } @INPROCEEDINGS{SaleemWangBelyaevSeidel2007, AUTHOR = {Saleem, Waqar and Wang, Danyi and Belyaev, Alexander and Seidel, Hans-Peter}, TITLE = {Automatic 2D Shape Orientation by Example}, BOOKTITLE = {2007 International Conference on Shape Modeling and Applications (SMI 2007)}, PADDRESS = {Los Alamitos, CA, USA}, ADDRESS = {Lyon, France}, PUBLISHER = {IEEE}, ISBN = {0-7695-2815-5}, DOI = {10.1109/SMI.2007.8}, YEAR = {2007}, PAGES = {221--225}, ABSTRACT = {As large shape repositories become more common, the problem of automatically generating good views of shapes has recently gained prominence. However, very few of the proposed methods take into account the orientation of the shape in the resulting view, and none presents a satisfactory solution. In this paper, we present a simple, example based method to correct the orientation of a shape in a query image. Our method depends on the availability of a database of classified images containing correctly oriented shapes. In the first step, a candidate class for the query shape is identified, and in the second, the query shape is aligned with a target shape from the candidate class.}, } @INPROCEEDINGS{SaleemWBS_wss2006, AUTHOR = {Saleem, Waqar and Wang, Danyi and Belyaev, Alexander and Seidel, Hans-Peter}, TITLE = {Statistical Learning for Shape Applications}, BOOKTITLE = {1st International Symposium on Shapes and Semantics}, PADDRESS = {Genova, Italy}, ADDRESS = {Matsushima, JAPAN}, PUBLISHER = {CNR}, MONTH = {June}, YEAR = {2006}, PAGES = {53--60}, ABSTRACT = {Statistical methods are well suited to the large amounts of data typically involved in digital shape applications. In this paper, we look at two statistical learning methods related to digital shape processing. The first, \textit{neural meshes}, learns the shape of a given point cloud \--- the surface reconstruction problem \--- in $O(n^2)$ time. We present an alternate implementation of the algorithm that takes $O(n\log n)$ time. Secondly, we present a simple method to automatically learn the correct orientation of a shape in an image from a database of images with correctly oriented shapes.}, } @INPROCEEDINGS{sauber2005, AUTHOR = {Sauber, Natascha and Theisel, Holger and Seidel, Hans-Peter}, EDITOR = {Gr{\"o}ller, Eduard and Pang, Alex and Silva, Claudio T. and Stasko, John and van Wijk, Jarke}, TITLE = {Multifield-Graphs: An Approach to Visualizing Correlations in Multifield Scalar Data}, BOOKTITLE = {IEEE Visualization Conference 2006}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Baltimore, USA}, NUMBER = {5}, PUBLISHER = {IEEE}, MONTH = {November}, SERIES = {IEEE Visualization}, VOLUME = {12}, ISBN = {1077-2626}, YEAR = {2006}, PAGES = {917--924}, ABSTRACT = {We present an approach to visualizing correlations in 3D multifield scalar data. The core of our approach is the computation of correlation fields, which are scalar fields containing the local correlations of subsets of the multiple fields. While the visualization of the correlation fields can be done using standard 3D volume visualization techniques, their huge number makes selection and handling a challenge. We introduce the Multifield-Graph to give an overview of which multiple fields correlate and to show the strength of their correlation. This information guides the selection of informative correlation fields for visualization. We use our approach to visually analyze a number of real and synthetic multifield datasets.}, } @MASTERSTHESIS{Schall2003, AUTHOR = {Schall, Oliver}, TITLE = {{Automatische Erzeugung von Textur-Atlanten f{\"u}r mannigfaltige Fl{\"a}chen}}, SCHOOL = {Rheinisch-Westf{\"a}lische Technische Hochschule Aachen}, TYPE = {Master's thesis}, MONTH = {September}, YEAR = {2003}, } @PHDTHESIS{Schall2009:Thesis, AUTHOR = {Schall, Oliver}, TITLE = {Robust and Efficient Processing Techniques for Static and Dynamic Geometric Data}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, YEAR = {2009}, } @ARTICLE{SchallCAD2008, AUTHOR = {Schall, Oliver and Belyaev, Alexander G. and Seidel, Hans-Peter}, JOURNAL = {Computer-Aided Design}, TITLE = {Adaptive feature-preserving non-local denoising of static and time-varying range data}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {1}, PUBLISHER = {Elsevier}, MONTH = {January}, VOLUME = {40}, ISBN = {0010-4485}, YEAR = {2008}, PAGES = {701--707}, } @INPROCEEDINGS{Scheel00, AUTHOR = {Scheel, Annette and Stamminger, Marc and Seidel, Hans-Peter}, EDITOR = {Gross, Markus and Hopgood, F. R. A.}, TITLE = {Tone Reproduction for Interactive Walkthroughs}, BOOKTITLE = {Proceedings of the European Association for Computer Graphics 21st Annual Conference (Eurographics-00)}, ORGANIZATION = {EUROGRAPHICS}, PADDRESS = {Oxford, UK}, ADDRESS = {Interlaken, Switzerland}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {August}, SERIES = {Computer Graphics Forum}, VOLUME = {19}, ISBN = {0167-7055}, YEAR = {2000}, PAGES = {301--311}, ABSTRACT = { When a rendering algorithm has created a pixel array of radiance values the task of producing an image is not yet completed. In fact, to visualize the result the radiance values still have to be mapped to luminances, which can be reproduced by the used display. This step is performed with the help of tone reproduction operators. These tools have mainly been applied to still images, but of course they are just as necessary for walkthrough applications, in which several images are created per second. In this paper we illuminate the physiological aspects of tone reproduction for interactive applications. It is shown how tone reproduction can also be introduced into interactive viewers, where the tone reproduction continuously adjusts to the current view of the user. The overall performance is decreased only moderately, still allowing walkthroughs of large scenes.}, } @INPROCEEDINGS{Scheel1999, AUTHOR = {Scheel, Annette and B{\"o}hm, Birthe and Seidel, Hans-Peter}, EDITOR = {Girod, Bernd and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {Perception-based Radiosity}, BOOKTITLE = {Proceedings of the 4th Conference on Vision, Modeling, and Visualization (VMV-99)}, ORGANIZATION = {SFB 603 and Graduate Research Center, in coorperation with IEEE Signal Processing Society and Gesellschaft f{\"u}r Informatik GI}, PADDRESS = {Sankt Augustin, Germany}, ADDRESS = {Erlangen, Germany}, PUBLISHER = {infix}, MONTH = {November}, ISBN = {3-89601-015-8}, YEAR = {1999}, PAGES = {293--300}, } @INPROCEEDINGS{Scheel2001, AUTHOR = {Scheel, Annette and Stamminger, Marc and Seidel, Hans-Peter}, EDITOR = {Gortler, Steven and Myszkowski, Karol}, TITLE = {Thrifty Final Gather for Radiosity}, BOOKTITLE = {Rendering Techniques 2001: Proceedings of the 12th Eurographics Workshop on Rendering}, PADDRESS = {Vienna, Austria}, ADDRESS = {London}, PUBLISHER = {Springer}, ISBN = {3-211-83709-4}, YEAR = {2001}, PAGES = {1--12}, } @INPROCEEDINGS{Scheel2001b, AUTHOR = {Scheel, Annette and Stamminger, Marc and P{\"u}tz, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {Magnenat-Thalmann, Nadia and Skala, Vaclav}, TITLE = {Enhancements to Directional Coherence Maps}, BOOKTITLE = {Proceedings of the 9th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2001 (WSCG-2001)}, PADDRESS = {Plzen}, ADDRESS = {Plzen, Czech Republic}, PUBLISHER = {University of West Bohemia}, YEAR = {2001}, PAGES = {403--410}, } @INPROCEEDINGS{Scheel2002, AUTHOR = {Scheel, Annette and Stamminger, Marc and Seidel, Hans-Peter}, EDITOR = {Drettakis, George and Seidel, Hans-Peter}, TITLE = {Grid Based Final Gather for Radiosity on Complex Scenes}, BOOKTITLE = {EUROGRAPHICS 2002}, ORGANIZATION = {EUROGRAPHICS, MPI f{\"u}r Informatik, Universit{\"a}t des Saarlandes}, PADDRESS = {Oxford, UK}, ADDRESS = {Saarbr{\"u}cken, Germany}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, SERIES = {Computer Graphics Forum}, VOLUME = {21}, ISBN = {0167-7055}, YEAR = {2002}, PAGES = {547--555}, } @PHDTHESIS{ScheelDiss03, AUTHOR = {Scheel, Annette}, TITLE = {High Quality Reconstruction and Interactive Tonemapping of Global Illumination Solutions}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {April}, YEAR = {2003}, } @INCOLLECTION{Scheel:2000:GI, AUTHOR = {Scheel, Annette and Daubert, Katja and Stamminger, Marc}, EDITOR = {Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich}, TITLE = {Global Illumination}, BOOKTITLE = {Principles of 3D Image Analysis and Synthesis}, CHAPTER = {5.2}, ADDRESS = {Boston, USA}, PUBLISHER = {Kluwer}, MONTH = {January}, ISBN = {0-7923-7850-4}, YEAR = {2000}, PAGES = {213--223}, } @INPROCEEDINGS{Scheib:2002:EFRLSD, AUTHOR = {Scheib, Vincent and Haber, J{\"o}rg and Lin, Ming C. and Seidel, Hans-Peter}, EDITOR = {Drettakis, George and Seidel, Hans-Peter}, TITLE = {Efficient Fitting and Rendering of Large Scattered Data Sets Using Subdivision Surfaces}, BOOKTITLE = {EUROGRAPHICS 2002}, ORGANIZATION = {EUROGRAPHICS, MPI f{\"u}r Informatik, Universit{\"a}t des Saarlandes}, PADDRESS = {Oxford, UK}, ADDRESS = {Saarbr{\"u}cken, Germany}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, SERIES = {Computer Graphics Forum}, VOLUME = {21}, ISBN = {0167-7055}, YEAR = {2002}, PAGES = {353--362}, ABSTRACT = {We present a method to efficiently construct and render a smooth surface for approximation of large functional scattered data. Using a subdivision surface framework and techniques from terrain rendering, the resulting surface can be explored from any viewpoint while maintaining high surface fairness and interactive frame rates. We show the approximation error to be sufficiently small for several large data sets. Our system allows for adaptive simplification and provides continuous levels of detail, taking into account the local variation and distribution of the data. }, } @MASTERSTHESIS{Scherbaum2005, AUTHOR = {Scherbaum, Kristina}, TITLE = {Learning Based Prediction and 3D-Visualisation of Children’s Facial Growth}, SCHOOL = {Fachhochschule Stuttgart, Hochschule der Medien}, TYPE = {Diploma thesis}, MONTH = {March}, YEAR = {2005}, ABSTRACT = {Based on a novel, example-based approach for studying how children’s faces change as they grow, we present an automated algorithm for the prediction of children’s facial growth. A single image of an arbitrary face at its present appearance is sufficient to estimate an age-progressed 3D face model of the individual. By extracting and applying growth vectors from a previously acquired database, the face can be transformed into its individual older or younger appearance. The database is a combination of an existing set of 3D laser scans of 200 adult human faces and two newly acquired 3D databases of baby and teenager faces. Those are generated from 3D laser scans and stereo images, respectively. By incorporating the data into a morphable 3D face model, a homogeneous face space is constructed, which contains 523 3D face models of adults, teenagers and babies in a vector representation that involves dense point-to-point correspondence between individual faces. For the baby face models, additional anthropometric measurements of the facial soft tissue are performed by a novel, automated algorithm. The results provide a longitudinal study of baby faces, which is intended to assist in detecting anomalies of the facial growth at early stages of development. The additional shape and texture vectors for children and a subsequent Principal Component Analysis improve the reconstruction results of the morphable 3D face model when matching it to infant faces. Moreover, a subdivision of the database into age groups makes it possible to describe the individual growth of a face continuously, starting from a minimum age of 3 months to a maximum age of 35 years. In the vector space representation, growth is modelled by a piecewise linear function that approximates a desired target age for an individual face by learning the growth from the given sample set of 523 faces.}, } @MASTERSTHESIS{Scherbaum2007, AUTHOR = {Scherbaum, Kristina}, TITLE = {Face Recognition and Growth Prediction using a 3D Morphable Face Model}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {October}, YEAR = {2007}, ABSTRACT = {We present two different techniques and applications that are based on the 3D Morphable Face Model. In the first part of this thesis, we develop a new top-down approach to 3D data analysis by fitting a 3D Morphable Face Model to 3D scans of faces. The algorithm is specifically designed for scans which were recorded in a perspective projection. In an analysis-by-synthesis approach, shape, texture, pose and illumination are optimized simultaneously. Starting from raw 3D scans, the algorithm determines a PCA-based representation which fits the scan best. Also, fragmentary surfaces are completed and correspondence to a reference face of the morphable model is established. Simultaneously, illumination conditions are estimated in an explicit simulation that involves specular and diffuse components. The effects of lighting and shading are removed to obtain an illumination corrected texture which stores the diffuse reflectance in each point of the facial surface. We use the algorithm as a core component in 3D face recognition on a subset of the FRGC database of scans. In part two of this thesis we explore the growth of 3D faces, represented in a 3D Morphable Face Model. Assuming that 3D faces follow curved trajectories in face space as they age, we present a novel algorithm that computes individual aging trajectories for given faces. From a database of 3D scans of teenagers and adults, we learn an non-linear function, that assigns an age to each face vector using support vector regression. Computing the gradient of this function leads us to trajectories that describe the direction of growth in face space. Starting from photographs of faces we apply the aging prediction to images of faces by reconstructing a 3D model from the input image and applying the aging transformation on both shape and texture. The resulting face model is rendered back into the same image or into images of other individuals at the appropriate ages, for example images of older children. Also we may compute a variety of possible appearances by changing attributes such as haircut, cloth or background. Among other applications, our system can help to find missing children.}, } @ARTICLE{Scherbaum2011makeup, AUTHOR = {Scherbaum, Kristina and Ritschel, Tobias and Hullin, Matthias and Thorm{\"a}hlen, Thorsten and Blanz, Volker and Seidel, Hans-Peter}, EDITOR = {Chen, Min and Deussen, Oliver}, JOURNAL = {Computer Graphics Forum (Proceedings EUROGRAPHICS 2011)}, TITLE = {Computer-suggested Facial Makeup}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, ORGANIZATION = {European Association for Computer Graphics}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell}, MONTH = {April}, VOLUME = {30}, DOI = {10.1111/j.1467-8659.2011.01874.x}, YEAR = {2011}, PAGES = {485--492}, } @PHDTHESIS{Scherbaum2013, AUTHOR = {Scherbaum, Kristina}, TITLE = {Data driven analysis of faces from images}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {September}, YEAR = {2013}, } @INPROCEEDINGS{Scherbaum2013, AUTHOR = {Scherbaum, Kristina and Seidel, Hans-Peter}, TITLE = {Fast Face Detector Training Using Tailored Views}, BOOKTITLE = {IEEE 14th International Conference on Computer Vision (ICCV)}, PADDRESS = {IEEE}, ADDRESS = {Sydney, Australia}, PUBLISHER = {IEEE}, MONTH = {December}, SERIES = {The IEEE International Conference on Computer Vision (ICCV)}, YEAR = {2013}, PAGES = {8}, } @ARTICLE{Scherzer2012, AUTHOR = {Mattausch, Oliver and Scherzer, Daniel and Wimmer, Michael and Igarashi, Takeo}, JOURNAL = {Computer Graphics Forum}, TITLE = {Tessellation-Independent Smooth Shadow Boundaries}, ADDRESS = {Oxford}, NUMBER = {4}, PUBLISHER = {Blackwell}, VOLUME = {31}, DOI = {10.1111/j.1467-8659.2012.03142.x}, YEAR = {2012}, PAGES = {1465--1470}, } @INPROCEEDINGS{Scherzer2012FaSS, AUTHOR = {Schw{\"a}rzler, Michael and Mattausch, Oliver and Scherzer, Daniel and Wimmer, Michael}, TITLE = {Fast Accurate Soft Shadows with Adaptive Light Source Sampling}, BOOKTITLE = {17th International Workshop on Vision, Modeling and Visualization}, PADDRESS = {Goslar, Germany}, ADDRESS = {Magdeburg, Germany}, PUBLISHER = {Eurographics}, YEAR = {2012}, PAGES = {039--046}, } @INCOLLECTION{Scherzer2012OVsm, AUTHOR = {Mattausch, Oliver and Bittner, Jiri and Silvennoinen, Ari and Scherzer, Daniel and Wimmer, Michael}, EDITOR = {Engel, Wolfgang}, TITLE = {Efficient Online Visibility for Shadow Maps}, BOOKTITLE = {{GPU} Pro 3: Advanced Rendering Techniques}, ADDRESS = {Natick, Massachusetts}, PUBLISHER = {A.K. Peters}, ISBN = {978-1-4398-8782-0}, YEAR = {2012}, PAGES = {233--242}, } @ARTICLE{Scherzer2012PcRC, AUTHOR = {Scherzer, Daniel and Nguyen, Chuong and Ritschel, Tobias and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum (Proc. Eurographics Symposium on Rendering 2012)}, TITLE = {Pre-convolved Radiance Caching}, ADDRESS = {Oxford}, NUMBER = {4}, PUBLISHER = {Blackwell}, VOLUME = {31}, YEAR = {2012}, PAGES = {1391--1397}, } @ARTICLE{Scherzer2012tcm, AUTHOR = {Scherzer, Daniel and Yang, Lei and Mattausch, Oliver and Nehab, Diego and Sander, Pedro V. and Wimmer, Michael and Eisemann, Elmar}, JOURNAL = {Computer Graphics Forum}, TITLE = {Temporal Coherence Methods in Real-Time Rendering}, ADDRESS = {Oxford}, NUMBER = {8}, PUBLISHER = {Blackwell}, VOLUME = {31}, DOI = {10.1111/j.1467-8659.2012.03075.x}, YEAR = {2012}, PAGES = {2378--2408}, } @INCOLLECTION{Scherzer2012Water, AUTHOR = {Scherzer, Daniel and Bagar, Florian and Mattausch, Oliver}, EDITOR = {Engel, Wolfgang}, TITLE = {Volumetric Real-Time Water and Foam Rendering}, BOOKTITLE = {{GPU} Pro 3: Advanced Rendering Techniques}, ADDRESS = {Natick, Massachusetts}, PUBLISHER = {A.K. Peters}, ISBN = {978-1-4398-8782-0}, YEAR = {2012}, PAGES = {119--132}, } @INPROCEEDINGS{ScheSunBlaSei07, AUTHOR = {Scherbaum, Kristina and Sunkel, Martin and Seidel, Hans-Peter and Blanz, Volker}, EDITOR = {Cohen-Or, Daniel and Slavik, Pavel}, TITLE = {Prediction of Individual Non-Linear Aging Trajectories of Faces}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, ORGANIZATION = {The European Association for Computer Graphics}, PADDRESS = {Oxford, UK}, ADDRESS = {Prague, Czech Republic}, NUMBER = {3}, PUBLISHER = {Blackwell}, VOLUME = {26(3)}, DOI = {10.1111/j.1467-8659.2007.01050.x}, YEAR = {2007}, PAGES = {285--294}, ABSTRACT = {Represented in a Morphable Model, 3D faces follow curved trajectories in face space as they age. We present a novel algorithm that computes the individual aging trajectories for given faces, based on a non-linear function that assigns an age to each face vector. This function is learned from a database of 3D scans of teenagers and adults using support vector regression. To apply the aging prediction to images of faces, we reconstruct a 3D model from the input image, apply the aging transformation on both shape and texture, and then render the face back into the same image or into images of other individuals at the appropriate ages, for example images of older children. Among other applications, our system can help to find missing children.}, } @INPROCEEDINGS{Schirmacher2000, AUTHOR = {Schirmacher, Hartmut and Brabec, Stefan}, EDITOR = {Zerbst, Carsten}, TITLE = {tmk - a Multi-Site, Multi-Platform System for Software Development}, BOOKTITLE = {Proc. First European Tcl/Tk User Meeting}, PADDRESS = {Hamburg}, ADDRESS = {Technische Universit{\"a}t Hamburg-Harburg}, PUBLISHER = {Technische Universit{\"a}t Hamburg-Harburg}, YEAR = {2000}, ABSTRACT = {tmk is a tool that embeds the functionality of make in the scripting language Tcl in a very simple and convenient way. Furthermore, tmk allows higher levels of abstraction via modules and a flexible configuration framework. In addition to using tmk simply as a replacement for make, the users can create projects with global methods, objects, and options, and extend or modify the globally defined tasks using per-directory control files similar to the traditional Makefile concept. We give a brief overview of tmk's core concepts, such as target and dependency definition, exception handling, and parameterization of targets and modules. Furthermore, we show some examples of how to use tmk's configuration system for multi-platform software development and projects shared by multiple sites.}, } @PHDTHESIS{SchirmacherDiss03, AUTHOR = {Schirmacher, Hartmut}, TITLE = {Efficient Aquisition, Representation, and Rendering of Light Fields}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {June}, YEAR = {2003}, } @INPROCEEDINGS{Schirmacher:1999:AAL, AUTHOR = {Schirmacher, Hartmut and Heidrich, Wolfgang and Seidel, Hans-Peter}, EDITOR = {Brunet, Pere and Scopigno, Roberto}, TITLE = {Adaptive Acquisition of Lumigraphs from Synthetic Scenes}, BOOKTITLE = {Proceedings of the 20th Annual Conference ot the European Association of Computer Graphics (Eurographics-99)}, ORGANIZATION = {Eurographics Association}, PADDRESS = {Oxford, USA}, ADDRESS = {Milano, Italy}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {18}, YEAR = {1999}, PAGES = {151--160}, ABSTRACT = {Light fields and Lumigraphs are capable of rendering scenes of arbitrary geometrical or illumination complexity in real time. They are thus interesting ways of interacting with both recorded real-world and high-quality synthetic scenes. Unfortunately, both light fields and Lumigraph rely on a dense sampling of the illumination to provide a good rendering quality. This induces high costs both in terms of storage requirements and computational resources for the image acquisition. Techniques for acquiring adaptive light field and Lumigraph representations are thus mandatory for practical applications. In this paper we present a method for the adaptive acquisition of images for Lumigraphs from synthetic scenes. Using image warping to predict the potential improvement in image quality when adding a certain view, we decide which new views of the scene should be rendered and added to the light field. This a-priori error estimator accounts for both visibility problems and illumination effects such as specular highlights.}, } @INPROCEEDINGS{Schirmacher:1999:IBB, AUTHOR = {Schirmacher, Hartmut and Heidrich, Wolfgang and Rubick, Martin and Schiron, Detlef and Seidel, Hans-Peter}, EDITOR = {Girod, Bernd and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {Image-Based {BRDF} Reconstruction}, BOOKTITLE = {Proceedings of the 4th Conference on Vision, Modeling, and Visualization (VMV-99)}, PADDRESS = {Sankt Augustin, Germany}, ADDRESS = {Erlangen, Germany}, PUBLISHER = {Infix}, MONTH = {November}, YEAR = {1999}, PAGES = {285--292}, } @INPROCEEDINGS{Schirmacher:2000:HQI, AUTHOR = {Schirmacher, Hartmut and Heidrich, Wolfgang and Seidel, Hans-Peter}, EDITOR = {Fels, Sidney and Poulin, Pierre}, TITLE = {High-Quality Interactive Lumigraph Rendering Through Warping}, BOOKTITLE = {Proceedings of Graphics Interface 2000 (GI-00)}, ORGANIZATION = {CHCCS}, PADDRESS = {Toronto, Canada}, ADDRESS = {Montreal, Canada}, PUBLISHER = {Canadian Information Processing Society}, MONTH = {May}, ISBN = {0-9695338-9-6}, YEAR = {2000}, PAGES = {87--94}, ABSTRACT = { We introduce an algorithm for high-quality, interactive light field rendering from only a small number of input images. The algorithm bridges the gap between image warping and interpolation from image databases, which represent the two major approaches in image based rendering. By warping and blending only necessary parts of the Lumigraph images, we are able to generate a single view-corrected texture for every output frame at interactive rates. In contrast to previous light field rendering approaches, our warping-based algorithm is able to fully exploit per-pixel depth information in order to depth-correct the light field samples with maximum accuracy. The complexity of the proposed algorithm is independent of the number of stored reference images and of the final screen resolution. It performs with only small overhead and very few visible artifacts. We demonstrate the visual fidelity as well as the performance of our method through various examples.}, } @INPROCEEDINGS{Schirmacher:2001:EFF, AUTHOR = {Schirmacher, Hartmut and Vogelgsang, Christian and Seidel, Hans-Peter and Greiner, G{\"u}nther}, EDITOR = {Ertl, Thomas and Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {Efficient Free Form Light Field Rendering}, BOOKTITLE = {Vision, Modeling and Visualization 2001 (VMV-2001)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Stuttgart, Germany}, PUBLISHER = {A K Peters}, ISBN = {3-89838-028-9}, YEAR = {2001}, PAGES = {249--256}, } @INPROCEEDINGS{Schirmacher:2001:OTF, AUTHOR = {Schirmacher, Hartmut and Li, Ming and Seidel, Hans-Peter}, EDITOR = {Chalmers, Alan and Rhyne, Theresa-Marie}, TITLE = {On-the-fly Processing of Generalized Lumigraphs}, BOOKTITLE = {Computer Graphics Forum, Proceedings of Eurographics 2001}, ORGANIZATION = {Eurographics Association}, PADDRESS = {Oxford, UK}, ADDRESS = {Manchester, UK}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, SERIES = {Computer Graphics Forum}, VOLUME = {20}, YEAR = {2001}, PAGES = {C--165-C173;C-543}, ABSTRACT = {We introduce a flexible and powerful concept for reconstructing arbitrary views from multiple source images on the fly. Our approach is based on a Lumigraph structure with per-pixel depth values, and generalizes the classical two-plane parameterized light fields and Lumigraphs. With our technique, it is possible to render arbitrary views of time-varying, non-diffuse scenes at interactive frame rates, and it allows using any kind of sensor that yields images with dense depth information. We demonstrate the flexibility and efficiency of our approach through various examples.}, } @INPROCEEDINGS{schlosser:swqss:2005, AUTHOR = {Schlosser, Gregor and Hesser, J{\"u}rgen and Zeilfelder, Frank and R{\"o}ssl, Christian and M{\"a}nner, Reinhard and N{\"u}rnberger, G{\"u}nther and Seidel, Hans-Peter}, EDITOR = {Silva, Cl{\'a}udio T. and Gr{\"o}ller, Eduard and Rushmeier, Holly}, TITLE = {Fast Visualization by Shear-Warp on Quadratic Super-Spline Models Using Wavelet Data Decompositions}, BOOKTITLE = {16th IEEE Visualization Conference (VIS 2005)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Minneapolis, MN, USA}, PUBLISHER = {IEEE}, ISBN = {0-7803-9462-3}, YEAR = {2005}, PAGES = {351--358}, } @INPROCEEDINGS{SchmaltzDAGM2007, AUTHOR = {Schmaltz, Christian and Rosenhahn, Bodo and Brox, Thomas and Weickert, Joachim and Cremers, Daniel and Wietzke, Lennart and Sommer, Gerald}, EDITOR = {Hamprecht, Fred and Schn{\"o}rr, Christoph and Jaehne, Bernd}, TITLE = {Occlusion Modeling by Tracking Multiple Objects}, BOOKTITLE = {Pattern Recognition 2007}, PADDRESS = {Heidelberg, Germany}, ADDRESS = {Heidelberg, Germany}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4713}, ISBN = {3-540-74933-0}, YEAR = {2007}, PAGES = {173--183}, } @ARTICLE{SchneidePixnosticsPalgrave2007, AUTHOR = {Schneidewind, J{\"o}rn and Sips, Mike and Keim, Daniel}, JOURNAL = {Information Visualization}, TITLE = {An Automated Approach for the Optimization of Pixel-based Visualizations}, NUMBER = {1}, PUBLISHER = {Palgrave Macmillan}, VOLUME = {6}, YEAR = {2007}, PAGES = {75--88}, } @ARTICLE{Schneider2000a, AUTHOR = {Labsik, Ulf and Kobbelt, Leif and Schneider, Robert and Seidel, Hans-Peter}, JOURNAL = {Computational Geometry: Theory and Applications}, TITLE = {Progressive Transmission of Subdivision Surfaces}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {1-3}, PUBLISHER = {Elsevier}, VOLUME = {15}, YEAR = {2000}, PAGES = {25--39}, } @INPROCEEDINGS{Schneider2000b, AUTHOR = {Schneider, Robert and Kobbelt, Leif}, EDITOR = {Laurent, Pierre-Jean and Sablonniere, Paul and Schumaker, Larry L.}, TITLE = {Discrete Fairing of Curves and Surfaces based on Linear Curvature Distribution}, BOOKTITLE = {Curve and Surface Design, Saint-Malo 1999}, PADDRESS = {Nashville, USA}, ADDRESS = {Saint-Malo, France}, PUBLISHER = {Vanderbilt University Press}, SERIES = {Innovations in Applied Mathematics}, ISBN = {0-8265-1356-5}, YEAR = {2000}, PAGES = {371--380}, } @INPROCEEDINGS{Schneider2000c, AUTHOR = {Schneider, Robert and Kobbelt, Leif}, EDITOR = {Martin, Ralph and Wang, Wenping}, TITLE = {Generating Fair Meshes with $G^1$ Boundary Conditions}, BOOKTITLE = {Proceedings of Geometric Modeling and Processing 2000 (GMP-00)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Hongkong, China}, PUBLISHER = {IEEE}, ISBN = {0-7695-0562-7}, YEAR = {2000}, PAGES = {251--261}, } @ARTICLE{Schneider2000Hermite, AUTHOR = {Schneider, Robert and Seidel, Hans-Peter}, JOURNAL = {Journal of Computational and Applied Mathematics}, TITLE = {Multiresolution analysis over triangles, based on quadratic {Hermite} interpolation}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {1/2}, PUBLISHER = {Elsevier}, VOLUME = {119}, ISBN = {0377-0427}, YEAR = {2000}, PAGES = {97--114}, } @ARTICLE{Schneider2001a, AUTHOR = {Schneider, Robert and Kobbelt, Leif}, JOURNAL = {Computer Aided Geometric Design}, TITLE = {Geometric Fairing of Irregular Meshes for Free-Form Surface Design}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {4}, PUBLISHER = {Elsevier}, MONTH = {May}, VOLUME = {18}, ISBN = {0167-8396}, YEAR = {2001}, PAGES = {359--379}, } @INPROCEEDINGS{Schneider2001b, AUTHOR = {Schneider, Robert and Kobbelt, Leif and Seidel, Hans-Peter}, EDITOR = {Lyche, Tom and Schumaker, Larry L.}, TITLE = {Improved Bi-Laplacian Mesh Fairing}, BOOKTITLE = {Mathematical Methods for Curves and Surfaces: Oslo 2000}, PADDRESS = {Nashville, USA}, ADDRESS = {Oslo, Norway}, PUBLISHER = {Vanderbilt University}, SERIES = {Innovations in Applied Mathematics}, ISBN = {0-8265-1378-6}, YEAR = {2001}, PAGES = {445--454}, } @ARTICLE{Schneider2001c, AUTHOR = {Schneider, Robert and Kobbelt, Leif}, JOURNAL = {Computer-Aided Design}, TITLE = {Mesh Fairing based on an Intrinsic {PDE} Approach}, ADDRESS = {Amsterdam, The Netherlands}, NUMBER = {11}, PUBLISHER = {Elsevier}, MONTH = {September}, VOLUME = {33}, ISBN = {0010-4485}, YEAR = {2001}, PAGES = {767--777}, NOTE = {To appear}, } @INPROCEEDINGS{SchoelBlanzSteinke2005, AUTHOR = {Sch{\"o}lkopf, Bernhard and Blanz, Volker and Steinke, Florian}, TITLE = {Object correspondence as a machine learning problem.}, BOOKTITLE = {International Conference on Machine Learning ICML}, PADDRESS = {New York}, ADDRESS = {Bonn, Germany}, PUBLISHER = {ACM Press}, YEAR = {2005}, PAGES = {776--783}, } @INPROCEEDINGS{Schoenleben2013, AUTHOR = {Schoenleben, Oliver and Oulasvirta, Antti}, TITLE = {Sandwich keyboard: fast ten-finger typing on a mobile device with adaptive touch sensing on the back side}, BOOKTITLE = {Proceedings of the 15th international conference on Human-computer interaction with mobile devices and services}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, USA}, ADDRESS = {Munich, Germany}, PUBLISHER = {ACM}, YEAR = {2013}, PAGES = {175--178}, } @ARTICLE{Scholz2009, AUTHOR = {Scholz, Volker and El-Abed, Sascha and Seidel, Hans-Peter and Magnor, Marcus}, JOURNAL = {Computer Graphics Forum}, TITLE = {Editing object behavious in video sequences}, ADDRESS = {Oxford, UK}, NUMBER = {6}, PUBLISHER = {Blackwell}, VOLUME = {28}, ISBN = {0167-7055}, DOI = {10.1111/j.1467-8659.2009.01413.x}, YEAR = {2009}, PAGES = {1632--1643}, } @INPROCEEDINGS{Schoner2004, AUTHOR = {Schoner, Jeffrey L. and Lang, Jochen and Seidel, Hans-Peter}, EDITOR = {Cani, Marie-Paule and Slater, Mel}, TITLE = {Measurement-Based Interactive Simulation of Viscoelastic Solids}, BOOKTITLE = {The European Association for Computer Graphics 25th Annual Conference EUROGRAPHICS 2004}, ORGANIZATION = {Eurographics}, PADDRESS = {Oxford, UK}, ADDRESS = {Grenoble, France}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, SERIES = {Computer Graphics Forum}, VOLUME = {23}, ISBN = {0167-7055}, YEAR = {2004}, PAGES = {547--556}, } @INPROCEEDINGS{SchreiberGM_FingerPrint_ISMIR, AUTHOR = {Schreiber, Hendrik and Grosche, Peter and M{\"u}ller, Meinard}, TITLE = {A Re-ordering Strategy for Accelerating Index-based Audio Fingerprinting}, BOOKTITLE = {2th International Society for Music Information Retrieval Conference (ISMIR 2011)}, PADDRESS = {s.l.}, ADDRESS = {Miami, USA}, PUBLISHER = {ISMIR}, YEAR = {2011}, PAGES = {127--132}, } @INPROCEEDINGS{SchSteiBlanz2005, AUTHOR = {Sch{\"o}lkopf, Bernhard and Steinke, Florian and Blanz, Volker}, EDITOR = {de Raedt, Luc and Wrobel, Stefan}, TITLE = {Object correspondence as a machine learning problem}, BOOKTITLE = {International Conference on Machine Learning ICML 2005}, ORGANIZATION = {ACM}, PADDRESS = {New York, USA}, ADDRESS = {Bonn, Germany}, PUBLISHER = {ACM}, SERIES = {-}, ISBN = {1-59593-180-5}, YEAR = {2005}, PAGES = {776--783}, } @INPROCEEDINGS{SchTheDavThr08, AUTHOR = {Schuon, S. and Theobalt, Christian and Davis, J. and Thrun, S.}, TITLE = {High-quality Scanning using Time-of-Flight Depth Superresolution}, BOOKTITLE = {IEEE CVPR Workshop on Time-Of-Flight Computer Vision}, PADDRESS = {Piscataway, USA}, ADDRESS = {Anchorage, USA}, PUBLISHER = {IEEE}, YEAR = {2008}, PAGES = {1--7}, } @MASTERSTHESIS{Schueler:3RK:2001, AUTHOR = {Sch{\"u}ler, Pascal}, TITLE = {{3D-Rekonstruktion aus kalibrierten Bilddaten mittels "Space-Carving"}}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, MONTH = {April}, YEAR = {2001}, } @INPROCEEDINGS{Schultz2006, AUTHOR = {Schultz, Thomas and Burgeth, Bernhard and Weickert, Joachim}, EDITOR = {Bebis, George and Boyle, Richard and Parvin, Bahram and Koracin, Darko and Remagnino, Paolo and Nefian, Ara and Meenakshisundaram, Gopi and Pascucci, Valerio and Zara, Jiri and Molineros, Jose and Theisel, Holger and Malzbender, Tom}, TITLE = {Flexible Segmentation and Smoothing of {DT-MRI} Fields Through a Customizable Structure Tensor}, BOOKTITLE = {Advances in Visual Computing : second International Symposium, ISVC 2006. - Part 1}, PADDRESS = {Berlin, Germany}, ADDRESS = {Lake Tahoe, NV, USA}, PUBLISHER = {Springer}, MONTH = {October}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4291}, ISBN = {3-540-48628-3}, DOI = {10.1007/11919476_46}, YEAR = {2006}, PAGES = {455--464}, ABSTRACT = {We present a novel structure tensor for matrix-valued images. It allows for user defined parameters that add flexibility to a number of image processing algorithms for the segmentation and smoothing of tensor fields. We provide a thorough theoretical derivation of the new structure tensor, including a proof of the equivalence of its unweighted version to the existing structure tensor from the literature. Finally, we demonstrate its advantages for segmentation and smoothing, both on synthetic tensor fields and on real DT-MRI data.}, } @INPROCEEDINGS{Schultz2007EV, AUTHOR = {Schultz, Thomas and Theisel, Holger and Seidel, Hans-Peter}, EDITOR = {Museth, Ken and M{\"o}ller, Torsten and Ynnerman, Anders}, TITLE = {Segmentation of {DT-MRI} Anisotropy Isosurfaces}, BOOKTITLE = {EuroVis07: Joint Eurographics - IEEE VGTC Symposium on Visualization 2007}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Norrk{\"o}ping, Sweden}, PUBLISHER = {Eurographics}, MONTH = {May}, SERIES = {VisSym/ EUROVIS: Joint Eurographics - IEEE VGTC Symposium on Visualization}, ISBN = {1-56881-362-2}, YEAR = {2007}, PAGES = {187--194}, ABSTRACT = { While isosurfaces of anisotropy measures for data from diffusion tensor magnetic resonance imaging (DT-MRI) are known to depict major anatomical structures, the anisotropy metric reduces the rich tensor data to a simple scalar field. In this work, we suggest that the part of the data which has been ignored by the metric can be used to segment anisotropy isosurfaces into anatomically meaningful regions. For the implementation, we propose an edge-based watershed method that adapts and extends a method from curvature-based mesh segmentation. Finally, we use the segmentation results to enhance visualization of the data.}, } @ARTICLE{Schultz2007Vis, AUTHOR = {Schultz, Thomas and Theisel, Holger and Seidel, Hans-Peter}, JOURNAL = {IEEE Transactions on Visualization and Computer Graphics (Proc. IEEE Visualization)}, TITLE = {Topological Visualization of Brain Diffusion {MRI} Data}, ADDRESS = {Los Alamitos, CA, USA}, NUMBER = {6}, PUBLISHER = {IEEE Computer Society}, MONTH = {November}, VOLUME = {13}, ISBN = {1077-2626}, DOI = {10.1109/TVCG.2007.70602}, YEAR = {2007}, PAGES = {1496--1503}, ABSTRACT = {Topological methods give concise and expressive visual representations of flow fields. The present work suggests a comparable method for the visualization of human brain diffusion MRI data. We explore existing techniques for the topological analysis of generic tensor fields, but find them inappropriate for diffusion MRI data. Thus, we propose a novel approach that considers the asymptotic behavior of a probabilistic fiber tracking method and define analogs of the basic concepts of flow topology, like critical points, basins, and faces, with interpretations in terms of brain anatomy. The resulting features are fuzzy, reflecting the uncertainty inherent in any connectivity estimate from diffusion imaging. We describe an algorithm to extract the new type of features, demonstrate its robustness under noise, and present results for two regions in a diffusion MRI dataset to illustrate that the method allows a meaningful visual analysis of probabilistic fiber tracking results.}, } @INPROCEEDINGS{Schultz2008DAGM, AUTHOR = {Schultz, Thomas and Seidel, Hans-Peter}, EDITOR = {Rigoll, Gerhard}, TITLE = {Using Eigenvalue Derivatives for Edge Detection in {DT-MRI} Data}, BOOKTITLE = {Pattern Recognition}, ORGANIZATION = {Deutsche Arbeitsgemeinschaft Mustererkennung (DAGM)}, PADDRESS = {Berlin}, ADDRESS = {Munich, Germany}, PUBLISHER = {Springer}, MONTH = {June}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {5096}, ISBN = {978-3-540-69320-8}, DOI = {10.1007/978-3-540-69321-5_20}, YEAR = {2008}, PAGES = {193--202}, ABSTRACT = { This paper introduces eigenvalue derivatives as a fundamental tool to discern the different types of edges present in matrix-valued images. It reviews basic results from perturbation theory, which allow one to compute such derivatives, and shows how they can be used to obtain novel edge detectors for matrix-valued images. It is demonstrated that previous methods for edge detection in matrix-valued images are simplified by considering them in terms of eigenvalue derivatives. Moreover, eigenvalue derivatives are used to analyze and refine the recently proposed Log-Euclidean edge detector. Application examples focus on data from diffusion tensor magnetic resonance imaging (DT-MRI).}, } @ARTICLE{Schultz2008EV, AUTHOR = {Schultz, Thomas and Sauber, Natascha and Anwander, Alfred and Theisel, Holger and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum (Proc. EuroVis)}, TITLE = {Virtual Klingler Dissection: Putting Fibers into Context}, ADDRESS = {Oxford, UK}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {May}, VOLUME = {27}, ISBN = {0167-7055}, YEAR = {2008}, PAGES = {1063--1070}, ABSTRACT = { Fiber tracking is a standard tool to estimate the course of major white matter tracts from diffusion tensor magnetic resonance imaging (DT-MRI) data. In this work, we aim at supporting the visual analysis of classical streamlines from fiber tracking by integrating context from anatomical data, acquired by a $T_1$-weighted MRI measurement. To this end, we suggest a novel visualization metaphor, which is based on data-driven deformation of geometry and has been inspired by a technique for anatomical fiber preparation known as Klingler dissection. We demonstrate that our method conveys the relation between streamlines and surrounding anatomical features more effectively than standard techniques like slice images and direct volume rendering. The method works automatically, but its GPU-based implementation allows for additional, intuitive interaction.}, } @ARTICLE{Schultz2008Vis, AUTHOR = {Schultz, Thomas and Seidel, Hans-Peter}, JOURNAL = {IEEE Transactions on Visualization and Computer Graphics (Proc. IEEE Visualization)}, TITLE = {Estimating Crossing Fibers: A Tensor Decomposition Approach}, ADDRESS = {Los Alamitos, USA}, NUMBER = {6}, PUBLISHER = {IEEE Computer Society}, VOLUME = {14}, ISBN = {1077-2626}, DOI = {10.1109/TVCG.2008.128}, YEAR = {2008}, PAGES = {1635--1642}, ABSTRACT = {Diffusion weighted magnetic resonance imaging is a unique tool for non-invasive investigation of major nerve fiber tracts. Since the popular diffusion tensor (DT-MRI) model is limited to voxels with a single fiber direction, a number of high angular resolution techniques have been proposed to provide information about more diverse fiber distributions. Two such approaches are Q-Ball imaging and spherical deconvolution, which produce orientation distribution functions (ODFs) on the sphere. For analysis and visualization, the maxima of these functions have been used as principal directions, even though the results are known to be biased in case of crossing fiber tracts. In this paper, we present a more reliable technique for extracting discrete orientations from continuous ODFs, which is based on decomposing their higher-order tensor representation into an isotropic component, several rank-1 terms, and a small residual. Comparing to ground truth in synthetic data shows that the novel method reduces bias and reliably reconstructs crossing fibers which are not resolved as individual maxima in the ODF. We present results on both Q-Ball and spherical deconvolution data and demonstrate that the estimated directions allow for plausible fiber tracking in a real data set.}, } @INCOLLECTION{Schultz2009Dag, AUTHOR = {Schultz, Thomas and Weickert, Joachim and Seidel, Hans-Peter}, EDITOR = {Laidlaw, David H. and Weickert, Joachim}, TITLE = {A Higher-Order Structure Tensor}, BOOKTITLE = {Visualization and Processing of Tensor Fields : Advances and Perspectives}, CHAPTER = {V}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Springer}, SERIES = {Mathematics and Visualization}, DOI = {10.1007/978-3-540-88378-4_13}, YEAR = {2009}, PAGES = {263--279}, ABSTRACT = { Structure tensors are a common tool for orientation estimation in image processing and computer vision. We present a generalization of the traditional second-order model to a higher-order structure tensor (HOST), which is able to model more than one significant orientation, as found in corners, junctions, and multi-channel images. We provide a theoretical analysis and a number of mathematical tools that facilitate practical use of the HOST, visualize it using a novel glyph for higher-order tensors, and demonstrate how it can be applied in an improved integrated edge, corner, and junction detector.}, } @PHDTHESIS{Schultz:PhD09, AUTHOR = {Schultz, Thomas}, TITLE = {Feature Extraction for Visual Analysis of DW-MRI Data}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {June}, YEAR = {2009}, ABSTRACT = {Diffusion Weighted Magnetic Resonance Imaging (DW-MRI) is a recent modality to investigate the major neuronal pathways of the human brain. However, the rich DW-MRI datasets cannot be interpreted without proper preprocessing. In order to achieve under- standable visualizations, this dissertation reduces the complex data to relevant features. The first part is inspired by topological features in flow data. Novel features reconstruct fuzzy fiber bundle geometry from probabilistic tractography results. The topological prop- erties of existing features that extract the skeleton of white matter tracts are clarified, and the core of regions with planar diffusion is visualized. The second part builds on methods from computer vision. Relevant boundaries in the data are identified via regularized eigenvalue derivatives, and boundary information is used to segment anisotropy isosurfaces into meaningful regions. A higher-order structure tensor is shown to be an accurate descriptor of local structure in diffusion data. The third part is concerned with fiber tracking. Streamline visualizations are improved by adding features from structural MRI in a way that emphasizes the relation between the two types of data, and the accuracy of streamlines in high angular resolution data is increased by modeling the estimation of crossing fiber bundles as a low-rank tensor approximation problem.}, } @ARTICLE{Schultz:TVCG10, AUTHOR = {Schultz, Thomas and Theisel, Holger and Seidel, Hans-Peter}, JOURNAL = {IEEE Transactions on Visualization and Computer Graphics}, TITLE = {Crease Surfaces: From Theory to Extraction and Application to Diffusion Tensor {MRI}}, ADDRESS = {Piscataway, NJ}, NUMBER = {1}, PUBLISHER = {IEEE}, MONTH = {January}, VOLUME = {16}, ISBN = {1077-2626}, DOI = {10.1109/TVCG.2009.44}, YEAR = {2010}, PAGES = {109--119}, ABSTRACT = {Crease surfaces are two-dimensional manifolds along which a scalar field assumes a local maximum (ridge) or a local minimum (valley) in a constrained space. Unlike isosurfaces, they are able to capture extremal structures in the data. Creases have a long tradition in image processing and computer vision, and have recently become a popular tool for visualization. When extracting crease surfaces, degeneracies of the Hessian (i.e., lines along which two eigenvalues are equal) have so far been ignored. We show that these loci, however, have two important consequences for the topology of crease surfaces: First, creases are bounded not only by a side constraint on eigenvalue sign, but also by Hessian degeneracies. Second, crease surfaces are not, in general, orientable. We describe an efficient algorithm for the extraction of crease surfaces which takes these insights into account and demonstrate that it produces more accurate results than previous approaches. Finally, we show that diffusion tensor magnetic resonance imaging (DT-MRI) stream surfaces, which were previously used for the analysis of planar regions in diffusion tensor MRI data, are mathematically ill-defined. As an example application of our method, creases in a measure of planarity are presented as a viable substitute.}, } @ARTICLE{Schulz2014, AUTHOR = {Schulz, Christian and Seidel, Hans-Peter and Hildebrandt, Klaus}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Animating Deformable Objects using Sparse Spacetime Constraints}, NUMBER = {4}, PUBLISHER = {ACM}, MONTH = {July}, VOLUME = {33}, DOI = {10.1145/2601097.2601156}, YEAR = {2014}, PAGES = {109:1--10}, } @ARTICLE{Schulze2014, AUTHOR = {Schulze, Maik and Martinez Esturo, Janick and G{\"u}nther, Tobias and R{\"o}ssl, Christian and Seidel, Hans-Peter and Weinkauf, Tino}, JOURNAL = {Comput. Graph. Forum (Proc. EuroVis)}, TITLE = {Sets of Globally Optimal Stream Surfaces for Flow Visualization}, NUMBER = {3}, VOLUME = {33}, YEAR = {2014}, } @INPROCEEDINGS{SchwaneckeJuettler2000, AUTHOR = {Schwanecke, Ulrich and J{\"u}ttler, B.}, EDITOR = {Cohen, Albert and Rabut, Christophe and Schumaker, Larry L.}, TITLE = {A {B-spline} approach to {H}ermite subdivision}, BOOKTITLE = {Curve and surface fitting, Saint-Malo 1999}, PADDRESS = {Nashville, USA}, ADDRESS = {Saint-Malo}, PUBLISHER = {Vanderbilt University}, MONTH = {June}, SERIES = {Innovations in Applied Mathematics}, ISBN = {0-826-51357-3}, YEAR = {2000}, PAGES = {385--392}, } @INPROCEEDINGS{Schwanecke_2000:AERMS, AUTHOR = {Schwanecke, Ulrich and Kobbelt, Leif}, EDITOR = {Lyche, Tom and Schumaker, Larry L.}, TITLE = {Approximate envelope reconstruction for moving solids}, BOOKTITLE = {Mathematical Methods for Curves and Surfaces: Oslo 2000}, PADDRESS = {Nashville, USA}, ADDRESS = {Oslo, Norway}, PUBLISHER = {Vanderbilt University}, SERIES = {Innovations in Applied Mathematics}, ISBN = {0-8265-1378-6}, YEAR = {2001}, PAGES = {455--466}, } @INPROCEEDINGS{Schwarz:2009:OnPredictingPopping, AUTHOR = {Schwarz, Michael and Stamminger, Marc}, EDITOR = {Bodenheimer, Bobby and O'Sullivan, Carol and Spencer, Stephen N.}, TITLE = {On predicting visual popping in dynamic scenes}, BOOKTITLE = {Proceedings APGV 2009 : Symposium on Applied Perception in Graphics and Visualization}, PADDRESS = {New York, NY}, ADDRESS = {Chania, Greece}, NUMBER = {4}, PUBLISHER = {ACM}, SERIES = {ACM Transactions on Applied Perception}, VOLUME = {6}, ISBN = {978-1-60558-743-1}, DOI = {10.1145/1620993.1621012}, YEAR = {2009}, PAGES = {93--100}, } @PROCEEDINGS{Scopigno:2002:3DA, AUTHOR = {Scopigno, Roberto and Andujar, Carlos and Goesele, Michael and Lensch, Hendrik P. A.}, EDITOR = {Scopigno, Roberto and Andujar, Carlos and Goesele, Michael and Lensch, Hendrik P. A.}, TITLE = {{3D Data Acquisition -- Eurographics 2002 Tutorial Notes}}, BOOKTITLE = {Tutorial Notes of the Eurographics 2002}, TYPE = {Tutorial Notes}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Eurographics}, VOLUME = {T1}, ISBN = {1017-4565}, YEAR = {2002}, PAGES = {71}, ABSTRACT = {3D scanners and image acquisition systems are rapidly becoming more affordable and allow to build highly accurate models of real 3D objects in a cost- and time-effective manner. This tutorial will present the potential of this technology, review the state of the art in model acquisition methods, and will discuss the 3D acquisition pipeline from physical acquisition until the final digital model. First, different optical scanning techniques (e.g. structured light triangulation, time-of-flight approaches) will briefly be presented. Other acquisition related issues including the design of the scanning studio will be discussed and evaluated. In the area of registration, we will consider both the problems of initially aligning individual scans, and of refining this alignment with variations of the Iterative Closest Point method. For scan integration and mesh reconstruction, we will compare various methods for computing, interpolating and approximating surfaces. We will then look at various ways in which surface properties such as color and reflectance can be extracted from acquired imagery. Finally, we will examine techniques for the efficient management and rendering of very large, attribute-rich meshes, including methods for the construction of simplified triangle-based representation and sample-based rendering approaches.}, } @ARTICLE{SDC*2007, AUTHOR = {Song, Mingli and Dong, Zhao and Theobalt, Christian and Wang, Huiqiong and Liu, Zicheng and Seidel, Hans-Peter}, JOURNAL = {IEEE Transactions on Multimedia}, TITLE = {A General Framework for Efficient 2D and 3D Facial Expression Analogy}, NUMBER = {7}, PUBLISHER = {IEEE Signal Processing Society}, MONTH = {November}, VOLUME = {9}, ISBN = {1520-9210}, DOI = {10.1109/TMM.2007.906591}, YEAR = {2007}, PAGES = {1384--1395}, ABSTRACT = {Facial expression analogy provides computer animation professionals with a tool to map expressions of an arbitrary source face onto an arbitrary target face. In the recent past, several algorithms have been presented in the literature that aim at putting the expression analogy paradigm into practice. Some of these methods exclusively handle expression mapping between 3D face models, while others enable the transfer of expressions between images of faces only. None of them, however, represents a more general framework that can be applied to either of these two face representations. In this paper, we describe a novel generic method for analogy-based facial animation that employs the same efficient framework to transfer facial expressions between arbitrary 3D face models, as well as between images of performer’s faces. We propose a novel geometry encoding for triangle meshes, vertex-tent-coordinates, that enables us to formulate expression transfer in the 2D and the 3D case as a solution to a simple system of linear equations. Our experiments show that our method outperforms many previous analogy-based animation approaches in terms of achieved animation quality, computation time and generality.}, } @ARTICLE{sdhi03, AUTHOR = {Sabin, Malcolm and Dodgson, Neil A. and Hassan, Mohamed and Ivrissimtzis, Ioannis}, JOURNAL = {Computer Aided Design}, TITLE = {Curvature behaviours at extraordinary points of subdivision surfaces}, ADDRESS = {Amsterdam, The Netherlands}, PUBLISHER = {Elsevier}, MONTH = {September}, VOLUME = {35}, ISBN = {0010-4485}, YEAR = {2003}, PAGES = {1047--1051}, } @ARTICLE{Seidel2008-ECMCaI, AUTHOR = {Seidel, Hans-Peter}, JOURNAL = {IT Information Technology}, TITLE = {Excellence Cluster "Multimodal Computing and Interaction"}, ADDRESS = {Oldenbourg}, NUMBER = {04}, PUBLISHER = {Oldenbourg Wissenschaftsverlag M.}, VOLUME = {50}, ISBN = {16112776}, YEAR = {2008}, PAGES = {253--257}, } @INPROCEEDINGS{SeidelYLLI2006, AUTHOR = {Yoon, Mincheol and Lee, Yunjin and Lee, Seungyong and Ivrissimtzis, Ioannis and Seidel, Hans-Peter}, EDITOR = {Kim, Myung-Soo and Shimada, Kenji}, TITLE = {Ensembles for Normal and Surface Reconstructions}, BOOKTITLE = {Geometric Modeling and Processing - GMP 2006, 4th International Conference,}, PADDRESS = {Berlin, Germany}, ADDRESS = {Pittsburgh, PA, USA}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4077}, ISBN = {3-540-36711-X}, YEAR = {2006}, PAGES = {17--33}, ABSTRACT = {The majority of the existing techniques for surface reconstruction and the closely related problem of normal estimation are deterministic. Their main advantages are the speed and, given a reasonably good initial input, the high quality of the reconstructed surfaces. Nevertheless, their deterministic nature may hinder them from effectively handling incomplete data with noise and outliers. In our previous work [1], we applied a statistical technique, called ensembles, to the problem of surface reconstruction. We showed that an ensemble can improve the performance of a deterministic algorithm by putting it into a statistics based probabilistic setting. In this paper, with several experiments, we further study the suitability of ensembles in surface reconstruction, and also apply ensembles to normal estimation. We experimented with a widely used normal estimation technique [2] and Multi-level Partitions of Unity implicits for surface reconstruction [3], showing that normal and surface ensembles can successfully be combined to handle noisy point sets. }, } @INCOLLECTION{Seidel:2000:P3I, AUTHOR = {Seidel, Hans-Peter}, EDITOR = {Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich}, TITLE = {Realistic Rendering}, BOOKTITLE = {Principles of 3D Image Analysis and Synthesis}, CHAPTER = {5}, ADDRESS = {Boston, USA}, PUBLISHER = {Kluwer}, MONTH = {January}, ISBN = {0-7923-7850-4}, YEAR = {2000}, PAGES = {203--241}, } @ARTICLE{Sen:2005:DP, AUTHOR = {Sen, Pradeep and Chen, Billy and Garg, Gaurav Garg and Marschner, Steve and Horowitz, Mark and Levoy, Marc and Lensch, Hendrik P. A.}, JOURNAL = {ACM Trans. on Graphics (Proc. SIGGRAPH 2005)}, TITLE = {Dual Photography}, ADDRESS = {New York, NY, USA}, NUMBER = {3}, PUBLISHER = {ACM Press}, MONTH = {August}, VOLUME = {24}, ISBN = {0730-0301}, YEAR = {2005}, PAGES = {745--755}, } @INPROCEEDINGS{SerraMGA12_BoundaryDetection_AAAI, AUTHOR = {Serr{\`a}, Joan and M{\"u}ller, Meinard and Grosche, Peter and Arcos, Josep Lluis}, TITLE = {Unsupervised detection of music boundaries by time series structure features}, BOOKTITLE = {Proceedings of the AAAI International Conference on Artificial Intelligence}, PADDRESS = {Palo Alto, Calif.-}, ADDRESS = {Toronto, Ontario, Canada}, PUBLISHER = {AIII}, YEAR = {2012}, PAGES = {1613--1619}, } @INPROCEEDINGS{ShadowCourseNotes:2009, AUTHOR = {Eisemann, Elmar and Assarsson, Ulf and Schwarz, Michael and Wimmer, Michael}, TITLE = {Casting shadows in real time}, BOOKTITLE = {ACM SIGGRAPH ASIA 2009 Courses}, PADDRESS = {New York, NY}, ADDRESS = {Yokohama, Japan}, PUBLISHER = {ACM}, DOI = {10.1145/1665817.1722963}, YEAR = {2009}, PAGES = {XIII,134}, ABSTRACT = {Shadows are crucial for enhancing realism, and they provide important visual cues. In recent years, many important contributions have been made in representation of both hard shadows and soft shadows. With the tremendous increase of computational power and capabilities of graphics hardware, high-quality real-time shadows are now a reachable goal. But with the growing volume of available choices, it is particularly difficult to pick the right solution and assess product shortcomings. Because currently there is no ideal approach available, algorithms should be selected in accordance with the context in which shadows are produced. The possibilities range across a wide spectrum, from very approximate but really efficient to slower but accurate, adapted only to smaller or only to larger sources, addressing directional lights or positional lights, or involving GPU or CPU-heavy computations. This course is a guide to better understanding of the limitations and failure cases, advantages and disadvantages, and suitability of the algorithms for different application scenarios. It focuses on real-time, interactive solutions but also discusses offline approaches.}, } @INPROCEEDINGS{ShGaSt_09tracking, AUTHOR = {Shaheen, Mohammed and Gall, Juergen and Strzodka, Robert and Seidel, Hans-Peter}, TITLE = {A comparison of 3d model-based tracking approaches for human motion capture in uncontrolled environments}, BOOKTITLE = {IEEE Workshop on Applications of Computer Vision (WACV'09)}, PADDRESS = {New York, NY, USA}, ADDRESS = {Snowbird, Utah}, PUBLISHER = {IEEE}, MONTH = {December}, YEAR = {2009}, PAGES = {1--8}, ABSTRACT = {This work addresses the problem of tracking humans with skeleton-based shape models where video footage is acquired by multiple cameras. Since the shape deforma- tions are parameterized by the skeleton, the position, ori- entation, and configuration of the human skeleton are esti- mated such that the deformed shape model is best explained by the image data. To solve this problem, several algorithms have been proposed over the last years. The approaches usually rely on filtering, local optimization, or global opti- mization. The global optimization algorithms can be further divided into single hypothesis (SHO) and multiple hypothe- sis optimization (MHO). We briefly compare the underlying mathematical models and evaluate the performance of one representative algorithm for each class. Furthermore, we compare several likelihoods and parameter settings with re- spect to accuracy and computation cost. A thorough evalua- tion is performed on two sequences with uncontrolled light- ing conditions and non-static background. In addition, we demonstrate the impact of the likelihood on the HumanEva benchmark. Our results provide a guidance on algorithm design for different applications related to human motion capture.}, } @INPROCEEDINGS{shi06a, AUTHOR = {Shi, Kuangyu and Theisel, Holger and Weinkauf, Tino and Hauser, Helwig and Hege, Hans-Christian and Seidel, Hans-Peter}, EDITOR = {Sousa Santos, Beatriz and Ertl, Thomas and Joy, Kenneth I. and Fellner, Dieter W. and M{\"o}ller, Torsten and Spencer, Stephen N.}, TITLE = {Path Line Oriented Topology for Periodic {2D} Time-Dependent Vector Fields}, BOOKTITLE = {EUROVIS 2006 : Eurographics / IEEE VGTC Symposium on Visualization}, ORGANIZATION = {IEEE VGTC,EG,}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Lisbon, Portugal}, PUBLISHER = {Eurographics}, ISBN = {3-905673-31-2}, YEAR = {2006}, PAGES = {139--146}, ABSTRACT = {This paper presents an approach to extracting a path line oriented topological segmentation for periodic 2D time-dependent vector fields. Topological methods aiming in capturing the asymptotic behavior of path lines rarely exist because path lines are usually only defined over a fixed time-interval, making statements about their asymptotic behavior impossible. For the data class of periodic vector fields, this restriction does not apply any more. Our approach detects critical path lines as well as basins from which the path lines converge to the critical ones. We demonstrate our approach on a number of test data sets.}, } @ARTICLE{Shi2006, AUTHOR = {Shi, Kuangyu and Theisel, Holger and Seidel, Hans-Peter}, JOURNAL = {journal of WSCG}, TITLE = {Extracting Separation Surfaces of Path Line Oriented Topology in Periodic 2D Time-Dependent Vector Fields}, ADDRESS = {Na Mazinach 9,322 00 Plzen,Czech Republic}, NUMBER = {1-3}, PUBLISHER = {UNION Agency Science Press}, MONTH = {February}, VOLUME = {15}, ISBN = {1213-6972}, YEAR = {2007}, PAGES = {75--82}, ABSTRACT = {This paper presents an approach to extracting the separation surfaces from periodic 2D time-dependent vector fields based on a recently introduced path line oriented topology. This topology is based on critical path lines which repeat the same spatial cycle per time period. Around those path lines there are areas of similar asymptotic flow behavior (basins) which are captured by a 2D Poincar{\'e} map as a discrete dynamical system. Due to pseudo discontinuities in this map and the discrete integration scheme, separatrices between the basins can’t be obtained as integral curves. Instead we choose a point-wise approach to segment the Poincar{\'e} map and apply image analysis algorithms to extract the 2D separation curves. Starting from those curves we integrate separation surfaces which partition the periodic 2D time-dependent vector field into areas of similar path line behavior. We apply our approach to a number of data sets to demonstrate its utility.}, } @INPROCEEDINGS{Shi2007b, AUTHOR = {Shi, Kuangyu and Theisel, Holger and Hauser, Helwig and Weinkauf, Tino and Matkovic, Kresimir and Hege, Hans-Christian and Seidel, Hans-Peter}, EDITOR = {Hege, Hans-Christian and Polthier, Konrad and Scheuermann, Gerik}, TITLE = {Path Line Attributes - an Information Visualization Approach to Analyzing the Dynamic Behavior of {3D} Time-Dependent Flow Fields}, BOOKTITLE = {Topology-Based Methods in Visualization II}, PADDRESS = {Berlin, Germany}, ADDRESS = {Grimma, Germany}, PUBLISHER = {Springer}, SERIES = {Mathematics and Visualization}, ISBN = {978-3-540-88605-1}, DOI = {10.1007/978-3-540-88606-8_6}, YEAR = {2009}, PAGES = {75--88}, ABSTRACT = {We describe an approach to visually analyzing the dynamic behavior of 3D time-dependent flow fields by considering the behavior of the path lines. At selected positions in the 4D space-time domain, we compute a number of local and global properties of path lines describing relevant features of them. The resulting multivariate data set is analyzed by applying state-of-the-art information visualization approaches in the sense of a set of linked views (scatter plots, parallel coordinates, etc.) with interactive brushing and focus+context visualization. The selected path lines with certain properties are integrated and visualized as colored 3D curves. This approach allows an interactive exploration of intricate 4D flow structures. We apply our method to a number of flow data sets and describe how path line attributes are used for describing characteristic features of these flows.}, } @INPROCEEDINGS{ShiPacificVIS2008, AUTHOR = {Shi, Kuangyu and Theisel, Holger and Weinkauf, Tino and Hege, Hans-Christian and Seidel, Hans-Peter}, TITLE = {Finite-Time Transport Structures of Flow Fields}, BOOKTITLE = {Proceedings of the IEEE VGTC Pacific Visualization Symposium (Pacific Vis 2008)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Kyoto, Japan}, PUBLISHER = {IEEE}, YEAR = {2008}, PAGES = {63--70}, } @INPROCEEDINGS{ShSt_12NUCORALS, AUTHOR = {Shaheen, Mohammed and Strzodka, Robert}, TITLE = {NUMA Aware Iterative Stencil Computations on Many-Core Systems}, BOOKTITLE = {26th IEEE Int. Parallel and Distributed Processing Symposium}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Shanghai, China}, PUBLISHER = {IEEE}, MONTH = {May}, DOI = {10.1109/IPDPS.2012.50}, YEAR = {2012}, PAGES = {461--473}, } @ARTICLE{sig03obats, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander and Alexa, Marc and Turk, Greg and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Multi-level Partition of Unity Implicits}, ADDRESS = {New York, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {July}, VOLUME = {22}, YEAR = {2003}, PAGES = {463--470}, NOTE = {(Proc. ACM SIGGRAPH ' 03)}, ABSTRACT = {We present a shape representation, the {\em multi-level partition of unity} implicit surface, that allows us to construct surface models from very large sets of points. There are three key ingredients to our approach: 1) piecewise quadratic functions that capture the local shape of the surface, 2) weighting functions (the partitions of unity) that blend together these local shape functions, and 3) an octree subdivision method that adapts to variations in the complexity of the local shape. Our approach gives us considerable flexibility in the choice of local shape functions, and in particular we can accurately represent sharp features such as edges and corners by selecting appropriate shape functions. An error-controlled subdivision leads to an adaptive approximation whose time and memory consumption depends on the required accuracy. Due to the separation of local approximation and local blending, the representation is not global and can be created and evaluated rapidly.Because our surfaces are described using implicit functions, operations such as shape blending, offsets, deformations and CSG are simple to perform.}, } @INPROCEEDINGS{sig06sbs, AUTHOR = {Schall, Oliver and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Pfister, Hanspeter}, TITLE = {Feature-preserving Denoising of Time-varying Range Data}, BOOKTITLE = {SIGGRAPH 2006 Sketches and Applications}, PADDRESS = {New York, NY, USA}, ADDRESS = {Boston, Massachusetts, USA}, PUBLISHER = {ACM}, ISBN = {1-59593-364-6}, DOI = {http://doi.acm.org/10.1145/1179849.1179919}, YEAR = {2006}, PAGES = {56}, ABSTRACT = {We present a technique for accurate denoising of time-varying range data. It is inspired by the idea of similarity-based non-local image filtering and spatio-temporal bilateral filtering for video processing. We build upon both ideas and are to our knowledge the first method which extends them to time-varying geometric data. Our proposed algorithm is easy to implement, preserves fine shape features and produces an accurate and homogeneous smoothing result in the spatial and along the time domains.}, } @ARTICLE{SIGHullin2011, AUTHOR = {Hullin, Matthias B. and Eisemann, Elmar and Seidel, Hans-Peter and Lee, Sungkil}, JOURNAL = {ACM Transaction on Graphics (Proceedings SIGGRAPH 2011)}, TITLE = {Physically-based real-time lens flare rendering}, ADDRESS = {New York, NY}, NUMBER = {4}, PUBLISHER = {ACM}, MONTH = {July}, VOLUME = {30}, DOI = {10.1145/2010324.1965003}, YEAR = {2011}, PAGES = {1--10}, ABSTRACT = {Lens flare is caused by light passing through a photographic lens system in an unintended way. Often considered a degrading artifact, it has become a crucial component for realistic imagery and an artistic means that can even lead to an increased perceived brightness. So far, only costly offline processes allowed for convincing simulations of the complex light interactions. In this paper, we present a novel method to interactively compute physically-plausible flare renderings for photographic lenses. The underlying model covers many components that are important for realism, such as imperfections, chromatic and geometric lens aberrations, and antireflective lens coatings. Various acceleration strategies allow for a performance/quality tradeoff, making our technique applicable both in real-time applications and in high-quality production rendering. We further outline artistic extensions to our system.}, } @MASTERSTHESIS{Simkin2012_BachelorThesis, AUTHOR = {Simkin, Mark}, TITLE = {Short-time Audio Event Classification with Applications to the Evaluation of Sport Experiments}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Bachelor thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {July}, YEAR = {2012}, PAGES = {46}, ABSTRACT = {After conducting some experiment one always faces the tedious work of manually annotating and examining it. This is time consuming and error prone, especially if the experiment contains a large amount of relevant events that need to be annotated. In this thesis we tackle this problem for a real world experiment from the field of sport psychology, where two players have to pass a ball to each other as quickly as possible by bouncing it over a target zone. The experiments evaluation consists of the number of passes that bounced on the target zone in relation to the number of bounces that did not. Our main idea was to cover the target zone with a surface different from the one outside of it and use audio classification techniques to classify the bounces. To obtain the required audio data we made minor changes to the experiments setup by adding two microphones to it and changing the surface of the target zone. We conducted a number of experiments with this setup, extracted and analyzed all bounces from the audio data we retrieved and showed, that an automatic classification is very possible and feasible.}, } @MASTERSTHESIS{Simonovsky2010, AUTHOR = {Simonovsky, Martin}, TITLE = {Hand shape recognition using a {ToF} camera : an application to sign language}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {March}, YEAR = {2011}, PAGES = {IV,64}, ABSTRACT = {This master's thesis investigates the benefit of utilizing depth information acquired by a time-of-flight (ToF) camera for hand shape recognition from unrestricted viewpoints. Specifically, we assess the hypothesis that classical 3D content descriptors might be inappropriate for ToF depth images due to the 2.5D nature and noisiness of the data and possible expensive computations in 3D space. Instead, we extend 2D descriptors to make use of the additional semantics of depth images. Our system is based on the appearance-based retrieval paradigm, using a synthetic 3D hand model to generate its database. The system is able to run at interactive frame rates. For increased robustness, no color, intensity, or time coherence information is used. A novel, domain-specific algorithm for segmenting the forearm from the upper body based on reprojecting the acquired geometry into the lateral view is introduced. Moreover, three kinds of descriptors exploiting depth data are proposed and the made design choices are experimentally supported. The whole system is then evaluated on an American sign language fingerspelling dataset. However, the retrieval performance still leaves room for improvements. Several insights and possible reasons are discussed.}, } @MASTERSTHESIS{SimonSaschaBch2010, AUTHOR = {Simon, Sascha}, TITLE = {Interactive Exploration of the Network Behavior of Personal Machines}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Bachelor thesis}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {June}, YEAR = {2010}, PAGES = {32}, } @INPROCEEDINGS{SipsBioFeatureSelection2007, AUTHOR = {Fuchsberger, Christian and Chan, Sye-Min Christina and Ongarello, Stefano and Sips, Mike and Feuerstein, Isabel and Pelzer, Alexandre and Bonn, G{\"u}nther and Bartsch, Georg and Klocker, Helmut}, TITLE = {Visual Feature Selection in Biological Time-Series for Mass Spectrometry based Biomarker Discovery}, BOOKTITLE = {Workshop on Intelligent Data Analysis in BioMedicine and Pharmacology (IDAMAP 2007)}, PADDRESS = {Bethesda, MD, USA}, ADDRESS = {Amsterdam}, PUBLISHER = {American Medical Informatics Association}, YEAR = {2007}, PAGES = {1--4}, } @INPROCEEDINGS{SipsConsistencyEuroVis2009, AUTHOR = {Sips, Mike and Neubert, Boris and Lewis, John P. and Hanrahan, Pat}, EDITOR = {Hege, Hans-Christian and Hotz, Ingrid and Munzner, Tamara}, JOURNAL = {Computer Graphics Forum (Proc. EuroVis 2009)}, TITLE = {Selecting good views of high-dimensional data using class consistency}, BOOKTITLE = {EuroVis 2009 : Eurographics/ IEEE-VGTC Symposium on Visualization 2009}, PADDRESS = {Oxford}, ADDRESS = {Berlin, Germany}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {28}, YEAR = {2009}, PAGES = {831--838}, } @ARTICLE{SipsHighlightIJGIS2007, AUTHOR = {Sips, Mike and Schneidewind, J{\"orn} and Keim, Daniel}, JOURNAL = {International Journal of Geographical Information Science (IJGIS)}, TITLE = {Highlighting Space-Time Pattern: Effective Visual Encodings for Interactive Decision Making}, NUMBER = {8}, PUBLISHER = {Taylor \& Francis}, VOLUME = {21}, YEAR = {2007}, PAGES = {879--894}, } @INCOLLECTION{SipsVisualClustering2009, AUTHOR = {Sips, Mike}, EDITOR = {Liu, Ling and {\"O}zsu, M. nTamer}, TITLE = {Visual Clustering}, BOOKTITLE = {Encyclopedia of Database Systems}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Springer}, ISBN = {978-0-387-35544-3}, DOI = {10.1007/978-0-387-39940-9_1124}, YEAR = {2009}, PAGES = {3355--3360}, } @INPROCEEDINGS{SLCARS:2004, AUTHOR = {Sorkine, Olga and Lipman, Yaron and Cohen-Or, Daniel and Alexa, Marc and R{\"o}ssl, Christian and Seidel, Hans-Peter}, EDITOR = {Scopigno, Roberto and Zorin, Denis and Fellner, Dieter W. and Spencer, Stephen N.}, TITLE = {Laplacian Surface Editing}, BOOKTITLE = {SGP 2004 (SGP-04) : Symposium on Geometry Processing}, ORGANIZATION = {Eurographics/ACM SIGGRAPH}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Nice, France}, PUBLISHER = {Eurographics}, ISBN = {3-905673-13-4/1727-8384}, YEAR = {2004}, PAGES = {179--188,274}, ABSTRACT = {Surface editing operations commonly require geometric details of the surface to be preserved as much as possible. We argue that geometric detail is an intrinsic property of a surface and that, consequently, surface editing is best performed by operating over an intrinsic surface representation. We provide such a representation of a surface, based on the Laplacian of the mesh, by encoding each vertex relative to its neighborhood. The Laplacian of the mesh is enhanced to be invariant to locally linearized rigid transformations and scaling. Based on this Laplacian representation, we develop useful editing operations: interactive free-form deformation in a region of interest based on the transformation of a handle, transfer and mixing of geometric details between two surfaces, and transplanting of a partial surface mesh onto another surface. The main computation involved in all operations is the solution of a sparse linear system, which can be done at interactive rates. We demonstrate the effectiveness of our approach in several examples, showing that the editing operations change the shape while respecting the structural geometric detail. }, } @INPROCEEDINGS{Sloan:PRT:2002, AUTHOR = {Sloan, Peter-Pike and Kautz, Jan and Snyder, John}, EDITOR = {Fiume, Eugene}, TITLE = {Precomputed Radiance Transfer for Real-Time Rendering in Dynamic, Low-Frequency Lighting Environments}, BOOKTITLE = {Proceedings of ACM SIGGRAPH 2002 (SIGGRAPH-02)}, ORGANIZATION = {Association of Computing Machinery (ACM)}, PADDRESS = {San Francisco, USA}, ADDRESS = {San Antonio, USA}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {July}, SERIES = {acm Transactions on Graphics}, VOLUME = {21}, ISBN = {1-58113-521-1}, YEAR = {2002}, PAGES = {527--536}, ABSTRACT = {We present a new, real-time method for rendering diffuse and glossy objects in low-frequency lighting environments that cap-tures soft shadows, interreflections, and caustics. As a preprocess, a novel global transport simulator creates functions over the object s surface representing transfer of arbitrary, low-frequency incident lighting into transferred radiance which includes global effects like shadows and interreflections from the object onto itself. At run-time, these transfer functions are applied to actual incident lighting. Dynamic, local lighting is handled by sampling it close to the object every frame; the object can also be rigidly rotated with respect to the lighting and vice versa. Lighting and transfer functions are represented using low-order spherical harmonics. This avoids aliasing and evaluates efficiently on graphics hardware by reducing the shading integral to a dot product of 9 to 25 element vectors for diffuse receivers. Glossy objects are handled using matrices rather than vectors. We further introduce functions for radiance transfer from a dynamic lighting environment through a preprocessed object to neighboring points in space. These allow soft shadows and caustics from rigidly moving objects to be cast onto arbitrary, dynamic receivers. We demonstrate real-time global lighting effects with this approach.}, } @INPROCEEDINGS{sm02ob, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander}, EDITOR = {Lee, Kunwoo and Patrikalakis, Nicho M.}, TITLE = {Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces}, BOOKTITLE = {Seventh ACM Symposium on Solid Modeling and Applications (SM-02)}, ORGANIZATION = {ACM SIGGRAPH \& EUROGRAPHICS}, PADDRESS = {New York, USA}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {ACM}, MONTH = {June}, ISBN = {1-58113-506-8}, YEAR = {2002}, PAGES = {171--178}, ABSTRACT = {A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a better approximation of the implicit surface than the standard marching cubes mesh \cite{Lorensen} (in our experiments we use VTK marching cubes \cite{VTK}). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices are placed on the implicit surface and the mesh dual to the modified dual mesh is considered. Finally the vertex positions of that ``double dual'' mesh are optimized by minimizing a quadratic energy measuring a deviation of the mesh normals from the implicit surface normals computed at the vertices of the modified dual mesh. In order to achieve an accurate approximation of fine surface features, these basic steps are combined with adaptive mesh subdivision and curvature-weighted vertex resampling. The proposed method outperforms approaches based on the mesh evolution paradigm in speed and accuracy.}, } @INPROCEEDINGS{sm03ybs, AUTHOR = {Yoshizawa, Shin and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Elber, Gershon and Shapiro, Vadim}, TITLE = {Free-Form Skeleton-Driven Mesh Deformations}, BOOKTITLE = {Proceedings: 8th ACM Symposium on Solid Modeling and Applications (SM-03)}, PADDRESS = {New York, USA}, ADDRESS = {Seattle, USA}, PUBLISHER = {ACM}, ISBN = {1-58113-706-0}, YEAR = {2003}, PAGES = {247--253}, } @INPROCEEDINGS{smi03obs, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Kim, Myung-Soo}, TITLE = {A Multi-scale Approach to 3D Scattered Data Interpolation with Compactly Supported Basis Functions}, BOOKTITLE = {Shape Modeling International 2003 (SMI 2003)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Seoul, Korea}, PUBLISHER = {IEEE}, MONTH = {May}, YEAR = {2003}, PAGES = {153--161}, ABSTRACT = {In this paper, we propose a hierarchical approach to 3D scattered data interpolation with compactly supported basis functions. Our numerical experiments suggest that the approach integrates the best aspects of scattered data fitting with locally and globally supported basis functions. Employing locally supported functions leads to an efficient computational procedure, while a coarse-to-fine hierarchy makes our method insensitive to the density of scattered data and allows us to restore large parts of missed data. Given a point cloud distributed along a surface, we first use spatial down sampling to construct a coarse-to-fine hierarchy of point sets. Then we interpolate the sets starting from the coarsest level. We interpolate a point set of the hierarchy, as an offsetting of the interpolating function computed at the previous level. Fig.\,\ref{risu_multi} shows an original point set (the leftmost image) and its coarse-to-fine hierarchy of interpolated sets. According to our numerical experiments, the method is essentially faster than the state-of-art scattered data approximation with globally supported RBFs \cite{rbf} and much simpler to implement.}, } @INPROCEEDINGS{smi04obs, AUTHOR = {Ohtake, Yutaka and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Giannini, Franca and Pasko, Alexander}, TITLE = {3D scattered data approximation with adaptive compactly supported radial basis functions}, BOOKTITLE = {Shape Modeling International 2004 (SMI 2004)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Genova, Italy}, PUBLISHER = {IEEE}, MONTH = {June}, ISBN = {0-7695-2075-8}, YEAR = {2004}, PAGES = {31--39}, ABSTRACT = {In this paper, we develop an adaptive RBF fitting procedure for a high quality approximation of a set of points scattered over a piecewise smooth surface. We use compactly supported RBFs whose centers are randomly chosen from the points. The randomness is controlled by the point density and surface geometry. For each RBF, its support size is chosen adaptively according to surface geometry at a vicinity of the RBF center. All these lead to a noise-robust high quality approximation of the set. We also adapt our basic technique for shape reconstruction from registered range scans by taking into account measurement confidences. Finally, an interesting link between our RBF fitting procedure and partition of unity approximations is established and discussed.}, } @INPROCEEDINGS{SMI2001, AUTHOR = {K{\"a}hler, Kolja and R{\"o}ssl, Christian and Schneider, Robert and Vorsatz, Jens and Seidel, Hans-Peter}, EDITOR = {Pasko, Alexander and Spagnuolo, Michaela}, TITLE = {Efficient Processing of Large 3D Meshes}, BOOKTITLE = {Proceedings of the International Conference on Shape Modeling and Applications}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Genova, Italy}, PUBLISHER = {IEEE}, MONTH = {May}, YEAR = {2001}, PAGES = {228--239}, } @INPROCEEDINGS{Smith2005, AUTHOR = {Smith, Kaleigh and Liu, Yunjun and Klein, Allison}, EDITOR = {Anjyo, Ken and Faloutsos, Petros}, TITLE = {Animosaics}, BOOKTITLE = {Computer Animation 2005 : ACM SIGGRAPH / Eurographics Symposium on Computer Animation}, ORGANIZATION = {ACM}, PADDRESS = {New York, USA}, ADDRESS = {Los Angeles, California}, PUBLISHER = {ACM}, ISBN = {1-7695-2270-X}, YEAR = {2005}, PAGES = {201--208}, ABSTRACT = {Animated mosaics are a traditional form of stop-motion animation created by arranging and rearranging small objects or tiles from frame to frame. While this animation style is uniquely compelling, the traditional process of manually placing and then moving tiles in each frame is time-consuming and labourious. Recent work has proposed algorithms for static mosaics, but generating temporally coherent mosaic animations has remained open. In addition, previous techniques for temporal coherence allow non-photorealistic primitives to layer, blend, deform, or scale, techniques that are unsuitable for mosaic animations. This paper presents a new approach to temporal coherence and applies this to build a method for creating mosaic animations. Specifically, we characterize temporal coherence as the coordinated movement of groups of primitives. We describe a system for achieving this coordinated movement to create temporally coherent geometric packings of 2D shapes over time. We also show how to create static mosaics comprised of different tile shapes using area-based centroidal Voronoi diagrams.}, } @INPROCEEDINGS{Smith2006eg, AUTHOR = {Smith, Kaleigh and Krawczyk, Grzegorz and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Gr{\"o}ller, Eduard and Szirmay-Kalos, L{\'a}szl{\'o}}, TITLE = {Beyond Tone Mapping: Enhanced Depiction of Tone Mapped {HDR} Images}, BOOKTITLE = {The European Association for Computer Graphics 27th Annual Conference: EUROGRAPHICS 2006}, ORGANIZATION = {Eurographics}, PADDRESS = {Oxford, UK}, ADDRESS = {Vienna, Austria}, NUMBER = {3}, PUBLISHER = {Blackwell}, MONTH = {September}, SERIES = {Computer Graphics Forum}, VOLUME = {25(3)}, YEAR = {2006}, PAGES = {427--438}, ABSTRACT = { High Dynamic Range (HDR) images capture the full range of luminance present in real world scenes, and unlike Low Dynamic Range (LDR) images, can simultaneously contain detailed information in the deepest of shadows and the brightest of light sources. For display or aesthetic purposes, it is often necessary to perform tone mapping, which creates LDR depictions of HDR images at the cost of contrast information loss. The purpose of this work is two-fold: to analyze a displayed LDR image against its original HDR counterpart in terms of perceived contrast distortion, and to enhance the LDR depiction with perceptually driven colour adjustments to restore the original HDR contrast information. For analysis, we present a novel algorithm for the characterization of tone mapping distortion in terms of observed loss of global contrast, and loss of contour and texture details. We classify existing tone mapping operators accordingly. We measure both distortions with perceptual metrics that enable the automatic and meaningful enhancement of LDR depictions. For image enhancement, we identify artistic and photographic colour techniques from which we derive adjustments that create contrast with colour. The enhanced LDR image is an improved depiction of the original HDR image with restored contrast information.}, } @INPROCEEDINGS{Smith2008, AUTHOR = {Smith, Kaleigh and Landes, Pierre-Edouard and Thollot, J{\"o}elle and Myszkowski, Karol}, EDITOR = {Scopigno, Roberto and Gr{\"o}ller, Eduard}, TITLE = {Apparent Greyscale: A Simple and Fast Conversion to Perceptually Accurate Images and Video}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, ORGANIZATION = {European Association for Computer Graphics (Eurographics)}, PADDRESS = {Oxford, UK}, ADDRESS = {Crete, Greece}, NUMBER = {2}, PUBLISHER = {Blackwell}, VOLUME = {27(2)}, YEAR = {2008}, PAGES = {193--200}, ABSTRACT = {This paper presents a quick and simple method for converting complex images and video to perceptually accurate greyscale versions. We use a two-step approach first to globally assign grey values and determine colour ordering, then second, to locally enhance the greyscale to reproduce the original contrast. Our global mapping is image independent and incorporates the Helmholtz-Kohlrausch colour appearance effect for predicting differences between isoluminant colours. Our multiscale local contrast enhancement reintroduces lost discontinuities only in regions that insufficiently represent original chromatic contrast. All operations are restricted so that they preserve the overall image appearance, lightness range and differences, colour ordering, and spatial details, resulting in perceptually accurate achromatic reproductions of the colour original.}, } @INPROCEEDINGS{Smyk05EG, AUTHOR = {Smyk, Miloslaw and Kinuwaki, Shinichi and Durikovic, Roman and Myszkowski, Karol}, EDITOR = {Alexa, Marc and Marks, Joe}, TITLE = {Temporally Coherent Irradiance Caching for High Quality Animation Rendering}, BOOKTITLE = {The European Association for Computer Graphics 26th Annual Conference : EUROGRAPHICS 2005}, PADDRESS = {Oxford, UK}, ADDRESS = {Dublin, Ireland}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {24(3)}, ISBN = {0167-7055}, YEAR = {2005}, PAGES = {401--412}, } @INPROCEEDINGS{SongBelyaevSeidel2007, AUTHOR = {Song, Wenhao and Belyaev, Alexander and Seidel, Hans-Peter}, TITLE = {Automatic Generation of Bas-reliefs from 3D Shapes}, BOOKTITLE = {2007 International Conference on Shape Modeling and Applications (SMI 2007)}, PADDRESS = {Los Alamitos, CA, USA}, ADDRESS = {Lyon, France}, PUBLISHER = {IEEE}, ISBN = {0-7695-2815-5}, YEAR = {2007}, PAGES = {211--214}, ABSTRACT = {In this paper, we introduce and study a new problem of converting a given 3D shape (or a 2.5D range data) into a bas-relief. The problem can be considered as a geometry counterpart of the HDR image compression problem widely studied in computer graphics. In our approach to the shape bas-reliefing problem, we combine the concepts of mesh saliency, shape exaggerating, and discrete differential coordinates. The final bas-relief has a small width, preserves salient features of the original 3D shape, and, therefore, can be used for shape decorating purposes.}, } @INPROCEEDINGS{spm07sbs, AUTHOR = {Schall, Oliver and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {L{\'e}vy, Bruno and Manocha, Dinesh}, TITLE = {Feature-preserving Non-local Denoising of Static and Time-varying Range Data}, BOOKTITLE = {ACM Symposium on Solid and Physical Modeling 2007}, PADDRESS = {New York, NY, USA}, ADDRESS = {Beijing, China}, PUBLISHER = {ACM}, ISBN = {978-1-59593-666-0}, YEAR = {2007}, PAGES = {217--222}, ABSTRACT = {We present a new method for noise removal on static and time-varying range data. Our approach predicts the restored position of a perturbed vertex using similar vertices in its neighborhood. It defines the required similarity measure in a new non-local fashion which compares regions of the surface instead of point pairs. This allows our algorithm to obtain a more accurate denoising result than previous state-of-the-art approaches and, at the same time, to better preserve fine features of the surface. Furthermore, our approach is easy to implement, effective, and flexibly applicable to different types of scanned data. We demonstrate this on several static and interesting new time-varying datasets obtained using laser and structured light scanners.}, } @INPROCEEDINGS{spm08szs, AUTHOR = {Schall, Oliver and Zayer, Rhaleb and Seidel, Hans-Peter}, EDITOR = {Haines, Eric and McGuire, Morgan}, TITLE = {Controlled field generation for quad-remeshing}, BOOKTITLE = {ACM Symposium on Solid and Physical Modeling 2008}, PADDRESS = {New York, NY, USA}, ADDRESS = {Stony Brook, New York, USA}, PUBLISHER = {ACM}, YEAR = {2008}, PAGES = {295--300}, ABSTRACT = {Quadrangular remeshing of triangulated surfaces has received an increasing attention in recent years. A particularly elegant approach is the extraction of quads from the streamlines of a harmonic field. While the construction of such fields is by now a standard technique in geometry processing, enforcing design constraints is still not fully investigated. This work presents a technique for handling directional constraints by directly controlling the gradient of the field. In this way, line constraints sketched by the user or automatically obtained as feature lines can be fulfilled efficiently. Furthermore, we show the potential of quasi-harmonic fields as a flexible tool for controlling the behavior of the field over the surface. Treating the surface as an inhomogeneous domain we can endow specific surface regions with field attraction/repulsion properties.}, } @INPROCEEDINGS{Sridhar2011, AUTHOR = {Sridhar, Srinath and Ng-Thow-Hing, Victor}, TITLE = {Generation of Virtual Display Surfaces for In-vehicle Contextual Augmented Reality}, BOOKTITLE = {Proceedings of the 11th IEEE International Symposium on Mixed and Augmented Reality (ISMAR)}, ORGANIZATION = {The Institute of Electrical and Electronics Engineers (IEEE)}, ADDRESS = {USA}, PUBLISHER = {IEEE}, ISBN = {978-1-4673-4660-3}, DOI = {10.1109/ISMAR.2012.6402592}, YEAR = {2012}, PAGES = {317--318}, ABSTRACT = {In-vehicle contextual augmented reality (I-CAR) has the potential to provide novel visual feedback to drivers for an enhanced driving experience. To enable I-CAR, we present a parametrized road trench model (RTM) for dynamically extracting display surfaces from a driver's point of view that is adaptable to constantly changing road curvature and intersections. We use computer vision algorithms to analyze and extract road features that are used to estimate the parameters of the RTM. GPS coordinates are used to quickly compute lighting parameters for shading and shadows. Novel driver-based applications that use the RTM are presented.}, } @TECHREPORT{sridhar2011camfplan, AUTHOR = {Sridhar, Srinath}, TITLE = {CAMFPLAN: A Real-time Markerless Camera Pose Estimation System for Augmented Reality}, INSTITUTION = {Department of Civil and Environmental Engineering, University of Michigan, Ann Arbor, MI}, TYPE = {Technical Report}, ADDRESS = {Ann Arbor, MI}, NUMBER = {UMCEE Report No. 11-01}, MONTH = {April}, YEAR = {2011}, PAGES = {67}, } @INPROCEEDINGS{SriSaxTheThuNg09, AUTHOR = {Srivastava, S. and Saxena, A. and Theobalt, Christian and Thrun, S. and Ng, A. Y.}, EDITOR = {Magnor, Marcus and Rosenhahn, Bodo and Theisel, Holger}, TITLE = {{i23} - Rapid Interactive 3D Reconstruction from a Single Image}, BOOKTITLE = {Proceedings of the Vision, Modeling, and Visualization Workshop 2009 (VMV 2009)}, PADDRESS = {Magdeburg, Germany}, ADDRESS = {Braunschweig, Germany}, PUBLISHER = {Otto-Von-Guericke-Universit{\"a}t}, ISBN = {978-3-9804874-8-1}, YEAR = {2009}, PAGES = {19--28}, } @INPROCEEDINGS{SS00, AUTHOR = {Soler, Cyril and Sillion, Fran{\c{c}}ois}, EDITOR = {P{\'e}roche, Bernard and Rushmeier, Holly}, TITLE = {Hierarchical Instantiation for Radiosity}, BOOKTITLE = {Rendering Techniques 2000, Proceedings of the 11th Eurographics Workshop on Rendering}, ORGANIZATION = {Eurographics}, PADDRESS = {Vienna, Austria}, ADDRESS = {Brno, Czech Republic}, PUBLISHER = {Springer}, MONTH = {June}, SERIES = {Springer Computer Science}, ISBN = {3-211-83535-0}, YEAR = {2000}, PAGES = {173--184}, } @ARTICLE{SS00b, AUTHOR = {Soler, Cyril and Sillion, Fran{\c{c}}ois}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Texture-Based Visibility for Efficient Lighting Simulation}, ADDRESS = {New York, USA}, NUMBER = {4}, PUBLISHER = {ACM}, MONTH = {October}, VOLUME = {19}, ISBN = {0730-0301}, YEAR = {2000}, PAGES = {302--342}, ABSTRACT = {Lighting simulations obtained using hierarchical radiosity with clustering can be very slow when the computation of fine and artifact-free shadows is needed. To avoid the high cost of mesh refinement associated with fast variations of visibility across receivers, we propose a new hierarchical algorithm in which partial visibility maps can be computed on the fly, using a convolution technique, for emitter-receiver configurations where complex shadows are produced. Other configurations still rely on mesh subdivision to reach the desired accuracy in modeling the energy transfer. In our system, radiosity is therefore represented as a combination of textures and piecewise constant or linear contributions over mesh elements at multiple hierarchical levels. We give a detailed description of the gather, push/pull and display stages of the hierarchical radiosity algorithm, adapted to seamlessly integrate both representations. A new refinement algorithm is proposed, that chooses the most appropriate technique to compute the energy transfer and resulting radiosity distribution for each receiver/emitter configuration. Comprehensive error control is achieved by subdividing either the source or receiver in a traditional manner, or by using a blocker subdivision scheme that improves the quality of shadow masks without increasing the complexity of the mesh. Results show that high-quality images are obtained in a matter of seconds for scenes with tens of thousands of polygons.}, } @INPROCEEDINGS{SsbcVMVKlehm2011, AUTHOR = {Klehm, Oliver and Ritschel, Tobias and Eisemann, Elmar and Seidel, Hans-Peter}, EDITOR = {Eisert, Peter and Hornegger, Joachim and Polthier, Konrad}, TITLE = {Bent Normals and Cones in Screen-space}, BOOKTITLE = {16th International Workshop on Vision, Modeling and Visualization}, PADDRESS = {Goslar, Germany}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Eurographics Association}, MONTH = {October}, ISBN = {978-3-905673-85-2}, YEAR = {2011}, PAGES = {177--182}, ABSTRACT = {Ambient occlusion (AO) is a popular technique for real-time as well as offline rendering. One of its benefits is a gain in efficiency due to the fact that occlusion and shading are decoupled which results in an average occlusion that modulates the surface shading. Its main drawback is a loss of realism due to the lack of directional occlusion and lighting. As a solution, the use of bent normals was proposed for offline rendering. This work describes how to compute bent normals and bent cones in combination with screen-space ambient occlusion. These extensions combine the speed and simplicity of AO with physically more plausible lighting.}, } @INCOLLECTION{SSBC_GP3_Klehm2012, AUTHOR = {Klehm, Oliver and Ritschel, Tobias and Eisemann, Elmar and Seidel, Hans-Peter}, EDITOR = {Engel, Wolfgang}, TITLE = {Screen-space Bent Cones: A Practical Approach}, BOOKTITLE = {{GPU} Pro 3: Advanced Rendering Techniques}, CHAPTER = {3.2}, ADDRESS = {New York, NY}, PUBLISHER = {CRC Press}, ISBN = {9781439887820}, YEAR = {2012}, PAGES = {191--207}, ABSTRACT = {Ambient occlusion (AO) is a popular technique for visually improving both real-time as well as offline rendering. It decouples occlusion and shading providing a gain in efficiency. This results in an average occlusion that modulates the surface shading. However, this also reduces realism due to the lack of directional information. Bent normals were proposed as an amelioration that addresses this issue for offline rendering. Here, we describe how to compute bent normals as a cheap by-product of screen-space ambient occlusion (SSAO). Bent cones extend bent normals to further improve realism. These extensions combine the speed and simplicity of AO with physically more plausible lighting.}, } @INPROCEEDINGS{ssbs_sccg07, AUTHOR = {Saleem, Waqar and Song, Wenhao and Belyaev, Alexander and Seidel, Hans-Peter}, EDITOR = {Sbert, Mateu}, TITLE = {On Computing Best Fly}, BOOKTITLE = {Proceedings of the 23rd Spring Conference on Computer Graphics, 2007}, ORGANIZATION = {ACM SIGGRAPH}, PADDRESS = {Bratislava, Slovakia}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {Comenius University}, ISBN = {978-80-223-2292-8}, YEAR = {2007}, PAGES = {143--149}, ABSTRACT = {With growing popularity of online 3D shape databases, the problem of navigation and remote visualisation of large 3D shape models in such repositories is gaining prominence. While some recent work has focused on automatically computing the best view(s) of a given model, little attention has been given to the problem's dynamic counterpart - best fly. In this paper, we propose a solution to this problem that extends on previous best view methods. Given a shape, we use its best views to compute a path on its viewsphere which acts as a trajectory for a virtual camera pointing at the object. We then use the model's geometric properties to determine the speed and zoom of the camera along the path.}, } @INCOLLECTION{St11ASX_CUDA, AUTHOR = {Strzodka, Robert}, EDITOR = {Hwu, Wen-Mei W.}, TITLE = {Abstraction for {AoS} and {SoA} layout in {C++}}, BOOKTITLE = {{GPU} Computing Gems Jade Edition}, ADDRESS = {Waltham, MA}, PUBLISHER = {Morgan Kaufmann}, ISBN = {978-0-12-385963-1}, YEAR = {2011}, PAGES = {253--269}, } @INPROCEEDINGS{Stamminger00, AUTHOR = {Stamminger, Marc and Scheel, Annette and Seidel, Hans-Peter}, EDITOR = {Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {Hierarchical Radiosity with Global Refinement}, BOOKTITLE = {Proceedings of Vision, Modeling, and Visualization (VMV-00)}, PADDRESS = {Berlin, Germany}, ADDRESS = {Saarbr{\"u}cken, Germany}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, ISBN = {3-89838-019-X}, YEAR = {2000}, PAGES = {263--270}, ABSTRACT = { Hierarchical approaches are the best means to compute global illumination solutions with finite elements for scenes of high complexity. Most of these methods are based on Hierarchical Radiosity and on its idea of a local refiner, which decides about the level of interaction looking at a single pair of sender and receiver at a moment. Such local refiners are easy to implement, but the neglect of global properties of the entire solution often focuses the computation on details, which are not visible anymore in the final solution. In this paper we propose an extension for \mbox{Hierarchical} Radiosity which introduces the concept of global refinement. This method can be used to better focus the computations on only those details, which are of interest for the global solution.}, } @ARTICLE{Stamminger00a, AUTHOR = {Stamminger, Marc and Scheel, Annette and Granier, Xavier and Perez-Cazorla, Frederic and Drettakis, George and Sillion, Francois}, JOURNAL = {Computer Graphics Forum}, TITLE = {Efficient Glossy Global Illumination with Interactive Viewing}, ADDRESS = {Oxford, UK}, NUMBER = {1}, PUBLISHER = {Blackwell}, MONTH = {March}, VOLUME = {19}, YEAR = {2000}, PAGES = {13--26}, ABSTRACT = { The ability to perform interactive walkthroughs of global illumination solutions including glossy effects is a challenging open problem. In this paper we overcome certain limitations of previous approaches. We first introduce a novel, memory- and compute-efficient representation of incoming illumination, in the context of a hierarchical radiance clustering algorithm. We then represent outgoing radiance with an adaptive hierarchical basis, in a manner suitable for interactive display. Using appropriate refinement and display strategies, we achieve walkthroughs of glossy solutions at interactive rates for non-trivial scenes. In addition, our implementation has been developed to be portable and easily adaptable as an extension to existing, diffuse-only, hierarchical radiosity systems. We present results of the implementation of glossy global illumination in two independent global illumination systems.}, } @INPROCEEDINGS{Stamminger1999a, AUTHOR = {Stamminger, Marc and Scheel, Annette and Granier, Xavier and Perez-Cazorla, Frederic and Drettakis, George and Sillion, Francois}, EDITOR = {MacKenzie, I. Scott and Stewart, James}, TITLE = {Efficient Glossy Global Illumination with Interactive Viewing}, BOOKTITLE = {Graphics Interface '99 (GI-99)}, ORGANIZATION = {Canadian Human-Computer Communications Society}, PADDRESS = {San Francisco, USA}, ADDRESS = {Kingston, Canada}, PUBLISHER = {Morgan Kaufmann}, MONTH = {June}, ISBN = {1-55860-632-7}, YEAR = {1999}, PAGES = {50--57}, } @INPROCEEDINGS{Stamminger1999b, AUTHOR = {Stamminger, Marc and Daubert, Katja and Seidel, Hans-Peter}, EDITOR = {Girod, Bernd and Niemann, Heinrich and Seidel, Hans-Peter}, TITLE = {Photon Tracing with RenderMan Light Source Shaders}, BOOKTITLE = {Proceedings of the 4th Conference on Vision, Modeling, and Visualization (VMV-99)}, ORGANIZATION = {SFB 603 "Model-Based Analysis and Visualization of Complex Scenes and Sensor Data" and Graduate Research Center "3-D Image Analysis and Synthesis"}, PADDRESS = {Sankt Augustin, Germany}, ADDRESS = {Erlangen, Germany}, PUBLISHER = {infix}, MONTH = {November}, ISBN = {3-89601-015-8}, YEAR = {1999}, PAGES = {277--284}, } @PHDTHESIS{Stamminger1999phd, AUTHOR = {Stamminger, Marc}, TITLE = {Finite Element Methods for Global Illumination Computations}, SCHOOL = {Universit{\"a}t Erlangen-N{\"u}rnberg}, TYPE = {Doctoral dissertation}, ADDRESS = {Munich, Germany}, PUBLISHER = {Herbert Utz}, MONTH = {March}, YEAR = {1999}, } @INPROCEEDINGS{Stamminger:2000:CorrTex, AUTHOR = {Stamminger, Marc and Haber, J{\"o}rg and Schirmacher, Hartmut and Seidel, Hans-Peter}, EDITOR = {Peroche, Bernard and Rushmeier, Holly}, TITLE = {{Walkthroughs with Corrective Texturing}}, BOOKTITLE = {{Rendering Techniques 2000, Proceedings of the 11th Eurographics Workshop on Rendering}}, PADDRESS = {Vienna, Austria}, ADDRESS = {Brno, Czech Republic}, PUBLISHER = {Springer}, ISBN = {3-211-83535-0}, YEAR = {2000}, PAGES = {377--388;422}, ABSTRACT = {We present a new hybrid rendering method for interactive walkthroughs in photometrically complex environments. The display process starts from some approximation of the scene rendered at high frame rates using graphics hardware. Additional computation power is used to correct this rendering towards a high quality ray tracing solution during the walkthrough. This is achieved by applying corrective textures to scene objects or entire object groups. These corrective textures contain a sampled representation of the differences between the hardware generated and the high quality solution. By reusing the textures, frame-to-frame coherence is exploited and explicit reprojections of point samples are avoided. Finally, we describe our implementation, which can display interactive walkthroughs of fairly complex scenes including high quality global illumination features.}, } @INPROCEEDINGS{Steimle2013, AUTHOR = {Steimle, J{\"u}rgen and Jordt, Andreas and Maes, Pattie}, TITLE = {Flexpad: Highly Flexible Bending Interactions for Projected Handheld Displays}, BOOKTITLE = {ACM SIGCHI Conference on Human Factors in Computing Systems (CHI'13)}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, USA}, ADDRESS = {Paris, France}, PUBLISHER = {ACM}, YEAR = {2013}, ABSTRACT = {Flexpad is an interactive system that combines a depth camera and a projector to transform sheets of plain paper or foam into flexible, highly deformable, and spatially aware handheld displays. We present a novel approach for tracking deformed surfaces from depth images in real time. It captures deformations in high detail, is very robust to occlusions created by the user’s hands and fingers, and does not require any kind of markers or visible texture. As a result, the display is considerably more deformable than in previous work on flexible handheld displays, enabling novel applications that leverage the high expressiveness of detailed deformation. We illustrate these unique capabilities through three application examples: curved cross-cuts in volumetric images, deforming virtual paper characters, and slicing through time in videos. Results from two user studies show that our system is capable of detecting complex deformations and that users are able to perform them quickly and precisely.}, } @MISC{Steimle:2013:DTN:2468356.2479667, AUTHOR = {Steimle, J{\"u}rgen}, TITLE = {Displays Take New Shape: An Agenda for Future Interactive Surfaces}, HOWPUBLISHED = {CHI '13 Extended Abstracts on Human Factors in Computing Systems}, YEAR = {2013}, } @INPROCEEDINGS{SteinkeSchoeBl05, AUTHOR = {Steinke, Florian and Sch{\"o}lkopf, Bernhard and Blanz, Volker}, EDITOR = {Alexa, Marc and Marks, Joe}, TITLE = {Support Vector Machines for 3D Shape Processing}, BOOKTITLE = {The European Association for Computer Graphics 26th Annual Conference : EUROGRAPHICS 2005}, PADDRESS = {Oxford, UK}, ADDRESS = {Dublin, Ireland}, NUMBER = {3}, PUBLISHER = {Blackwell}, SERIES = {Computer Graphics Forum}, VOLUME = {24}, ISBN = {0167-7055}, YEAR = {2005}, PAGES = {285--294}, } @INPROCEEDINGS{Stich2006, AUTHOR = {Stich, Timo and Tevs, Art and Magnor, Marcus}, TITLE = {Global Depth from Epipolar Volumes--A General Framework for Reconstructing Non-Lambertian Surfaces}, BOOKTITLE = {Proceedings of the Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)}, PADDRESS = {Washington, DC, USA}, ADDRESS = {Chapel Hill, USA}, PUBLISHER = {IEEE Computer Society}, MONTH = {June}, ISBN = {0-7695-2825-2}, YEAR = {2006}, PAGES = {916--923}, ABSTRACT = {Introducing Epipolar Volumes in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowledge about the scene or the surface reflection properties into the reconstruction process. The proposed framework in conjunction with graph cut optimization is able to reconstruct also highly specular surfaces. The use of prior knowledge in general opens up new ways to reconstruct complicated surfaces and scenes impossible with previous methods. Another advantage is improved occlusion handling. Pixels that are partly occluded contribute to the reconstruction results. The proposed shifting of some of the computation to graphics hardware (GPU) results in a significant speed improvement compared to pure CPU-based implementations.}, } @INPROCEEDINGS{stoeter12, AUTHOR = {St{\"o}ter, Torsten and Weinkauf, Tino and Seidel, Hans-Peter and Theisel, Holger}, EDITOR = {Goesele, Michael and Grosch, Thorsten and Theisel, Holger and Toennies, Klaus and Preim, Bernhard}, TITLE = {Implicit Integral Surfaces}, BOOKTITLE = {VMV 2012: Vision, Modeling \& Visualization}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Magdeburg, Germany}, PUBLISHER = {Eurographics Association}, ISBN = {978-3-905673-95-1}, DOI = {10.2312/PE/VMV/VMV12/127-134}, YEAR = {2012}, PAGES = {127--134}, ABSTRACT = {We present an implicit method for globally computing all four classic types of integral surfaces -- stream, path, streak, and time surfaces in 3D time-dependent vector fields. Our novel formulation is based on the representation of a time surface as implicit isosurface of a 3D scalar function advected by the flow field. The evolution of a time surface is then given as an isovolume in 4D space-time spanned by a series of advected scalar functions. Based on this, the other three integral surfaces are described as the intersection of two isovolumes derived from different scalar functions. Our method uses a dense flow integration to compute integral surfaces globally in the entire domain. This allows to change the seeding structure efficiently by simply defining new isovalues. We propose two rendering methods that exploit the implicit nature of our integral surfaces: 4D raycasting, and projection into a 3D volume. Furthermore, we present a marching cubes inspired surface extraction method to convert the implicit surface representation to an explicit triangle mesh. In contrast to previous approaches for implicit stream surfaces, our method allows for multiple voxel intersections, covers all regions of the flow field, and provides full control over the seeding line within the entire domain.}, } @INPROCEEDINGS{Stoll2004a, AUTHOR = {Stoll, Carsten and Gumhold, Stefan and Seidel, Hans-Peter}, EDITOR = {Silva, Cl{\'a}udio T. and Gr{\"o}ller, Eduard and Rushmeier, Holly}, TITLE = {Visualization with Stylized Line Primitives}, BOOKTITLE = {IEEE Visualization 2005 (VIS 2005)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Minneapolis, USA}, PUBLISHER = {IEEE}, YEAR = {2005}, PAGES = {695--702}, ABSTRACT = {Line primitives are a very powerful visual attribute used for scientific visualization and in particular for 3D vector-field visualization. We extend the basic line primitives with additional visual attributes including color, line width, texture and orientation. To implement the visual attributes we represent the stylized line primitives as generalized cylinders. One important contribution of our work is an efficient rendering algorithm for stylized lines, which is hybrid in the sense that it uses both CPU and GPU based rendering. We improve the depth perception with a shadow algorithm. We present several applications for the visualization with stylized lines among which are the visualizations of 3D vector fields and molecular structures.}, } @INPROCEEDINGS{Stoll2006bs, AUTHOR = {Stoll, Carsten and Seidel, Hans-Peter and Alexa, Marc}, TITLE = {BSP Shapes}, BOOKTITLE = {2006 International Conference on Shape Modeling and Applications (SMI 2006)}, ORGANIZATION = {IEEE}, PADDRESS = {Washington, USA}, ADDRESS = {Matsushima, Japan}, PUBLISHER = {IEEE}, MONTH = {June}, SERIES = {Proceedings of the IEEE International Conference on Shape Modeling and Applications}, ISBN = {0-7695-2591-1}, YEAR = {2006}, PAGES = {42--47}, ABSTRACT = {We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches in each cell. This is achieved by employing two heuristics for finding appropriate split planes in each cell. Leaf nodes in the BSP tree represent either polygonal surface approximations or empty (clip) cells rather than split planes. We show that the resulting set of disconnected primitives typically leads to a better two-sided Hausdorff error for a given number of primitives than meshes. The BSP cells can be coded with few bits and, consequently, the tree is a compact shape representation. The special properties of BSPs are very useful in applications that need to perform spatial queries on the primitives, such as for occlusion and view frustum culling, and proximity or collision tests.}, } @PHDTHESIS{Stoll2009, AUTHOR = {Stoll, Carsten}, TITLE = {Template Based Shape Processing}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {November}, YEAR = {2009}, ABSTRACT = {As computers can only represent and process discrete data, information gathered from the real world always has to be sampled. While it is nowadays possible to sample many signals accurately and thus generate high-quality reconstructions (for example of images and audio data), accurately and densely sampling 3D geometry is still a challenge. The signal samples may be corrupted by noise and outliers, and contain large holes due to occlusions. These issues become even more pronounced when also considering the temporal domain. Because of this, developing methods for accurate reconstruction of shapes from a sparse set of discrete data is an important aspect of the computer graphics processing pipeline. In this thesis we propose novel approaches to including semantic knowledge into reconstruction processes using template based shape processing. We formulate shape reconstruction as a deformable template fitting process, where we try to fit a given template model to the sampled data. This approach allows us to present novel solutions to several fundamental problems in the area of shape reconstruction. We address static problems like constrained texture mapping and semantically meaningful hole-filling in surface reconstruction from 3D scans, temporal problems such as mesh based performance capture, and finally dynamic problems like the estimation of physically based material parameters of animated templates.}, } @INPROCEEDINGS{Stoll2011, AUTHOR = {Stoll, Carsten and Hasler, Nils and Gall, Juergen and Seidel, Hans-Peter and Theobalt, Christian}, TITLE = {Fast Articulated Motion Tracking using a Sums of {Gaussians} Body Model}, BOOKTITLE = {2011 IEEE International Conference on Computer Vision (ICCV)}, PADDRESS = {Piscataway, NJ}, ADDRESS = {Barcelona, Spain}, PUBLISHER = {IEEE}, ISBN = {978-1-4577-1101-5}, DOI = {10.1109/ICCV.2011.6126338}, YEAR = {2011}, PAGES = {951--958}, } @INPROCEEDINGS{StollPG06, AUTHOR = {Stoll, Carsten and Karni, Zachi and Seidel, Hans-Peter}, TITLE = {Geodesics Guided Constrained Texture Deformation}, BOOKTITLE = {The 14th Pacific Conference on Computer Graphics and Applications Proceedings}, ORGANIZATION = {ACM Siggraph}, PADDRESS = {Taipei, Taiwan}, ADDRESS = {Taipei, Taiwan}, PUBLISHER = {National Taiwan University Press}, MONTH = {October}, SERIES = {Pacific Conference on Computer Graphics and Applications Proceedings}, VOLUME = {14}, YEAR = {2006}, PAGES = {144--152}, ABSTRACT = {We present a method that deforms an image plane to visually meet the shape and pose of a manifold sur-face. The user provides constraints that couple a small number of surface points with their corresponding im-age pixels to initially deform the plane. Matching, based on geodesic distances, couples additional points, followed by a second deformation that brings the im-age plane into its final pose and shape. The method works on any type of surface that supports geodesic distances evaluation. This includes not-triangulated and high genus models with arbitrary topology. The result is a smooth, visually pleasing and realistic tex-tured surface that can be superimposed onto or used instead of the original model and with some limitations can be considered as a parameterization or remeshing method for the area of interest.}, } @INPROCEEDINGS{StollRT06, AUTHOR = {Stoll, Carsten and Gumhold, Stefan and Seidel, Hans-Peter}, EDITOR = {Wald, Ingo and Parker, Steven G.}, TITLE = {Incremental Raycasting of Piecewise Quadratic Surfaces on the GPU}, BOOKTITLE = {IEEE Symposium on Interactive Raytracing 2006 Proceedings}, ORGANIZATION = {IEEE}, PADDRESS = {Piscataway, USA}, ADDRESS = {Salt Lake City, USA}, PUBLISHER = {IEEE}, MONTH = {September}, SERIES = {IEEE Symposium on Interactive Raytracing Proceedings}, ISBN = {1-4244-0693-5}, YEAR = {2006}, PAGES = {141--150}, ABSTRACT = {To overcome the limitations of triangle and point based surfaces several authors have recently investigated surface representations that are based on higher order primitives. Among these are MPU, SLIM surfaces, dynamic skin surfaces and higher order isosurfaces. Up to now these representations were not suitable for interactive applications because of the lack of an efficient rendering algorithm. In this paper we close this gap for implicit surface representations of degree two by developing highly optimized GPU implementations of the raycasting algorithm. We investigate techniques for fast incremental raycasting and cover per fragment and per quadric backface culling. We apply the approaches to the rendering of SLIM surfaces, quadratic iso-surfaces over tetrahedral meshes and bilinear quadrilaterals. Compared to triangle based surface approximations of similar geometric error we achieve only slightly lower frame rates but with much higher visual quality due to the quadratic approximation power of the underlying surfaces.}, } @ARTICLE{StollTheobaltSIGASIA2010, AUTHOR = {Stoll, Carsten and Gall, Juergen and de Aguiar, Edilson and Thrun, Sebastian and Theobalt, Christian}, JOURNAL = {ACM Transactions on Graphics (Proceedings of SIGGRAPH Asia 2010)}, TITLE = {Video-based Reconstruction of Animatable Human Characters}, ADDRESS = {New York, NY}, NUMBER = {6}, PUBLISHER = {ACM}, MONTH = {December}, VOLUME = {29}, ISBN = {0730-0301}, DOI = {10.1145/1882261.1866161}, YEAR = {2010}, PAGES = {139,1--139,10}, } @INPROCEEDINGS{stoll:td:2006, AUTHOR = {Stoll, Carsten and Karni, Zachi and R{\"o}ssl, Christian and Yamauchi, Hitoshi and Seidel, Hans-Peter}, EDITOR = {Botsch, Mario and Chen, Baoquan}, TITLE = {Template Deformation for Point Cloud Fitting}, BOOKTITLE = {Symposium on Point-Based Graphics}, PADDRESS = {Aire-la-Ville, Switzerland}, ADDRESS = {Boston, USA}, PUBLISHER = {Eurographics}, YEAR = {2006}, PAGES = {27--35}, } @ARTICLE{Stoykova2007, AUTHOR = {Stoykova, Elena and Alatan, A. Aydin and Benzie, Philip and Grammalidis, Nikos and Malassiotis, Sotiris and Ostermann, Joern and Piekh, Sergej and Sainov, Ventseslav and Theobalt, Christian and Thevar, Thangavel and Zabulis, Xenophon}, JOURNAL = {IEEE Transactions on Circuits and Systems for Video Technology}, TITLE = {3-D time-varying scene capture technologies - a survey}, ADDRESS = {Los Alamitos, CA, USA}, NUMBER = {11}, PUBLISHER = {IEEE}, MONTH = {November}, VOLUME = {17}, ISBN = {1051-8215}, DOI = {10.1109/TCSVT.2007.909975}, YEAR = {2007}, PAGES = {1568--1586}, } @INPROCEEDINGS{Strzodka2003, AUTHOR = {Strzodka, Robert and Ihrke, Ivo and Magnor, Marcus}, TITLE = {A Graphics Hardware Implementation of the Generalized Hough Transform for fast Object Recognition, Scale, and 3D Pose Detection}, BOOKTITLE = {Proc. of ICIAP}, PADDRESS = {Mantova}, ADDRESS = {Mantova}, YEAR = {2003}, PAGES = {188--193}, } @ARTICLE{Strzodka2011, AUTHOR = {Herrero, Jos{\'e} R. and Quintana-Orti, Enrique S. and Strzodka, Robert}, JOURNAL = {Concurrency and Computation - Practice \& Experience}, TITLE = {Special Issue: {GPU} computing}, ADDRESS = {Chichester}, NUMBER = {7}, PUBLISHER = {Wiley}, VOLUME = {23}, ISBN = {1532-0626}, DOI = {10.1002/cpe.1691}, YEAR = {2011}, PAGES = {667--668}, } @ARTICLE{Strzodka2012, AUTHOR = {Strzodka, Robert}, JOURNAL = {Journal of Parallel and Distributed Computing}, TITLE = {Data layout optimization for multi-valued containers in {OpenCL}}, ADDRESS = {Amsterdam}, NUMBER = {9}, PUBLISHER = {Elsevier}, VOLUME = {72}, ISBN = {0743-7315}, DOI = {10.1016/j.jpdc.2011.10.012}, YEAR = {2012}, PAGES = {1073--1082}, } @INPROCEEDINGS{StShPa09VC, AUTHOR = {Strzodka, Robert and Shaheen, Mohammed and Pajak, Dawid}, TITLE = {Overcoming Bandwidth Limitations in Visual Computing}, BOOKTITLE = {Visual Computing Research Conference}, PADDRESS = {Saarbruecken}, ADDRESS = {Saarbruecken}, PUBLISHER = {Intel Visual Computing Institute}, MONTH = {December}, YEAR = {2009}, PAGES = {1--2}, } @INPROCEEDINGS{StShPa11EssTS, AUTHOR = {Strzodka, Robert and Shaheen, Mohammed and Pajak, Dawid}, TITLE = {Time skewing made simple}, BOOKTITLE = {Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming (SIGPLAN)}, ORGANIZATION = {Association for Computing Machinery (ACM)}, TYPE = {Extended Abstract}, PADDRESS = {New York, NY, USA}, ADDRESS = {San Antonio, TX}, PUBLISHER = {ACM}, MONTH = {February}, ISBN = {978-1-4503-0119-0}, DOI = {10.1145/1941553.1941596}, YEAR = {2011}, PAGES = {295--296}, ABSTRACT = {Time skewing and loop tiling has been known for a long time to be a highly beneficial acceleration technique for nested loops especially on bandwidth hungry multi-core processors, but it is little used in practice because efficient implementations utilize complicated code and simple or abstract ones show much smaller gains over naive nested loops. We break this dilemma with an essential time skewing scheme that is both compact and fast.}, } @INPROCEEDINGS{StShPa_10CORALS, AUTHOR = {Strzodka, Robert and Shaheen, Mohammed and Pajak, Dawid and Seidel, Hans-Peter}, TITLE = {Cache oblivious parallelograms in iterative stencil computations}, BOOKTITLE = {ICS '10 : Proceedings of the 24th ACM International Conference on Supercomputing}, ORGANIZATION = {Association for Computing Machinery (ACM)}, PADDRESS = {New York, NY}, ADDRESS = {Tsukuba, Ibaraki, Japan}, PUBLISHER = {ACM}, ISBN = {978-1-4503-0018-6}, DOI = {10.1145/1810085.1810096}, YEAR = {2010}, PAGES = {49--59}, ABSTRACT = {We present a new cache oblivious scheme for iterative stencil computations that performs beyond system bandwidth limitations as though gigabytes of data could reside in an enormous on-chip cache. We compare execution times for 2D and 3D spatial domains with up to 128 million double precision elements for constant and variable stencils against hand-optimized naive code and the automatic polyhedral parallelizer and locality optimizer PluTo and demonstrate the clear superiority of our results. The performance benefits stem from a tiling structure that caters for data locality, parallelism and vectorization simultaneously. Rather than tiling the iteration space from inside, we take an exterior approach with a predefined hierarchy, simple regular parallelogram tiles and a locality preserving parallelization. These advantages come at the cost of an irregular work-load distribution but a tightly integrated load-balancer ensures a high utilization of all resources. }, } @INPROCEEDINGS{StShPa_11CATS, AUTHOR = {Strzodka, Robert and Shaheen, Mohammed and Pajak, Dawid and Seidel, Hans-Peter}, TITLE = {Cache Accurate Time Skewing in Iterative Stencil Computations}, BOOKTITLE = {Proceedings of the 40th International Conference on Parallel Processing (ICPP)}, PADDRESS = {New York}, ADDRESS = {Taipei, Taiwan}, PUBLISHER = {IEEE}, MONTH = {September}, DOI = {http://dx.doi.org/10.1109/ICPP.2011.47}, YEAR = {2011}, PAGES = {517--581}, } @MASTERSTHESIS{Sunkel2006, AUTHOR = {Sunkel, Martin}, TITLE = {Face Detection and 3D Face Reconstruction}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Diploma thesis}, MONTH = {March}, YEAR = {2006}, ABSTRACT = {A fully automated 3D face reconstruction system for faces in 2D images is presented. It is implemented incorporating a method for facial feature detection into the initialization of the 3D face reconstruction process provided by Blanz et al.[2][3]. The initialization of that method takes alignments of previously selected facial feature points with their according vertices in the 3D face model. Several methods for face detection are presented and discussed. In order to reliably detect facial features independently of rotation and size of a face, support vector classifiers are applied. Their data are represented by the gradient of the images used for training. The training images are generated by using the 3D Morphable Face Model[2]. They are selected in a database of face images with rotations around the vertical axis that was previously fitted to the Morphable Model. That enables to select facial features within these images without user interaction. In order to protect against detection outliers (which would disturb the reconstruction) the feature points are validated by each other on base of their detected geometric position. On base of the detection results a heuristic is provided filling up discarded feature points.}, } @INPROCEEDINGS{Sunkel2007, AUTHOR = {Sunkel, Martin and Rosenhahn, Bodo and Seidel, Hans-Peter}, EDITOR = {Elgammal, Ahmed and Rosenhahn, Bodo and Klette, Reinhard}, TITLE = {Silhouette Based Generic Model Adaptation for Marker-Less Motion Capturing}, BOOKTITLE = {Human Motion - Understanding, Modeling, Capture and Animation : Second Workshop, Human Motion 2007}, PADDRESS = {Berlin, Germany}, ADDRESS = {Rio de Janeiro, Brazil}, PUBLISHER = {Springer}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {4814}, ISBN = {3-540-75702-3}, DOI = {10.1007/978-3-540-75703-0_9}, YEAR = {2007}, PAGES = {119--135}, ABSTRACT = {This work presents a marker-less motion capture system that incorporates an approach to smoothly adapt a generic model mesh to the individual shape of a tracked person. This is done relying on extracted silhouettes only. Thus, during the capture process the 3D model of a tracked person is learned. Depending on a sparse number of 2D-3D correspondences, that are computed along normal directions from image sequences of different cameras, a Laplacian mesh editing tool generates the final adapted model. With the increasing number of frames an approach for temporal coherence reduces the effects of insufficient correspondence data to a minimum and guarantees smooth adaptation results. Further, we present experiments on non-optimal data that show the robustness of our algorithm.}, } @ARTICLE{Sunkel2013, AUTHOR = {Sunkel, Martin and Jansen, Silke and Wand, Michael and Seidel, Hans-Peter}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, TITLE = {A Correlated Parts Model for Object Detection in Large 3D Scans}, NUMBER = {2}, MONTH = {May}, VOLUME = {32}, YEAR = {2013}, PAGES = {1--8}, ABSTRACT = { This paper addresses the problem of detecting objects in 3D scans according to object classes learned from sparse user annotation. We model objects belonging to a class by a set of fully correlated parts, encoding dependencies between local shapes of different parts as well as their relative spatial arrangement. For an efficient and comprehensive retrieval of instances belonging to a class of interest, we introduce a new approximate inference scheme and a corresponding planning procedure. We extend our technique to hierarchical composite structures, reducing training effort and modeling spatial relations between detected instances. We evaluate our method on a number of real-world 3D scans and demonstrate its benefits as well as the performance of the new inference algorithm.}, } @ARTICLE{SunkelEG2011, AUTHOR = {Sunkel, Martin and Jansen, Silke and Wand, Michael and Eisemann, Elmar and Seidel, Hans-Peter}, EDITOR = {Chen, Min and Deussen, Oliver}, JOURNAL = {Computer Graphics Forum (Proc. EUROGRAPHICS 2011)}, TITLE = {Learning Line Features in {3D} Geometry}, BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)}, ORGANIZATION = {European Association for Computer Graphics}, ADDRESS = {Oxford, UK}, NUMBER = {2}, PUBLISHER = {Blackwell}, MONTH = {April}, VOLUME = {30}, DOI = {10.1111/j.1467-8659.2011.01858.x}, YEAR = {2011}, PAGES = {267--276}, } @PHDTHESIS{SunkelThesis2013, AUTHOR = {Sunkel, Martin}, TITLE = {Statistical Part-based Models for Object Detection in Large 3D Scans}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, ADDRESS = {Saarbr{\"u}cken}, PUBLISHER = {Saarl{\"a}ndische Universit{\"a}ts- und Landesbibliothek (SULB)}, MONTH = {September}, YEAR = {2013}, PAGES = {121}, ABSTRACT = {3D scanning technology has matured to a point where very large scale acquisition of high resolution geometry has become feasible. However, having large quantities of 3D data poses new technical challenges. Many applications of practical use require an understanding of semantics of the acquired geometry. Consequently scene understanding plays a key role for many applications. This thesis is concerned with two core topics: 3D object detection and semantic alignment. We address the problem of efficiently detecting large quantities of objects in 3D scans according to object categories learned from sparse user annotation. Objects are modeled by a collection of smaller sub-parts and a graph structure representing part dependencies. The thesis introduces two novel approaches: A part-based chain structured Markov model and a general part-based full correlation model. Both models come with efficient detection schemes which allow for interactive run-times.}, } @INPROCEEDINGS{sve05ioss, AUTHOR = {Isgro, Francesco and Odone, Francesca and Saleem, Waqar and Schall, Oliver}, EDITOR = {Falcidieno, Bianca and Magnenat-Thalmann, Nadia}, TITLE = {Clustering for Surface Reconstruction}, BOOKTITLE = {1st International Workshop towards Semantic Virtual Environments}, PADDRESS = {Villars, Switzerland}, ADDRESS = {Villars, Switzerland}, PUBLISHER = {MIRALab}, YEAR = {2005}, PAGES = {156--162}, ABSTRACT = {We consider applications of clustering techniques, Mean Shift and Self-Organizing Maps, to surface reconstruction (meshing) from scattered point data and review a novel kernel-based clustering method.}, } @INPROCEEDINGS{sve05ss, AUTHOR = {Schall, Oliver and Samozino, Marie}, EDITOR = {Falcidieno, Bianca and Magnenat-Thalmann, Nadia}, TITLE = {Surface from Scattered Points: A Brief Survey of Recent Developments}, BOOKTITLE = {1st International Workshop towards Semantic Virtual Environments}, PADDRESS = {Villars, Switzerland}, ADDRESS = {Villars, Switzerland}, PUBLISHER = {MIRALab}, YEAR = {2005}, PAGES = {138--147}, ABSTRACT = {The paper delivers a brief overview of recent developments in the field of surface reconstruction from scattered point data. The focus is on computational geometry methods, implicit surface interpolation techniques, and shape learning approaches.}, } @INPROCEEDINGS{Sykora2011, AUTHOR = {Sýkora, Daniel and Ben-Chen, Mirela and {\v{C}}ad{\'i}k, Martin and Whited, Brian and Simmons, Maryann}, EDITOR = {Collomosse, John and Assente, Paul}, TITLE = {TexToons: {Practical} Texture Mapping for Hand-drawn Cartoon Animations}, BOOKTITLE = {Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Non-Photorealistic Animation and Rendering (NPAR 2011)}, PADDRESS = {New York, NY}, ADDRESS = {Vancouver, Canada}, PUBLISHER = {ACM}, ISBN = {978-1-4503-0907-3}, DOI = {10.1145/2024676.2024689}, YEAR = {2011}, PAGES = {75--84}, } @ARTICLE{Sykora2014, AUTHOR = {Sýkora, Daniel and Kavan, Ladislav and {\v{C}}ad{\'i}k, Martin and Jamri{\v{s}}ka, Ond{\v{r}}ej and Jacobson, Alec and Whited, Brian and Simmons, Maryann and Sorkine-Hornung, Olga}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Bas-Relief Meshes for Adding Global Illumination Effects to Hand-Drawn Characters}, ADDRESS = {New York, NY, USA}, NUMBER = {2}, PUBLISHER = {ACM}, VOLUME = {33}, ISBN = {0730-0301}, YEAR = {2014}, PAGES = {1--16}, } @TECHREPORT{TariniLenschGoeseleSeidel2003, AUTHOR = {Tarini, Marco and Lensch, Hendrik P. A. and Goesele, Michael and Seidel, Hans-Peter}, TITLE = {3D Acquisition of Mirroring Objects}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Saarbr{\"u}cken}, NUMBER = {MPI-I-2003-4-001}, MONTH = {April}, YEAR = {2003}, PAGES = {37}, } @INPROCEEDINGS{Tarini:2002:SFD, AUTHOR = {Tarini, Marco and Lensch, Hendrik P. A. and Goesele, Michael and Seidel, Hans-Peter}, EDITOR = {Roble, Doug}, TITLE = {Shape from Distortion: 3D Range Scanning of Mirroring Objects}, BOOKTITLE = {SIGGRAPH 2002 (SIGGRAPH-02) : conference abstracts and applications}, TYPE = {Technical Sketch}, PADDRESS = {New York, USA}, ADDRESS = {San Antonio, Texas, USA}, PUBLISHER = {ACM}, ISBN = {1-58113-524-6}, YEAR = {2002}, PAGES = {248--248}, } @ARTICLE{Tarini:2004:AMO, AUTHOR = {Tarini, Marco and Lensch, Hendrik P. A. and Goesele, Michael and Seidel, Hans-Peter}, JOURNAL = {Graphical Models}, TITLE = {3D Acquisition of Mirroring Objects}, ADDRESS = {San Diego, USA}, NUMBER = {4}, PUBLISHER = {Academic Press}, MONTH = {July}, VOLUME = {67}, YEAR = {2005}, PAGES = {233--259}, ABSTRACT = {Objects with mirroring optical characteristics are left out of the scope of most 3D scanning methods. We present here a new automatic acquisition approach, shape-from-distortion, that focuses on that category of objects, requires only a still camera and a color monitor, and produces range scans (plus a normal and a reflectance map) of the target. Our technique consists of two steps: first, an improved environment matte is captured for the mirroring object, using the interference of patterns with different frequencies in order to obtain sub-pixel accuracy. Then, the matte is converted into a normal and a depth map by exploiting the self coherence of a surface when integrating the normal map along different paths. The results show very high accuracy, capturing even smallest surface details. The acquired depth maps can be further processed using standard techniques to produce a complete 3D mesh of the object. }, } @INPROCEEDINGS{Tarini:TF, AUTHOR = {Tarini, Marco and Yamauchi, Hitoshi and Haber, J{\"o}rg and Seidel, Hans-Peter}, EDITOR = {McCool, Michael and St{\"u}rzlinger, Wolfgang}, TITLE = {Texturing Faces}, BOOKTITLE = {Graphics Interface 2002}, ORGANIZATION = {Canadian Human-Computer Communications Society}, PADDRESS = {Natick, USA}, ADDRESS = {Calgary, Canada}, PUBLISHER = {A K Peters}, MONTH = {May}, ISBN = {1-56881-183-7}, YEAR = {2002}, PAGES = {89--98}, ABSTRACT = {We present a number of techniques to facilitate the generation of textures for facial modeling. In particular, we address the generation of facial skin textures from uncalibrated input photographs as well as the creation of individual textures for facial components such as eyes or teeth. Apart from an initial feature point selection for the skin texturing, all our methods work fully automatically without any user interaction. The resulting textures show a high quality and are suitable for both photo-realistic and real-time facial animation.}, } @ARTICLE{TautgesZKBWHMSE11_MotionReconstruction_TOG, AUTHOR = {Tautges, Jochen and Zinke, Arno and Kr{\"u}ger, Bj{\"o}rn and Baumann, Jan and Weber, Andreas and Helten, Thomas and M{\"u}ller, Meinard and Seidel, Hans-Peter and Eberhardt, Bernd}, JOURNAL = {ACM Transactions on Graphics}, TITLE = {Motion Reconstruction Using Sparse Accelerometer Data}, ADDRESS = {New York, NY}, NUMBER = {3}, PUBLISHER = {ACM}, MONTH = {May}, VOLUME = {30}, ISBN = {0730-0301}, DOI = {10.1145/1966394.1966397}, YEAR = {2011}, PAGES = {18:1--18:12}, } @MASTERSTHESIS{Tawara2000, AUTHOR = {Tawara, Takehiro}, TITLE = {Applications of Image-Based Rendering to high-quality walkthrough animation}, SCHOOL = {University of Aizu}, TYPE = {Master's thesis}, MONTH = {March}, YEAR = {2000}, ABSTRACT = {Rendering of high quality animation sequences is very computation intensive task. Traditional antialiased rendering image takes a few hours per frame and the sequence linearly takes a number of hours. Opposed to traditional rendering methods, Image-Based Rendering (IBR) derives an arbitrary view from other views. In this work, we propose fast rendering of antialiased animated sequences incorporating traditional ray tracing and IBR techniques.}, } @INPROCEEDINGS{Tawara2002, AUTHOR = {Tawara, Takehiro and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Greiner, G{\"u}nther and Niemann, Heinrich and Ertl, Thomas and Girod, Bernd and Seidel, Hans-Peter}, TITLE = {Localizing the Final Gathering for Dynamic Scenes using the Photon Map}, BOOKTITLE = {Proceedings of Vision, Modeling, and Visualization VMV 2002}, PADDRESS = {Berlin, Germany}, ADDRESS = {Erlangen, Germany}, PUBLISHER = {Akademische Verlagsgesellschaft Aka}, MONTH = {November}, ISBN = {1-58603-302-6}, YEAR = {2002}, PAGES = {69--76}, ABSTRACT = {Rendering of high quality animations with global illumination effects is very costly using traditional techniques designed for static scenes. In this paper we present an extension of the photon mapping algorithm to handle dynamic environments. First, for each animation segment the static irradiance cache is computed only once for the scene with all dynamic objects removed. Then, for each frame, the dynamic objects are inserted and the irradiance cache is updated locally in the scene regions whose lighting is strongly affected by the objects. In the remaining scene regions the photon map is used to correct the irradiance values in the static cache. As a result the overall animation rendering efficiency is significantly improved and the temporal aliasing is reduced.}, } @INPROCEEDINGS{Tawara2004a, AUTHOR = {Tawara, Takehiro and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Cohen-Or, Daniel and Jain, Lakhmi and Magnenat-Thalmann, Nadia}, TITLE = {Exploiting Temporal Coherence in Final Gathering for Dynamic Scenes}, BOOKTITLE = {Computer Graphics International (CGI 2004)}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {Crete, Greece}, PUBLISHER = {IEEE}, ISBN = {0-7695-2171-1}, YEAR = {2004}, PAGES = {110--119}, ABSTRACT = {Efficient global illumination computation in dynamically changing environments is an important practical problem. In high-quality animation rendering costly "final gathering" technique is commonly used. We extend this technique into temporal domain by exploiting coherence between the subsequent frames. For this purpose we store previously computed incoming radiance samples and refresh them evenly in space and time using some aging criteria. The approach is based upon a two-pass photon mapping algorithm with irradiance cache, but it can be applied also in other gathering methods. The algorithm significantly reduces the cost of expensive indirect lighting computation and suppresses temporal aliasing with respect to the state of the art frame-by-frame rendering techniques.}, } @INPROCEEDINGS{Tawara2004b, AUTHOR = {Tawara, Takehiro and Myszkowski, Karol and Dmitriev, Kirill and Havran, Vlastimil and Damez, Cyrille and Seidel, Hans-Peter}, EDITOR = {Pasko, Alexander}, TITLE = {Exploiting Temporal Coherence in Global Illumination (an invited paper)}, BOOKTITLE = {Spring Conference on Computer Graphics (SCCG 2004)}, PADDRESS = {New York, USA}, ADDRESS = {Budmerice, Slovakia}, PUBLISHER = {ACM}, ISBN = {1-58113-914-4}, YEAR = {2004}, PAGES = {23--33}, ABSTRACT = {Producing high quality animations featuring rich object appearance and compelling lighting effects is very time consuming using traditional frame-by-frame rendering systems. In this paper we present a number of global illumination and rendering solutions that exploit temporal coherence in lighting distribution for subsequent frames to improve the computation performance and overall animation quality. Our strategy relies on extending into temporal domain well-known global illumination techniques such as density estimation photon tracing, photon mapping, and bi-directional path tracing, which were originally designed to handle static scenes only.}, } @INPROCEEDINGS{Tawara2004c, AUTHOR = {Tawara, Takehiro and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Lever, Paul G.}, TITLE = {Efficient Rendering of Strong Secondary Lighting in Photon Mapping Algorithm}, BOOKTITLE = {Theory and Practice of Computer Graphics 2004}, ORGANIZATION = {UK chapter of the Eurographics Society}, PADDRESS = {Los Alamitos, USA}, ADDRESS = {University of Bournemouth, UK}, PUBLISHER = {IEEE}, ISBN = {0-7695-2137-1}, YEAR = {2004}, PAGES = {174--178}, ABSTRACT = {In this paper we propose an efficient algorithm for handling strong secondary light sources within the photon mapping framework. We introduce an additional photon map as an implicit representation of such light sources. At the rendering stage this map is used for the explicit sampling of strong indirect lighting in a similar way as it is usually performed for primary light sources. Our technique works fully automatically, improves the computation performance, and leads to a better image quality than traditional rendering approaches.}, } @PHDTHESIS{TawaraPhD06, AUTHOR = {Tawara, Takehiro}, TITLE = {Efficient Global Illumination for Dynamic Scenes}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Doctoral dissertation}, MONTH = {November}, YEAR = {2006}, } @INPROCEEDINGS{Templin2011, AUTHOR = {Templin, Krzysztof and Didyk, Piotr and Ritschel, Tobias and Eisemann, Elmar and Myszkowski, Karol and Seidel, Hans-Peter}, EDITOR = {Nishita, Tomoyuki and {\v{D}}urikovi{\v{c}}, Roman}, TITLE = {Apparent Resolution Enhancement for Animations}, BOOKTITLE = {27th Spring Conference on Computer Graphics (SCCG)}, PADDRESS = {Bratislava, Slovakia}, ADDRESS = {Vini{\v{c}}n{\'e}, Slovakia}, PUBLISHER = {Comenius University}, YEAR = {2011}, PAGES = {85--92}, ABSTRACT = {Presenting the variety of high resolution images captured by high-quality devices, or generated on the computer, is challenging due to the limited resolution of current display devices. Our recent work addressed this problem by taking into account human perception. By applying a specific motion to a high-resolution image shown on a low-resolution display device, human eye tracking and integration could be exploited to achieve apparent resolution enhancement. To this end, the high-resolution image is decomposed into a sequence of temporally varying low-resolution images that are displayed at high refresh rates. However, this approach is limited to a specific class of simple or constant movements, i.e. ``panning''. In this work, we generalize this idea to arbitrary motions, as well as to videos with arbitrary motion flow. The resulting image sequences are compared to a range of other down-sampling methods.}, } @ARTICLE{Templin2012, AUTHOR = {Templin, Krzysztof and Didyk, Piotr and Ritschel, Tobias and Myszkowski, Karol and Seidel, Hans-Peter}, JOURNAL = {ACM Transactions on Graphics (Proc. ACM SIGGRAPH)}, TITLE = {Highlight Microdisparity for Improved Gloss Depiction}, ADDRESS = {New York}, NUMBER = {4}, PUBLISHER = {ACM}, MONTH = {July}, VOLUME = {31}, ISBN = {0730-0301}, DOI = {10.1145/2185520.2185588}, YEAR = {2012}, PAGES = {92:1--92:5}, ABSTRACT = {Human stereo perception of glossy materials is substantially different from the perception of diffuse surfaces: A single point on a diffuse object appears the same for both eyes, whereas it appears different to both eyes on a specular object. As highlights are blurry reflections of light sources they have depth themselves, which is different from the depth of the reflecting surface. We call this difference in depth impression the ``highlight disparity''. Due to artistic motivation, for technical reasons, or because of incomplete data, highlights often have to be depicted on-surface, without any disparity. However, it has been shown that a lack of disparity decreases the perceived glossiness and authenticity of a material. To remedy this contradiction, our work introduces a technique for depiction of glossy materials, which improves over simple on-surface highlights, and avoids the problems of physical highlights. Our technique is computationally simple, can be easily integrated in an existing (GPU) shading system, and allows for local and interactive artistic control.}, } @MASTERSTHESIS{Tevs2006, AUTHOR = {Tevs, Art}, TITLE = {{Multi-Stereorekonstruktion nicht-lambert'scher Oberflaechen mittels Graph-Cut Optimierung}}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Bachelor thesis}, ADDRESS = {Saarbruecken, Germany}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {February}, YEAR = {2006}, ABSTRACT = {In the last years computer vision problems like dense depth map reconstruction from given images became more and more important. There exists a lot of algorithms that are trying to assign a depth value to each pixel of the input image. Most of them have a strong assumption on the pixels of the object e.g. the color value constancy. In this work we are trying to create a dense depth map for each input image without setting any strong assumptions, like diffuse surface, on the objects. We postulate that problem as energy minimization problem and try to solve it by using graph-cut approach. We also utilize the GPU to compute some parts of the energy function that does increase the whole computation speed immensely. At the end we show the stability of our algorithm by computing the depth maps on "real world" images. }, } @MASTERSTHESIS{Tevs2007, AUTHOR = {Tevs, Art}, TITLE = {Realistic Real-time Rendering of Refractive Objects}, SCHOOL = {Universit{\"a}t des Saarlandes}, TYPE = {Master's thesis}, ADDRESS = {Saarbruecken, Germany}, PUBLISHER = {Universit{\"a}t des Saarlandes}, MONTH = {July}, YEAR = {2007}, ABSTRACT = {Physically correct rendering of inhomogeneous refractive objects in real-time is a difficult task. Many published works which address this problem require either a lot of computational power or can only re