The multiply and Accumulate unit consists of a multiplier unit for multiplication and the product of multiplier is added up with previous result by using an adder. The result of a MAC unit is stored in an Accumulator. MAC is one of the part of digital processing systems. By reducing the delay of multiplier and adder, the overall delay of MAC unit can be reduced. In this paper the MAC unit is designed using different multipliers and adders. The comparative study of different multipliers and adders has been shown. The multipliers used were Vedic multiplier (based on Urdhava Tiryagbhyam sutra) and Wallace tree multiplier. The adders used were Kogge stone adder and Carry look ahead adder. The efficiency of MAC is observed through reduced delay and lesser hardware complexity. The synthesis and simulation was done by Xilinx software and ISim simulator.
{"title":"Design and Performance Analysis of a High Speed MAC Using Different Multipliers","authors":"Priyanka Mavuri, B. Velan","doi":"10.1109/ICACC.2015.95","DOIUrl":"https://doi.org/10.1109/ICACC.2015.95","url":null,"abstract":"The multiply and Accumulate unit consists of a multiplier unit for multiplication and the product of multiplier is added up with previous result by using an adder. The result of a MAC unit is stored in an Accumulator. MAC is one of the part of digital processing systems. By reducing the delay of multiplier and adder, the overall delay of MAC unit can be reduced. In this paper the MAC unit is designed using different multipliers and adders. The comparative study of different multipliers and adders has been shown. The multipliers used were Vedic multiplier (based on Urdhava Tiryagbhyam sutra) and Wallace tree multiplier. The adders used were Kogge stone adder and Carry look ahead adder. The efficiency of MAC is observed through reduced delay and lesser hardware complexity. The synthesis and simulation was done by Xilinx software and ISim simulator.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"496 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133970774","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}
Sidelobes in the radiation pattern causes degradation of actual signal and hence antenna power efficiency. This paper discusses the problem of interference suppression by reducing the side lobe. Synthesis of linear antenna array using Continuous Genetic Algorithm is done to search for the optimum amplitude weights to minimize the maximum side lobe level. It has been demonstrated that side lobe level is reduced effectively by this technique. The simulated results shows an improved directivity, reduction in the first side lobe and fast convergence. This shows the effectiveness of this technique.
{"title":"Linear Antenna Array Synthesis to Reduce the Interference in the Side Lobe Using Continuous Genetic Algorithm","authors":"S. Banerjee, V. Dwivedi","doi":"10.1109/ICACC.2015.23","DOIUrl":"https://doi.org/10.1109/ICACC.2015.23","url":null,"abstract":"Sidelobes in the radiation pattern causes degradation of actual signal and hence antenna power efficiency. This paper discusses the problem of interference suppression by reducing the side lobe. Synthesis of linear antenna array using Continuous Genetic Algorithm is done to search for the optimum amplitude weights to minimize the maximum side lobe level. It has been demonstrated that side lobe level is reduced effectively by this technique. The simulated results shows an improved directivity, reduction in the first side lobe and fast convergence. This shows the effectiveness of this technique.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124322305","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}
The perceptual image hashing function maps an input image to a fixed size short binary string called the perceptual hash. The perceptual image hashing has been used for image authentication, image tamper detection and digital watermarking applications. In this paper, the perceptual hash value is generated using ring partition and Discrete Wavelet Transform (DWT). An rotation-invariant secondary image is constructed using ring-partition technique. Then, the DWT is applied on the secondary image using the various mother wavelets, to generate a final hash value. The perceptual hash was used to index and retrieve near-identical images from the database. The precision-recall curves are used to evaluate the performance of the application. The experiments shows that the proposed hashing algorithm is robust against content-preserving operations like image rotation, image scaling, Gaussian low-pass filtering, JPEG compression, brightness adjustment, and gamma correction.
{"title":"Ring Partition and DWT Based Perceptual Image Hashing with Application to Indexing and Retrieval of Near-Identical Images","authors":"Govindaraj P, Sandeep R","doi":"10.1109/ICACC.2015.90","DOIUrl":"https://doi.org/10.1109/ICACC.2015.90","url":null,"abstract":"The perceptual image hashing function maps an input image to a fixed size short binary string called the perceptual hash. The perceptual image hashing has been used for image authentication, image tamper detection and digital watermarking applications. In this paper, the perceptual hash value is generated using ring partition and Discrete Wavelet Transform (DWT). An rotation-invariant secondary image is constructed using ring-partition technique. Then, the DWT is applied on the secondary image using the various mother wavelets, to generate a final hash value. The perceptual hash was used to index and retrieve near-identical images from the database. The precision-recall curves are used to evaluate the performance of the application. The experiments shows that the proposed hashing algorithm is robust against content-preserving operations like image rotation, image scaling, Gaussian low-pass filtering, JPEG compression, brightness adjustment, and gamma correction.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125182686","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}
Akshay Jayakumar, Beenamol Mathew, N. Uma, Prema Nedungadi
India's medical education domain is one of the largest in the world. Medical Simulation aims to provide a medically accurate simulation that benefits the medical students to learn and understand any medical cases. Medical Simulations facilitates students with interactive learning and real-time feedback which does not risk the patient's life. Simulations can be performed any number of time until they have build their knowledge base and confidence in the given medical case. We propose a medically realistic cataract surgery simulation developed with a game engine. The users will be able to interact and use the on screen elements using hand gestures. A Motion recognition device captures every hand movement of the users and the simulation responds accordingly to provide feedback in real-time. Every movement is accurately tracked in the simulation and has a significant outcome on the subject based on the type of simulation. The simulated medical procedures for cataract surgery include using Surgical Tools, Surgical Procedures, Artificial Lens Implantation etc. Medical Simulation is being designed to provide an easy to use learning environment to replicate the clinical scenarios and allow features such as interactively practicing and providing feedbacks for medical skills development.
{"title":"Interactive Gesture Based Cataract Surgery Simulation","authors":"Akshay Jayakumar, Beenamol Mathew, N. Uma, Prema Nedungadi","doi":"10.1109/ICACC.2015.20","DOIUrl":"https://doi.org/10.1109/ICACC.2015.20","url":null,"abstract":"India's medical education domain is one of the largest in the world. Medical Simulation aims to provide a medically accurate simulation that benefits the medical students to learn and understand any medical cases. Medical Simulations facilitates students with interactive learning and real-time feedback which does not risk the patient's life. Simulations can be performed any number of time until they have build their knowledge base and confidence in the given medical case. We propose a medically realistic cataract surgery simulation developed with a game engine. The users will be able to interact and use the on screen elements using hand gestures. A Motion recognition device captures every hand movement of the users and the simulation responds accordingly to provide feedback in real-time. Every movement is accurately tracked in the simulation and has a significant outcome on the subject based on the type of simulation. The simulated medical procedures for cataract surgery include using Surgical Tools, Surgical Procedures, Artificial Lens Implantation etc. Medical Simulation is being designed to provide an easy to use learning environment to replicate the clinical scenarios and allow features such as interactively practicing and providing feedbacks for medical skills development.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116789223","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}
The MRI imaging is an efficient tool for disease diagnosis, and the features of the taken image has much importance. The reconstruction of such images needs much attention. The main limitation of MRI imaging is its long scan time. The time taken for acquisition can be reduced by non Cartesian acquisition. Spiral MRI is a non Cartesian MRI imaging and is less affected by motion and flow artifacts. Still, reconstruction of images from non-Cartesian MRI data will suffer from reconstruction errors and in-homogeneity artifacts. This will adversely affect the disease diagnosis. Algorithms like conjugate phase method, Field map calculating Methods, iterative Next Neighbor re-gridding algorithms etc were proposed for solving such issues. Among these, iterative Next Neighbor re-gridding algorithm proved efficient. The main focus of this paper is on efficient reconstruction of spiral MRI image with an improved Iterative next neighbor algorithm which will result in comparatively better picture quality.
{"title":"Modified Iterative Reconstruction Algorithm for Spiral MRI","authors":"Anju George, Ajay Kumar","doi":"10.1109/ICACC.2015.83","DOIUrl":"https://doi.org/10.1109/ICACC.2015.83","url":null,"abstract":"The MRI imaging is an efficient tool for disease diagnosis, and the features of the taken image has much importance. The reconstruction of such images needs much attention. The main limitation of MRI imaging is its long scan time. The time taken for acquisition can be reduced by non Cartesian acquisition. Spiral MRI is a non Cartesian MRI imaging and is less affected by motion and flow artifacts. Still, reconstruction of images from non-Cartesian MRI data will suffer from reconstruction errors and in-homogeneity artifacts. This will adversely affect the disease diagnosis. Algorithms like conjugate phase method, Field map calculating Methods, iterative Next Neighbor re-gridding algorithms etc were proposed for solving such issues. Among these, iterative Next Neighbor re-gridding algorithm proved efficient. The main focus of this paper is on efficient reconstruction of spiral MRI image with an improved Iterative next neighbor algorithm which will result in comparatively better picture quality.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116226022","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}
The paper presents an ultra wide band filter using asymmetrical interdigital coupled line with a transmission notch at the WLAN band. The lower side transmission zero can be conveniently tuned by stepped impedance resonators of proper dimensions. The frequency notch for WLAN band is introduced by two half wavelength open ring resonators etched on the ground plane. The attenuation in lower and upper stopbands is controlled by the use of series capacitors and Defected Ground Structures respectively. The insertion loss in the passband is improved by circular apertures in the ground plane. Measured frequency response of the fabricated filter shows good agreement with simulated results.
{"title":"Compact Band Notched UWB Filter for Wireless Communication Applications","authors":"C. J. Bindu, B. Paul, S. Mridula, P. Mohanan","doi":"10.1109/ICACC.2015.91","DOIUrl":"https://doi.org/10.1109/ICACC.2015.91","url":null,"abstract":"The paper presents an ultra wide band filter using asymmetrical interdigital coupled line with a transmission notch at the WLAN band. The lower side transmission zero can be conveniently tuned by stepped impedance resonators of proper dimensions. The frequency notch for WLAN band is introduced by two half wavelength open ring resonators etched on the ground plane. The attenuation in lower and upper stopbands is controlled by the use of series capacitors and Defected Ground Structures respectively. The insertion loss in the passband is improved by circular apertures in the ground plane. Measured frequency response of the fabricated filter shows good agreement with simulated results.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115165013","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}
M. S. Nishamol, V. Sarin, S. M. Nair, M. P. Jayakrishnan, P. Mohanan, K. Vasudevan
A simple radiating structure for achieving omni-directional radiation pattern from a monopole antenna fed by a CPW feed is presented. The proposed antenna has a 2:1 VSWR bandwidth of 76% from 2.7GHz to 5.7GHz. Hence it is suitable for WLAN 5.2(5.15-5.35GHz) band, WiMAX 2.5/3.5(2.5-2.69GHz, 3.4-3.69GHz) bands, HiperLAN2 (5.47-5.725 GHz) and HiSWaNa (5.15-5.25GHz) wireless application bands. The simulated and measured reflection characteristics of the antenna along with the radiation patterns and gain are presented and discussed.
{"title":"CPW Fed Wideband Printed Antenna for Wireless Communications","authors":"M. S. Nishamol, V. Sarin, S. M. Nair, M. P. Jayakrishnan, P. Mohanan, K. Vasudevan","doi":"10.1109/ICACC.2015.9","DOIUrl":"https://doi.org/10.1109/ICACC.2015.9","url":null,"abstract":"A simple radiating structure for achieving omni-directional radiation pattern from a monopole antenna fed by a CPW feed is presented. The proposed antenna has a 2:1 VSWR bandwidth of 76% from 2.7GHz to 5.7GHz. Hence it is suitable for WLAN 5.2(5.15-5.35GHz) band, WiMAX 2.5/3.5(2.5-2.69GHz, 3.4-3.69GHz) bands, HiperLAN2 (5.47-5.725 GHz) and HiSWaNa (5.15-5.25GHz) wireless application bands. The simulated and measured reflection characteristics of the antenna along with the radiation patterns and gain are presented and discussed.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124764152","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}
Steganography is one of the newly emerging area of development in the field of signal processing. It is the technique of hiding the fact that communication is even taking place, by hiding information in any other information. In this paper, a secure data-hiding method is proposed for hiding multiple datatypes such as text, image and audio within images by Secure Adaptive Pixel Pair Matching(SAPPM) which can be effectively used for colour images as well as gray scale images. The secret message is encrypted using a pseudo random sequence, which is generated according to the secret key given by the user. The encrypted secret message is hidden in cover image using SAPPM algorithm. Compared with previous methods like Least Significant Bit(LSB) substituition, simple Diamond Encoding(DE) and APPM, the proposed method provides a much more stronger algorithm which incorporates cryptography along with steganography, and always have a lower distortion.
{"title":"Steganographic Technique Using Secure Adaptive Pixel Pair Matching for Embedding Multiple Data Types in Images","authors":"T. Edwina Alias, Dominic Mathew, Abraham Thomas","doi":"10.1109/ICACC.2015.60","DOIUrl":"https://doi.org/10.1109/ICACC.2015.60","url":null,"abstract":"Steganography is one of the newly emerging area of development in the field of signal processing. It is the technique of hiding the fact that communication is even taking place, by hiding information in any other information. In this paper, a secure data-hiding method is proposed for hiding multiple datatypes such as text, image and audio within images by Secure Adaptive Pixel Pair Matching(SAPPM) which can be effectively used for colour images as well as gray scale images. The secret message is encrypted using a pseudo random sequence, which is generated according to the secret key given by the user. The encrypted secret message is hidden in cover image using SAPPM algorithm. Compared with previous methods like Least Significant Bit(LSB) substituition, simple Diamond Encoding(DE) and APPM, the proposed method provides a much more stronger algorithm which incorporates cryptography along with steganography, and always have a lower distortion.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131380549","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}
License plate can be used for identifying vehicle since it is unique for each vehicle. In this paper proposes a fast technique for identifying the vehicle licenseplate. Here first the input image is binarized by adaptive thresholding and then image is enhanced by unwanted-line elimination algorithm (ULEA). Then on applying VEDA vertical edges of the image is detected. Then number of possible candidate license plate region is extracted out of which original LP is detected.
{"title":"A Novel Approach for Car License Plate Detection Based on Vertical Edges","authors":"Ashwathy Dev","doi":"10.1109/ICACC.2015.62","DOIUrl":"https://doi.org/10.1109/ICACC.2015.62","url":null,"abstract":"License plate can be used for identifying vehicle since it is unique for each vehicle. In this paper proposes a fast technique for identifying the vehicle licenseplate. Here first the input image is binarized by adaptive thresholding and then image is enhanced by unwanted-line elimination algorithm (ULEA). Then on applying VEDA vertical edges of the image is detected. Then number of possible candidate license plate region is extracted out of which original LP is detected.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130233030","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}
Akansha Pandey, A. C. Irfan, K. Kumar, S. Venkatesan
The immense growth of Social Networking Sites (SNSs) has provided fast interactions with strangers, friends and people known in person. This has increase the religious, political and social possibilities for maintaining virtually every type of significant bonds or groups. The personal information used while interacting on social networking sites is an asset for every user profile that may be traded intentionally by a third party for its benefits. Privacy of users is completely based on their awareness of how much of their personal information could be shared without risk. Moreover, users do not give much importance to the privacy risk arising by their information sharing activities. With the rise in different online crimes and malicious behaviors, it is necessary to evaluate the reliability of a profile user. The objective of this paper is to present a method for computing the trust value and privacy risk of users in online social networking sites by integrating basic trust parameters like personal information, recommendations, followings, and customized privacy settings. This will help other users in social network to check whether a person is trustworthy, before accepting him/her in their network. We used real-world data collected from Facebook for calculating and demonstrating the proposed trust model.
{"title":"Computing Privacy Risk and Trustworthiness of Users in SNSs","authors":"Akansha Pandey, A. C. Irfan, K. Kumar, S. Venkatesan","doi":"10.1109/ICACC.2015.50","DOIUrl":"https://doi.org/10.1109/ICACC.2015.50","url":null,"abstract":"The immense growth of Social Networking Sites (SNSs) has provided fast interactions with strangers, friends and people known in person. This has increase the religious, political and social possibilities for maintaining virtually every type of significant bonds or groups. The personal information used while interacting on social networking sites is an asset for every user profile that may be traded intentionally by a third party for its benefits. Privacy of users is completely based on their awareness of how much of their personal information could be shared without risk. Moreover, users do not give much importance to the privacy risk arising by their information sharing activities. With the rise in different online crimes and malicious behaviors, it is necessary to evaluate the reliability of a profile user. The objective of this paper is to present a method for computing the trust value and privacy risk of users in online social networking sites by integrating basic trust parameters like personal information, recommendations, followings, and customized privacy settings. This will help other users in social network to check whether a person is trustworthy, before accepting him/her in their network. We used real-world data collected from Facebook for calculating and demonstrating the proposed trust model.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"60 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130371976","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
扫码关注我们
求助内容：
应助结果提醒方式：