CN102547338A - DIBR (Depth Image Based Rendering) system suitable for 3D (Three-Dimensional) television - Google Patents

DIBR (Depth Image Based Rendering) system suitable for 3D (Three-Dimensional) television Download PDF

Info

Publication number
CN102547338A
CN102547338A CN2011103970275A CN201110397027A CN102547338A CN 102547338 A CN102547338 A CN 102547338A CN 2011103970275 A CN2011103970275 A CN 2011103970275A CN 201110397027 A CN201110397027 A CN 201110397027A CN 102547338 A CN102547338 A CN 102547338A
Authority
CN
China
Prior art keywords
pixel
macroscopic
target image
void
ref
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN2011103970275A
Other languages
Chinese (zh)
Other versions
CN102547338B (en
Inventor
刘然
谭迎春
谢辉
田逢春
邰国钦
郭瑞丽
刘军令
罗雯怡
刘阳
鲁国宁
许小艳
黄扬帆
甘平
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University
Sichuan Hongwei Technology Co Ltd
Original Assignee
Chongqing University
Sichuan Hongwei Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chongqing University, Sichuan Hongwei Technology Co Ltd filed Critical Chongqing University
Priority to CN 201110397027 priority Critical patent/CN102547338B/en
Publication of CN102547338A publication Critical patent/CN102547338A/en
Application granted granted Critical
Publication of CN102547338B publication Critical patent/CN102547338B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a DIBR (Depth Image Based Rendering) system suitable for a 3D (Three-Dimensional) television. A parameter setting module is used for storing parameters required for 3D image conversion and hole filling, and then, a painter's algorithm module is used for obtaining a scanning sequence during 3D image conversion, namely, the drawing sequence of a target image, so as to prevent a fold phenomenon occurring in the target image; a 3D image conversion module is use for carrying out 3D image conversion according to the parameters stored by the parameter setting module and the scanning sequence to obtain the target image and a disparity map of the target image; a median filter module is used for filtering the disparity map and then correcting a matching error of the target image according to the corrected disparity map; and finally, a hole filling module is used for filling holes for the target image according to the corrected disparity map so as to obtain the target image with reduced holes and folds.

Description

A kind of DIBR system that is applicable to the 3D TV
Technical field
The invention belongs to 3D television video post-processing technology field, more specifically, relate to a kind of DIBR system of the 3D of being applicable to TV
Background technology
Drawing (Depth-Image-Based Rendering is called for short DIBR) technology based on depth image is the key technology in the 3D television system, has caused the concern of a lot of research institutions.
The function that the DIBR system mainly accomplishes is to utilize reference picture and corresponding depth image thereof to synthesize the view of new viewpoint; Be target image (Destination Image); Thereby constitute stereo-picture to (stereo pair), its resulting target image is the postrun result of series of algorithms.
Need transmit left eye and right eye two-path video stream during traditional 3D video signal transmission, and only need transmission of one line video flowing and corresponding depth information, thereby can reduce transmission bandwidth based on the 3D television system of DIBR technology.Simultaneously, adopt the DIBR technology can realize the conversion of 2D-3D video easily, support various auto-stereoscopic displays easily.Just because of these advantages, at present a lot of scientific research institutions are all in research DIBR technology.For example, the Nerola system is the 3D television system of the present business-like DIBR of having function.
Yet present DIBR system can produce cavity (Holes) and fold (Folds) phenomenon when generating target image.Eliminate cavity and fold and be and improve the quality of synthesizing view, make it move towards the key of practicability.
Summary of the invention
The objective of the invention is to overcome the deficiency of prior art, a kind of DIBR system of the 3D of being applicable to TV is provided, this system can reduce the pseudomorphism that brings because of empty and fold preferably.
For realizing above-mentioned purpose, the present invention is applicable to the DIBR system of 3D TV, it is characterized in that, comprising:
One parameter is provided with module, is used to deposit the 3-D view conversion and fills required parameter, i.e. the sequence number n of target image with the cavity; N is an integer, and span is [4,4]; N=0 representes reference-view itself, and n<0 expression target image is positioned at the reference picture left side, is left view; N>0 expression target image is positioned at the reference picture right side, is right view; Proportional factor r, its span are [0,1542]; Parallax free plane corresponding gray scale value D Zps, its span is [0,255]; The threshold value len_bighole that counts, its span is [0,7]; Expansion pixel number l, its span is [0,7];
One painter's algorithm module meets target image sequence n, when being used for confirming the 3-D view conversion, to the scanning sequency of reference picture; N<0 expression target image is positioned at the reference picture left side, and n>0 expression target image is positioned at the reference picture right side;
When target image was positioned at the reference picture right side, scanning sequency was for from left to right, from top to bottom; When target image was positioned at the reference picture left side, scanning sequency was for from right to left, from top to bottom;
The 3-D view conversion module is used for being provided with according to parameter parameter, scanning sequency and the depth image of module stores, to the reference picture I of input RefCarry out three-dimension varying:
According to the scanning sequency that the painter's algorithm module is confirmed, traversal reference picture I RefIn pixel, and once handle, for reference picture I RefIn v RefRow u RefThe pixel u of row Ref, at first calculate it at target image I according to formula (1) DesMiddle corresponding matched pixel point u DesWherein
u des - u ref = n · r 4096 · ( D zps - D ( u ref , v ref ) ) v des = v ref , - - - ( 1 )
Wherein, u Ref, v RefBe respectively reference picture I in the image pixel coordinate system RefThe horizontal coordinate of pixel and vertical coordinate, u Des, v DesBe respectively target image I in the image pixel coordinate system DesIn the horizontal coordinate of corresponding reference picture pixel, D (u Ref, v Ref) expression depth image in pixel (u Ref, v Ref) gray value;
Then, pixel u RefPixel value copy pixel u to Des, with the element (u among the disparity map M Ref, v Ref) be changed to u Des-u Ref
Obtain target image I at last DesAnd disparity map M;
One medium filtering module is used to receive 3-D view conversion export target image I DesAnd disparity map M, carry out following processing then: (1), disparity map M is carried out medium filtering; (2), according to filtered disparity map M, obtain target image I DesPixel is at reference picture I RefOn the match point coordinate; (3), judge whether the match point coordinate drops on reference picture I RefIn, if, then with reference picture I RefThe pixel value at last match point coordinate place copies target image I to DesCorrespondence position, otherwise, do not handle;
One empty packing module is used to receive disparity map M and the target image I that the medium filtering submodule is exported DesAnd scanning sequency and the parameter exported according to the painter's algorithm module are provided with the parameter in the module, filling target image I DesThe middle cavity that exists:
(1), detects than macroscopic-void
With from left to right order traversal disparity map M,, then think it is here by row, note this starting point and terminal point than macroscopic-void than macroscopic-void if occur threshold value count len_bighole and above empty point continuously;
(2), expand than macroscopic-void
According to the scanning sequency of painter's algorithm module output, distinguish target image I DesBe left view or right view, if left view, execution in step a); Like figure is right view, execution in step b);
A), at first distinguishing than the macroscopic-void fringe region is background pixel point or foreground pixel point: among the disparity map M being the center than the macroscopic-void zone; The parallax value that detects from left to right than the non-cavity of macroscopic-void right hand edge point changes; When parallax value transition occurs for the first time at two in succession non-empty some places; And transition is when smaller value jumps to higher value, is the background pixel point than macroscopic-void right hand edge zone, and notes this big parallax value and put parallax value as foreground pixel; When parallax value transition occurs for the first time at two in succession non-empty some places; And transition is to jump to smaller value from higher value; Perhaps parallax value is consistent when not having transition; Than macroscopic-void right hand edge zone is the foreground pixel point, and notes the parallax value of putting in first non-cavity and put parallax value as foreground pixel;
Empty edge then expands: if be the background pixel point than macroscopic-void right hand edge zone; Be the matching error zone then than the macroscopic-void left and right edges; Need expand, will deduct l pixel and terminal point abscissa than the starting point abscissa of macroscopic-void and add starting point and the terminal point of l pixel as the cavity that needs in the target image to fill; If than macroscopic-void right hand edge zone is the foreground pixel point; Then the left hand edge than macroscopic-void is the matching error zone; Only expand, will deduct l pixel and terminal point than the starting point abscissa of macroscopic-void and remain unchanged as the starting point and the terminal point in the cavity that needs in the target image to fill than the left hand edge of macroscopic-void;
B), at first distinguishing than the macroscopic-void fringe region is background pixel point or foreground pixel point: in the disparity map being the center than the macroscopic-void zone; The parallax value that detects from right to left than the non-cavity of macroscopic-void left hand edge point changes; When parallax value transition occurs for the first time at two in succession non-empty some places; And transition is when higher value jumps to smaller value, is the background pixel point than macroscopic-void left hand edge zone, and notes this less parallax value and put parallax value as foreground pixel; When parallax value transition occurs for the first time at two in succession non-empty some places; And transition is to jump to higher value from smaller value; Perhaps parallax value is consistent does not have transition; Than macroscopic-void left hand edge zone is the foreground pixel point, and notes the parallax value of putting in first non-cavity and put parallax value as foreground pixel;
Expand then than the macroscopic-void edge: if be the background pixel point than macroscopic-void left hand edge zone; Be the matching error zone then than the macroscopic-void left and right edges; Need expand, will deduct l pixel and terminal point abscissa than the starting point abscissa of macroscopic-void and add starting point and the terminal point of l pixel as the cavity that needs in the target image to fill; If than macroscopic-void left hand edge zone is the foreground pixel point; Then the right hand edge than macroscopic-void is the matching error zone; Only expand, will remain unchanged than the starting point of macroscopic-void and the terminal point abscissa adds that l pixel is as the starting point and the terminal point that need the cavity of filling in the target image than the right hand edge of macroscopic-void;
In this step (2), the pixel number l of expansion is the number of mistake matched pixel point, and is relevant with the accuracy that depth image is estimated, can regulate according to the target image quality that generates, and span is 0-7;
(3), fill than macroscopic-void
With target image I DesThe middle starting point in the cavity of filling, the parallax value that the terminal point abscissa all deducts foreground pixel point of needing, obtaining need be at reference picture I RefIn the pixel zone of duplicating, then, from reference picture I RefIn duplicate this regional pixel and be filled into target image I DesThe middle hole region that needs filling obtains the final objective image I Des
Goal of the invention of the present invention is achieved in that
The present invention is applicable to the DIBR system of 3D TV; Through parameter module being set stores 3-D view conversion and the cavity required parameter of filling; Obtain the scanning of 3-D view conversion then through the painter's algorithm module; Be the drawing order of target image, with the fold phenomenon of avoiding occurring in the target image; The 3-D view conversion module carries out the 3-D view conversion according to parameter and scanning sequency that parameter is provided with module stores, obtains target image and disparity map thereof; The medium filtering module is carried out filtering to disparity map; According to the disparity map after proofreading and correct the matching error of target image is proofreaied and correct then, last, empty packing module is according to proofreading and correct disparity map; Target image is carried out the cavity fill, obtain the target image that cavity and fold reduce.
Description of drawings
Fig. 1 is the DIBR system one embodiment theory diagram that the present invention is applicable to the 3D TV.
Embodiment
Describe below in conjunction with the accompanying drawing specific embodiments of the invention, so that those skilled in the art understands the present invention better.What need point out especially is that in the following description, when perhaps the detailed description of known function and design can desalinate main contents of the present invention, these were described in here and will be left in the basket.
Fig. 1 is the DIBR system one embodiment theory diagram that the present invention is applicable to the 3D TV;
As shown in Figure 1, in the present embodiment, be applicable to that the DIBR system of 3D TV comprises that degree of depth pretreatment module 1, parameter are provided with module 2, painter's algorithm module 3,3-D view conversion module 4, medium filtering module 5 and empty packing module 6.
Degree of depth pretreatment module 1 is used for depth image D is carried out smoothing processing, and to reduce the cavity of target image, its processing mode can have several different methods, like 4 neighborhood calculating etc.
It is the whole DIBR of completion systems that parameter is provided with module 2 functions, comprises each module parameter setting.Why DIBR of the present invention system is placed on a module with all parameters is provided with, and is because the distribution of this corresponding register address of parameter when helping hardware and realizing.The new target image of each drafting, the DIBR system all can first call parameters be provided with module.This moment, the user can be arranged to identical value last time with parameter, promptly kept parameter value constant, also can change some parameter value as required.To same width of cloth target image, its employed parameter of each pixel all is the same; And different target images, employed parameter value can be inequality.
Parameter is provided with module 2 and deposits the required parameter of 3-D view conversion: the sequence number n of target image, n are integer, and span is [4,4], and n=0 representes reference-view itself, and n<0 expression target image is positioned at the reference picture left side, is left view; N>0 expression target image is positioned at the reference picture right side, is right view; Proportional factor r, its span are [0,1542]; Parallax free plane corresponding gray scale value D Zps, its span is [0,255].Required parameter is filled in the cavity: the threshold value len_bighole that counts, and its span is [0,7]; Expansion pixel number l, its span is [0,7]; Parallax value transition threshold value sharp_th, this value is used for fill judging that in the cavity higher value jumps to smaller value or smaller value jumps to higher value, surpasses this parallax value transition threshold value sharp_th and think that then transition is arranged.
In the present invention, the 3-D view transformation for mula is:
u des - u ref = n · r 4096 · ( D zps - D ( u ref , v ref ) ) v des = v ref , - - - ( 1 )
Wherein, n is an integer, the sequence number of the target image of indicating to generate, and span is [4,4] in DIBR of the present invention system.N=0 representes reference-view itself; N<0 expression target image is positioned at the reference picture left side, is left view; N>0 expression target image is positioned at the reference picture right side, is right view.R is a scale factor, and its span is [0,1542].D ZpsBe parallax free plane corresponding gray scale value, span is [0,255].u RefBe the horizontal coordinate of reference picture pixel in the image pixel coordinate system, v RefThe vertical coordinate of reference picture pixel in the image pixel coordinate system, u DesBe the horizontal coordinate of corresponding reference picture pixel in the target image in the image pixel coordinate system, v DesBe the vertical coordinate of corresponding reference picture pixel in the target image in the image pixel coordinate system, D (u Ref, v Ref) expression reference picture in pixel (u Ref, v Ref) the corresponding gray scale value.
Formula (1) is actually right corresponding pixel points level of stereo-picture and the relational expression between vertical coordinate, thus the formula target image I that can ask DesThe coordinate figure of last corresponding pixel points.
In the present invention, parameter is provided with the depth adjustment that module 1 is used for the 3-D view conversion, through changing the right horizontal sensing parallax D of stereo-picture c, D c=u Des-u RefPerceived depth when regulating the image demonstration.
In the present invention, horizontal sensing parallax D c=u Ref-v RefThe standard span does
-(W i×5%)≤D c≤W i×5%, (2)
Wherein, W iBe reference picture I RefWidth.D cAnd W iUnit all be pixel.
Formula (1) substitution formula (2) is had:
- W i · 5 % ≤ n · r 4096 · ( D zps - D ( u ref , v ref ) ) ≤ W i · 5 % , - - - ( 3 )
If the user uses n, r, the D of DIBR system default ZpsParameter value, system default n, r, D ZpsThe ginseng value is respectively 1,326,130, and inequality (3) is set up all the time.
If the user does not use n, r, the D of DIBR system default ZpsParameter value carries out depth adjustment and changes n, r, D ZpsAny one or more value in three parameters changes multiple parameter values branch multistep and carries out, and all allows to revise a parameter value at every turn, all need satisfy inequality (3) and could obtain euphorosia degree preferably.
When carrying out depth adjustment, be the shortcut calculation logic, once only allow to change a parameter value.When spectators regulate parameter n or D ZpsAfter, formula (3) is when being false, and whether this module will provide a suggestion r value and supply spectators to select to adopt, and after spectators regulated parameter r, formula (3) was when being false, and this module will provide a suggestion D ZpsWhether value supplies spectators to select to adopt.
When generating the new viewpoint view, might be with reference picture I RefIn several pixels be mapped to target image I DesSame point on, Here it is changes caused " fold (folds) " phenomenon by observability.The conventional method of handling the fold phenomenon is the Z-buffer algorithm, and this method need compare the depth value of each pixel, thereby render speed is slow.And painter's algorithm of the present invention is through confirming the scanning sequency of reference picture, and assurance can be drawn earlier from virtual photocentre pixel far away, behind the near point of virtual photocentre, draws, thereby sets up correct hiding relation.
Painter's algorithm module 3 receives the target image sequence n that parameter is provided with module 2 outputs, when being used for confirming the 3-D view conversion, to the scanning sequency of reference picture; N<0 expression target image is positioned at the reference picture left side, and n>0 expression target image is positioned at the reference picture right side;
When target image was positioned at the reference picture right side, scanning sequency was for from left to right, from top to bottom; When target image was positioned at the reference picture left side, scanning sequency was for from right to left, from top to bottom.
The scanning sequency that 3-D view conversion module 4 is confirmed according to the painter's algorithm module, traversal reference picture I RefIn pixel u Ref, obtain the matched pixel point according to formula (1), then with pixel u RefPixel value copy pixel u to Des, with the element (u among the disparity map M Ref, v Ref) be changed to u Des~u Ref, obtain target image I DesAnd disparity map M.
Because a variety of causes such as inaccurate of the inaccuracy that observability changes, calculate, depth image, the target image I that generates by the DIBR technology DesIn may comprise many mistakes matched pixel points.We are called matching error (matching error) with this mistake.Matching error will seriously reduce the right quality of stereo-picture, be mingled with some background pixels in the prospect in the object of an integral body, cause people's uncomfortable feeling.Therefore, how removing matching error is a major issue in the DIBR technology.
Though traditional filtering method can be proofreaied and correct matching error effectively, amount of calculation is big, and causes the fuzzy of target image easily.Medium filtering module 5 of the present invention is carried out medium filtering based on disparity map and is proofreaied and correct, and origin is accomplished, and specifically is: (1), disparity map M is carried out medium filtering; (2), according to filtered disparity map M, obtain target image I DesPixel is at reference picture I RefOn the match point coordinate; (3), judge whether the match point coordinate drops on reference picture I RefIn, if, then with reference picture I RefThe pixel value at last match point coordinate place copies target image I to DesCorrespondence position, otherwise, do not handle.
Compare traditional filtering method, adopt processing of the present invention that following advantage is arranged: 1) owing to be that disparity map is carried out filtering, rather than to target image, so can not cause bluring of image; 2) amount of calculation reduces significantly.
When utilizing DIBR technology to generate new view,, can in new view, produce than macroscopic-void owing to reasons such as the depth value of depth image are discontinuous.This paper has proposed a kind of empty filling algorithm based on disparity map.This algorithm at first detects than macroscopic-void according to the disparity map of input, utilizes disparity map to remove matching error then, adopts the background pixel point filling cavity in the reference picture at last.Experiment shows that this algorithm can be filled the cavity in the new view preferably, and compares with the depth image preprocess method, can not reduce the picture quality of non-hole region.
Cavity packing module 6 receives the disparity map M and the target image I of medium filtering submodule output DesAnd scanning sequency and the parameter exported according to the painter's algorithm module are provided with the parameter in the module, filling target image I DesThe middle cavity that exists obtains the final objective image I Des
Along with the development of 3D TV tech, it has been recognized that the many facilities that adopt the DIBR technology to bring.The DIBR technology has become the key technology in the 3D television system.The present invention proposes a DIBR system, it is made up of basic module such as parameter setting, painter's algorithm, 3-D view conversion, cavity filling, medium filtering and depth image preliminary treatment expansion module.The parameter of system is provided with module and supports the depth adjustment function, therefore draws the degree of depth of the stereo-picture that obtains and can regulate according to spectators' different needs.Experiment shows, it is better that the right image quality of the stereo-picture that obtains is drawn by this system, is applicable in the 3D television system of functions such as having 2D-3D conversion, free stereo demonstration.
What need to say is, the present invention is based on that present popular image resolution ratio 1024*768 describes, in the DIBR system that can expand to other resolution of the present invention.
Although above the illustrative embodiment of the present invention is described; So that the technical staff in present technique field understands the present invention, but should be clear, the invention is not restricted to the scope of embodiment; To those skilled in the art; As long as various variations appended claim limit and the spirit and scope of the present invention confirmed in, these variations are conspicuous, all utilize innovation and creation that the present invention conceives all at the row of protection.

