......

..

IJCTA-Volume 4 Issue 4/ July-August 2013
S.No
Title/Author Name
Page No
1
Performance Optimization of Image Fusion using Meta Heuristic Genetic Algorithm
-Navita Tiwari
Abstract
Fusing information contained in multiple images playsan increasingly important role for quality inspection in industrial processes as well as in situation assessment for autonomous systems and assistance systems. The aim of image fusion in general is to use images as redundant or complementary sources to extract information from them with higher accuracy or reliability. This dissertation describes image fusion in detail, and firstly intrudes the three basic levels which are pixel level, feature level and decision level fusion, and then compares with their properties and all other aspects. Then it describes the evaluation criteria ofimage fusion results from subjective evaluation and objective evaluation two aspects. According to the quantitative evaluation of the image fusion results and quality, this text uses and defines multiple evaluation parameters such as fusion image entropy, mutual information MI, the average gradient, standard deviation, cross-entropy, unite entropy, bias, relative bias, mean square error, root mean square error and peak SNR, and establishes the corresponding evaluation criteria.
Keywords: - image fusion, wavelet transform, DCT, neural network, Genetic algorithm
566-571


  PDF

2
Bio Inspired Reputation and Trust Model: WSN
-Namit Khanduja,Agam Goyal
Abstract
Wireless Sensor Networks (WSNs) is nowadays being used in many areas and is of great interest to both industry and academia. Researchers from both are putting lot of efforts to improve the applications. WSN's have restrictive environment and have variety of issues such as to assure a minimum level of security and ensuring confidence in the every pair of participating nodes. We present in this paper a reputation and trust model using Bio Inspired technique, called RTM-B, aiming to provide trust using ant colony systems. The Experiments reveal the effectiveness and accuracy of the above mode in wide set of situations.
Keywords—Reputation; Trust; ACO
572-575

  PDF

3
Analysis of Segmentation Based in painting and Adaptive in painting Method
-Bhimaraju Swati,Prof. Naveen Malviya,Prof. Shrikant Lade
Abstract
In this paper we studied and reviewed two algorithms Edge based Image Restoration and Progressive Image Inpaintig based on Wavelet Transform. These algorithms uses patch based technique for completing missing region of the image with the help of surrounding information that already is present in original image. We came up with new concept which is extension of progressive method by using Adaptive method for patch propagation. Selection of patch is done by algorithm[18] itself. We updated the confidence value using wavelet transform method. The result of Adaptive method is more efficient and accurate than Edge-based image restoration algorithm .In order to emphasize the differences of inpainting effect, we compared window patch size and speed of process using different images, employed PSNR graph
576-584


  PDF

4
PSO Based Optimization Technique for Fast Fractal Image Compression
-A.Krishnamoorthy,S.Buvaneswari
Abstract
In traditional fractal image compression, the encoding procedure is time-consuming due to the full search mechanism. In order to speed up the encoder, we adopt particle swarm optimization method performed under classification and Dihedral transformation to further decrease the amount of MSE computations. The classifier partitions all of the blocks in domain pool and range pool into three classes according to the third level wavelet coefficients. Each range block searches the most similar block only from the blocks of the same class. Furthermore, according to the property of Dihedral transformation, only four transformations for each domain block are considered so as to reduce the encoding time. Experimental results show that, the encoding time of the proposed method is faster than that of the full search method. Experimental results show that the proposed method is about 181 times faster with only 1.56dB decay in image quality.
Keywords:Fractal image compression, particle swarm optimization, Dihedral transformation, Encoding time.
585-589


  PDF

