A New Secure Image Transmission Technique via Secret-Fragment-Visible Mosaic Images by Nearly Reversible Color Transformations

Abstract

            A new secure image transmission technique is proposed, which transforms automatically a given large-volume secret image into a so-called secret-fragment-visible mosaic image of the same size. The mosaic image, which looks similar to an arbitrarily selected target image and may be used as a camouflage of the secret image, is yielded by dividing the secret image into fragments and transforming their color characteristics to be those of the corresponding blocks of the target image. Skillful techniques are designed to conduct the color transformation process so that the secret image may be recovered nearly losslessly. A scheme of handling the overflows/underflows in the converted pixels’ color values by recording the color differences in the untransformed color space is also proposed. The information required for recovering the secret image is embedded into the created mosaic image by a lossless data hiding scheme using a key. Good experimental results show the feasibility of the proposed method.

Domain : Image Processing

Contact Detail

Ph.no : 7200555526

e-mail: info.nanosoftwares@gmail.com

Robust Face Recognition from Multi-View Videos

Abstract

Multiview face recognition has become an active research area in the last few years. In this paper, we present an approach for video-based face recognition in camera networks. Our goal is to handle pose variations by exploiting the redundancy in the multiview video data. However, unlike traditional approaches that explicitly estimate the pose of the face, we propose a novel feature for robust face recognition in the presence of diffuse lighting and pose variations. The proposed feature is developed using the spherical harmonic representation of the face texture-mapped onto a sphere; the texture map itself is generated by back-projecting the multiview video data. Video plays an important role in this scenario. First, it provides an automatic and efficient way for feature extraction. Second, the data redundancy renders the recognition algorithm more robust. We measure the similarity between feature sets from different videos using the reproducing kernel Hilbert space. We demonstrate that the proposed approach outperforms traditional algorithms on a multiview video database.

Domain : Image Processing

Contact Detail

Ph.no : 7200555526

e-mail id : info.nanosoftwares@gmail.com

Discrete Anamorphic Transform for Image Compression

Abstract

To deal with the exponential increase of digital data, new compression technologies are needed for more efficient representation of information. We introduce a physics-based transform that enables image compression by increasing the spatial coherency. We also present the Stretched Modulation Distribution, a new density function that provides the recipe for the proposed image compression. Experimental results show pre-compression using our method can improve the performance of JPEG 2000 format.

Segmentation-Driven Image Registration- Application to 4D DCE-MRI Recordings of the Moving Kidneys

Abstract

Dynamic contrast enhanced magnetic resonance imaging (DCE-MRI) of the kidneys requires proper motion correction and segmentation to enable an estimation of glomerular filtration rate through pharmacokinetic modeling. Traditionally, co-registration, segmentation, and pharmacokinetic modeling have been applied sequentially as separate processing steps. In this paper, a combined 4D model for simultaneous registration and segmentation of the whole kidney is presented. To demonstrate the model in numerical experiments, we used normalized gradients as data term in the registration and a Mahalanobis distance from the time courses of the segmented regions to a training set for supervised segmentation. By applying this framework to an input consisting of 4D image time series, we conduct simultaneous motion correction and two-region segmentation into kidney and background. The potential of the new approach is demonstrated on real DCE-MRI data from ten healthy volunteers.

Domain : Image Processing

Contact Detail 

Ph.no : 7200555526

e-mail id : info.nanosoftwares@gmail.com

P-FAD: Real-Time Face Detection Scheme on Embedded Smart Camera

Abstract

            Face detection on general embedded devices is fundamentally different from the conventional approach on personal computer or consumer digital camera due to the limited computation and power capacity. The resource-limited characteristic gives rise to new challenges for implementing a real-time video surveillance system with smart cameras. In this work, we present the design and implementation of Pyramid-like FAce Detection (P-FAD), a real-time face detection system constructed on general embedded devices. Motivated by the observation that the computation overhead increases proportionally to its pixel manipulation, P-FAD proposes a hierarchical approach to shift the complex computation to the promising regions. More specifically, P-FAD present a three-stage coarse, shift, and refine procedure, to construct a pyramid-like detection framework for reducing the computation overhead significantly. This framework also strikes a balance between the detection speed and accuracy. We have implemented P-FAD on notebook, Android phone and our embedded smart camera platform. An extensive system evaluation in terms of detailed experimental and simulation results is provided. Our empirical evaluation shows that P-FAD outperforms V-J detector calibrated color detector (VJ-CD) and color detector followed by a V-J detector (CD-VJ), the state of the art real-time face detection techniques by 4.7 –8.6 on notebook and by up to 8.2 on smart phone in terms of the detection speed.