Claims (1)

1. a DIBR system that is applicable to the 3D TV is characterized in that, comprising:
One parameter is provided with module, is used to deposit the 3-D view conversion and fills required parameter, i.e. the sequence number n of target image with the cavity; N is an integer, and span is [4,4]; N=0 representes reference-view itself, and n<0 expression target image is positioned at the reference picture left side, is left view; N>0 expression target image is positioned at the reference picture right side, is right view; Proportional factor r, its span are [0,1542]; Parallax free plane corresponding gray scale value D Zps, its span is [0,255]; The threshold value len_bighole that counts, its span is [0,7]; Expansion pixel number l, its span is [0,7];
One painter's algorithm module meets target image sequence n, when being used for confirming the 3-D view conversion, to the scanning sequency of reference picture; N<0 expression target image is positioned at the reference picture left side, and n>0 expression target image is positioned at the reference picture right side;
When target image was positioned at the reference picture right side, scanning sequency was for from left to right, from top to bottom; When target image was positioned at the reference picture left side, scanning sequency was for from right to left, from top to bottom;
The 3-D view conversion module is used for being provided with according to parameter the depth image of parameter, scanning sequency and the input of module stores, to the reference picture I of input RefCarry out three-dimension varying:
According to the scanning sequency that the painter's algorithm module is confirmed, traversal reference picture I RefIn pixel, and once handle, for reference picture I RefIn v RefRow u RefThe pixel u of row Ref, at first calculate it at target image I according to formula (1) DesMiddle corresponding matched pixel point u DesWherein
u des - u ref = n · r 4096 · ( D zps - D ( u ref , v ref ) ) v des = v ref , - - - ( 1 )
Wherein, u Ref, v RefBe respectively reference picture I in the image pixel coordinate system RefThe horizontal coordinate of pixel and vertical coordinate, u Des, v DesBe respectively target image I in the image pixel coordinate system DesIn the horizontal coordinate of corresponding reference picture pixel, D (u Ref, v Ref) expression depth image in pixel (u Ref, v Ref) gray value;
Then, pixel u RefPixel value copy pixel u to Des, with the element (u among the disparity map M Ref, v Ref) be changed to u Des-u Ref
Obtain target image I at last DesAnd disparity map M;
One medium filtering module is used to receive 3-D view conversion export target image I DesAnd disparity map M, carry out following processing then: (1), disparity map M is carried out medium filtering; (2), according to filtered disparity map M, obtain target image I DesPixel is at reference picture I RefOn the match point coordinate; (3), judge whether the match point coordinate drops on reference picture I RefIn, if, then with reference picture I RefThe pixel value at last match point coordinate place copies target image I to DesCorrespondence position, otherwise, do not handle;
One empty packing module is used to receive disparity map M and the target image I that the medium filtering submodule is exported DesAnd scanning sequency and the parameter exported according to the painter's algorithm module are provided with the parameter in the module, filling target image I DesThe middle cavity that exists:
(1), detects than macroscopic-void
With from left to right order traversal disparity map M,, then think it is here by row, note this starting point and terminal point than macroscopic-void than macroscopic-void if occur threshold value count len_bighole and above empty point continuously;
(2), expand than macroscopic-void
According to the scanning sequency of painter's algorithm module output, distinguish target image I DesBe left view or right view, if left view, execution in step a); Like figure is right view, execution in step b);
A), at first distinguishing than the macroscopic-void fringe region is background pixel point or foreground pixel point: among the disparity map M being the center than the macroscopic-void zone; The parallax value that detects from left to right than the non-cavity of macroscopic-void right hand edge point changes; When parallax value transition occurs for the first time at two in succession non-empty some places; And transition is when smaller value jumps to higher value, is the background pixel point than macroscopic-void right hand edge zone, and notes this big parallax value and put parallax value as foreground pixel; When parallax value transition occurs for the first time at two in succession non-empty some places; And transition is to jump to smaller value from higher value; Perhaps parallax value is consistent when not having transition; Than macroscopic-void right hand edge zone is the foreground pixel point, and notes the parallax value of putting in first non-cavity and put parallax value as foreground pixel;
Empty edge then expands: if be the background pixel point than macroscopic-void right hand edge zone; Be the matching error zone then than the macroscopic-void left and right edges; Need expand, will deduct l pixel and terminal point abscissa than the starting point abscissa of macroscopic-void and add starting point and the terminal point of l pixel as the cavity that needs in the target image to fill; If than macroscopic-void right hand edge zone is the foreground pixel point; Then the left hand edge than macroscopic-void is the matching error zone; Only expand, will deduct l pixel and terminal point than the starting point abscissa of macroscopic-void and remain unchanged as the starting point and the terminal point in the cavity that needs in the target image to fill than the left hand edge of macroscopic-void;
B), at first distinguishing than the macroscopic-void fringe region is background pixel point or foreground pixel point: in the disparity map being the center than the macroscopic-void zone; The parallax value that detects from right to left than the non-cavity of macroscopic-void left hand edge point changes; When parallax value transition occurs for the first time at two in succession non-empty some places; And transition is when higher value jumps to smaller value, is the background pixel point than macroscopic-void left hand edge zone, and notes this less parallax value and put parallax value as foreground pixel; When parallax value transition occurs for the first time at two in succession non-empty some places; And transition is to jump to higher value from smaller value; Perhaps parallax value is consistent does not have transition; Than macroscopic-void left hand edge zone is the foreground pixel point, and notes the parallax value of putting in first non-cavity and put parallax value as foreground pixel;
Expand then than the macroscopic-void edge: if be the background pixel point than macroscopic-void left hand edge zone; Be the matching error zone then than the macroscopic-void left and right edges; Need expand, will deduct l pixel and terminal point abscissa than the starting point abscissa of macroscopic-void and add starting point and the terminal point of l pixel as the cavity that needs in the target image to fill; If than macroscopic-void left hand edge zone is the foreground pixel point; Then the right hand edge than macroscopic-void is the matching error zone; Only expand, will remain unchanged than the starting point of macroscopic-void and the terminal point abscissa adds that l pixel is as the starting point and the terminal point that need the cavity of filling in the target image than the right hand edge of macroscopic-void;
In this step (2), the pixel number l of expansion is the number of mistake matched pixel point, and is relevant with the accuracy that depth image is estimated, can regulate according to the target image quality that generates, and span is 0-7;
(3), fill than macroscopic-void
With target image I DesThe middle starting point in the cavity of filling, the parallax value that the terminal point abscissa all deducts foreground pixel point of needing, obtaining need be at reference picture I RefIn the pixel zone of duplicating, then, from reference picture I RefIn duplicate this regional pixel and be filled into target image I DesThe middle hole region that needs filling obtains the final objective image I Des
CN 201110397027 2011-12-05 2011-12-05 DIBR (Depth Image Based Rendering) system suitable for 3D (Three-Dimensional) television Expired - Fee Related CN102547338B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110397027 CN102547338B (en) 2011-12-05 2011-12-05 DIBR (Depth Image Based Rendering) system suitable for 3D (Three-Dimensional) television

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110397027 CN102547338B (en) 2011-12-05 2011-12-05 DIBR (Depth Image Based Rendering) system suitable for 3D (Three-Dimensional) television

