Pub Date : 2014-12-01DOI: 10.1109/CNT.2014.7062760
M. Chinnathambi, N. Bharanidharan, S. Rajaram
This paper presents the fast and area efficient CORDIC (Coordinate Rotation DIgital Computer)algorithm for sine and cosine wave generation. The concepts of pipelining and multiplexer based CORDIC algorithm is used todecrease the critical path delay and reducing the area respectively. A six stage CORDIC is implemented by two schemes followed by four methods, unrolled CORDIC and multiplexer based CORDIC with and without pipelining. The pipelining is included in four stages(excluding first and last stage). An 8-bit CORDIC algorithm for generating sine wave and cosine wave is designed, implementedand compared by all four methods on Xilinx Spartan3E (XC3S250E).
{"title":"FPGA implementation of fast and area efficient CORDIC algorithm","authors":"M. Chinnathambi, N. Bharanidharan, S. Rajaram","doi":"10.1109/CNT.2014.7062760","DOIUrl":"https://doi.org/10.1109/CNT.2014.7062760","url":null,"abstract":"This paper presents the fast and area efficient CORDIC (Coordinate Rotation DIgital Computer)algorithm for sine and cosine wave generation. The concepts of pipelining and multiplexer based CORDIC algorithm is used todecrease the critical path delay and reducing the area respectively. A six stage CORDIC is implemented by two schemes followed by four methods, unrolled CORDIC and multiplexer based CORDIC with and without pipelining. The pipelining is included in four stages(excluding first and last stage). An 8-bit CORDIC algorithm for generating sine wave and cosine wave is designed, implementedand compared by all four methods on Xilinx Spartan3E (XC3S250E).","PeriodicalId":347883,"journal":{"name":"2014 International Conference on Communication and Network Technologies","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128255653","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}
Pub Date : 2014-12-01DOI: 10.1109/CNT.2014.7062729
M. Sundaram, J. Jose, G. Jaffino
In Recent years increasing attention is paid to welding defects monitoring in industries. An automatic system to extract and classify the welding defects in radiographic images is a main challenge in industries, because of the miniature welded region. In this paper an automatic method is proposed to extract the various welding defects in radiographic weld images. In the first stage the input radiographic image is pre-processed to enhance the quality of the image. In the second stage the welding region is extracted by using c-means segmentation method. After segmentation different features of the welded region are calculated and the 3-D contour plots are plotted.
{"title":"Welding defects extraction for radiographic images using C-means segmentation method","authors":"M. Sundaram, J. Jose, G. Jaffino","doi":"10.1109/CNT.2014.7062729","DOIUrl":"https://doi.org/10.1109/CNT.2014.7062729","url":null,"abstract":"In Recent years increasing attention is paid to welding defects monitoring in industries. An automatic system to extract and classify the welding defects in radiographic images is a main challenge in industries, because of the miniature welded region. In this paper an automatic method is proposed to extract the various welding defects in radiographic weld images. In the first stage the input radiographic image is pre-processed to enhance the quality of the image. In the second stage the welding region is extracted by using c-means segmentation method. After segmentation different features of the welded region are calculated and the 3-D contour plots are plotted.","PeriodicalId":347883,"journal":{"name":"2014 International Conference on Communication and Network Technologies","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127358562","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}
Pub Date : 2014-12-01DOI: 10.1109/CNT.2014.7062738
G. Karthiga, C. Preethi, R. Devi
Accurate and low-cost sensor localization is a critical requirement for the deployment of wireless sensor networks in a wide variety of applications. Many applications require the sensor nodes to know their locations with a high degree of precision. Various localization methods based on mobile anchor nodes have been proposed for assisting the sensor nodes to determine their locations. However, none of these methods attempt to optimize the trajectory of the mobile anchor node. Accordingly, this project presents a path planning scheme, which ensures that the trajectory of the mobile anchor node minimizes the localization error and guarantees that all of the sensor nodes can determine their locations. The obstacle-resistant trajectory is also proposed to handle the obstacles in the sensing field. Later this path planning algorithm is adjusted so that it suits most of the effective localization algorithms. The performance of the proposed scheme is to be evaluated through a series of simulations with the ns-2 network simulator.
{"title":"Localization in wireless sensor network based on mobile anchor and chord selection","authors":"G. Karthiga, C. Preethi, R. Devi","doi":"10.1109/CNT.2014.7062738","DOIUrl":"https://doi.org/10.1109/CNT.2014.7062738","url":null,"abstract":"Accurate and low-cost sensor localization is a critical requirement for the deployment of wireless sensor networks in a wide variety of applications. Many applications require the sensor nodes to know their locations with a high degree of precision. Various localization methods based on mobile anchor nodes have been proposed for assisting the sensor nodes to determine their locations. However, none of these methods attempt to optimize the trajectory of the mobile anchor node. Accordingly, this project presents a path planning scheme, which ensures that the trajectory of the mobile anchor node minimizes the localization error and guarantees that all of the sensor nodes can determine their locations. The obstacle-resistant trajectory is also proposed to handle the obstacles in the sensing field. Later this path planning algorithm is adjusted so that it suits most of the effective localization algorithms. The performance of the proposed scheme is to be evaluated through a series of simulations with the ns-2 network simulator.","PeriodicalId":347883,"journal":{"name":"2014 International Conference on Communication and Network Technologies","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134417371","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}
Pub Date : 2014-12-01DOI: 10.1109/CNT.2014.7062719
M. Saraswathi, T. Bhuvaneswari
Today's businesses can attain applications on demand using cloud computing. Multi-tenancy is a significant feature of cloud computing in which a single application is shared among multiple tenants. Multi-tenancy offers variety of advantages including cost savings, resource utilization, version control and more. Currently more applications are moved from organization's internal infrastructure to data centers using shared infrastructure that provide Software as a Service (SaaS) to large number of organizations. This paper is devoted to discussing different options for implementing multitenancy such as An Efficient Schema Shared Approach for Cloud Based Multitenant Database with Authentication & Authorization Framework and A Non-Intrusive Multi-Tenant Database For Large Scale Applications. Finally analyze the two solution with various factors.
{"title":"Multitenant SaaS model of cloud computing: Issues and solutions","authors":"M. Saraswathi, T. Bhuvaneswari","doi":"10.1109/CNT.2014.7062719","DOIUrl":"https://doi.org/10.1109/CNT.2014.7062719","url":null,"abstract":"Today's businesses can attain applications on demand using cloud computing. Multi-tenancy is a significant feature of cloud computing in which a single application is shared among multiple tenants. Multi-tenancy offers variety of advantages including cost savings, resource utilization, version control and more. Currently more applications are moved from organization's internal infrastructure to data centers using shared infrastructure that provide Software as a Service (SaaS) to large number of organizations. This paper is devoted to discussing different options for implementing multitenancy such as An Efficient Schema Shared Approach for Cloud Based Multitenant Database with Authentication & Authorization Framework and A Non-Intrusive Multi-Tenant Database For Large Scale Applications. Finally analyze the two solution with various factors.","PeriodicalId":347883,"journal":{"name":"2014 International Conference on Communication and Network Technologies","volume":"280 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132907706","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}
Pub Date : 2014-12-01DOI: 10.1109/CNT.2014.7062714
R. Kaushik, M. Ganesh Madhan, K. Jagadeeshvelan
A Microstrip structure for IF signal filtering for Direct to Home (DTH) application is reported in this paper. The filter design hinges on cascaded cross coupled trisection open loop resonators. The filter is designed and simulated using ADS tool. The filter provides a bandwidth of 240 MHz, with a center frequency of 1.32 GHz. The novelty of this paper lies in its improved Fractional Bandwidth (FBW) and in the context of application of the filter, wherein a simple and compact design is adapted for DTH application. The response of the fabricated filter is found to agree with the simulation.
{"title":"Design and development of microstrip trisection filter for DTH applications","authors":"R. Kaushik, M. Ganesh Madhan, K. Jagadeeshvelan","doi":"10.1109/CNT.2014.7062714","DOIUrl":"https://doi.org/10.1109/CNT.2014.7062714","url":null,"abstract":"A Microstrip structure for IF signal filtering for Direct to Home (DTH) application is reported in this paper. The filter design hinges on cascaded cross coupled trisection open loop resonators. The filter is designed and simulated using ADS tool. The filter provides a bandwidth of 240 MHz, with a center frequency of 1.32 GHz. The novelty of this paper lies in its improved Fractional Bandwidth (FBW) and in the context of application of the filter, wherein a simple and compact design is adapted for DTH application. The response of the fabricated filter is found to agree with the simulation.","PeriodicalId":347883,"journal":{"name":"2014 International Conference on Communication and Network Technologies","volume":"5 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133042863","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}
Pub Date : 2014-12-01DOI: 10.1109/CNT.2014.7062745
P. Ramya, S. Mohanavalli, S. Sasirekha
Argo is a global array of 3,000 free-drifting profiling floats that will measure the temperature, pressure and salinity of the upper 2000 m of the ocean. This will allow continuous monitoring of the climate state of the ocean, with all data being relayed and made publicly available within hours after collection. Conceptually, Argo builds on the existing upper-ocean thermal networks, extending their spatial and temporal coverage, depth range and accuracy, and enhancing them through addition of salinity and velocity measurements. Also the float reads its latitude and longitude values. All these information in combination called as dataset and processed with some pre-processing and mining strategies. Pre-processing technique allows to extract the features that are required to define the ocean behaviour. Mining defines the similar patterns present in the dataset. Extracted pattern describes the behaviour of saline water by giving the tsunami alerts and PFZ's.
{"title":"Knowledge extracting system for non-expert miners","authors":"P. Ramya, S. Mohanavalli, S. Sasirekha","doi":"10.1109/CNT.2014.7062745","DOIUrl":"https://doi.org/10.1109/CNT.2014.7062745","url":null,"abstract":"Argo is a global array of 3,000 free-drifting profiling floats that will measure the temperature, pressure and salinity of the upper 2000 m of the ocean. This will allow continuous monitoring of the climate state of the ocean, with all data being relayed and made publicly available within hours after collection. Conceptually, Argo builds on the existing upper-ocean thermal networks, extending their spatial and temporal coverage, depth range and accuracy, and enhancing them through addition of salinity and velocity measurements. Also the float reads its latitude and longitude values. All these information in combination called as dataset and processed with some pre-processing and mining strategies. Pre-processing technique allows to extract the features that are required to define the ocean behaviour. Mining defines the similar patterns present in the dataset. Extracted pattern describes the behaviour of saline water by giving the tsunami alerts and PFZ's.","PeriodicalId":347883,"journal":{"name":"2014 International Conference on Communication and Network Technologies","volume":"15 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114035794","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}
Pub Date : 2014-12-01DOI: 10.1109/CNT.2014.7062733
S. Arivazhagan, W. Jebarani, C. Karthika
Reversible data hiding by reserving room becomes more prominent, since the original cover is restored without any loss after the hidden data is extracted. Encryption is performed to provide the confidentiality for the image content. In this project,space for embedding data is reserved with pairwise prediction error expansion(PEE) and histogram shift before encryption has been performed, so that data hider can reversibly embed data into encrypted image easily. Image redundancy isbetter exploited in prediction error expansion which leads to superior performance. But in current PEE based method, correlation within prediction error is not better exploited. Hence to better exploit the correlation among prediction errors, two prediction errors are jointly considered. Then the embedding is based on the prediction error pair and its 2D prediction-error histogram, which leads to improved performance. Secret data extraction and image restoration in this method is free of any errors. By this method, high PSNR is achieved than any other method in reversible data hiding.
{"title":"Reversible data hiding by reserving room","authors":"S. Arivazhagan, W. Jebarani, C. Karthika","doi":"10.1109/CNT.2014.7062733","DOIUrl":"https://doi.org/10.1109/CNT.2014.7062733","url":null,"abstract":"Reversible data hiding by reserving room becomes more prominent, since the original cover is restored without any loss after the hidden data is extracted. Encryption is performed to provide the confidentiality for the image content. In this project,space for embedding data is reserved with pairwise prediction error expansion(PEE) and histogram shift before encryption has been performed, so that data hider can reversibly embed data into encrypted image easily. Image redundancy isbetter exploited in prediction error expansion which leads to superior performance. But in current PEE based method, correlation within prediction error is not better exploited. Hence to better exploit the correlation among prediction errors, two prediction errors are jointly considered. Then the embedding is based on the prediction error pair and its 2D prediction-error histogram, which leads to improved performance. Secret data extraction and image restoration in this method is free of any errors. By this method, high PSNR is achieved than any other method in reversible data hiding.","PeriodicalId":347883,"journal":{"name":"2014 International Conference on Communication and Network Technologies","volume":"344 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124248889","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}
Pub Date : 2014-12-01DOI: 10.1109/CNT.2014.7062769
P. Ithaya Rani, K. Muneeswaran
The automatic human face detection from sequences of video plays vital role in intelligent human computer interaction systems for video surveillance, face recognition, emotion recognition and face database management. This paper proposes an automatic and robust method to detect human faces from the background that is capable of processing images rapidly while achieving high detection rates from video sequences. Highlight of the face detection system is to identify and locate all faces regardless of their position, scale, orientation, lighting conditions, expressions etc. The field of work is the incorporation of a normalization technique based on local histograms to alleviate a common problem in conventional face detection methods such as: inconsistent performance due to sensitivity to variation illuminations such as local shadowing, noise and occlusion. Next the Haar-like rectangle features can be computed very rapidly using the integral image that is most suitable for face/non face classification. In the final step, the face region is detected through a cascade of classifier consisting of detectors with Adaboost algorithm. Experimental result is showing promising results by conducting the experiments on video sequence as against the existing work on images.
{"title":"Robust real time face detection automatically from video sequence based on Haar features","authors":"P. Ithaya Rani, K. Muneeswaran","doi":"10.1109/CNT.2014.7062769","DOIUrl":"https://doi.org/10.1109/CNT.2014.7062769","url":null,"abstract":"The automatic human face detection from sequences of video plays vital role in intelligent human computer interaction systems for video surveillance, face recognition, emotion recognition and face database management. This paper proposes an automatic and robust method to detect human faces from the background that is capable of processing images rapidly while achieving high detection rates from video sequences. Highlight of the face detection system is to identify and locate all faces regardless of their position, scale, orientation, lighting conditions, expressions etc. The field of work is the incorporation of a normalization technique based on local histograms to alleviate a common problem in conventional face detection methods such as: inconsistent performance due to sensitivity to variation illuminations such as local shadowing, noise and occlusion. Next the Haar-like rectangle features can be computed very rapidly using the integral image that is most suitable for face/non face classification. In the final step, the face region is detected through a cascade of classifier consisting of detectors with Adaboost algorithm. Experimental result is showing promising results by conducting the experiments on video sequence as against the existing work on images.","PeriodicalId":347883,"journal":{"name":"2014 International Conference on Communication and Network Technologies","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127453174","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}
Pub Date : 2014-12-01DOI: 10.1109/CNT.2014.7062766
J. Senthil Kumar, C. Mahalakshmi
The Advanced Encryption Standard is the recent data security standard referred to as Federal Information Processing Standard 197 (FIPS 197) acquired worldwide by several private and public sectors for protective needs of data storage and secure data application from mobile consumer products to high end user. Most of the AES implementation for reconfigurable devices, however based on the configurable logic such as flip-flops and lookup tables. In this paper AES implementation focuas on embedded function inside of Xilinx devices such as large dual ported BRAM and DSP blocks with the goal of minimizing the use of register and lookup tables that those may be used for other functions. The paper presents a hardware implementation of AES algorithm on FPGA. The proposed model of AES algorithm was implemented in FPGA using Virtex 5 kit and Xilinx ISE development suite.
{"title":"Implementation of pipelined hardware architecture for AES algorithm using FPGA","authors":"J. Senthil Kumar, C. Mahalakshmi","doi":"10.1109/CNT.2014.7062766","DOIUrl":"https://doi.org/10.1109/CNT.2014.7062766","url":null,"abstract":"The Advanced Encryption Standard is the recent data security standard referred to as Federal Information Processing Standard 197 (FIPS 197) acquired worldwide by several private and public sectors for protective needs of data storage and secure data application from mobile consumer products to high end user. Most of the AES implementation for reconfigurable devices, however based on the configurable logic such as flip-flops and lookup tables. In this paper AES implementation focuas on embedded function inside of Xilinx devices such as large dual ported BRAM and DSP blocks with the goal of minimizing the use of register and lookup tables that those may be used for other functions. The paper presents a hardware implementation of AES algorithm on FPGA. The proposed model of AES algorithm was implemented in FPGA using Virtex 5 kit and Xilinx ISE development suite.","PeriodicalId":347883,"journal":{"name":"2014 International Conference on Communication and Network Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131316162","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}
Pub Date : 2014-12-01DOI: 10.1109/CNT.2014.7062741
L. S. Mutneja, A. P. Bhagat
The biggest issue in dealing with the remote cooperative group is efficient and secured broadcast. There is unavailability of a fully trusted key generator center. The Secure key distribution implementation GKMP (Group Key Management Protocol) is an efficient solution to all these issues. It creates keys for groups, distributes to the key members, ensures rule based access and allows hierarchical control of group actions. This paper gives an overview of different approaches for secured transmission in cooperative groups. This paper also presents the group key management protocol for secure transmission in cooperative groups.
{"title":"Secured transmission in cooperative groups using Group Key Management Protocol","authors":"L. S. Mutneja, A. P. Bhagat","doi":"10.1109/CNT.2014.7062741","DOIUrl":"https://doi.org/10.1109/CNT.2014.7062741","url":null,"abstract":"The biggest issue in dealing with the remote cooperative group is efficient and secured broadcast. There is unavailability of a fully trusted key generator center. The Secure key distribution implementation GKMP (Group Key Management Protocol) is an efficient solution to all these issues. It creates keys for groups, distributes to the key members, ensures rule based access and allows hierarchical control of group actions. This paper gives an overview of different approaches for secured transmission in cooperative groups. This paper also presents the group key management protocol for secure transmission in cooperative groups.","PeriodicalId":347883,"journal":{"name":"2014 International Conference on Communication and Network Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131470060","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
扫码关注我们
求助内容：
应助结果提醒方式：