5
WEB Enabled Enterprise Monitor for Satellite Data Acquisition and Distributed processing workflows
-B.Lakshmi, Manju Sarma,Anupama Sharma, Uzairmuzeeb, Amit kumar G, Ashwini Joshi,Sobina Bhomik, P.Sailaja, M.Vidya, M.Naresh kumar
Abstract
In a large automated enterprise involving distributed operational facility an analytical insight into complete enterprise operations and infrastructure helps the managers to gain the operational intelligence thus enable them to take timely decisions to act on deficiencies and realize improvements. This requires tools for monitoring business activities, to detect situations relating to inefficiencies & threats and to identify improvement opportunities. In order to realize the tool appropriate mechanisms for capturing, processing, archiving, servicing and presenting are required. It is also important that such tools are easily accessible through thin clients. A tool called enterprise event monitoring and control (EMC) is designed to provide operational intelligence of Integrated Multi-mission Ground Segment for Earth Observation Satellites [IMGEOS] facility at National Remote sensing centre, Hyderabad. The current paper describes the design and implementation aspects of EMC system.
590-597




  PDF

6
A Noval Approach Towards Border Patrolling Dual-Mode Robot
-Neeru Pathak, Abdur Rahim Dabir, Ashish Parekh and Tapan Khilnani
Abstract
In this work, we propose a solution to tackle military concerns of surveillance in our country. The proposed approach for surveillance involves two modes of operation, namely, autonomous and manual. In autonomous mode, the robot continuously takes input feed from the GPS and goes on a predefined path using obstacle avoidance feature. This feature helps the robot avoid obstacles using IR sensors without any external help. At the same time, a continuous video feed is provided at the controller's unit with the help wireless camera fixed on it. With a glimpse of any infiltrators, the user can switch from autonomous mode to manual mode immediately. This gives the handler complete control of the actions of the robot. This technique provides for the indispensible tool for the surveillance of enemy activities, without putting one's own forces in danger.
Keywords- Autonomous, GPS, IR sensors and wireless camera.
598-602

  PDF

7
Simulation of Faults in MANET
-Shabnam Parveen,Avni Jindal
Abstract
Fault-diagnosis becomes an important building block to establish dependability in MANET. Wireless networks are increasing popularity day by day, as users want wireless connectivity irrespective of their geographic position. A wireless ad-hoc network is a temporary network set up by wireless mobile nodes moving arbitrary in places that have no infrastructure; this gives rise to various kinds of problems such as routing and detecting faulty mobile nodes in the network. Faults in MANET are link failure, transmission error, route breakage, or congested nodes. Distributed system-level diagnosis is an important problem in MANET whose purpose is to have each fault-free mobile node to determine the state of all the mobile nodes in the system. Crash faulty mobile nodes are unable to communicate with the rest of the system, due to physical damage, battery depletion or being out of range. Value faulty nodes usually perform incorrect computation and communicate erroneous result or value while processing the data packet. A value faulty node may also corrupt the header of the message. There is an increasing number of faults in MANET day by day. The scope of this paper to find the faults in MANET by the use of cluster and the use of threshold value. In this performance metrics like message complexity, diagnostic latency and hop count ratio. Simulation is done in MATLAB. The faults are finding by the use of heartbeat testing mechanism. Keywords:MANET, fault diagnosis, cluster, heartbeat, Diagnosis Model, Threshold value.
603-610

  PDF

8
Attribute Based Secure Data Access in Cloud Computing
-Abdul Rahim. S,BalaMurgan. B
Abstract
Cloud computing enables highly scalable services to be easily consumed over the Internet on an as-needed basis. Attribute Based Secure Data Access has proposed for access control of outsourced data in cloud computing. The person wants to sale their business logic to some others with attractive mechanism for showing the restricted portion. The idea proposed the business people have secure Uploading the File with secret key and also set the price of their logic. The user cannot access the full logic without paying, after settle the payment user can receive the key through the mail. After every transaction the original key has changed, and the new key is automatically generate and send to the data owner. In this paper, each business people have separate location for storing the file (business logic) and viewer (user) have restricted access, so that they are only viewing the certain portions. The Auditor maintaining the accessed and non-accessed business logic file depends upon user those who read the logics. Main theme of these project presents who are earned great business logic and share those logic to some other weakest business people as well as they earned certain amount of money for their idea. Small scale industry using the business logic behalf of veteran business men logic and the achieving their business growth.
Keywords— Business logic(Bl),Dynamic Audit(DA),Storage Security(SS),Cloud Storage Service(CSS),Knuth Morris Pratt(KMP)
611-615

  PDF

