Fast disparity motion estimation in mvc based on range prediction
This presentation is the property of its rightful owner.
Sponsored Links
1 / 16

Fast disparity motion estimation in MVC based on range prediction PowerPoint PPT Presentation


  • 103 Views
  • Uploaded on
  • Presentation posted in: General

Fast disparity motion estimation in MVC based on range prediction. Xiao Zhong Xu, Yun He ICIP 2008. Outline. Disparity estimation in MVC Disparity search range decision Search range reduction Experimental Results Conclusion. Analysis(1/3). Disparity of two views is decided by

Download Presentation

Fast disparity motion estimation in MVC based on range prediction

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Fast disparity motion estimation in mvc based on range prediction

Fast disparity motion estimation in MVC based on range prediction

Xiao Zhong Xu, Yun He

ICIP 2008


Outline

Outline

  • Disparity estimation in MVC

  • Disparity search range decision

  • Search range reduction

  • Experimental Results

  • Conclusion


Analysis 1 3

Analysis(1/3)

  • Disparity of two views is decided by

    • distance between objects and cameras

    • displacement between two cameras

  • Disparity could be 30~50 pixels for background and up to 100 pixels for foreground

40pixels

75pixels


Analysis 2 3

Analysis(2/3)

  • The directions of disparity are identicalfor all blocks as long as the relative positions between cameras are not changed.

    • Global disparity vector

  • The majority of encoding time is consumed by motion estimation(ME) and disparity estimation(DE).

  • Over 99% encoding time is spent on ME and DE for full search.


Analysis 3 3

Analysis(3/3)

  • Comparison of corresponding bitrate reduction using different search ranges

    • Search range(SR) = ±16,QP=22/27/32/37

    • The larger search range is, the more bitrate can be saved.

    • computation time increases as well


Mvc motion skip mode 1 2

MVC Motion skip mode (1/2)

  • Proposed by LG Co., JVT-W081(April, 2007).

  • Motion information of current MB can be inferred from the corresponding MB in the picture with the same temporal index of the neighboring view.

    • mb_type

    • motion vector (MV)

    • reference indices


Mvc motion skip mode 2 2

MVC Motion skip mode (2/2)

  • Two main stages

    • Search for corresponding MB

      • Global disparity vector (by using SAD) is used.

    • Derivation of motion information

      • Comparing all the MB mode results, and then choose the best.


Disparity map storage

Disparity map storage

  • Disparities of temporal static objects will be the same of the same view.

  • For disparity prediction, the disparity map is stored.

  • After encoding inter-view picture, the disparity map is then refreshed by the disparities of the current picture.

  • The disparity map of the current picture is recorded as a disparity predictor.

Disparity estimation

Input picture

Disparity map


Local disparity feature decision

Local disparity feature decision

  • Three already obtained disparity are used:

    • Co-located MB in the disparity map (dis_col)

    • The disparity of the current 16*16 block (dis_16)

    • The disparity predicted by spatial neighboring blocks (dis_pred)

  • In 16*16 mode, dis_16 is set to 0.


Disparity intensity

Disparity intensity

  • Disparity intensity:

  • Categorizing the current block into 3 different modes:

    • Low disparity mode – background (DV < 2)

    • High disparity mode – foreground (DV > 3)

    • Intermediate disparity mode (other cases)


Search range reduction 1 2

Search range reduction(1/2)

  • The directions of disparity are identical for all blocks

    • Symmetrical search window is redundant.

    • Once global disparity directionis detected, the opposite direction could be paid less attention to.

  • Global disparity: summing up the already obtained disparity vectors and check its sign.


Search range reduction 2 2

Search range reduction(2/2)

  • Using an unsymmetrical window.

    • 4 directional factors, 2 scale factors:

    • Negative vertical scale (NVS)

    • Positive vertical scale (PVS)

    • Negative horizontal scale (NHS)

    • Positive horizontal scale (PHS)

    • Vertical scale (VS)

    • Horizontal scale (HS)

Initial search window

Global disparity direction

±16pixel

NVS

NVS

4 pixel

directional factors

  • Global disparity is positive:

  • PVS = VS (PHS=HS)

  • Global disparity is negative:

  • NVS=VS (NHS=HS)

new search window

±16pixel

2 pixel

8 pixel

NHS

NHS

PHS

PHS

4 pixel

  • search range:

PVS

scale factors

PVS


Simulation results 1 3

Simulation results(1/3)

  • Only inter-view prediction is allowed.

Time

  • Initial search range = ±96

  • QP=22,27,32,37

  • 50 frames are coded in each view

  • Sequence resolution: 640*480

I

I

I

I

P

P

P

P

View


Simulation results 2 3

Simulation results(2/3)

  • ISRP: Inter-view search range prediction

  • JMVM uses extended diamond search

  • DE speedup comparison:


Simulation results 3 3

Simulation results(3/3)

  • Encoding time comparison of DE:

    • The rest parts of encoder are recognized as 1 unit.


Conclusion

Conclusion

  • Combination of ISRP and JMVM performs well.

  • Search range of disparity is properly reduced.

  • retaining certain quality while significantly improving encoding speed of MVC.


  • Login