Wednesday, 16 January 2013

Combining Head Pose and Eye Location Information for Gaze Estimation


NANO SCIENTIFIC RESEARCH CENTRE PVT.LTD.,  AMEERPET, HYD
WWW.NSRCNANO.COM, 09640648777, 09652926926




JAVA PROJECTS LIST--2013
JAVA 2013 IEEE PAPERS



Combining Head Pose and Eye Location Information for Gaze Estimation
Abstract:
            Head pose and eye location for gaze estimation has been separately studied in numerous works in the literature. Previous research shows that satisfactory accuracy in head pose and eye location estimation can be achieved in constrained settings. However, in the presence of non-frontal faces, eye locators are not adequate to accurately locate the center of the eyes. On the other hand, head pose estimation techniques are able to deal with these conditions; hence, they may be suited to enhance the accuracy of eye localization. Therefore, in this paper, a hybrid scheme is proposed to combine head pose and eye location information to obtain enhanced gaze estimation. To this end, the transformation matrix obtained from the head pose is used to normalize the eye regions, and in turn, the transformation matrix generated by the found eye location is used to correct the pose estimation procedure.
            The scheme is designed to enhance the accuracy of eye location estimations, particularly in low-resolution videos, to extend the operative range of the eye locators, and to improve the accuracy of the head pose tracker. These enhanced estimations are then combined to obtain a novel visual gaze estimation system, which uses both eye location and head information to refine the gaze estimates. From the experimental results, it can be derived that the proposed unified scheme improves the accuracy of eye estimations by 16% to 23%. Furthermore, it considerably extends its operating range by more than 15 by overcoming the problems introduced by extreme head poses. Moreover, the accuracy of the head pose tracker is improved by 12% to 24%. Finally, the experimentation on the proposed combined gaze estimation system shows that it is accurate (with a mean error between 2 and 5 ) and that it can be used in cases where classic approaches would fail without imposing restraints on the position of the head.

Existing System:
            Head pose estimation often requires multiple cameras, or complex face models, which requires accurate initialization. Ba and Odobez improve the accuracy of pose estimates and of the head tracking by considering these as two coupled problems in a probabilistic setting within a mixed-state particle filter framework. They refine this method by the fusion of four camera views. Huang and Trivedi propose to integrate a skin-tone edge-based detector into a Kalman-filter-based robust head tracker and hidden-Markov-model-based pose estimator. Hu et al. describe a coarse-to-fine pose estimation method by combining facial appearance asymmetry and 3-D head model.

Proposed System:
            we propose a unified framework for head pose and eye location estimation for visual gaze estimation. The head tracker is initialized using the location and the orientation of the eyes, whereas the latter ones are obtained by pose-normalized eye patches obtained from the head tracker. A feedback mechanism is employed in the evaluation of the tracking quality. When the two modules do not yield concurring results, both are adjusted to get in line with each other, aiming to improve the accuracy of both tracking schemes. The improved head pose estimation is then used to define the field of view, while displacement vectors between the pose-normalized eye locations and their resting positions are used to adjust the gaze estimation obtained by the head pose only. In this way, a novel multimodal visual gaze estimator is obtained.

Software and Hardware Requirements

Hardware Required:                             
System                                    :           Pentium IV
Hard Disk                   :           80 GB
RAM                           :           512 MB
Software Required:
Operating System       :           Windows XP
Language                    :           Java

Modules:
·         Access Image
·         Detect face And Image
·         Draw Rectangles

Clustering with Multiviewpoint-Based Similarity Measure


NANO SCIENTIFIC RESEARCH CENTRE PVT.LTD.,  AMEERPET, HYD
WWW.NSRCNANO.COM, 09640648777, 09652926926




JAVA PROJECTS LIST--2013
JAVA 2013 IEEE PAPERS

Clustering with Multiviewpoint-Based Similarity Measure

