applications. Image filtering is not only used to improvethe image quality but also is used as a preprocessing stagein many applications including image encoding, patternrecognition, image compression and target tracking, toname a few. This preprocessing stage is essential in mostof the image-processing algorithm and improper noisefiltering may result in inappropriate or even false outcome.Different methods have been proposed for the purpose of noise filtering. .1.
Select three videos which contain three differentnoises like -Salt and pepper noise/ Gaussian noise/periodic noise.2.
Convert videos to Frames.3.
Apply various filters in the noise generated frames4.
Identify the best suited filter using the PSNR andMSE
Use the resultant frames for further processing
From the results obtained we conclude that with threedifferent noises salt and pepper noise, Gaussian noise and periodic noise applied for denoising of the spatial video produces variant results over different filtered techniques.From the results obtained using various filtering techniques itis observed that for salt and pepper noise median and rank order filter works better than other techniques. In case of Gaussian noise Weiner and rank order filter works fine. For Periodic noise 2D filter works better than other filters.
Segmentation is the method of partitioning a digital imageinto multiple segments (sets of pixels, also known as super pixels). The goal of segmentation is to make simpler and/or change the representation of an image into something that ismore meaningful and easier to analyze. Imagesegmentation is characteristically used to trace objects and boundaries (lines, curves, etc.) in images.
Approximate median segmentation
Approximate median method uses a recursive method for estimating a background model. Each pixel in the backgroundmodel is compared to the corresponding pixel in the currentframe, to be incremented by one if the new pixel is larger thanthe background pixel or decremented by one if smaller. A pixel in the background model effectively converges to a valuewhere half of the incoming pixels are larger than and half aresmaller than its value. This value is known as the median.
1. Assign the variables move to the input video, n frames tothe number of frames, set the threshold value to 25 and movethe frames one by one to the n (i).cdata.2. Read the 1st background frame as bg=n(1).cdata andconvert it into gray scale3. set the frame size variables fr-size to the size of the background frame and width and height corresponding to thefr_size.4. convert all the frames into grayscale and type cast theoperands as double to avoid negative overflowUsing fr_diff = abs (double (fr_bw) - double(bg_bw));5. If fr_diff (frame difference) of the considered frame isgreater than the threshold pixel in the foreground thenincrement background value else decrement the background pixel value.6. Continue step 5 for all width varying from 1 and heightvarying from 1.7. Display the result using plot and imshow frame.8. If needed save the output as movie.
The feature is defined as a function of one or moremeasurements, each of which specifies some quantifiable property of an object, and is computed such that it quantifiessome significant characteristics of the object. .Feature Extraction plays a major role to detect the movingobjects in sequence of frames. Every object has a specificfeature like color or shape. In a sequence of frames, any one of the feature is used to detect the objects in the frame. 
Bounding Box with Color Feature
If the segmentation is performed using frame difference, theresidual image is visualized with rectangular bounding boxwith the dimensions of the object produced from residualimage. For a given image, a scan is performed where theintensity values of the image are more than limit (depends onthe assigned value, for accurate assign maximum). In thisFeatures is extracted by colour and here the intensity valuedescribes the color. The pixel values from the first hit of theintensity values from top, bottom, left and right are stored. Byusing this dimension values a rectangular bounding box is plotted within the limits of the values produced.
Algorithm for Bounding Box:
Read the Image difference2.
For (pres pos=int value: final Value)of y resolution3.
For (pres pos=int value: final Value)of x resolutiona.
Calc the sharp change in intensity of image fromtop and bottom b.
Store the values in an array4.
Height of the bounding box is = bottom value – topvalue5.
For (pres pos=int value: final Value)of x resolution
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 11, No. 4, April 2013104http://sites.google.com/site/ijcsis/ISSN 1947-5500