Kedarnath Thangudu, Lakshmi Gade, Jag Mohan Singh, P J Narayanan
{"title":"Point Based Representations for Hierarchical Environments","authors":"Kedarnath Thangudu, Lakshmi Gade, Jag Mohan Singh, P J Narayanan","doi":"10.1109/ICCTA.2007.104","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.104","url":null,"abstract":"The advent of advanced graphics technologies and improved hardware has enabled the generation of highly complex models with huge number of triangles. Point-based representations and rendering have emerged as viable representations for high-quality models in this scenario. These methods have been demonstrated only on high resolution, compact objects so far. They have to be adapted to environments that extend over large areas to be considered serious representations. In this paper, we present an adaptation of the point-based representation to large, hierarchical environments. We show how point-based data can be generated by sampling polygon-based representations. We also show the combination of an object hierarchy and multiresolution point representations and develop rendering algorithms for the same. The multiresolution representation is constructed during the generation process. We then show a hybrid representation in which the more complex portions of the environment are represented using points and others using the original polygon-based representation. This produces better rendering performance by keeping large, flat regions as triangles. We demonstrate the method on the model of the Fatehpur Sikri which has 14000 objects with over 500,000 triangles","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133798817","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":"Finite Automata Inspired Model for Dominant Point Detection: A Non-Parametric Approach","authors":"R. Dinesh, D. S. Guru","doi":"10.1109/ICCTA.2007.63","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.63","url":null,"abstract":"In this paper a novel non-parametric method of detecting dominant points on a digital curve is proposed. The proposed method estimates the curvature at every point on the curve by computing the reciprocal of the angle made at that point due to the left and right arms of the point. The points that bear local maxima curvature are selected as true dominant points. A novel method for determining a region of support of a point useful for its curvature estimation is also presented. Unlike other methods, the proposed method determines a region of support which is not necessarily symmetric. A finite automaton is devised to determine an adaptive region of support of a point. An extensive experiment has been conducted to reveal the robustness of the proposed method on various shapes with different parameters and is shown to be superior to several other existing methods","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133945078","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}
Zhijun Yu, S. Dong, Jianming Wei, Tao Xing, Haitao Liu
{"title":"Neural Network Aided Unscented Kalman Filter for Maneuvering Target Tracking in Distributed Acoustic Sensor Networks","authors":"Zhijun Yu, S. Dong, Jianming Wei, Tao Xing, Haitao Liu","doi":"10.1109/ICCTA.2007.88","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.88","url":null,"abstract":"A new neural network aided unscented Kalman filter is presented for tracking maneuvering target in distributed acoustic sensor networks. In practice, the system dynamics of these problems are usually incompletely observed, there may be large modeling errors when the target is maneuverable and some parameters of the system models may be inaccurate. So we propose using an offline trained neural network to correct these errors, the nonlinear inferring process is done by the normal unscented Kalman filter. This method doesn't need complex modeling for tracking maneuvering target and is very suitable for real-time implementation because the implementation time is only the sum of the unscented Kalman filter and the neural network recall time","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116164747","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":"Using Object Models as Domain Knowledge in Perceptual Organization: An Approach for Object Category Identification in Video Sequences","authors":"Gaurav Harit, R. Bharatia, S. Chaudhury","doi":"10.1109/ICCTA.2007.130","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.130","url":null,"abstract":"In this paper we present a framework which integrates object-model knowledge with the perceptual organization process. We demonstrate the advantages of the add-on grouping evidences as contributed by the object models for a more robust perceptual organization in the spatio-temporal domain. Our system performs detection of foreground objects along with recognition in video","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116542078","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":"Localization of Ear Using Outer Helix Curve of the Ear","authors":"Saeeduddin Ansari, Phalguni Gupta","doi":"10.1109/ICCTA.2007.82","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.82","url":null,"abstract":"This paper presents an efficient approach for localization of ear from an arbitrary 2D side face image with varying background. Outer helix curves of ears moving parallel to each other are used as feature for localizing ear in an image. Using Canny edge detector, edges are extracted from the whole image. These edges are segmented in convex and concave edges. From these segmented edges expected outer helix edges are determined after eliminating non-ear edges. Final outer helix edge of an ear is constructed using expected outer helix curves. Decision is made on a constructed curve whether it belongs to outer helix of ear or not. This technique is implemented on IITK, India database containing 700 samples. Accuracy of localization is more than 93%","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125988305","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":"Comprehensive Check Image Reader","authors":"M. Shridhar, G. Houle, F. Kimura","doi":"10.1109/ICCTA.2007.42","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.42","url":null,"abstract":"A check contains more than just an amount. The fields of interests are courtesy and legal amounts, date, check number, MICR line, payer, payee, memo, signature, signature instruction, fractional validation numbers, endorsement, security features, etc. In fact a bank can literally construct a very meaningful profile of the account holder from an analysis of the checks written and received by an account holder. Since October 2005 the \"Check 21\" law defines an image of a check as being as valid as the original document. The agreement between banks is that a binary image 200-240 dpi is the most practical format to use. Since most banks are now creating images and must be able to handle incoming images it creates a need for new image tools to validate the quality and readability of each field. This paper describes the challenges in finding and recognizing the fields of interest on the broad document types. These fields contain machine printed and handwritten words. The remaining of the paper would focus on handwritten legal line recognition which remains the most challenging field","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125498040","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":"Image Quality Assessment Complemented with Visual Regions of Interest","authors":"D. V. Rao, N. Sudhakar, I. R. Babu, L. Reddy","doi":"10.1109/ICCTA.2007.71","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.71","url":null,"abstract":"Measurement of visual quality is of fundamental importance to numerous image and video processing applications. This paper introduces an image quality index, visual region of interest weighted quality index (VroiWQI). The index integrates the notion of visual regions of interest with the measurement of structural distortion between the original image and the distorted image to effectively match with human visual system (HVS). The method evaluates the structural distortion between the original image and the distorted image to arrive at the quality index in a local region. These local indices are then weighted based on the visual interest of the corresponding region, characterized by entropy in the local region that emphasizes the texture variance. VroiWQI of the image is calculated by averaging these weighted indices, considering different subsets of visual regions with degree of interest greater than a threshold value. Test results show that VroiWQI correlates well with subjective scores","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125585119","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":"Generation of Group Key Using Enhanced One Way Function Tree Group Rekey Protocol","authors":"B. Varthini, S. Valli","doi":"10.1109/ICCTA.2007.64","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.64","url":null,"abstract":"Group communication is the basis for many multimedia and web applications. The group key management is a critical problem in a large dynamic group. All group rekeying protocols incur communication and computation overhead at the group key controller and at the group members. EOFT (enhanced one way function tree) approach uses the CRT tuples of smaller remainders instead of keys of larger bits. EOFT reduces the overall computational and the communication rekeying overhead. This work computes the group key using EOFT with actual numeric values for the keys of the group members. Any computation of the keys is carried out in parallel on their CRT remainders. This work proves that the time complexity of CRT conversion is a negligible one compared to that of the cryptographic functions","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127736614","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":"Optimal Objective Functional Selection for Image Reconstruction in Diffuse Optical Tomography","authors":"Amol V. Patil, S. Mukherji, U. Desai","doi":"10.1109/ICCTA.2007.98","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.98","url":null,"abstract":"Diffused optical tomography (DOT) is a powerful noninvasive functional imaging technique. Inter-parameter crosstalk and near source detector artifacts are major source of inaccuracies in DOT images. In this work we investigate the effect of various objective functional definitions and measurement types on performance of image reconstruction algorithm. Special attention is paid to measurement data types appropriate for handling experimental limitations and inaccuracies. We propose a method of selecting optimal objective functional by visualizing objective functionals in two parameter space using single inclusion DOT problem. Using our method we synthesize a new objective functional for our sample DOT problem. The proposed objective functionals provide minimum inter-parameter crosstalk with negligible near source detector artifacts. Limited memory quasi-Newtonian algorithm is used for image reconstruction. Synthetic data is used to demonstrate effect of various objective functionals on image reconstruction and the superiority of the proposed objective functional","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129200001","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":"Image Watermarking Using Krawtchouk Moments","authors":"V. Appala, P. A. Raj","doi":"10.1109/ICCTA.2007.72","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.72","url":null,"abstract":"This paper proposes a watermark insertion and detection scheme using Krawtchouk moments. These moments are selected for image watermarking because image reconstruction with these moments is better than other orthogonal moments like Legendre, Zernike and Tchebichef. The watermark signal is obtained by modifying some of the Krawtchouk moments of the original image. Further, the strength of the watermark is adjusted based on a threshold value (T) which is obtained by maximum root mean square error (rms value) between Krawtchouk moment invariants of the original image and Krawtchouk moment invariants of original image subjected to possible distortions like rotation, scale and translation. Krawtchouk moment invariants are used since they are invariant to image rotation, scale and translation. In order to detect the added watermark, we calculate the rms value between Krawtchouk moment invariants of test image and Krawtchouk moment invariants of the watermarked image. The watermark is detected if the above rms value is less than a threshold (T). It is noted from the simulation results that the proposed approach is robust with respect to geometric distortions like scale, translation and rotation","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117187164","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}