Pub Date : 2016-05-20DOI: 10.1109/RTEICT.2016.7808093
K. A. Sharada, Siddaraju
A Wireless Sensor Network (WSN) is a field of interest for researchers due to its monitoring capability and giving the information which helps in predicting the future scenarios like in health care system, monitoring or tracking etc. Sensor nodes are very small and powerful devices which are continuously sense the data and send it to the base station (Sink) which generates the results based on the details received from sensor nodes. Sensor nodes are battery constrained, they use a lot of energy for transmitting the data and die very quickly. To save the energy of sensor node and make WSN more reliable here authors proposed a clustering mechanism. In clustering mechanism large network divided into small clusters. Each cluster has its own cluster head, cluster members communicate with cluster head and cluster head collects all the data from cluster members and send it to the base station. For cluster formation a noble concept is given called adaptive swarm optimization, here authors worked on best previous position and best global position of nodes. Nodes can changes their position as per their best global position from the previous position and based on this lifetime of overall network can be increased. Nodes death rate is decreased as compared with the existing method.
{"title":"A swarm intelligence technique to enhance network lifetime in WSN","authors":"K. A. Sharada, Siddaraju","doi":"10.1109/RTEICT.2016.7808093","DOIUrl":"https://doi.org/10.1109/RTEICT.2016.7808093","url":null,"abstract":"A Wireless Sensor Network (WSN) is a field of interest for researchers due to its monitoring capability and giving the information which helps in predicting the future scenarios like in health care system, monitoring or tracking etc. Sensor nodes are very small and powerful devices which are continuously sense the data and send it to the base station (Sink) which generates the results based on the details received from sensor nodes. Sensor nodes are battery constrained, they use a lot of energy for transmitting the data and die very quickly. To save the energy of sensor node and make WSN more reliable here authors proposed a clustering mechanism. In clustering mechanism large network divided into small clusters. Each cluster has its own cluster head, cluster members communicate with cluster head and cluster head collects all the data from cluster members and send it to the base station. For cluster formation a noble concept is given called adaptive swarm optimization, here authors worked on best previous position and best global position of nodes. Nodes can changes their position as per their best global position from the previous position and based on this lifetime of overall network can be increased. Nodes death rate is decreased as compared with the existing method.","PeriodicalId":6527,"journal":{"name":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","volume":"135 1","pages":"1554-1557"},"PeriodicalIF":0.0,"publicationDate":"2016-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79584130","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-05-20DOI: 10.1109/RTEICT.2016.7807968
S. Murali, J. Kumar, Jayanth Kumar, R. Bhakthavatchalu
The elementary processing units in brain are neurons which are connected to each other in many shapes and sizes. A typical neuron can be divided into functionally three distinct parts called Dendrites, Soma and Axon. Dendrites play the role of input device that collect signals from other neurons and transmits them to soma. Soma performs a Non-linear operation, i.e. if input exceeds a certain threshold, an output signal is generated. This output signal is taken over by an output device, the Axon, which delivers the signal to other neurons. This is the basic function of a biological neuron. A biological neuron model which is also known as Spiking Neuron Model is a mathematical description of properties of neuron that is to be designed accurately to describe and predict the biological processes. So there comes the concept of modelling and analysis of neurons. Modelling and analysis of neurons was performed by different researchers on First, Second and Third generation of neurons. The Third generation of neurons are also called as spiking neurons. The focus of this work is to present different types of spiking neurons developed by Izhikevich which mathematically supports the properties and resembles the biological neuron. These mathematical model simulations are done in MATLAB. These spiking neurons are modelled using digital logic circuits in Verilog Hardware Description Language (HDL) and simulated in ModelSIM RTL simulator. The design is then implemented in Xilinx FPGA and checked for the functionality.
{"title":"Design and implementation of Izhikevich spiking neuron model on FPGA","authors":"S. Murali, J. Kumar, Jayanth Kumar, R. Bhakthavatchalu","doi":"10.1109/RTEICT.2016.7807968","DOIUrl":"https://doi.org/10.1109/RTEICT.2016.7807968","url":null,"abstract":"The elementary processing units in brain are neurons which are connected to each other in many shapes and sizes. A typical neuron can be divided into functionally three distinct parts called Dendrites, Soma and Axon. Dendrites play the role of input device that collect signals from other neurons and transmits them to soma. Soma performs a Non-linear operation, i.e. if input exceeds a certain threshold, an output signal is generated. This output signal is taken over by an output device, the Axon, which delivers the signal to other neurons. This is the basic function of a biological neuron. A biological neuron model which is also known as Spiking Neuron Model is a mathematical description of properties of neuron that is to be designed accurately to describe and predict the biological processes. So there comes the concept of modelling and analysis of neurons. Modelling and analysis of neurons was performed by different researchers on First, Second and Third generation of neurons. The Third generation of neurons are also called as spiking neurons. The focus of this work is to present different types of spiking neurons developed by Izhikevich which mathematically supports the properties and resembles the biological neuron. These mathematical model simulations are done in MATLAB. These spiking neurons are modelled using digital logic circuits in Verilog Hardware Description Language (HDL) and simulated in ModelSIM RTL simulator. The design is then implemented in Xilinx FPGA and checked for the functionality.","PeriodicalId":6527,"journal":{"name":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","volume":"1 1","pages":"946-951"},"PeriodicalIF":0.0,"publicationDate":"2016-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78212240","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-05-20DOI: 10.1109/RTEICT.2016.7807955
Utpal Das, Silpa Das, Satyam Kumar, Y. Kumar, Seema Singh, D. Nayak
Orthogonal Frequency-Division Multiple Access (OFDMA) and Single Carrier Frequency-Division Multiple Access (SC-FDMA) schemes are major part of Long Term Evolution (LTE). OFDM is more widely used technique due to its robustness against frequency selective fading channels. However, it suffers from a high Peak-to-Average Power Ratio (PAPR). In this paper, Discrete Fourier Transform (DFT) spreading technique has been proposed to improve the performance of OFDMA system by reduction of PAPR. OFDMA and SC-FDMA system has been investigated using different modulation schemes on the basis of PAPR and Bit Error Rate (BER). The results of proposed system show satisfactory improvement in system performance over OFDMA.
{"title":"Performance enhancement of OFDM system by reducing PAPR using DFT spreading technique","authors":"Utpal Das, Silpa Das, Satyam Kumar, Y. Kumar, Seema Singh, D. Nayak","doi":"10.1109/RTEICT.2016.7807955","DOIUrl":"https://doi.org/10.1109/RTEICT.2016.7807955","url":null,"abstract":"Orthogonal Frequency-Division Multiple Access (OFDMA) and Single Carrier Frequency-Division Multiple Access (SC-FDMA) schemes are major part of Long Term Evolution (LTE). OFDM is more widely used technique due to its robustness against frequency selective fading channels. However, it suffers from a high Peak-to-Average Power Ratio (PAPR). In this paper, Discrete Fourier Transform (DFT) spreading technique has been proposed to improve the performance of OFDMA system by reduction of PAPR. OFDMA and SC-FDMA system has been investigated using different modulation schemes on the basis of PAPR and Bit Error Rate (BER). The results of proposed system show satisfactory improvement in system performance over OFDMA.","PeriodicalId":6527,"journal":{"name":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","volume":"222 1","pages":"886-887"},"PeriodicalIF":0.0,"publicationDate":"2016-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75633998","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-05-20DOI: 10.1109/RTEICT.2016.7808129
M. R. Dar, N. A. Kant, F. A. Khanday, C. Psychalinos
The paper presents a novel scheme to implement fractional-order filters for ultra-low frequency applications. The scheme is based on the intrinsic property of the fractional-order filters that the pole frequency can be scaled down to sub-hertz by employing the order if the normal pole frequency of the filter is designed slightly less than one. This is in contrast to the scaling techniques employed in low-frequency integer-order filters where the impedance is scaled to decrease the overall capacitance required for low-frequency design. The functioning of the scheme has been demonstrated by an OTA-based low-pass filter example implemented with 0.35μm technology node at ± 1.2V supply voltage.
{"title":"Fractional-order filter design for ultra-low frequency applications","authors":"M. R. Dar, N. A. Kant, F. A. Khanday, C. Psychalinos","doi":"10.1109/RTEICT.2016.7808129","DOIUrl":"https://doi.org/10.1109/RTEICT.2016.7808129","url":null,"abstract":"The paper presents a novel scheme to implement fractional-order filters for ultra-low frequency applications. The scheme is based on the intrinsic property of the fractional-order filters that the pole frequency can be scaled down to sub-hertz by employing the order if the normal pole frequency of the filter is designed slightly less than one. This is in contrast to the scaling techniques employed in low-frequency integer-order filters where the impedance is scaled to decrease the overall capacitance required for low-frequency design. The functioning of the scheme has been demonstrated by an OTA-based low-pass filter example implemented with 0.35μm technology node at ± 1.2V supply voltage.","PeriodicalId":6527,"journal":{"name":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","volume":"9 1","pages":"1727-1730"},"PeriodicalIF":0.0,"publicationDate":"2016-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73151805","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-05-20DOI: 10.1109/RTEICT.2016.7807802
H. Pavithra, Shivashankar, G. Poornima
With the quick advancement of the Internet, wireless communications have gotten remarkable consideration. Wireless sensor systems are outfitted with minor, essential batteries and along these lines it is important to plan vitality effective calculations to draw out the system lifetime. In remote sensor systems (WSNs), the sink versatility along an obliged mode can enhance the vitality proficiency. Sink mobility is an imperative method to enhance sensor system execution including vitality utilization, end-to-end delay and lifetime. To manage the above issues researches introduced a Rendezvous design technique, where some sensor nodes are selected as an RP's and the nodes which are not RP's will forward data to the nearest RP's. The major issue in this design is to find the set of RP's and determine the tour that visits these RP's. To overcome this issue in this paper we proposed an algorithm called as an " Weighted Rendezvous Planning(WRP)", where each node is provided with some weight based on the number of packets that it sends and the nearest hop distance. The simulation is performed using NS2 simulator and we compared the WRP with the existing approach with the energy consumption and network lifetime of sensor nodes.
{"title":"An efficient mobile sink path selection approach for WSN's","authors":"H. Pavithra, Shivashankar, G. Poornima","doi":"10.1109/RTEICT.2016.7807802","DOIUrl":"https://doi.org/10.1109/RTEICT.2016.7807802","url":null,"abstract":"With the quick advancement of the Internet, wireless communications have gotten remarkable consideration. Wireless sensor systems are outfitted with minor, essential batteries and along these lines it is important to plan vitality effective calculations to draw out the system lifetime. In remote sensor systems (WSNs), the sink versatility along an obliged mode can enhance the vitality proficiency. Sink mobility is an imperative method to enhance sensor system execution including vitality utilization, end-to-end delay and lifetime. To manage the above issues researches introduced a Rendezvous design technique, where some sensor nodes are selected as an RP's and the nodes which are not RP's will forward data to the nearest RP's. The major issue in this design is to find the set of RP's and determine the tour that visits these RP's. To overcome this issue in this paper we proposed an algorithm called as an \" Weighted Rendezvous Planning(WRP)\", where each node is provided with some weight based on the number of packets that it sends and the nearest hop distance. The simulation is performed using NS2 simulator and we compared the WRP with the existing approach with the energy consumption and network lifetime of sensor nodes.","PeriodicalId":6527,"journal":{"name":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","volume":"142 1","pages":"151-155"},"PeriodicalIF":0.0,"publicationDate":"2016-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73276039","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-05-20DOI: 10.1109/RTEICT.2016.7808030
D. Raviya Rupal, Dhaval Satasiya, H. Kumar, Archit Agrawal
Nowadays security is a major concern. Address resolution Protocol (ARP) is a most popular communication protocol in the LAN. ARP is mapping from IP address (32 bits) into MAC address (48 bits). ARP has some limitations like lack of states and authentication. So attacker can exploit these vulnerabilities and gain unauthorized access to one's sensitive data. There are some attacks against ARP like MAC Spoofing, MAC duplicating, Man-in-the-middle (MITM) and denial of services (DOS). So efficient and secure scheme is provided which prevents ARP attacks. This paper demonstrates a utility which gives users the authentication as well as detection and prevention of ARP poisoning in dynamic IP configuration. Utility provides a mechanism which is based on internet control management protocol (ICMP) which uses secondary cache for checking pair entry of IP-MAC respective the system in the network.
{"title":"Detection and prevention of ARP poisoning in dynamic IP configuration","authors":"D. Raviya Rupal, Dhaval Satasiya, H. Kumar, Archit Agrawal","doi":"10.1109/RTEICT.2016.7808030","DOIUrl":"https://doi.org/10.1109/RTEICT.2016.7808030","url":null,"abstract":"Nowadays security is a major concern. Address resolution Protocol (ARP) is a most popular communication protocol in the LAN. ARP is mapping from IP address (32 bits) into MAC address (48 bits). ARP has some limitations like lack of states and authentication. So attacker can exploit these vulnerabilities and gain unauthorized access to one's sensitive data. There are some attacks against ARP like MAC Spoofing, MAC duplicating, Man-in-the-middle (MITM) and denial of services (DOS). So efficient and secure scheme is provided which prevents ARP attacks. This paper demonstrates a utility which gives users the authentication as well as detection and prevention of ARP poisoning in dynamic IP configuration. Utility provides a mechanism which is based on internet control management protocol (ICMP) which uses secondary cache for checking pair entry of IP-MAC respective the system in the network.","PeriodicalId":6527,"journal":{"name":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","volume":"35 1","pages":"1240-1244"},"PeriodicalIF":0.0,"publicationDate":"2016-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82516727","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-05-20DOI: 10.1109/RTEICT.2016.7807963
Ritu Kaur Makkad, A. Sahu
In this work, a novel architecture of Secure Hash Algorithm-1(SHA-1) for increased throughput and reduced area is presented. Various acceleration techniques are applied such as pre-computation, loop unfolding, and pipelining simultaneously. Carry Save Adder using Carry Lookahead Adder in its final stage is used for multi-input addition function to achieve high performance. The proposed architecture is designed using VHDL language. The synthesis and simulation work is performed in Xilinx ISE Design Suite 13.2 tool. The present implementation of SHA-1 offers better results as compared to previous works.
在这项工作中，提出了一种新的安全哈希算法-1(SHA-1)架构，用于增加吞吐量和减少面积。同时应用了各种加速技术，如预计算、循环展开和流水线。进位保存加法器在其最后阶段使用进位前瞻加法器，用于多输入加法功能，以达到高性能。该体系结构采用VHDL语言设计。合成和仿真工作在Xilinx ISE Design Suite 13.2工具中进行。与以前的工作相比，目前的SHA-1实现提供了更好的结果。
{"title":"Novel design of fast and compact SHA-1 algorithm for security applications","authors":"Ritu Kaur Makkad, A. Sahu","doi":"10.1109/RTEICT.2016.7807963","DOIUrl":"https://doi.org/10.1109/RTEICT.2016.7807963","url":null,"abstract":"In this work, a novel architecture of Secure Hash Algorithm-1(SHA-1) for increased throughput and reduced area is presented. Various acceleration techniques are applied such as pre-computation, loop unfolding, and pipelining simultaneously. Carry Save Adder using Carry Lookahead Adder in its final stage is used for multi-input addition function to achieve high performance. The proposed architecture is designed using VHDL language. The synthesis and simulation work is performed in Xilinx ISE Design Suite 13.2 tool. The present implementation of SHA-1 offers better results as compared to previous works.","PeriodicalId":6527,"journal":{"name":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","volume":"66 1","pages":"921-925"},"PeriodicalIF":0.0,"publicationDate":"2016-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91084579","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-05-20DOI: 10.1109/RTEICT.2016.7807941
Rishav Kumar, M. Suhas
Skeletal metastasis has tendency to develop from any kind of primary tumor. In the spine, the vertebral body is the most common site of metastasis which then extends to pedicle. About 2/3rd of the malignant tumor cases are found to develop metastasis. This work presents a Computer Aided Diagnosis (CAD) system that helps radiologists in differentiating malignant and benign bone lesions in the spine on Computed Tomography (CT) images usingSupport Vector Machines(SVM). The CT images are segmented using Snakes or Active Contour Model to retrieve the Region of Interest(ROI). From the segmented images, Haralick features are calculated. These features are then passed to the SVM classifier. With the help of SVM model generated, the data are classified into benign and malignant nodules. The performances of different kernel functions are compared.
{"title":"Classification of benign and malignant bone lesions on CT imagesusing support vector machine: A comparison of kernel functions","authors":"Rishav Kumar, M. Suhas","doi":"10.1109/RTEICT.2016.7807941","DOIUrl":"https://doi.org/10.1109/RTEICT.2016.7807941","url":null,"abstract":"Skeletal metastasis has tendency to develop from any kind of primary tumor. In the spine, the vertebral body is the most common site of metastasis which then extends to pedicle. About 2/3rd of the malignant tumor cases are found to develop metastasis. This work presents a Computer Aided Diagnosis (CAD) system that helps radiologists in differentiating malignant and benign bone lesions in the spine on Computed Tomography (CT) images usingSupport Vector Machines(SVM). The CT images are segmented using Snakes or Active Contour Model to retrieve the Region of Interest(ROI). From the segmented images, Haralick features are calculated. These features are then passed to the SVM classifier. With the help of SVM model generated, the data are classified into benign and malignant nodules. The performances of different kernel functions are compared.","PeriodicalId":6527,"journal":{"name":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","volume":"47 1","pages":"821-824"},"PeriodicalIF":0.0,"publicationDate":"2016-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91257780","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-05-20DOI: 10.1109/RTEICT.2016.7808003
A. Jatti, M. Kannan, R M Alisha, P. Vijayalakshmi, Shrestha Sinha
The aim of this work is to develop a wearable device for the safety and protection of women and girls. This objective is achieved by the analysis of physiological signals in conjunction with body position. The physiological signals that are analyzed are galvanic skin resistance and body temperature. Body position is determined by acquiring raw accelerometer data from a triple axis accelerometer. Acquisition of raw data is then followed by activity recognition which is a process of employing a specialized machine learning algorithm. Real-time monitoring of data is achieved by wirelessly sending sensor data to an open source Cloud Platform. Analysis of the data is done on MATLAB simultaneously. This device is programmed to continuously monitor the subject's parameters and take action when any dangerous situation presents itself. It does so by detecting the change in the monitored signals, following which appropriate action is taken by means of sending notifications/alerts to designated individuals.
{"title":"Design and development of an IOT based wearable device for the safety and security of women and girl children","authors":"A. Jatti, M. Kannan, R M Alisha, P. Vijayalakshmi, Shrestha Sinha","doi":"10.1109/RTEICT.2016.7808003","DOIUrl":"https://doi.org/10.1109/RTEICT.2016.7808003","url":null,"abstract":"The aim of this work is to develop a wearable device for the safety and protection of women and girls. This objective is achieved by the analysis of physiological signals in conjunction with body position. The physiological signals that are analyzed are galvanic skin resistance and body temperature. Body position is determined by acquiring raw accelerometer data from a triple axis accelerometer. Acquisition of raw data is then followed by activity recognition which is a process of employing a specialized machine learning algorithm. Real-time monitoring of data is achieved by wirelessly sending sensor data to an open source Cloud Platform. Analysis of the data is done on MATLAB simultaneously. This device is programmed to continuously monitor the subject's parameters and take action when any dangerous situation presents itself. It does so by detecting the change in the monitored signals, following which appropriate action is taken by means of sending notifications/alerts to designated individuals.","PeriodicalId":6527,"journal":{"name":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","volume":"2021 1","pages":"1108-1112"},"PeriodicalIF":0.0,"publicationDate":"2016-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91317667","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-05-20DOI: 10.1109/RTEICT.2016.7807915
S. Prasad, B. Ramkumar
Copy-move is a common type of digital image forgery. In an image, Copy-Move tampering might be done to hide an undesirable region or to duplicate something in the image. These images might be used for the necessary purpose like evidence in the court of law. So, authenticity verification plays a vital role for digital images. In this paper, we compare the CMFD (Copy-Move Forgery Detection) using Image features like SIFT (Scale Invariant Features Transform), HOG (Histogram Oriented Gradient) and SURF (Speed-Up Robust Features) and hybrid features (SURF-HOG and SIFT-HOG). The comparison results show that CMFD using SIFT features provide better results as compared with SURF and HOG features. Also, considering hybrid features, SIFT-HOG and SURF-HOG produce better results for CMFD using SIFT, SURF or HOG alone.
{"title":"Passive copy-move forgery detection using SIFT, HOG and SURF features","authors":"S. Prasad, B. Ramkumar","doi":"10.1109/RTEICT.2016.7807915","DOIUrl":"https://doi.org/10.1109/RTEICT.2016.7807915","url":null,"abstract":"Copy-move is a common type of digital image forgery. In an image, Copy-Move tampering might be done to hide an undesirable region or to duplicate something in the image. These images might be used for the necessary purpose like evidence in the court of law. So, authenticity verification plays a vital role for digital images. In this paper, we compare the CMFD (Copy-Move Forgery Detection) using Image features like SIFT (Scale Invariant Features Transform), HOG (Histogram Oriented Gradient) and SURF (Speed-Up Robust Features) and hybrid features (SURF-HOG and SIFT-HOG). The comparison results show that CMFD using SIFT features provide better results as compared with SURF and HOG features. Also, considering hybrid features, SIFT-HOG and SURF-HOG produce better results for CMFD using SIFT, SURF or HOG alone.","PeriodicalId":6527,"journal":{"name":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","volume":"30 1","pages":"706-710"},"PeriodicalIF":0.0,"publicationDate":"2016-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83119182","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
扫码关注我们
求助内容：
应助结果提醒方式：