Abstract:
            All clustering methods have to assume some cluster relationship among the data objects that they are applied on. Similarity between a pair of objects can be defined either explicitly or implicitly. In this paper, we introduce a novel multiviewpoint-based similarity measure and two related clustering methods. The major difference between a traditional dissimilarity/similarity measure and ours is that the former uses only a single viewpoint, which is the origin, while the latter utilizes many different viewpoints, which are objects assumed to not be in the same cluster with the two objects being measured. Using multiple viewpoints, more informative assessment of similarity could be achieved. Theoretical analysis and empirical study are conducted to support this claim. Two criterion functions for document clustering are proposed based on this new measure. We compare them with several well-known clustering algorithms that use other popular similarity measures on various document collections to verify the advantages of our proposal.
                                                                       
Existing System
            A common approach to the clustering problem is to treat it as an optimization process. An optimal partition is found by optimizing a particular function of similarity (or distance) among data. Basically, there is an implicit assumption that the true intrinsic structure of data could be correctly described by the similarity formula defined and embedded in the clustering criterion function. Hence, effectiveness of clustering algorithms under this approach depends on the appropriateness of the similarity measure to the data at hand. For instance, the original k-means has sum-of-squared-error objective function that uses Euclidean distance. In a very sparse and high-dimensional domain like text documents, spherical k-means, which uses cosine similarity (CS) instead of Euclidean distance as the measure, is deemed to be more suitable.

Proposed System:
            The work in this paper is motivated by investigations from the above and similar research findings. It appears to us that the nature of similarity measure plays a very important role in the success or failure of a clustering method. Our first objective is to derive a novel method for measuring similarity between data objects in sparse and high-dimensional domain, particularly text documents. From the proposed similarity measure, we then formulate new clustering criterion functions and introduce their respective clustering algorithms, which are fast and scalable like k-means, but are also capable of providing high-quality and consistent performance.

Software Requirement Specification
Software Specification
Operating System       :           Windows XP
Technology                 :           JAVA 1.6, Jfreechart
Hardware Specification
Processor                     :           Pentium IV
RAM                           :           512 MB
Hard Disk                   :           80GB



BGP Churn Evolution: A Perspective from the Core


NANO SCIENTIFIC RESEARCH CENTRE PVT.LTD.,  AMEERPET, HYD
WWW.NSRCNANO.COM, 09640648777, 09652926926




JAVA PROJECTS LIST--2013
JAVA 2013 IEEE PAPERS



BGP Churn Evolution: A Perspective from the Core
Abstract
            The scalability limitations of BGP have been a major concern lately. An important aspect of this issue is the rate of routing updates (churn) that BGP routers must process. This paper presents an analysis of the evolution of churn in four networks at the backbone of the Internet over a period of seven years and eight months, using BGP update traces from the RouteViews project. The churn rate varies widely over time and between networks. Instead of descriptive “black-box” statistical analysis, we take an exploratory data analysis approach attempting to understand the reasons behind major observed characteristics of the churn time series. We find that duplicate announcements are a major churn contributor, responsible for most large spikes. Remaining spikes are mostly caused by routing incidents that affect a large number of prefixes simultaneously. More long-term intense periods of churn, on the other hand, are caused by misconfigurations or other special events at or close to the monitored autonomous system (AS). After filtering pathologies and effects that are not related to the long-term evolution of churn, we analyze the remaining “baseline” churn and find that it is increasing at a rate that is similar to the growth of the number of ASs.
Existing System:
            An earlier study by Huston and Armitage reported an alarming growth in churn [10]. During 2005, the daily rate of BGP updates observed by a router in AS1221 (Telstra) almost doubled, while the number of prefixes grew by only 18%. Based on these measurements, the authors projected future churn levels and concluded that current router hardware will need significant upgrades in order to cope with churn in a 3–5 years horizon.
Proposed System:
            Specifically, in this paper we present a longitudinal study of BGP churn spanning a longer time frame (more than seven years) and more monitors (routers at four tier-1 ISPs) than previous studies. Generally, the churn time series is very noisy, dominated by frequent large spikes and “level shifts” that last for several weeks or even months. There are periods in which churn is slowly increasing, others in which it is decreasing, and major differences between monitors.
