\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={Multi Modal Medical Image Registration: A New Data Driven Approach},
 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{2018-01-15 (revised: 15 January 2018)}
\def\TheID{\makeatother }
\def\TheDate{2018-01-15}
\title{Multi Modal Medical Image Registration: A New Data Driven Approach}
\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]{C. Hemasundara  Rao}

             \author[2]{Dr. P.V.  Naganjaneyulu}

             \author[3]{  Dr.K.Satyaprasad}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 11 December 2017 Accepted: 1 January 2018 Published: 15 January 2018}

\maketitle


\begin{abstract}
        


Image registration is a challenging task in building computer-based diagnostic systems. One type of image modality will not be able to provide all information needed for better diagnostic. Hence data from multiple sources/image modalities should be combined. In this work canonical correlation analysis (CCA) based image registration approach has been proposed. CCA provides the framework to integrate information from multiple sources. In this work, the information contained in both images is used for image registration task. T1-weighted, T2- weighted and FLAIR MRI images has Multimodal registration done on it. The algorithm provided better results when compared with mutual information based image registration approach. The work has been carried out using the 3D rigid registration of CT and MRI images. The work is carried out using the public datasets, and later performance is evaluated with the work carried out by Research scholars previously. Our algorithm performs better with mutual information based image registration. Medical image registration of multimodality images like MRI, MRI-CT, and MRI-CT-PET. In this paper for MRI-CT Medical Image Registration CT image is used as a fixed image and MRI image as moving image and later compared results with some benchmark algorithm presented in literature such as correlation coefficient, correlation ratio, and mutual information and normalized mutual information methods.

\end{abstract}


\keywords{image registration, CCA, CT, MRI, T1, T2, FLAIR, FD, MIR, Rigid registration, MI, NMI, SSD, SAD.}

