\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Enhancement of Map Function Image Processing System using DHRF Algorithm on Big Data in the Private Cloud Tool},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{Enhancement of Map Function Image Processing System using DHRF Algorithm on Big Data in the Private Cloud Tool}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Mehraj Ali.  U}

             \affil[1]{  Thiagarajar College of Engineering, Madurai, Tamilnadu, INDIA.}

\renewcommand\Authands{ and }

\date{\small \em Received: 12 December 2013 Accepted: 1 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


Cloud computing is the concept of distributing a work and also processing the same work over the internet. Cloud computing is called as service on demand. It is always available on the internet in Pay and Use mode. Processing of the Big Data takes more time to compute MRI and DICOM data. The processing of hard tasks like this can be solved by using the concept of MapReduce. MapReduce function is a concept of Map and Reduce functions. Map is the process of splitting or dividing data. Reduce function is the process of integrating the output of the Map?s input to produce the result. The Map function does two various image processing techniques to process the input data. Java Advanced Imaging (JAI) is introduced in the map function in this proposed work. The processed intermediate data of the Map function is sent to the Reduce function for the further process. The Dynamic Handover Reduce Function (DHRF) algorithm is introduced in the reduce function in this work. This algorithm is implemented in the Reduce function to reduce the waiting time while processing the intermediate data. The DHRF algorithm gives the final output by processing the Reduce function. The enhanced MapReduce concept and proposed optimized algorithm is made to work on Euca2ool (a Cloud tool) to produce an effective and better output when compared with the previous work in the field of Cloud Computing and Big Data.

\end{abstract}


\keywords{cloud computing, big data, map reduce, euca2ool, DHRF algorithm.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
loud Computing is a well known concept also known as, IT on Demand. Cloud computing is the concept, which is run by most of the IT companies like e.g. Amazon's EC2, Intel's Intel Manager. Cloud computing package has a set of clients and servers. The packages are powered with high storage capacity, high flexibility and high computing performances. Cloud computing has the several concepts in it like, cloud storage and cloud security; cloud storage reaches to the users a lot. Euca2ool is a Cloud tool, proposed in this work is to enhance the uses of this tool; where the user has to create an account in the Eucalyptus Partner Cloud (EPC). Since this tool can easily interact with Amazon's EC2 on any operating system, this Ecu2ool has been selected in this work. Java Advanced Imaging (JAI) is regularly used for encoding and decoding the image that is saved in the HDFS. JAI is introduced mainly for the betterment of imaging processing process. The job of the JAI is to translate or to transform the image format. The concepts of Big Data, JAI, Hadoop and Map Reduce functions are proposed in this work. This work is executed with the private cum hybrid cloud tool called Euca2ool.\par
The Fig. \hyperref[fig_1]{1} shows the full Architecture of the proposed work. Two set of processing techniques are applied over the input and Fast corner\textunderscore 9 corner detection is also used in the system. Presently, this regular set of work is made with the other corner detection method and scheduling algorithm for 2D to 3D data processing \hyperref[b0]{[1]}. In the proposed work, it has been proved that, there is another better corner method, improved SAD matching and Scheduling DHRF Algorithm, which could benefit the client in the useful manner. DHRF algorithm has proved that, it works better than the existing algorithm while processing the Reduce function. One of the main concepts in the proposed work is introduction of JAI used for image transformation. If the images are in the improper format, JAI changes the image to the right format.  The Fig. \hyperref[fig_1]{1} shows the full Architecture of the proposed work. Two set of processing techniques are applied over the input and Fast corner\textunderscore 9 corner detection is also used in the system. Presently, this regular set of work is made with the other corner detection method and scheduling algorithm for 2D to 3D data processing \hyperref[b1]{[2]}. In the proposed work, it has been proved that, there is another better corner method, improved SAD matching and Scheduling DHRF Algorithm, which could benefit the client in the useful manner. DHRF algorithm has proved that, it works better than the existing algorithm while processing the Reduce function. One of the main concepts in the proposed work is introduction of JAI used for image transformation. If the images are in the improper format, JAI changes the image to the right format.\par
The raw data formats input are converted to the fixed frame size and then the data compression is done. The compressed data is scaled to a fixed frame size. The received output will be a better one with high flexibility, less time estimation and less error percentage. Mostly the medical data will be in the DICOM format and rarely in the JPEG format and the output received will be in the .jpeg format.\par
According to the literature, the best way to process the large volume of data is enhancing Hadoop. Hadoop basically has HDFS (Hadoop Distributed File System) and Map Reduce function. The enhancement of Hadoop over Cloud Computing will obtain additional improvement in result and also in the waiting time. Hadoop can solve the problems like failure of Machines, fault tolerance, which occur during the processing of large set of data. These minor problems may result in the failure of the work. So, in order to overcome these problems, Hadoop is used.\par
When the speed of the machine did not match with the Map Reduce function, the tasks will be delayed \hyperref[b2]{[3]}. To rectify this problem, the Ecu2ool is used to manage the works of the Map Reduce function. To reduce the waiting time during the operation, a Dynamic Handover Reduce function (DHRF) algorithm is implemented in the Reduce function. The proposed algorithm will work on the reduce function to reduce the waiting time during the operation.\par
If there are a few small files, then Map task processes only a little amount of input data, and as a result, there are many unscheduled Map tasks \hyperref[b4]{[4]}. The concept of unscheduled Map task is common. In the proposed work, the Map task are unscheduled, the process of intermediate data to the Reduce function will be a little hard task. So, according Tin-Yu Wu et al \hyperref[b0]{[1]}, a switch algorithm was proposed. But, since there may occur some technical fault while processing the Reduce function, Handover technique is implemented. So that, the process will wait, until each process gets over completely. The HDFS system is utilized in this process. The cases may be either the small pieces of data or the large volume of data; the HDFS storing system supports all the formats for storing the data.\par
This paper reports the experimental work on big data problem and its optimal solution using Hadoop cluster, Hadoop Distributed File System (HDFS) for storage and using parallel processing to process large data sets using Map Reduce programming framework \hyperref[b5]{[5]}. Big data chunks with different size and sequence will be computed in each node, so that transfer of a chunk is overlapped with the computation of the previous chunk in the node, as much as possible \hyperref[b6]{[6]}. The data transfer delay can be comparable or even higher than the time required for computing the data \hyperref[b7]{[7]}. Use of Dynamic Switch of Reduce Function (DSRF) algorithm, a scheduling scheme on the Reduce functions for users who compute simultaneously to acquire Reduce resources to finish the tasks efficiently \hyperref[b8]{[8]}.\par
In the proposed work, Dynamic Handover Reduce function (DHRF) algorithm is implemented in the Reduce function where the system waits until the process get over. The proposed module converts the size and format of the image using the following options: max Width, max Height, Image Format \hyperref[b1]{[2]}. JAI is introduced with small change in the coding. If max Width, max Height, is the case, it would take more space in HDFS. This may result in occupation of more space. The Reduce function will wait for the Map function to generate intermediate data; the Reduce function can switch to another task to combine the image data first \hyperref[b0]{[1]}. The case of incompletion may occur while processing the Reduce function in the existing work, when the machine get faults like virus attacks, corruption of Operating System and others. 
\section[{a) Hadoop Distributed File System (HDFS)}]{a) Hadoop Distributed File System (HDFS)}\par
Hadoop Distributed File System is the file storing section of Hadoop. Fig. \hyperref[fig_3]{2} shows the format, by which the inputs in the various forms or formats are stored. Those inputs or the data gets stored in HDFS to process the Map Reduce Function. HDFS handles both the structured and unstructured data. The Hadoop's job is to split the data and distribute to the hosts to compute. This work will be done simultaneously in the parallel manner. This is called as distributed and parallel computing. The host depends upon the strength and the storage of the computing capacity.  
\section[{Data Processing Techniques}]{Data Processing Techniques}\par
In the proposed work, two various types of image processing techniques are applied for the input (Big Data) as shown in the Fig.  {\ref 3}. The first technique is the combination Grayscale and Sobel edge detection. The second technique is the combination of Gaussian Blur and Fast Corner detection method. The Grayscale conversion is the best method to convert the original image into Black and White image and Sobel edge detection is the method of detecting the edges of the images. 
\section[{Figure 3a : Sketch of Data Processing Techniques}]{Figure 3a : Sketch of Data Processing Techniques}\par
Gaussian Blur is the best blurring technique ever, used here to blur the input image. Finally the Fast Corner Detection technique, since that is the best technique. After the completion of both the processing, the data is then transferred to the next level of Matching called SAD matching. Then the integration of the intermediate data is done to recognize the output. 
\section[{a) Harris corner detection}]{a) Harris corner detection}\par
The Harris corner detection is used in case when there is a correlation in the threshold of data. A detection method which could give a better result than the Harris corner is, Fast corner\textunderscore 9 which is shown in Fig. \hyperref[fig_5]{4}. Fast corner\textunderscore 9 has been applied in the proposed work, to fine tune the result than the Harris corner, Susan, zheng and harr \hyperref[b9]{[9]} methods.\par
The given equation finds the solution for the Harris corner method with the argument (u,v). In Harris corner, a square mask with point p (x, y) was established. When the mask of Grayscale value is higher than the threshold, the point P is defined as the corner. Here E denotes the patch area, I denotes the given image. Where (u,v) denotes the image patch point and while processing, (x,y) get shifted from (u,v). 
\section[{b) Fast Corner 9}]{b) Fast Corner 9}\par
In the presence of various Corner detection methods include Harris corner method, Susan, zheng and harr. Among these methods, Fast corner\textunderscore 9 is used due to higher clarity when compared with other corner detection method. This Fast corner detection has come from Moravec (SSD) and the Harris Corner Detection (second derivative of SSD). By using the non minimal suppression it is determined. This is calculated by subtracting the original value, by comparing the p value and with t value. This has been implemented on Client Machine with the configuration Intel (R) Core 2 duo, 4 GB RAM and 2.93 GHz processor and the Server with the Configuration of IBM X 3400 M3 Server, Intel Xeon E 5507 (Quad Core), 2.26 Ghz Processor, 146 GB DDR3-1333 Mhz ECC RAM, 146 GB 10K SAS Hard Disk Drive.\par
Where p denotes the Grayscale value and t denotes the Threshold value. 
\section[{c) Sum of Absolute difference (SAD)}]{c) Sum of Absolute difference (SAD)}\par
SAD is a mathematical term that has been enhanced here to find between differences the two P blocks of the processed data.\par
Where, A 1 and A 2 are the two images. Like the Harris Corner method, here also (u,v) denotes the image patch area and while processing, (x,y) gets shifted from (u,v). Before the implementation of SAD there is an existence of SSD (Sum of Squared Differences) to find the difference. As SSD is an old, it isn't able to produce a clear result like SAD. The Relationship between the intersection points detected by Harris corner detection method and labels the corresponding points for computers to judge the corresponding locations of intersection. In relationship between the corners, the interpolations are used to judge the location of the corner while being photographed to simulate the data. 
\section[{III.}]{III.} 
\section[{Proposed Work}]{Proposed Work}\par
Euca2ool is a Cloud tool that is private cum hybrid Cloud Tool. Though there are many tools to solve the problems in big data.. This enhanced tool will definitely give the better result in both the time and cost estimation. Basically Hadoop is enhanced of HDFS and Map Reduce function. Since the Map Reduce function is an open source, the codes can be edited and modified. The coding is edited now in the Map part. The coding is made in such a way that, the inputs are split into maximum of ten parts. So that the Map function will be easy while processing. This change in the Map function will reduce the processing time.\par
The coding or the application set up of the image processing techniques is installed on the Euca2ool, to run the experiment. Basically Map is the primary function in the process of Big Data. Splitting the data into maximum number of part is called as Map Function. In the proposed work, Pre-Map concept is implemented. Pre-Map is the concept of Map the Map function. The situation in which, when the Map function is proposed to do, the data will be mapped before the Map function into maximum number of parts. 
\section[{a) How Cloud Computing is involved in Image}]{a) How Cloud Computing is involved in Image}\par
Processing in the proposed work?\par
The HDFS is used to store, retrieve and process the data. Few image processing techniques are used in the cloud computing. Since, Big Data is referred to the context called image/data. When the data is taken as the input, it is made to undergo the Map Function. The function of the Map function is to Split the data into maximum number of data called as intermediate data.\par
Those intermediate data are split to process further. Two sets of image processing techniques are used in the Cloud Computing.\par
JAI does the task of converting the data. Either the data may be a structured or unstructured one. By using the JAI, the data are converted to structured data. When the image is processed by the template, the image is compressed and scaled then produces the Map functions. In the first set of Grayscale method, it delivers the image in black and white without noise disturbances. The Grayscale image output handovers the edge detection technique to the next process. It removes the outer layer of noise disturbance. So enhancement of the best edge detection technique called Sobel edge detection technique is done.\par
Then the implementation of Gaussian blur reduces the image noise. It is for pre-processing stage for any image enhances structure. So the retrieval of formal blur image can be used for the detection of corners. The corner method defined as a point of two different edge directions and dominant. In this, corner detector works uses only a segment test, so the result is very accurate and quality at the mean time of time reducing in the .jpeg format.\par
Finally Map function results are sent to reduce operation. The implementation of DHRF algorithm focuses on Reduce function integrating the task and allots the process to produce the result .Jpeg format. In Reduce function, it involves the small unit of value for determining the task and sequentially it completes the process. Whether the process is completed, it produces the result .jpeg format.\par
V. 
\section[{Result And Discussion}]{Result And Discussion}\par
Fig \hyperref[fig_6]{5} shows the result of the Fast Corner method. In this figure, the sharp edges and the damaged parts are pointed out sharply. The red mark shows the infected corners. When compared with the Harris corner method in the existing work \hyperref[b1]{[2]}, this is proved to be the best corner detection. The application of the two image processing techniques, gives the expected result. The main advantage during the execution was, the output of the data is marked with better quality and there is the usage of Fast corner\textunderscore 9 method to detect the corners of the image. While comparing with existing, proposed Fast corner\textunderscore 9 method shows the corner more clearly. During the comparison, it has been proved that, the method applied in the proposed algorithm works better than the existing. Whatever the size or format of images may be, the result will be produced in the pre defined format. The result occupies less space when compared with the size of the input for storing.\par
The Fig 6 graphical representation is between the estimated time and total number of Machines. In the proposed system, the taken to process the image is comparatively less than that of existing system.   
\section[{Conclusion}]{Conclusion}\par
Already an existing work was done with four data processing techniques and with an algorithm was implemented in the Reduce function. But in this proposed system, the processing techniques have reduced from four to two image processing techniques, with proposed an optimized scheduling algorithm. This work resulted with less waiting time and error percentage. An application of JAI and Pre-Map technique with Hadoop over Ecua2ool results with far better result in the entire manner when compared with the existing system. Further, our research works will be on application of scheduling over the Heterogeneous Networks for scheduling and resource allocation. \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3b}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 3b :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Fig 4}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-9.png}
\caption{\label{fig_7}Figure 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-10.png}
\caption{\label{fig_8}Figure 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-11.png}
\caption{\label{figure11}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 			\footnote{© 2014 Global Journals Inc. (US)} 		 		\backmatter  			 
\subsection[{Data Container}]{Data Container} 
\subsection[{HDFS Map Reduce}]{HDFS Map Reduce}\par
Enhancement of Map Function Image Processing System using DHRF Algorithm on Big Data in the Private 			 			  				\begin{bibitemlist}{1}
\bibitem[Page ()]{b3}\label{b3} 	 		\textit{},  		 			Page 		.  		2012. p. .  	 
\bibitem[Patel et al.]{b2}\label{b2} 	 		‘Addressing big data problem using Hadoop and Map Reduce, Engineering (NUiCONE)’.  		 			A B Patel 		,  		 			M Birla 		,  		 			U Nair 		.  		 \xref{http://dx.doi.org/10.1109/NUICONE.2012.6493198}{10.1109/NUICONE.2012.6493198}.  	 	 		\textit{Nirma University International Conference on Digital Object Identifier},  				 	 
\bibitem[Berman ()]{b9}\label{b9} 	 		 			Jules J Berman 		.  		\textit{Simple but Powerful Big Data Techniques, Principles of Big Data Preparing, Sharing, and Analyzing Complex Information" Page(s)},  				2013. p. .  	 	 (Publication Year) 
\bibitem[Shini and Thomas ()]{b6}\label{b6} 	 		‘Cloud Based Medical Image Exchange-Security Challenges’.  		 			. S G Shini 		,  		 			Dr Thomas 		,  		 			Chithraranjan 		.  	 	 		\textit{Procedia Engineering}  		2012. 2012. 38 p. .  	 	 (Publication Year) 
\bibitem[Ryan ()]{b8}\label{b8} 	 		‘Cloud computing security, The scientific challenge, and a survey of solutions’.  		 			Mark D Ryan 		.  	 	 		\textit{The Journal of Systems and Software xxx},  				2013.  	 
\bibitem[Chen et al. ()]{b0}\label{b0} 	 		‘Cloud-Based Image Processing System With Priority-Based Data Distribution Mechanism’.  		 			Tin-Yu Wu Chi-Yuan Chen 		,  		 			Ling-Shang Kuo 		,  		 			Wei-Tsong Lee 		,  		 			Han-Chieh Chao 		.  	 	 		\textit{Computer communi -cations}  		2012. 4676.  	 	 (COMCOM) 
\bibitem[Haoyu ()]{b5}\label{b5} 	 		\textit{FAST corner detection-Machine learning for high speed corner detection},  		 			Haoyu 		.  		2010.  	 	 (Publication Year) 
\bibitem[Lee et al.]{b1}\label{b1} 	 		\textit{Implementation of Map Reduce -based Image Conversion Module in Cloud Computing Environment},  		 			Hyeokju Lee 		,  		 			Myoungjin Kim 		,  		 			Joon Her 		,  		 			Hanku Lee 		.  		 978-1-4673-0250-0/12/\$31.00 ©2012 IEEE.  		 	 
\bibitem[Sheikh ()]{b7}\label{b7} 	 		\textit{Implementing Analytics A Blueprint for Design, Development, and Adoption},  		 			Nauman Sheikh 			\mbox{}\\  				Cloud Computing 			 		.  		2013.  	 	 (Pages 185-197, Publication Year) 
\bibitem[Jung ; Gnanasambandam and Mukherjee]{b4}\label{b4} 	 		‘Synchronous Parallel Processing of Big-Data Analytics Services to Optimize Performance in Federated Clouds, Cloud Computing (CLOUD)’.  		 			Gueyoung Jung ; Gnanasambandam 		,  		 			N Mukherjee 		,  		 			T 		.  		 \xref{http://dx.doi.org/10.1109/CLOUD.2012.108}{10.1109/CLOUD.2012.108}.  	 	 		\textit{IEEE 5th International Conference on Digital Object Identifier},  				p. .  	 	 (Page(s) 
\end{bibitemlist}
 			 		 	 
\end{document}
