No abstract

Glaucoma is a disease characterized by elevated intraocular pressure (IOP). This increased IOP leads to damage of optic nerve axons at the back of the eye, with eventual deterioration of vision. CDR is a key indicator for the detection of glaucoma. The existing approaches determined the CDR using manual threshold analysis which is fairly time consuming. This paper proposes two methods to extract the disc automatically. The component analysis method and region of interest (ROI) based segmentation are used for the detection of disc. For the cup, component analysis method is used. Later the active contour is used to plot the boundary accurately. This method has been tested on numerous image data sets from Madurai Eye Care Centre, Coimbatore.

No abstract

No abstract

Problem statement:In recent years, as digital media are gaining wider popularity, their security related issues are becoming greater concern. Method for authenticating and assuring the integrity of the image is required. Image authentication is possible by embedding a layer of the authentication signature into the digital image using a digital watermark. In some applications tamper localization is also required. Approach: In this study, we proposed a fragile image authentication system with tamper localization in wavelet domain. In this scheme, secret data to be embedded is a logo. Watermark was generated by repeating logo image so that size of watermark matches with the size of HH sub-band of integer wavelet transform. To provide additional level of security, the generated watermark was scrambled using a shared secret key. Integer Haar wavelet transform was applied to obtain wavelet coefficients. Watermark was embedded into the coefficients using odd-even mapping. Results: Experimental results demonstrated that proposed scheme detected and localized tampering at pixel level. Proposed scheme was tested with images of various sizes and tampering of various sizes. It provided good results for tamperings ranges from single pixel to a block of pixels. Conclusion: Watermarking was done in wavelet domain; conventional watermarking attacks were not possible. The resolution of tamper localization was achieved at pixel level. The watermarked image's quality was still maintained while providing pixel-level tampering accuracy. Proposed scheme can be used in insurance, forensics departments.

No abstract

Now days many research is going on for text summarization. Because of increasing information in the internet, these kind of research are gaining more and more attention among the researchers. Extractive text summarization generates a brief summary by extracting proper set of sentences from a document or multiple documents by deep learning. The whole concept is to reduce or minimize the important information present in the documents. The procedure is manipulated by Restricted Boltzmann Machine (RBM) algorithm for better efficiency by removing redundant sentences. The restricted Boltzmann machine is a graphical model for binary random variables. It consist of three layers input, hidden and output layer. The input data uniformly distributed in the hidden layer for operation. The experimentation is carried out and the summary is generated for three different document set from different knowledge domain. The f-measure value is the identifier to the performance of the proposed text summarization method. The top responses of the three different knowledge domain in accordance with the f-measure are 0.85, 1.42 and 1.97 respectively for the three document set.

VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a greedy position based routing approach to forward packet to the node present in the edge of the limited transmission range of forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We evaluate the performance of our solutions via Manhattan mobility model. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.