\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
he medical image registration process is used to estimate the deformation between the images while considering the domain specific Information into consideration. A closer look at the problem statement intuitively reveals two methods of solving it. The first method operates directly on two different images have intensity values called intensity based registration \hyperref[b0]{[1]}, continuously transforming the entire image to align it with the other. When desirable alignment is obtained for the respective transformation, the optical representation is considered to be registered. These methods are called area based methods \hyperref[b1]{[2,}\hyperref[b2]{3]}. The second method relies on a few salient points which are most prominent in both the images. The goal here is to estimate the deformation based on the corresponding pairs of points/regions across the images.\par
These are known as feature-based medical picture based on brain methods, have gained popularity over the area based methods These methods \hyperref[b3]{[4]} are more robust to illumination changes, a partial overlap between the images, occlusion, alterations in background, and viewpoint. Area-based methods are still preferred over feature based techniques, despite these advantages in the medical domain due to two main factors: 1) Its ability to handle local deformations, especially with the case of human organs. 2) Its capability of Dealing with information from different imaging sources. 
\section[{Fig. 1: Image Registration Process a) Transformation}]{Fig. 1: Image Registration Process a) Transformation}\par
Transformation step is to determine the position of corresponding points in reference and sensed images, Medical Image Registration (MIR) is considered as a combination of translation, rotation, and scaling parameters. Image registration methods employ transformations such as rigid, affine and elastic (nonrigid transformations \hyperref[b5]{[5]}. The rigid transformation considers t x and t y translations along the x-axis and yaxis, and a rotational angle ? for the registration process \hyperref[b6]{[6]}. It assumes that the subject in the image maintains its shape and size \hyperref[b7]{[7]}. Affine transformations offer a high degree of flexibility in accommodating linear distortions by allowing and shearing in addition to translation and rotation \hyperref[b8]{[8]}. The non-rigid transformation provides more degree of freedom as compared to rigid and affine transformation. 
\section[{b) Optimization}]{b) Optimization}\par
Optimization problem is formulated by a number of parameters used for transformation \hyperref[b9]{[9]} to get the maximum value of similarity, for a given registration process. The choice of the transformation is dependent on the type of application and its geometrical complexity (i.e., degrees of freedom). Although an exhaustive search guarantees an optimal solution, its computational expense is proportional to the size of the search space as well as the number of parameters used for transformation and, hence, becomes infeasible as they increase \hyperref[b10]{[10]}. Therefore, these forms the motivation to explore refined search strategies or optimization methods which can help to find the maximum value for a given similarity measure.\par
Optimization method should be reliable and be capable of finding the best possible transformation quickly \hyperref[b11]{[11]}. Many optimization methods have been introduced and adopted for the registration process, by the transformation parameters, similarity measure, time restrictions and required accuracy of registration. 
\section[{c) Similarity Measure}]{c) Similarity Measure}\par
Similarity measure gives the ability to determine the level of global correspondence between two images. During the registration process, the parameters of a given transformation model are changed, based on the optimization technique until the similarity measure reaches a maximum value of alignment \hyperref[b12]{[12]}.Hence the choice of similarity measure along with optimization method plays a crucial role to a successful outcome of a registration process. 
\section[{II. IMAGE REGISTRATION ALGORITHM a) Medical Image Registration}]{II. IMAGE REGISTRATION ALGORITHM a) Medical Image Registration}\par
In Non-rigid registration consists of Non-rigid transformations can be broadly classified by physical models or basis function expansion. While linear elasticity (Moshfeghi,1991), viscous fluid flow \hyperref[b13]{[13]} and optical flow \hyperref[b14]{[14]} are examples of physical model-based transformations, radial basis functions \hyperref[b15]{[15]}, multi quadrics \hyperref[b16]{[16]}, thin-plate splines \hyperref[b18]{[17]}, B-spline \hyperref[b19]{[18]}, wavelets \hyperref[b20]{[19]} and piecewise affine transforms \hyperref[b21]{[20]} are some of basis function expansion transformations, involves finding the optimal geometric transformation that maximizes the correspondences across the images. Medical Image Registration consists of components such as Transformation Model, Similarity Metric and Optimization Techniques as shown in Fig 1  {\ref .} An image registration algorithm defines an objective function based on the similarity measure and tries to maximize this objective function. In the proposed method, a new registration method has been explained using canonical correlation analysis (CCA). 
\section[{b) Canonical Correlation Analysis (CCA)}]{b) Canonical Correlation Analysis (CCA)}\par
Canonical Correlation Analysis (CCA) can be seen as the problem of finding the basis vectors for two set of variables such that correlation between projections of the variables on these basis vectors is mutually maximized. CCA seeks a pair of linear or nonlinear transforms one for each step of variables, such that when one set of variables, is transformed, the corresponding coordinates are maximally correlated. CCA used in image retrieval, image fusion \hyperref[b22]{[21]} and object recognition problems \hyperref[b23]{[22]} in computer vision.\par
CCA finds the relationship between two multidimensional datasets \hyperref[b22]{[21]}. The basic formulation of CCA is as follows:\par
For a given two multi-dimensional data sets of basis vectors or projection vectors wx, wy respectively, for two data sets that maximize the correlation between the random variables x=w x T (xi-x) and y= w y T (yi-y),?? = ??[??,??] ???[?? 2 ]??[?? 2 ] = ??[???? ? ?? ???? ?? ???? ? ] ???? ???? ?? ???? ?? ???? ? ? ???[???? ?? ? ???? ?? ???? ? ]\par
(2.1)?? = ???? ? ?? ?????????? ] ?? ???? ?? ??????????? ???? ?? ?????????? (2.2)\par
C xx and C yy are the within-class covariance matrix and, C xy is the cross -covariance matrix. Maximum correlation has been found as follows.? = argmax (W x T C xy Y T W y ) (2.3) s.t W x T C xx W x =1 and W y T C yy W y =1\textbf{(2.4)}\par
The Basic formulation of CCA has the following disadvantage. 1. CCA finds the only linear relationship between two datasets. 2. Difficult to extend more than two data sets.\par
These problems can be addressed using the following ways. 1. A non-linear relationship between the data sets can be addressed using kernel extension of CCA \hyperref[b24]{[23]}.\par
Kernel CCA defines the non-linear mapping of two datasets ?: x ? ?(x) and ?: y ? ?(y) and performs the traditional CCA on transformed datasets. 2. Neural network based CCA extracts the non-linear relationship between datasets. 3. Locality preserving method based CCA also extracts a non-linear relationship between datasets. 
\section[{III. Algorithm for Image Registration}]{III. Algorithm for Image Registration}\par
Image Registration methods are trying to find the relationship between two images in intensity domain or feature domain. Regarding similarity measures this relationship is defined. Similarity measures can be classified in two categories (i) in all; similarity measure quantifies the spatial alignment between two images. Various intensity-based similarity measures such as sum of squared difference (SSD) \hyperref[b25]{[24]}, sum of absolute difference (SAD) \hyperref[b26]{[25]}, correlation coefficient (CC) \hyperref[b27]{[26]}, NCC \hyperref[b28]{[27]} and ratio image uniformity (RIU) \hyperref[b29]{[28]} have been proposed for mono modal registration process. These measures do not perform well in all cases. While SSD \hyperref[b26]{[25]} is highly sensitive to Gaussian noise, SAD is less responsive to outliers on the subject boundaries. CC, NCC and, RIU perform well in these conditions, but are highly sensitive to non -uniform illumination in the images and (ii) The Non-linear similarity measures such as mutual information or divergence measures, etc. Multimodal image registration, the images are captured through different sensors (CT or MRI) or different parameters (T1, T2 or FLAIR) so that the intensity relationships between images are highly non-linear.\par
In this work, based on the structural representation of images an algorithm has been proposed. The dense set of descriptors which perform the intensity based registration replace the input images. The advantage of this method is that after new representation, one can use any simple similarity measure such as L2 norm or SSD \hyperref[b26]{[25]} for multimodal image registration. 
\section[{Given two images find projection directions using}]{Given two images find projection directions using}\par
Kernel CCA (Gaussian kernel used for projection). 2. Project original images or features in lower dimension space using projection direction. 3. Use L2 norm as a similarity measure.\par
In this algorithm Gradient descent uses ? optimization function. 
\section[{IV. Methodology}]{IV. Methodology}\par
Using two sets of experiments the work has been carried out and is detailed below 1. First set of demonstrations on T1 and T2 MR Images for 3D rigid registration (RIRE dataset). Experiments are carried out with the specifications: 15mm translation and 10-degree rotation as a deviation from correct position with ten times with different affine parameter settings. Mutual information based method for rigid registration has been used to be compared against the experimental results. We show the absolute error for translation (in mm), rotation (in degree) and root mean square error (RMS) in Tab. 1. Consider 1 mm equal to 1 degree for the absolute error computation. CCA has been performed on for more than two modalities (T1, T2, and PD) also. Tab. 2 Shows results for Brain web dataset. Comparison purpose uses the MIbased on pairwise registration framework. CCA based method performs better regarding accuracy (Tab1) (in translation and rotation) compared to MI-based method. CCA based method improves overall accuracy to 6.7\% in pairwise registration and 13 \% in Groupwise registration compared MI-based method. The Degree of freedom: 9 0  The work has been carried out using two sets of experiments and are detailed below.  {\ref Table 1:}    For the error calculation, five manual points were marked on the MRI image. In the second set of images also the experiments in a similar environment and the same method are used for error calculation. Results have been shown in following Tab.4.     
\section[{V. Results}]{V. Results} 
\section[{a) Figures and Tables}]{a) Figures and Tables} 
\section[{Conclusion}]{Conclusion}\par
In this work new algorithm, CCA has been proposed for image registration. In multimodal framework, due to different acquisition parameters, the relation between datasets not follows the linear relationship. In this algorithm, the kernel version of canonical correlation analysis was used because the basic formulation of CCA gives the only linear relationship between datasets. The results are shown in Table  {\ref I}, Table  {\ref II} Two sets of experiments have been performed on the RIRE datasets (T1, T2, and PD images). (i) Pair wise registration and (ii) Group-wise registration. From table I, Table  {\ref II}, it is evident that group-wise registration performs well compared to pairwise registration because group-wise registration consists of extra information (due to other modalities) which helps registration. The advantage of using CCA based method is one can easily extend this framework for more than two modalities.\begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Fig. 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{53}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Fig. 5 Fig. 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.1660919540229885\textwidth}P{0.22471264367816093\textwidth}P{0.22471264367816093\textwidth}P{0.23448275862068965\textwidth}}
Method\tabcellsep Translation x(mm)\tabcellsep Translation y(mm)\tabcellsep Rotation (Degrees)\\
MI-based\tabcellsep 3.1\tabcellsep 2.0\tabcellsep 4.2\\
CCA\tabcellsep 2.9\tabcellsep 1.8\tabcellsep 4.0\end{longtable} \par
 