Domain : Image Processing

Contact Details

Ph.no : 7200555526

e-mail id : info.nanosoftwares@gmail.com

An Unbiased Risk Estimator for Image Denoising in the Presence of Mixed Poisson–Gaussian Noise

Abstract

            The behavior and performance of denoising algorithms are governed by one or several parameters, whose optimal settings depend on the content of the processed image and the characteristics of the noise, and are generally designed to minimize the mean squared error (MSE) between the denoised image returned by the algorithm and a virtual ground truth. In this paper, we introduce a new Poisson-Gaussian unblased risk estimator (PG-URE) of the MSE applicable to a mixed Poisson-Gaussian noise model that unifies the widely used Gaussian and Poisson noise model in fluorescence bioimaging applications. We propose a stochastic methodology to evaluate this estimator in the case when little is known about the internal machinery of the considered denoising algorithm, and we analyze both theoretically and empirically the characteristics of the PG-URE estimator. Finally, we evaluate the PG-URE-driven parametrization for three standard denoising algorithms, with and without variance stabilizing tranforms, and different characteristics of the Poisson-Gaussian noise mixture.

Domain : Image Processing

Contact Details

Ph.no : 7200555526

e-mail id : info.nanosoftwares@gmail.com

Decentralized Computation Offloading Game For Mobile Cloud Computing

Abstract

Mobile cloud computing is envisioned as a promising approach to augment computation capabilities of mobile devices for emerging resource-hungry mobile applications. In this paper, we propose a game theoretic approach for achieving efficient computation offloading for mobile cloud computing. We formulate the decentralized computation offloading decision making problem among mobile device users as a decentralized computation offloading game. We analyze the structural property of the game and show that the game always admits a Nash equilibrium. We then design a decentralized computation offloading mechanism that can achieve a Nash equilibrium of the game and quantify its efficiency ratio over the centralized optimal solution. Numerical results demonstrate that the proposed mechanism can achieve efficient computation offloading performance and scale well as the system size increases.

Domain : Mobile Computing

Contact Detail

Ph.no : 7200555526

e-mail id : info.nanosoftwares@gmail,com

Captcha as Graphical Passwords—A New Security Primitive Based on Hard AI Problems

Abstract

Many security primitives are based on hard mathematical problems. Using hard AI problems for security is emerging as an exciting new paradigm, but has been underexplored. In this paper, we present a new security primitive based on hard AI problems, namely, a novel family of graphical password systems built on top of Captcha technology, which we call Captcha as graphical passwords (CaRP). CaRP is both a Captcha and a graphical password scheme. CaRP addresses a number of security problems altogether, such as online guessing attacks, relay attacks, and, if combined with dual-view technologies, shoulder-surfing attacks. Notably, a CaRP password can be found only probabilistically by automatic online guessing attacks even if the password is in the search set. CaRP also offers a novel approach to address the well-known image hotspot problem in popular graphical password systems, such as PassPoints, that often leads to weak password choices. CaRP is not a panacea, but it offers reasonable security and usability and appears to fit well with some practical applications for improving online security.

Domain : Network Security

Contact Details 

Ph.no : 7200555526

e-mail : info.nanosoftwares@gmail.com

Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks

Abstract

      Mobile nodes in military environments such as a battlefield or a hostile region are likely to suffer from intermittent network connectivity and frequent partitions. Disruption-tolerant network (DTN) technologies are becoming successful solutions that allow wireless devices carried by soldiers to communicate with each other and access the confidential information or command reliably by exploiting external storage nodes. Some of the most challenging issues in this scenario are the enforcement of authorization policies and the policies update for secure data retrieval. Ciphertext-policy attribute-based encryption (CP-ABE) is a promising cryptographic solution to the access control issues. However, the problem of applying CP-ABE in decentralized DTNs introduces several security and privacy challenges with regard to the attribute revocation, key escrow, and coordination of attributes issued from different authorities. In this paper, we propose a secure data retrieval scheme using CP-ABE for decentralized DTNs where multiple key authorities manage their attributes independently. We demonstrate how to apply the proposed mechanism to securely and efficiently manage the confidential data distributed in the disruption-tolerant military network.

