@phdthesis{birsak-thesis, title = "Discrete Optimization on Graphs and Grids for the Creation of Navigational and Artistic Imagery", author = "Michael Birsak", year = "2018", month = sep, address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", school = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", URL = "https://www.cg.tuwien.ac.at/research/publications/2018/birsak-thesis/", } @article{birsak-2017-dpe, title = "Dynamic Path Exploration on Mobile Devices", author = "Michael Birsak and Przemyslaw Musialski and Peter Wonka and Michael Wimmer", year = "2018", abstract = "We present a novel framework for visualizing routes on mobile devices. Our framework is suitable for helping users explore their environment. First, given a starting point and a maximum route length, the system retrieves nearby points of interest (POIs). Second, we automatically compute an attractive walking path through the environment trying to pass by as many highly ranked POIs as possible. Third, we automatically compute a route visualization that shows the current user position, POI locations via pins, and detail lenses for more information about the POIs. The visualization is an animation of an orthographic map view that follows the current user position. We propose an optimization based on a binary integer program (BIP) that models multiple requirements for an effective placement of detail lenses. We show that our path computation method outperforms recently proposed methods and we evaluate the overall impact of our framework in two user studies.", month = may, doi = "10.1109/TVCG.2017.2690294", issn = "1077-2626", journal = "IEEE Transactions on Visualization and Computer Graphics", number = "5", volume = "24", pages = "1784--1798", URL = "https://www.cg.tuwien.ac.at/research/publications/2018/birsak-2017-dpe/", } @bachelorsthesis{kendlbacher-2016, title = "Introduction Of OpenStreetMap For The Automatic Generation Of Destination Maps", author = "Felix Kendlbacher", year = "2016", abstract = "A destination map allows all travelers, within the given region of interest, to reach the same destination, no matter where exactly they start their journey at. For this purpose the important roads for traversing the road network are chosen, while the non-important roads are removed for clarity. These selected roads are then simplified to reduce unnecessary complexity, while maintaining the structure of the road network. The chosen data is then tweaked to increase the visibility of the small roads. During this process the layout is iteratively changed and evaluated according to certain aspects, and if a newly proposed layout performs better than the old one, that new one forms the basis for all future changes. In this work a method for automatically creating destination maps is implemented based on the algorithm proposed in the paper by Kopf et al. [KAB+10], with efforts made to improve the original work.", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", school = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", keywords = "Destination Maps, OpenStreetMap", URL = "https://www.cg.tuwien.ac.at/research/publications/2016/kendlbacher-2016/", } @bachelorsthesis{Kollmann-2015-DoF, title = "Depth of Field: Point Splatting on Per-Pixel Layers", author = "Christoph Kollmann", year = "2015", abstract = "This bachelor’s thesis is about a depth of field rendering algorithm using point splatting on per-pixel layers. The intuitive procedure just uses specific adjustable parameters for the lens of a camera to generate the desired effect in real-time. Using nothing but the depth information of a scene, the depth of field can be computed. The so called circles of confusion are the representing value of the blur rate for objects that are out of focus. Depending on the distance between the focal plane and the current pixel, an expansion takes place because of the redirecting nature of a lens. The following required information is retrieved using an intensity distribution function. To avoid intensity leakage and provide a full opaque picture, the entire effect is done discrete on the screen space. This prevents subsampling and enables almost correct alpha value normalization. As stated before, an intensity distribution function is required, but in a discrete form. This is an addition to the paper, where that function is preprocessed in the application and provided for the shader directly. A high resolution texture of the desired intensity distribution function is provided as input to a shader program that renders multiple discrete versions. Another further addition prepares the texture by normalization, consuming more memory, but saving lots of time during computation. The last part of this paper includes a defocused highlights implementation, where a tone-mapping is applied to mimic them. In general, the luminance of a pixel is computed by a simple formula, summing up the three colors with adjustment factors. Depending on this value and some parameters, the color is adjusted where bright regions are enhanced to construct this effect. This thesis implements and extends this work and is used to test its performance after seven years when it was published. Using different configurations for the effect, the provided stable framerates of the results are used as metric for benchmarking. ", month = sep, address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", school = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", keywords = "depth-of-field, deferred rendering, real-time rendering", URL = "https://www.cg.tuwien.ac.at/research/publications/2015/Kollmann-2015-DoF/", } @mastersthesis{Adorjan-2015, title = "The OpenSFM Database", author = "Matthias Adorjan", year = "2015", abstract = "Besides using high-cost laser scanning equipment to capture large point clouds for topographical or architectural purposes, nowadays other, more affordable approaches exist. Structure-from-motion (SfM) in combination with multi-view stereo (MVS) is such a low-cost photogrammetric method used to generate large point datasets. It refers to the process of estimating three-dimensional structures out of two-dimensional image sequences. These sequences can even be captured with conventional consumer-grade digital cameras. In our work we aim to a establish a free and fully accessible structure-from-motion system, based on the idea of collaborative projects like OpenStreetMap. Our client-server system, called OpenSfM, consists of a web front-end which lets the user explore, upload and edit SfM-datasets and a back-end that answers client requests and processes the uploaded data and stores it in a database. The front-end is a virtual tourism client which allows the exploration of georeferenced point clouds together with their corresponding SfM-data like camera parameters and photos. The information is rendered in the context of an interactive virtual globe. An upload functionality makes it possible to integrate new SfM-datasets into the system and improve or extend existing datasets by adding images that fill missing areas of the affected point cloud. Furthermore, an edit mode allows the correction of georeferencing or reconstruction errors. On the other side the back-end evaluates the uploaded information and generates georeferenced point datasets using a state-of-the-art SfM engine and the GPS data stored in the uploaded images. The generated point clouds are preprocessed, such that they can be used by the front-end’s point cloud renderer. After that, they are stored together with the uploaded images and SfM parameters in the underlying database. On the whole, our system allows the gathering of SfM-datasets that represent different sights or landmarks, but also just locally famous buildings, placed all over the world. Those datasets can be explored in an interactive way by every user who accesses the virtual tourism client using a web browser.", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", school = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", URL = "https://www.cg.tuwien.ac.at/research/publications/2015/Adorjan-2015/", } @article{fan-2014-scfl, title = "Structure Completion for Facade Layouts", author = "Lubin Fan and Przemyslaw Musialski and Ligang Liu and Peter Wonka", year = "2014", abstract = "We present a method to complete missing structures in facade layouts. Starting from an abstraction of the partially observed layout as a set of shapes, we can propose one or multiple possible completed layouts. Structure completion with large missing parts is an ill-posed problem. Therefore, we combine two sources of information to derive our solution: the observed shapes and a database of complete layouts. The problem is also very difficult, because shape positions and attributes have to be estimated jointly. Our proposed solution is to break the problem into two components: a statistical model to evaluate layouts and a planning algorithm to generate candidate layouts. This ensures that the completed result is consistent with the observation and the layouts in the database.", month = nov, journal = "ACM Transactions on Graphics (ACM SIGGRAPH Asia 2014)", volume = "33", number = "6", pages = "210:1--210:11", keywords = "facade modeling, facade completion, structure completion, urban modeling", URL = "https://www.cg.tuwien.ac.at/research/publications/2014/fan-2014-scfl/", } @mastersthesis{steiner-2014-da, title = "Structure-aware shape manipulation", author = "Bernhard Steiner", year = "2014", abstract = "In computer graphics one of the most expensive fields is content creation. While today the rendering part is highly sophisticated and automated, 3d modeling is still a very challenging task due to the steep learning curve and the amount of work time required. Although there are a lot of free model databases available in the internet, this models are in general not perfectly suited to the customers needs and have to be adapted. Structure-aware shape manipulation deals with the complexity of creating variations, or adapting a given input model while retaining global features like symmetry and connectivity. The majority of existing algorithms only try to preserve structural features, or have very limited support for adapting the overall structure of the model to changes made by the user. The lack of complex structural changes in the model, for example allowing a wheel to change the number of strokes, limits the number of possible variations this algorithms can generate. The aim of this thesis is to exploit the possibilities of using curves and curve spaces to find a better representation of the input model, allowing for complex structural adaptions. In addition to this the usefulness of a multi-layered graphs to represent the model and it's constraints should be investigated. ", month = sep, address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", school = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", keywords = " structure-aware model manipulation, modelling, cg", URL = "https://www.cg.tuwien.ac.at/research/publications/2014/steiner-2014-da/", } @inproceedings{charpenay-2014-sgn, title = "Sampling Gabor Noise in the Spatial Domain", author = "Victor Charpenay and Bernhard Steiner and Przemyslaw Musialski", year = "2014", abstract = "Gabor noise is a powerful technique for procedural texture generation. Contrary to other types of procedural noise, its sparse convolution aspect makes it easily controllable locally. In this paper, we demonstrate this property by explicitly introducing spatial variations. We do so by linking the sparse convolution process to the parametrization of the underlying surface. Using this approach, it is possible to provide control maps for the parameters in a natural and convenient way. In order to derive intuitive control of the resulting textures, we accomplish a small study of the influence of the parameters of the Gabor kernel with respect to the outcome and we introduce a solution where we bind values such as the frequency or the orientation of the Gabor kernel to a user-provided control map in order to produce novel visual effects.", month = may, isbn = "978-80-223-3601-7", publisher = "ACM Press", location = "Smolenice castle, Slovakia", editor = "Diego Gutierrez", booktitle = "Proceedings of the 30th Spring Conference on Computer Graphics - SCCG ", pages = "79--82", keywords = "texture synthesis, Gabor noise, procedural texture", URL = "https://www.cg.tuwien.ac.at/research/publications/2014/charpenay-2014-sgn/", } @article{birsak-2014-agtb, title = "Automatic Generation of Tourist Brochures", author = "Michael Birsak and Przemyslaw Musialski and Peter Wonka and Michael Wimmer", year = "2014", abstract = "We present a novel framework for the automatic generation of tourist brochures that include routing instructions and additional information presented in the form of so-called detail lenses. The first contribution of this paper is the automatic creation of layouts for the brochures. Our approach is based on the minimization of an energy function that combines multiple goals: positioning of the lenses as close as possible to the corresponding region shown in an overview map, keeping the number of lenses low, and an efficient numbering of the lenses. The second contribution is a route-aware simplification of the graph of streets used for traveling between the points of interest (POIs). This is done by reducing the graph consisting of all shortest paths through the minimization of an energy function. The output is a subset of street segments that enable traveling between all the POIs without considerable detours, while at the same time guaranteeing a clutter-free visualization. Video: http://www.youtube.com/watch?v=t3w7uxzSR-Y", month = apr, journal = "Computer Graphics Forum (Proceedings of EUROGRAPHICS 2014)", volume = "33", number = "2", issn = "1467-8659", pages = "449--458", URL = "https://www.cg.tuwien.ac.at/research/publications/2014/birsak-2014-agtb/", } @inproceedings{birsak-2013-sta, title = "Seamless Texturing of Archaeological Data", author = "Michael Birsak and Przemyslaw Musialski and Murat Arikan and Michael Wimmer", year = "2013", abstract = "In this paper we propose a framework for out-of-core real-time rendering of high-quality textured archaeological data-sets. Our input is a triangle mesh and a set of calibrated and registered photographs. Our system performs the actual mapping of the photos to the mesh for high-quality reconstructions, which is a task referred to as the labeling problem. Another problem of such mappings are seams that arise on junctions between triangles that contain information from different photos. These are are approached with blending methods, referred to as leveling. We address both problems and introduce a novel labeling approach based on occlusion detection using depth maps that prevents texturing of parts of the model with images that do not contain the expected region. Moreover, we propose an improved approach for seam-leveling that penalizes too large values and helps to keep the resulting colors in a valid range. For high-performance visualization of the 3D models with a huge amount of textures, we make use of virtual texturing, and present an application that generates the needed texture atlas in significantly less time than existing scripts. Finally, we show how the mentioned components are integrated into a visualization application for digitized archaeological site.", month = oct, isbn = "978-1-4799-3168-2 ", publisher = "IEEE", note = "DOI: 10.1109/DigitalHeritage.2013.6743749", location = "Marseille, France", booktitle = "Digital Heritage International Congress (DigitalHeritage), 2013", pages = "265--272 ", keywords = "digital cultural heritage, out-of-core real-time rendering, seamless texturing, virtual texturing", URL = "https://www.cg.tuwien.ac.at/research/publications/2013/birsak-2013-sta/", } @bachelorsthesis{schaukowitsch-2013-fls, title = "Pano.NET - An interactive application for camera calibration, image stitching and projective operations", author = "Florian Schaukowitsch", year = "2013", abstract = "The automatic generation of panoramic image mosaics has evolved into a mainstream consumer application in recent years, thanks to modern algorithms and methods that can generate beautiful- looking, artifact-free panoramas with minimal user interaction. Simple panoramas are only one possible application, other examples such as the scene-aware Google Street View show what is possible using these technologies. Software libraries such as OpenCV allow integration of image stitching and related operations into a multitude of applications with relative ease. In this thesis, we present an interactive application (Pano.NET) that allows the user to experiment with several commonly used methods for camera calibration and image stitching (as implemented in OpenCV), and export related data such as registration information. We also give an overview of the used algorithms. In addition, we implemented a projective drawing system that allows the user to draw lines and polygons onto a panorama and on the views that it consists of. Finally, a method is presented that can generate six-sided cube maps out of a spherical panorama.", month = sep, address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", school = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", keywords = "multi-view image processing, panorama imaging, image compositing", URL = "https://www.cg.tuwien.ac.at/research/publications/2013/schaukowitsch-2013-fls/", } @article{musialski-2013-surcgf, title = "A Survey of Urban Reconstruction", author = "Przemyslaw Musialski and Peter Wonka and Daniel G. Aliaga and Michael Wimmer and Luc van Gool and Werner Purgathofer", year = "2013", abstract = "This paper provides a comprehensive overview of urban reconstruction. While there exists a considerable body of literature, this topic is still under very active research. The work reviewed in this survey stems from the following three research communities: computer graphics, computer vision, and photogrammetry and remote sensing. Our goal is to provide a survey that will help researchers to better position their own work in the context of existing solutions, and to help newcomers and practitioners in computer graphics to quickly gain an overview of this vast field. Further, we would like to bring the mentioned research communities to even more interdisciplinary work, since the reconstruction problem itself is by far not solved.", month = sep, issn = "1467-8659", journal = "Computer Graphics Forum", number = "6", volume = "32", pages = "146--177", keywords = "facade modeling, state-of-the-art report, multi-view stereo, structure from motion, urban modeling, urban reconstruction, inverse-procedural modeling, facade reconstruction", URL = "https://www.cg.tuwien.ac.at/research/publications/2013/musialski-2013-surcgf/", } @bachelorsthesis{sperl-2013-BA, title = "Procedural Textures for Architectural Models ", author = "Georg Sperl", year = "2013", abstract = "Texturing plays an extremely important role in computer graphics. They may for example give flat objects colour patterns and depth or roughness. However it is often difficult to find or create fitting textures for a geometry or surface. Creating textures by hand can prove extremely difficult as problems with seams or distortion may occur, which make the texture look unrealistic. In order to counter these problems many different kinds of texture synthesis have been developed among which procedural textures hold an important position. The types of texture synthesis methods vary from example-based synthesis to procedural noise, cellular textures and more, which can produce a wide array of different results. The aim of this paper is to introduce the reader into related topics of texture synthesis and to introduce a method for generating cellular brick pattern textures that represent brick bonds that are used in real architecture taking correct handling of wall and window borders into consideration. The method uses few parameters to control the synthesis process. In addition a method for generating random stone patterns is introduced. ", month = sep, address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", school = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", keywords = "brick texutre synthesis, cellular textures, texture synthesis, stone texture synthesis", URL = "https://www.cg.tuwien.ac.at/research/publications/2013/sperl-2013-BA/", } @inproceedings{Musialski-2013-ipmum, title = "Inverse-Procedural Methods for Urban Models", author = "Przemyslaw Musialski and Michael Wimmer", year = "2013", abstract = "Procedural modeling is an elegant and fast way to generate huge complex and realistically looking urban sites. Due to its generative nature it can also be referred to as forward-procedural modeling. Its major drawback is the usually quite complicated way of control. To overcome this difficulty a novel modeling paradigm has been introduced: it is commonly referred to as inverse procedural modeling, and its goal is to generate compact procedural descriptions of existing models---in the best case in an automatic manner as possible. These compact procedural representations can be used as a source for the synthesis of identical or similar objects, applied in various simulations and other studies of urban environments. We believe that this technology is still a widely unexplored ground and that it will prove itself as a very important tool in the reconstruction process. In this paper we sketch how inverse procedural modeling can be applied in the urban modeling field.", month = may, isbn = "978-3-905674-46-0", publisher = "Eurographics Association", location = "Girona, Spain", issn = "2307-8251", editor = "V. Tourre and G. Besuievsky", booktitle = "Proceedings of Eurographics Workshop on Urban Data Modelling and Visualisation (UDMV 2013)", pages = "31--32", keywords = "inverse procedural modeling, urban modeling, urban reconstruction", URL = "https://www.cg.tuwien.ac.at/research/publications/2013/Musialski-2013-ipmum/", } @mastersthesis{zapotocky_2013_ma, title = "Image-Based Modeling with Polyhedral Primitives", author = "Stephan Zapotocky", year = "2013", abstract = "The reconstruction of 3D models out of image data plays an important role in many research areas. Previous work has brought fully automatic or semi-automatic algorithms for extracting 3D data out of multiple images or videos. The output is usually a 3D point cloud, which is a big challenge when further manipulation of the scanned object, such as modeling and texturing, is needed. The goal of this master thesis is the research on methods for creating simple geometry out of such initial data. In the process of the work a modeling tool will be implemented, which enables users to integrate polyhedral primitives in a 3D point dataset. Being assisted by optimization techniques, the user shall be able to simplify such a 3D point cloud to a combination of basic geometric objects, which allow an easy manipulation in further tasks.", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", school = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", keywords = "interactive modeling, image-based modeling", URL = "https://www.cg.tuwien.ac.at/research/publications/2013/zapotocky_2013_ma/", } @studentproject{charpenay-2013-PR, title = "Adaptive Garbor Noise Sampling", author = "Victor Charpenay", year = "2013", keywords = "Garbor Noise, Procedural Texture", URL = "https://www.cg.tuwien.ac.at/research/publications/2013/charpenay-2013-PR/", } @bachelorsthesis{koessler-2013-BA, title = "Feature-Adaptive Catmull-Clark Subdivision on the GPU", author = "Christian K\"{o}{\ss}ler", year = "2013", abstract = "Catmull-Clark subdivision is a powerful standard modeling technique and has already been used extensively in CGI for motion pictures or computer games. An artist creates a coarse polygon mesh, that is computationally converted into a high-quality smooth surface. Due to the recursive nature of the subdivision algorithm and the large number of polygons, that are generated during the mesh-refinement, it is not well suited for realtime-environments. There exist several approaches to generate a Catmull-Clark subdivision surface which use current GPU technologies to overcome these issues. In this thesis, we use Compute Shaders for subdivision and a Cubic Bezier Patch which takes advantage of the tessellation pipeline to get an optimized algorithm without the loss of visual quality. With the presented method, the support of (Semi)Sharp Creases, which are an important feature to achieve a more realistic look, is also given. The practical part of this thesis is integrated into the Helix 3D Toolkit SharpDX Framework. ", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", school = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", keywords = "subdivision surfaces, geometric modeling, GPU tessellation, computer graphics", URL = "https://www.cg.tuwien.ac.at/research/publications/2013/koessler-2013-BA/", } @talk{musialski-2013-prag, title = "Facade Reconstruction: An Interactive Image-Based Approach", author = "Przemyslaw Musialski", year = "2013", abstract = "Modeling and reconstruction of urban environments is currently the subject of intensive research. In this talk I will present one specific subfield of urban reconstruction: interactive image-based facade reconstruction. In particular I will introduce insights into image-based interactive approaches which aim at the decomposition of facade imagery in order to generate well defined geometric models.", event = "Invited Talk at Czech Technical University in Prague", location = "Czech Technical University in Prague, Department of Computer Graphics and Interaction, Prague", keywords = "facade reconstruction, urban reconstruction", URL = "https://www.cg.tuwien.ac.at/research/publications/2013/musialski-2013-prag/", } @article{musialski_2012_fice, title = "A Framework for Interactive Image Color Editing", author = "Przemyslaw Musialski and Ming Cui and Jieping Ye and Anshuman Razdan and Peter Wonka", year = "2012", abstract = "We propose a new method for interactive image color replacement that creates smooth and naturally looking results with minimal user interaction. Our system expects as input a source image and rawly scribbled target color values and generates high quality results in interactive rates. To achieve this goal we introduce an algorithm that preserves pairwise distances of the signatures in the original image and simultaneously maps the color to the user defined target values. We propose efficient sub-sampling in order to reduce the computational load and adapt semi-supervised locally linear embedding to optimize the constraints in one objective function. We show the application of the algorithm on typical photographs and compare the results to other color replacement methods.", month = nov, journal = "The Visual Computer", number = "11", volume = "29", pages = "1173--1186", keywords = "interactive image editing, color manipulation, image processing, recoloring, computational photography", URL = "https://www.cg.tuwien.ac.at/research/publications/2012/musialski_2012_fice/", } @inproceedings{musialski-2012-sur, title = "A Survey of Urban Reconstruction", author = "Przemyslaw Musialski and Peter Wonka and Daniel G. Aliaga and Michael Wimmer and Luc van Gool and Werner Purgathofer", year = "2012", abstract = "This paper provides a comprehensive overview of urban reconstruction. While there exists a considerable body of literature, this topic is still under very active research. The work reviewed in this survey stems from the following three research communities: computer graphics, computer vision, and photogrammetry and remote sensing. Our goal is to provide a survey that will help researchers to better position their own work in the context of existing solutions, and to help newcomers and practitioners in computer graphics to quickly gain an overview of this vast field. Further, we would like to bring the mentioned research communities to even more interdisciplinary work, since the reconstruction problem itself is by far not solved. ", month = may, booktitle = "EUROGRAPHICS 2012 State of the Art Reports", location = "Cagliari, Sardinia, Italy", publisher = "Eurographics Association", series = "EG STARs", pages = "1--28", keywords = "facade modeling, structure from motion, multi-view stereo, urban reconstruction, inverse-procedural modeling, urban modeling, image-based modeling, city reconstruction, state-of-the-art report", URL = "https://www.cg.tuwien.ac.at/research/publications/2012/musialski-2012-sur/", } @article{musialski-2012-icb, title = "Interactive Coherence-Based Fa\c{c}ade Modeling", author = "Przemyslaw Musialski and Michael Wimmer and Peter Wonka", year = "2012", abstract = "We propose a novel interactive framework for modeling building fa\c{c}ades from images. Our method is based on the notion of coherence-based editing which allows exploiting partial symmetries across the fa\c{c}ade at any level of detail. The proposed workflow mixes manual interaction with automatic splitting and grouping operations based on unsupervised cluster analysis. In contrast to previous work, our approach leads to detailed 3d geometric models with up to several thousand regions per fa\c{c}ade. We compare our modeling scheme to others and evaluate our approach in a user study with an experienced user and several novice users.", month = may, journal = "Computer Graphics Forum (Proceedings of EUROGRAPHICS 2012)", volume = "31", number = "2", pages = "661--670", keywords = "facade modeling, urban modeling, facade reconstruction, image-based modeling", URL = "https://www.cg.tuwien.ac.at/research/publications/2012/musialski-2012-icb/", } @article{liu-2012-tcvd, title = "Tensor Completion for Estimating Missing Values in Visual Data", author = "Ji Liu and Przemyslaw Musialski and Peter Wonka and Jieping Ye", year = "2012", abstract = "In this paper we propose an algorithm to estimate missing values in tensors of visual data. Our methodology is built on recent studies about matrix completion using the matrix trace norm. The contribution of our paper is to extend the matrix case to the tensor case by proposing the first definition of the trace norm for tensors and then by building a working algorithm. First, we propose a definition for the tensor trace norm, that generalizes the established definition of the matrix trace norm. Second, similar to matrix completion, the tensor completion is formulated as a convex optimization problem. We developed three algorithms: SiLRTC, FaLRTC, and HaLRTC. The SiLRTC algorithm is simple to implement and employs a relaxation technique to separate the dependant relationships and uses the block coordinate descent (BCD) method to achieve a globally optimal solution; The FaLRTC algorithm utilizes a smoothing scheme to transform the original nonsmooth problem into a smooth one; The HaLRTC algorithm applies the alternating direction method of multipliers (ADMM) to our problem. Our experiments show potential applications of our algorithms and the quantitative evaluation indicates that our methods are more accurate and robust than heuristic approaches.", month = jan, issn = "0162-8828", journal = "IEEE Transactions on Pattern Analysis & Machine Intelligence (PAMI)", number = "1", volume = "35", pages = "208--220", keywords = "matrix completion, trace norm, tensor completion", URL = "https://www.cg.tuwien.ac.at/research/publications/2012/liu-2012-tcvd/", } @studentproject{manpreet_kainth-2012-rus, title = "Rendering of Urban Scenes", author = "Manpreet Kainth", year = "2012", URL = "https://www.cg.tuwien.ac.at/research/publications/2012/manpreet_kainth-2012-rus/", } @talk{musialski_2012_aachen, title = "Image-Based Approaches for Facade Reconstruction", author = "Przemyslaw Musialski", year = "2012", abstract = "Modeling and reconstruction of urban environments is currently the subject of intensive research. There is a wide range of possible applications, like cyber-tourism, computer games, and the entertainment industries in general, as well as urban planning, architecture, traffic simulation, driving guidance, to name but a few. In this talk I will present one specific subfield of urban reconstruction: image-based facade modeling and reconstruction. In particular I will provide an overview of recent automatic and interactive approaches which aim at the decomposition of facade imagery in order to generate well defined geometric models.", event = "Invited talk at RWTH Aachen University, Computer Graphics Group", location = "RWTH Aachen, Germany", URL = "https://www.cg.tuwien.ac.at/research/publications/2012/musialski_2012_aachen/", }