2006 19th Brazilian Symposium on Computer Graphics and Image Processing最新文献

筛选
英文 中文
Plausible Image Based Soft Shadows Using Occlusion Textures 合理的图像为基础的软阴影使用遮挡纹理
2006 19th Brazilian Symposium on Computer Graphics and Image Processing Pub Date : 2006-12-11 DOI: 10.1109/SIBGRAPI.2006.35
E. Eisemann, Xavier Décoret
{"title":"Plausible Image Based Soft Shadows Using Occlusion Textures","authors":"E. Eisemann, Xavier Décoret","doi":"10.1109/SIBGRAPI.2006.35","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.35","url":null,"abstract":"This paper presents a novel image-based approach to render plausible soft shadows for complex dynamic scenes with rectangular light sources. The algorithm's performance is mostly independent of the scene complexity and the source's size. Occluders and receivers do not need to be separated and no knowledge about the scene representation is required, making the method easy to use. The main idea is to approximate the occlusion in the scene with pre-filtered occlusion textures. The visibility of the light source at a point in space is estimated by accumulating the occlusion caused by each texture, using a novel formula based on probabilities","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"67 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":"131690661","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}
引用次数: 20
Actively Illuminated Objects using Graph-Cuts 使用图形切割的主动照明对象
2006 19th Brazilian Symposium on Computer Graphics and Image Processing Pub Date : 2006-12-11 DOI: 10.1109/SIBGRAPI.2006.5
A. Sá, M. Vieira, A. Montenegro, P. Carvalho, L. Velho
{"title":"Actively Illuminated Objects using Graph-Cuts","authors":"A. Sá, M. Vieira, A. Montenegro, P. Carvalho, L. Velho","doi":"10.1109/SIBGRAPI.2006.5","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.5","url":null,"abstract":"This paper addresses the problem of foreground extraction using active illumination and graph-cut optimization. Our approach starts by detecting image regions that are likely to belong to foreground objects. These regions are constituted by pixels where the difference in luminance for two differently illuminated images is large. The foreground objects are segmented by graph-cut optimization using those regions as a seed and using a energy function based on probability distributions derived from both input images and their difference. Several light sources and different illumination schemes can be used to mark the foreground. Our method has only two scalar parameters which can be set once for a wide variety of scenes","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"6 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":"121119984","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}
引用次数: 5
Duality between the Watershed by Image Foresting Transform and the Fuzzy Connectedness Segmentation Approaches 图像森林变换分水岭与模糊连通性分割方法的对偶性
2006 19th Brazilian Symposium on Computer Graphics and Image Processing Pub Date : 2006-12-11 DOI: 10.1109/SIBGRAPI.2006.14
Romaric Audigier, R. Lotufo
{"title":"Duality between the Watershed by Image Foresting Transform and the Fuzzy Connectedness Segmentation Approaches","authors":"Romaric Audigier, R. Lotufo","doi":"10.1109/SIBGRAPI.2006.14","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.14","url":null,"abstract":"This paper makes a rereading of two successful image segmentation approaches, the fuzzy connectedness (FC) and the watershed (WS) approaches, by analyzing both by means of the image foresting transform (IFT). This graph-based transform provides a sound framework for analyzing and implementing these methods. This paradigm allows to show the duality existing between the WS by IFT and the FC segmentation approaches. Both can be modeled by an optimal forest computation in a dual form (maximization of the similarities or minimization of the dissimilarities), the main difference being the input parameters: the weights associated to each arc of the graph representing the image. In the WS approach, such weights are based on the (possibly filtered) image gradient values whereas they are based on much more complex affinity values in the FC theory. An efficient algorithm for both FC and IFT-WS computation is proposed. Segmentation robustness issue is also discussed","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"5 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":"121783598","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}
引用次数: 19
Determining the branchings of 3D structures from respective 2D projections 从各自的2D投影确定3D结构的分支
2006 19th Brazilian Symposium on Computer Graphics and Image Processing Pub Date : 2006-12-11 DOI: 10.1109/SIBGRAPI.2006.12
J. Leandro, R. M. C. Junior, L. Costa
{"title":"Determining the branchings of 3D structures from respective 2D projections","authors":"J. Leandro, R. M. C. Junior, L. Costa","doi":"10.1109/SIBGRAPI.2006.12","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.12","url":null,"abstract":"This work describes a new framework for automatic extraction of 2D branching structures images obtained from 3D shapes, such as neurons and retinopathy images. The majority of methods for neuronal cell shape analysis that are based on the 2D contours of cells fall short of properly characterizing such cells because crossings among neuronal processes constrain the access of contour following algorithms to the innermost regions of the cell. The framework presented in this article addresses, possibly for the first time, the problem of determining the continuity along crossings, therefore granting to the contour following algorithm full access to all processes of the neuronal cell under analysis. First, the raw image is preprocessed so as to obtain an 8-connected, one-pixel wide skeleton as well as a set of seed pixels for each subtree and all the branching/crossing regions. Then, for each seed pixel, the algorithm labels all valid neighbors, until a branching/crossing region is reached, when a decision about the proper continuation is taken based on the tangent continuity. The algorithm has shown robustness for images with parallel segments and low densities of branching/crossing densities. The problem of too high densities of branching/crossing regions can be addressed by using a suitable data structure. Successful experimental results using real data (neural cell images) are presented","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":" 40","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113952926","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}
引用次数: 1
Interpolation of Computerized Tomography Slices using 3D Digital Inpainting 利用三维数字图象绘制的计算机断层扫描切片插值
2006 19th Brazilian Symposium on Computer Graphics and Image Processing Pub Date : 2006-12-11 DOI: 10.1109/SIBGRAPI.2006.28
Sandrerley Ramos Pires, E. L. Flôres, C. Barcelos, M. A. Batista
{"title":"Interpolation of Computerized Tomography Slices using 3D Digital Inpainting","authors":"Sandrerley Ramos Pires, E. L. Flôres, C. Barcelos, M. A. Batista","doi":"10.1109/SIBGRAPI.2006.28","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.28","url":null,"abstract":"The visualization of image structures in 3D obtained from computerized tomography examinations aids the medical professional in the analysis of images and consequently, provides a more accurate diagnoses. As these images (slices) are spaced apart it becomes necessary to fill in the empty spaces to show the structure in 3D. The use of the virtual slice between the real slices following the restoration is a new approach to realizing slice interpolation aimed at 3D visualization. The goal of this article is to develop a method which produces a virtual slice with few empty regions and, through the use of an in-painting process using transportation and diffusion of information with a partial differential equation, complete the virtual slices. The experimental results, presented by images 2D and 3D show the efficiency of the proposed method","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"32 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":"127699883","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}
引用次数: 1
Subspace Hierarchical Particle Filter 子空间层次粒子滤波
2006 19th Brazilian Symposium on Computer Graphics and Image Processing Pub Date : 2006-12-11 DOI: 10.1109/SIBGRAPI.2006.42
B. C. Brandao, Jacques Wainer, S. Goldenstein
{"title":"Subspace Hierarchical Particle Filter","authors":"B. C. Brandao, Jacques Wainer, S. Goldenstein","doi":"10.1109/SIBGRAPI.2006.42","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.42","url":null,"abstract":"Particle filtering has become a standard tool for non-parametric estimation in computer vision tracking applications. It is an instance of stochastic search. Each particle represents a possible state of the system. Higher concentration of particles at any given region of the search space implies higher probabilities. One of its major drawbacks is the exponential growth in the number of particles for increasing dimensions in the search space. We present a graph based filtering framework for hierarchical model tracking that is capable of substantially alleviate this issue. The method relies on dividing the search space in subspaces that can be estimated separately. Low correlated subspaces may be estimated with parallel, or serial, filters and have their probability distributions combined by a special aggregator filter. We describe a new algorithm to extract parameter groups, which define the subspaces, from the system model. We validate our method with different graph structures within a simple hand tracking experiment with both synthetic and real data","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"19 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":"117293836","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}
引用次数: 20
A scaled morphological toggle operator for image transformations 用于图像转换的缩放形态学切换算子
2006 19th Brazilian Symposium on Computer Graphics and Image Processing Pub Date : 2006-12-11 DOI: 10.1109/SIBGRAPI.2006.2
N. J. Leite, L. Dorini
{"title":"A scaled morphological toggle operator for image transformations","authors":"N. J. Leite, L. Dorini","doi":"10.1109/SIBGRAPI.2006.2","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.2","url":null,"abstract":"Scale dependent signal representations have proved to be useful in several image processing applications. In this paper, we define a toggle operator for binarization/segmentation purposes based on scaled versions of an image transformed by morphological operations. The toggle decision rule, determining the new value of a pixel, considers local spatial information, in contrast to other multiscale approaches that takes into account mainly global information (e.g., the scale signal under study). We show that the proposed operator can identify significant image extrema information in such a way that when it is used in a binarization process yields very good segmentation and filtering results. Our algorithm is validated against known threshold-based segmentation methods using images of different classes and subjected to different lighting conditions","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"113 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":"123702830","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}
引用次数: 12
Music Icons: Procedural Glyphs for Audio Files 音乐图标:音频文件的程序符号
2006 19th Brazilian Symposium on Computer Graphics and Image Processing Pub Date : 2006-12-11 DOI: 10.1109/SIBGRAPI.2006.30
Philipp Kolhoff, Jacqueline Preuß, J. Loviscach
{"title":"Music Icons: Procedural Glyphs for Audio Files","authors":"Philipp Kolhoff, Jacqueline Preuß, J. Loviscach","doi":"10.1109/SIBGRAPI.2006.30","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.30","url":null,"abstract":"Nowadays, a personal music collection may comprise thousands of MP3 files. Visualization can help the user to gain an overview and to find similar songs inside so large a set. We describe a method to create icons from audio files in such a way that songs which the user considers similar receive similar icons. This allows visual data mining in standard directory listings of window-based operating systems. The icons consist of bloom-like shapes, whose form and color depend on eight parameters. These parameters are controlled through a neural net, the input of which are audio features that are extracted algorithmically from the MP3 files. To adapt the system to the user's perception and interests, the neural net is initially trained with a small set of songs and icons. User studies done on the system demonstrate a strong perceptual relation between music and icons","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"19 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":"131105532","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}
引用次数: 23
Parabolic Polygons and Discrete Affine Geometry 抛物多边形和离散仿射几何
2006 19th Brazilian Symposium on Computer Graphics and Image Processing Pub Date : 2006-12-11 DOI: 10.1109/SIBGRAPI.2006.32
M. Craizer, T. Lewiner, J. Morvan
{"title":"Parabolic Polygons and Discrete Affine Geometry","authors":"M. Craizer, T. Lewiner, J. Morvan","doi":"10.1109/SIBGRAPI.2006.32","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.32","url":null,"abstract":"Geometry processing applications estimate the local geometry of objects using information localized at points. They usually consider information about the normal as a side product of the points coordinates. This work proposes parabolic polygons as a model for discrete curves, which intrinsically combines points and normals. This model is naturally affine invariant, which makes it particularly adapted to computer vision applications. This work introduces estimators for affine length and curvature on this discrete model and presents, as a proof-of-concept, an affine invariant curve reconstruction","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"36 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":"133474911","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}
引用次数: 7
Non-Extensive Entropy for CAD Systems of Breast Cancer Images 乳腺癌图像CAD系统的非扩展熵
2006 19th Brazilian Symposium on Computer Graphics and Image Processing Pub Date : 2006-12-11 DOI: 10.1109/SIBGRAPI.2006.31
P. Rodrigues, R. Chang, J. Suri
{"title":"Non-Extensive Entropy for CAD Systems of Breast Cancer Images","authors":"P. Rodrigues, R. Chang, J. Suri","doi":"10.1109/SIBGRAPI.2006.31","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2006.31","url":null,"abstract":"Recent statistics show that breast cancer is a major cause of death among women in all of the world. Hence, early diagnostic with computer aided diagnosis (CAD) systems is a very important tool. This task is not easy due to poor ultrasound resolution and large amount of patient data size. Then, initial image segmentation is one of the most important and challenging task. Among several methods for medical image segmentation, the use of entropy for maximization the information between the foreground and background is a well known and applied technique. But, the traditional Shannon entropy fails to describe some physical systems with characteristics such as long-range and longtime interactions. Then, a new kind of entropy, called non-extensive entropy, has been proposed in the literature for generalizing the Shannon entropy. In this paper, we propose the use of non-extensive entropy, also called q-entropy, applied in a CAD system for breast cancer classification in ultrasound of mammographic exams. Our proposal combines the non-extensive entropy, a level set formulation and a support vector machine framework to achieve better performance than the current literature offers. In order to validate our proposal, we have tested our automatic protocol in a data base of 250 breast ultrasound images (100 benign and 150 malignant). With a cross-validation protocol, we demonstrate system's accuracy, sensitivity, specificity, positive predictive value and negative predictive value as: 95%, 97%, 94%, 92% and 98%, respectively, in terms of ROC (receiver operating characteristic) curves and Az areas","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":"203 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":"121845440","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}
引用次数: 40
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信