9
CIM to PIM Transformation: A criteria Based Evaluation
-Abdelouahed KRIOUILE,Taoufiq GADI,Youssef BALOUKI
Abstract
The Model Driven Architecture (MDA) of the Object Management Group (OMG) represents an approach of software development based on the use of models. The transformation of models is at the heart of the MDA (Model-Driven Architecture) approach. CIM to PIM transformation can be of a great support for domain experts and business analysts, but is not mentioned enough by OMG. Thus, we have decided to focus on this higher level of MDA and these transformations at the PIM level, first by this work of studying a number of research on this subject and then by a future work to improve contribution in this stage. In this paper, we provide an assessment based on criterions deducted from the framework MDATM of the OMG and similar evaluations of the existing works for this stage of construction and transformation of CIM. The results of this study will make it easier, for future researchers, to provide a relevant method of CIM construction and transformation.
Keywords: MDA, CIM, PIM, CIM to PIM transformation
616-625

  PDF

10
Optimal Cluster Selection Based on Ant Colony Optimization for Cluster Oriented Ensemble Classifier in Stream data classification
-Richa Gupta,Hitesh Gupta
Abstract
In this paper we proposed a method of optimal selection of cluster for cluster oriented classifier. The cluster oriented classifier is great advantage over binary and conventional classifier. The cluster oriented classifier work very efficiently on real and sample data. But the cluster oriented ensemble classifier faced a problem of selection of number of cluster for ensemble. In current fashion the number of cluster passes as fixed. Now these bottleneck of cluster oriented ensemble classifier is replace with ant colony optimization. Ant colony optimization technique is very famous meta-heuristic function in concern of multi-objective. Using ant colony optimization we proceed the optimal selection of cluster in ensemble classifier. Our empirical result analysis shows that better result in compression of cluster oriented ensemble classifier for stream data classification.
Keywords: -, Ensemble Classifier, Cluster and ANT
626-631



  PDF

11
Fault Tolerance by Minimizing the Virtual Machine Migration time in Software Defined Network
-Viral Parmar,Amit Patel
Abstract
Virtual Machine Migration become crucial when it comes to the migration in a huge Date Center, and failure of any host running several VM lead to migration of VM .In commercial Data Center, when a specific VM is migrated to different place its takes lot of time as data packets are need to be broadcast in the network and all the network elements are need to be configured on the spot to reach the appropriate destination. This migration time can minimize by taking all the decision like to configure network equipment, switch table modification before migration occur by enabling the Data center Topology (Fat Tree Topology) by Software Defined Networking(SDN)[1,3] Concept. In this paper we will show you the proposed model of the modified Big Fat Tree topology and method of Virtual Machine migration in that topology.
Keywords: Software Defined Networking, OpenFlow, Virtual Machine, Migration, Big-Fat Tree topology
632-635


  PDF

12
Efficient Data Hiding Scheme Using Fourteen Square Substitution Algorithm
-Shatendra Dubey,Deepali V. Patil
Abstract
This paper describes techniques about secret communication between two people. We have used both cryptography and steganography to implement this. Firstly, we need to encrypt the message using new cipher algorithm called as fourteen square substitution cipher algorithm. Inside this algorithm, first 8 tables are used in upper case or smaller case or combination of both and remaining 6 tables are special symbols or digits. At the time of converting simple text into cipher text, it converts that cipher text into bytes and divide it by 2 and the values which come is called as index variable. Depending upon the index variable value, insert that cipher text in the career image at 6th and 7th bit location or 7th and 8th bit location. Change those bits depending upon index variable x. Index variable x should have value 0 or 1. The index variable value will be changed from 0 to 1 or 1 to 0 after each embedding. The first value of the index variable depends upon the length of the cipher text. After completion of embedding, the resultant image should be sent to the receiver and receiver should retrieve the cipher text from the said locations and then decrypt by using the fourteen square cipher algorithms to get the secret message. The embedding locations are not same in all pixels, so it is a stronger approach. We have implemented this algorithm using c#.net programming language. The twelve square substitution algorithm covered alphabets as well as special character but alphabet 'q is missing' over here. Fourteen square substitution algorithms is used to overcome this drawback. In this algorithm, both upper case and lower case alphabets are used. It will provide more payload too.
Index Terms—Steganography, Cryptography, Fourteen square substitution, encryption, decryption.
636-640


  PDF

