{"title":"A New Hierarchical Decomposition Applied to Object Segmentation in Image Sequences: The Uniform Decomposition","authors":"F. C. Flores, R. Lotufo","doi":"10.1109/SIBGRAPI.2010.29","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2010.29","url":null,"abstract":"The uniform decomposition is a new hierarchical segmentation method which main property is the preservation of a given characteristic for each subset of the partition provided by the decomposition. Its computation is incremental and, in each iteration, a candidate region is split only if it is found a valid split where each new subset respects an input criterion, for instance size or shape. The uniform decomposition is comparable to the classical one given by the threshold of the extinction values from each regional minima. More, it is comparable while maintaining the criterion for each partition subset. The paper also proposes the application of the uniform decomposition as the core of the watershed from propagated markers, a method applied to assisted segmentation of objects in image sequences. An quantitative evaluation benchmark was applied to assess the combination of the uniform decomposition to the watershed from propagated markers. The evaluation highlights the achievements of good segmentation and efficiency.","PeriodicalId":320252,"journal":{"name":"2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125944840","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}
Renata Nascimento, J. Paixão, H. Lopes, T. Lewiner
{"title":"Topology Aware Vector Field Denoising","authors":"Renata Nascimento, J. Paixão, H. Lopes, T. Lewiner","doi":"10.1109/SIBGRAPI.2010.22","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2010.22","url":null,"abstract":"Recent developments in data acquisition technology enable to directly capture real vector fields, helping for a better understanding of physical phenomena. However measured data is corrupted by noise, puzzling the understanding of the phenomena. This turns the task of removing noise, i.e. denoising, an essential preprocessing step for a better analysis of the data. Nonetheless a careful use of denoising is required since usual algorithms not only remove the noise but can also eliminate information, in particular the vector field singularities, which are fundamental features in the analysis. This paper proposes a semi-automatic vector field denoising methodology, where the user visually controls the topological changes caused by classical vector field filtering in scale-spaces.","PeriodicalId":320252,"journal":{"name":"2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124712847","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}
Waldemar Villamayor-Venialbo, H. Legal-Ayala, E. Justino, J. Facon
{"title":"Partial Matching Using Set Exclusion Criteria: Applied to Livestock Brand Retrieval","authors":"Waldemar Villamayor-Venialbo, H. Legal-Ayala, E. Justino, J. Facon","doi":"10.1109/SIBGRAPI.2010.32","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2010.32","url":null,"abstract":"This article presents a partial matching approach based on set exclusion criteria applied to livestock brand retrieval. A set exclusion measure function, depending on local shape features, is formulated. This exclusion measure helps to determine if a registered brand is a subset of another existing brand, or vice-versa. Local features are obtained taking account the relative spatial distribution of brand components. Experimental results have shown the accuracy of the methodology in cattle brand identification.","PeriodicalId":320252,"journal":{"name":"2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117024033","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}
Renan Teston Inácio, Tiago Nobrega, Diego D. B. Carvalho, A. V. Wangenheim
{"title":"Interactive Simulation and Visualization of Fluids with Surface Raycasting","authors":"Renan Teston Inácio, Tiago Nobrega, Diego D. B. Carvalho, A. V. Wangenheim","doi":"10.1109/SIBGRAPI.2010.27","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2010.27","url":null,"abstract":"We present a method to couple particle-based fluid simulation methods such as Smoothed Particle Hydrodynamics (SPH) and volume rendering in order to visualize the fluid. A volume is generated from the fluid's implicit density field so volume raycasting can be performed to render the surface on the GPU. The volume generation algorithm is also implemented in the GPU and is suitable to be used with both SPH simulations implemented on CPU and GPU. We compare different implementations of fluid simulation, demonstrating the modularity of the volume generation method and concluding that it can be used together with other particle-based simulation models and other volume rendering techniques.","PeriodicalId":320252,"journal":{"name":"2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126310135","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}
Andréa Britto Mattos, J. Mena-Chalco, R. M. C. Junior, L. Velho
{"title":"3D Linear Facial Animation Based on Real Data","authors":"Andréa Britto Mattos, J. Mena-Chalco, R. M. C. Junior, L. Velho","doi":"10.1109/SIBGRAPI.2010.44","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2010.44","url":null,"abstract":"In this paper we introduce a Facial Animation system using real three-dimensional models of people, acquired by a 3D scanner. We consider a dataset composed by models displaying different facial expressions and a linear interpolation technique is used to produce a smooth transition between them. One-to-one correspondences between the meshes of each facial expression are required in order to apply the interpolation process. Instead of focusing in the computation of dense correspondence, some points are selected and a triangulation is defined, being refined by consecutive subdivisions, that compute the matchings of intermediate points. We are able to animate any model of the dataset, given its texture information for the neutral face and the geometry information for all the expressions along with the neutral face. This is made by computing matrices with the variations of every vertex when changing from the neutral face to the other expressions. The knowledge of the matrices obtained in this process makes it possible to animate other models given only the texture and geometry information of the neutral face. Furthermore, the system uses 3D reconstructed models, being capable of generating a three-dimensional facial animation from a single 2D image of a person. Also, as an extension of the system, we use artificial models that contain expressions of visemes, that are not part of the expressions of the dataset, and their displacements are applied to the real models. This allows these models to be given as input to a speech synthesis application in which the face is able to speak phrases typed by the user. Finally, we generate an average face and increase the displacements between a subject from the dataset and the average face, creating, automatically, a caricature of the subject.","PeriodicalId":320252,"journal":{"name":"2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117209778","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":"Eyes and Eyebrows Detection for Performance Driven Animation","authors":"J. L. Moreira, Adriana Braun, S. Musse","doi":"10.1109/SIBGRAPI.2010.11","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2010.11","url":null,"abstract":"Real-time localization of eyes and eyebrows in video sequences can find several applications in nowadays. However, this task is still a challenge, mainly if we consider images of low quality as those achieved by web cams. This paper describes a methodology to accurately detect meaningful feature points in eyes and eyebrows of people in frontal pose, in images captured by web cams. Also it discusses the mapping of the movement of the eyes of a real person to an avatar, in order to provide Performance Driven Animation (PDA). Furthermore, this paper presents obtained results and the limitations of the proposed methodology.","PeriodicalId":320252,"journal":{"name":"2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121832899","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":"Predictive Lazy Amplification: Synthesis and Rendering of Massive Procedural Scenes in Real Time","authors":"Carlúcio Cordeiro, L. Chaimowicz","doi":"10.1109/SIBGRAPI.2010.43","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2010.43","url":null,"abstract":"In this paper we propose a new paradigm for procedural modeling that enables the real time visualization of massive procedural scenes. For this, we use a combination of memory and task management with two well known procedural modeling paradigms: data amplification and lazy evaluation. Experimental results show that, in addition to obtaining performance gains through parallelism, the implemented system can generate and visualize a procedural scene far greater than the available memory in real time using only a single PC equipped with a GPU and a multicore processor.","PeriodicalId":320252,"journal":{"name":"2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images","volume":"34 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116594076","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. Saúde, F. S. D. Menezes, Patrícia L. S. Freitas, G. Rabelo, R. Braga
{"title":"On Generalized Differences for Biospeckle Image Analysis","authors":"A. Saúde, F. S. D. Menezes, Patrícia L. S. Freitas, G. Rabelo, R. Braga","doi":"10.1109/SIBGRAPI.2010.36","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2010.36","url":null,"abstract":"Biospeckle is a technique whose purpose is to observe and study the underlying activity of some material. The technique has its roots on optical physics, and its first step is an image acquisition process that produces a video sequence whose characteristics allow researchers to have an interpretation of the activity of the observed material by an analysis of the video content. The recent literature on this subject presents several different measurements for analyzing the video sequence. One of the most popular measurement is the Generalized Difference (GD). The computation of the GD has an asymptotic complexity of O(n2). In this paper we propose: i) an alternative O(n) algorithm for the computation of the GD, and ii) an alternative measurement, that we call GD*. We discuss the qualitative similarities between the GD and the GD*. We conclude that the GD* is an alternative generalized difference measurement, and thus it can replace the GD in many applications. We show that the GD* is a function of the variance, and it can be computed in O(n). Finally, if the GD itself is desired as measurement, it can now be computed in O(n) by the novel algorithm presented in this paper.","PeriodicalId":320252,"journal":{"name":"2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images","volume":"789 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116416257","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":"Efficient Approximate Visibility of Point Sets on the GPU","authors":"Denison L. M. Tavares, J. Comba","doi":"10.1109/SIBGRAPI.2010.40","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2010.40","url":null,"abstract":"In recent years, considerable research has been devoted to the efficient representation, modeling, processing and rendering of point-based models (point clouds). Due to their conceptual simplicity and superior flexibility, point-based representations evolved into a valuable alternative to polygonal meshes. This paper explores the problem of extracting direct visibility from point clouds without explicitly reconstructing the surface or estimating normal. The main contribution of this work is a hardware-accelerated hidden point removal operator. This operator is based on the GPU splatting technique combined with a morphological operation over the depth buffer to reduce the silhouette effect in the final image. The motivation to develop a new operator is the low efficiency demonstrated by existing hidden point removal methods in real time applications with large point clouds. We demonstrate that our proposal is useful for visualizing point clouds with interactive frame rates.","PeriodicalId":320252,"journal":{"name":"2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121310834","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}
M. Souza, Diego D. B. Carvalho, Peter Barth, J. V. Ramos, E. Comunello, A. V. Wangenheim
{"title":"Using Acceleration Data from Smartphones to Interact with 3D Medical Data","authors":"M. Souza, Diego D. B. Carvalho, Peter Barth, J. V. Ramos, E. Comunello, A. V. Wangenheim","doi":"10.1109/SIBGRAPI.2010.52","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2010.52","url":null,"abstract":"Accelerometers integrated in modern smartphones pave the way to intuitively use gestures for collaboratively controlling interactive applications. Using and holding smartphones has become natural and ensures user acceptance as well as intuitive handling. We focus on using accelerators in several smartphones at the same time to interactively control a medical imaging solution. To this end, we introduce a framework to collect, modify, and distribute acceleration sensor data from multiple smartphones and integrate it with a medical imaging system which results in an environment suitable for e.g. doctors reviewing and explaining diagnostic findings. We performed some experiments to evaluate the usability of this approach and present an ongoing research in adapting the smartphone interface to physical simulation applications.","PeriodicalId":320252,"journal":{"name":"2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128519886","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}