{"title":"Characterizing images based on lines for image indexing","authors":"T. Kunii, S. Murakami, Y. Shinagawa, M. Ohga","doi":"10.1109/CGI.1997.601280","DOIUrl":"https://doi.org/10.1109/CGI.1997.601280","url":null,"abstract":"Recent advances in multimedia has necessitated us to look for an effective search method of images. Most of the contemporary indexing methods are based on color distribution in the images. When the users do not remember the colors clearly, however, it has been difficult to retrieve the desired images. The paper proposes an indexing method based on shapes contained in an image. We characterize an image by the half planes that contain the objects in it. We also propose a method to characterize images by the vanishing points of parallel lines contained in an image. The vanishing points represent how three dimensional (3D) objects are projected onto the 2D image.","PeriodicalId":285672,"journal":{"name":"Proceedings Computer Graphics International","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121167191","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":"An advanced graphics chip with bump-mapped Phong shading","authors":"T. Ikedo, Jian-ping Ma","doi":"10.1109/CGI.1997.601297","DOIUrl":"https://doi.org/10.1109/CGI.1997.601297","url":null,"abstract":"A light-reflected computer graphics shading circuit has been developed to be used as computer graphics processor in PCs and workstations. Its hardware implementation in ASIC of Phong shader, bump-mapping, and sine filter for texture mapping may be the first such technology in this field. A chip can simultaneously draw four million vectors (10-pixel arbitrary slopes)/s, and render 1.2 million polygons (100-pixel 3-D triangles)/s. While applying Phong shading, bump and texture mapping, and hidden surface removal in a frame buffer system, implemented as a single-port DRAM. 940,000 gate CMOS with 0.3 /spl mu/m CMOS rules in a TCP package is used.","PeriodicalId":285672,"journal":{"name":"Proceedings Computer Graphics International","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129027031","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":"Model-based view-extrapolation for interactive VR Web-systems","authors":"D. Cohen-Or","doi":"10.1109/CGI.1997.601282","DOIUrl":"https://doi.org/10.1109/CGI.1997.601282","url":null,"abstract":"High speed networks which guarantee a minimum quality of service (QoS) enable the development of interactive Web systems. The paper introduces a new paradigm for interaction with complex virtual worlds on the Web, which utilizes both the server and the client simultaneously. The client generates the new views by extrapolating a reference view based on the locally available data, including the model. The server transmits only the data necessary to prevent an accumulation of errors. The model based view extrapolation method avoids the use of textures which are view independent primitives and therefore too expensive to be used in interactive applications over the network.","PeriodicalId":285672,"journal":{"name":"Proceedings Computer Graphics International","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115698532","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":"An automatic description of volumetric objects using metaballs","authors":"J. Kim, Eun Seok Kim, Seung Park","doi":"10.1109/CGI.1997.601274","DOIUrl":"https://doi.org/10.1109/CGI.1997.601274","url":null,"abstract":"Although implicit modeling is an important technique in 3D graphics, automatic algorithms to fit any given volumetric object by implicit skeletal elements are not very advanced. Some automatic algorithms recently announced are very slow and take a few days. We propose a fast algorithm to generate a set of metaballs to fit an arbitrary volume data by its isosurface. Experimental results for various input volumes show a shorter generation time of within ten minutes on an ordinary workstation. A faster and robust rendering algorithm with no spots, using the Sturm sequence is also designed to render all the metaball images in this work, and it is 20/spl sim/30% (60% in some cases) faster than that of using Bezier clipping.","PeriodicalId":285672,"journal":{"name":"Proceedings Computer Graphics International","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116316035","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":"Modifying curvatures at design points for convex B-spline curves","authors":"Hui Guan, T. Torii","doi":"10.1109/CGI.1997.601309","DOIUrl":"https://doi.org/10.1109/CGI.1997.601309","url":null,"abstract":"The curvature of a curve at a point expresses the roundness of the curve at that position. Interactive modifications to it can, produce many shapes similar to the intended one, among which the most satisfying can be chosen. In this paper, we discuss how to interactively modify the curvature of a convex B-spline curve at a feature point while preserving nice characteristics of the curve. Constraint equations in terms of the control vertices for the curve are given to determine the associated properties. Based on these constraints, we present a simple and efficient design scheme capable of repositioning the control vertices into more appropriate positions. This enables a designer to rapidly manipulate the shape of a curve in real time.","PeriodicalId":285672,"journal":{"name":"Proceedings Computer Graphics International","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116695982","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":"Distortion correction of magnetic fields for position tracking","authors":"G. Zachmann","doi":"10.1109/CGI.1997.601306","DOIUrl":"https://doi.org/10.1109/CGI.1997.601306","url":null,"abstract":"Electro-magnetic tracking systems are in wide-spread use for measuring 6D positions. However, their accuracy is impaired seriously by distortions of the magnetic fields caused by many types of metal which are omnipresent at real sites. We present a fast and robust method for \"equalizing\" those distortions in order to yield accurate tracking. The algorithm is based on global scattered data interpolation using a \"snap-shot\" of the magnetic field's distortion measured once in advance. The algorithm is fast (it does not introduce any further lag in the data flow), robust, the samples of the field's \"snap-shot\" can be arranged in any way, and it is easy to implement. The distortion is visualized in an intuitive way to provide insight into its nature, and the correction algorithm is evaluated in terms of accuracy and performance. Finally, a qualitative comparison of the susceptibility of a Polhemus and an Ascension tracking system is carried out.","PeriodicalId":285672,"journal":{"name":"Proceedings Computer Graphics International","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133297836","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}