M Tech Dissertations

Permanent URI for this collectionhttp://ir.daiict.ac.in/handle/123456789/3

Browse

Search Results

Now showing 1 - 3 of 3
  • ItemOpen Access
    Object-background segmentation from video
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2015) Domadiya, Prashant; Mitra, Suman K.
    Fast and accurate algorithms for background-foreground separation are an essential part of

    any video surveillance system. GMM (Gaussian Mixture Models) based object segmentation

    methods give accurate results for background-foreground separation problems but are

    computationally expensive. In contrast, modeling with only single Gaussian improves the

    time complexity with the reduction in the accuracy due to variations in illumination and

    dynamic nature of the background. It is observed that these variations affect only a few

    pixels in an image. Most of the background pixels are unimodal. We propose a method

    to account for the dynamic nature of the background and low lighting conditions. It is an

    adaptive approach where each pixel is modeled as either unimodal Gaussian or multimodal

    Gaussians. The flexibility in terms of number of Gaussians used to model each pixel, along

    with learning when it is required approach reduces the time complexity of the algorithm

    significantly. To resolve problems related to false negative due to the homogeneity of color

    and texture in foreground and background, a spatial smoothing is carried out by K-means,

    which improves the overall accuracy of proposed algorithm. The shadow causes the problem

    in many applications which rely on segmentation results. Shadow cause variation in

    RGB values of pixels, RGB value dependent GMM based method can’t remove shadow

    from detection results. The preprocessing stage involving illumination invariant representation

    takes care of the object shadow as well.

  • ItemOpen Access
    Development of difference detection algorithm for surveillance video compression
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2011) Marvaniya, Hitul D.; Banerjee, Asim
    Video surveillance is widely used tool in today’s era for improving public and residential safety. Here the size of the video data is much higher due to large number of surveillance cameras scattered over large area and data needs to be saved for longer time. Thus various compression schemes needs to be implemented to reduce the size of the data. Currently H.264/AVC is widely used as a compression for video surveillance. The computational complexity of H.264/AVC is higher. So the surveillance system is going to be computationally complex and more time consuming. The difference detection algorithm is working as a preprocessing module before video encoder to reduce the complexity of video compression. As proposed algorithm is completely independent from compression module of H.264, it has high adaptability to work with any existing H.264 video encoder to save the cost of implementation.
  • ItemOpen Access
    Performance analysis of MPEG traffic under deficit round Robin Scheduler
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2004) Bavishi, Hardik N.; Jotwani, Naresh D.
    The use of network multimedia applications like Video Conferencing and Video-on-Demand is likely to increase tremendously in future. Bandwidth, delay and delay variation are important performance parameters in such multimedia applications. The multimedia traffic, typically bursty in nature, can be represented by MPEG traffic. MPEG being one of the most popular video-encoding standards, the MPEG traffic will have to be very carefully handled by the network so as to satisfy its performance requirements. Scheduling is a key mechanism in packet-switching networks. Performance achieved by an application depends on how its traffic is treated along its path through the network. When packets of traffic belonging to an application are waiting for transmission at an intermediate node, the scheduler at the node decides their order of transmission. During congestion, the scheduler decides which packets to drop. Thus the scheduler decides how the network resources (link bandwidth and buffer space) are shared among the flows. Fair schedulers are those, which allow fair sharing of these resources among the flows. Deficit Round Robin (DRR) is one such popular and efficient fair scheduler. The main performance parameters of interest are delay and delay variation. We identify and define the factors that impact performance achieved by a flow under DRR. We design simulation experiments based on the identified factors to understand and analyze the effects of the factors on performance. Based on this we analyze performance of the MPEG traffic under DRR scheduler in presence of best-effort traffic. DRR++ is a modification of DRR to handle bursty latency critical traffic preferentially in the presence of the best-effort traffic. We also obtain similar simulation results for DRR++ to understand the improvement in performance achieved by the MPEG traffic.