Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)最新文献

筛选
英文 中文
Translation invariant transformations of discrete random sets 离散随机集的平移不变变换
J. Barrera, M. Brun
{"title":"Translation invariant transformations of discrete random sets","authors":"J. Barrera, M. Brun","doi":"10.1109/SIBGRA.1998.722788","DOIUrl":"https://doi.org/10.1109/SIBGRA.1998.722788","url":null,"abstract":"Random modeling is an important technique for solving hard problems in coding, quantitative description and restoration of images. In the sixties. Matheron introduced the theory of Random Closed Sets (RACS), that permits the creation of models by morphological transformations of primitive processes. A limitation of this theory is that not all transformation of a RACS produces a new RACS. Recently Goutsias proposed a discrete version of Matheron's theory that has not this limitation. However. A drawback of the discrete theory is the absence of general formulas for calculating a distribution functional of a Discrete Random Set (DRS) from a distribution functional of the corresponding primitive DRS. In this paper, we present some general formulas for characterizing a DRS generated by a translation invariant operator. Moreover, a new distribution functional for DRS characterization is introduced: the interval distribution functional.","PeriodicalId":282177,"journal":{"name":"Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130149087","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
Evolving visual features and detectors 进化的视觉特征和检测器
A. Guarda, C. Le Gal, A. Lux
{"title":"Evolving visual features and detectors","authors":"A. Guarda, C. Le Gal, A. Lux","doi":"10.1109/SIBGRA.1998.722757","DOIUrl":"https://doi.org/10.1109/SIBGRA.1998.722757","url":null,"abstract":"This paper addresses the problem of automatic synthesis of visual detectors. We present a method using genetic techniques to learn visual features and a program which combines and integrates the features in non-linear ways. The method is integrated in a face tracking system to generate a variety of new visual perceptual processes.","PeriodicalId":282177,"journal":{"name":"Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125965847","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
Stroking discrete polynomial Bezier curves via point containment paradigm 通过点包容范式对离散多项式贝塞尔曲线进行描边
A. Fabris, L. Silva, A. R. Forrest
{"title":"Stroking discrete polynomial Bezier curves via point containment paradigm","authors":"A. Fabris, L. Silva, A. R. Forrest","doi":"10.1109/SIBGRA.1998.722738","DOIUrl":"https://doi.org/10.1109/SIBGRA.1998.722738","url":null,"abstract":"The point containment predicate which specifies if a point is part of a mathematically defined shape or not is a crucial problem in computer graphics. This paper presents a stroking technique that counteracts the main disadvantage of point containment algorithms: their quadratic time complexity with increasing resolution. It is also presented an efficient algorithm to perform simultaneously the filling and stroking operations.","PeriodicalId":282177,"journal":{"name":"Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127469188","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}
引用次数: 2
An extension of an algorithm for finding sequential decomposition of erosions and dilations 寻找侵蚀和膨胀的顺序分解算法的扩展
R. F. Hashimoto
{"title":"An extension of an algorithm for finding sequential decomposition of erosions and dilations","authors":"R. F. Hashimoto","doi":"10.1109/SIBGRA.1998.722786","DOIUrl":"https://doi.org/10.1109/SIBGRA.1998.722786","url":null,"abstract":"An important problem in the field of designing automatically morphological operators is to study the transformation of standard morphological representations of the operators learned into other equivalent representations in order to make efficient implementations. In this paper, we study this problem restricted to decomposition of set translation invariant dilations (respectively, erosions) by arbitrarily shaped structuring elements into a minimum number of compositions of dilations (respectively, erosions) by smaller structuring elements that are subsets of the 3/spl times/3 square centered at the origin. In this work, we approach this problem by applying combinatorial optimization techniques and using algebraic and geometrical properties of Minkowski additions in order to find pruning strategies.","PeriodicalId":282177,"journal":{"name":"Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131624568","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}
引用次数: 2
Space-variant representation for active object recognition 主动目标识别的空间变量表示
S. Exel, L. Pessoa
{"title":"Space-variant representation for active object recognition","authors":"S. Exel, L. Pessoa","doi":"10.1109/SIBGRA.1998.722755","DOIUrl":"https://doi.org/10.1109/SIBGRA.1998.722755","url":null,"abstract":"Vision is an active process where behaviorally important information is selectively gathered. We present a model of visual recognition in which the high resolution fovea is deployed to interesting regions by selective attention processes. The raw image is initially represented by a space variant complex cell, or oriented edge map. This transformed input is processed by a decision system which attempts to recognize the image, given partial information. In the more typical case where the available information is insufficient to support recognition, an attentive foveation system is engaged which is responsible for determining the subsequent image region of interest. The next foveation is based on both bottom-up information from the image and top down information from the set of stored models, and corresponds to the process of selective attention within the model. The foveation process continues until the object is recognized. The model is applied to the task of face recognition where simulations illustrate its behavior and the model's potential for visual recognition in general.","PeriodicalId":282177,"journal":{"name":"Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123750247","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
A constraint-based algorithm for engineering design 基于约束的工程设计算法
E. Lamounier
{"title":"A constraint-based algorithm for engineering design","authors":"E. Lamounier","doi":"10.1109/SIBGRA.1998.722739","DOIUrl":"https://doi.org/10.1109/SIBGRA.1998.722739","url":null,"abstract":"The main focus of this work is on the development of incremental graph-based techniques for satisfying a coupled set of engineering and geometric constraints. The objective is to speed up a constraint-based design. A prototype constraint-based system has been developed to demonstrate the feasibility of these incremental algorithms. The proposed techniques were applied to the internal-combustion engine and the results are presented and discussed.","PeriodicalId":282177,"journal":{"name":"Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126715173","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}
引用次数: 0
Towards perception driven visualization 走向感知驱动的可视化
M. C. F. D. Oliveira, R. Minghim, S. M. Tutida, V. C. L. Salvador
{"title":"Towards perception driven visualization","authors":"M. C. F. D. Oliveira, R. Minghim, S. M. Tutida, V. C. L. Salvador","doi":"10.1109/SIBGRA.1998.722742","DOIUrl":"https://doi.org/10.1109/SIBGRA.1998.722742","url":null,"abstract":"The use of computer graphics techniques in visualization is hampered by the complexity of data, display limitations and the difficult process of establishing adequate mappings. One way to compensate for the difficulties in handling data and image complexity is to turn to users' capabilities and human factors, and to revisit visualization and interaction techniques under such premises. This paper discusses aspects in the development of a multi-modal visualization system that considers human perception issues in the design of proper data displays. Perceptually driven techniques were implemented as modular extensions to a general-purpose, low cost and open visualization library. Some results are shown and implications discussed.","PeriodicalId":282177,"journal":{"name":"Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128700406","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}
引用次数: 3
Bi-variate pattern spectrum 双变量模式谱
P. Ghosh, B. Chanda
{"title":"Bi-variate pattern spectrum","authors":"P. Ghosh, B. Chanda","doi":"10.1109/SIBGRA.1998.722795","DOIUrl":"https://doi.org/10.1109/SIBGRA.1998.722795","url":null,"abstract":"Bivariate pattern spectrum is the generalization of the concept of usual pattern spectrum. The usual pattern spectrum is the mapping from multidimensional set to 1D vector, whereas bivariate pattern spectrum is the mapping of multidimensional set to 2D vector. The introduction of bivariate pattern spectrum, based upon the geometrical concepts, has the notion to develop a shape-size descriptor, in the true sense. For defining bivariate pattern spectrum we introduce the concept of parametric and conditional parametric morphological operators. The usual binary morphological operators are the special case of parametric morphological operators.","PeriodicalId":282177,"journal":{"name":"Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121244936","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}
引用次数: 8
A system's architecture for warping and morphing of graphical objects 一种用于扭曲和变形图形对象的系统架构
Jorge Gomes, L. Darsa, B. Costa, L. Velho
{"title":"A system's architecture for warping and morphing of graphical objects","authors":"Jorge Gomes, L. Darsa, B. Costa, L. Velho","doi":"10.1109/SIBGRA.1998.722750","DOIUrl":"https://doi.org/10.1109/SIBGRA.1998.722750","url":null,"abstract":"This paper describes a system architecture that enables the use of different techniques of warping and morphing applied to various classes of graphical objects (images, surfaces, plane curves, volumetric data, implicit surfaces etc.) Combinations of warping and morphing techniques can lead to more powerful and expressive results. The possibility of experimenting with alternative techniques for distinct classes of graphical objects creates a very flexible and robust warping and morphing system.","PeriodicalId":282177,"journal":{"name":"Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126243499","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}
引用次数: 15
A system for automatic extraction of the user-entered data from bankchecks 从银行支票中自动提取用户输入数据的系统
Alessandro Lameiras Koerich, L. Ling
{"title":"A system for automatic extraction of the user-entered data from bankchecks","authors":"Alessandro Lameiras Koerich, L. Ling","doi":"10.1109/SIBGRA.1998.722760","DOIUrl":"https://doi.org/10.1109/SIBGRA.1998.722760","url":null,"abstract":"This paper presents a system for automatic extraction of the user-entered data from Brazilian bankchecks. We have assumed that the layout structure of bankchecks is standardized, that any bankcheck can be identified through the MICR line and that a sample of the background pattern is available for every bankcheck. Based on these assumptions, a template is designed for extracting the user-entered items of any bankcheck, no matter which financial institution has issued it. First, the bankcheck is digitized through a scanner and its skew angle is computed by an algorithm based on the Hough transform. Next a template is generated and used for extracting the user-entered data. The extracted data still shows the presence of the background pattern, character strings, and vertical and horizontal lines. The background pattern is eliminated by a morphological subtraction operation while the baselines are erased using an algorithm based on the projection profiles. The printed character strings are eliminated through a morphological subtraction between the image covered by the signature area and a sample of the character strings generated by the system. Finally, a post-processing algorithm is used for recovering some erased pixels. Experimental results show that this approach is robust and efficient for automatic extracting the user-entered items from Brazilian bankchecks achieving a moderate processing time, very good image quality and excellent accuracy rates.","PeriodicalId":282177,"journal":{"name":"Proceedings SIBGRAPI'98. International Symposium on Computer Graphics, Image Processing, and Vision (Cat. No.98EX237)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125820669","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}
引用次数: 16
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学术文献互助群
群 号:604180095
Book学术官方微信