CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Full Search Algorithm for Movies Files

Published on March 2012 by Sangeeta Mishra, Sudhir Sawarkar
journal_cover_thumbnail

International Conference in Computational Intelligence
Foundation of Computer Science USA
ICCIA - Number 3
March 2012
Authors: Sangeeta Mishra, Sudhir Sawarkar
e5042f08-bdef-4bf1-95d3-098a9bae9413

Sangeeta Mishra, Sudhir Sawarkar . Full Search Algorithm for Movies Files. International Conference in Computational Intelligence. ICCIA, 3 (March 2012), 14-16.

@article{
author = { Sangeeta Mishra, Sudhir Sawarkar },
title = { Full Search Algorithm for Movies Files },
journal = { International Conference in Computational Intelligence },
issue_date = { March 2012 },
volume = { ICCIA },
number = { 3 },
month = { March },
year = { 2012 },
issn = 0975-8887,
pages = { 14-16 },
numpages = 3,
url = { /proceedings/iccia/number3/5105-1017/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference in Computational Intelligence
%A Sangeeta Mishra
%A Sudhir Sawarkar
%T Full Search Algorithm for Movies Files
%J International Conference in Computational Intelligence
%@ 0975-8887
%V ICCIA
%N 3
%P 14-16
%D 2012
%I International Journal of Computer Applications
Abstract

In this paper, we describe the search algorithm for movie files .The algorithm is first divides the video clip into different frames. Full search algorithm in video compression. The algorithm takes 16 pixels window left ,right ,upper and lower. Find out the best possible matching block of current frame to reference frame ,then it find out the motion vectors. Since algorithm works pixel by pixel basis,for each window it performs 33X33X8X8 multiplications and 33X33X8X8x2 subtractions so speed is low.

References
  1. . Gary J. Sullivan,Thomas Wiegand “Video Compression— From Concepts to the H.264/AVC Standard” Proceeding of the IEEE, VOL. 93, NO. 1, JAN 2005.
  2. . Milind Phadtare, “Motion estimation techniques in video processing” Electronic Engineering Times India August 2007 eetindia.com.
  3. Xiaomin Wu, Weizhang Xu, Nanhao Zhu, Zhanxin Yang, “A Fast Motion Estimation Algorithm for H.264”IEEE 2010 International Conference on Signal Acquisition and Processing.
  4. Wei-feng Liu, Ji-li Lu, Zeng-fu Wang, Hua-jun Song , Xue- zheng ,”High Compression Algorithm for Video Stream” IEEE 2008 Conference on Image and Signal Processing.
  5. Hui Gu, Yan-Shanli “The Research Of Block Motion Estimation Algorithm In Video Compression” Proceedings of the Third International Conference on Machine Leg and Cybernetics, Shanghai, 26-29 August 2004.
  6. Marc Alzina, Wojciech Szpankowski,and Ananth Grama, “2D-Pattern Matching Image and Video Compression: Theory, Algorithms, and Experiments”, IEEE Transaction On Image Processing, Vol. 11, No. 3, Mar 2002
Index Terms

Computer Science
Information Sciences

Keywords

BMA Motion estimation Frames MSE