M. S. Mughal, M. Nawaz, F. Ahmad, Saadia Shahzad, A. K. Bhatti, S. Mohsin
{"title":"A 3D-Hash Function for Fast Image Indexing and Retrieval","authors":"M. S. Mughal, M. Nawaz, F. Ahmad, Saadia Shahzad, A. K. Bhatti, S. Mohsin","doi":"10.1109/CGIV.2007.2","DOIUrl":"https://doi.org/10.1109/CGIV.2007.2","url":null,"abstract":"Image retrieval on the basis of similarity is an important task in many image database applications. Majority of the users' requests requires retrieving those images in the database that are spatially similar to the query image. In image databases, images are represented by symbolic images. Spatial relationships in a symbolic image are represented by 2D strings. In Image Database Systems, conventionally 2D strings that are converted into triples represent symbolic pictures or objects. A unique hash address is assigned to each triple, which represents the picture. It serves the purpose of retrieval of images by reducing pattern matching. The calculation of new unique hash keys for all triples is required while inserting new image. In order to overcome these problems we present a solution in this paper that is the concept of a 3D hash function which speeds up the computation of the associated values for the picture objects.","PeriodicalId":433577,"journal":{"name":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115313617","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":"Similarity Searching In Statistical Figures Based On Extracted Meta Data","authors":"M. M. Hassan, W. Al-Khatib","doi":"10.1109/CGIV.2007.76","DOIUrl":"https://doi.org/10.1109/CGIV.2007.76","url":null,"abstract":"Similarity searching is an excellent approach for getting information from subjective materials like images or videos. Some excellent works on special domains have done. We focus on statistical images. These kinds of images have some excellent features that can be clearly extractable and useable in similarity searching. But there no significant work has been done in this area. So we have done some preliminary works in this domain. By some extensive analysis we classify images of this domain in some sub domains and also identified the nature of features those can be considered as silent. We develop a prototype based on this analysis where we store extracted features information of a statistical images as meta data. Then we devise some strategy to do similarity searching using standard query formulation.","PeriodicalId":433577,"journal":{"name":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123079002","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":"Simulation Techniques for Generating Behavior for Unitable Artificial Life","authors":"Shunsuke Ohono, Shinichiro Yagi, Y. Kawaguchi","doi":"10.1109/CGIV.2007.78","DOIUrl":"https://doi.org/10.1109/CGIV.2007.78","url":null,"abstract":"In this research, we aimed to generate behavior for artificial life made by combining segments with the same form while keeping a simple architecture by using genetic algorithm. And as a result, in symmetric-linear forms, looped forms and forms asymmetrical on a two-dimensional plane, we were able to study various behaviors used to extend the distance traveled. Furthermore, with some forms, we were able to obtain the interesting solution in the task of crossing a mountain and a valley.","PeriodicalId":433577,"journal":{"name":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116635033","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":"Random Projection with Robust Linear Discriminant Analysis Model in Face Recognition","authors":"Ying-Han Pang, A. Teoh","doi":"10.1109/CGIV.2007.70","DOIUrl":"https://doi.org/10.1109/CGIV.2007.70","url":null,"abstract":"This paper presents a face recognition technique with two techniques: random projection (RP) and robust linear discriminant analysis model (RDM). RDM is an enhanced version of fisher's linear discriminant with energy-adaptive regularization criteria. It is able to yield better discrimination performance. Same as Fisher's Linear Discriminant, it also faces the singularity problem of within-class scatter. Thus, a dimensionality reduction technique, such as principal component analysis (PCA), is needed to deal with this problem. In this paper, RP is used as an alternative to PCA in RDM in the application of face recognition. Unlike PCA, RP is training data independent and the random subspace computation is relatively simple. The experimental results illustrate that the proposed algorithm is able to attain better recognition performance (error rate is approximately 5% lower) compared to Fisherfaces.","PeriodicalId":433577,"journal":{"name":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","volume":"419 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126704651","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":"Estimation of Camera Parameters from a Single Moving Camera using Quaternion-based Interpolation of 3D Trajectory","authors":"Donghun Lee, Ji-Heon Park","doi":"10.1109/CGIV.2007.39","DOIUrl":"https://doi.org/10.1109/CGIV.2007.39","url":null,"abstract":"This paper presents a new quaternion-based method to estimate the camera parameters in a single video stream to interpolate 3D trajectory of the moving camera with camera parameters. We assume that the camera looks at three fixed points while translating and rotating in 3D space. To estimate the camera parameters, we get a set of nonlinear equations derived from a geometric perspective camera model. We have a large number of image frames to find each camera parameters while the number of unknown camera model parameters cannot be determined from a single frame. In order to solve this problem, we used interpolation to approximate camera movement in both translation and rotation. This was done using the concept of control node set at the specific frame in the video stream. The camera movement is based on acceleration level control while satisfying physical constraints. The control node is the set of variables used to determine acceleration-based interpolated equation used for data fitting. In this process, we used quaternion to interpolate orientation of the camera. The acceleration-based data fitting problem is solved using nonlinear parameter optimization solver, GRG2. Our experimental results show that this approach to estimate camera parameters and 3D trajectory of the camera moment is robust enough to handle image sequences of a common scene without sudden change in camera moment.","PeriodicalId":433577,"journal":{"name":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122701262","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":"Interactive 3D Forensic Visualisation: Virtual Interactive Prototype","authors":"Eddie Soon Eu Hui, Robert L. Hedley, Daniela Leva","doi":"10.1109/CGIV.2007.52","DOIUrl":"https://doi.org/10.1109/CGIV.2007.52","url":null,"abstract":"This paper focuses on virtual reality application utilising a design approach to produce an interactive prototype for the usage of visualization and reconstruction of forensic research. This involves different levels of 3D simulation and animation resulting in variations of outputs. This proposed interactive prototype would serve as a guide to research the process of developing predefined outcomes of forensic training and archiving particularly in Malaysia. The research looks into developing a virtual forensic lab that serves as an online community of forensic researchers, and has potential to grow over time. The virtual lab also serves as a database library of existing forensic cases that are translated to a digital form. The application also generates new object-oriented environments enabling new conditions and situations that are not based on existing archive cases. This paper focuses on the methodology of the prototype creation.","PeriodicalId":433577,"journal":{"name":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114054065","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":"Multi-resolution Meshes Deformation Based on Pyramid Coordinates","authors":"Sha Chen-min, Liu Bo, Ma Zhan-guo, Zhang Hong-bin","doi":"10.1109/CGIV.2007.59","DOIUrl":"https://doi.org/10.1109/CGIV.2007.59","url":null,"abstract":"In this paper, we present a technique for multi-resolution meshes deformation based on pyramid coordinates. Pyramid coordinates are rotation invariant, and can achieve low distortion editing for large deformations. Their drawback is that the reconstruction process is nonlinear and time consuming especially for large meshes. In order to decrease the computational cost, the proposed method reduces the number of vertices involved in the deformation. We first construct a simplified mesh using a modified CPM algorithm; then edit the simplified meshes by pyramid coordinates based mesh detail presentation; finally, series of details are added to the deformed simplified mesh. Our algorithm can generate natural looking deformations more efficiently than the original pyramid coordinates method.","PeriodicalId":433577,"journal":{"name":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114445804","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":"How Psychophysical Perception of Motion and Image relates to Animation Practice","authors":"C. MacGillivray","doi":"10.1109/CGIV.2007.48","DOIUrl":"https://doi.org/10.1109/CGIV.2007.48","url":null,"abstract":"This paper investigates the difference between seeing and perceiving in animation. It analyses character design in the light of experiments in face recognition, in particular how iconic a character can be in design. It discusses whether a universal theory can be applied and if caricatures are really 'super-portraits' that echo how brains recall faces. The psychophysical perception of motion in animation is analysed in the light of animation principles such as 'squash and stretch' and 'isolation'. Using made and found examples, the paper looks at how signature movement and animation principles are now being supplemented or even supplanted by motion capture and posits what this means for animation in the future. The paper maps popular animation characters within two specially designed triangular charts for image and for motion. It analyses the resulting images in terms of perceived and received information, looking particularly at the region of empathic connection coined by Dr Masahiro Mori as the 'Uncanny Valley'. [1] By examining the different empathic demands motion capture makes on an audience it reaches the conclusion that both image and motion must be treated symbiotically for full analysis to be achieved.","PeriodicalId":433577,"journal":{"name":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121849822","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":"Parametric 3D Object Representation and Applications","authors":"L. Bai, Yi Song","doi":"10.1109/CGIV.2007.20","DOIUrl":"https://doi.org/10.1109/CGIV.2007.20","url":null,"abstract":"Despite intensive research, 3D representation is still an open research issue in computer graphics. In this paper, we propose a novel B-spline surface modelling technique. Unlike previous work, our approach deals with unstructured point cloud data. By representing objects in a common parameter space, one of the most challenging problems, i.e. automatic dense correspondence between objects, is solved with little effort. Supporting level of detail (LOD) control, our approach is particularly efficient for 3D object rendering. Furthermore, the representation is compact - over 90% compression rate is achieved. It also allows efficient 3D objects comparison and metamorphosis.","PeriodicalId":433577,"journal":{"name":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130326006","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 Visibility Field for Ray Tracing","authors":"J. Mortensen, Pankaj Khanna, Insu Yu, M. Slater","doi":"10.1109/CGIV.2007.14","DOIUrl":"https://doi.org/10.1109/CGIV.2007.14","url":null,"abstract":"This paper presents a type of visibility data structure for accelerated ray tracing. The visibility field is constructed by choosing a regular point subdivision over a hemisphere to obtain a set of directions. Corresponding to each direction there is then a rectangular grid of parallel beams, with each beam referencing a set of identifiers corresponding to objects that intersect it. Objects lying along a beam are sorted using a 1D BSP along the beam direction. The beam corresponding to any ray can be looked up in small constant time and the set of objects corresponding to the beam can then be searched for intersection with the ray using an optimised traversal strategy. This approach trades off rendering speed for memory usage and pre-processing time. The data structure is also very suitable for hemisphere integration tasks due to its spherical nature and results for one such task - ambient occlusion - are also presented. Results for several scenes with various rendering methods are presented and compare favourably with a well established approach, the single-ray coherent ray tracing approach of Wald and Slusallek et al.","PeriodicalId":433577,"journal":{"name":"Computer Graphics, Imaging and Visualisation (CGIV 2007)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129180236","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}