In this paper, a new nonlinear filtering technique is introduced for denoising of images that are highly contaminated by impulse noise. The proposed filtering technique is more effective in eliminating impulse noise and preserving the image features. The filter replaces a corrupted pixel by the median value or by its processed neighboring pixel value. The uncorrupted pixels are left undisturbed. Simulation studies show that the proposed filter can eliminate impulse noise of densities up to 70% while preserving the edges and fine details satisfactorily. The performance of the filter is evaluated by applying it on different test images and the results obtained are presented.
{"title":"A New Nonlinear Filtering Technique for Image Denoising","authors":"R. Pushpavalli, E. Srinivasan, S. Himavathi","doi":"10.1109/ARTCOM.2010.39","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.39","url":null,"abstract":"In this paper, a new nonlinear filtering technique is introduced for denoising of images that are highly contaminated by impulse noise. The proposed filtering technique is more effective in eliminating impulse noise and preserving the image features. The filter replaces a corrupted pixel by the median value or by its processed neighboring pixel value. The uncorrupted pixels are left undisturbed. Simulation studies show that the proposed filter can eliminate impulse noise of densities up to 70% while preserving the edges and fine details satisfactorily. The performance of the filter is evaluated by applying it on different test images and the results obtained are presented.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130711549","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}
High Resolution images can be reconstructed from several blurred, noisy and aliased low resolution images using a computational process know as super resolution reconstruction. Super resolution reconstruction is the process of combining several low resolution images into a single higher resolution image. Super resolution reconstruction consists of registration, restoration and interpolation phases, once the Low resolution image are registered with respect to a reference frame then restoration is performed to remove the blur and noise from the images, finally the images are interpolated using adaptive interpolation. In this paper we are proposing an adaptive interpolation for super resolution reconstruction. Our proposed wavelet based restoration and interpolation preserves the edges as well as smoothens the image without introducing artifacts. The proposed algorithm avoids the application of iterative methods. It reduces the complexity of calculation and applies to large dimension low-resolution images. Experimental results show the proposed approach has succeeded in obtaining a high-resolution image with a high PSNR, ISNR ratio and a good visual quality.
{"title":"A Novel Wavelet Based Super Resolution Reconstruction of Low Resolution Images Using Adaptive Interpolation","authors":"L. Liyakathunisa, C. Kumar","doi":"10.1109/ARTCOM.2010.58","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.58","url":null,"abstract":"High Resolution images can be reconstructed from several blurred, noisy and aliased low resolution images using a computational process know as super resolution reconstruction. Super resolution reconstruction is the process of combining several low resolution images into a single higher resolution image. Super resolution reconstruction consists of registration, restoration and interpolation phases, once the Low resolution image are registered with respect to a reference frame then restoration is performed to remove the blur and noise from the images, finally the images are interpolated using adaptive interpolation. In this paper we are proposing an adaptive interpolation for super resolution reconstruction. Our proposed wavelet based restoration and interpolation preserves the edges as well as smoothens the image without introducing artifacts. The proposed algorithm avoids the application of iterative methods. It reduces the complexity of calculation and applies to large dimension low-resolution images. Experimental results show the proposed approach has succeeded in obtaining a high-resolution image with a high PSNR, ISNR ratio and a good visual quality.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126870620","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}
A wide variety of real world systems require reliable personal recognition schemes to either confirm or determine the identity of an individual requesting their services. Biometric recognition scheme refers to the automatic recognition/identification of individuals based on their physiological and/or behavioral characteristics. We have proposed a Vein Based Personal Identification System (VBPIS), which overcomes the deficiencies usually found in commercially available biometric systems and provides incomparable security, usability, reliability, accuracy, and as well as user convenience. The proposed system uses Pattern Recognition, Image processing technique for extracting and manipulating the vein patterns, Encryption Technique to provide security to Vein pattern template and Data Compressing Technique in order to save memory space to store compressed vein pattern images. Reliability of this system is that it is quite difficult to cheat our finger vein system, which makes it more difficult to duplicate because our vein patterns are unique for each individual and permanent. It is relevance to security and can be used in computer systems, laptops, cellular phones, ATM, Man and machine diagnostics, person identification and industrial inspection.
{"title":"Design of a Vein Based Personal Identification System","authors":"Madhumita Kathuria","doi":"10.1109/ARTCOM.2010.104","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.104","url":null,"abstract":"A wide variety of real world systems require reliable personal recognition schemes to either confirm or determine the identity of an individual requesting their services. Biometric recognition scheme refers to the automatic recognition/identification of individuals based on their physiological and/or behavioral characteristics. We have proposed a Vein Based Personal Identification System (VBPIS), which overcomes the deficiencies usually found in commercially available biometric systems and provides incomparable security, usability, reliability, accuracy, and as well as user convenience. The proposed system uses Pattern Recognition, Image processing technique for extracting and manipulating the vein patterns, Encryption Technique to provide security to Vein pattern template and Data Compressing Technique in order to save memory space to store compressed vein pattern images. Reliability of this system is that it is quite difficult to cheat our finger vein system, which makes it more difficult to duplicate because our vein patterns are unique for each individual and permanent. It is relevance to security and can be used in computer systems, laptops, cellular phones, ATM, Man and machine diagnostics, person identification and industrial inspection.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121301910","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}
A novel adaptive method included two phases for discovering maximal frequent itemsets is roposed. A flexible hybrid search method is given, which exploits key advantages of both the top-down strategy and the bottomup strategy. Information gathered in the bottom-up can be used to prune in the other top-down direction. Some efficient decomposition and pruning strategies are implied, which can reduce the original search space rapidly in the iterations. The compressed bitmap technique is employed in the counting of itemsets support. According to the big space requirement for the saving of intact bitmap, each bit vector is partitioned into some blocks, and hence every bit block is encoded as a shorter symbol. Therefore the original bitmap is impacted efficiently. Experimental and analytical results are presented in the end
{"title":"An Adaptive Method for Discovering Maximal Frequent Itemsets to Large Databases","authors":"V. Rao, P. Geetha, P. Vaishali","doi":"10.1109/ARTCOM.2010.56","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.56","url":null,"abstract":"A novel adaptive method included two phases for discovering maximal frequent itemsets is roposed. A flexible hybrid search method is given, which exploits key advantages of both the top-down strategy and the bottomup strategy. Information gathered in the bottom-up can be used to prune in the other top-down direction. Some efficient decomposition and pruning strategies are implied, which can reduce the original search space rapidly in the iterations. The compressed bitmap technique is employed in the counting of itemsets support. According to the big space requirement for the saving of intact bitmap, each bit vector is partitioned into some blocks, and hence every bit block is encoded as a shorter symbol. Therefore the original bitmap is impacted efficiently. Experimental and analytical results are presented in the end","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121118079","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}
P. Thakurta, Subhansu Bandyopadhyay, S. Basu, S. Goswami
A new approach of an efficient congestion control technique as well as delay reduction in mobile networks is proposed in this paper. The least congested route has been found and subsequently, a dynamic linking concept has been applied on this route to reduce the computation time to a large extent. To reduce the delay for network signals through reducing the path length of the call requesting nodes, a method based on skipping and adjusting of the nodes in the tree structure has been described. A new approach on balanced tree has been introduced to achieve better performance. The simulation study confirms the effectiveness of the proposed scheme
{"title":"A New Approach on Congestion Control with Delay Reduction in Mobile Networks","authors":"P. Thakurta, Subhansu Bandyopadhyay, S. Basu, S. Goswami","doi":"10.1109/ARTCOM.2010.45","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.45","url":null,"abstract":"A new approach of an efficient congestion control technique as well as delay reduction in mobile networks is proposed in this paper. The least congested route has been found and subsequently, a dynamic linking concept has been applied on this route to reduce the computation time to a large extent. To reduce the delay for network signals through reducing the path length of the call requesting nodes, a method based on skipping and adjusting of the nodes in the tree structure has been described. A new approach on balanced tree has been introduced to achieve better performance. The simulation study confirms the effectiveness of the proposed scheme","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131280482","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}
Shape is an important property of visual objects which distinguishes it from others and is done with ease by living beings. Shape is invariant to scale (magnification or shrinking), rotation, translation, and flip (mirror-reflection). A good representation will lead to a better classification or retrieval system. A known representation called “normalized centroid distance signature” has all above properties except invariance to rotation and flip. By quantizing the signature into “signature histogram”, invariance to rotation and flip are also achieved. But, this has a severe drawback, namely, number of false positives will increase, i.e., many entirely different shapes can have same or similar signature histograms. The paper proposes to augment the signature histogram with local information that is present at the boundary of the object. This is done in such a way without loosing any properties of the signature histogram. This leads to a hierarchical representation scheme called the “kth order augmented histogram” where k is a positive integer. A novel kth order hierarchical retrieval system is also proposed which uses the hierarchical representation scheme. The proposed scheme is compared with a recent similar scheme.
{"title":"A Novel Shape Based Hierarchical Retrieval System for 2D Images","authors":"T. Gokaramaiah, P. Viswanath, B. E. Reddy","doi":"10.1109/ARTCOM.2010.43","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.43","url":null,"abstract":"Shape is an important property of visual objects which distinguishes it from others and is done with ease by living beings. Shape is invariant to scale (magnification or shrinking), rotation, translation, and flip (mirror-reflection). A good representation will lead to a better classification or retrieval system. A known representation called “normalized centroid distance signature” has all above properties except invariance to rotation and flip. By quantizing the signature into “signature histogram”, invariance to rotation and flip are also achieved. But, this has a severe drawback, namely, number of false positives will increase, i.e., many entirely different shapes can have same or similar signature histograms. The paper proposes to augment the signature histogram with local information that is present at the boundary of the object. This is done in such a way without loosing any properties of the signature histogram. This leads to a hierarchical representation scheme called the “kth order augmented histogram” where k is a positive integer. A novel kth order hierarchical retrieval system is also proposed which uses the hierarchical representation scheme. The proposed scheme is compared with a recent similar scheme.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"538 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133761730","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}
Bikesh Kr. Singh, G. Sinha, B. Mazumdar, Md. Shariar Imroze Khan
In this paper content based image retrieval of x-ray images using fusion of spectral & shape features is discussed. Texture analysis and shape description are two of the key parts of image content description. Most of the existing descriptors are usually either application dependent or non-robust so we have used spectral measure for content analysis and Fourier descriptors for shape analysis. From x-ray database of 210 images, 198 images where successfully retrieved which resulted in an efficiency of the CBIR system of 94.28%.
{"title":"Content Based Retrieval of X-ray Images Using Fusion of Spectral Texture and Shape Descriptors","authors":"Bikesh Kr. Singh, G. Sinha, B. Mazumdar, Md. Shariar Imroze Khan","doi":"10.1109/ARTCOM.2010.51","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.51","url":null,"abstract":"In this paper content based image retrieval of x-ray images using fusion of spectral & shape features is discussed. Texture analysis and shape description are two of the key parts of image content description. Most of the existing descriptors are usually either application dependent or non-robust so we have used spectral measure for content analysis and Fourier descriptors for shape analysis. From x-ray database of 210 images, 198 images where successfully retrieved which resulted in an efficiency of the CBIR system of 94.28%.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114805931","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}
Network operators need to ascertain loop topology before committing for the performance of a digital subscriber loop. Single Ended Loop Testing (SELT) is generally the most preferred and economical way for estimating the loop topology. In this paper we propose a novel method of loop topology estimation based on discrete multitone line code which reuses most of firmware modules in a typical DSL broadband modem. The loop estimation is done in two phases, the first being frequency domain reflectometry data collection phase and the second being an analysis phase which is done in time and frequency domains. Three types of topologies are considered in this paper for validation: a single line, a network with bridge tap and a cascade of two line sections. The major advantages of this method are, no prior knowledge of the network topology is required, all code is resident in the modem itself and does not need any external bypasses. This method shows good prediction capability for all types of networks up to 20 Kft.
{"title":"Frequency Domain Reflectometry Based SELT Approach for Loop Topology Estimation","authors":"M. Bharathi, S. Ravishankar, Usharani K.R.","doi":"10.1109/ARTCOM.2010.54","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.54","url":null,"abstract":"Network operators need to ascertain loop topology before committing for the performance of a digital subscriber loop. Single Ended Loop Testing (SELT) is generally the most preferred and economical way for estimating the loop topology. In this paper we propose a novel method of loop topology estimation based on discrete multitone line code which reuses most of firmware modules in a typical DSL broadband modem. The loop estimation is done in two phases, the first being frequency domain reflectometry data collection phase and the second being an analysis phase which is done in time and frequency domains. Three types of topologies are considered in this paper for validation: a single line, a network with bridge tap and a cascade of two line sections. The major advantages of this method are, no prior knowledge of the network topology is required, all code is resident in the modem itself and does not need any external bypasses. This method shows good prediction capability for all types of networks up to 20 Kft.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115845848","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}
Multilevel security (MLS) is the application of a computer system to process information with different sensitivities (i.e., at different security levels), permit simultaneous access by users with different security clearances and needs-to-know, and prevent users from obtaining access to information for which they lack authorization. Multilevel Security (MLS) system is intended to prevent users from declassifying information. Using an object-oriented approach to implementing security in an application results not only with the problem of code scattering and code tangling, but also results in weaker enforcement of security concern. An aspect-oriented approach is advocated as an improvement to the object oriented approach in dealing with the issues of code tangling and scattering. The reason for this weaker enforcement of security could be due to the inherent design of the system or because of a programming error. In this paper, we discuss implementation of case study using Aspect Oriented Programming (AOP) AspectJ BLP access control policy for improved modularity and maintainability of MLS.
{"title":"Multilevel Security Using Aspect Oriented Programming AspectJ","authors":"S. Kotrappa, P. Kulkarni","doi":"10.1109/ARTCOM.2010.87","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.87","url":null,"abstract":"Multilevel security (MLS) is the application of a computer system to process information with different sensitivities (i.e., at different security levels), permit simultaneous access by users with different security clearances and needs-to-know, and prevent users from obtaining access to information for which they lack authorization. Multilevel Security (MLS) system is intended to prevent users from declassifying information. Using an object-oriented approach to implementing security in an application results not only with the problem of code scattering and code tangling, but also results in weaker enforcement of security concern. An aspect-oriented approach is advocated as an improvement to the object oriented approach in dealing with the issues of code tangling and scattering. The reason for this weaker enforcement of security could be due to the inherent design of the system or because of a programming error. In this paper, we discuss implementation of case study using Aspect Oriented Programming (AOP) AspectJ BLP access control policy for improved modularity and maintainability of MLS.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"46 36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124671623","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}
Pradeep Aluru, Jayant Rajpurohit, Mayank Agarwal, S. Rao, Ghanshyam Singh
This paper is emphasized on the total sensing time of the dedicated sensing receiver (DSR) of the cognitive radio (CR) network. To minimize the total sensing tine that is the time taken by the receiver to sense the spectrum, a potential modification has been made in the basic cognitive radio receiver architecture. The cognitive radio is a novel communication network, which is useful in utilizing the licensed spectrum by the unlicensed users when it is not being used by the licensed users. In order to reduce the sensing time of DSR, we have increased the number of antennas being used for DSR in the cognitive radio. The range of frequencies being utilized is increased to a large extent for various potential applications.
{"title":"Improvement in Total Sensing Time of the Receiver in the Cognitive Radio","authors":"Pradeep Aluru, Jayant Rajpurohit, Mayank Agarwal, S. Rao, Ghanshyam Singh","doi":"10.1109/ARTCOM.2010.27","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.27","url":null,"abstract":"This paper is emphasized on the total sensing time of the dedicated sensing receiver (DSR) of the cognitive radio (CR) network. To minimize the total sensing tine that is the time taken by the receiver to sense the spectrum, a potential modification has been made in the basic cognitive radio receiver architecture. The cognitive radio is a novel communication network, which is useful in utilizing the licensed spectrum by the unlicensed users when it is not being used by the licensed users. In order to reduce the sensing time of DSR, we have increased the number of antennas being used for DSR in the cognitive radio. The range of frequencies being utilized is increased to a large extent for various potential applications.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123535764","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：