IAETSD JOURNAL FOR ADVANCED RESEARCH IN APPLIED SCIENCES, VOLUME 4, ISSUE 1, JAN-JUNE /2017

ISSN (ONLINE): 2394-8442

LOAD REDUCTION IN VIDEOS USING ADVANCED FAST

ALGORITHM
Mr. Vasudev Kawati [1], Dr. G S Mamatha [2]
[1] [2]
Mtech(IT) Department of ISE, RVCE, Assoc. Prof Department of ISE, RVCE, Bangalore, 560059
vasu.kawati@gmail.com, mamathags@rvce.edu.in

ABSTRACT.

World of information technology nowadays commonly uses multimedia data for transmission, few
examples are audios, videos, images etc. The paper mainly concentrates on video data that impose a greater
challenge while transmitting through internet. Speed is the major challenge that has to be addressed as most of the
time goes in loading, streaming and storage of huge data. The network overload and data analysis are two main
problems to be considered.

The videos usually consume huge storage space when compared to other multimedia data. So the
major issue to be concentrated is reducing load of videos without affecting the original data. By using FAST
(Features Accelerated from Segment Test) and PHOG (Pyramid Histogram orientation gradients) algorithms it is
possible to reduce a load and storage consumption of videos. A Huffman encoding helps in encoding the data and
it is also possible to decode back original data without any loss. Multimedia transaction and storages are handled
for solving problems of data analysis and network overloads. The results obtained through FAST algorithm are
very much impressive. It is successful in reducing the size of the video file from MBs to KBs with a compression
ratio of 82%.

Keywords - Pre-Processing, FAST, PHOG, Support Vector machine, Huffman coding, knowledge base and Load Reduction.

I. INTRODUCTION
Today the world is moving towards digitization, aiming to become a digitalized world. Daily use of multimedia data imposes a problem of
over load in storage spaces. Video files consume much storage spaces when compared to other multimedia content. This can cause a hindrance
to the speed and performance while streaming videos. The paper proposes the concept of load reduction in video files. It follows certain steps
like pre-processing, feature extraction, key frame generation, classification, recognition and load reduction [1][2].

Video file is selected as an input for the size reduction and the steps mentioned earlier are applied for reducing consumption space of video
file. Pre-processing is process of cleaning, normalizing, integrating, and identifying noise in the data. The feature extraction is process of
obtaining frames from the video and extracting main features. Classification is used to find a belonging category of input video from existing list
of videos and recognition is used to obtain matching list details to which video it is totally matching, both classification and recognition are done
with help of support vector machine (SVM) algorithm [3].

FAST algorithm mainly detects important frames and ignores unimportant frames. It takes one frame as input and it compare the input point
or frame with all other nearest 16 frames in the image. The most promising advantage of the FAST corner detector is its computational
efficiency. Referring to its name, it is fast and indeed it is faster than many other well-known feature extraction methods, such as difference of
Gaussians (DoG) used by the SIFT, SUSAN and Harris detectors.

Two types of calculation are performed using PHOG algorithm: 1. Histogram: It finds distance between two points in a graph of the frame
image based on x and y axis values. In histogram, location of points is provided with binary representation [4]. 2. Orientation: The orientation
gets index values of all the points in an image. Index helps in calculating the actual distance from different nodes in image.

The rest of the paper is organized as follows. Section II contains Literature survey, followed by Architecture in section III. Implementation
is provided in section IV. Implementation results are provided in section V, Conclusion and Future work in section VI and finally followed by
the References.

To Cite This Article: Mr. Vasudev Kawati and Dr. G S Mamatha,. LOAD REDUCTION IN
VIDEOS USING ADVANCED FAST ALGORITHM. Journal for Advanced Research in Applied
Sciences ;Pages: 298-302
299. Mr. Vasudev Kawati and Dr. G S Mamatha,. LOAD REDUCTION IN VIDEOS USING ADVANCED FAST
ALGORITHM. Journal for Advanced Research in Applied Sciences; Pages: 298-302

