Presentation on theme: "Deinterlacing using Motion Detection"— Presentation transcript:
1 Deinterlacing using Motion Detection SANTHOSH KUMAR K.C.
2 Motion Detection in Deinterlacing Motion Detection is used in Deinterlacing processInterlaced Scanning was used to lower the costs of video system and reduce the transmission bandwidth by 2Deinterlacing is translation of the interlace format of video to progressive device as plasma projection TV, projector, and computerDifficult to police: very large and distributed user base– Trust network: clusters of users sharing the same socialinterests developing trust with each other– Platform openness for developing applications that areattractive the general users who will install them
3 DeinterlacingThe challenge of deinterlacing is to interpolate the missing points with limited information and also to maintain clear visual quality as wellThe key concept of deinterlacing is to interpolate the missing point with neighbours that have the highest correlation
4 Earlier methods employed LA-Line Average –intra interpolation-average to two pixels on the same line. But LA blurs the vertical details.FI-Field Insertion - Inter interpolation- repeats the pixel p(i,j-1) as p(i,j) – but caused problem with the moving objects in the frame to be deinterlaced.So many Motion adaptive algorithms were designed. But the visual quality of these algorithms depended on the correctness of motion detection which needed more field memory in VLSI implementation
5 Hybrid Motion Deinterlacing Algorithm This algorithm consisted of hybrid Motion Detection(HMD) and edge Pattern Recognition(EPR).HMD for detection of versatile motionEPR for interpolation of edges and textures which cannot be handled by LA and enhanced LA Algorithms
6 Block Diagram - HMDEPRfrom paper Motion-Adaptive Deinterlacer via Hybrid Motion Detection and Edge –Pattern Recognition by Gwo giun Lee ,Ming-Jiun Wang,Hsin-Te Li, and He-Yuan Lin
8 Pseudocodefrom paper Motion-Adaptive Deinterlacer via Hybrid Motion Detection and Edge –Pattern Recognition by Gwo giun Lee ,Ming-Jiun Wang,Hsin-Te Li, and He-Yuan Lin
9 HMD-Continued First Condition – diff(a-b) > TH1 This condition detects slow motions in the frameSecond Condition – diff(b-(c+d)/2) > TH1 and diff(b- (g+h)/2) < TH2This condition detects the fast motion in the frameThird Condition – abs(a+(e+f)/2 – b- (c+d)/2) > TH3This condition detects motion with edges
10 Erosion after HMDErosion filter with cross shaped mask is performed on the results of HMD.The erosion filter is to eliminate the isolated moving pixels
14 Corrects the Motion missing.. The inability to detect motion is called as motion missing which results in motion holesThe earlier algorithms had these problemsThe Erosion and Dilation process after HMD eliminates this motion missing problem and hence gives good visual quality.
15 Interpolation follows HMD EPR-Edge Pattern Recognizer-The intra field interpolator used in moving scenesFI – Field Insertion- The inter field interpolator used in stationary scenes.
22 Summary of this algorithm The Hybrid Motion Detector is capable of detecting slow motion, fast motion and motion of edges with high accuracy.Edge pattern Recognition algorithm performs adaptive interpolation and thus achieves successful interpolation of textures and edges.
23 Hierarchal Motion Detection Algorithm First step is measuring the motion activity level in video sequence and calculating the adaptation factorInterpolation is spatial or temporal depending on the adaptation factorSpatial interpolation for static sequence and temporal interpolation for dynamic motionsequence
24 Block DiagramA Motion Adaptive Deinterlacing method with hierarchical motion detection algorithm by Ellan shahinfard,Maher A.Sid –Ahmed, Majid Ahmadi
25 Motion DetectionUses five consecutive fields of video data to increase the ability of detecting fast motions.In the fig(next slide),F represents the current field,F+1 and F+2 represents the two subsequent fields, and F-1 and F-2 represent the two fields prior to F.
27 Block DiagramA Motion Adaptive Deinterlacing method with hierarchical motion detection algorithm by Ellan shahinfard,Maher A.Sid –Ahmed, Majid Ahmadi
28 (F-2,F),(F-1,F+1),(F,F+2) have same missing lines and same time difference. The three pairs are used for motion detectionThe Maximum of three corresponding diff block is compared with predefined threshold value.If less than threshold value, then static video sequenceElse then dynamic block is recursively partitioned to smaller blocks and procedure continues.
29 InterpolationDepending on the mobility value calculated in the previous motion detection, spatial interpolation is chosen for static sequence or temporal sequence is chosen for dynamic sequence.