Domain : Networking

Contact Details

Ph. no : 7200555526

e-mail : info.nanosoftwares@gmail.com

NCCloud: A Network-Coding-Based Storage System in a Cloud-of-Clouds

Abstract

To provide fault tolerance for cloud storage, recent studies propose to stripe data across multiple cloud vendors. However, if a cloud suffers from a permanent failure and loses all its data, we need to repair the lost data with the help of the other surviving clouds to preserve data redundancy. We present a proxy-based storage system for fault-tolerant multiple-cloud storage called NCCloud, which achieves cost-effective repair for a permanent single-cloud failure. NCCloud is built on top of a network-coding-based storage scheme called the functional minimum-storage regenerating (FMSR) codes, which maintain the same fault tolerance and data redundancy as in traditional erasure codes (e.g., RAID-6), but use less repair traffic and, hence, incur less monetary cost due to data transfer. One key design feature of our FMSR codes is that we relax the encoding requirement of storage nodes during repair, while preserving the benefits of network coding in repair. We implement a proof-of-concept prototype of NCCloud and deploy it atop both local and commercial clouds. We validate that FMSR codes provide significant monetary cost savings in repair over RAID-6 codes, while having comparable response time performance in normal cloud storage operations such as upload/download.

Domain : Cloud Computing

Contact Details 

Ph. no : 7200555526

e-mail : info.nanosoftwares@gmail.com

Energy-Efficient Transmission Scheme for Mobile Data Gathering in Wireless Sensor Networks

Abstract:

 Energy conservation in Wireless Sensor Networks (WSNs) has always been a crucial issue and has received increased attention in the recent years. A transmission scheme for energy-constrained WSNs is proposed in this paper. The scheme, called MIHOP (MIMO and Multi-hop), combines cluster-based virtual

MIMO and multi-hop technologies. The multihop mode is employed in transmitting data when the related sensors are located within a specific number of hops from the sink, and the virtual MIMO mode is used in transmitting data from the remaining sensor nodes. We compare the energy consumption of different

transmission schemes and propose an algorithm for determining the optimal hop count in MIHOP. A controllable mobile sink that reduces the energy consumed in sensor transmission is also adopted for data collection. The theoretical analysis and the Monte Carlo simulation demonstrate that the proposed scheme significantly outperforms individual virtual MIMO, multi-hop technologies, and double-string networks

in terms of energy conservation. The energy consumption levels under the MIHOP scheme are approximately 12.98%, 47.55% and 48.30% less than that under virtual MIMO schemes, multi-hop networks and doublestring networks, respectively.

Domain : WSN

Contact details

Ph.no. 7200555526

e-mail : info.nanosoftwares@gmail.com

Local Directional Number Pattern for Face Analysis: Face and Expression Recognition

    

Abstract

In this paper we proposes a novel local feature descriptor, Local Directional Number Pattern (LDN), for face analysis: face and expression recognition. LDN encodes the directional information of the face’s textures (i.e., the texture’s structure) in a compact way, producing a more discriminative code than current methods. We compute the structure of each micro-pattern with the aid of a compass mask, that extracts directional information, and we encode such information using the prominent direction indexes (directional numbers) and sign—which allows us to distinguish among similar structural patterns that have different intensity transitions. We divide the face into several regions, and extract the distribution of the LDN features from them. Then, we concatenate these features into a feature vector, and we use it as a face descriptor. We perform several experiments in which our descriptor performs consistently under illumination, noise, expression, and time lapse variations. Moreover, we test our descriptor with different masks to analyze its performance indifferent face analysis tasks.

Domain : Image Processing

contact detail

phn.no : 7200555526

e-mail : info.nanosoftwares@gmail

Secure SOurce-BAsed Loose Synchronization (SOBAS) for Wireless Sensor Networks

Abstract

