In electrical engineering and computer science image processing is any form of signal processing for which the input is an image.

               In recent years, the exponential growth of Internet users with increased bandwidth requirements has led to the emergence of the next generation of IP routers. Distributed architecture is one of the promising trends providing petabit routers with a large switching capacity and high-speed interfaces. Distributed routers are designed with an optical switch fabric interconnecting line and control cards. Computing and memory resources are available on both control and line cards to perform routing and forwarding tasks. This new hardware architecture is not efficiently utilized by the traditional software models where a single control card is responsible for all routing and management operations. The routing table manager plays an extremely critical role by managing routing information and in particular, a forwarding information table. This article presents a distributed architecture set up around a distributed and scalable routing table manager. This architecture also comes provides improvements in robustness and resiliency. The proposed architecture is based on a sharing mechanism between control and line cards and is able to meet the scalability requirements for route computations, notifications, and advertisements. A comparative scalability evaluation is made between distributed and centralized architectures in terms of required memory and computing resources.

System Requirement Specification:-
DOMAIN     : TRANSACTION ON IMAGE PROCESSING
SOFTWARE : Operating System: Windows XP, Platform:DOTNET , Protocol:UDP
HARDWARE : Processor: Pentium-IV,Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

           Steganography is the science of embedding information into the cover image viz., text, video, and image (payload) without causing statistically significant modification to the cover image. The modern secure image steganography presents a challenging task of transferring the embedded information to the destination without being detected. In this paper we present an image-based steganography that combines Least Significant Bit (LSB), Discrete Cosine Transform (DCT), and compression techniques on raw images to enhance the security of the payload. Initially, the LSB algorithm is used to embed the payload bits into the cover image to derive the stego-image.

System Requirement Specification:-
DOMAIN     : IMAGE PROCESSING
SOFTWARE : Operating System: Windows xp , Platform: JAVA, Back end: Ms Accessl
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

                 We propose an appearance-based face recognition method called the Laplacianface approach. By using Locality Preserving Projections (LPP), the face images are mapped into a face subspace for analysis. Different from Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA), which effectively see only the Euclidean structure of face space, LPP finds an embedding that preserves local information, and obtains a face subspace that best detects the essential face manifold structure. The Laplacianfaces are the optimal linear approximations to the eigenfunctions of the Laplace Beltrami operator on the face manifold. In this way, the unwanted variations resulting from changes in lighting, facial expression, and pose may be eliminated or reduced. Theoretical analysis shows that PCA, LDA, and LPP can be obtained from different graph models. We compare the proposed Laplacianface approach with Eigenface and Fisher face methods on three different face data sets. Experimental results suggest that the proposed Laplacianface approach provides a better representation and achieves lower error rates in face recognition.

System Requirement Specification:-
DOMAIN     : IMAGE PROCESSING
SOFTWARE : Operating System: Windows xp, Platform:JAVA
HARDWARE : Processor: Pentium-IV,Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

             Image compression usually considers the minimization of storage space as its main objective. It is desirable, however, to code images so that we have the ability to process the resulting representation directly. In this thesis we explore an approach to document image compression that is efficient in both space (storage requirement) and time (processing flexibility). Image processing allows you to modify the appearance of an image by applying various types of filters, scaling options or transformations. The simplest type of processing is linear scaling. With linear scaling, one pixel from the source image is multiplied by a scale factor, and then an offset term is added. The original pixel value is then replaced with the resulting value. This process is repeated on each pixel in the image. Images account for a significant and growing fraction of Web downloads. The traditional approach to transporting images uses TCP, which provides a generic reliable, in-order byte-stream abstraction, but which is overly restrictive for image data. We analyze the progression of image quality at the receiver with time and show that the in-order delivery abstraction provided by a TCP-based approach prevents the receiver application from processing and rendering portions of an image when they actually arrive. The end result is that an image is rendered in bursts interspersed with long idle times rather than smoothly.

System Requirement Specification:-
DOMAIN     : IMAGE PROCESSING
SOFTWARE : Operating System: windows xp Platform:JAVA
HARDWARE : Processor:Pentium-IV Speed: 1.8 GHZ ,RAM: 512 MB ,HDD: 80 GB

              A mobile ad hoc network consists of wireless hosts that may move often.Movement of hosts results in a change in routes,requiring some mechanism for determining new routes.Several routing protocols have already been proposed for ad hoc networks. The paper suggests an approach to utilize location information(for instance,obtained using the global positioning System)to improve performance of routing protocol for ad hoc networks. By using location information.the proposed location-Aided Routing (LAR) protocols limit the search for a new route to a smaller �reguest zone� of the ad hoc network.This results in a significant reduction in the number of routing messages. We present two algorithms to determine the request zone,and suggest potential optimizations to our algorithms.

System Requirement Specification:-
DOMAIN     :  AD-HOC NETWORK
SOFTWARE : Operating System: windows xp ,Platform: JAVA, Protocol:IPV6, Back End: Ms-
                  access
HARDWARE : Processor: Pentium-IV, Speed:1.8 GHZ ,RAM: 512 MB , HDD: 80 GB