13
Method For Digital Watermarking Using ANN
-Dinesh Kumar
Abstract
Soft computing in the area of information security is a promising field for the creation of intelligent solutions. This paper discusses a method for digital watermarking using artificial neural networks to realize secure copyright protection of visual information without any damage. The discussed watermark extraction keys and feature extraction keys identify the secure and unique hidden patterns for proper digital watermarks. In the experiments, we have shown that the proposed method is robust to high pass filtering and JPEG compression of visual information, only for those watermark extraction keys which were able to identify the proper hidden bit patterns from original visual information using corresponding feature extraction keys. The proposed method is to contribute to secure visual digital watermarking without damaging or losing any detailed data of visual information.
Keywords-component: Digital Watermarking, Machine Learning, Information Hiding, Artificial Neural Networks, Digital Rights Management
641-646

  PDF

14
A Fusion of SOM and Fuzzy C-Means for Image Processing
-Dr. K Perumal,V G Karthikram
Abstract
Image segmentation plays a significant role in computer vision. It aims at extracting meaningful objects lying in the image. Generally there is no unique method or approach for image segmentation. In this paper, a simple algorithm for detecting the range and shape of objects in images is described. This image is visually examined for detection and analysis of object. To avoid that, this paper uses computer aided method for segmentation (detection) of objects based on the combination of two algorithms. This method allows the segmentation of objects with accuracy and reproducibility comparable to manual segmentation. In addition, it also reduces the time for analysis. At the end of the process the object is extracted from the image and its exact position and the shape also determined. The object is analyzed based on the amount of area calculated from the cluster. The key concept in this color-based segmentation algorithm with K-means is to convert a given color space image into a gray scale space image and then separate the position of objects from other items of an image by using K-means clustering and histogram-clustering.
Keywords: Fuzzy C-means, k-means, Thresholding.
647-652

  PDF

15
A New Approach of Location Aided Routing Protocol Using Minimum Bandwidth in Mobile Ad-Hoc Network
-Nitin Goyal,Alka Gaba
Abstract
In wireless ad-hoc networks, there are number of characteristics diverse than wired networks. The diversity is due to change of network topology as well as limited resources like bandwidth and energy and so on. As the bandwidth issue need additional imperative, it is obligatory to research about the efficient resource allocation methods optimized in wireless networks. In the paper, we improve LAR (Location-Aided Routing) which is one of the most famous location based routing methods. It uses information regarding the location of mobile node through GPS technique. Our new protocol considers together areas of routing as well as bandwidth. To improves the quality of services at first, propose a more efficient routing method which. Secondly, a bandwidth aware method is proposed to select proper transmission bandwidth node by using a minimum available bandwidth.
Index Terms—MANET, Expected Zone, Requested Zone, LAR,
653-659


  PDF

16
The How, When and Why of Sentiment Analysis
-Vijyalaxmi M,Sangeeta Oswal,Shalu Chopra,Deepshikha Chaturvedi
Abstract
With the explosive growth of social media on web ,individuals and organizations are increasingly using the content in these media for decision making. Nowadays if one wants to buy a consumer product one prefer user reviews and discussion in public forums on web about the product.As a result opinion mining has gained importance. This online -word-of-mouth represent new and measurable source of information with many applications, this process of identifying and extracting subjective information from raw data is known as sentiment analysis. This paper presents a survey on sentiment analysis or opinion mining. The existing literature of opinion mining is explained in detail. We explore the application oriented approach and discussed various domain where opinion mining would be useful. Finally we put forward research challenges in this field
660-665


  PDF

