Browse > Article

Block Matching Algorithm Using Pixels Selected by Image Complexity  

Kim Seong-hee (부경대학교 화상정보공학부)
Oh Jeong-su (부경대학교 화상정보공학부)
Abstract
This paper proposes a modified block matching algorithm which reduces an amount of matching computation by using only pixels contributing greatly to block matching. In consideration of algorithm implementation and additional informatirm, the proposed algorithm divides a matching block into sub-blocks, selects some sub-blocks using their complexities, and execute the block mating with them. Simulation results show that the proposed algorithm performs a valid block matching, diminishing computation cost.
Keywords
motion estimation; block matching; sub-block matching;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Frederic Dufaux and Fabrice moscheni, 'Motion Estimation Technique for Digital TV : A Review and a New Contribution,' Proceedings of the IEEE, vol.83, pp.858-876, Jun. 1995
2 ITU-T Recommendation H.263 software implementation, Digital Video Coding Group at Telenor R&D, 1995
3 T.Koga, K.Iinuma, A.Hirano, Y.Iigima and T.Ishiguro, Motion Compensated interframe coding for video conferencing, ' Proc. Nat. Telecommun. Conf.. pp. G5.3.1-5.3.5, New Orleans, USA, Nov. 1981
4 J.N.Kim and et al., 'Adaptive matching scan algorithm based on gradient magnitude for fast full search in motion estimation,' IEEE Trans. Consumer Electronics, vol.45, pp. 762-772, Aug.1999   DOI   ScienceOn
5 J.N.Kim and et al., 'A fast full-search motion-estimation algorithm using representative pixels and adaptive matching scan,'IEEE Trans. Circuits Syst. For Video Technol., vol. 10,pp. 1040-1048. Oct.2000   DOI   ScienceOn
6 J.R.Jain and A.K.Jain,'Displacement measurement and its application in interframe image coding,'IEEE Trans. Commun, vol. 29, pp. 1799-1806, Dec. 1981   DOI