{"title":"An improved architecture for Java domain transformation applications","authors":"M. A. C. Gois, A. Frery","doi":"10.1109/SIBGRA.2002.1167184","DOIUrl":"https://doi.org/10.1109/SIBGRA.2002.1167184","url":null,"abstract":"This work suggests an architecture that uses the Java Native Interface to improve the performance of Java domain transformation applications. It also shows how to make possible the independency between image formats and each domain transformation.","PeriodicalId":286814,"journal":{"name":"Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130032329","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":"A fast and efficient projection-based approach for surface reconstruction","authors":"M. Gopi, Shankar Krishnan","doi":"10.1109/SIBGRA.2002.1167141","DOIUrl":"https://doi.org/10.1109/SIBGRA.2002.1167141","url":null,"abstract":"We present a fast and memory efficient algorithm that generates a manifold triangular mesh S with or without boundary passing through a set of unorganized points P/spl sub//spl Rscr//sup 3/ with no other additional information. Nothing is assumed about the geometry or topology of the sampled manifold model, except for its reasonable smoothness. The speed of our algorithm is derived from a projection-based approach we use to determine the incident faces on a point. Our algorithm has successfully reconstructed the surfaces of unorganized point clouds of sizes varying from 10,000 to 100,000 in about 3-30 seconds on a 250 MHz, R10000 SGI Onyx2. Our technique can be specialized for different kinds of input and applications. For example, our algorithm can be specialized to handle data from height fields like terrain and range scan, even in the presence of noise. We have successfully generated meshes for range scan data of size 900,000 points in less than 40 seconds.","PeriodicalId":286814,"journal":{"name":"Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122447176","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}
E. Strauss, Walter Jiménez, G. Giraldi, Rodrigo L. S. Silva, Antonio A. F. Oliveira
{"title":"A semi-automatic surface reconstruction framework based on T-Surfaces and isosurface extraction methods","authors":"E. Strauss, Walter Jiménez, G. Giraldi, Rodrigo L. S. Silva, Antonio A. F. Oliveira","doi":"10.1109/SIBGRA.2002.1167120","DOIUrl":"https://doi.org/10.1109/SIBGRA.2002.1167120","url":null,"abstract":"In this paper we present a new approach which integrates the T-surfaces model and isosurface generation methods in a general framework for surface reconstruction in 3D medical images. T-surfaces is a deformable model based on a triangulation of the image domain, a discrete surface model and an image threshold. Two types of isosurface generation methods are considered: the continuation ones and the marching ones. The former is useful during the reparameterization of T-surfaces while the later is suitable to initialize the model closer the boundary. Specifically, in a first stage, the T-surfaces grid and the threshold are used to define a coarser image resolution. This field is thresholded to get a 0-1 function which is processed by a marching method to generate polygonal surfaces whose interior may contain the desired objects. If a polygonal surface involves more than one object, then the resolution is increased in that region and the marching applied again. Next, we apply T-surfaces to improved the result. If the obtained topology remains incorrect, we enable the user to modify the topology by an interactive method based on the T-surfaces framework. Finally, we demonstrate the utility of diffusion methods for our approach.","PeriodicalId":286814,"journal":{"name":"Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122626777","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":"Linear features detection in SAR images for urban analysis","authors":"Rodrigo C. S. Costa, F. Medeiros","doi":"10.1109/SIBGRA.2002.1167173","DOIUrl":"https://doi.org/10.1109/SIBGRA.2002.1167173","url":null,"abstract":"This work is concerned with extracting straight lines in SAR image areas for application of urban analysis. The methodology combines the Hough transform and line detector algorithms proposed by Tupin et al. (1998) to extract the main axes in road networks. A real SAR image is used to test the proposed algorithm.","PeriodicalId":286814,"journal":{"name":"Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114794992","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":"A comparison of POCS algorithms for tomographic reconstruction under noise and limited view","authors":"F. V. Salina, N. Mascarenhas, P. E. Cruvinel","doi":"10.1109/SIBGRA.2002.1167164","DOIUrl":"https://doi.org/10.1109/SIBGRA.2002.1167164","url":null,"abstract":"We present in this work a comparison among four algorithms for transmission tomography. The algorithms are based on the formalism of POCS (Projection onto Convex Sets): ART (Algebraic Reconstruction Technique), SIRT (Simultaneous Iterative Reconstruction Technique), sequential POCS and parallel POCS. We found that the use of adequate a priori knowledge about the solutions, expressed by convex sets restrictions, particularly in the case of the last algorithm, is an efficient way to reduce the variations on the solutions due to the ill-conditioning of the reconstruction problem, not only due to the noise in the projections, but also due to limited view reconstruction.","PeriodicalId":286814,"journal":{"name":"Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131622178","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":"Combining approximate geometry with view-dependent texture mapping - a hybrid approach to 3D video teleconferencing","authors":"C. Kurashima, Ruigang Yang, A. Lastra","doi":"10.1109/SIBGRA.2002.1167133","DOIUrl":"https://doi.org/10.1109/SIBGRA.2002.1167133","url":null,"abstract":"We present a hybrid system using computer vision and graphics methods that effectively combines fast automatic 3D model extraction with view-dependent texture mapping for the purpose of real-time person-to-person 3D video teleconferencing. In our approach the problem of creating a dense disparity map is bypassed. We compute only a sparse geometric model, which is textured from multiple cameras using an image-based rendering approach. Using a commodity graphics card and three personal computers arranged in a cluster, we achieve a performance of 3 to 4 frames per second. We demonstrate the ability to provide a 3D tele-immersive environment with our system.","PeriodicalId":286814,"journal":{"name":"Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing","volume":"50 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120876779","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":"A locally adaptive edge-preserving algorithm for image interpolation","authors":"Leízza Rodrigues, D. Borges, L. Gonçalves","doi":"10.1109/SIBGRA.2002.1167158","DOIUrl":"https://doi.org/10.1109/SIBGRA.2002.1167158","url":null,"abstract":"Digital image interpolation techniques are frequently used to enlarge pictures, i.e. zooming in, and they are upon increasingly demand for developing product applications using digital still cameras. One common difficulty with conventional interpolation techniques is that of preserving details, i.e. edges, and at the same time smoothing the data for not introducing spurious artifacts. A definitive solution to this is still an open issue, although there are working methods in the market, see e.g. Parker et. al. (1997), Sakamoto et. al. (1998) for recent surveys. We propose a locally adaptive edge-preserving algorithm for image interpolation, which deals with this problem, and different than other methods shows how to compute local thresholds preserving edges and not destroying smoothness at the same time.","PeriodicalId":286814,"journal":{"name":"Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133768535","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":"Robust anisotropic diffusion to produce clear statistical parametric map from noisy fMRI","authors":"H. Y. Kim, Z. Cho","doi":"10.1109/SIBGRA.2002.1167118","DOIUrl":"https://doi.org/10.1109/SIBGRA.2002.1167118","url":null,"abstract":"Functional magnetic resonance imaging (fMRI) uses MRI to noninvasively map areas of increased neuronal activity in human brain without the use of an exogenous contrast agent. Low signal-to-noise ratio of fMRI images makes it necessary to use sophisticated image processing techniques, such as statistical parametric map (SPM), to detect activated brain areas. This paper presents a new technique to obtain clear SPM from noisy fMRI data. It is based on the robust anisotropic diffusion. A direct application of the anisotropic diffusion to fMRI does not work, mainly due to the lack of sharp boundaries between activated and non-activated regions. To overcome this difficulty, we propose to calculate SPM from noisy fMRI, compute diffusion coefficients in the SPM space, and then perform the diffusion in fMRI images using the coefficients previously computed. These steps are iterated until the convergence. Experimental results using the new technique yielded surprisingly sharp and noiseless SPMs.","PeriodicalId":286814,"journal":{"name":"Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129545678","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":"IFT-Watershed from gray-scale marker","authors":"R. Lotufo, A. Falcão, F. Zampirolli","doi":"10.1109/SIBGRA.2002.1167137","DOIUrl":"https://doi.org/10.1109/SIBGRA.2002.1167137","url":null,"abstract":"The watershed transform and the morphological reconstruction are two of the most important operators for image segmentation in the framework of mathematical morphology. In many situations, the segmentation requires the classical watershed transform of a reconstructed image. In this paper, we introduce the IFT-watershed from gray scale marker-a method to compute at same time, the reconstruction and the classical watershed transform of the reconstructed image, without explicit computation of any regional minima. The method is based on the Image Foresting Transform (IFT)-a unified and efficient approach to reduce image processing problems to a minimum-cost path forest problem in a graph. As additional contributions, we demonstrate that (i) the cost map of the IFT-watershed from markers is identical to the output of the superior gray scale reconstruction; (ii) other reconstruction algorithms are not watersheds; and (iii) the proposed method achieves competitive advantages as compared to the current classical watershed approach.","PeriodicalId":286814,"journal":{"name":"Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130312630","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":"Hierarchical face modeling and fast 3D facial expression synthesis","authors":"Yu Zhang, E. Prakash, E. Sung","doi":"10.1109/SIBGRA.2002.1167166","DOIUrl":"https://doi.org/10.1109/SIBGRA.2002.1167166","url":null,"abstract":"This paper presents a new hierarchical facial model that conforms to the human anatomy for realistic and fast 3D facial expression synthesis. The facial model has a skin/muscle/skull structure. The deformable skin model uses a kind of nonlinear spring to directly simulate the nonlinear visco-elastic behavior of soft tissue, and a new kind of edge repulsion spring is developed to prevent model collapse. The incorporation of the skull extends the scope of facial motion and facilitates facial muscle construction. The construction of facial muscles is achieved by using an efficient muscle mapping approach that ensures different muscles to be located at the anatomically correct positions. For computational efficiency, we devise an adaptive simulation algorithm which uses either a semi-implicit integration scheme or a quasi-static solver to compute the relaxation by traversing the designed data structures in a breadth-first order. The algorithm runs in real-time and has successfully synthesized realistic facial expressions.","PeriodicalId":286814,"journal":{"name":"Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132093917","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}