A Modified 2-D Logarithmic Search Technique for Video Coding

A Modified 2-D Logarithmic look proficiency for Video Coding With Reduced seem Points Tahmina Akhtar, Rahima Akter, Chhalma Sultana Chhaya , Ashfaqur Rahman Military bring in of Science and Technology/Dept of CSE, Dhaka, Bangladesh, Central Queensland University/Centre for Intelligent and Ne dickensrked Systems, QLD, Australia emailprotected com, emailprotected com, emailprotected com, a. emailprotected edu. au generalisation Video cryptanalysis is a process for representing picture show instalments in a compact manner.A significant timber in boob tube coding is inquisitive for similar segments in previous erects and use only the difference data for reconstruction therefrom cut back space requirement. Different lookup proficiencys including full(a) see and 2-D logarithmic front etc. atomic number 18 used in the current literature. abounding face restricts its application because of its computational load. 2D logarithmic expect is computation eithery less ex pensive although there ar both(prenominal) spaces for improvement. In this paper we propose a new attempt technique by modifying the 2-D logarithmic look that requires less explore capitulums with insignificant acquittance in visual quality.Experimental results demonstrate the legalness of the proposed technique. Keywords idiot box coding, 2-D logarithmic reckon. i. intromission Video is a sequence of still images representing scenes in bowel movement. A achievement picture is created by capturing a numbers of still images in a concise fourth dimension interval. When these still images are displayed very quickly, it represents the motion of the object in the images. Video represent the huge amount of data. In order to fare video data from whiz place to another efficiently it is needed to compress the size of video data.One way to compress the size of video data is video coding 1 2 . The principal goal in the chassis of a video-coding system is to reduce the transmission rate subject to virtually picture quality constraint. In transmission side, the first be sick (normally called the computer address frame) is transmitted as it is and the remaining frames are sent as a function of the adduce frame. The frame to be sent is divided into a number of blocks and the best discip billet for the block is looked for in the rehunt window of the reference frame. This processing is called the essay technique in video coding literature.There exist a number of video coding techniques including MPEG-1/2/4 2 7 , H. 26X 8 etc. uses see techniques like unspoiled chase 1 , 2-D logarithmic search 3 , Coarse-Fine-Three-Step search 4 , Conjugate Direction search 5 , and Pyramid search 6 . individually of these search techniques has merits and demerits in their favor. affluent search finds the best brace for a block as it searches all the candidate positions in the search window. Full search however is computationally expensive and re nders difficulty for real clip implementation.Some variants exist that applies some heuristics to reduce the candidate search refers and reduce the computational complexity although compromising the image quality a bit. 2-D logarithmic search is one such search technique that reduces the search summits to a sub objurgate of the search window (to be detailed in literature review) and finds the near-optimal best match with lessen computational complexity. Although computationally inexpensive it contains some tediousness in the search space. We aim to reduce this redundancy and aim to find a special 2-D logarithmic search technique with even reduced computational load.Experimental results demonstrate that the proposed technique reduces the number of search manoeuvers and thus reduces search time with insignificant sacrifice of image quality. The paper is organized as follows. In segmentation II we elaborate some related works. In Section III we present our proposed search come up. Some experimental results to demonstrate the effective of the proposed approach is presented in Section IV. Finally Section V concludes the paper. II. colligate works In this section we present full search technique and the logarithmic search technique.In both cases the frame to be coded is divided into a number of non- all all overlapping equal size blocks of size p? q. The best match is looked for in a search window of size (2d+1)? (2d+1) in the reference frame . digit 1 Block matching process in video coding that uses search techniques. * A. Full wait In Full search 1 finds the best match by inspecting all the (2d+1)? (2d+1) candidate positions inside the search window. Full search procedure is brute force in temper. The advantage of Full seek is that it delivers good accuracy in distinct for the best match.The disadvantage is that it involves a large amount of computation. * B. 2-D Logarithmic Search Jain and Jain 3 developed a 2-D logarithmic search technique th at successively reduces the search area, thus reducing the computational burden. The first abuse computes the similarity for quintet points in the search window. These vanadium points are as follows the central point of the search window and the four points surrounding it, with severally being a midpoint between the central point and one of the four boundaries of the window. Among these five points, the one corresponding to the token(prenominal) dissimilarity is picked as the winner.In the attached step, surrounding this winner, another set of five points are selected in a similar fashion to that in the first step, with the distances between the five points remaining unchanged. The exception takes place when either a central point of a set of five points or a boundary point of the search window gives a stripped dissimilarity. In these circumstances, the distances between the five points need to be reduced. The procedure continues until the final step, in which a set of candid ate points are located in a 33 2-D grid.The steps in a 2-D logarithmic search technique are presented in trope 2. anatomy 2 The 2-D logarithmic search technique. The club numbered n is searched at the n-th step. The arrows indicate the points selected as the concentre of the search for the neighboring pass. The 2-D logarithmic search hits a maximum of 18 points and a minimum of 13 search points. The advantage of this technique is that it successively reduces the search area, thus reducing the computational burden. One of the disadvantages is that some points are searched more than erstwhile thus leave some space for improvement.Moreover, it follows a greedy approach by selecting the minimum dissimilar point at each step thus posing a threat to follow a topical anaesthetic minimum trend. Considering these facts we propose to modify the 2-D logarithmic search to overcome the topical anaesthetic minimum problem and also eliminate the redundant computing as described in the foll owing section. iii. proposed search technique We mainly modified the 2-D logarithmic search technique to eliminate the redundancy and local minimum problem associated with it. The search technique is elaborated close under the atonic of 2-D logarithmic search technique.Our proposed search technique starts with the five points in the search window where the one is at the center and other four surrounds center point (Fig 3(a)). Unlike 2-D logarithmic search, our proposed technique selects two points min1 and min2 (Fig 3(b)) that has dissimilarity haemorrhoid lower than the other terzetto points. We then select a point as the center of search for the next pass that lies on the line in between min1 and min2. This selection reduces the local minimum effect as it simply does not follow the minimum point.Moreover, the five points selected in the next pass does not match with any of the previous points thus eliminates the redundancy that exists in 2-D logarithmic search. Centered at the point selected at the next pass the search continues (Fig 3(d)-Fig 3(f)). The steps of the search are portrayed in Fig 3. Following are some of the merits of our proposed technique * Successively reduces the search area with no point searched twice * Maximum search points are 12 and minimum search points are 5 an improvement over 2-D logarithmic search. iv. Results and DiscussionWe have conducted a comparative analysis of Full Search, 2-D logarithmic Search and our proposed search technique as presented next. All the experiments were conducted on MPEG sequences victimisation MATLAB. We used sequences like garden, Akiyo, prorogue Tennis, Car, and coastguard. Full search, 2-D logarithmic search and our proposed technique applied in these standard MPEG file and we computed the ASNR (Average indicate to Noise Ratio) and computational load (i. e. number of search points). The results on dissimilar sequences are presented next. Akiyo instalment severally frame of the Akiyo sequenc e is of 352? 88 pixels, recorded at 25 frames per indorsement and there are a total of 398 video frames. Fig 4 shows the reconstructed twentieth frame of Akiyo sequence coded using Full search, 2D-logarithmic search and proposed search technique. In this video only face percentage is moving. Search point comparison for these three search techniques is presented in Fig 5 and ASNR is reported in Fig 6. ASNR achieved using the proposed search technique is almost equal 2D logarithmic search but at reduced number of search points (Fig 5). Number of search points remains almost similar over the different frames.ASNR value shown in postpone 1. (a) (b) (c) (d) (e) (f) Fig 3 The different steps of our proposed 2-D logarithmic search technique. (a) five points of search window, (b) the direction of the search in between the direction offered by the two points min1 and min2. (c) Search at step 2, (d) min1 and min2 at step 2, (e) Search points at step 3, and (f) Search ends at the blue poin t. (a) (b) (c) Fig 4 theorize twentieth frame of the Akiyo sequence using (a) Full search, (b) 2-D logarithmic search, and (c) Our proposed search technique.Fig 5 similarity of of search points for Akiyo sequence. Fig 6 Comparison of ASNR for Akiyo sequence. get across 1 ASNR value of different search for Akiyo sequence compile No Full Search 2D logarithmic Search Proposed Search first 25. 86188 25. 55678 25. 46245375 5th 24. 84504 23. 77938883 23. 57562323 tenth 24. 37532 23. 01043038 22. 67351877 15th 24. 38495 22. 98908004 22. 5831958 20th 24. 4424 22. 90227928 22. 56886825 25th 24. 44956 23. 03416597 22. 51615637 Car term Each frame of the Car sequence is of 320? 240 pixels and ecorded at 25 frames per support and there are a total of 398 video frames. The reconstructed 20th frame of Car sequence using the three search techniques is presented in Fig 7. In this video sequence the car moves but soil is still. here each repeated two times. Average no of search point is al most 10. 46 for repeated frames and 11. 50 for new frames. Here number of search points vary significantly compared to Akiyo sequence. Overall the proposed technique has reduced search points (Fig 8) although the ASNR is bit low (Fig 9). ASNR value of some frames shown in card 2. a) (b) (c) Fig 7 hypothecate 20th frame of the Car sequence using (a) Full search, (b) 2-D logarithmic search, and (c) Our proposed search technique. Fig 8 Comparison of of search points for Car sequence. Fig 9 Comparison of ASNR for Car sequence. Table 2 ASNR value of different search for Car sequence Frame No Full Search 2D logarithmic Search Proposed Search 1st 27. 13312 26. 5682 26. 08265 5th 26. 68718 25. 75123 25. 16904 10th 26. 10589 25. 12647 24. 27394 15th 26. 31185 25. 16266 24. 54981 20th 26. 28613 25. 1915 24. 61234 25th 25. 86261 25. 02255 24. 12599 tend age Each frame of the Garden sequence is of 352? 240 pixels and recorded at 30 frames per second and there are a total of 59 video frames . Fig 10 represents the reconstructed 20th frame of this sequence coded using the three search techniques. In this video the motion is imputable to camera movement. Fig 11 and Fig 12 reveals that the new search technique reduces the number of search points with minor loss in ASNR. ASNR value of some frames shown in Table 3. Here Average no of search point for each frames required almost same.In frame 20th average no of search point is 11. 6053 and ASNR is 18. 22931. (a) (b) (c) Fig 10 Reconstructed 20th frame of the Garden sequence using (a) Full search, (b) 2-D logarithmic search, and (c) Our proposed search technique. Fig 11 Comparison of of search points for Garden sequence. Fig 12 Comparison of ASNR for Garden sequence. Table 3 ASNR value of different search for Garden sequence Frame No Full Search 2Dlogarithmic Search Proposed Search 1st 24. 27663 24. 27663 23. 5971 5th 21. 6078 21. 6078 20. 49847 0th 20. 71779 20. 71779 19. 34323 15th 19. 9641 19. 9641 18. 69269 20th 19. 6754 19. 6754 18. 22931 25th 19. 39791 19. 39791 18. 05226 Coastguard Sequence Each frame of the Coastguard sequence is of 320? 240 pixels and recorded at 25 frames per second and there are a total of 378 video frames. Here the ride and the camera are moving. Fig 13 represents a reconstructed frame of this sequence coded using the three search techniques. Fig 14 represents the search point required by the three techniques. Our proposed technique shows periodic nature in terms of search points.This is due to the repetitive nature of motion in the video. Fig 15 represents a comparison of ASNR obtained using different techniques. Table 4 shown ASNR of some frames. (a) (b) (c) Fig 13 Reconstructed frame of the Coastguard sequence using (a) Full search, (b) 2-D logarithmic search, and (c) Our proposed search technique. Fig 14 Comparison of of search points for Coastguard seq. Fig 15 Comparison of ASNR for Coastguard sequence. Table 4 ASNR value of different search for Coastguard seq. Frame No Full Search 2D logarithmic Search Proposed Search 1st 24. 8771 24. 33338 23. 61801 5th 24. 31753 23. 35416 22. 54516 10th 23. 90367 23. 03317 22. 07546 15th 24. 36529 23. 44171 22. 66604 20th 24. 38658 23. 26823 22. 50994 25th 24. 54524 23. 91583 22. 91885 Table tennis Sequence Each frame of the Table tennis sequence is of 352? 240 pixels and recorded at 30 frames per second and there are a total of 9 video frames. Here ball is moving fast. The reconstructed frames, number of search points, and ASNR of the three search techniques are presented in Fie 16, Fig 17, and Fig 18. Some ASNR of Table tennis sequence shown in table 5. a) (b) (c) Fig 16 Reconstructed frame of the Table tennis sequence using (a) Full search, (b) 2-D logarithmic search, and (c) Our proposed search technique. Fig 17 Comparison of of search points for Table tennis sequence. Overall the result of ASNR for Full Search is best in all cases but number of search point is so high. The result of ASNR for 2-D logari thmic and our proposed search is almost same but the number of search point of our proposed search is smaller than the 2-D logarithmic search and thus an improvement over the existing technique.Fig 18 Comparison of ASNR for Table tennis sequence. Table 5 ASNR value of different search for Table tennis seq Frame No Full Search 2D logarithmicSearch ProposedSearch 1st 25. 2698 24. 56416 23. 90544 3rd 23. 60795 22. 69326 21. 81273 5th 23. 43996 22. 35007 21. 29301 seventh 23. 71878 22. 71607 21. 58383 v. Conclusion In this paper we have presented a new search technique for video coding that is a modification of the existing 2-D logarithmic search. The proposed technique reduces the search time of 2-D logarithmic search by reducing the redundant search points.Although ASNR is sacrificed to some extent it had insignificant visual bushel as observed from the experimental results. References 1 Shi and H. Sun, view and Video Compression for multimedia engine room, Fundamentals, Algorithms and Standards, 2nd Edition. 2 P. N. Tudor, MPEG-2 Video Compression, IEEE J Langham Thomson Prize, Electronics and Communication Engineering journal, declination 1995. 3 J. R. Jain and A. K. Jain, Displacement Measurement and Its Application in Interframe Image Coding, IEEE Transactions on Communications, vol. com-29, no. 12, December 1981. 4 T. Koga, K. Linuma, A. Hirano, Y. Iijima, and T.Ishiguro, Motion-compensated interframe coding for video conferencing, Proc. NTC81, G5. 3. 1-G5. 3. 5, New Orleans, LA, Dec. 1981. 5 R. Srinivasan and K. R. Rao, Predictive coding based on efficient motion estimation, Proc. of ICC, 521-526, May 1984. 6 D. Tzovaras, M. G. Strintzis, and H. Sahinolou, Evaluation of multiresolution block matching techniques for motion and disparity estimation, Signal Process. Image Commun. , 6, 56-67, 1994. 7 MPEG-4, http//en. wikipedia. org/wiki/MPEG-4, last accessed in December 2008. 8 H. 264, http//en. wikipedia. org/wiki/H. 264, last accessed in December 2008. *