977 research outputs found

    Object-based video representations: shape compression and object segmentation

    Get PDF
    Object-based video representations are considered to be useful for easing the process of multimedia content production and enhancing user interactivity in multimedia productions. Object-based video presents several new technical challenges, however. Firstly, as with conventional video representations, compression of the video data is a requirement. For object-based representations, it is necessary to compress the shape of each video object as it moves in time. This amounts to the compression of moving binary images. This is achieved by the use of a technique called context-based arithmetic encoding. The technique is utilised by applying it to rectangular pixel blocks and as such it is consistent with the standard tools of video compression. The blockbased application also facilitates well the exploitation of temporal redundancy in the sequence of binary shapes. For the first time, context-based arithmetic encoding is used in conjunction with motion compensation to provide inter-frame compression. The method, described in this thesis, has been thoroughly tested throughout the MPEG-4 core experiment process and due to favourable results, it has been adopted as part of the MPEG-4 video standard. The second challenge lies in the acquisition of the video objects. Under normal conditions, a video sequence is captured as a sequence of frames and there is no inherent information about what objects are in the sequence, not to mention information relating to the shape of each object. Some means for segmenting semantic objects from general video sequences is required. For this purpose, several image analysis tools may be of help and in particular, it is believed that video object tracking algorithms will be important. A new tracking algorithm is developed based on piecewise polynomial motion representations and statistical estimation tools, e.g. the expectationmaximisation method and the minimum description length principle

    Segmentation-based mesh design for motion estimation

    Get PDF
    Dans la plupart des codec vidĂ©o standard, l'estimation des mouvements entre deux images se fait gĂ©nĂ©ralement par l'algorithme de concordance des blocs ou encore BMA pour « Block Matching Algorithm ». BMA permet de reprĂ©senter l'Ă©volution du contenu des images en dĂ©composant normalement une image par blocs 2D en mouvement translationnel. Cette technique de prĂ©diction conduit habituellement Ă  de sĂ©vĂšres distorsions de 1'artefact de bloc lorsque Ie mouvement est important. De plus, la dĂ©composition systĂ©matique en blocs rĂ©guliers ne dent pas compte nullement du contenu de l'image. Certains paramĂštres associes aux blocs, mais inutiles, doivent ĂȘtre transmis; ce qui rĂ©sulte d'une augmentation de dĂ©bit de transmission. Pour paillier a ces dĂ©fauts de BMA, on considĂšre les deux objectifs importants dans Ie codage vidĂ©o, qui sont de recevoir une bonne qualitĂ© d'une part et de rĂ©duire la transmission a trĂšs bas dĂ©bit d'autre part. Dans Ie but de combiner les deux exigences quasi contradictoires, il est nĂ©cessaire d'utiliser une technique de compensation de mouvement qui donne, comme transformation, de bonnes caractĂ©ristiques subjectives et requiert uniquement, pour la transmission, l'information de mouvement. Ce mĂ©moire propose une technique de compensation de mouvement en concevant des mailles 2D triangulaires a partir d'une segmentation de l'image. La dĂ©composition des mailles est construite a partir des nƓuds repartis irrĂ©guliĂšrement Ie long des contours dans l'image. La dĂ©composition rĂ©sultant est ainsi basĂ©e sur Ie contenu de l'image. De plus, Ă©tant donnĂ© la mĂȘme mĂ©thode de sĂ©lection des nƓuds appliquĂ©e Ă  l'encodage et au dĂ©codage, la seule information requise est leurs vecteurs de mouvement et un trĂšs bas dĂ©bit de transmission peut ainsi ĂȘtre rĂ©alise. Notre approche, comparĂ©e avec BMA, amĂ©liore Ă  la fois la qualitĂ© subjective et objective avec beaucoup moins d'informations de mouvement. Dans la premier chapitre, une introduction au projet sera prĂ©sentĂ©e. Dans Ie deuxiĂšme chapitre, on analysera quelques techniques de compression dans les codec standard et, surtout, la populaire BMA et ses dĂ©fauts. Dans Ie troisiĂšme chapitre, notre algorithme propose et appelĂ© la conception active des mailles a base de segmentation, sera discute en dĂ©tail. Ensuite, les estimation et compensation de mouvement seront dĂ©crites dans Ie chapitre 4. Finalement, au chapitre 5, les rĂ©sultats de simulation et la conclusion seront prĂ©sentĂ©s.Abstract: In most video compression standards today, the generally accepted method for temporal prediction is motion compensation using block matching algorithm (BMA). BMA represents the scene content evolution with 2-D rigid translational moving blocks. This kind of predictive scheme usually leads to distortions such as block artefacts especially when the motion is important. The two most important aims in video coding are to receive a good quality on one hand and a low bit-rate on the other. This thesis proposes a motion compensation scheme using segmentation-based 2-D triangular mesh design method. The mesh is constructed by irregularly spread nodal points selected along image contour. Based on this, the generated mesh is, to a great extent, image content based. Moreover, the nodes are selected with the same method on the encoder and decoder sides, so that the only information that has to be transmitted are their motion vectors, and thus very low bit-rate can be achieved. Compared with BMA, our approach could improve subjective and objective quality with much less motion information."--RĂ©sumĂ© abrĂ©gĂ© par UM

    MASCOT : metadata for advanced scalable video coding tools : final report

    Get PDF
    The goal of the MASCOT project was to develop new video coding schemes and tools that provide both an increased coding efficiency as well as extended scalability features compared to technology that was available at the beginning of the project. Towards that goal the following tools would be used: - metadata-based coding tools; - new spatiotemporal decompositions; - new prediction schemes. Although the initial goal was to develop one single codec architecture that was able to combine all new coding tools that were foreseen when the project was formulated, it became clear that this would limit the selection of the new tools. Therefore the consortium decided to develop two codec frameworks within the project, a standard hybrid DCT-based codec and a 3D wavelet-based codec, which together are able to accommodate all tools developed during the course of the project
    • 

    corecore