IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i5p247931.html
   My bibliography  Save this article

Adaptive Multihypothesis Prediction Algorithm for Distributed Compressive Video Sensing

Author

Listed:
  • Jinxiu Zhu
  • Ning Cao
  • Yu Meng

Abstract

A novel adaptive multihypothesis (MH) prediction algorithm for distributed compressive video sensing (DCVS) is proposed in this paper. In the proposed framework, consistent block-based random measurement for each video frame is adopted at the encoder independently. Meanwhile, a mode decision algorithm is applied in CS-blocks via block-based correlation measurements at the decoder. The inter-frame MH mode is selected for the current block wherein the interframe correlation coefficient value exceeds a predetermined threshold. Otherwise, the intraframe MH mode is worthwhile to be selected. Moreover, the adaptive search window and cross-diamond search algorithms on measurement domain are also incorporated to form the dictionary for MH prediction. Both the temporal and spatial correlations in video signals are exploited to enhance CS recovery to satisfy the best linear combination of hypotheses. The simulation results show that the proposed framework can provide better reconstruction quality than the framework using original MH prediction algorithm, and for sequences with slow motion and relatively simple scene composition, the proposed method shows significant performance gains at low measurement subrate.

Suggested Citation

  • Jinxiu Zhu & Ning Cao & Yu Meng, 2013. "Adaptive Multihypothesis Prediction Algorithm for Distributed Compressive Video Sensing," International Journal of Distributed Sensor Networks, , vol. 9(5), pages 247931-2479, May.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:5:p:247931
    DOI: 10.1155/2013/247931
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/247931
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/247931?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:5:p:247931. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.