{"title":"SQUEEZE: fast and progressive decompression of triangle meshes","authors":"R. Pajarola, J. Rossignac","doi":"10.1109/CGI.2000.852332","DOIUrl":"https://doi.org/10.1109/CGI.2000.852332","url":null,"abstract":"An ideal triangle mesh compression technology would simultaneously support the following objectives: (1) progressive refinements of the received mesh during decompression, (2) nearly optimal compression ratios for both geometry and connectivity, and (3) in-line, real-time decompression algorithms for hardware or software implementations. Because these three objectives impose contradictory constraints, previously reported efforts have focused primarily on one (sometimes two) of these objectives. The SQUEEZE technique introduced in this paper addresses all three constraints simultaneously, and attempts to provide the best possible compromise. For a mesh of T triangles, SQUEEZE compresses the connectivity to 3.7T bits, which is competitive with the best progressive compression techniques reported so far. The geometric prediction error encoding technique introduced in this paper leads to a geometry compression that is improved by 20% over that of previous schemes. Our initial implementation on a 300-MHz CPU achieved a decompression rate of up to 46,000 triangles per second. SQUEEZE downloads a model through a number of successive refinement stages, providing the benefit of progressivity.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127263659","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}
Selim Balcisoy, R. Torre, M. Ponder, P. Fua, D. Thalmann
{"title":"Augmented reality for real and virtual humans","authors":"Selim Balcisoy, R. Torre, M. Ponder, P. Fua, D. Thalmann","doi":"10.1109/CGI.2000.852346","DOIUrl":"https://doi.org/10.1109/CGI.2000.852346","url":null,"abstract":"Current virtual reality technologies provide many ways to interact with virtual humans. Most of those techniques, however, are limited to synthetic elements and require cumbersome sensors. We have combined a real-time simulation and rendering platform with a real-time, non-invasive vision-based recognition system to investigate interactions in a mixed environment with real and synthetic elements. In this paper, we present the resulting system, the example of a checkers game between a real person and an autonomous virtual human to demonstrate its performance.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"225 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134074566","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":"Head detection and tracking by 2-D and 3-D ellipsoid fitting","authors":"N. Grammalidis, M. Strintzis","doi":"10.1109/CGI.2000.852337","DOIUrl":"https://doi.org/10.1109/CGI.2000.852337","url":null,"abstract":"A novel procedure for segmenting a set of scattered 3D data obtained from a head and shoulders multiview sequence is presented. The procedure consists of two steps. In the first step, two ellipses corresponding to the head and the body of the person are identified based on ellipse fitting of the outline of the person in each image. The fitting is based on a fast direct least squares method using the constraint that forces a general conic to be an ellipse. In order to achieve head/body segmentation, a K-means algorithm is used to minimise the fitting error between the points and the two ellipsoids. In the second step, a 3D ellipsoid model corresponding to the head of the person is identified using an extension of the above method. Robustness and outlier removal can be achieved if a 3D ellipsoid model estimation technique is used in conjunction with the Median of Least Squares (MedLS) technique, which minimises the median of the errors corresponding to each 3D point. An interesting application of the proposed method is the combination of the 3D ellipsoid model with a generic face model which is adapted to the face images to provide information only for the high-detail front part of the head while the 3D ellipsoid is used for the back of the head, which is usually not visible.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134289731","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":"X-machines+L-systems=XL-systems","authors":"S. K. Vanak","doi":"10.1109/CGI.2000.852328","DOIUrl":"https://doi.org/10.1109/CGI.2000.852328","url":null,"abstract":"A. Lindenmayer (1968) developed a type of formal language called an L-system. Similar to formal languages, L-systems define a method by which a string of symbols can be rewritten or parsed into another string using a set of rewrite rules. X-machines are generalised state automata. This paper takes another look at this way of generating plants and provides a convenient way of taking component L-systems that exhibit some property and combining them using an X-machine so that each L-system contributes its properties or behaviour. The result is a plant which has some characteristics of each of its components.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129369145","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":"Reconstruction of B-spline surfaces from scattered data points","authors":"B. Gregorski, B. Hamann, K. Joy","doi":"10.1109/CGI.2000.852331","DOIUrl":"https://doi.org/10.1109/CGI.2000.852331","url":null,"abstract":"We present a new approach for reconstructing a smooth surface from a set of scattered points in 3D space. Our algorithm first decomposes a given point set into a quadtree-like data structure known as a strip tree. The strip tree is used to fit a set of least squares quadratic surfaces to the data points. These quadratic surfaces are then degree-elevated to bi-cubic surfaces and blended together to form a set of B-spline surfaces that approximates the given point set.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130010213","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":"To gesture or not to gesture: what is the question?","authors":"N. Badler, Mónica Costa, Liwei Zhao, D. Chi","doi":"10.1109/CGI.2000.852314","DOIUrl":"https://doi.org/10.1109/CGI.2000.852314","url":null,"abstract":"Computer synthesized characters are expected to make appropriate face, limb, and body gestures during communicative acts. We focus on non-facial movements and try to elucidate what is intended with the notions of \"gesture\" and \"naturalness\". We argue that looking only at the psychological notion of gesture and gesture type is insufficient to capture movement qualities needed by an animated character. Movement observation science, specifically Laban Movement Analysis and its Effort and Shape components with motion phrasing provide essential gesture components (I. Bartenieff and D. Lewis, 1980). We assert that the expression of movement qualities from the Effort dimensions are needed to make a gesture naturally crystallize out of abstract movements. Finally, we point out that nonfacial gestures must involve the rest of the body to appear natural and convincing. A system called EMOTE has been implemented which applies parameterized Effort and Shape qualities to movements and thereby forms improved synthetic gestures.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124473143","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":"Simulated patient for orthognathic surgery","authors":"H. Ip, Christy S. B. Kot, J. Xia","doi":"10.1109/CGI.2000.852339","DOIUrl":"https://doi.org/10.1109/CGI.2000.852339","url":null,"abstract":"Orthognathic surgery corrects a wide range of minor and major facial and jaw irregularities. This surgery will improve the patients' ability to chew, speak and breathe. In many cases, a better appearance will also result. With the recent advances in virtual reality (VR) and three-dimensional (3D) medical imaging technology, orthognathic surgery simulations typically requires costly volumetric data acquisition modalities such CT or MRI imaging for patient modeling. The authors present an approach for constructing 3D hard and soft tissue models of a patient based on colour portraits and conventional radiographs. This allows patient modeling to be done efficiently on low-cost platforms. Specifically, we extend the techniques developed by the author (H.S.H Ip and Lijin Yin, 1996) to hard tissue modeling. The extended technique employs a user-assisted approach to obtain the 3D coordinates of the feature points of the human face and jaw respectively from conventional photographs and radiographs. Then the displacement vectors of the feature points are computed by correspondence matching and interpolation against a generic head model and jaw bone model. The resulting combined hard and soft tissue models can be used for orthognathic surgical planning on a low-cost, PC based platform.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130822393","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":"Hybridization techniques for fast radiosity solvers","authors":"M. Leblond, F. Rousselle, C. Renaud","doi":"10.1109/CGI.2000.852342","DOIUrl":"https://doi.org/10.1109/CGI.2000.852342","url":null,"abstract":"The authors study, both theoretically and experimentally some properties of classical linear systems solvers, according to the radiosity assumptions. We prove important properties for some of these solvers which allow the user to choose the best one. We then introduce a new technique, so called hybridization, whose purpose is to increase the convergence speed of iterative methods. It provides very efficient results for the well-known Gauss-Seidel solver. This technique has been successfully applied to both a group progressive radiosity approach and a full-matrix radiosity method which has been specifically designed for plant growth simulation.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126304647","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":"Fuzzy-based person tracking in real-time","authors":"M. Hoch, Sven Mann","doi":"10.1109/CGI.2000.852335","DOIUrl":"https://doi.org/10.1109/CGI.2000.852335","url":null,"abstract":"The implementation of a system for person tracking is often a compromise between sophisticated tracking algorithms and simplicity (to achieve the desired frame rate on standard PCs). We propose a fuzzy based rule system for tracking people using simple segmentation algorithms. The system allows integration of heuristics in the tracking algorithm, adjusted by means of weighting functions. It also combines several segmented features in an intuitive way. The result is a stable system that can not be achieved using the single extracted features alone.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114187107","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 animation toolkit based on motion mapping","authors":"Myeong-Won Lee, Min-Geun Lee","doi":"10.1109/CGI.2000.852315","DOIUrl":"https://doi.org/10.1109/CGI.2000.852315","url":null,"abstract":"We present a character animation toolkit for generating animation sequences interactively. It is based on a motion mapping technique that an object's motion can be applied to another object interactively. The toolkit generates the mesh for an object from several feature points on photo images automatically. An object's motion is defined and manipulated independently of modeling data. The motion generated once is applied to any object by the mapping technique according to an animation hierarchical data structure. The animation toolkit is appropriate for generating character animation that needs interactive motion modification and reuse rather than accurate modeling.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133221980","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号
求助内容：
应助结果提醒方式：