\caption{\label{tab_0}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{P{0.4204301075268817\textwidth}P{0.4295698924731183\textwidth}}
Moving image\tabcellsep Static image\\
Registered Image\textunderscore MI\tabcellsep Registered image\textunderscore CCA\end{longtable} \par
 
\caption{\label{tab_1}Table 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4} \par 
\begin{longtable}{}
\end{longtable} \par
  {\small\itshape [Note: provide bone structure information and, MRI dispenses soft tissue information of brain. For accurate tumor diagnostic one needs CT and MRI information. In this work 3D, rigid registrations of CT and MRI images were performed. In this work CT image used as the fixed image and MRI image as moving image. On comparing results with some benchmark, algorithm presents in literature such as mutual information; normalize mutual information and correlation-based approaches.]} 
\caption{\label{tab_3}Table 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_5}Table 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_6}}\end{figure}
 			\footnote{© 2018 Global JournalsMulti Modal Medical Image Registration: A New Data Driven Approach} 		 		\backmatter   			 
\subsection[{ACKNOWLEDGMENT}]{ACKNOWLEDGMENT}\par
The authors are thankful to Apollo Hospitals Educational and Research Foundation (AHERF) 1 st Floor, Apollo Health City, Jubilee Hills, Hyderabad-96 for providing the necessary images and detailed explanation of abnormality. University Grant Commission (SERO) has supported this respective Minor Research Project, Government of India via letter no. F. No. MP-6226/15(SERO/UGC). 			  			  				\begin{bibitemlist}{1}
\bibitem[ IEEE Transactions on Medical Imaging]{b4}\label{b4} 	 		\textit{},  	 	 		\textit{IEEE Transactions on Medical Imaging}  		19  (8)  p. .  	 
\bibitem[Jun and Da]{b17}\label{b17} 	 		\textit{},  		 			Yi Jun 		,  		 			Da 		.  	 	 		\textit{Xue Xue Bao = Academic Journal of the First Medical College of PLA}  		22  (7)  p. .  	 
\bibitem[Jenkinson and Smith ()]{b8}\label{b8} 	 		‘A global optimisation method for robust afine registration of brain images’.  		 			M Jenkinson 		,  		 			S Smith 		.  	 	 		\textit{Medical Image Analysis}  		2001. 5  (2)  p. .  	 
\bibitem[Akaho ()]{b24}\label{b24} 	 		‘A kernel method for canonical correlation analysis’.  		 			S Akaho 		.  	 	 		\textit{IMPS2001-International Meeting of Psychometric Society},  				2001.  	 
\bibitem[Lemieux et al. ()]{b26}\label{b26} 	 		‘A patient-tocomputed-tomography image registration method based on digitally reconstructed radiographs’.  		 			L Lemieux 		,  		 			R Jagoe 		,  		 			D R Fish 		,  		 			N D Kitchen 		,  		 			D G T Thomas 		.  	 	 		\textit{Medical Physics}  		1994. 21  (11)  p. .  	 
\bibitem[Brown ()]{b6}\label{b6} 	 		‘A survey of image registration techniques’.  		 			L G Brown 		.  	 	 		\textit{ACM Computing Surveys}  		1992. 24  (4)  p. .  	 
\bibitem[Maintz and Viergever ()]{b0}\label{b0} 	 		‘A survey of medical image registration’.  		 			J Maintz 		,  		 			M A Viergever 		.  	 	 		\textit{Medical Image Analysis}  		1998. 2  (1)  p. .  	 
\bibitem[Maintz and Viergever ()]{b30}\label{b30} 	 		‘A survey of medical image registration’.  		 			J B A Maintz 		,  		 			M A Viergever 		.  	 	 		\textit{Medical Image Analysis}  		1998. 2  (1)  p. .  	 
\bibitem[Khaderm (2011)]{b31}\label{b31} 	 		‘An entropy -based technique fo r nonrigid medical image alignment’.  		 			Hamzaab Khaderm 		.  	 	 		\textit{Proceedings of the 14th International Workshop Combinatorial Image Analysis -IWCIA 2011},  				 (the 14th International Workshop Combinatorial Image Analysis -IWCIA 2011Madrid, Spain)  		2011. May 23-25. p. .  	 
\bibitem[Saito and Kitaguchi ()]{b23}\label{b23} 	 		\textit{App earance Modeling for Object Pose Recognition using Canonical Correlation Analysis},  		 			M Saito 		,  		 			K Kitaguchi 		.  		2006. SICE-ICASE.  	 
\bibitem[Yu ()]{b7}\label{b7} 	 		\textit{Automatic Rigid and Deformable Medical Image Registration},  		 			H Yu 		.  		2005. Worcester Polytechnic Institute.  	 	 (PhD thesis) 
\bibitem[Denton et al. ()]{b19}\label{b19} 	 		‘Comparison and evaluation of rigid, afine, and nonrigid registration of breast MR images’.  		 			E R Denton 		,  		 			L I Sonoda 		,  		 			D Rueckert 		,  		 			S C Rankin 		,  		 			C Hayes 		,  		 			M Leach 		,  		 			D L Hill 		,  		 			D J Hawkes 		.  	 	 		\textit{Journal of Computer Assisted Tomography}  		1999. 23  (5)  p. .  	 
\bibitem[Horn and Schunck ()]{b14}\label{b14} 	 		‘Determining optical flow’.  		 			B K Horn 		,  		 			B G Schunck 		.  	 	 		\textit{Artificial Intelligence}  		1981. 17  (1-3)  p. .  	 
\bibitem[Zhang et al. ()]{b16}\label{b16} 	 		\textit{Elastic registration of medical images through multiquadric method},  		 			Y Zhang 		,  		 			G.-P Jiang 		,  		 			S.-X Li 		,  		 			Z.-X Liu 		,  		 			X.-M Xie 		,  		 			W.-F Chen 		.  		2002.  	 
\bibitem[Hajnal and Hill ()]{b9}\label{b9} 	 		 			J V Hajnal 		,  		 			D L G Hill 		.  		\textit{Medical Image Registration},  				2001. CRC Press.  	 
\bibitem[Wilson and Laxminarayan ()]{b12}\label{b12} 	 		‘Handbook of Biomedical Image Analysis’.  		 			D Wilson 		,  		 			S Laxminarayan 		.  	 	 		\textit{Registration Models},  				2007. Springer Science \& Business Media. 3.  	 
\bibitem[Pluim et al. ()]{b3}\label{b3} 	 		\textit{Image registration by maximization of combined mutual information and gradient},  		 			J P Pluim 		,  		 			J B Maintz 		,  		 			M A Viergever 		.  		2000a.  	 
\bibitem[Zitová and Flusser ()]{b5}\label{b5} 	 		‘Image registration methods: a survey’.  		 			B Zitová 		,  		 			J Flusser 		.  	 	 		\textit{Image and Vision Computing}  		2003. 21  (11)  p. .  	 
\bibitem[Wu et al. ()]{b20}\label{b20} 	 		‘Image Registration Using Wavelet-Based Motion Model’.  		 			Y.-T Wu 		,  		 			T Kanade 		,  		 			C.-C Li 		,  		 			J Cohn 		.  	 	 		\textit{Int. J. Comput. Vision}  		2000. 38  (2)  p. .  	 
\bibitem[Goshtasby ()]{b11}\label{b11} 	 		\textit{Image Registration: Principles, Tools and Methods},  		 			A A Goshtasby 		.  		2012. London: Springer.  	 
\bibitem[Sun and Chen ()]{b22}\label{b22} 	 		‘Locality preserving CCA with applications to data visualization and pose estimation’.  		 			Tingkai Sun 		,  		 			S]ongcan Chen 		.  	 	 		\textit{Image and Vision Computing}  		2007. 25 p. .  	 
\bibitem[Hill et al. ()]{b2}\label{b2} 	 		‘Medical image registration’.  		 			D L G Hill 		,  		 			P G Batchelor 		,  		 			M Holden 		,  		 			D J Hawkes 		.  	 	 		\textit{Physics in Medicine and Biology}  		2001. 46  (3)  p. .  	 
\bibitem[Collignona et al. ()]{b32}\label{b32} 	 		‘Multimodality medical image r egistration by maximization of mutual information’.  		 			Maesf Collignona 		,  		 			Vandermeulend 		,  		 			Marchalg 		,  		 			Suetensp 		.  	 	 		\textit{IEEE Trans Med Imaging}  		1997. 16  (2)  p. .  	 
\bibitem[Pluim et al. ()]{b1}\label{b1} 	 		‘Mutual Information Based Registration of Medical Images: A Survey’.  		 			J Pluim 		,  		 			J B A Maintz 		,  		 			M Viergever 		.  	 	 		\textit{IEEE Transactions on medical imaging}  		2003. 22  (8)  p. .  	 
\bibitem[Crum ()]{b21}\label{b21} 	 		‘Non-rigid image registration: theory and practice’.  		 			W R Crum 		.  	 	 		\textit{British Journal of Radiology}  		2004. 77  (2)  p. .  	 
\bibitem[Rogelj and Kova ?i? ()]{b28}\label{b28} 	 		‘Point Similarity Measure Based on Mutual Information’.  		 			P Rogelj 		,  		 			S Kova ?i? 		.  	 	 		\textit{Biomedical Image Registratio n},  		Lecture Notes in Computer Science  		 			J C Gee,  			J B A Maintz,  			M W Vannier 		 (ed.)  		 (Berlin Heidelberg)  		2003. Springer. 2717 p. .  	 
\bibitem[Bookstein ()]{b18}\label{b18} 	 		‘Principal warps: thin-plate splines and the decomposition of deformations’.  		 			F L Bookstein 		.  	 	 		\textit{IEEE Transactions on Pattern Analysis and Machine Intelligence}  		1989. 11  (6)  p. .  	 
\bibitem[Fornefett et al. ()]{b15}\label{b15} 	 		‘Radial basis functions with compact support for elastic registration of medical images’.  		 			M Fornefett 		,  		 			K Rohr 		,  		 			H Stiehl 		.  	 	 		\textit{Image and Vision Computing}  		2001. 19  (1-2)  p. .  	 
\bibitem[Freire and Godinho ()]{b33}\label{b33} 	 		‘Registration by maximization of mutual information -a cross validation study’.  		 			L Freire 		,  		 			F Godinho 		.  	 	 		\textit{IEEE International Symposium on Bio-Informatics and Biomedical Engineering}  		2000. p. .  	 
\bibitem[Cideciyan ()]{b27}\label{b27} 	 		‘Registration of ocular fundus images: an algorithm using cross-correlation of triple invariant image descriptors’.  		 			A Cideciyan 		.  	 	 		\textit{IEEE Engineering in Medicine and Biology Magazine}  		1995. 14  (1)  p. .  	 
\bibitem[Friston et al. ()]{b25}\label{b25} 	 		‘Spatial registration and normalization of images’.  		 			K J Friston 		,  		 			J Ashburner 		,  		 			C D Frith 		,  		 			J.-B Poline 		,  		 			J D Heather 		,  		 			R S J Frackowiak 		.  	 	 		\textit{Human Brain Mapping}  		1995. 3  (3)  p. .  	 
\bibitem[Khalifa et al. ()]{b10}\label{b10} 	 		‘State-of-the-Art Medical Image Registration Methodologies: A Survey’.  		 			F Khalifa 		,  		 			G M Beache 		,  		 			G Gimel'farb 		,  		 			J S Suri 		,  		 			A S El-Baz 		.  	 	 		\textit{Multi Modality State-of-the-Art Medical Image Segmentation and Registration Methodologies},  				 			A S El-Baz,  			U,  			R A Mirmehdi,  			M Suri,  			JS 		 (ed.)  		 (US)  		2011. Springer. p. .  	 
\bibitem[Christensen et al. ()]{b13}\label{b13} 	 		‘Volumetric transformation of brain anatomy’.  		 			G E Christensen 		,  		 			S C Joshi 		,  		 			M I Miller 		.  	 	 		\textit{IEEE Transactions on Medical Imaging}  		1997. 16  (6)  p. .  	 
\bibitem[Holden et al. ()]{b29}\label{b29} 	 		‘Voxel similarity measures for 3-D serial M R brain image registration’.  		 			M Holden 		,  		 			D L Hill 		,  		 			E R Denton 		,  		 			J M Jarosz 		,  		 			T C Cox 		,  		 			T Rohlfing 		,  		 			J Goodey 		,  		 			D J Hawkes 		.  	 	 		\textit{IEEE Transactions on Medical Imaging}  		2000. 19  (2)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}