Publications (2)

Publication Number Publication Date
CN102547338A true CN102547338A (en) 2012-07-04
CN102547338B CN102547338B (en) 2013-11-06

Family

ID=46353110

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110397027 Expired - Fee Related CN102547338B (en) 2011-12-05 2011-12-05 DIBR (Depth Image Based Rendering) system suitable for 3D (Three-Dimensional) television

Country Status (1)

Country Link
CN (1) CN102547338B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102831602A (en) * 2012-07-26 2012-12-19 清华大学 Image rendering method and image rendering device based on depth image forward mapping
CN102932661A (en) * 2012-11-29 2013-02-13 重庆大学 Median filtering matching error correction method for disparity map, and circuit for implementing method
CN104038753A (en) * 2014-06-17 2014-09-10 四川虹微技术有限公司 Three-dimensional image hole filling method
CN104079912A (en) * 2013-03-29 2014-10-01 索尼公司 Image processing apparatus and image processing method
CN104378619A (en) * 2014-11-12 2015-02-25 合肥工业大学 Rapid and efficient hole filling algorithm based on foreground and background gradient transition
CN106060511A (en) * 2016-06-17 2016-10-26 浙江工商大学 Stereoscopic video complementing method and system based on depth map
CN111712851A (en) * 2018-02-08 2020-09-25 兴和株式会社 Image processing apparatus, image processing method, and image processing program
WO2021195940A1 (en) * 2020-03-31 2021-10-07 深圳市大疆创新科技有限公司 Image processing method and movable platform

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050057561A1 (en) * 2003-09-11 2005-03-17 El-Din Elshishiny Hisham Emad System and method for hole filling in 3D models
CN1691064A (en) * 2004-04-26 2005-11-02 三丰株式会社 Image processing apparatus using morphology
CN101271583A (en) * 2008-04-28 2008-09-24 清华大学 Fast image drafting method based on depth drawing
CN101388967A (en) * 2008-10-20 2009-03-18 四川虹微技术有限公司 Gap filling method for view synthesis
CN101404777A (en) * 2008-11-06 2009-04-08 四川虹微技术有限公司 Drafting view synthesizing method based on depth image

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050057561A1 (en) * 2003-09-11 2005-03-17 El-Din Elshishiny Hisham Emad System and method for hole filling in 3D models
CN1691064A (en) * 2004-04-26 2005-11-02 三丰株式会社 Image processing apparatus using morphology
CN101271583A (en) * 2008-04-28 2008-09-24 清华大学 Fast image drafting method based on depth drawing
CN101388967A (en) * 2008-10-20 2009-03-18 四川虹微技术有限公司 Gap filling method for view synthesis
CN101404777A (en) * 2008-11-06 2009-04-08 四川虹微技术有限公司 Drafting view synthesizing method based on depth image

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
刘占伟等: "基于DIBR和图像融合的任意视点绘制", 《中国图象图形学报》 *
陈思利等: "一种基于DIBR的虚拟视点合成算法", 《成都电子机械高等专科学校学报》 *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102831602A (en) * 2012-07-26 2012-12-19 清华大学 Image rendering method and image rendering device based on depth image forward mapping
CN102831602B (en) * 2012-07-26 2015-05-20 清华大学 Image rendering method and image rendering device based on depth image forward mapping
CN102932661A (en) * 2012-11-29 2013-02-13 重庆大学 Median filtering matching error correction method for disparity map, and circuit for implementing method
CN104079912A (en) * 2013-03-29 2014-10-01 索尼公司 Image processing apparatus and image processing method
US9684964B2 (en) 2013-03-29 2017-06-20 Sony Corporation Image processing apparatus and image processing method for determining disparity
CN104038753A (en) * 2014-06-17 2014-09-10 四川虹微技术有限公司 Three-dimensional image hole filling method
CN104378619A (en) * 2014-11-12 2015-02-25 合肥工业大学 Rapid and efficient hole filling algorithm based on foreground and background gradient transition
CN106060511A (en) * 2016-06-17 2016-10-26 浙江工商大学 Stereoscopic video complementing method and system based on depth map
CN106060511B (en) * 2016-06-17 2018-11-16 浙江工商大学 Three-dimensional video-frequency complementing method and system based on depth map
CN111712851A (en) * 2018-02-08 2020-09-25 兴和株式会社 Image processing apparatus, image processing method, and image processing program
CN111712851B (en) * 2018-02-08 2023-08-29 兴和株式会社 Image processing device, image processing method, and image processing program
WO2021195940A1 (en) * 2020-03-31 2021-10-07 深圳市大疆创新科技有限公司 Image processing method and movable platform