17
Monitoring the User Navigation in the Cloud Application
-Syed Ashfaq Ahamed. A,Valarmathi. A
Abstract
Cloud computing enables highly scalable services to be easily consumed over the Internet on an as-needed basis. A major feature of the cloud services is that users' data are usually processed remotely in unknown machines that users do not own or operate. While enjoying the convenience brought by this new emerging technology, users' fears of losing control of their own data can become a significant barrier to the wide adoption of cloud services. To address this problem, in this paper, a novel propose highly decentralized information accountability framework to keep track of the actual usage of the users' data in the cloud. In particular, an object-centered approach that enables enclosing our logging mechanism together with users' data and policies and leverage the JAR programmable capabilities to both create a dynamic and traveling object, and to ensure that any access to users' data will trigger authentication and automated logging local to the JARs. To strengthen user's control, It's also provide distributed auditing mechanisms and the log files will be monitored to identify the fake users which provide extensive experimental studies that demonstrate the efficiency and effectiveness of the proposed approaches.
Keywords— JAR (Java Archive (compressed JAVA class files)) Cloud application, accountability, MUNCA (Monitoring the User Navigation in the Cloud Application.
666-672

  PDF

18
A Review of Cluter Based Clasification Technique
-Shivam Mishra,Anurag Jain
Abstract
Fusion and ensemble is important technique of machine learning. Fusion fused the feature attribute of different classifier and improved the classification of binary classifier. Instead of that ensemble technique provide the facility of merge two individual classifier and improve the performance of both classifiers. The ensemble technique of classifier depends on number of nearer point of classifier. For the selection of nearest point of classifier various authors used clustering technique for ensemble process. The cluster based ensemble technique suffered a problem of optimal selection of cluster during ensemble process. The generation of clustering technique is fixed due to this reasons the selection of optimal cluster is very difficult. In this paper gives the information about ensemble technique based on clustering and other technique.
Keywords: - Classification, ANT Ensemble Classifier and Cluster
673-677

  PDF

19
Context Aware In Symbian
-Sangeeta Oswal,Prathik Shetty
Abstract
Context-awareness in mobile computing paradigm are applications that can discover and take advantage of contextual information (such as user location, time of day, nearby people and devices, and user activity).In this paper we propose a context based mobile application for symbain OS which provide service based on the context of the user. we looked in depth at the types of context used and models of context information, at systems that support collecting and disseminating context, and at applications that adapt to the changing context. Through this survey, it is clear that context-aware research is an old but rich area for research. The difficulties and possible solutions we outline serve as guidance for researchers hoping to make context-aware computing a reality.
678-682

  PDF

20
Simulation of LRU Page Replacement Algorithm for Improving Performance of System
-Mukesh Kumari,Ashish Kumar,Neha
Abstract
Now days, page replacement policy become the heart of caching system. Which decides which page to replace in a cache by a new one? Different page replacement algorithms have dramatically different effects on the system performance. A virtual memory system needs efficient page replacement algorithms to decide which pages to evict from memory in case of a page fault. Over the years many algorithms have been proposed for page replacement. Each algorithm attempts to minimize the page fault rate while incurring minimum overhead. , In this paper we discuses at the traditional algorithms such as LRU. Least Recently Used (LRU) page replacement algorithm is most efficient algorithm compare to others algorithms.
Keywords— Page Replacement, LRU, Demand paging, locality of reference, Reference bit.
683-685


  PDF

 

 

 

 

IJCTA © Copyrights 2010| All Rights Reserved.

This work is licensed under a Creative Commons Attribution 2.5 India License.