II. LITERATURE SURVEY

The different results from different algorithms which are similar like FAST algorithm are surveyed. The similar algorithms to FAST such as
Morava corner detection algorithms, SUSAN corner detector, Stephen & Harris corner detection algorithms [5]. The reason behind using a
FAST algorithm was to develop an interest point detector for use in real time frame rate applications. Eduard Agued e et.al [6], gives the
overview of storage consumption of multimedia data approximately those kind files consumes internet traffic almost ninety percent. Describes
big picture event monitor (BPEM), multimedia platform uses images from source of Instagram or Twitter,

Cristian C, et.al [7], the methods of achieving an optimal encoding in the data communication channels. After a short description of the
communication channel and of the data communication channel types, follow briefly a few notions of the data channel entropy, information,
transinformation, with their properties, definitions and mathematical relations.

Rockwell Collins, et,al [8], an encoding system analyzes a data file to determine if portions of the data file include significant disparities in
symbol probability. Huffman coding trees are produced for each of the portions of the data file and the portions are separately encoded according
to specific Huffman coding trees. Encoded portions and the corresponding Huffman coding tree are packaged together and transmitted to a
decoder.

Matai, et.al [9], Data compression plays a critical role in data centres to mitigate storage and communication costs. This work focuses on
building a low power, high performance implementation for canonical Huffman encoding. Rettkowski et.al [10], The histogram of oriented
gradients (HOG) algorithm is one of the most reliable and applied algorithms for this task. However the HOG algorithm is also a compute
intensive task.

Dong ping Tian, et.al [11], provides representation and review on image future extraction, finding ideal frames by future extraction method
is challenging task, hence these problems are addressed by gaining effective result in both global and local features. Solaimani K, et.al [12], by
comparison results of three different algorithms those are artificial neural network, support vector machine, and maximum likelihood. The result
using FAST and PHOG algorithm gives effective load reduction in videos.

Aichert Andre, et.al [13], gives overview in the techniques for corner detections in frames like FAST, and also provided which gives a
better result with a comparing to those techniques. Seon Ho, et.al [14], the solutions for crowdsource methods, that kind of problem solved by
publishing problems into websites and making those to generally access and answers.

III. ARCHITECTURE
The architecture of load reduction in video is shown in below figure 3.1. The architecture is divided into two steps namely, training and
testing. In training step, single image is considered for generating key frames. The frames obtained are pre-processed, features are extracted,
SVM algorithm is applied to these frames so as to store key features in the repository referred as Knowledge base store [15]. The key frame in
images gives important pixels details. The knowledge base store already contains few images from frame generation that is obtained previously.

Figure 3.1: System Architecture

Testing step takes video as an input. Video is converted to frames that are later pre-processed to obtained better contrast and quality frames.
From a group of pre-processed frames, only unique and quality frames that are not present in the knowledge base store are selected for feature
extraction [16]. This process is termed as Key frame generation. These frames are subjected to feature extraction by using FAST and PHOG
algorithms. The extracted features are classified using SVM classification and compared with the features that are already present in knowledge
base store. The difference between the frames stored in knowledge based store and the features extracted through FAST and PHOG algorithms
are stored back to the knowledge base store. Before storing, the frames are encoded using Huffman encoding technique [17]. The advantage of
storing only the difference helps in storage utilization, performance upgradation and quicker access.

IV. IMPLEMENTATION
FAST is an interest point in an image is a pixel which has a well-defined position and can be robustly detected. Interest points have high local
information content and they should be ideally repeatable between different images [18]. Interest point detection has applications in image
matching, object recognition, tracking etc. The reason behind the work of the FAST algorithm was to develop an interest point detector for use
in real time frame rate applications like SLAM on a mobile robot, which have limited computational resources [19].
300. Mr. Vasudev Kawati and Dr. G S Mamatha,. LOAD REDUCTION IN VIDEOS USING ADVANCED FAST
ALGORITHM. Journal for Advanced Research in Applied Sciences; Pages: 298-302