We present the Secure SOurce-BAsed Loose Synchronization (SOBAS) protocol to securely synchronize the events in the network, without the transmission of explicit synchronization control messages. In SOBAS, nodes use their local time values as a onetime dynamic key to encrypt each message. In this way, SOBAS provides an effective dynamic en-route filtering mechanism, where the malicious data is filtered from the network. With SOBAS, we are able to achieve our main goal of synchronizing events at the sink as quickly, as accurately, and as surreptitiously as possible. With loose synchronization, SOBAS reduces the number of control messages needed for a WSN to operate providing the key benefits of reduced energy consumption as well as reducing the opportunity for malicious nodes to eavesdrop, intercept, or be made aware of the presence of the network. Albeit a loose synchronization per se, SOBAS is also able to provide 7:24 [1]s clock precision given today’s sensor technology, which is much better than other comparable schemes (schemes that do not employ GPS devices). Also, we show that by recognizing the need for and employing loose time synchronization, necessary synchronization can be provided to the WSN application using half of the energy needed for traditional  schemes. Both analytical and simulation results are presented to verify the feasibility of SOBAS as well as the energy consumption of the scheme under normal operation and attack from malicious nodes.

DOMAIN : NETWORK SECURITY

CONTACT DETAILS

Ph.no  : 7200555526

e-mail  info.nanosoftwares@gmail.com

PRIVACY-PRESERVING FRAMEWORK FOR SECURE ENCOUNTER-BASED SOCIAL NETWORKS

                    

   ABSTRACT

                        In social networks and encounter-based systems, link users share a location at the same time,and may connect with users who have an offline friendship.Our new technique supports challenges that are basically different from those undertaken by previous social network designs.Functional and security requirements for these new systems are availability, security, and privacy, and present several design options for building secure social networks. Proposed system provide several security guarantees, including privacy in the form of unlinkability of users sharing an encounter, confidentiality of data exchanged among encounter participants, and authentication of both users in a two-party conversation. The work provided better results when compared with the existing approach.

DOMAIN :SECURE COMPUTING

CONTACT DETAILS

Phn : 7200555526

e-mail : info.nanosoftwares@gmail.com

http://www.nanosoftwares.com/

EFFICIENT GROUP COMMUNICATION IN LOCATION AWARE MOBILE AD HOC NETWORKS

• The highly dynamic and uncertain character of mobile ad-hoc networks poses significant challenges for group management. 
• Node mobility often changes the multicast tree, and therefore, frequent updates from group members are required to refresh the multicast tree at the source node. 
• This paper presents Courier, a group communications algorithm that uses the location and velocity of roaming nodes to provide bandwidth efficient multicast between a source and its destinations (i.e., group members) in location aware mobile environments. 
• Toward that end, Courier offers (1) a bandwidth efficient method for location updates from group members, (2) a mobility prediction model for predicting the movement of mobile group members, and (3) an overlay multicast data distribution tree (OMDDT) construction algorithm that is guided by the mobility prediction model. 
• Comparisons of Courier to related multicast algorithms indicate an increase in data transmission success and a decrease in overall bandwidth consumption.

DOMAIN : MOBILE COMPUTING

CONTACT INFORMATION 
 http://www.nanosoftwares.com/

Ph.no : 7200555526

e-mail : info.nanosoftwares@gmail.com

Add caption

FREQUENT POSITION UPDATE-EXCLUSIVE ANALYSIS FOR MOBILE AD HOC NETWORK USING TIME BASED BEACONS

• An increasing number of ad hoc networking protocols and location-aware services involve learning the mobile nodes’ location of their neighbors. 
• To preserve neighbor positions, nearly all geographic routing protocols exploit a well-liked method of periodic broadcasting of beacon packets that enclose the geographic location coordinates of the nodes. 
• From both the update cost and routing performance points of analysis, despite of the node mobility and traffic patterns in the network, we challenge and reveal that periodic beaconing is not smart. 
• Frequent Position Update-Exclusive Analysis (FPU-EA) strategy which vigorously amends the frequency of position updates based on the mobility dynamics of the nodes and the forwarding models in the network is intended in this work for geographic routing. 
• FPU-EA is based on two straightforward update principles: 1) nodes whose movements are tougher to guess update their locations more often (and vice versa), and (ii) nodes which are nearer to forwarding paths update their locations more often (and vice versa). 
• 
  DOMAIN : MOBILE COMPUTING
•  
  
  CONTACT INFORMATION
   Nano softwares
  Ph.no : 7200555526
  e-mail : info.nanosoftwares@gmail.com