Pub Date : 2014-08-26DOI: 10.1109/SIBGRAPI.2014.23
C. E. Santos, W. R. Schwartz
Face identification plays an important role in biometrics and surveillance. However, before applying face id1entification methods in real scenarios, we have to determine whether the subject in a test sample is known (enrolled in the face gallery). In this work, we focus on approaches to determine whether a given face sample belongs to a subject enrolled in the face gallery. We show how the approaches can be combined with face identification methods so they can perform open-set face recognition. Among the five approaches described in this work, four are based on responses from the face identification, and one is based on comparisons between known samples and samples from an independent background set. The approaches differ on features explored in the data, scalability and accuracy. We evaluate the proposed approaches in two standard and challenging datasets for face recognition (FRGC and PubFig83). Results considering different number of enrolled subjects show which approach can be considered in scenarios where, for instance, one is interested in recognizing few wanted subjects.
{"title":"Extending Face Identification to Open-Set Face Recognition","authors":"C. E. Santos, W. R. Schwartz","doi":"10.1109/SIBGRAPI.2014.23","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2014.23","url":null,"abstract":"Face identification plays an important role in biometrics and surveillance. However, before applying face id1entification methods in real scenarios, we have to determine whether the subject in a test sample is known (enrolled in the face gallery). In this work, we focus on approaches to determine whether a given face sample belongs to a subject enrolled in the face gallery. We show how the approaches can be combined with face identification methods so they can perform open-set face recognition. Among the five approaches described in this work, four are based on responses from the face identification, and one is based on comparisons between known samples and samples from an independent background set. The approaches differ on features explored in the data, scalability and accuracy. We evaluate the proposed approaches in two standard and challenging datasets for face recognition (FRGC and PubFig83). Results considering different number of enrolled subjects show which approach can be considered in scenarios where, for instance, one is interested in recognizing few wanted subjects.","PeriodicalId":146229,"journal":{"name":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130493519","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}
D. Osmari, H. Vo, Cláudio T. Silva, J. Comba, L. Lins
Most performance analysis tools focus on presenting an overload of details, with little application-dependent structure, and predefined statistical summaries. This makes the complex relations present in a parallel program not directly recognisable to the user, making the task of identifying performance issues more costly in both time and effort. In this work we investigate the requirements to create visualisations of execution traces of parallel programs modelled as dataflows. We propose the Smart Trace (ST) concept, to encode the structure of the data, and guide the construction of specialised visualizations. A visualization tool can then leverage the relationships in the data to automate a given analysis task. We show with examples the power and flexibility of visualisations we can create to address specific questions formulated about the analysis of the data, with emphasis in parallel dataflow traces.
{"title":"Visualization and Analysis of Parallel Dataflow Execution with Smart Traces","authors":"D. Osmari, H. Vo, Cláudio T. Silva, J. Comba, L. Lins","doi":"10.1109/SIBGRAPI.2014.2","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2014.2","url":null,"abstract":"Most performance analysis tools focus on presenting an overload of details, with little application-dependent structure, and predefined statistical summaries. This makes the complex relations present in a parallel program not directly recognisable to the user, making the task of identifying performance issues more costly in both time and effort. In this work we investigate the requirements to create visualisations of execution traces of parallel programs modelled as dataflows. We propose the Smart Trace (ST) concept, to encode the structure of the data, and guide the construction of specialised visualizations. A visualization tool can then leverage the relationships in the data to automate a given analysis task. We show with examples the power and flexibility of visualisations we can create to address specific questions formulated about the analysis of the data, with emphasis in parallel dataflow traces.","PeriodicalId":146229,"journal":{"name":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125152684","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}
Pub Date : 2014-08-26DOI: 10.1109/SIBGRAPI.2014.12
C. Baumberger, M. Reyes, M. Constantinescu, R. Olariu, Edilson de Aguiar, Thiago Oliveira-Santos
Capitalizing on the advances of 3D face reconstruction from computer graphics and computer vision, this work presents a system to enable precise and robust 3D facial reconstruction from video in order to improve current approaches for doctor-patient communication tools. The reconstructed face can be used for emulation of aesthetic procedures in 3D. The proposed 3D face reconstruction algorithm uses a statistical shape model as well as information from facial landmarks and silhouette to iteratively model the face of a subject moving the face from front to left. The presented 3D active shape model approach enables the spatio-temporal tracking of facial landmarks and pose estimation based on a few initial facial landmarks defined in the first frame. Silhouette information extracted from key frames allows for better face reconstruction. The proposed methods were rigorously evaluated with experiments using real and artificial data. Results showed that the proposed method can detect facial landmarks with an approximate median error of 5% intraocular distance, can estimate pose with a median error below 5 degrees, and that silhouette information can improve reconstruction accuracy in all facial regions, specially on the cheeks.
{"title":"3D Face Reconstruction from Video Using 3D Morphable Model and Silhouette","authors":"C. Baumberger, M. Reyes, M. Constantinescu, R. Olariu, Edilson de Aguiar, Thiago Oliveira-Santos","doi":"10.1109/SIBGRAPI.2014.12","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2014.12","url":null,"abstract":"Capitalizing on the advances of 3D face reconstruction from computer graphics and computer vision, this work presents a system to enable precise and robust 3D facial reconstruction from video in order to improve current approaches for doctor-patient communication tools. The reconstructed face can be used for emulation of aesthetic procedures in 3D. The proposed 3D face reconstruction algorithm uses a statistical shape model as well as information from facial landmarks and silhouette to iteratively model the face of a subject moving the face from front to left. The presented 3D active shape model approach enables the spatio-temporal tracking of facial landmarks and pose estimation based on a few initial facial landmarks defined in the first frame. Silhouette information extracted from key frames allows for better face reconstruction. The proposed methods were rigorously evaluated with experiments using real and artificial data. Results showed that the proposed method can detect facial landmarks with an approximate median error of 5% intraocular distance, can estimate pose with a median error below 5 degrees, and that silhouette information can improve reconstruction accuracy in all facial regions, specially on the cheeks.","PeriodicalId":146229,"journal":{"name":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125241741","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}
Pub Date : 2014-08-26DOI: 10.1109/SIBGRAPI.2014.41
Daniel Michelon De Carli, C. Pozzer, Fernando Bevilacqua, V. Schetinger
This paper presents a non-assisted method for procedural generation of 3D canyon scenes. Our approach combines techniques of computer graphics, computer vision, image processing and graph search algorithms. Our main contribution is a generation approach that uses noise-generated height maps that are carefully transformed and manipulated by data clustering (through the Mean Shift algorithm) and image operations in order to mimic the observed geological features of real canyons. Several parameters are used to guide and constrain the generation of terrains, canyon features, course and shape of rivers, plain areas, soft slope regions, cliffs and plateaus.
{"title":"Procedural Generation of 3D Canyons","authors":"Daniel Michelon De Carli, C. Pozzer, Fernando Bevilacqua, V. Schetinger","doi":"10.1109/SIBGRAPI.2014.41","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2014.41","url":null,"abstract":"This paper presents a non-assisted method for procedural generation of 3D canyon scenes. Our approach combines techniques of computer graphics, computer vision, image processing and graph search algorithms. Our main contribution is a generation approach that uses noise-generated height maps that are carefully transformed and manipulated by data clustering (through the Mean Shift algorithm) and image operations in order to mimic the observed geological features of real canyons. Several parameters are used to guide and constrain the generation of terrains, canyon features, course and shape of rivers, plain areas, soft slope regions, cliffs and plateaus.","PeriodicalId":146229,"journal":{"name":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116766313","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}
Pub Date : 2014-08-26DOI: 10.1109/SIBGRAPI.2014.43
Erick Gomez Nieto, Danilo Motta, L. G. Nonato
Arranging geometric primitives in a two-dimensional layout is a typical problem in graphics and visualization applications. Most existing approaches are either not flexible enough to allow users modify the layout according to their interest or unable to maintain the semantic relation between geometric instances during user manipulation. The few interactive semantic aware layout construction methods relies on computationally costly energy functional that demand intricate GPU implementations to enable real-time user interventions. In this work we propose a novel interactive semantic aware layout construction technique that relies on a simple mathematical and computational formulation that allow users to freely interact with the layout. Our approach is supported by interactive multidimensional projection methods, which enforces similar instances to be placed close to each other during layout updates. The presented results show the versatility, effectiveness, and simplicity of our approach when building semantic aware user tailored layouts.
{"title":"Semantically Aware Dynamic Layouts","authors":"Erick Gomez Nieto, Danilo Motta, L. G. Nonato","doi":"10.1109/SIBGRAPI.2014.43","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2014.43","url":null,"abstract":"Arranging geometric primitives in a two-dimensional layout is a typical problem in graphics and visualization applications. Most existing approaches are either not flexible enough to allow users modify the layout according to their interest or unable to maintain the semantic relation between geometric instances during user manipulation. The few interactive semantic aware layout construction methods relies on computationally costly energy functional that demand intricate GPU implementations to enable real-time user interventions. In this work we propose a novel interactive semantic aware layout construction technique that relies on a simple mathematical and computational formulation that allow users to freely interact with the layout. Our approach is supported by interactive multidimensional projection methods, which enforces similar instances to be placed close to each other during layout updates. The presented results show the versatility, effectiveness, and simplicity of our approach when building semantic aware user tailored layouts.","PeriodicalId":146229,"journal":{"name":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122428898","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}
Pub Date : 2014-08-26DOI: 10.1109/SIBGRAPI.2014.42
E. S. Flores, J. Scharcanski
Pigmented melanocytic skin lesion pre-screening relies on the proper segmentation of the image regions affected by the skin lesion. This paper proposes a new pigmented melanocytic skin lesion segmentation algorithm for standard camera images. It is assumed that only one skin lesion is in each input image, and also is assumed that the skin lesion is placed at (or close to) the image center. Thus, the input is, at first, shading attenuated, and then converted to a three-channel color space that enhances the discrimination between healthy and unhealthy skin regions. Afterwards, a dictionary is generated for each image, which is compact and reconstructive, and represents the image patches. This dictionary is obtained in an unsupervised manner using a modified version of the Information-Theoretic Dictionary Learning (ITDL) method, which was originally proposed as supervised dictionary learning method. Normalized Graph Cuts is used to partition the set of projected patches in two groups, resulting in a binary mask that labels the pixels as corresponding to healthy or unhealthy image regions. Our preliminary experimental results obtained on a publicly available dataset are encouraging, and suggest that the proposed pigmented melanocytic skin lesion segmentation method provides, in average, a lower segmentation error rate than comparable state-of-the-art methods proposed in the literature.
{"title":"Segmentation of Pigmented Melanocytic Skin Lesions Based on Learned Dictionaries and Normalized Graph Cuts","authors":"E. S. Flores, J. Scharcanski","doi":"10.1109/SIBGRAPI.2014.42","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2014.42","url":null,"abstract":"Pigmented melanocytic skin lesion pre-screening relies on the proper segmentation of the image regions affected by the skin lesion. This paper proposes a new pigmented melanocytic skin lesion segmentation algorithm for standard camera images. It is assumed that only one skin lesion is in each input image, and also is assumed that the skin lesion is placed at (or close to) the image center. Thus, the input is, at first, shading attenuated, and then converted to a three-channel color space that enhances the discrimination between healthy and unhealthy skin regions. Afterwards, a dictionary is generated for each image, which is compact and reconstructive, and represents the image patches. This dictionary is obtained in an unsupervised manner using a modified version of the Information-Theoretic Dictionary Learning (ITDL) method, which was originally proposed as supervised dictionary learning method. Normalized Graph Cuts is used to partition the set of projected patches in two groups, resulting in a binary mask that labels the pixels as corresponding to healthy or unhealthy image regions. Our preliminary experimental results obtained on a publicly available dataset are encouraging, and suggest that the proposed pigmented melanocytic skin lesion segmentation method provides, in average, a lower segmentation error rate than comparable state-of-the-art methods proposed in the literature.","PeriodicalId":146229,"journal":{"name":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134398387","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}
Pub Date : 2014-08-26DOI: 10.1109/SIBGRAPI.2014.44
D. C. G. Pedronette, R. Calumby, R. Torres
Relevance feedback approaches have been established as an important tool for interactive search, enabling users to express their needs. However, in view of the growth of multimedia collections available, the user efforts required by these methods tend to increase as well, demanding approaches for reducing the need of user interactions. In this context, this paper proposes a semi-supervised learning algorithm for relevance feedback to be used in image retrieval tasks. The proposed semi-supervised algorithm aims at using both supervised and unsupervised approaches simultaneously. While a supervised step is performed using the information collected from the user feedback, an unsupervised step exploits the intrinsic dataset structure, which is represented in terms of ranked lists of images. Several experiments were conducted for different image retrieval tasks involving shape, color, and texture descriptors and different datasets. The proposed approach was also evaluated on multimodal retrieval tasks, considering visual and textual descriptors. Experimental results demonstrate the effectiveness of the proposed approach.
{"title":"Semi-supervised Learning for Relevance Feedback on Image Retrieval Tasks","authors":"D. C. G. Pedronette, R. Calumby, R. Torres","doi":"10.1109/SIBGRAPI.2014.44","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2014.44","url":null,"abstract":"Relevance feedback approaches have been established as an important tool for interactive search, enabling users to express their needs. However, in view of the growth of multimedia collections available, the user efforts required by these methods tend to increase as well, demanding approaches for reducing the need of user interactions. In this context, this paper proposes a semi-supervised learning algorithm for relevance feedback to be used in image retrieval tasks. The proposed semi-supervised algorithm aims at using both supervised and unsupervised approaches simultaneously. While a supervised step is performed using the information collected from the user feedback, an unsupervised step exploits the intrinsic dataset structure, which is represented in terms of ranked lists of images. Several experiments were conducted for different image retrieval tasks involving shape, color, and texture descriptors and different datasets. The proposed approach was also evaluated on multimodal retrieval tasks, considering visual and textual descriptors. Experimental results demonstrate the effectiveness of the proposed approach.","PeriodicalId":146229,"journal":{"name":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123835414","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}
Pub Date : 2014-08-26DOI: 10.1109/SIBGRAPI.2014.24
Marco A. A. Silva, Guillermo Cámara Chávez
Systems for face sketch recognition are very important for law enforcement agencies. These systems can help to locate or narrow down potential suspects. Recently, various methods were proposed to address this problem, but there is no clear comparison of their performance. In this paper is proposed a new approach for photo/sketch recognition based on the Local Feature-based Discriminant Analysis (LFDA) method. This new approach was tested and compared with its predecessors using three differents datasets and also adding an extra gallery of 10,000 photos to extend the gallery. Experiments using the CUFS and CUFSF databases show that our approach outperforms the state-of-the-art approaches. Our approach also shows good results with forensic sketches. The limitation with this dataset is its very small size. By increasing the training dataset, the accuracy of our approach increases, as it was demonstrated by our experiments.
{"title":"Face Sketch Recognition from Local Features","authors":"Marco A. A. Silva, Guillermo Cámara Chávez","doi":"10.1109/SIBGRAPI.2014.24","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2014.24","url":null,"abstract":"Systems for face sketch recognition are very important for law enforcement agencies. These systems can help to locate or narrow down potential suspects. Recently, various methods were proposed to address this problem, but there is no clear comparison of their performance. In this paper is proposed a new approach for photo/sketch recognition based on the Local Feature-based Discriminant Analysis (LFDA) method. This new approach was tested and compared with its predecessors using three differents datasets and also adding an extra gallery of 10,000 photos to extend the gallery. Experiments using the CUFS and CUFSF databases show that our approach outperforms the state-of-the-art approaches. Our approach also shows good results with forensic sketches. The limitation with this dataset is its very small size. By increasing the training dataset, the accuracy of our approach increases, as it was demonstrated by our experiments.","PeriodicalId":146229,"journal":{"name":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116305091","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}
Pub Date : 2014-08-26DOI: 10.1109/SIBGRAPI.2014.29
Rafael Pacheco Kovaleski, M. M. O. Neto
Reverse-tone-mapping operators (rTMOs) enhance low-dynamic-range images and videos for display on high-dynamic-range monitors. A common problem faced by previous rTMOs is the handling of under or overexposed content. Under such conditions, they may not be effective, and even cause loss and reversal of visible contrast. We present an rTMO based on cross-bilateral filtering that generates high-quality HDR images and videos for a wide range of exposures. Experiments performed using an objective image quality metric show that our approach is the only technique available that can gracefully enhance perceived details across a large range of image exposures.
{"title":"High-Quality Reverse Tone Mapping for a Wide Range of Exposures","authors":"Rafael Pacheco Kovaleski, M. M. O. Neto","doi":"10.1109/SIBGRAPI.2014.29","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2014.29","url":null,"abstract":"Reverse-tone-mapping operators (rTMOs) enhance low-dynamic-range images and videos for display on high-dynamic-range monitors. A common problem faced by previous rTMOs is the handling of under or overexposed content. Under such conditions, they may not be effective, and even cause loss and reversal of visible contrast. We present an rTMO based on cross-bilateral filtering that generates high-quality HDR images and videos for a wide range of exposures. Experiments performed using an objective image quality metric show that our approach is the only technique available that can gracefully enhance perceived details across a large range of image exposures.","PeriodicalId":146229,"journal":{"name":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127438811","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}
Pub Date : 2014-08-26DOI: 10.1109/SIBGRAPI.2014.16
E. V. Brazil, Ronan M. Amorim, M. Sousa, L. Velho, L. H. Figueiredo
In the last 15 years many systems for sketch-based modeling have been developed. Much of this work has focused on the final results and describes the solutions from a technical and practical point of view. In this paper we take a more theoretical approach to the problem of sketch-based surface modeling (SBSM) and introduce a framework for SBSM systems based on adaptive meshes. The main advantage of this approach is to split the modeling operators and the final representation, allowing the creation of SBSM systems suitable for specific domains with different demands. In addition, we present two systems built on top of this framework, one with the capability to control local and global changes to the model and one that follows domain constraints.
{"title":"A Sketch-Based Modeling Framework Based on Adaptive Meshes","authors":"E. V. Brazil, Ronan M. Amorim, M. Sousa, L. Velho, L. H. Figueiredo","doi":"10.1109/SIBGRAPI.2014.16","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2014.16","url":null,"abstract":"In the last 15 years many systems for sketch-based modeling have been developed. Much of this work has focused on the final results and describes the solutions from a technical and practical point of view. In this paper we take a more theoretical approach to the problem of sketch-based surface modeling (SBSM) and introduce a framework for SBSM systems based on adaptive meshes. The main advantage of this approach is to split the modeling operators and the final representation, allowing the creation of SBSM systems suitable for specific domains with different demands. In addition, we present two systems built on top of this framework, one with the capability to control local and global changes to the model and one that follows domain constraints.","PeriodicalId":146229,"journal":{"name":"2014 27th SIBGRAPI Conference on Graphics, Patterns and Images","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115309543","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：