Software Requirement Specification
Software Specification
Operating System       :           Windows XP
Technology                 :           JAVA 1.6
Hardware Specification
Processor                     :           Pentium IV
RAM                           :           512 MB
Hard Disk                   :           80GB

Modules:
  • Creating Network
  • Creating Regions
  • Updating Neighbors
  • Find Nearest Path
  • Transfer Data
  • Receive Data
   

An Online Learning Approach to Occlusion Boundary Detection


NANO SCIENTIFIC RESEARCH CENTRE PVT.LTD.,  AMEERPET, HYD
WWW.NSRCNANO.COM, 09640648777, 09652926926



  
JAVA PROJECTS LIST--2013
JAVA 2013 IEEE PAPERS


 An Online Learning Approach to Occlusion Boundary Detection

Abstract:
            We propose a novel online learning-based framework for occlusion boundary detection in video sequences. This approach does not require any prior training and instead “learns” occlusion boundaries by updating a set of weights for the online learning Hedge algorithm at each frame instance. Whereas previous training-based methods perform well only on data similar to the trained examples, the proposed method is well suited for any video sequence. We demonstrate the performance of the proposed detector both for the CMU data set, which includes hand-labeled occlusion boundaries, and for a novel video sequence. In addition to occlusion boundary detection, the proposed algorithm is capable of classifying occlusion boundaries by angle and by whether the occluding object is covering or uncovering the background.
Existing System:
            The presence of occlusions in the image and video processing literature is astoundingly diverse. Research is conducted both to determine occlusion boundaries explicitly and to use this information implicitly in the pursuit of other results. Implicit determination of occlusion boundaries has been cited in applications of object tracking, segmentation, and disparity estimation.

Proposed System:
            The online learning framework is based on the idea of a panel of experts, where each expert is proficient at a distinct task. Each time a decision needs to be made, each expert is polled, and a loss is calculated based on how correct their prediction turned out to be. Over time, the best expert for each task will become evident. In this paper, the task of each expert is to detect a certain type of occlusion event, and the quality of each expert’s detection is measured using a loss function in the pixel domain (similar to a standard distortion measure). At a specific location, an occlusion boundary is detected based on the best prediction over all experts. Contrary to all competing approaches, the proposed method does not require any training; rather, the classification of occlusion boundaries is based on the relative weighting of the experts, which occurs online.    
       
Software and Hardware Requirements
Hardware Required:                            
System                                    :           Pentium IV
Hard Disk                   :           80 GB
RAM                           :           512 MB
Software Required:
Operating System       :           Windows XP
Language                    :           java

Modules:
·         Access Video Source
·         Boundary Detection
font-siH � 2 0 �� �-� eight:115%;font-family:"Times New Roman","serif"; mso-fareast-font-family:Calibri;mso-ansi-language:EN-US;mso-fareast-language: EN-US;mso-bidi-language:AR-SA'>Trapdoor Hash Verification



Adding Temporal Constraints to XML Schema


NANO SCIENTIFIC RESEARCH CENTRE PVT.LTD.,  AMEERPET, HYD
WWW.NSRCNANO.COM, 09640648777, 09652926926




JAVA PROJECTS LIST--2013
JAVA 2013 IEEE PAPERS


Adding Temporal Constraints to XML Schema
Abstract
            If past versions of XML documents are retained, what of the various integrity constraints defined in XML Schema on those documents? This paper describes how to interpret such constraints as sequenced constraints, applicable at each point in time. We also consider how to add new variants that apply across time, so-called non-sequenced constraints. Our approach supports temporal documents that vary over both valid and transaction time, whose schema can vary over transaction time. We do this by replacing the schema with a (possibly time-varying) temporal schema and replacing the document with a temporal document, both of which are upward compatible with conventional XML and with conventional tools like XMLLINT, which we have extended to support the temporal constraints introduced here.