The FAST algorithm is explained below:

Step 1: Select a pixel P in the image. Assume that pixel to be to be identified as an interest point.
Step 2: Set threshold value T, (say 20% of the pixel under test).
Step 3: Circle of 16 pixels surrounding the pixel P.
Step 4: N contiguous pixels out of the 16 need to be either above or below IP by the value T, if the pixel needs to be detected as an interest
point. (The authors have used N = 12 in the first version of the algorithm)
Step 5: To make the algorithm fast, first compare the intensity of pixels 1, 5, 9 and 13 of the circle with IP. As evident from the figure above, at
least three of these four pixels should satisfy the threshold criterion so that the interest point will exist.
Step 6: If at least three of the four pixel values - I1, I5, I9, I13 are not above or below IP + T, then P is not an interest point (corner).
Step 7: Repeat the procedure for all the pixels in the image.

V. IMPLEMENTATION RESULTS
The implementation of the algorithm is carried out using Matlab. For study purpose the videos size that has been considered are in MBs.
There is no restriction for the input video size. It can range between GBs to MBs and KBs. Vide file is considered as an input for generating
the frames. Figure 4.1 below shows the generated single input frame for video. Many frames are generated for the single input video. Just a
sample frame is shown below in Figure 4.1.

Figure 4.1: Input frame of video

The selected video will be pre-processed for cleaning data in images and normalization purpose. Pre-processed images have better contrast
and resolution. The frame in Figure 4.1 is pre-processed to obtain a better quality frame as shown in below 4.2.

Figure 4.2: Pre-Processing of video

The below Figure 4.3 shows the comparison of input and output file sizes ratios after applying the FAST algorithm for video size reduction. The
input video size considered is 45MB which is drastically reduced to 300KB after application of encryption method using Huffman encoding.
301. Mr. Vasudev Kawati and Dr. G S Mamatha,. LOAD REDUCTION IN VIDEOS USING ADVANCED FAST
ALGORITHM. Journal for Advanced Research in Applied Sciences; Pages: 298-302

Figure 4.3: Input and Output files Size

To quantify the results obtained from the FAST algorithm a metric considered for comparison is compression ratio which is calculated using the
equation 1.

(1)

From the Figure 4.3 it can be seen that the file size has reduced from 304KB to 166KB with a compression ratio is 8.26 for each frame.

Figure 4.4: Command Window of load reduction results Figure 4.4 clearly shows the input file size, output file size, input frame size and output
frame size.

VI. CONCLUSION AND FUTURE WORK

In the era of digitization, usage of multimedia data has grown up exponentially. People use internet for uploading, viewing, sharing and
storage of multimedia content. Amongst these, videos take huge amount of time for loading, buffering, transmitting etc. over internet The project
successfully addresses the issue of reducing the load and storage consumption of videos. From literature survey it was clear that FAST and
PHOG outperforms other algorithms in terms video size reduction. Usage of FAST and PHOG algorithms has showed tremendous results in
reducing the volume of the videos from GBs to MBs and KBs. Huffman coding technique is successful in encoding the video frames so as to
reduce the size of video. A video of size 45MB is reduced to 300KB. Approximately about 90% of performance improvement is achieved. The
limitation of the current project is limited only to encoding of the video for size reduction. Future work shall include the decoding of the encoded
video frames to get back the original data without any loss of data.

REFERENCES
[1] Singhal S, Jena M. A study on WEKA tool for data preprocessing, classification and clustering. International Journal of Innovative
technology and exploring engineering (IJItee). Volume: 2, Issue: 6, 2013 May, pp: 250-253.

[2] Ejaz N, Tariq TB, Baik SW. Adaptive key frame extraction for video summarization using an aggregation mechanism, Journal of Visual
Communication and Image Representation. 2012 OCT 31; pp: 1031-1040.

