Pub Date : 2016-02-01DOI: 10.1109/STARTUP.2016.7583992
P. Saranya, V. Saravanan, M. Divya
The Silver code has been proposed as a 2 × 2 space time block code that accomplish the optimal diversity - multiplexing gain tradeoff for a multiple antenna system in Cognitive Radio Network. In this paper the decoding methodology for the Silver code is analyzed, followed by performance analyzing with the Alamouti code and V-BLAST in Rayleigh fading environments. Simulation results show that the Silver Code outrun both the Alamouti code and V-BLAST at high SNR levels.
{"title":"Bit error rate analysis of cognitive radio under fading channels","authors":"P. Saranya, V. Saravanan, M. Divya","doi":"10.1109/STARTUP.2016.7583992","DOIUrl":"https://doi.org/10.1109/STARTUP.2016.7583992","url":null,"abstract":"The Silver code has been proposed as a 2 × 2 space time block code that accomplish the optimal diversity - multiplexing gain tradeoff for a multiple antenna system in Cognitive Radio Network. In this paper the decoding methodology for the Silver code is analyzed, followed by performance analyzing with the Alamouti code and V-BLAST in Rayleigh fading environments. Simulation results show that the Silver Code outrun both the Alamouti code and V-BLAST at high SNR levels.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123382827","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 : 2016-02-01DOI: 10.1109/STARTUP.2016.7583926
V. Vijayalakshmi, R. Vasitha, V. Vanitha, M. Gayathri
The field of Real Time Authentication on videos follows rapid improvements in recent years because of the common counterfeits and illegal sharing of Digital media. Real Time Authentication for videos is becoming popular to secure the personal videos. People today have become well aware of the intrusions of their personal videos and are very reluctant to share on internet. This paper provides a wide survey of different Real Time Authentication algorithms and techniques and plug out their merits and demerits.
{"title":"A survey on real time authentication and tampering detection in digital video","authors":"V. Vijayalakshmi, R. Vasitha, V. Vanitha, M. Gayathri","doi":"10.1109/STARTUP.2016.7583926","DOIUrl":"https://doi.org/10.1109/STARTUP.2016.7583926","url":null,"abstract":"The field of Real Time Authentication on videos follows rapid improvements in recent years because of the common counterfeits and illegal sharing of Digital media. Real Time Authentication for videos is becoming popular to secure the personal videos. People today have become well aware of the intrusions of their personal videos and are very reluctant to share on internet. This paper provides a wide survey of different Real Time Authentication algorithms and techniques and plug out their merits and demerits.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121443671","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 : 2016-02-01DOI: 10.1109/STARTUP.2016.7583911
Rohini K. Akotkar, S. Kasturiwala
Video is a collection chronological frame in a sequence. Video compression means reducing the size of video. To discard the redundancies present in video some video compression technique are involved. In video sequence there are two types of technique are present that are temporal redundancy and spatial redundancy. In this paper, we discuss about hybrid technique. Hybrid means combination of two technique i.e. efficient three step search algorithm (E3SS) and cross hexagonal search algorithm (CHS). There for E3SS used for core search and CHS is used for fine search so it occupies less disk space and file transferring is faster. In today's date block matching algorithm for motion estimation is powerful technique for high compression ratio and to reduce computational complexity. motion estimation calculate the position of pixel and it is a custom to calculate the pixel from current frame to reference frame. The main approach of motion estimation is reducing the search point and redundancy present in video. The experiment result shows that the proposal algorithm performs better than previous proposed block matching algorithms and required less computation.
{"title":"Hybrid approach for video compression using block matching motion estimation","authors":"Rohini K. Akotkar, S. Kasturiwala","doi":"10.1109/STARTUP.2016.7583911","DOIUrl":"https://doi.org/10.1109/STARTUP.2016.7583911","url":null,"abstract":"Video is a collection chronological frame in a sequence. Video compression means reducing the size of video. To discard the redundancies present in video some video compression technique are involved. In video sequence there are two types of technique are present that are temporal redundancy and spatial redundancy. In this paper, we discuss about hybrid technique. Hybrid means combination of two technique i.e. efficient three step search algorithm (E3SS) and cross hexagonal search algorithm (CHS). There for E3SS used for core search and CHS is used for fine search so it occupies less disk space and file transferring is faster. In today's date block matching algorithm for motion estimation is powerful technique for high compression ratio and to reduce computational complexity. motion estimation calculate the position of pixel and it is a custom to calculate the pixel from current frame to reference frame. The main approach of motion estimation is reducing the search point and redundancy present in video. The experiment result shows that the proposal algorithm performs better than previous proposed block matching algorithms and required less computation.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115901198","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 : 2016-02-01DOI: 10.1109/STARTUP.2016.7583987
V. Manogajapathi, Jayakumar Loganathan, R. Sekhar
In recent trends, android smartphones are rapidly in use by a number of users because of its user friendly and open source architecture. There are millions of android applications are available in the open market place. But we cannot trust most of the apps, which may steal the user privacy content or any confidential data. However, some works have studied mobile phones, multimedia securities and also android permissions. In this paper, to focus on the security issues related to camera based attacks on smartphones. The fraudulent application and its traitor can be detected by using the defense system that detects the attacks. By use of the defense system the users can be saved before getting into the vulnerability. To evaluate the defense system we have proposed a camera based fraudulent application for feasibility study and also we analyzed the performance of the system with the fraudulent applications from the open android market.
{"title":"Detecting camera based traitor and fraudulent apps on smartphone","authors":"V. Manogajapathi, Jayakumar Loganathan, R. Sekhar","doi":"10.1109/STARTUP.2016.7583987","DOIUrl":"https://doi.org/10.1109/STARTUP.2016.7583987","url":null,"abstract":"In recent trends, android smartphones are rapidly in use by a number of users because of its user friendly and open source architecture. There are millions of android applications are available in the open market place. But we cannot trust most of the apps, which may steal the user privacy content or any confidential data. However, some works have studied mobile phones, multimedia securities and also android permissions. In this paper, to focus on the security issues related to camera based attacks on smartphones. The fraudulent application and its traitor can be detected by using the defense system that detects the attacks. By use of the defense system the users can be saved before getting into the vulnerability. To evaluate the defense system we have proposed a camera based fraudulent application for feasibility study and also we analyzed the performance of the system with the fraudulent applications from the open android market.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130063448","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 : 2016-02-01DOI: 10.1109/STARTUP.2016.7583902
Prajakta D. Chutke, M. K. Hadap
This paper is motivated by the recognition of the need for a finer grain and more personalized privacy in data publication of social networks. We will propose a privacy protection scheme that not only prevents the disclosure of identity of users but also the disclosure of Selected features in users' profiles. An individual user can select which features of her profile she wishes to conceal. We want to group nodes with as similar neighborhood information as possible so that we can change as few labels as possible and add as few noisy nodes as possible. In this application, we will use hybrid cryptography for providing security while sharing the information. The encryption helps for cryptographic purpose and it also provides attribute base encryption this involves over many people that decrypts the cipher text. It involves the different users and allow to decrypt it based on their policies.
{"title":"Enhancing security of encrypted data sharing on social networks","authors":"Prajakta D. Chutke, M. K. Hadap","doi":"10.1109/STARTUP.2016.7583902","DOIUrl":"https://doi.org/10.1109/STARTUP.2016.7583902","url":null,"abstract":"This paper is motivated by the recognition of the need for a finer grain and more personalized privacy in data publication of social networks. We will propose a privacy protection scheme that not only prevents the disclosure of identity of users but also the disclosure of Selected features in users' profiles. An individual user can select which features of her profile she wishes to conceal. We want to group nodes with as similar neighborhood information as possible so that we can change as few labels as possible and add as few noisy nodes as possible. In this application, we will use hybrid cryptography for providing security while sharing the information. The encryption helps for cryptographic purpose and it also provides attribute base encryption this involves over many people that decrypts the cipher text. It involves the different users and allow to decrypt it based on their policies.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115076224","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 : 2016-02-01DOI: 10.1109/STARTUP.2016.7583933
M. Kalmegh, S. R. Jain
The WSN networks employing duty cycle technique in geographic routing has a task to find out the path from sensor to Base Station of the network to send the sensed data will be accomplished by several existing mechanism given over the last few decades. Discovering the optimized route in WSN depends upon the number of hops used to transfer the data packets. However, the nodes selected in the path may be overloaded due to heavy traffic. This can increase the delay in transmitting sensed data to the Base Station which will contribute in the overall delay of the network. Rediscovering routes can result in data loss and increasing communication overheads. In this paper, we present the comparison of different approaches in multi-path routing in terms of energy consumption and broadcasting delay in WSNs. We present and compare algorithms and techniques that aim to address the sleep/wake scheduling issue, which are divided into distributed and centralized manners. Meanwhile, the routing strategies, QoS parameters like average delay, packet loss ratio, and throughput are discussed.
{"title":"Optimal route discovery in duty cycled wireless sensor network: A review","authors":"M. Kalmegh, S. R. Jain","doi":"10.1109/STARTUP.2016.7583933","DOIUrl":"https://doi.org/10.1109/STARTUP.2016.7583933","url":null,"abstract":"The WSN networks employing duty cycle technique in geographic routing has a task to find out the path from sensor to Base Station of the network to send the sensed data will be accomplished by several existing mechanism given over the last few decades. Discovering the optimized route in WSN depends upon the number of hops used to transfer the data packets. However, the nodes selected in the path may be overloaded due to heavy traffic. This can increase the delay in transmitting sensed data to the Base Station which will contribute in the overall delay of the network. Rediscovering routes can result in data loss and increasing communication overheads. In this paper, we present the comparison of different approaches in multi-path routing in terms of energy consumption and broadcasting delay in WSNs. We present and compare algorithms and techniques that aim to address the sleep/wake scheduling issue, which are divided into distributed and centralized manners. Meanwhile, the routing strategies, QoS parameters like average delay, packet loss ratio, and throughput are discussed.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116888885","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 : 2016-02-01DOI: 10.1109/STARTUP.2016.7583932
Vikky Mohane, C. Gode
For blind persons it is very essential to recognize a product of their daily use so we implied a method to identify product in their everyday routine by use of camera. To separate a object from un-necessary background, movement based technique is used to spot object of concern from the video by instructing person to shake the object that gives moving object area by K-means clustering background separation technique. After detection of moving area feature extraction SIFT technique is used to take out key points of that product and that key-point is matched with the data base images if it matches efficiently then it identify a product and produce name of that product to blind persons in speech. Instead of OCR we used SIFT because in OCR orientation of camera must be towards label of product and for blind person it is very tough to locate label efficiently whereas in SIFT product orientation is not a big deal as key-points can be matched from any position.
{"title":"Object recognition for blind people using portable camera","authors":"Vikky Mohane, C. Gode","doi":"10.1109/STARTUP.2016.7583932","DOIUrl":"https://doi.org/10.1109/STARTUP.2016.7583932","url":null,"abstract":"For blind persons it is very essential to recognize a product of their daily use so we implied a method to identify product in their everyday routine by use of camera. To separate a object from un-necessary background, movement based technique is used to spot object of concern from the video by instructing person to shake the object that gives moving object area by K-means clustering background separation technique. After detection of moving area feature extraction SIFT technique is used to take out key points of that product and that key-point is matched with the data base images if it matches efficiently then it identify a product and produce name of that product to blind persons in speech. Instead of OCR we used SIFT because in OCR orientation of camera must be towards label of product and for blind person it is very tough to locate label efficiently whereas in SIFT product orientation is not a big deal as key-points can be matched from any position.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121514510","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 : 2016-02-01DOI: 10.1109/STARTUP.2016.7583925
Pranita P. Hadke, S. Kale
In cryptography secret information is made unreadable for an unauthorized user. There are many cryptographic algorithms are available, but they are more complex techniques and requires more computational power. This paper gives a review of how Neural Networks contributes a help in cryptography and how neural network and cryptography together can be used for security.
{"title":"Use of Neural Networks in cryptography: A review","authors":"Pranita P. Hadke, S. Kale","doi":"10.1109/STARTUP.2016.7583925","DOIUrl":"https://doi.org/10.1109/STARTUP.2016.7583925","url":null,"abstract":"In cryptography secret information is made unreadable for an unauthorized user. There are many cryptographic algorithms are available, but they are more complex techniques and requires more computational power. This paper gives a review of how Neural Networks contributes a help in cryptography and how neural network and cryptography together can be used for security.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130304532","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 : 2016-02-01DOI: 10.1109/STARTUP.2016.7583955
K. S. Chaturbhuj, Gauri Chaudhary
Traditional data processing techniques are not enough to handle rapidly growing data. Hadoop can be used for processing such large data. K-means is the traditional clustering method which is simple, scalable and can easily implement but K-means converges to local minima from starting position and sensitive to initial centers. K-means required number of clusters in advance. Particle Swarm Optimization i.e PSO is mimic behavior based algorithm used to introduce the connectivity principle in the centroid based clustering algorithm that will gives optimum centroid and hence find better clusters. We used PSO for finding initial centroids and K-means to find better clusters. Hadoop is used for fast and parallel processing of large datasets.
{"title":"Parallel clustering of large data set on Hadoop using data mining techniques","authors":"K. S. Chaturbhuj, Gauri Chaudhary","doi":"10.1109/STARTUP.2016.7583955","DOIUrl":"https://doi.org/10.1109/STARTUP.2016.7583955","url":null,"abstract":"Traditional data processing techniques are not enough to handle rapidly growing data. Hadoop can be used for processing such large data. K-means is the traditional clustering method which is simple, scalable and can easily implement but K-means converges to local minima from starting position and sensitive to initial centers. K-means required number of clusters in advance. Particle Swarm Optimization i.e PSO is mimic behavior based algorithm used to introduce the connectivity principle in the centroid based clustering algorithm that will gives optimum centroid and hence find better clusters. We used PSO for finding initial centroids and K-means to find better clusters. Hadoop is used for fast and parallel processing of large datasets.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117314948","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 : 2016-02-01DOI: 10.1109/STARTUP.2016.7583922
D. S. Bhutada
This paper presents To design a low voltage flip-flops based on CPAL circuit. The Complementary Pass-Transistor Adiabatic Logic is used to release flip-flops circuits with DTCMOS (Dual Threshold CMOS) techniques. All circuits are simulated using 180nm Tanner model technology by varying supply voltages. Based on the simulation results, the flip-flop working along with the power-gating technique is realized by CPAL which work on low voltage medium which help to increase speed of the execution. We use Ac power supply which work as low power characteristics of complementary pass-transistor logic (CPL) circuit. Power-clock scheme is more suitable for the design of flip-flops using two phase sequential circuits because it helps to decrease more transistors. The Adiabatic flip-flop has large energy saving over wide range of frequencies.
{"title":"Design of low voltage flip-flop based on complementary pass-transistor adiabatic logic circuit","authors":"D. S. Bhutada","doi":"10.1109/STARTUP.2016.7583922","DOIUrl":"https://doi.org/10.1109/STARTUP.2016.7583922","url":null,"abstract":"This paper presents To design a low voltage flip-flops based on CPAL circuit. The Complementary Pass-Transistor Adiabatic Logic is used to release flip-flops circuits with DTCMOS (Dual Threshold CMOS) techniques. All circuits are simulated using 180nm Tanner model technology by varying supply voltages. Based on the simulation results, the flip-flop working along with the power-gating technique is realized by CPAL which work on low voltage medium which help to increase speed of the execution. We use Ac power supply which work as low power characteristics of complementary pass-transistor logic (CPL) circuit. Power-clock scheme is more suitable for the design of flip-flops using two phase sequential circuits because it helps to decrease more transistors. The Adiabatic flip-flop has large energy saving over wide range of frequencies.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115929444","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
扫码关注我们
求助内容：
应助结果提醒方式：