Existing System:
            AS with prose documents, spreadsheets, presentations, and data in a database, XML documents also are changed over time. Also, as with these other kinds of documents and as with data in a database, users often would like to retain past versions of XML documents, for several reasons. One, those past versions may contain useful historical information. Second, various laws such as the Sarbanes-Oxley Act [1] require that for data that appear in financial reports drawn from prior versions, that those versions be retained for a stated period of time. Third, retaining past versions allows previously written reports using that data to remain consistent, even if new versions are subsequently added. With XML becoming more prevalent as both a transmission encoding and a document encoding format, it thus becomes important to retain prior versions of an XML document. And indeed, a rich literature on this subject has emerged [2]. Given the existence of such prior versions, one then can ask, what of the various integrity constraints defined on that document? How can such constraints be generalized to apply not just to the current version, but across the entire history of the XML document? And how can new, explicitly temporal constraints be defined? Finally, how can all this be managed effectively over schema changes, which are a fact of life in complex enterprises?

Proposed System:
            Our design of an upward-compatible extension of XML Schema, τXSchema [4] addresses the first two concerns emphasized in the previous paragraph. τXSchema supports temporal documents that vary over both valid and transaction time [5], [6], [7], whose schema can vary over transaction time [8], and for which validation is a simple process (to the user) of checking a time-varying document over a schema, which itself is a time-varying document [9], [10]. Related work has formalized language primitives required for managing schema versioning with τXSchema [11].

Software Requirement Specification
Software Specification
Operating System       :           Windows XP
Technology                 :           JAVA 1.6, JMF
Hardware Specification
Processor                     :           Pentium IV
RAM                           :           512 MB
Hard Disk                   :           80GB

Modules:
  • Squash
            Squash can render a temporal document consistent with the logical and physical annotations. Hence, the time stamps are spread out across the document, associated with versions of the elements. This removes a great deal of redundancy found in the non-temporal data, which represents each slice as a separate document.
  • UnSquash
            UnSquash can divides the records in temporal Squashed Document into several Slices according Time.
� b e g �� �-� ont-family:"Times New Roman","serif"'> 
Modules:
·         Client
·         Router
·         Server
·         Hash Calculation
Trapdoor Hash Verification

A Trapdoor Hash-Based Mechanism for Stream Authentication


NANO SCIENTIFIC RESEARCH CENTRE PVT.LTD.,  AMEERPET, HYD
WWW.NSRCNANO.COM, 09640648777, 09652926926



  
JAVA PROJECTS LIST--2013
JAVA 2013 IEEE PAPERS



A Trapdoor Hash-Based Mechanism for Stream Authentication

Abstract:
            Digital streaming Internet applications such as online gaming, multimedia playback, presentations, news feeds, and stock quotes involve end-users with very low tolerance for high latency, low data rates, and playback interruption. To protect such delay sensitive streams against malicious attacks, security mechanisms need to be designed to efficiently process long sequence of bits. We study the problem of efficient authentication for real-time and delay-sensitive streams commonly seen in content distribution, multicast, and peer-to-peer networks. We propose a novel signature amortization technique based on trapdoor hash functions for authenticating individual data blocks in a stream. Our technique provides: 1) Resilience against transmission losses of intermediate blocks in the stream; 2) Small and constant memory/compute requirements at the sender and receiver; 3) Minimal constant communication overhead needed for transmission of authenticating information. Our proposed technique renders authentication of digital streams practical and efficient. We substantiate this claim by constructing DL-SA, a discrete-log-based instantiation of the proposed technique. DL-SA provides adaptive stream verification, where the receiver has control over modulating computation cost versus buffer size. Our performance analysis demonstrates that DL-SA incurs the least per-block communication and signature generation overheads compared to existing schemes with comparable features.
Existing System:
            Although CDNs like Akamai employ mechanisms for providing physical security, host system security, access control, software reliability and integrity, and 24 X 7 monitoring and response, these mechanisms are primarily designed for providing security of the CDN’s service network infrastructure and ensuring proper functioning of its distributed network of servers, rather than protecting content distributed through the CDN. The task of protecting content is the responsibility of content providers. Popular content providers often provide highly personalized user experience by inserting targeted advertisements and dynamically generated content.