Also Published As

Publication number Publication date
CN102547338B (en) 2013-11-06

Similar Documents

Publication Publication Date Title
CN102547338B (en) DIBR (Depth Image Based Rendering) system suitable for 3D (Three-Dimensional) television
CN102307312B (en) Method for performing hole filling on destination image generated by depth-image-based rendering (DIBR) technology
US20100073364A1 (en) Conversion method and apparatus with depth map generation
CN102892021B (en) New method for synthesizing virtual viewpoint image
CN102972038A (en) Image processing apparatus, image processing method, program, and integrated circuit
CN104506872B (en) A kind of method and device of converting plane video into stereoscopic video
CN102819837B (en) Method and device for depth map processing based on feedback control
CN104378619B (en) A kind of hole-filling algorithm rapidly and efficiently based on front and back's scape gradient transition
CN101556700A (en) Method for drawing virtual view image
CN103348360A (en) Morphological anti-aliasing (MLAA) of re-projection of two-dimensional image
CN105791803A (en) Display method and system capable of converting two-dimensional image into multi-viewpoint image
CN110096993A (en) The object detection apparatus and method of binocular stereo vision
JP2012231405A (en) Depth-adjustable three-dimensional video display device
CN105657401A (en) Naked eye 3D display method and system and naked eye 3D display device
CN103281548A (en) Real-time high-definition depth estimation system
CN103369331A (en) Image hole filling method, image hole filling device, video image processing method and video image processing device
CN101908216A (en) Method and device for realizing vector fonts
CN102026012B (en) Generation method and device of depth map through three-dimensional conversion to planar video
CN104185012B (en) 3 D video form automatic testing method and device
CN103945206B (en) A kind of stereo-picture synthesis system compared based on similar frame
CN104717514B (en) Rendering multi-viewpoint images system and method
CN102932661A (en) Median filtering matching error correction method for disparity map, and circuit for implementing method
CN102447927A (en) Method for warping three-dimensional image with camera calibration parameter
CN105791798B (en) A kind of 4K based on GPU surpasses the real-time method for transformation of multiple views 3D videos and device
CN102186095A (en) Matching error correction method applicable for depth-image-based rendering

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20131106

Termination date: 20161205

CF01 Termination of patent right due to non-payment of annual fee