[3] Acua G, Mller H. Indirect training of Gray-Box Models using LS-SVM and genetic algorithms. In Computational Intelligence (LA-CCI),
2016 IEEE Latin American Conference on 2016 Nov 2, pp: 1-5.

[4] Hui-Ming Huang, He-Sheng Liu, Guo-Ping Liu, Face Recognition Using Pyramid Histogram of Oriented Gradients and SVM Advances in
information Sciences and Service Sciences(AISS), Volume 4, OCT 2012, pp: 1-8.

[5] Viswanathan, Deepak Geetha. "Features from accelerated segment test (FAST)", Chicago, 2009, pp: 1-5.
302. Mr. Vasudev Kawati and Dr. G S Mamatha,. LOAD REDUCTION IN VIDEOS USING ADVANCED FAST
ALGORITHM. Journal for Advanced Research in Applied Sciences; Pages: 298-302

[6] Ruben Tous, Jordi Torres, Eduard Ayguad e , Multimedia Big Data Computing for In-depth Event Analysis, in proceedings of IEEE
International Conference on Multimedia Big Data, Beijing, 13 JUL 2015, pp: 144-147.

[7] Drghici S, Drugrin CA, Chioncel C. Optimal Encoding of Data in Data Transmission Channels. Analele Universitatii'Eftimie Murgu'.
2013 Jan 1;20(1).

[8] Chau SN, Rashid R, inventors; Rockwell Collins, Inc., assignee. Data compression with Huffman code on multicore processors. United
States patent US 9,258,013. 2016 Feb 9.

[9] Matai, Janarbek, Joo-Young Kim, and Ryan Kastner. "Energy efficient canonical huffman encoding." In Application-specific Systems,
Architectures and Processors (ASAP), 2014 IEEE 25th International Conference on, pp: 202-209.

[10] Rettkowski, Jens, Andrew Boutros, and Diana Ghringer. "HW/SW Co-Design of the HOG algorithm on a Xilinx Zynq SoC." Journal of
Parallel and Distributed Computing (2017).

[11] Dong pin Tain, A review on image feature extraction and representation techniques, International Journal of Multimedia and
Ubiquitous Engineering Volume: 8, Issues: 4, JUL 2013, pp: 386-396.

[12] Uyar, M., Yildirim, S. and Gencoglu, M.T, An effective wavelet-based feature extraction method for classification of power quality
disturbance signals. Electric Power Systems Research, Volume: 78, Issue: 10, pp.1747-1755.

[13] Rokni K, Ahmad A, Solaimani K, Hazini S. A new approach for surface water change detection: Integration of pixel level image fusion and
image classification techniques. International Journal of Applied Earth Observation and Geoinformation. 2015 Feb 28; pp: 226-34.

[14] Andr Aichert, Feature extraction techniques, journal of Camp Medical Seminar volume 13, NOV 2008, pp: 325-333.

[15] Kim, Seon Ho, et al. "Key frame selection algorithms for automatic generation of panoramic images from crowdsourced geo-tagged
videos." International Symposium on Web and Wireless Geographical Information Systems. Springer Berlin Heidelberg, 2014, pp: 67-84.

[16] Durgesh KS, Lekha B. Data classification using support vector machine. Journal of Theoretical and Applied Information Technology.
Volume: 12, Issue: 1, 2010 Feb; pp: 1-7.

[17] Saravanan C, Surender M. Enhancing Efficiency of Huffman Coding using Lempel Ziv Coding for Image Compression. International
Journal of Soft Computing and Engineering, ISSN. 2013 Jan; pp: 2231-2307.

[18] Leonardo Trujillo and Gustavo Olague, Automated design of image operators that detect interest points, Evolutionary Computation,
2008, Volume: 16, Issue: 4, pp: 483-507.

[19] Edward Rosten and Tom Drummond, Fusing points and lines for high performance tracking in Proc. Int. Conf. Computer Vision,
October 2005, vol. 2, pp. 15081511.