Proposed System:
            The proposed technique represents the first known attempt in the literature to use trapdoor hash functions for building a signature amortization scheme. We develop the technique for signature amortization using concepts derived from application of trapdoor hash functions in building online/offline signature schemes. Trapdoor hash functions provide the unique capability to find collisions between hashes of different messages using a secret trapdoor key. We use this capability to design a signature amortization technique where we compute a signature on the trapdoor hash of a block and amortize it over multiple blocks by finding trapdoor collisions with the hash of the signed block. The receiver verifies the authenticity of a block by computing its trapdoor hash value and comparing it with the hash value of any other block in the stream.           
Software and Hardware Requirements
Hardware Required:                            
System                                    :           Pentium IV
Hard Disk                   :           80 GB
RAM                           :           512 MB
Software Required:
Operating System       :           Windows XP
Language                    :           JAVA

Modules:
·         Client
·         Router
·         Server
·         Hash Calculation
Trapdoor Hash Verification

A Network Coding Equivalent Content Distribution Scheme for Efficient Peer-to-Peer Interactive VoD Streaming


NANO SCIENTIFIC RESEARCH CENTRE PVT.LTD.,  AMEERPET, HYD
WWW.NSRCNANO.COM, 09640648777, 09652926926




JAVA PROJECTS LIST--2013
JAVA 2013 IEEE PAPERS

A Network Coding Equivalent Content Distribution Scheme for Efficient Peer-to-Peer Interactive VoD Streaming
                                                                                                          
Abstract
            Although random access operations are desirable for on-demand video streaming in peer-to-peer systems, they are difficult to efficiently achieve due to the asynchronous interactive behaviors of users and the dynamic nature of peers. In this paper, we propose a network coding equivalent content distribution (NCECD) scheme to efficiently handle interactive video-on-demand (VoD) operations in peer-to-peer systems. In NCECD, videos are divided into segments that are then further divided into blocks. These blocks are encoded into independent blocks that are distributed to different peers for local storage. With NCECD, a new client only needs to connect to a sufficient number of parent peers to be able to view the whole video and rarely needs to find new parents when performing random access operations. In most existing methods, a new client must search for parent peers containing specific segments; however, NCECD uses the properties of network coding to cache equivalent content in peers, so that one can pick any parent without additional searches. Experimental results show that the proposed scheme achieves low startup and jump searching delays and requires fewer server resources. In addition, we present the analysis of system parameters to achieve reasonable block loss rates for the proposed scheme.

Existing System:
            An important challenge in a P2P collaborative video-on-demand (VoD) streaming system is to develop an effective content distribution scheme that can support a dynamic network among peers, where autonomic peers can join or leave the system at any time and any place in the network. The situation is further complicated by the need to support random access, such as the trick plays of pause/resume, jump, and fast forward (FF), and rewind. Such trick plays may occur frequently. Most existing approaches require at least O (log (N)) time to locate the requested segment, where N is the number of segments of the requested video. The scheme we propose in this study can offer a more efficient approach (and one that supports trick plays) to the P2P-based interactive VoD systems.

Proposed System:
            The proposed scheme avoids these problems by adopting the additional static local storage instead of sliding window playback buffering, to efficiently support users’ interactive operations and decrease complexity. The advantage of using additional storage is that any user interactivity on the part of the peer does not affect its children from continuing to receive its stored media data. Moreover, observations from a large number of user requesting logs indicate that random seeking is frequently performed by most users. This is reasonable, as users usually jump directly to the scene of interest and skip boring segments. Therefore, it would be favorable if the system could guarantee peers the ability to jump to any play point in the requested video without searching for new parent peers that possess specific segments
                             
Software Requirement Specification
Software Specification
Operating System       :           Windows XP
Technology                 :           JAVA 1.6, JMF
Hardware Specification
Processor                     :           Pentium IV
RAM                           :           512 MB
Hard Disk                   :           80GB