{"title":"Real-time terrain surface extraction at variable resolution","authors":"L. Guedes","doi":"10.1109/SIGRA.1997.625153","DOIUrl":"https://doi.org/10.1109/SIGRA.1997.625153","url":null,"abstract":"Multiresolution terrain models allow the extraction of the surface at different levels of details. Real terrain data is large enough to prevent real time walk through at a reasonable level of detail. Moreover, a coarse view of a terrain may not attend some application requirements. Therefore extracting the surface at variable resolution may offer impressive good looking views if, for instance, regions closer to the observer are shown at a higher resolution then regions farther away. Besides, variable resolution extraction dramatically reduces the number of polygons to be rendered allowing real time walk through of a large terrain model. The paper proposes a multiresolution terrain model, based on Delaunay triangulation, that takes into account the whole domain during triangulation without replicating unchanged triangles through different levels of detail. The proposed model is the first that matches a whole domain Delaunay triangulation with accuracy of extraction and low storage cost algorithms.","PeriodicalId":445648,"journal":{"name":"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133385881","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":"Act: an easy-to-use and dynamically extensible 3D graphics library","authors":"W. Celes, J. Corson-Rikert","doi":"10.1109/SIGRA.1997.625144","DOIUrl":"https://doi.org/10.1109/SIGRA.1997.625144","url":null,"abstract":"The paper presents Act, an object oriented library for projects from specialized 3D graphics applications to simple interactive educational programs. Act meets the needs of both occasional and expert graphics programmers, offering a high level access to the OpenGL library and additional features including object creation, manipulation, and interaction. An interpreted language allows the Act library to be extended easily and dynamically.","PeriodicalId":445648,"journal":{"name":"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133478041","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 algorithms to compute the elementary operators of mathematical morphology","authors":"J. Barrera, R. Hirata","doi":"10.1109/SIGRA.1997.625167","DOIUrl":"https://doi.org/10.1109/SIGRA.1997.625167","url":null,"abstract":"Mathematical Morphology (MM) studies the representation of image operators in terms of some families of simple operators, called the elementary operators of MM. A drawback of this approach is that the representation of some operators is not efficient, since it uses a large number of elementary operators. Fast algorithms are the solution found by some authors to implement image operators that have complex representations. Two drawbacks of this solution are: i-they change the architecture of the software that implement the operators by the morphological representation. ii-these implementations are very specific and can not be used to implement other operators. Here, we study some of these fast algorithms and show that they can be transformed into morphological representations with equivalent performance, if proper data structures and algorithms are used to implement the elementary operators. Finally, some experimental results that illustrate these ideas are given.","PeriodicalId":445648,"journal":{"name":"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115854474","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.M.C. Machado, Mario F M Campos, Ari M Siqueira, Osvaldo S F De Carvalho
{"title":"An iterative algorithm for segmenting lanes in gel electrophoresis images","authors":"A.M.C. Machado, Mario F M Campos, Ari M Siqueira, Osvaldo S F De Carvalho","doi":"10.1109/SIGRA.1997.625161","DOIUrl":"https://doi.org/10.1109/SIGRA.1997.625161","url":null,"abstract":"In this paper we discuss the application of spatial-domain filters for solving the problem of automatic lane detection on gel electrophoresis computer images. The problem can be posed as the determination of the number, location and orientation of lanes on the image, based on the analysis of their gray-level intensities. A novel iterative filtering algorithm is proposed based on the periodicity of image projection pattern. The algorithm is compared with clustering and frequency-domain filtering methods in terms of their effectiveness and efficiency from which a trade-off solution is presented.","PeriodicalId":445648,"journal":{"name":"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114431788","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":"High quality rendering of two-dimensional continuous curves","authors":"A. Fabris, A. R. Forrest","doi":"10.1109/SIGRA.1997.625142","DOIUrl":"https://doi.org/10.1109/SIGRA.1997.625142","url":null,"abstract":"The paper presents a prefiltering technique for antialiasing two dimensional continuous curves which enables the correct handling of the geometry (self-intersections, small loops, cusps, curves with high and small radius of curvature, etc.) using a generic class of filters. Moreover, the technique allows for rendering curves of arbitrary thickness and can be optimally tuned to the bits used for image quantisation.","PeriodicalId":445648,"journal":{"name":"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130185478","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":"Data fusion in 2D and 3D image processing: an overview","authors":"I. Bloch, H. Maître","doi":"10.1109/SIGRA.1997.625158","DOIUrl":"https://doi.org/10.1109/SIGRA.1997.625158","url":null,"abstract":"This paper presents an overview of the current state of the art in image fusion, with an emphasis on the emergence of new techniques, often issued from other domains like artificial intelligence and uncertainty modeling. We address the two following points: firstly the aim of data fusion and its specificity when image information has to be combined, with emphasis on the respective roles of numerical and symbolic information, vs. numerical and symbolic types of treatment, secondly the theoretical frameworks for modeling imprecision and uncertainty (probability, fuzzy sets, belief functions). The main steps of image fusion are illustrated in a simple example in 3D medical image fusion.","PeriodicalId":445648,"journal":{"name":"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing","volume":"1242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114885807","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":"Visualizing scalar fields represented by adaptive square triangulations","authors":"J. Neves, R. Persiano","doi":"10.1109/SIGRA.1997.625154","DOIUrl":"https://doi.org/10.1109/SIGRA.1997.625154","url":null,"abstract":"Regular grids representing volume data are usually preferred to triangulation structures because they are simpler to store and faster to process. We consider a special family of triangulations combining the flexibility of an adaptive representation of fields with some intrinsic regularity. We show that the projection algorithm to visualize scalar fields represented by adaptive square triangulations is far more efficient than to visualize general triangulations and it is competitive with regular grid visualization techniques.","PeriodicalId":445648,"journal":{"name":"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125030101","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":"Morphological operators characterized by neighborhood graphs","authors":"J. Barrera, F.de A. Zampirolli, R. Lotufo","doi":"10.1109/SIGRA.1997.625172","DOIUrl":"https://doi.org/10.1109/SIGRA.1997.625172","url":null,"abstract":"Mathematical Morphology is a theory that studies the decomposition of lattice operators in terms of some families of elementary lattice operators. When the lattices considered have a sup-generating family, the elementary operators can be characterized by structuring functions. The representation of structuring functions by neighborhood graphs is a powerful model for the construction of image operators. This model, that is a conceptual improvement of the one proposed by Vincent, permits a natural polymorphic extension of classical softwares for image processing by Mathematical Morphology. These systems constitute a complete framework for implementations of connected filters, that are one of the most modern and powerful approaches for image segmentation, and of operators that extract information from populations of objects in images. In this paper, besides presenting the formulation of the model, we present the polymorphic extension of a system for morphological image processing and some applications of it in image analysis.","PeriodicalId":445648,"journal":{"name":"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130880725","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":"Automatic registration of satellite images","authors":"Leila Maria Garcia Fonseca, M. H. M. Costa","doi":"10.1109/SIGRA.1997.625182","DOIUrl":"https://doi.org/10.1109/SIGRA.1997.625182","url":null,"abstract":"Image registration is one of the basic image processing operations in remote sensing. With the increase in the number of images collected every day from different sensors, automated registration of multi-sensor/multi-spectral images has become an important issue. A wide range of registration techniques has been developed for many different types of applications and data. Given the diversity of the data, it is unlikely that a single registration scheme will work satisfactorily for all different applications. A possible solution is to integrate multiple registration algorithms into a rule-based artificial intelligence system, so that appropriate methods for any given set of multisensor data can be automatically selected. The objective of this paper is to present an automatic registration algorithm which has been developed at INPE. It uses a multiresolution analysis procedure based upon the wavelet transform. The procedure is completely automatic and relies on the grey level information content of the images and their local wavelet transform modulus maxima. The algorithm was tested on SPOT and TM images from forest, urban and agricultural areas. In all cases we obtained very encouraging results.","PeriodicalId":445648,"journal":{"name":"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130887060","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":"Multiscale segmentation and enhancement in mammograms","authors":"M. M. Anguh, A.C. Silva","doi":"10.1109/SIGRA.1997.625159","DOIUrl":"https://doi.org/10.1109/SIGRA.1997.625159","url":null,"abstract":"A multiscale method for segmenting and enhancing lesions of various sizes in mammograms is presented. The method uses two stages. The first stage applies a multiscale automatic threshold estimator based on histogram moments to segment the mammogram at multilevels. The second stage converts the segmented image using pseudo-colour mapping to produce a colour image. An algorithm is presented as well as experimental results. Mammograms are digitalised using a table scanner with a transparency adapter and the algorithm is implemented in Borland C++ 4.02 on a 486 PC. The results are analogous to a breast map which provide an adequate basis for radiological breast tissue differentiation and analysis in digital mammography. Experimental results and judgments from radiological experts are very encouraging.","PeriodicalId":445648,"journal":{"name":"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134011158","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}