{"title":"Estimation of Multiple Orientations and Multiple Motions in Multi-Dimensional Signals","authors":"I. Stuke, E. Barth, C. Mota","doi":"10.1109/SIBGRAPI.2006.15","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.15","url":null,"abstract":"The estimation of multiple orientations in multidimensional signals is a strongly non-linear problem to which a two-step solution is here presented. First, the problem is linearized by introducing the so-called mixed-orientation parameters as a unique, albeit implicit, descriptor of the orientations. Second, the non-linearities are decomposed such as to find the individual orientations. For two-dimensional signals, e.g., images, this decomposition step is solved by simply determining the roots of a polynomial. For multi-dimensional signals, the nD decomposition problem is solved by reducing it to a cascade of 2D decomposition problems. In this way, a full solution for the estimation of any number of orientations in any dimension is achieved for the first time","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129998291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Afonso Paiva, H. Lopes, T. Lewiner, L. H. Figueiredo
{"title":"Robust adaptive meshes for implicit surfaces","authors":"Afonso Paiva, H. Lopes, T. Lewiner, L. H. Figueiredo","doi":"10.1109/SIBGRAPI.2006.40","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.40","url":null,"abstract":"This work introduces a robust algorithm for computing good polygonal approximations of implicit surfaces, where robustness entails recovering the exact topology of the implicit surface. Furthermore, the approximate triangle mesh adapts to the geometry and to the topology of the real implicit surface. This method generates an octree subdivided according to the interval evaluation of the implicit function in order to guarantee the robustness, and to the interval automatic differentiation in order to adapt the octree to the geometry of the implicit surface. The triangle mesh is then generated from that octree through an enhanced dual marching","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123262836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fast and Easy Computation of Approximate Smallest Enclosing Balls","authors":"T. Martinetz, A. M. Mamlouk, C. Mota","doi":"10.1109/SIBGRAPI.2006.20","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.20","url":null,"abstract":"The incremental Badoiu-Clarkson algorithm finds the smallest ball enclosing n points in d dimensions with at least O(1/radict) precision, after t iteration steps. The extremely simple incremental step of the algorithm makes it very attractive both for theoreticians and practitioners. A simplified proof for this convergence is given. This proof allows to show that the precision increases, in fact, even as O(u/t) with the number of iteration steps. Computer experiments, but not yet a proof, suggest that the u, which depends only on the data instance, is actually bounded by min{radic2d, radic2n}. If it holds, then the algorithm finds the smallest enclosing ball with epsi precision in at most 0(ndradic/dm/epsi) time, with dm = min{d, n}","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125031388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance Evaluation of a Hybrid Algorithm for Collision Detection in Crowded Interactive Environments","authors":"R. S. Rocha, M. A. Rodrigues, L. Taddeo","doi":"10.1109/SIBGRAPI.2006.34","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.34","url":null,"abstract":"Crowded interactive environments composed of a large number of objects need a fast, accurate and scalable mechanism for collision detection. This work presents a detailed performance analysis of a hybrid collision detection algorithm for highly interactive and crowded environments. Extensive tests were conducted and the performance of the algorithm was evaluated in terms of output quality and running time, by applying a usability criteria. The results show that interactive frame rates for environments composed of 1000 colliding objects can be successfully achieved with a good level of user satisfaction using the sweep & prune algorithm together with sphere-trees generated by the combined algorithm","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131296146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Two-Level Interaction Transfer Function Design Combining Boundary Emphasis, Manual Specification and Evolutive Generation","authors":"F. Pinto, C. Freitas","doi":"10.1109/SIBGRAPI.2006.45","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.45","url":null,"abstract":"Direct volume rendering plays an important role in the investigation of volumetric data. In order to display these data, their values must be associated to optical properties. This task is accomplished by transfer functions (TFs), which assign properties like color and opacity to voxel values in the volume. TFs are very important to produce informative images that reveal volume features, but their specification is a non-trivial and unintuitive problem. Without any help in the TF design process, the user goes through a frustrating and time-consuming trial-and-error process. This work proposes a two-level interactive framework combining a few useful semi-automatic design techniques for one-dimensional opacity and color transfer functions. We use the histogram approach proposed by Kindlmann and Durkin, manual design aided by dual domain interaction (space domain and TF domain), stochastic evolutive design and qualitative analysis of multiple TF possibilities using a design galleries-inspired method (thumbnails in the first level of interaction and refinement of zoomed-in images in the second level). The combination of these strategies offers precise control over the transfer function specification, plus some interactive guidance, as well as semi-automatic and evolutive search in the TF space","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124428499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adapted Dynamic Meshes for Deformable Surfaces","authors":"F. D. Goes, F. Bergo, A. Falcão, S. Goldenstein","doi":"10.1109/SIBGRAPI.2006.6","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.6","url":null,"abstract":"Deformable objects play an important role in many applications, such as animation and simulation. Effective computation with deformable surfaces can be achieved through the use of dynamic meshes. In this paper, we introduce a framework for constructing and maintaining a time-varying adapted mesh structure that conforms to the underlying deformable surface. The adaptation function employs error metrics based on stochastic sampling. Our scheme combines normal and tangential geometric correction with refinement and simplification resolution control. Furthermore, it applies to both parametric and implicit surface descriptions. As the result, we obtain a simple and efficient general scheme that can be used for a wide range of computations","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123602318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Cuadros-Vargas, Leandro C. Gerhardinger, M. Castro, J. B. Neto, L. G. Nonato
{"title":"Improving 2D mesh image segmentation with Markovian Random Fields","authors":"A. Cuadros-Vargas, Leandro C. Gerhardinger, M. Castro, J. B. Neto, L. G. Nonato","doi":"10.1109/SIBGRAPI.2006.26","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.26","url":null,"abstract":"Traditional mesh segmentation methods normally operate on geometrical models with no image information. On the other hand, 2D image-based mesh generation and segmentation counterparts, such as Imesh (A. Cuadros-Vargas et. al, 2005) perform the task by following a set of well defined rules derived from the geometry of the triangles, but with no statistical information of the mesh elements. This paper presents a novel segmentation method that combines the original Imesh image-based segmentation approach with Markovian random field (MRF) models. It takes an image as input, generate a mesh of triangles and, by treating the mesh as a Markovian field, produces quality unsupervised segmentation. The results have demonstrated that the method not only provides better segmentation than that of original Imesh, but is also capable of producing MRF-like segmentation output for certain types of images, with considerable cut in processing times","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114872827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Guillermo Cámara Chávez, M. Cord, F. Precioso, S. Philipp-Foliguet, A. Araújo
{"title":"Video Segmentation by Supervised Learning","authors":"Guillermo Cámara Chávez, M. Cord, F. Precioso, S. Philipp-Foliguet, A. Araújo","doi":"10.1109/SIBGRAPI.2006.48","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.48","url":null,"abstract":"In most of video shot boundary detection algorithms, proposed in the literature, several parameters and thresholds have to be set in order to achieve good results. In this paper, to get rid of parameters and thresholds, we explore a supervised classification method for video shot segmentation. We transform the temporal segmentation into a class categorization issue. Our approach defines a uniform framework for combining different kinds of features extracted from the video. Our method does not require any pre-processing step to compensate motion or post-processing filtering to eliminate false detected transitions. The experiments, following strictly the TRECVID 2002 competition protocol, provide very good results dealing with a large amount of features thanks to our kernel-based SVM classification method","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122128731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Expression Transfer between Photographs through Multilinear AAM's","authors":"Ives Macêdo, E. V. Brazil, L. Velho","doi":"10.1109/SIBGRAPI.2006.18","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.18","url":null,"abstract":"Expression transfer is a method for mapping a photographed expression performed by a given subject onto the photograph of another person's face. Building on well succeeded previous works by the vision researchers (facial expression decomposition, active appearance models and multilinear analysis, we propose a novel approach for expression transfer based on color images. We attack this problem with methods developed by the computer vision community for facial expression analysis and recognition. Combining active appearance models and multilinear analysis, it's possible to suitably represent and analyze expressive facial images, while separating both style (subject's identity) and content (expressive flavor) from the captured performance","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128973040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Montenegro, L. Velho, P. Carvalho, Jonas Sossai
{"title":"Polygonization of volumetric reconstructions from silhouettes","authors":"A. Montenegro, L. Velho, P. Carvalho, Jonas Sossai","doi":"10.1109/SIBGRAPI.2006.37","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.37","url":null,"abstract":"In this work we propose a method for the polygonization of octree-based reconstructions by dual contouring. Dual contouring is an adaptive method for determining contiguous polygonal meshes from signed octrees. It determines the positioning of the vertices of the mesh by minimizing a quadratic error expressed in terms of hermitian data. In order to apply dual contouring on volumetric reconstruction from silhouettes we devised a method that is able to determine the discrete topology of the contour in relation to the octree cells, as well as the hermitian data corresponding to the intersections and normals of conic volumes whose intersection approximates a structure known as visual hull. Due to the discrete and extremely noisy nature of the data used in the reconstruction we had to devise a different criterion for mesh simplification that applies topological consistency tests only when the geometric error measure is beyond a given tolerance. We present results of the application of the proposed method in the extraction of a mesh corresponding to the surface of objects of a real scene","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134369313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}