CINXE.COM

<!DOCTYPE html> <html lang="en" xmlns:fb="http://www.facebook.com/2008/fbml" class="wf-loading"> <head prefix="og: https://ogp.me/ns# fb: https://ogp.me/ns/fb# academia: https://ogp.me/ns/fb/academia#"> <meta charset="utf-8"> <meta name=viewport content="width=device-width, initial-scale=1"> <meta rel="search" type="application/opensearchdescription+xml" href="/open_search.xml" title="Academia.edu"> <title>Affine Transformation Research Papers - Academia.edu</title>  <link href="//a.academia-assets.com/images/favicons/favicon-production.ico" rel="shortcut icon" type="image/vnd.microsoft.icon"> <link rel="apple-touch-icon" sizes="57x57" href="//a.academia-assets.com/images/favicons/apple-touch-icon-57x57.png"> <link rel="apple-touch-icon" sizes="60x60" href="//a.academia-assets.com/images/favicons/apple-touch-icon-60x60.png"> <link rel="apple-touch-icon" sizes="72x72" href="//a.academia-assets.com/images/favicons/apple-touch-icon-72x72.png"> <link rel="apple-touch-icon" sizes="76x76" href="//a.academia-assets.com/images/favicons/apple-touch-icon-76x76.png"> <link rel="apple-touch-icon" sizes="114x114" href="//a.academia-assets.com/images/favicons/apple-touch-icon-114x114.png"> <link rel="apple-touch-icon" sizes="120x120" href="//a.academia-assets.com/images/favicons/apple-touch-icon-120x120.png"> <link rel="apple-touch-icon" sizes="144x144" href="//a.academia-assets.com/images/favicons/apple-touch-icon-144x144.png"> <link rel="apple-touch-icon" sizes="152x152" href="//a.academia-assets.com/images/favicons/apple-touch-icon-152x152.png"> <link rel="apple-touch-icon" sizes="180x180" href="//a.academia-assets.com/images/favicons/apple-touch-icon-180x180.png"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-32x32.png" sizes="32x32"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-194x194.png" sizes="194x194"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-96x96.png" sizes="96x96"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/android-chrome-192x192.png" sizes="192x192"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-16x16.png" sizes="16x16"> <link rel="manifest" href="//a.academia-assets.com/images/favicons/manifest.json"> <meta name="msapplication-TileColor" content="#2b5797"> <meta name="msapplication-TileImage" content="//a.academia-assets.com/images/favicons/mstile-144x144.png"> <meta name="theme-color" content="#ffffff"> <script> window.performance && window.performance.measure && window.performance.measure("Time To First Byte", "requestStart", "responseStart"); </script> <script> (function() { if (!window.URLSearchParams || !window.history || !window.history.replaceState) { return; } var searchParams = new URLSearchParams(window.location.search); var paramsToDelete = [ 'fs', 'sm', 'swp', 'iid', 'nbs', 'rcc', // related content category 'rcpos', // related content carousel position 'rcpg', // related carousel page 'rchid', // related content hit id 'f_ri', // research interest id, for SEO tracking 'f_fri', // featured research interest, for SEO tracking (param key without value) 'f_rid', // from research interest directory for SEO tracking 'f_loswp', // from research interest pills on LOSWP sidebar for SEO tracking 'rhid', // referrring hit id ]; if (paramsToDelete.every((key) => searchParams.get(key) === null)) { return; } paramsToDelete.forEach((key) => { searchParams.delete(key); }); var cleanUrl = new URL(window.location.href); cleanUrl.search = searchParams.toString(); history.replaceState({}, document.title, cleanUrl); })(); </script> <script async src="https://www.googletagmanager.com/gtag/js?id=G-5VKX33P2DS"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-5VKX33P2DS', { cookie_domain: 'academia.edu', send_page_view: false, }); gtag('event', 'page_view', { 'controller': "by_tag", 'action': "show_one", 'controller_action': 'by_tag#show_one', 'logged_in': 'false', 'edge': 'unknown', // Send nil if there is no A/B test bucket, in case some records get logged // with missing data - that way we can distinguish between the two cases. // ab_test_bucket should be of the form <ab_test_name>:<bucket> 'ab_test_bucket': null, }) </script> <script type="text/javascript"> window.sendUserTiming = function(timingName) { if (!(window.performance && window.performance.measure)) return; var entries = window.performance.getEntriesByName(timingName, "measure"); if (entries.length !== 1) return; var timingValue = Math.round(entries[0].duration); gtag('event', 'timing_complete', { name: timingName, value: timingValue, event_category: 'User-centric', }); }; window.sendUserTiming("Time To First Byte"); </script> <meta name="csrf-param" content="authenticity_token" /> <meta name="csrf-token" content="kG/c4zzYr5318kZakanvn9Jh+YeybS3Ps9omAoPbxFCxd3Vc2LzzwZJ+aXIyT4th6jst7xjhS9Z8CnZ6Fsu1QQ==" /> <link href="/Documents/in/Affine_Transformation?after=50%2C27732525" rel="next" /><link crossorigin="" href="https://fonts.gstatic.com/" rel="preconnect" /><link href="https://fonts.googleapis.com/css2?family=DM+Sans:ital,opsz,wght@0,9..40,100..1000;1,9..40,100..1000&family=Gupter:wght@400;500;700&family=IBM+Plex+Mono:wght@300;400&family=Material+Symbols+Outlined:opsz,wght,FILL,GRAD@20,400,0,0&display=swap" rel="stylesheet" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/common-10fa40af19d25203774df2d4a03b9b5771b45109c2304968038e88a81d1215c5.css" /> <meta name="description" content="View Affine Transformation Research Papers on Academia.edu for free." /> <meta name="google-site-verification" content="bKJMBZA7E43xhDOopFZkssMMkBRjvYERV-NaN4R6mrs" /> <script> var $controller_name = 'by_tag'; var $action_name = "show_one"; var $rails_env = 'production'; var $app_rev = '10e3dae8ffd20c8f5a4f7002303d92ad374c73ee'; var $domain = 'academia.edu'; var $app_host = "academia.edu"; var $asset_host = "academia-assets.com"; var $start_time = new Date().getTime(); var $recaptcha_key = "6LdxlRMTAAAAADnu_zyLhLg0YF9uACwz78shpjJB"; var $recaptcha_invisible_key = "6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj"; var $disableClientRecordHit = false; </script> <script> window.Aedu = { hit_data: null }; window.Aedu.SiteStats = {"premium_universities_count":15265,"monthly_visitors":"113 million","monthly_visitor_count":113657801,"monthly_visitor_count_in_millions":113,"user_count":277971988,"paper_count":55203019,"paper_count_in_millions":55,"page_count":432000000,"page_count_in_millions":432,"pdf_count":16500000,"pdf_count_in_millions":16}; window.Aedu.serverRenderTime = new Date(1733263163000); window.Aedu.timeDifference = new Date().getTime() - 1733263163000; window.Aedu.isUsingCssV1 = false; window.Aedu.enableLocalization = true; window.Aedu.activateFullstory = false; window.Aedu.serviceAvailability = { status: {"attention_db":"on","bibliography_db":"on","contacts_db":"on","email_db":"on","indexability_db":"on","mentions_db":"on","news_db":"on","notifications_db":"on","offsite_mentions_db":"on","redshift":"on","redshift_exports_db":"on","related_works_db":"on","ring_db":"on","user_tests_db":"on"}, serviceEnabled: function(service) { return this.status[service] === "on"; }, readEnabled: function(service) { return this.serviceEnabled(service) || this.status[service] === "read_only"; }, }; window.Aedu.viewApmTrace = function() { // Check if x-apm-trace-id meta tag is set, and open the trace in APM // in a new window if it is. var apmTraceId = document.head.querySelector('meta[name="x-apm-trace-id"]'); if (apmTraceId) { var traceId = apmTraceId.content; // Use trace ID to construct URL, an example URL looks like: // https://app.datadoghq.com/apm/traces?query=trace_id%31298410148923562634 var apmUrl = 'https://app.datadoghq.com/apm/traces?query=trace_id%3A' + traceId; window.open(apmUrl, '_blank'); } }; </script>  <link href="https://fonts.googleapis.com/css?family=Roboto:100,100i,300,300i,400,400i,500,500i,700,700i,900,900i" rel="stylesheet"> <link href="//maxcdn.bootstrapcdn.com/font-awesome/4.3.0/css/font-awesome.min.css" rel="stylesheet"> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/libraries-a9675dcb01ec4ef6aa807ba772c7a5a00c1820d3ff661c1038a20f80d06bb4e4.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/academia-bdb9e8c097f01e611f2fc5e2f1a9dc599beede975e2ae5629983543a1726e947.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system_legacy-056a9113b9a0f5343d013b29ee1929d5a18be35fdcdceb616600b4db8bd20054.css" /> <script src="//a.academia-assets.com/assets/webpack_bundles/runtime-bundle-005434038af4252ca37c527588411a3d6a0eabb5f727fac83f8bbe7fd88d93bb.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/webpack_libraries_and_infrequently_changed.wjs-bundle-bad3fa1257b860f4633ff1db966aa3ae7dfe1980708675f3e2488742c1a0d941.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/core_webpack.wjs-bundle-34a3460a4873b743570e35df99c7839e3ddd9a3d06ef96c9fe38311a96a8a24e.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/sentry.wjs-bundle-5fe03fddca915c8ba0f7edbe64c194308e8ce5abaed7bffe1255ff37549c4808.js"></script> <script> jade = window.jade || {}; jade.helpers = window.$h; jade._ = window._; </script>  <script id="tag-manager-head-root">(function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer_old','GTM-5G9JF7Z');</script>  <script> window.gptadslots = []; window.googletag = window.googletag || {}; window.googletag.cmd = window.googletag.cmd || []; </script> <script type="text/javascript"> // TODO(jacob): This should be defined, may be rare load order problem. // Checking if null is just a quick fix, will default to en if unset. // Better fix is to run this immedietely after I18n is set. if (window.I18n != null) { I18n.defaultLocale = "en"; I18n.locale = "en"; I18n.fallbacks = true; } </script> <link rel="canonical" href="https://www.academia.edu/Documents/in/Affine_Transformation" /> </head>   <body class='c-by_tag a-show_one logged_out u-bgColorWhite'>  <div id="fb-root"></div><script>window.fbAsyncInit = function() { FB.init({ appId: "2369844204", version: "v8.0", status: true, cookie: true, xfbml: true }); // Additional initialization code. if (window.InitFacebook) { // facebook.ts already loaded, set it up. window.InitFacebook(); } else { // Set a flag for facebook.ts to find when it loads. window.academiaAuthReadyFacebook = true; } };</script><script>window.fbAsyncLoad = function() { // Protection against double calling of this function if (window.FB) { return; } (function(d, s, id){ var js, fjs = d.getElementsByTagName(s)[0]; if (d.getElementById(id)) {return;} js = d.createElement(s); js.id = id; js.src = "//connect.facebook.net/en_US/sdk.js"; fjs.parentNode.insertBefore(js, fjs); }(document, 'script', 'facebook-jssdk')); } if (!window.defer_facebook) { // Autoload if not deferred window.fbAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.fbAsyncLoad(); }, 5000); }</script> <div id="google-root"></div><script>window.loadGoogle = function() { if (window.InitGoogle) { // google.ts already loaded, set it up. window.InitGoogle("331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"); } else { // Set a flag for google.ts to use when it loads. window.GoogleClientID = "331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"; } };</script><script>window.googleAsyncLoad = function() { // Protection against double calling of this function (function(d) { var js; var id = 'google-jssdk'; var ref = d.getElementsByTagName('script')[0]; if (d.getElementById(id)) { return; } js = d.createElement('script'); js.id = id; js.async = true; js.onload = loadGoogle; js.src = "https://accounts.google.com/gsi/client" ref.parentNode.insertBefore(js, ref); }(document)); } if (!window.defer_google) { // Autoload if not deferred window.googleAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.googleAsyncLoad(); }, 5000); }</script> <div id="tag-manager-body-root">  <noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5G9JF7Z" height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript>   <script> window.addEventListener('load', function() { if (document.querySelector('input[name="commit"]')) { document.querySelector('input[name="commit"]').addEventListener('click', function() { gtag('event', 'click', { event_category: 'button', event_label: 'Log In' }) }) } }); </script> </div> <script>var _comscore = _comscore || []; _comscore.push({ c1: "2", c2: "26766707" }); (function() { var s = document.createElement("script"), el = document.getElementsByTagName("script")[0]; s.async = true; s.src = (document.location.protocol == "https:" ? "https://sb" : "http://b") + ".scorecardresearch.com/beacon.js"; el.parentNode.insertBefore(s, el); })();</script><img src="https://sb.scorecardresearch.com/p?c1=2&c2=26766707&cv=2.0&cj=1" style="position: absolute; visibility: hidden" /> <div id='react-modal'></div> <div class='DesignSystem'> <a class='u-showOnFocus' href='#site'> Skip to main content </a> </div> <div id="upgrade_ie_banner" style="display: none;"><p>Academia.edu no longer supports Internet Explorer.</p><p>To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to <a href="https://www.academia.edu/upgrade-browser">upgrade your browser</a>.</p></div><script>// Show this banner for all versions of IE if (!!window.MSInputMethodContext || /(MSIE)/.test(navigator.userAgent)) { document.getElementById('upgrade_ie_banner').style.display = 'block'; }</script> <div class="DesignSystem bootstrap ShrinkableNav no-sm no-md"><div class="navbar navbar-default main-header"><div class="container-wrapper" id="main-header-container"><div class="container"><div class="navbar-header"><div class="nav-left-wrapper u-mt0x"><div class="nav-logo"><a data-main-header-link-target="logo_home" href="https://www.academia.edu/"><img class="visible-xs-inline-block" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015-A.svg" width="24" height="24" /><img width="145.2" height="18" class="hidden-xs" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015.svg" /></a></div><div class="nav-search"><div class="SiteSearch-wrapper select2-no-default-pills"><form class="js-SiteSearch-form DesignSystem" action="https://www.academia.edu/search" accept-charset="UTF-8" method="get"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><i class="SiteSearch-icon fa fa-search u-fw700 u-positionAbsolute u-tcGrayDark"></i><input class="js-SiteSearch-form-input SiteSearch-form-input form-control" data-main-header-click-target="search_input" name="q" placeholder="Search" type="text" value="" /></form></div></div></div><div class="nav-right-wrapper pull-right"><ul class="NavLinks js-main-nav list-unstyled"><li class="NavLinks-link"><a class="js-header-login-url Button Button--inverseGray Button--sm u-mb4x" id="nav_log_in" rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="NavLinks-link u-p0x"><a class="Button Button--inverseGray Button--sm u-mb4x" rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li></ul><button class="hidden-lg hidden-md hidden-sm u-ml4x navbar-toggle collapsed" data-target=".js-mobile-header-links" data-toggle="collapse" type="button"><span class="icon-bar"></span><span class="icon-bar"></span><span class="icon-bar"></span></button></div></div><div class="collapse navbar-collapse js-mobile-header-links"><ul class="nav navbar-nav"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li><li class="u-borderColorGrayLight u-borderBottom1 js-mobile-nav-expand-trigger"><a href="#">more&nbsp<span class="caret"></span></a></li><li><ul class="js-mobile-nav-expand-section nav navbar-nav u-m0x collapse"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/about">About</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/press">Press</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://medium.com/@academia">Blog</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/documents">Papers</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/hiring"><i class="fa fa-briefcase"></i> We're Hiring!</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://support.academia.edu/"><i class="fa fa-question-circle"></i> Help Center</a></li><li class="js-mobile-nav-collapse-trigger u-borderColorGrayLight u-borderBottom1 dropup" style="display:none"><a href="#">less&nbsp<span class="caret"></span></a></li></ul></li></ul></div></div></div><script>(function(){ var $moreLink = $(".js-mobile-nav-expand-trigger"); var $lessLink = $(".js-mobile-nav-collapse-trigger"); var $section = $('.js-mobile-nav-expand-section'); $moreLink.click(function(ev){ ev.preventDefault(); $moreLink.hide(); $lessLink.show(); $section.collapse('show'); }); $lessLink.click(function(ev){ ev.preventDefault(); $moreLink.show(); $lessLink.hide(); $section.collapse('hide'); }); })() if ($a.is_logged_in() || false) { new Aedu.NavigationController({ el: '.js-main-nav', showHighlightedNotification: false }); } else { $(".js-header-login-url").attr("href", $a.loginUrlWithRedirect()); } Aedu.autocompleteSearch = new AutocompleteSearch({el: '.js-SiteSearch-form'});</script></div></div> <div id='site' class='fixed'> <div id="content" class="clearfix"> <script>document.addEventListener('DOMContentLoaded', function(){ var $dismissible = $(".dismissible_banner"); $dismissible.click(function(ev) { $dismissible.hide(); }); });</script> <div class="DesignSystem" style="margin-top:-40px"><div class="PageHeader"><div class="container"><div class="row"><style type="text/css">.sor-abstract { display: -webkit-box; overflow: hidden; text-overflow: ellipsis; -webkit-line-clamp: 3; -webkit-box-orient: vertical; }</style><div class="col-xs-12 clearfix"><div class="u-floatLeft"><h1 class="PageHeader-title u-m0x u-fs30">Affine Transformation</h1><div class="u-tcGrayDark">53 Followers</div><div class="u-tcGrayDark u-mt2x">Recent papers in <b>Affine Transformation</b></div></div></div></div></div></div><div class="TabbedNavigation"><div class="container"><div class="row"><div class="col-xs-12 clearfix"><ul class="nav u-m0x u-p0x list-inline u-displayFlex"><li class="active"><a href="https://www.academia.edu/Documents/in/Affine_Transformation">Top Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Affine_Transformation/MostCited">Most Cited Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Affine_Transformation/MostDownloaded">Most Downloaded Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Affine_Transformation/MostRecent">Newest Papers</a></li><li><a class="" href="https://www.academia.edu/People/Affine_Transformation">People</a></li></ul></div><style type="text/css">ul.nav{flex-direction:row}@media(max-width: 567px){ul.nav{flex-direction:column}.TabbedNavigation li{max-width:100%}.TabbedNavigation li.active{background-color:var(--background-grey, #dddde2)}.TabbedNavigation li.active:before,.TabbedNavigation li.active:after{display:none}}</style></div></div></div><div class="container"><div class="row"><div class="col-xs-12"><div class="u-displayFlex"><div class="u-flexGrow1"><div class="works"><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_58176057" data-work_id="58176057" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/58176057/Fourier_Mellin_registration_of_line_delineated_tabular_document_images">Fourier–Mellin registration of line-delineated tabular document images</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/58176057" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="542d872d7550470e489b1b274ab01ada" rel="nofollow" data-download="{"attachment_id":72714289,"asset_id":58176057,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/72714289/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="31165315" href="https://independent.academia.edu/BarrettBill">Bill Barrett</a><script data-card-contents-for-user="31165315" type="text/json">{"id":31165315,"first_name":"Bill","last_name":"Barrett","domain_name":"independent","page_name":"BarrettBill","display_name":"Bill Barrett","profile_url":"https://independent.academia.edu/BarrettBill?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_58176057 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="58176057"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 58176057, container: ".js-paper-rank-work_58176057", }); });</script></li><li class="js-percentile-work_58176057 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 58176057; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_58176057"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_58176057 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="58176057"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 58176057; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=58176057]").text(description); $(".js-view-count-work_58176057").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_58176057").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="58176057"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="1185" href="https://www.academia.edu/Documents/in/Image_Processing">Image Processing</a>, <script data-card-contents-for-ri="1185" type="text/json">{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1410" href="https://www.academia.edu/Documents/in/Information_Theory">Information Theory</a>, <script data-card-contents-for-ri="1410" type="text/json">{"id":1410,"name":"Information Theory","url":"https://www.academia.edu/Documents/in/Information_Theory?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="29731" href="https://www.academia.edu/Documents/in/Image_Registration">Image Registration</a>, <script data-card-contents-for-ri="29731" type="text/json">{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="32159" href="https://www.academia.edu/Documents/in/Family_history">Family history</a><script data-card-contents-for-ri="32159" type="text/json">{"id":32159,"name":"Family history","url":"https://www.academia.edu/Documents/in/Family_history?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=58176057]'), work: {"id":58176057,"title":"Fourier–Mellin registration of line-delineated tabular document images","created_at":"2021-10-15T10:33:19.361-07:00","url":"https://www.academia.edu/58176057/Fourier_Mellin_registration_of_line_delineated_tabular_document_images?f_ri=1554856","dom_id":"work_58176057","summary":null,"downloadable_attachments":[{"id":72714289,"asset_id":58176057,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":31165315,"first_name":"Bill","last_name":"Barrett","domain_name":"independent","page_name":"BarrettBill","display_name":"Bill Barrett","profile_url":"https://independent.academia.edu/BarrettBill?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=1554856","nofollow":false},{"id":1410,"name":"Information Theory","url":"https://www.academia.edu/Documents/in/Information_Theory?f_ri=1554856","nofollow":false},{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false},{"id":32159,"name":"Family history","url":"https://www.academia.edu/Documents/in/Family_history?f_ri=1554856","nofollow":false},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=1554856"},{"id":71898,"name":"Perspective","url":"https://www.academia.edu/Documents/in/Perspective?f_ri=1554856"},{"id":93217,"name":"Segmentation","url":"https://www.academia.edu/Documents/in/Segmentation?f_ri=1554856"},{"id":96798,"name":"Noise reduction","url":"https://www.academia.edu/Documents/in/Noise_reduction?f_ri=1554856"},{"id":155196,"name":"Median Filter","url":"https://www.academia.edu/Documents/in/Median_Filter?f_ri=1554856"},{"id":775583,"name":"Shear","url":"https://www.academia.edu/Documents/in/Shear?f_ri=1554856"},{"id":903929,"name":"Batch Process","url":"https://www.academia.edu/Documents/in/Batch_Process?f_ri=1554856"},{"id":1288273,"name":"Fourier Transformation","url":"https://www.academia.edu/Documents/in/Fourier_Transformation?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1625072,"name":"Frequency Domain","url":"https://www.academia.edu/Documents/in/Frequency_Domain?f_ri=1554856"},{"id":2513107,"name":"parameter space","url":"https://www.academia.edu/Documents/in/parameter_space?f_ri=1554856"},{"id":2700712,"name":"Mellin transform","url":"https://www.academia.edu/Documents/in/Mellin_transform?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_48026186" data-work_id="48026186" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/48026186/Automatic_Model_Based_Segmentation_of_the_Heart_in_CT_Images">Automatic Model-Based Segmentation of the Heart in CT Images</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/48026186" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bb98513f5f4f5b78de02d6fe66009c6e" rel="nofollow" data-download="{"attachment_id":66854388,"asset_id":48026186,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/66854388/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="66701577" href="https://independent.academia.edu/PetersJochen">Jochen Peters</a><script data-card-contents-for-user="66701577" type="text/json">{"id":66701577,"first_name":"Jochen","last_name":"Peters","domain_name":"independent","page_name":"PetersJochen","display_name":"Jochen Peters","profile_url":"https://independent.academia.edu/PetersJochen?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_48026186 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="48026186"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 48026186, container: ".js-paper-rank-work_48026186", }); });</script></li><li class="js-percentile-work_48026186 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 48026186; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_48026186"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_48026186 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="48026186"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 48026186; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=48026186]").text(description); $(".js-view-count-work_48026186").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_48026186").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="48026186"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">19</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="428" href="https://www.academia.edu/Documents/in/Algorithms">Algorithms</a>, <script data-card-contents-for-ri="428" type="text/json">{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="606" href="https://www.academia.edu/Documents/in/Cardiology">Cardiology</a><script data-card-contents-for-ri="606" type="text/json">{"id":606,"name":"Cardiology","url":"https://www.academia.edu/Documents/in/Cardiology?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=48026186]'), work: {"id":48026186,"title":"Automatic Model-Based Segmentation of the Heart in CT Images","created_at":"2021-05-03T23:22:05.938-07:00","url":"https://www.academia.edu/48026186/Automatic_Model_Based_Segmentation_of_the_Heart_in_CT_Images?f_ri=1554856","dom_id":"work_48026186","summary":null,"downloadable_attachments":[{"id":66854388,"asset_id":48026186,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":66701577,"first_name":"Jochen","last_name":"Peters","domain_name":"independent","page_name":"PetersJochen","display_name":"Jochen Peters","profile_url":"https://independent.academia.edu/PetersJochen?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=1554856","nofollow":false},{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=1554856","nofollow":false},{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=1554856","nofollow":false},{"id":606,"name":"Cardiology","url":"https://www.academia.edu/Documents/in/Cardiology?f_ri=1554856","nofollow":false},{"id":1249,"name":"Medical Imaging","url":"https://www.academia.edu/Documents/in/Medical_Imaging?f_ri=1554856"},{"id":1648,"name":"Computed Tomography","url":"https://www.academia.edu/Documents/in/Computed_Tomography?f_ri=1554856"},{"id":5069,"name":"Principal Component Analysis","url":"https://www.academia.edu/Documents/in/Principal_Component_Analysis?f_ri=1554856"},{"id":26870,"name":"Image segmentation","url":"https://www.academia.edu/Documents/in/Image_segmentation?f_ri=1554856"},{"id":69542,"name":"Computer Simulation","url":"https://www.academia.edu/Documents/in/Computer_Simulation?f_ri=1554856"},{"id":131495,"name":"Heart","url":"https://www.academia.edu/Documents/in/Heart?f_ri=1554856"},{"id":240378,"name":"Active Shape Model","url":"https://www.academia.edu/Documents/in/Active_Shape_Model?f_ri=1554856"},{"id":315664,"name":"Image Modeling","url":"https://www.academia.edu/Documents/in/Image_Modeling?f_ri=1554856"},{"id":372581,"name":"Image Enhancement","url":"https://www.academia.edu/Documents/in/Image_Enhancement?f_ri=1554856"},{"id":464325,"name":"Hough Transform","url":"https://www.academia.edu/Documents/in/Hough_Transform?f_ri=1554856"},{"id":813651,"name":"Model Based Approach","url":"https://www.academia.edu/Documents/in/Model_Based_Approach?f_ri=1554856"},{"id":1242198,"name":"Degree of Freedom","url":"https://www.academia.edu/Documents/in/Degree_of_Freedom?f_ri=1554856"},{"id":1369512,"name":"Hough Transforms","url":"https://www.academia.edu/Documents/in/Hough_Transforms?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":3716400,"name":"Automatic segmentation","url":"https://www.academia.edu/Documents/in/Automatic_segmentation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_28600908 coauthored" data-work_id="28600908" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/28600908/Detection_of_large_scale_concrete_columns_for_automated_bridge_inspection">Detection of large-scale concrete columns for automated bridge inspection</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/28600908" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="3702e1b5c1d2c8f9bcf5f704891118f7" rel="nofollow" data-download="{"attachment_id":48962803,"asset_id":28600908,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48962803/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="53648154" href="https://cambridge.academia.edu/IoannisBrilakis">Ioannis Brilakis</a><script data-card-contents-for-user="53648154" type="text/json">{"id":53648154,"first_name":"Ioannis","last_name":"Brilakis","domain_name":"cambridge","page_name":"IoannisBrilakis","display_name":"Ioannis Brilakis","profile_url":"https://cambridge.academia.edu/IoannisBrilakis?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-28600908">+1</span><div class="hidden js-additional-users-28600908"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://tamu.academia.edu/StephanieGerman">Stephanie German</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-28600908'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-28600908').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_28600908 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="28600908"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 28600908, container: ".js-paper-rank-work_28600908", }); });</script></li><li class="js-percentile-work_28600908 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 28600908; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_28600908"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_28600908 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="28600908"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 28600908; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=28600908]").text(description); $(".js-view-count-work_28600908").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_28600908").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="28600908"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="491" href="https://www.academia.edu/Documents/in/Information_Technology">Information Technology</a>, <script data-card-contents-for-ri="491" type="text/json">{"id":491,"name":"Information Technology","url":"https://www.academia.edu/Documents/in/Information_Technology?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="99835" href="https://www.academia.edu/Documents/in/Feature_Detection">Feature Detection</a>, <script data-card-contents-for-ri="99835" type="text/json">{"id":99835,"name":"Feature Detection","url":"https://www.academia.edu/Documents/in/Feature_Detection?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="207411" href="https://www.academia.edu/Documents/in/Construction_Automation">Construction Automation</a><script data-card-contents-for-ri="207411" type="text/json">{"id":207411,"name":"Construction Automation","url":"https://www.academia.edu/Documents/in/Construction_Automation?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=28600908]'), work: {"id":28600908,"title":"Detection of large-scale concrete columns for automated bridge inspection","created_at":"2016-09-19T08:32:48.088-07:00","url":"https://www.academia.edu/28600908/Detection_of_large_scale_concrete_columns_for_automated_bridge_inspection?f_ri=1554856","dom_id":"work_28600908","summary":null,"downloadable_attachments":[{"id":48962803,"asset_id":28600908,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":53648154,"first_name":"Ioannis","last_name":"Brilakis","domain_name":"cambridge","page_name":"IoannisBrilakis","display_name":"Ioannis Brilakis","profile_url":"https://cambridge.academia.edu/IoannisBrilakis?f_ri=1554856","photo":"/images/s65_no_pic.png"},{"id":54216439,"first_name":"Stephanie","last_name":"German","domain_name":"tamu","page_name":"StephanieGerman","display_name":"Stephanie German","profile_url":"https://tamu.academia.edu/StephanieGerman?f_ri=1554856","photo":"https://0.academia-photos.com/54216439/14299440/15244966/s65_stephanie.german.jpg"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=1554856","nofollow":false},{"id":491,"name":"Information Technology","url":"https://www.academia.edu/Documents/in/Information_Technology?f_ri=1554856","nofollow":false},{"id":99835,"name":"Feature Detection","url":"https://www.academia.edu/Documents/in/Feature_Detection?f_ri=1554856","nofollow":false},{"id":207411,"name":"Construction Automation","url":"https://www.academia.edu/Documents/in/Construction_Automation?f_ri=1554856","nofollow":false},{"id":733659,"name":"Condition Assessment","url":"https://www.academia.edu/Documents/in/Condition_Assessment?f_ri=1554856"},{"id":758278,"name":"Large Scale","url":"https://www.academia.edu/Documents/in/Large_Scale?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1733865,"name":"Automatic Identification System","url":"https://www.academia.edu/Documents/in/Automatic_Identification_System?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_54113514" data-work_id="54113514" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/54113514/Dewarping_and_Deskewing_of_a_Document_using_Affine_Transformation">Dewarping and Deskewing of a Document using Affine Transformation</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/54113514" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="677b55fae518276a376187ff1a3c4083" rel="nofollow" data-download="{"attachment_id":70635100,"asset_id":54113514,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/70635100/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="166232527" href="https://niituniversity.academia.edu/SudipSanyal">Sudip Sanyal</a><script data-card-contents-for-user="166232527" type="text/json">{"id":166232527,"first_name":"Sudip","last_name":"Sanyal","domain_name":"niituniversity","page_name":"SudipSanyal","display_name":"Sudip Sanyal","profile_url":"https://niituniversity.academia.edu/SudipSanyal?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_54113514 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="54113514"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 54113514, container: ".js-paper-rank-work_54113514", }); });</script></li><li class="js-percentile-work_54113514 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 54113514; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_54113514"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_54113514 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="54113514"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 54113514; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=54113514]").text(description); $(".js-view-count-work_54113514").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_54113514").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="54113514"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i></div><span class="InlineList-item-text u-textTruncate u-pl6x"><a class="InlineList-item-text" data-has-card-for-ri="1554856" href="https://www.academia.edu/Documents/in/Affine_Transformation">Affine Transformation</a><script data-card-contents-for-ri="1554856" type="text/json">{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (false) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=54113514]'), work: {"id":54113514,"title":"Dewarping and Deskewing of a Document using Affine Transformation","created_at":"2021-09-29T20:57:06.185-07:00","url":"https://www.academia.edu/54113514/Dewarping_and_Deskewing_of_a_Document_using_Affine_Transformation?f_ri=1554856","dom_id":"work_54113514","summary":null,"downloadable_attachments":[{"id":70635100,"asset_id":54113514,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":166232527,"first_name":"Sudip","last_name":"Sanyal","domain_name":"niituniversity","page_name":"SudipSanyal","display_name":"Sudip Sanyal","profile_url":"https://niituniversity.academia.edu/SudipSanyal?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_29883506" data-work_id="29883506" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/29883506/Homographic_p_Norms_Metrics_of_Homographic_Image_Transformation">Homographic p-Norms: Metrics of Homographic Image Transformation</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Images often need to be aligned in a single coordinate system, and homography is one of the most efficient geometric models to align images. This paper presents homographic p-norms, scalar metrics of homographic image transformation, and... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_29883506" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Images often need to be aligned in a single coordinate system, and homography is one of the most efficient geometric models to align images. This paper presents homographic p-norms, scalar metrics of homographic image transformation, and to the best of our knowledge these are the most rigorous definition of scalar metrics quantifying homographic image transformations. We first define a metric between two homography matrices, and show it satisfies metric properties. Then we propose metrics of a single homography matrix for a general planar region, and ones for a usual rectangle image. For use of the proposed metrics, we provide useful homographic 2-norm expressions derived from the definition of the metrics, and compare the approximation errors of the metrics with respect to the exact metric. As a result, the discrete version of the metric obtained by pixel-wise computation is greatly close to the exact metric. The proposed metrics can be applied to evaluation of transformation magnitude, image closeness estimation, evaluation of camera pose difference, selection of image pair in stereo vision, panoramic image mosaic, and deblurring. Experimental results show the efficacy of the proposed metrics.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/29883506" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="83eed6c0bb4c8fe0f4a2d1a15ee11843" rel="nofollow" data-download="{"attachment_id":50349642,"asset_id":29883506,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50349642/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="5444010" href="https://sogang.academia.edu/ChangsooJe">Changsoo Je</a><script data-card-contents-for-user="5444010" type="text/json">{"id":5444010,"first_name":"Changsoo","last_name":"Je","domain_name":"sogang","page_name":"ChangsooJe","display_name":"Changsoo Je","profile_url":"https://sogang.academia.edu/ChangsooJe?f_ri=1554856","photo":"https://0.academia-photos.com/5444010/2391356/2784192/s65_changsoo.je.jpg"}</script></span></span></li><li class="js-paper-rank-work_29883506 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="29883506"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 29883506, container: ".js-paper-rank-work_29883506", }); });</script></li><li class="js-percentile-work_29883506 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 29883506; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_29883506"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_29883506 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="29883506"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 29883506; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=29883506]").text(description); $(".js-view-count-work_29883506").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_29883506").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="29883506"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="6636" href="https://www.academia.edu/Documents/in/Metrics">Metrics</a>, <script data-card-contents-for-ri="6636" type="text/json">{"id":6636,"name":"Metrics","url":"https://www.academia.edu/Documents/in/Metrics?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="29731" href="https://www.academia.edu/Documents/in/Image_Registration">Image Registration</a>, <script data-card-contents-for-ri="29731" type="text/json">{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="555787" href="https://www.academia.edu/Documents/in/Homography">Homography</a>, <script data-card-contents-for-ri="555787" type="text/json">{"id":555787,"name":"Homography","url":"https://www.academia.edu/Documents/in/Homography?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="996089" href="https://www.academia.edu/Documents/in/Metric">Metric</a><script data-card-contents-for-ri="996089" type="text/json">{"id":996089,"name":"Metric","url":"https://www.academia.edu/Documents/in/Metric?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=29883506]'), work: {"id":29883506,"title":"Homographic p-Norms: Metrics of Homographic Image Transformation","created_at":"2016-11-16T05:22:21.003-08:00","url":"https://www.academia.edu/29883506/Homographic_p_Norms_Metrics_of_Homographic_Image_Transformation?f_ri=1554856","dom_id":"work_29883506","summary":"Images often need to be aligned in a single coordinate system, and homography is one of the most efficient geometric models to align images. This paper presents homographic p-norms, scalar metrics of homographic image transformation, and to the best of our knowledge these are the most rigorous definition of scalar metrics quantifying homographic image transformations. We first define a metric between two homography matrices, and show it satisfies metric properties. Then we propose metrics of a single homography matrix for a general planar region, and ones for a usual rectangle image. For use of the proposed metrics, we provide useful homographic 2-norm expressions derived from the definition of the metrics, and compare the approximation errors of the metrics with respect to the exact metric. As a result, the discrete version of the metric obtained by pixel-wise computation is greatly close to the exact metric. The proposed metrics can be applied to evaluation of transformation magnitude, image closeness estimation, evaluation of camera pose difference, selection of image pair in stereo vision, panoramic image mosaic, and deblurring. Experimental results show the efficacy of the proposed metrics.","downloadable_attachments":[{"id":50349642,"asset_id":29883506,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":5444010,"first_name":"Changsoo","last_name":"Je","domain_name":"sogang","page_name":"ChangsooJe","display_name":"Changsoo Je","profile_url":"https://sogang.academia.edu/ChangsooJe?f_ri=1554856","photo":"https://0.academia-photos.com/5444010/2391356/2784192/s65_changsoo.je.jpg"}],"research_interests":[{"id":6636,"name":"Metrics","url":"https://www.academia.edu/Documents/in/Metrics?f_ri=1554856","nofollow":false},{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false},{"id":555787,"name":"Homography","url":"https://www.academia.edu/Documents/in/Homography?f_ri=1554856","nofollow":false},{"id":996089,"name":"Metric","url":"https://www.academia.edu/Documents/in/Metric?f_ri=1554856","nofollow":false},{"id":1175917,"name":"Image transforms","url":"https://www.academia.edu/Documents/in/Image_transforms?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1657065,"name":"Geometric Transformations","url":"https://www.academia.edu/Documents/in/Geometric_Transformations?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_34788898" data-work_id="34788898" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/34788898/Kriptografi_dan_Python_pdf">Kriptografi dan Python.pdf</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Coba fikirkan hal apa yang tidak dapat diretas hari ini ? Apakah demikian juga halnya dahulu ? apakah esok dan masa depan kita masih akan terus mengalami semua kekacauan ini ? Coba jawab dalam diri anda berapa banyak informasi yang anda... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_34788898" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Coba fikirkan hal apa yang tidak dapat diretas hari ini ? Apakah demikian juga halnya dahulu ? apakah esok dan masa depan kita masih akan terus mengalami semua kekacauan ini ? Coba jawab dalam diri anda berapa banyak informasi yang anda ijinkan untuk diketahui dan tidak oleh oranglain, ada beberapa cara agar tetap bisa menjaga rahasia yang kita miliki dalam era teknologi serba canggih ini. Tidak ada yang benar-benar aman di dunia maya, sudah marak terjadi aksi pembobolan bank melalui saluran internet, peretasan akun internet juga hal-hal yang bersifat pribadi dengan mudah dicuri dan disebarkan oleh pihak-pihak yang tidak bertanggung jawab secara sengaja dan tidak. Lalu apakah kita akan membiarkan hal ini terus terjadi ? Tetaplah berhati-hati, pada buku ini akan dibahas hal mengenai sandi namun penuh dengan kata-kata/kalimat yang mudah dimengerti, bagaimana anda dapat membuat sandi anda sendiri, merusak dan bahkan meretasnya. Dan untuk yang lebih menarik akan dibahas mengenai apa dan bagaimana sandi RSA melakukan enkripsinya.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/34788898" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b76550a3a0ab41be10487ac2f0ba43a6" rel="nofollow" data-download="{"attachment_id":54647823,"asset_id":34788898,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/54647823/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="52155470" href="https://usu-id.academia.edu/MatiusCelciusSinaga">Matius C E L C I U S Sinaga</a><script data-card-contents-for-user="52155470" type="text/json">{"id":52155470,"first_name":"Matius","last_name":"Sinaga","domain_name":"usu-id","page_name":"MatiusCelciusSinaga","display_name":"Matius C E L C I U S Sinaga","profile_url":"https://usu-id.academia.edu/MatiusCelciusSinaga?f_ri=1554856","photo":"https://0.academia-photos.com/52155470/15293606/17194084/s65_matius.sinaga.jpg"}</script></span></span></li><li class="js-paper-rank-work_34788898 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="34788898"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 34788898, container: ".js-paper-rank-work_34788898", }); });</script></li><li class="js-percentile-work_34788898 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 34788898; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_34788898"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_34788898 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="34788898"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 34788898; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=34788898]").text(description); $(".js-view-count-work_34788898").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_34788898").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="34788898"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">23</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="13923" href="https://www.academia.edu/Documents/in/Computer_Security">Computer Security</a>, <script data-card-contents-for-ri="13923" type="text/json">{"id":13923,"name":"Computer Security","url":"https://www.academia.edu/Documents/in/Computer_Security?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="16542" href="https://www.academia.edu/Documents/in/Cryptography">Cryptography</a>, <script data-card-contents-for-ri="16542" type="text/json">{"id":16542,"name":"Cryptography","url":"https://www.academia.edu/Documents/in/Cryptography?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="37097" href="https://www.academia.edu/Documents/in/Public_Key_Crypto_systems">Public Key Crypto systems</a>, <script data-card-contents-for-ri="37097" type="text/json">{"id":37097,"name":"Public Key Crypto systems","url":"https://www.academia.edu/Documents/in/Public_Key_Crypto_systems?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="57942" href="https://www.academia.edu/Documents/in/Source_Code_Analysis">Source Code Analysis</a><script data-card-contents-for-ri="57942" type="text/json">{"id":57942,"name":"Source Code Analysis","url":"https://www.academia.edu/Documents/in/Source_Code_Analysis?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=34788898]'), work: {"id":34788898,"title":"Kriptografi dan Python.pdf","created_at":"2017-10-07T01:53:57.921-07:00","url":"https://www.academia.edu/34788898/Kriptografi_dan_Python_pdf?f_ri=1554856","dom_id":"work_34788898","summary":"Coba fikirkan hal apa yang tidak dapat diretas hari ini ? Apakah demikian juga halnya dahulu ? apakah esok dan masa depan kita masih akan terus mengalami semua kekacauan ini ? Coba jawab dalam diri anda berapa banyak informasi yang anda ijinkan untuk diketahui dan tidak oleh oranglain, ada beberapa cara agar tetap bisa menjaga rahasia yang kita miliki dalam era teknologi serba canggih ini. Tidak ada yang benar-benar aman di dunia maya, sudah marak terjadi aksi pembobolan bank melalui saluran internet, peretasan akun internet juga hal-hal yang bersifat pribadi dengan mudah dicuri dan disebarkan oleh pihak-pihak yang tidak bertanggung jawab secara sengaja dan tidak. Lalu apakah kita akan membiarkan hal ini terus terjadi ? Tetaplah berhati-hati, pada buku ini akan dibahas hal mengenai sandi namun penuh dengan kata-kata/kalimat yang mudah dimengerti, bagaimana anda dapat membuat sandi anda sendiri, merusak dan bahkan meretasnya. Dan untuk yang lebih menarik akan dibahas mengenai apa dan bagaimana sandi RSA melakukan enkripsinya. ","downloadable_attachments":[{"id":54647823,"asset_id":34788898,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":52155470,"first_name":"Matius","last_name":"Sinaga","domain_name":"usu-id","page_name":"MatiusCelciusSinaga","display_name":"Matius C E L C I U S Sinaga","profile_url":"https://usu-id.academia.edu/MatiusCelciusSinaga?f_ri=1554856","photo":"https://0.academia-photos.com/52155470/15293606/17194084/s65_matius.sinaga.jpg"}],"research_interests":[{"id":13923,"name":"Computer Security","url":"https://www.academia.edu/Documents/in/Computer_Security?f_ri=1554856","nofollow":false},{"id":16542,"name":"Cryptography","url":"https://www.academia.edu/Documents/in/Cryptography?f_ri=1554856","nofollow":false},{"id":37097,"name":"Public Key Crypto systems","url":"https://www.academia.edu/Documents/in/Public_Key_Crypto_systems?f_ri=1554856","nofollow":false},{"id":57942,"name":"Source Code Analysis","url":"https://www.academia.edu/Documents/in/Source_Code_Analysis?f_ri=1554856","nofollow":false},{"id":58087,"name":"Charles Babbage","url":"https://www.academia.edu/Documents/in/Charles_Babbage?f_ri=1554856"},{"id":116212,"name":"Sejarah","url":"https://www.academia.edu/Documents/in/Sejarah?f_ri=1554856"},{"id":158331,"name":"Python Programming","url":"https://www.academia.edu/Documents/in/Python_Programming?f_ri=1554856"},{"id":222999,"name":"Public key cryptography","url":"https://www.academia.edu/Documents/in/Public_key_cryptography?f_ri=1554856"},{"id":273215,"name":"RSA","url":"https://www.academia.edu/Documents/in/RSA?f_ri=1554856"},{"id":277780,"name":"Kriptografi","url":"https://www.academia.edu/Documents/in/Kriptografi?f_ri=1554856"},{"id":423468,"name":"RSA ALGORITHM","url":"https://www.academia.edu/Documents/in/RSA_ALGORITHM?f_ri=1554856"},{"id":504031,"name":"Private-Key Encryption","url":"https://www.academia.edu/Documents/in/Private-Key_Encryption?f_ri=1554856"},{"id":516232,"name":"Source Code","url":"https://www.academia.edu/Documents/in/Source_Code?f_ri=1554856"},{"id":706685,"name":"HUFFMAN-VIGENERE CHIPER","url":"https://www.academia.edu/Documents/in/HUFFMAN-VIGENERE_CHIPER?f_ri=1554856"},{"id":862915,"name":"Enkripsi","url":"https://www.academia.edu/Documents/in/Enkripsi?f_ri=1554856"},{"id":862916,"name":"Dekripsi","url":"https://www.academia.edu/Documents/in/Dekripsi?f_ri=1554856"},{"id":1032653,"name":"Public/Private Keys","url":"https://www.academia.edu/Documents/in/Public_Private_Keys?f_ri=1554856"},{"id":1452657,"name":"Algoritma Kriptografi","url":"https://www.academia.edu/Documents/in/Algoritma_Kriptografi?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1739243,"name":"Cracker","url":"https://www.academia.edu/Documents/in/Cracker?f_ri=1554856"},{"id":1843235,"name":"Vigenere cipher (analisis algoritma)","url":"https://www.academia.edu/Documents/in/Vigenere_cipher_analisis_algoritma_?f_ri=1554856"},{"id":2150184,"name":"Public Key Cryptosystem","url":"https://www.academia.edu/Documents/in/Public_Key_Cryptosystem?f_ri=1554856"},{"id":2444142,"name":"Man-in-the-middle (MITM) Attack","url":"https://www.academia.edu/Documents/in/Man-in-the-middle_MITM_Attack?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_48763550" data-work_id="48763550" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/48763550/WHAT_WAS_THE_RIVER_ISTER_IN_THE_TIME_OF_STRABO_A_MATHEMATICAL_APPROACH">WHAT WAS THE RIVER ISTER IN THE TIME OF STRABO? A MATHEMATICAL APPROACH</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this paper, we introduce a novel method for map registration and apply it to transformation of the river Ister from {\it Strabo's map of the World} to the current map in the World Geodetic System. This transformation leads to the... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_48763550" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this paper, we introduce a novel method for map registration and apply it to transformation of the river Ister from {\it Strabo's map of the World} to the current map in the World Geodetic System. This transformation leads to the surprising but convincing result that Strabo's river Ister best coincides with the nowadays Tauernbach-Isel-Drava-Danube course and not with the Danube river what is commonly assumed. Such a result is supported by carefully designed mathematical measurements and it resolves all related controversies otherwise appearing in understanding and translation of Strabo's original text. Based on this result we also show that {\it Strabo's Suevi in the Hercynian Forest} corresponds to the Slavic people in the Carpathian-Alpine basin and thus that the compact Slavic settlement was there already at the beginning of the first millennium AD.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/48763550" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="99a68a9efbdbe5223dffefd4f9bab291" rel="nofollow" data-download="{"attachment_id":67202447,"asset_id":48763550,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/67202447/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="5881919" href="https://stuba.academia.edu/KarolMikula">Karol Mikula</a><script data-card-contents-for-user="5881919" type="text/json">{"id":5881919,"first_name":"Karol","last_name":"Mikula","domain_name":"stuba","page_name":"KarolMikula","display_name":"Karol Mikula","profile_url":"https://stuba.academia.edu/KarolMikula?f_ri=1554856","photo":"https://0.academia-photos.com/5881919/146873012/136418986/s65_karol.mikula.png"}</script></span></span></li><li class="js-paper-rank-work_48763550 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="48763550"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 48763550, container: ".js-paper-rank-work_48763550", }); });</script></li><li class="js-percentile-work_48763550 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 48763550; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_48763550"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_48763550 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="48763550"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 48763550; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=48763550]").text(description); $(".js-view-count-work_48763550").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_48763550").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="48763550"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="14741" href="https://www.academia.edu/Documents/in/Strabo">Strabo</a>, <script data-card-contents-for-ri="14741" type="text/json">{"id":14741,"name":"Strabo","url":"https://www.academia.edu/Documents/in/Strabo?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="17445" href="https://www.academia.edu/Documents/in/Historical_maps">Historical maps</a>, <script data-card-contents-for-ri="17445" type="text/json">{"id":17445,"name":"Historical maps","url":"https://www.academia.edu/Documents/in/Historical_maps?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="95770" href="https://www.academia.edu/Documents/in/Slavic_Ethnogenesis">Slavic Ethnogenesis</a>, <script data-card-contents-for-ri="95770" type="text/json">{"id":95770,"name":"Slavic Ethnogenesis","url":"https://www.academia.edu/Documents/in/Slavic_Ethnogenesis?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="497302" href="https://www.academia.edu/Documents/in/Finite_Difference_Method">Finite Difference Method</a><script data-card-contents-for-ri="497302" type="text/json">{"id":497302,"name":"Finite Difference Method","url":"https://www.academia.edu/Documents/in/Finite_Difference_Method?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=48763550]'), work: {"id":48763550,"title":"WHAT WAS THE RIVER ISTER IN THE TIME OF STRABO? A MATHEMATICAL APPROACH","created_at":"2021-05-05T13:40:00.964-07:00","url":"https://www.academia.edu/48763550/WHAT_WAS_THE_RIVER_ISTER_IN_THE_TIME_OF_STRABO_A_MATHEMATICAL_APPROACH?f_ri=1554856","dom_id":"work_48763550","summary":"In this paper, we introduce a novel method for map registration and apply it to transformation of the river Ister from {\\it Strabo's map of the World} to the current map in the World Geodetic System. This transformation leads to the surprising but convincing result that Strabo's river Ister best coincides with the nowadays Tauernbach-Isel-Drava-Danube course and not with the Danube river what is commonly assumed. Such a result is supported by carefully designed mathematical measurements and it resolves all related controversies otherwise appearing in understanding and translation of Strabo's original text. Based on this result we also show that {\\it Strabo's Suevi in the Hercynian Forest} corresponds to the Slavic people in the Carpathian-Alpine basin and thus that the compact Slavic settlement was there already at the beginning of the first millennium AD. ","downloadable_attachments":[{"id":67202447,"asset_id":48763550,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":5881919,"first_name":"Karol","last_name":"Mikula","domain_name":"stuba","page_name":"KarolMikula","display_name":"Karol Mikula","profile_url":"https://stuba.academia.edu/KarolMikula?f_ri=1554856","photo":"https://0.academia-photos.com/5881919/146873012/136418986/s65_karol.mikula.png"}],"research_interests":[{"id":14741,"name":"Strabo","url":"https://www.academia.edu/Documents/in/Strabo?f_ri=1554856","nofollow":false},{"id":17445,"name":"Historical maps","url":"https://www.academia.edu/Documents/in/Historical_maps?f_ri=1554856","nofollow":false},{"id":95770,"name":"Slavic Ethnogenesis","url":"https://www.academia.edu/Documents/in/Slavic_Ethnogenesis?f_ri=1554856","nofollow":false},{"id":497302,"name":"Finite Difference Method","url":"https://www.academia.edu/Documents/in/Finite_Difference_Method?f_ri=1554856","nofollow":false},{"id":1300538,"name":"Numerical Solution of Laplace Equation","url":"https://www.academia.edu/Documents/in/Numerical_Solution_of_Laplace_Equation?f_ri=1554856"},{"id":1465556,"name":"The Ister","url":"https://www.academia.edu/Documents/in/The_Ister?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_10718982" data-work_id="10718982" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/10718982/Modified_AES_Algorithm_Using_Multiple_S_Boxes">Modified AES Algorithm Using Multiple S-Boxes</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This paper proposes for a modified version of the AES algorithm using multiple Sboxes. While many studies have been conducted specifically on modifying the Sbox, these studies were made to replace the Rijndael Sboxes in the AES cipher. We... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_10718982" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This paper proposes for a modified version of the<br />AES algorithm using multiple Sboxes. While many<br />studies have been conducted specifically on<br />modifying the Sbox, these studies were made to<br />replace the Rijndael Sboxes in the AES cipher. We<br />propose to implement two substitution boxes, where<br />the first Sbox is the Rijndael Sbox and will be used as<br />is. The second Sbox was constructed through an<br />XOR operation and affine transformation and will<br />replace the MixColumns operation within the internal<br />rounds in the cipher. Based on simulation testing<br />conducted, it was found out that the modified AES<br />algorithm using multiple SBoxes has better speed<br />performance compared to the original cipher.<br />However, when tested using the avalanche effect, the<br />changes in the output bits were below the minimum<br />expected rate.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/10718982" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="3b7d0fefe5d41caca8619dde4dc60bc1" rel="nofollow" data-download="{"attachment_id":36604310,"asset_id":10718982,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/36604310/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="2657630" href="https://sdiwc.academia.edu/TheSocietyofDigitalInformationandWirelessCommunications">SDIWC Organization</a><script data-card-contents-for-user="2657630" type="text/json">{"id":2657630,"first_name":"SDIWC","last_name":"Organization","domain_name":"sdiwc","page_name":"TheSocietyofDigitalInformationandWirelessCommunications","display_name":"SDIWC Organization","profile_url":"https://sdiwc.academia.edu/TheSocietyofDigitalInformationandWirelessCommunications?f_ri=1554856","photo":"https://0.academia-photos.com/2657630/849179/1055710/s65_natalie.walker.jpg"}</script></span></span></li><li class="js-paper-rank-work_10718982 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="10718982"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 10718982, container: ".js-paper-rank-work_10718982", }); });</script></li><li class="js-percentile-work_10718982 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 10718982; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_10718982"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_10718982 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="10718982"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 10718982; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=10718982]").text(description); $(".js-view-count-work_10718982").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_10718982").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="10718982"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="16542" href="https://www.academia.edu/Documents/in/Cryptography">Cryptography</a>, <script data-card-contents-for-ri="16542" type="text/json">{"id":16542,"name":"Cryptography","url":"https://www.academia.edu/Documents/in/Cryptography?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1554856" href="https://www.academia.edu/Documents/in/Affine_Transformation">Affine Transformation</a>, <script data-card-contents-for-ri="1554856" type="text/json">{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1809961" href="https://www.academia.edu/Documents/in/AES_algorithm">AES algorithm</a><script data-card-contents-for-ri="1809961" type="text/json">{"id":1809961,"name":"AES algorithm","url":"https://www.academia.edu/Documents/in/AES_algorithm?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=10718982]'), work: {"id":10718982,"title":"Modified AES Algorithm Using Multiple S-Boxes","created_at":"2015-02-11T16:31:31.512-08:00","url":"https://www.academia.edu/10718982/Modified_AES_Algorithm_Using_Multiple_S_Boxes?f_ri=1554856","dom_id":"work_10718982","summary":"This paper proposes for a modified version of the\nAES algorithm using multiple Sboxes. While many\nstudies have been conducted specifically on\nmodifying the Sbox, these studies were made to\nreplace the Rijndael Sboxes in the AES cipher. We\npropose to implement two substitution boxes, where\nthe first Sbox is the Rijndael Sbox and will be used as\nis. The second Sbox was constructed through an\nXOR operation and affine transformation and will\nreplace the MixColumns operation within the internal\nrounds in the cipher. Based on simulation testing\nconducted, it was found out that the modified AES\nalgorithm using multiple SBoxes has better speed\nperformance compared to the original cipher.\nHowever, when tested using the avalanche effect, the\nchanges in the output bits were below the minimum\nexpected rate.","downloadable_attachments":[{"id":36604310,"asset_id":10718982,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":2657630,"first_name":"SDIWC","last_name":"Organization","domain_name":"sdiwc","page_name":"TheSocietyofDigitalInformationandWirelessCommunications","display_name":"SDIWC Organization","profile_url":"https://sdiwc.academia.edu/TheSocietyofDigitalInformationandWirelessCommunications?f_ri=1554856","photo":"https://0.academia-photos.com/2657630/849179/1055710/s65_natalie.walker.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=1554856","nofollow":false},{"id":16542,"name":"Cryptography","url":"https://www.academia.edu/Documents/in/Cryptography?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false},{"id":1809961,"name":"AES algorithm","url":"https://www.academia.edu/Documents/in/AES_algorithm?f_ri=1554856","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3127122" data-work_id="3127122" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3127122/A_new_chain_code">A new chain code</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">A new chain code for shapes composed of regular cells is defined. This boundary chain code is based on the numbers of cell vertices which are in touch with the bounding contour of the shape. This boundary chain code is termed vertex chain... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_3127122" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">A new chain code for shapes composed of regular cells is defined. This boundary chain code is based on the numbers of cell vertices which are in touch with the bounding contour of the shape. This boundary chain code is termed vertex chain code (VCC). The VCC is invariant under translation and rotation. Also, it may be starting point normalized and invariant under mirroring transformation. Using this concept of chain code it is possible to relate the chain length to the contact perimeter, which corresponds to the sum of the boundaries of neighboring cells of the shape (Bribiesca, E., Comp. Math. Appl. 33(11) (1997) 1–9); also, to relate the chain nodes to the contact vertices, which correspond to the vertices of neighboring cells. So, in this way, these relations among the chain and the characteristics of interior of the shape allow us to obtain interesting properties. This work is motivated by the idea of obtaining various shape features computed directly from the VCC without going to Cartesian-coordinate representation. Finally, in order to illustrate the capabilities of the VCC: we present some results using real shapes.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3127122" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="9399468eb508555f77f23f90f882aabd" rel="nofollow" data-download="{"attachment_id":50446417,"asset_id":3127122,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50446417/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="701995" href="https://unam.academia.edu/ErnestoBribiesca">Ernesto Bribiesca</a><script data-card-contents-for-user="701995" type="text/json">{"id":701995,"first_name":"Ernesto","last_name":"Bribiesca","domain_name":"unam","page_name":"ErnestoBribiesca","display_name":"Ernesto Bribiesca","profile_url":"https://unam.academia.edu/ErnestoBribiesca?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_3127122 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3127122"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3127122, container: ".js-paper-rank-work_3127122", }); });</script></li><li class="js-percentile-work_3127122 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3127122; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3127122"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3127122 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3127122"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3127122; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3127122]").text(description); $(".js-view-count-work_3127122").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3127122").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3127122"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="1185" href="https://www.academia.edu/Documents/in/Image_Processing">Image Processing</a>, <script data-card-contents-for-ri="1185" type="text/json">{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5109" href="https://www.academia.edu/Documents/in/Pattern_Recognition">Pattern Recognition</a>, <script data-card-contents-for-ri="5109" type="text/json">{"id":5109,"name":"Pattern Recognition","url":"https://www.academia.edu/Documents/in/Pattern_Recognition?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="26817" href="https://www.academia.edu/Documents/in/Algorithm">Algorithm</a>, <script data-card-contents-for-ri="26817" type="text/json">{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="31486" href="https://www.academia.edu/Documents/in/Coding">Coding</a><script data-card-contents-for-ri="31486" type="text/json">{"id":31486,"name":"Coding","url":"https://www.academia.edu/Documents/in/Coding?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3127122]'), work: {"id":3127122,"title":"A new chain code","created_at":"2013-03-27T04:21:00.172-07:00","url":"https://www.academia.edu/3127122/A_new_chain_code?f_ri=1554856","dom_id":"work_3127122","summary":"A new chain code for shapes composed of regular cells is defined. This boundary chain code is based on the numbers of cell vertices which are in touch with the bounding contour of the shape. This boundary chain code is termed vertex chain code (VCC). The VCC is invariant under translation and rotation. Also, it may be starting point normalized and invariant under mirroring transformation. Using this concept of chain code it is possible to relate the chain length to the contact perimeter, which corresponds to the sum of the boundaries of neighboring cells of the shape (Bribiesca, E., Comp. Math. Appl. 33(11) (1997) 1–9); also, to relate the chain nodes to the contact vertices, which correspond to the vertices of neighboring cells. So, in this way, these relations among the chain and the characteristics of interior of the shape allow us to obtain interesting properties. This work is motivated by the idea of obtaining various shape features computed directly from the VCC without going to Cartesian-coordinate representation. Finally, in order to illustrate the capabilities of the VCC: we present some results using real shapes.","downloadable_attachments":[{"id":50446417,"asset_id":3127122,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":701995,"first_name":"Ernesto","last_name":"Bribiesca","domain_name":"unam","page_name":"ErnestoBribiesca","display_name":"Ernesto Bribiesca","profile_url":"https://unam.academia.edu/ErnestoBribiesca?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=1554856","nofollow":false},{"id":5109,"name":"Pattern Recognition","url":"https://www.academia.edu/Documents/in/Pattern_Recognition?f_ri=1554856","nofollow":false},{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=1554856","nofollow":false},{"id":31486,"name":"Coding","url":"https://www.academia.edu/Documents/in/Coding?f_ri=1554856","nofollow":false},{"id":81788,"name":"Edge Detection","url":"https://www.academia.edu/Documents/in/Edge_Detection?f_ri=1554856"},{"id":971065,"name":"Shapes","url":"https://www.academia.edu/Documents/in/Shapes?f_ri=1554856"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_20133847" data-work_id="20133847" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/20133847/INFINITESIMAL_AFFINE_TRANSFORMATIONS_IN_THE_TANGENT_BUNDLE_OF_A_RIEMANNIAN_MANIFOLD_WITH_RESPECT_TO_THE_HORIZONTAL_LIFT_OF_AN_AFFINE_CONNECTION">INFINITESIMAL AFFINE TRANSFORMATIONS IN THE TANGENT BUNDLE OF A RIEMANNIAN MANIFOLD WITH RESPECT TO THE HORIZONTAL LIFT OF AN AFFINE CONNECTION</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The main purpose of the present paper is to study properties of vertical inflnitesimal a-ne transformation in the tangent bundle of a Riemann- ian manifold with respect to the horizontal lift of an a-ne connection, and to apply the... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_20133847" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The main purpose of the present paper is to study properties of vertical inflnitesimal a-ne transformation in the tangent bundle of a Riemann- ian manifold with respect to the horizontal lift of an a-ne connection, and to apply the results obtained to the study of flbre-preserving infln- itesimal a-ne transformations in this setting.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/20133847" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="92b27990e38204caad73fdc2bd019b40" rel="nofollow" data-download="{"attachment_id":41229345,"asset_id":20133847,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41229345/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="41211461" href="https://independent.academia.edu/GezerAydin">Aydin Gezer</a><script data-card-contents-for-user="41211461" type="text/json">{"id":41211461,"first_name":"Aydin","last_name":"Gezer","domain_name":"independent","page_name":"GezerAydin","display_name":"Aydin Gezer","profile_url":"https://independent.academia.edu/GezerAydin?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_20133847 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="20133847"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 20133847, container: ".js-paper-rank-work_20133847", }); });</script></li><li class="js-percentile-work_20133847 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 20133847; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_20133847"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_20133847 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="20133847"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 20133847; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=20133847]").text(description); $(".js-view-count-work_20133847").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_20133847").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="20133847"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="305" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1554856" href="https://www.academia.edu/Documents/in/Affine_Transformation">Affine Transformation</a><script data-card-contents-for-ri="1554856" type="text/json">{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=20133847]'), work: {"id":20133847,"title":"INFINITESIMAL AFFINE TRANSFORMATIONS IN THE TANGENT BUNDLE OF A RIEMANNIAN MANIFOLD WITH RESPECT TO THE HORIZONTAL LIFT OF AN AFFINE CONNECTION","created_at":"2016-01-10T03:07:06.761-08:00","url":"https://www.academia.edu/20133847/INFINITESIMAL_AFFINE_TRANSFORMATIONS_IN_THE_TANGENT_BUNDLE_OF_A_RIEMANNIAN_MANIFOLD_WITH_RESPECT_TO_THE_HORIZONTAL_LIFT_OF_AN_AFFINE_CONNECTION?f_ri=1554856","dom_id":"work_20133847","summary":"The main purpose of the present paper is to study properties of vertical inflnitesimal a-ne transformation in the tangent bundle of a Riemann- ian manifold with respect to the horizontal lift of an a-ne connection, and to apply the results obtained to the study of flbre-preserving infln- itesimal a-ne transformations in this setting.","downloadable_attachments":[{"id":41229345,"asset_id":20133847,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":41211461,"first_name":"Aydin","last_name":"Gezer","domain_name":"independent","page_name":"GezerAydin","display_name":"Aydin Gezer","profile_url":"https://independent.academia.edu/GezerAydin?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_27613663" data-work_id="27613663" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/27613663/Proper_complex_random_processes_with_applications_to_information_theory">Proper complex random processes with applications to information theory</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/27613663" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="8895756234f0bd47c71fb5e4d47581c4" rel="nofollow" data-download="{"attachment_id":47878826,"asset_id":27613663,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47878826/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="51810098" href="https://ibm.academia.edu/FredyNeeser">Fredy Neeser</a><script data-card-contents-for-user="51810098" type="text/json">{"id":51810098,"first_name":"Fredy","last_name":"Neeser","domain_name":"ibm","page_name":"FredyNeeser","display_name":"Fredy Neeser","profile_url":"https://ibm.academia.edu/FredyNeeser?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_27613663 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="27613663"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 27613663, container: ".js-paper-rank-work_27613663", }); });</script></li><li class="js-percentile-work_27613663 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 27613663; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_27613663"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_27613663 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="27613663"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 27613663; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=27613663]").text(description); $(".js-view-count-work_27613663").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_27613663").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="27613663"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">21</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="347" href="https://www.academia.edu/Documents/in/Stochastic_Process">Stochastic Process</a>, <script data-card-contents-for-ri="347" type="text/json">{"id":347,"name":"Stochastic Process","url":"https://www.academia.edu/Documents/in/Stochastic_Process?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1410" href="https://www.academia.edu/Documents/in/Information_Theory">Information Theory</a>, <script data-card-contents-for-ri="1410" type="text/json">{"id":1410,"name":"Information Theory","url":"https://www.academia.edu/Documents/in/Information_Theory?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="21913" href="https://www.academia.edu/Documents/in/ISI">ISI</a>, <script data-card-contents-for-ri="21913" type="text/json">{"id":21913,"name":"ISI","url":"https://www.academia.edu/Documents/in/ISI?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="36265" href="https://www.academia.edu/Documents/in/Entropy">Entropy</a><script data-card-contents-for-ri="36265" type="text/json">{"id":36265,"name":"Entropy","url":"https://www.academia.edu/Documents/in/Entropy?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=27613663]'), work: {"id":27613663,"title":"Proper complex random processes with applications to information theory","created_at":"2016-08-08T00:56:16.068-07:00","url":"https://www.academia.edu/27613663/Proper_complex_random_processes_with_applications_to_information_theory?f_ri=1554856","dom_id":"work_27613663","summary":null,"downloadable_attachments":[{"id":47878826,"asset_id":27613663,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":51810098,"first_name":"Fredy","last_name":"Neeser","domain_name":"ibm","page_name":"FredyNeeser","display_name":"Fredy Neeser","profile_url":"https://ibm.academia.edu/FredyNeeser?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":347,"name":"Stochastic Process","url":"https://www.academia.edu/Documents/in/Stochastic_Process?f_ri=1554856","nofollow":false},{"id":1410,"name":"Information Theory","url":"https://www.academia.edu/Documents/in/Information_Theory?f_ri=1554856","nofollow":false},{"id":21913,"name":"ISI","url":"https://www.academia.edu/Documents/in/ISI?f_ri=1554856","nofollow":false},{"id":36265,"name":"Entropy","url":"https://www.academia.edu/Documents/in/Entropy?f_ri=1554856","nofollow":false},{"id":89231,"name":"Frequency-domain analysis","url":"https://www.academia.edu/Documents/in/Frequency-domain_analysis?f_ri=1554856"},{"id":195042,"name":"Random Processes","url":"https://www.academia.edu/Documents/in/Random_Processes?f_ri=1554856"},{"id":383728,"name":"Vectors","url":"https://www.academia.edu/Documents/in/Vectors?f_ri=1554856"},{"id":506478,"name":"Random Variables","url":"https://www.academia.edu/Documents/in/Random_Variables?f_ri=1554856"},{"id":611819,"name":"Discrete random variable","url":"https://www.academia.edu/Documents/in/Discrete_random_variable?f_ri=1554856"},{"id":749302,"name":"Indexation","url":"https://www.academia.edu/Documents/in/Indexation?f_ri=1554856"},{"id":872399,"name":"Probability Density Function","url":"https://www.academia.edu/Documents/in/Probability_Density_Function?f_ri=1554856"},{"id":991005,"name":"Time Domain","url":"https://www.academia.edu/Documents/in/Time_Domain?f_ri=1554856"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=1554856"},{"id":1400558,"name":"Channel Capacity","url":"https://www.academia.edu/Documents/in/Channel_Capacity?f_ri=1554856"},{"id":1473341,"name":"Covariance","url":"https://www.academia.edu/Documents/in/Covariance?f_ri=1554856"},{"id":1523809,"name":"Maximum entropy","url":"https://www.academia.edu/Documents/in/Maximum_entropy?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1625072,"name":"Frequency Domain","url":"https://www.academia.edu/Documents/in/Frequency_Domain?f_ri=1554856"},{"id":1800838,"name":"Discrete Fourier Transform","url":"https://www.academia.edu/Documents/in/Discrete_Fourier_Transform?f_ri=1554856"},{"id":1885584,"name":"Entropie","url":"https://www.academia.edu/Documents/in/Entropie?f_ri=1554856"},{"id":2004989,"name":"Awgn","url":"https://www.academia.edu/Documents/in/Awgn?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_27361759" data-work_id="27361759" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/27361759/The_Peak_Pairs_algorithm_for_strain_mapping_from_HRTEM_images">The Peak Pairs algorithm for strain mapping from HRTEM images</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/27361759" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="62d1d38541b784bda37f7bda7d0c8555" rel="nofollow" data-download="{"attachment_id":47617461,"asset_id":27361759,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47617461/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="45312154" href="https://independent.academia.edu/SERGIOIMOLINA">SERGIO I. MOLINA</a><script data-card-contents-for-user="45312154" type="text/json">{"id":45312154,"first_name":"SERGIO I.","last_name":"MOLINA","domain_name":"independent","page_name":"SERGIOIMOLINA","display_name":"SERGIO I. MOLINA","profile_url":"https://independent.academia.edu/SERGIOIMOLINA?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_27361759 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="27361759"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 27361759, container: ".js-paper-rank-work_27361759", }); });</script></li><li class="js-percentile-work_27361759 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 27361759; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_27361759"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_27361759 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="27361759"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 27361759; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=27361759]").text(description); $(".js-view-count-work_27361759").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_27361759").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="27361759"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="1185" href="https://www.academia.edu/Documents/in/Image_Processing">Image Processing</a>, <script data-card-contents-for-ri="1185" type="text/json">{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="90282" href="https://www.academia.edu/Documents/in/High_Resolution_Transmission_Electron_Microscopy">High Resolution Transmission Electron Microscopy</a>, <script data-card-contents-for-ri="90282" type="text/json">{"id":90282,"name":"High Resolution Transmission Electron Microscopy","url":"https://www.academia.edu/Documents/in/High_Resolution_Transmission_Electron_Microscopy?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="152679" href="https://www.academia.edu/Documents/in/Dislocations">Dislocations</a>, <script data-card-contents-for-ri="152679" type="text/json">{"id":152679,"name":"Dislocations","url":"https://www.academia.edu/Documents/in/Dislocations?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="217265" href="https://www.academia.edu/Documents/in/Ultramicroscopy">Ultramicroscopy</a><script data-card-contents-for-ri="217265" type="text/json">{"id":217265,"name":"Ultramicroscopy","url":"https://www.academia.edu/Documents/in/Ultramicroscopy?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=27361759]'), work: {"id":27361759,"title":"The Peak Pairs algorithm for strain mapping from HRTEM images","created_at":"2016-07-29T04:00:38.344-07:00","url":"https://www.academia.edu/27361759/The_Peak_Pairs_algorithm_for_strain_mapping_from_HRTEM_images?f_ri=1554856","dom_id":"work_27361759","summary":null,"downloadable_attachments":[{"id":47617461,"asset_id":27361759,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":45312154,"first_name":"SERGIO I.","last_name":"MOLINA","domain_name":"independent","page_name":"SERGIOIMOLINA","display_name":"SERGIO I. MOLINA","profile_url":"https://independent.academia.edu/SERGIOIMOLINA?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=1554856","nofollow":false},{"id":90282,"name":"High Resolution Transmission Electron Microscopy","url":"https://www.academia.edu/Documents/in/High_Resolution_Transmission_Electron_Microscopy?f_ri=1554856","nofollow":false},{"id":152679,"name":"Dislocations","url":"https://www.academia.edu/Documents/in/Dislocations?f_ri=1554856","nofollow":false},{"id":217265,"name":"Ultramicroscopy","url":"https://www.academia.edu/Documents/in/Ultramicroscopy?f_ri=1554856","nofollow":false},{"id":263152,"name":"Optical physics","url":"https://www.academia.edu/Documents/in/Optical_physics?f_ri=1554856"},{"id":581652,"name":"Data Processing","url":"https://www.academia.edu/Documents/in/Data_Processing?f_ri=1554856"},{"id":1228142,"name":"Geometric Phase","url":"https://www.academia.edu/Documents/in/Geometric_Phase?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1561715,"name":"Image processing techniques","url":"https://www.academia.edu/Documents/in/Image_processing_techniques?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_510445" data-work_id="510445" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/510445/Uniting_two_Control_Lyapunov_Functions_for_affine_systems">Uniting two Control Lyapunov Functions for affine systems</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/510445" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="01a5eacf07ad276fec157e6aee730ea8" rel="nofollow" data-download="{"attachment_id":3457528,"asset_id":510445,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/3457528/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="184259" href="https://univ-lyon1.academia.edu/VincentAndrieu">Vincent Andrieu</a><script data-card-contents-for-user="184259" type="text/json">{"id":184259,"first_name":"Vincent","last_name":"Andrieu","domain_name":"univ-lyon1","page_name":"VincentAndrieu","display_name":"Vincent Andrieu","profile_url":"https://univ-lyon1.academia.edu/VincentAndrieu?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_510445 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="510445"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 510445, container: ".js-paper-rank-work_510445", }); });</script></li><li class="js-percentile-work_510445 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 510445; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_510445"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_510445 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="510445"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 510445; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=510445]").text(description); $(".js-view-count-work_510445").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_510445").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="510445"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">13</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="60" href="https://www.academia.edu/Documents/in/Mechanical_Engineering">Mechanical Engineering</a>, <script data-card-contents-for-ri="60" type="text/json">{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="305" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2200" href="https://www.academia.edu/Documents/in/Optimal_Control">Optimal Control</a>, <script data-card-contents-for-ri="2200" type="text/json">{"id":2200,"name":"Optimal Control","url":"https://www.academia.edu/Documents/in/Optimal_Control?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="51181" href="https://www.academia.edu/Documents/in/Controllability">Controllability</a><script data-card-contents-for-ri="51181" type="text/json">{"id":51181,"name":"Controllability","url":"https://www.academia.edu/Documents/in/Controllability?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=510445]'), work: {"id":510445,"title":"Uniting two Control Lyapunov Functions for affine systems","created_at":"2011-04-05T00:17:10.398-07:00","url":"https://www.academia.edu/510445/Uniting_two_Control_Lyapunov_Functions_for_affine_systems?f_ri=1554856","dom_id":"work_510445","summary":null,"downloadable_attachments":[{"id":3457528,"asset_id":510445,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":184259,"first_name":"Vincent","last_name":"Andrieu","domain_name":"univ-lyon1","page_name":"VincentAndrieu","display_name":"Vincent Andrieu","profile_url":"https://univ-lyon1.academia.edu/VincentAndrieu?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=1554856","nofollow":false},{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=1554856","nofollow":false},{"id":2200,"name":"Optimal Control","url":"https://www.academia.edu/Documents/in/Optimal_Control?f_ri=1554856","nofollow":false},{"id":51181,"name":"Controllability","url":"https://www.academia.edu/Documents/in/Controllability?f_ri=1554856","nofollow":false},{"id":73017,"name":"Nonlinear Systems","url":"https://www.academia.edu/Documents/in/Nonlinear_Systems?f_ri=1554856"},{"id":347272,"name":"Second Order","url":"https://www.academia.edu/Documents/in/Second_Order?f_ri=1554856"},{"id":506858,"name":"Nonlinear system","url":"https://www.academia.edu/Documents/in/Nonlinear_system?f_ri=1554856"},{"id":543171,"name":"Lyapunov function","url":"https://www.academia.edu/Documents/in/Lyapunov_function?f_ri=1554856"},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=1554856"},{"id":970851,"name":"Asymptotic Stability","url":"https://www.academia.edu/Documents/in/Asymptotic_Stability?f_ri=1554856"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=1554856"},{"id":1443579,"name":"Non Linear Control","url":"https://www.academia.edu/Documents/in/Non_Linear_Control?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_15069936 coauthored" data-work_id="15069936" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/15069936/On_the_Algebraic_Expression_of_the_AES_S_Box_Like_S_Boxes">On the Algebraic Expression of the AES S-Box Like S-Boxes</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/15069936" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a5becfa25ce1fe26e5a3cf754ffea9c7" rel="nofollow" data-download="{"attachment_id":43604375,"asset_id":15069936,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43604375/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="165165532" href="https://kirklareliuniversity.academia.edu/BoraAslan">Bora Aslan</a><script data-card-contents-for-user="165165532" type="text/json">{"id":165165532,"first_name":"Bora","last_name":"Aslan","domain_name":"kirklareliuniversity","page_name":"BoraAslan","display_name":"Bora Aslan","profile_url":"https://kirklareliuniversity.academia.edu/BoraAslan?f_ri=1554856","photo":"https://0.academia-photos.com/165165532/98459490/87580906/s65_bora.aslan.jpeg"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-15069936">+1</span><div class="hidden js-additional-users-15069936"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/ErcanBulus">Ercan Bulus</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-15069936'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-15069936').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_15069936 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="15069936"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 15069936, container: ".js-paper-rank-work_15069936", }); });</script></li><li class="js-percentile-work_15069936 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 15069936; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_15069936"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_15069936 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="15069936"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 15069936; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=15069936]").text(description); $(".js-view-count-work_15069936").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_15069936").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="15069936"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="721506" href="https://www.academia.edu/Documents/in/Finite_Field">Finite Field</a>, <script data-card-contents-for-ri="721506" type="text/json">{"id":721506,"name":"Finite Field","url":"https://www.academia.edu/Documents/in/Finite_Field?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="790925" href="https://www.academia.edu/Documents/in/Block_Cipher">Block Cipher</a>, <script data-card-contents-for-ri="790925" type="text/json">{"id":790925,"name":"Block Cipher","url":"https://www.academia.edu/Documents/in/Block_Cipher?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1032572" href="https://www.academia.edu/Documents/in/Digital_and_Networked_Performance-1">Digital & Networked Performance</a>, <script data-card-contents-for-ri="1032572" type="text/json">{"id":1032572,"name":"Digital \u0026 Networked Performance","url":"https://www.academia.edu/Documents/in/Digital_and_Networked_Performance-1?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1554856" href="https://www.academia.edu/Documents/in/Affine_Transformation">Affine Transformation</a><script data-card-contents-for-ri="1554856" type="text/json">{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=15069936]'), work: {"id":15069936,"title":"On the Algebraic Expression of the AES S-Box Like S-Boxes","created_at":"2015-08-21T02:26:14.786-07:00","url":"https://www.academia.edu/15069936/On_the_Algebraic_Expression_of_the_AES_S_Box_Like_S_Boxes?f_ri=1554856","dom_id":"work_15069936","summary":null,"downloadable_attachments":[{"id":43604375,"asset_id":15069936,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":165165532,"first_name":"Bora","last_name":"Aslan","domain_name":"kirklareliuniversity","page_name":"BoraAslan","display_name":"Bora Aslan","profile_url":"https://kirklareliuniversity.academia.edu/BoraAslan?f_ri=1554856","photo":"https://0.academia-photos.com/165165532/98459490/87580906/s65_bora.aslan.jpeg"},{"id":34100832,"first_name":"Ercan","last_name":"Bulus","domain_name":"independent","page_name":"ErcanBulus","display_name":"Ercan Bulus","profile_url":"https://independent.academia.edu/ErcanBulus?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":721506,"name":"Finite Field","url":"https://www.academia.edu/Documents/in/Finite_Field?f_ri=1554856","nofollow":false},{"id":790925,"name":"Block Cipher","url":"https://www.academia.edu/Documents/in/Block_Cipher?f_ri=1554856","nofollow":false},{"id":1032572,"name":"Digital \u0026 Networked Performance","url":"https://www.academia.edu/Documents/in/Digital_and_Networked_Performance-1?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_752269" data-work_id="752269" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/752269/Extensions_of_the_Procrustes_method_for_the_optimal_superimposition_of_landmarks">Extensions of the Procrustes method for the optimal superimposition of landmarks</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/752269" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c4a4739eae1a87e54aa88b6bc00c287d" rel="nofollow" data-download="{"attachment_id":51252992,"asset_id":752269,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/51252992/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="104736" href="https://sbsuny.academia.edu/FJamesRohlf">F. James Rohlf</a><script data-card-contents-for-user="104736" type="text/json">{"id":104736,"first_name":"F. James","last_name":"Rohlf","domain_name":"sbsuny","page_name":"FJamesRohlf","display_name":"F. James Rohlf","profile_url":"https://sbsuny.academia.edu/FJamesRohlf?f_ri=1554856","photo":"https://0.academia-photos.com/104736/28819/26524/s65_f._james.rohlf.jpg"}</script></span></span></li><li class="js-paper-rank-work_752269 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="752269"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 752269, container: ".js-paper-rank-work_752269", }); });</script></li><li class="js-percentile-work_752269 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 752269; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_752269"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_752269 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="752269"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 752269; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=752269]").text(description); $(".js-view-count-work_752269").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_752269").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="752269"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="3363" href="https://www.academia.edu/Documents/in/Systematic_Biology">Systematic Biology</a>, <script data-card-contents-for-ri="3363" type="text/json">{"id":3363,"name":"Systematic Biology","url":"https://www.academia.edu/Documents/in/Systematic_Biology?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="648834" href="https://www.academia.edu/Documents/in/North_American">North American</a>, <script data-card-contents-for-ri="648834" type="text/json">{"id":648834,"name":"North American","url":"https://www.academia.edu/Documents/in/North_American?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1174970" href="https://www.academia.edu/Documents/in/Systematic_Zoology">Systematic Zoology</a>, <script data-card-contents-for-ri="1174970" type="text/json">{"id":1174970,"name":"Systematic Zoology","url":"https://www.academia.edu/Documents/in/Systematic_Zoology?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1327249" href="https://www.academia.edu/Documents/in/Least_Square_Method">Least Square Method</a><script data-card-contents-for-ri="1327249" type="text/json">{"id":1327249,"name":"Least Square Method","url":"https://www.academia.edu/Documents/in/Least_Square_Method?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=752269]'), work: {"id":752269,"title":"Extensions of the Procrustes method for the optimal superimposition of landmarks","created_at":"2011-07-17T03:39:42.466-07:00","url":"https://www.academia.edu/752269/Extensions_of_the_Procrustes_method_for_the_optimal_superimposition_of_landmarks?f_ri=1554856","dom_id":"work_752269","summary":null,"downloadable_attachments":[{"id":51252992,"asset_id":752269,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":104736,"first_name":"F. James","last_name":"Rohlf","domain_name":"sbsuny","page_name":"FJamesRohlf","display_name":"F. James Rohlf","profile_url":"https://sbsuny.academia.edu/FJamesRohlf?f_ri=1554856","photo":"https://0.academia-photos.com/104736/28819/26524/s65_f._james.rohlf.jpg"}],"research_interests":[{"id":3363,"name":"Systematic Biology","url":"https://www.academia.edu/Documents/in/Systematic_Biology?f_ri=1554856","nofollow":false},{"id":648834,"name":"North American","url":"https://www.academia.edu/Documents/in/North_American?f_ri=1554856","nofollow":false},{"id":1174970,"name":"Systematic Zoology","url":"https://www.academia.edu/Documents/in/Systematic_Zoology?f_ri=1554856","nofollow":false},{"id":1327249,"name":"Least Square Method","url":"https://www.academia.edu/Documents/in/Least_Square_Method?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1765547,"name":"Matrix Algebra","url":"https://www.academia.edu/Documents/in/Matrix_Algebra?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_7457592" data-work_id="7457592" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/7457592/Construction_of_fractal_objects_with_iterated_function_systems">Construction of fractal objects with iterated function systems</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/7457592" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="6e95872673293c5a73de92ab20dddeac" rel="nofollow" data-download="{"attachment_id":35861138,"asset_id":7457592,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/35861138/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="13275466" href="https://devry.academia.edu/BruceNaylor">Bruce Naylor</a><script data-card-contents-for-user="13275466" type="text/json">{"id":13275466,"first_name":"Bruce","last_name":"Naylor","domain_name":"devry","page_name":"BruceNaylor","display_name":"Bruce Naylor","profile_url":"https://devry.academia.edu/BruceNaylor?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_7457592 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="7457592"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 7457592, container: ".js-paper-rank-work_7457592", }); });</script></li><li class="js-percentile-work_7457592 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 7457592; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_7457592"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_7457592 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="7457592"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 7457592; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=7457592]").text(description); $(".js-view-count-work_7457592").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_7457592").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="7457592"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="61108" href="https://www.academia.edu/Documents/in/Geometric_model">Geometric model</a>, <script data-card-contents-for-ri="61108" type="text/json">{"id":61108,"name":"Geometric model","url":"https://www.academia.edu/Documents/in/Geometric_model?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="100607" href="https://www.academia.edu/Documents/in/Scientific_Communication">Scientific Communication</a>, <script data-card-contents-for-ri="100607" type="text/json">{"id":100607,"name":"Scientific Communication","url":"https://www.academia.edu/Documents/in/Scientific_Communication?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="183857" href="https://www.academia.edu/Documents/in/Tree_Planting">Tree Planting</a>, <script data-card-contents-for-ri="183857" type="text/json">{"id":183857,"name":"Tree Planting","url":"https://www.academia.edu/Documents/in/Tree_Planting?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="213950" href="https://www.academia.edu/Documents/in/Inverse_Problem">Inverse Problem</a><script data-card-contents-for-ri="213950" type="text/json">{"id":213950,"name":"Inverse Problem","url":"https://www.academia.edu/Documents/in/Inverse_Problem?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=7457592]'), work: {"id":7457592,"title":"Construction of fractal objects with iterated function systems","created_at":"2014-06-25T05:00:31.965-07:00","url":"https://www.academia.edu/7457592/Construction_of_fractal_objects_with_iterated_function_systems?f_ri=1554856","dom_id":"work_7457592","summary":null,"downloadable_attachments":[{"id":35861138,"asset_id":7457592,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":13275466,"first_name":"Bruce","last_name":"Naylor","domain_name":"devry","page_name":"BruceNaylor","display_name":"Bruce Naylor","profile_url":"https://devry.academia.edu/BruceNaylor?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":61108,"name":"Geometric model","url":"https://www.academia.edu/Documents/in/Geometric_model?f_ri=1554856","nofollow":false},{"id":100607,"name":"Scientific Communication","url":"https://www.academia.edu/Documents/in/Scientific_Communication?f_ri=1554856","nofollow":false},{"id":183857,"name":"Tree Planting","url":"https://www.academia.edu/Documents/in/Tree_Planting?f_ri=1554856","nofollow":false},{"id":213950,"name":"Inverse Problem","url":"https://www.academia.edu/Documents/in/Inverse_Problem?f_ri=1554856","nofollow":false},{"id":264606,"name":"Computer Graphic","url":"https://www.academia.edu/Documents/in/Computer_Graphic?f_ri=1554856"},{"id":403149,"name":"Iterated Function System","url":"https://www.academia.edu/Documents/in/Iterated_Function_System?f_ri=1554856"},{"id":431817,"name":"Natural Phenomena","url":"https://www.academia.edu/Documents/in/Natural_Phenomena?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_14628640 coauthored" data-work_id="14628640" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/14628640/A_simple_interactive_GIS_tool_for_transforming_assumed_total_station_surveys_to_real_world_coordinates_the_CHaMP_transformation_tool">A simple, interactive GIS tool for transforming assumed total station surveys to real world coordinates – the CHaMP transformation tool</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/14628640" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="070be12d4f7aabfd3ec50bc21860cb39" rel="nofollow" data-download="{"attachment_id":44018855,"asset_id":14628640,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/44018855/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="33575869" href="https://independent.academia.edu/GarrardC">C. Garrard</a><script data-card-contents-for-user="33575869" type="text/json">{"id":33575869,"first_name":"C.","last_name":"Garrard","domain_name":"independent","page_name":"GarrardC","display_name":"C. Garrard","profile_url":"https://independent.academia.edu/GarrardC?f_ri=1554856","photo":"https://gravatar.com/avatar/a207e75ac002cb781b56c68f6ac8555a?s=65"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-14628640">+1</span><div class="hidden js-additional-users-14628640"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/WhiteheadKelly">Kelly Whitehead</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-14628640'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-14628640').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_14628640 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="14628640"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 14628640, container: ".js-paper-rank-work_14628640", }); });</script></li><li class="js-percentile-work_14628640 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 14628640; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_14628640"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_14628640 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="14628640"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 14628640; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=14628640]").text(description); $(".js-view-count-work_14628640").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_14628640").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="14628640"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="400" href="https://www.academia.edu/Documents/in/Earth_Sciences">Earth Sciences</a>, <script data-card-contents-for-ri="400" type="text/json">{"id":400,"name":"Earth Sciences","url":"https://www.academia.edu/Documents/in/Earth_Sciences?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="973134" href="https://www.academia.edu/Documents/in/Wireless_Control_Network">Wireless Control Network</a>, <script data-card-contents-for-ri="973134" type="text/json">{"id":973134,"name":"Wireless Control Network","url":"https://www.academia.edu/Documents/in/Wireless_Control_Network?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1554856" href="https://www.academia.edu/Documents/in/Affine_Transformation">Affine Transformation</a><script data-card-contents-for-ri="1554856" type="text/json">{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=14628640]'), work: {"id":14628640,"title":"A simple, interactive GIS tool for transforming assumed total station surveys to real world coordinates – the CHaMP transformation tool","created_at":"2015-08-03T12:42:36.123-07:00","url":"https://www.academia.edu/14628640/A_simple_interactive_GIS_tool_for_transforming_assumed_total_station_surveys_to_real_world_coordinates_the_CHaMP_transformation_tool?f_ri=1554856","dom_id":"work_14628640","summary":null,"downloadable_attachments":[{"id":44018855,"asset_id":14628640,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":33575869,"first_name":"C.","last_name":"Garrard","domain_name":"independent","page_name":"GarrardC","display_name":"C. Garrard","profile_url":"https://independent.academia.edu/GarrardC?f_ri=1554856","photo":"https://gravatar.com/avatar/a207e75ac002cb781b56c68f6ac8555a?s=65"},{"id":45393617,"first_name":"Kelly","last_name":"Whitehead","domain_name":"independent","page_name":"WhiteheadKelly","display_name":"Kelly Whitehead","profile_url":"https://independent.academia.edu/WhiteheadKelly?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=1554856","nofollow":false},{"id":400,"name":"Earth Sciences","url":"https://www.academia.edu/Documents/in/Earth_Sciences?f_ri=1554856","nofollow":false},{"id":973134,"name":"Wireless Control Network","url":"https://www.academia.edu/Documents/in/Wireless_Control_Network?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_27153773 coauthored" data-work_id="27153773" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/27153773/Generation_of_efficient_nested_loops_from_polyhedra">Generation of efficient nested loops from polyhedra</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/27153773" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="7e9ce3f4815b6e19ecf5a910d2180d88" rel="nofollow" data-download="{"attachment_id":47403406,"asset_id":27153773,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47403406/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="35396029" href="https://independent.academia.edu/SanjayRajopadhye">Sanjay Rajopadhye</a><script data-card-contents-for-user="35396029" type="text/json">{"id":35396029,"first_name":"Sanjay","last_name":"Rajopadhye","domain_name":"independent","page_name":"SanjayRajopadhye","display_name":"Sanjay Rajopadhye","profile_url":"https://independent.academia.edu/SanjayRajopadhye?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-27153773">+1</span><div class="hidden js-additional-users-27153773"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://byu.academia.edu/DWilde">Doran Wilde</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-27153773'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-27153773').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_27153773 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="27153773"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 27153773, container: ".js-paper-rank-work_27153773", }); });</script></li><li class="js-percentile-work_27153773 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 27153773; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_27153773"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_27153773 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="27153773"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 27153773; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=27153773]").text(description); $(".js-view-count-work_27153773").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_27153773").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="27153773"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="440" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3069" href="https://www.academia.edu/Documents/in/Parallel_Programming">Parallel Programming</a>, <script data-card-contents-for-ri="3069" type="text/json">{"id":3069,"name":"Parallel Programming","url":"https://www.academia.edu/Documents/in/Parallel_Programming?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="64561" href="https://www.academia.edu/Documents/in/Computer_Software">Computer Software</a>, <script data-card-contents-for-ri="64561" type="text/json">{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="116313" href="https://www.academia.edu/Documents/in/Automatic_Parallelization">Automatic Parallelization</a><script data-card-contents-for-ri="116313" type="text/json">{"id":116313,"name":"Automatic Parallelization","url":"https://www.academia.edu/Documents/in/Automatic_Parallelization?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=27153773]'), work: {"id":27153773,"title":"Generation of efficient nested loops from polyhedra","created_at":"2016-07-21T06:31:59.067-07:00","url":"https://www.academia.edu/27153773/Generation_of_efficient_nested_loops_from_polyhedra?f_ri=1554856","dom_id":"work_27153773","summary":null,"downloadable_attachments":[{"id":47403406,"asset_id":27153773,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":35396029,"first_name":"Sanjay","last_name":"Rajopadhye","domain_name":"independent","page_name":"SanjayRajopadhye","display_name":"Sanjay Rajopadhye","profile_url":"https://independent.academia.edu/SanjayRajopadhye?f_ri=1554856","photo":"/images/s65_no_pic.png"},{"id":51118128,"first_name":"Doran","last_name":"Wilde","domain_name":"byu","page_name":"DWilde","display_name":"Doran Wilde","profile_url":"https://byu.academia.edu/DWilde?f_ri=1554856","photo":"https://gravatar.com/avatar/b877a3dcebc51b2f7fba6e1f7959ea91?s=65"}],"research_interests":[{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=1554856","nofollow":false},{"id":3069,"name":"Parallel Programming","url":"https://www.academia.edu/Documents/in/Parallel_Programming?f_ri=1554856","nofollow":false},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=1554856","nofollow":false},{"id":116313,"name":"Automatic Parallelization","url":"https://www.academia.edu/Documents/in/Automatic_Parallelization?f_ri=1554856","nofollow":false},{"id":135177,"name":"Code Generation","url":"https://www.academia.edu/Documents/in/Code_Generation?f_ri=1554856"},{"id":154543,"name":"Space Time","url":"https://www.academia.edu/Documents/in/Space_Time?f_ri=1554856"},{"id":230429,"name":"Parallel","url":"https://www.academia.edu/Documents/in/Parallel?f_ri=1554856"},{"id":526110,"name":"Polyhedral Model","url":"https://www.academia.edu/Documents/in/Polyhedral_Model?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_71079451" data-work_id="71079451" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/71079451/CV_SLAM_a_new_ceiling_vision_based_slam_technique">CV-SLAM: a new ceiling vision-based slam technique</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">Abstract- We propose a fast and robust CV-SLAM (Ceiling</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/71079451" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="47fa2c8d0479355a09e7574b5626fb24" rel="nofollow" data-download="{"attachment_id":80580379,"asset_id":71079451,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/80580379/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="147293147" href="https://independent.academia.edu/WooYeonJeong">WooYeon Jeong</a><script data-card-contents-for-user="147293147" type="text/json">{"id":147293147,"first_name":"WooYeon","last_name":"Jeong","domain_name":"independent","page_name":"WooYeonJeong","display_name":"WooYeon Jeong","profile_url":"https://independent.academia.edu/WooYeonJeong?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_71079451 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="71079451"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 71079451, container: ".js-paper-rank-work_71079451", }); });</script></li><li class="js-percentile-work_71079451 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 71079451; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_71079451"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_71079451 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="71079451"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 71079451; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=71079451]").text(description); $(".js-view-count-work_71079451").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_71079451").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="71079451"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="55265" href="https://www.academia.edu/Documents/in/Simultaneous_Localization_and_Mapping">Simultaneous Localization and Mapping</a>, <script data-card-contents-for-ri="55265" type="text/json">{"id":55265,"name":"Simultaneous Localization and Mapping","url":"https://www.academia.edu/Documents/in/Simultaneous_Localization_and_Mapping?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="71001" href="https://www.academia.edu/Documents/in/Image_Reconstruction">Image Reconstruction</a>, <script data-card-contents-for-ri="71001" type="text/json">{"id":71001,"name":"Image Reconstruction","url":"https://www.academia.edu/Documents/in/Image_Reconstruction?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="160144" href="https://www.academia.edu/Documents/in/Feature_Extraction">Feature Extraction</a><script data-card-contents-for-ri="160144" type="text/json">{"id":160144,"name":"Feature Extraction","url":"https://www.academia.edu/Documents/in/Feature_Extraction?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=71079451]'), work: {"id":71079451,"title":"CV-SLAM: a new ceiling vision-based slam technique","created_at":"2022-02-10T23:24:13.002-08:00","url":"https://www.academia.edu/71079451/CV_SLAM_a_new_ceiling_vision_based_slam_technique?f_ri=1554856","dom_id":"work_71079451","summary":"Abstract- We propose a fast and robust CV-SLAM (Ceiling","downloadable_attachments":[{"id":80580379,"asset_id":71079451,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":147293147,"first_name":"WooYeon","last_name":"Jeong","domain_name":"independent","page_name":"WooYeonJeong","display_name":"WooYeon Jeong","profile_url":"https://independent.academia.edu/WooYeonJeong?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=1554856","nofollow":false},{"id":55265,"name":"Simultaneous Localization and Mapping","url":"https://www.academia.edu/Documents/in/Simultaneous_Localization_and_Mapping?f_ri=1554856","nofollow":false},{"id":71001,"name":"Image Reconstruction","url":"https://www.academia.edu/Documents/in/Image_Reconstruction?f_ri=1554856","nofollow":false},{"id":160144,"name":"Feature Extraction","url":"https://www.academia.edu/Documents/in/Feature_Extraction?f_ri=1554856","nofollow":false},{"id":229390,"name":"Real Time","url":"https://www.academia.edu/Documents/in/Real_Time?f_ri=1554856"},{"id":278182,"name":"Data Association","url":"https://www.academia.edu/Documents/in/Data_Association?f_ri=1554856"},{"id":872410,"name":"Extended Kalman Filter","url":"https://www.academia.edu/Documents/in/Extended_Kalman_Filter?f_ri=1554856"},{"id":1015743,"name":"Image Sequence","url":"https://www.academia.edu/Documents/in/Image_Sequence?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":2220123,"name":"Image Features","url":"https://www.academia.edu/Documents/in/Image_Features?f_ri=1554856"},{"id":2953876,"name":"Orientation Estimation ","url":"https://www.academia.edu/Documents/in/Orientation_Estimation?f_ri=1554856"},{"id":3480612,"name":"Vision system","url":"https://www.academia.edu/Documents/in/Vision_system?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_626127" data-work_id="626127" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/626127/Optimal_step_nonrigid_icp_algorithms_for_surface_registration">Optimal step nonrigid icp algorithms for surface registration</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/626127" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d94e3968c3abfec3cc59f8fa97056f84" rel="nofollow" data-download="{"attachment_id":3379762,"asset_id":626127,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/3379762/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="22213" href="https://unibas.academia.edu/BrianAmberg">Brian Amberg</a><script data-card-contents-for-user="22213" type="text/json">{"id":22213,"first_name":"Brian","last_name":"Amberg","domain_name":"unibas","page_name":"BrianAmberg","display_name":"Brian Amberg","profile_url":"https://unibas.academia.edu/BrianAmberg?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_626127 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="626127"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 626127, container: ".js-paper-rank-work_626127", }); });</script></li><li class="js-percentile-work_626127 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 626127; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_626127"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_626127 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="626127"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 626127; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=626127]").text(description); $(".js-view-count-work_626127").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_626127").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="626127"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="854" href="https://www.academia.edu/Documents/in/Computer_Vision">Computer Vision</a>, <script data-card-contents-for-ri="854" type="text/json">{"id":854,"name":"Computer Vision","url":"https://www.academia.edu/Documents/in/Computer_Vision?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5057" href="https://www.academia.edu/Documents/in/Iterative_Methods">Iterative Methods</a>, <script data-card-contents-for-ri="5057" type="text/json">{"id":5057,"name":"Iterative Methods","url":"https://www.academia.edu/Documents/in/Iterative_Methods?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="15124" href="https://www.academia.edu/Documents/in/Convergence">Convergence</a>, <script data-card-contents-for-ri="15124" type="text/json">{"id":15124,"name":"Convergence","url":"https://www.academia.edu/Documents/in/Convergence?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="29731" href="https://www.academia.edu/Documents/in/Image_Registration">Image Registration</a><script data-card-contents-for-ri="29731" type="text/json">{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=626127]'), work: {"id":626127,"title":"Optimal step nonrigid icp algorithms for surface registration","created_at":"2011-05-29T04:50:05.588-07:00","url":"https://www.academia.edu/626127/Optimal_step_nonrigid_icp_algorithms_for_surface_registration?f_ri=1554856","dom_id":"work_626127","summary":null,"downloadable_attachments":[{"id":3379762,"asset_id":626127,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":22213,"first_name":"Brian","last_name":"Amberg","domain_name":"unibas","page_name":"BrianAmberg","display_name":"Brian Amberg","profile_url":"https://unibas.academia.edu/BrianAmberg?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":854,"name":"Computer Vision","url":"https://www.academia.edu/Documents/in/Computer_Vision?f_ri=1554856","nofollow":false},{"id":5057,"name":"Iterative Methods","url":"https://www.academia.edu/Documents/in/Iterative_Methods?f_ri=1554856","nofollow":false},{"id":15124,"name":"Convergence","url":"https://www.academia.edu/Documents/in/Convergence?f_ri=1554856","nofollow":false},{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false},{"id":97644,"name":"Computer Vision and Pattern Recognition","url":"https://www.academia.edu/Documents/in/Computer_Vision_and_Pattern_Recognition?f_ri=1554856"},{"id":121607,"name":"Missing Data","url":"https://www.academia.edu/Documents/in/Missing_Data?f_ri=1554856"},{"id":184711,"name":"Shape","url":"https://www.academia.edu/Documents/in/Shape?f_ri=1554856"},{"id":277066,"name":"Head","url":"https://www.academia.edu/Documents/in/Head?f_ri=1554856"},{"id":1001094,"name":"Material Properties","url":"https://www.academia.edu/Documents/in/Material_Properties?f_ri=1554856"},{"id":1325691,"name":"Nonrigid Registration","url":"https://www.academia.edu/Documents/in/Nonrigid_Registration?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_15918359 coauthored" data-work_id="15918359" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/15918359/New_Stably_Tame_Automorphisms_of_Polynomial_Algebras">New Stably Tame Automorphisms of Polynomial Algebras</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/15918359" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ccdb85c085cf240ea7ec7c8b847cbd52" rel="nofollow" data-download="{"attachment_id":42824049,"asset_id":15918359,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/42824049/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="35154172" href="https://independent.academia.edu/ArnoVanDenEssen">Arno Van Den Essen</a><script data-card-contents-for-user="35154172" type="text/json">{"id":35154172,"first_name":"Arno Van Den","last_name":"Essen","domain_name":"independent","page_name":"ArnoVanDenEssen","display_name":"Arno Van Den Essen","profile_url":"https://independent.academia.edu/ArnoVanDenEssen?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-15918359">+2</span><div class="hidden js-additional-users-15918359"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/VesselinDrensky">Vesselin Drensky</a></span></div><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/DimitreStefanov">Dimitre Stefanov</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-15918359'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-15918359').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_15918359 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="15918359"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 15918359, container: ".js-paper-rank-work_15918359", }); });</script></li><li class="js-percentile-work_15918359 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 15918359; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_15918359"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_15918359 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="15918359"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 15918359; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=15918359]").text(description); $(".js-view-count-work_15918359").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_15918359").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="15918359"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="329" href="https://www.academia.edu/Documents/in/Algebra">Algebra</a>, <script data-card-contents-for-ri="329" type="text/json">{"id":329,"name":"Algebra","url":"https://www.academia.edu/Documents/in/Algebra?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="19997" href="https://www.academia.edu/Documents/in/Pure_Mathematics">Pure Mathematics</a>, <script data-card-contents-for-ri="19997" type="text/json">{"id":19997,"name":"Pure Mathematics","url":"https://www.academia.edu/Documents/in/Pure_Mathematics?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1554856" href="https://www.academia.edu/Documents/in/Affine_Transformation">Affine Transformation</a>, <script data-card-contents-for-ri="1554856" type="text/json">{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1765547" href="https://www.academia.edu/Documents/in/Matrix_Algebra">Matrix Algebra</a><script data-card-contents-for-ri="1765547" type="text/json">{"id":1765547,"name":"Matrix Algebra","url":"https://www.academia.edu/Documents/in/Matrix_Algebra?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=15918359]'), work: {"id":15918359,"title":"New Stably Tame Automorphisms of Polynomial Algebras","created_at":"2015-09-19T22:03:54.410-07:00","url":"https://www.academia.edu/15918359/New_Stably_Tame_Automorphisms_of_Polynomial_Algebras?f_ri=1554856","dom_id":"work_15918359","summary":null,"downloadable_attachments":[{"id":42824049,"asset_id":15918359,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":35154172,"first_name":"Arno Van Den","last_name":"Essen","domain_name":"independent","page_name":"ArnoVanDenEssen","display_name":"Arno Van Den Essen","profile_url":"https://independent.academia.edu/ArnoVanDenEssen?f_ri=1554856","photo":"/images/s65_no_pic.png"},{"id":35077873,"first_name":"Vesselin","last_name":"Drensky","domain_name":"independent","page_name":"VesselinDrensky","display_name":"Vesselin Drensky","profile_url":"https://independent.academia.edu/VesselinDrensky?f_ri=1554856","photo":"/images/s65_no_pic.png"},{"id":35165709,"first_name":"Dimitre","last_name":"Stefanov","domain_name":"independent","page_name":"DimitreStefanov","display_name":"Dimitre Stefanov","profile_url":"https://independent.academia.edu/DimitreStefanov?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":329,"name":"Algebra","url":"https://www.academia.edu/Documents/in/Algebra?f_ri=1554856","nofollow":false},{"id":19997,"name":"Pure Mathematics","url":"https://www.academia.edu/Documents/in/Pure_Mathematics?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false},{"id":1765547,"name":"Matrix Algebra","url":"https://www.academia.edu/Documents/in/Matrix_Algebra?f_ri=1554856","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_33569775" data-work_id="33569775" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/33569775/Linear_homotopy_solution_of_nonlinear_systems_of_equations_in_geodesy">Linear homotopy solution of nonlinear systems of equations in geodesy</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/33569775" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="20adaf86a46e70efc34ae252963d8474" rel="nofollow" data-download="{"attachment_id":53594447,"asset_id":33569775,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/53594447/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="65717195" href="https://independent.academia.edu/BPalancz">B. Palancz</a><script data-card-contents-for-user="65717195" type="text/json">{"id":65717195,"first_name":"B.","last_name":"Palancz","domain_name":"independent","page_name":"BPalancz","display_name":"B. Palancz","profile_url":"https://independent.academia.edu/BPalancz?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_33569775 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="33569775"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 33569775, container: ".js-paper-rank-work_33569775", }); });</script></li><li class="js-percentile-work_33569775 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 33569775; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_33569775"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_33569775 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="33569775"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 33569775; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=33569775]").text(description); $(".js-view-count-work_33569775").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_33569775").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="33569775"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">13</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="305" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="404" href="https://www.academia.edu/Documents/in/Geodesy">Geodesy</a>, <script data-card-contents-for-ri="404" type="text/json">{"id":404,"name":"Geodesy","url":"https://www.academia.edu/Documents/in/Geodesy?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="409" href="https://www.academia.edu/Documents/in/Geophysics">Geophysics</a>, <script data-card-contents-for-ri="409" type="text/json">{"id":409,"name":"Geophysics","url":"https://www.academia.edu/Documents/in/Geophysics?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="70448" href="https://www.academia.edu/Documents/in/Fortran">Fortran</a><script data-card-contents-for-ri="70448" type="text/json">{"id":70448,"name":"Fortran","url":"https://www.academia.edu/Documents/in/Fortran?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=33569775]'), work: {"id":33569775,"title":"Linear homotopy solution of nonlinear systems of equations in geodesy","created_at":"2017-06-20T06:34:40.817-07:00","url":"https://www.academia.edu/33569775/Linear_homotopy_solution_of_nonlinear_systems_of_equations_in_geodesy?f_ri=1554856","dom_id":"work_33569775","summary":null,"downloadable_attachments":[{"id":53594447,"asset_id":33569775,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":65717195,"first_name":"B.","last_name":"Palancz","domain_name":"independent","page_name":"BPalancz","display_name":"B. Palancz","profile_url":"https://independent.academia.edu/BPalancz?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=1554856","nofollow":false},{"id":404,"name":"Geodesy","url":"https://www.academia.edu/Documents/in/Geodesy?f_ri=1554856","nofollow":false},{"id":409,"name":"Geophysics","url":"https://www.academia.edu/Documents/in/Geophysics?f_ri=1554856","nofollow":false},{"id":70448,"name":"Fortran","url":"https://www.academia.edu/Documents/in/Fortran?f_ri=1554856","nofollow":false},{"id":98610,"name":"Maple Computer Algebra System","url":"https://www.academia.edu/Documents/in/Maple_Computer_Algebra_System?f_ri=1554856"},{"id":162010,"name":"Geomatic Engineering","url":"https://www.academia.edu/Documents/in/Geomatic_Engineering?f_ri=1554856"},{"id":171869,"name":"HOMOTOPY","url":"https://www.academia.edu/Documents/in/HOMOTOPY?f_ri=1554856"},{"id":204188,"name":"Homotopy Analysis Method","url":"https://www.academia.edu/Documents/in/Homotopy_Analysis_Method?f_ri=1554856"},{"id":506858,"name":"Nonlinear system","url":"https://www.academia.edu/Documents/in/Nonlinear_system?f_ri=1554856"},{"id":525236,"name":"Multivariate Tutte polynomial","url":"https://www.academia.edu/Documents/in/Multivariate_Tutte_polynomial?f_ri=1554856"},{"id":551418,"name":"Newton-Raphson algorithm","url":"https://www.academia.edu/Documents/in/Newton-Raphson_algorithm?f_ri=1554856"},{"id":1518799,"name":"Resection","url":"https://www.academia.edu/Documents/in/Resection?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_16119304 coauthored" data-work_id="16119304" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/16119304/Mesh_Topological_Optimization_for_Improving_Piecewise_Linear_Image_Registration">Mesh Topological Optimization for Improving Piecewise-Linear Image Registration</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This paper presents a mutual-information based optimization algorithm for improving piecewise-linear (PWL) image registration. PWL-registration techniques, which are well-suited for registering images of the same scene with relative local... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_16119304" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This paper presents a mutual-information based optimization algorithm for improving piecewise-linear (PWL) image registration. PWL-registration techniques, which are well-suited for registering images of the same scene with relative local distortions, divide the images in conjugate triangular patches that are individually mapped through affine transformations. For this process to be accurate, each pair of corresponding image triangles must be the projections of a planar surface in space; otherwise, the registration incurs in errors that appear in the resultant registered image as local distortions (distorted shapes, broken lines, etc.). Given an initial triangular mesh onto the images, we propose an optimization algorithm that, by swapping edges, modifies the mesh topology looking for an improvement in the registration. For detecting the edges to be swapped we employ a cost function based on the mutual information (MI), a metric for registration consistency more robust to image radi...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/16119304" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b894e2671c8e36cf6adc129d61039af9" rel="nofollow" data-download="{"attachment_id":41211247,"asset_id":16119304,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41211247/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="35288439" href="https://uma.academia.edu/varevalo">Vicente Arevalo-Espejo</a><script data-card-contents-for-user="35288439" type="text/json">{"id":35288439,"first_name":"Vicente","last_name":"Arevalo-Espejo","domain_name":"uma","page_name":"varevalo","display_name":"Vicente Arevalo-Espejo","profile_url":"https://uma.academia.edu/varevalo?f_ri=1554856","photo":"https://0.academia-photos.com/35288439/10668348/11909713/s65_vicente.arevalo.jpg"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-16119304">+1</span><div class="hidden js-additional-users-16119304"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://uma.academia.edu/JavierGonzalezJimenez">Javier Gonzalez-Jimenez</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-16119304'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-16119304').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_16119304 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="16119304"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 16119304, container: ".js-paper-rank-work_16119304", }); });</script></li><li class="js-percentile-work_16119304 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 16119304; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_16119304"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_16119304 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="16119304"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 16119304; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=16119304]").text(description); $(".js-view-count-work_16119304").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_16119304").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="16119304"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="305" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="29731" href="https://www.academia.edu/Documents/in/Image_Registration">Image Registration</a>, <script data-card-contents-for-ri="29731" type="text/json">{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="132593" href="https://www.academia.edu/Documents/in/Piecewise_Linear">Piecewise Linear</a>, <script data-card-contents-for-ri="132593" type="text/json">{"id":132593,"name":"Piecewise Linear","url":"https://www.academia.edu/Documents/in/Piecewise_Linear?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="164706" href="https://www.academia.edu/Documents/in/Mutual_Information">Mutual Information</a><script data-card-contents-for-ri="164706" type="text/json">{"id":164706,"name":"Mutual Information","url":"https://www.academia.edu/Documents/in/Mutual_Information?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=16119304]'), work: {"id":16119304,"title":"Mesh Topological Optimization for Improving Piecewise-Linear Image Registration","created_at":"2015-09-24T02:47:53.078-07:00","url":"https://www.academia.edu/16119304/Mesh_Topological_Optimization_for_Improving_Piecewise_Linear_Image_Registration?f_ri=1554856","dom_id":"work_16119304","summary":"This paper presents a mutual-information based optimization algorithm for improving piecewise-linear (PWL) image registration. PWL-registration techniques, which are well-suited for registering images of the same scene with relative local distortions, divide the images in conjugate triangular patches that are individually mapped through affine transformations. For this process to be accurate, each pair of corresponding image triangles must be the projections of a planar surface in space; otherwise, the registration incurs in errors that appear in the resultant registered image as local distortions (distorted shapes, broken lines, etc.). Given an initial triangular mesh onto the images, we propose an optimization algorithm that, by swapping edges, modifies the mesh topology looking for an improvement in the registration. For detecting the edges to be swapped we employ a cost function based on the mutual information (MI), a metric for registration consistency more robust to image radi...","downloadable_attachments":[{"id":41211247,"asset_id":16119304,"asset_type":"Work","always_allow_download":false},{"id":41211225,"asset_id":16119304,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":35288439,"first_name":"Vicente","last_name":"Arevalo-Espejo","domain_name":"uma","page_name":"varevalo","display_name":"Vicente Arevalo-Espejo","profile_url":"https://uma.academia.edu/varevalo?f_ri=1554856","photo":"https://0.academia-photos.com/35288439/10668348/11909713/s65_vicente.arevalo.jpg"},{"id":35235210,"first_name":"Javier","last_name":"Gonzalez-Jimenez","domain_name":"uma","page_name":"JavierGonzalezJimenez","display_name":"Javier Gonzalez-Jimenez","profile_url":"https://uma.academia.edu/JavierGonzalezJimenez?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=1554856","nofollow":false},{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false},{"id":132593,"name":"Piecewise Linear","url":"https://www.academia.edu/Documents/in/Piecewise_Linear?f_ri=1554856","nofollow":false},{"id":164706,"name":"Mutual Information","url":"https://www.academia.edu/Documents/in/Mutual_Information?f_ri=1554856","nofollow":false},{"id":1003508,"name":"Cost Function","url":"https://www.academia.edu/Documents/in/Cost_Function?f_ri=1554856"},{"id":1281402,"name":"Normalized Cross Correlation","url":"https://www.academia.edu/Documents/in/Normalized_Cross_Correlation?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_9468913" data-work_id="9468913" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/9468913/%D0%9A%D0%BE%D0%BC%D0%B1%D0%B8%D0%BD%D0%B0%D1%82%D0%BE%D1%80%D0%B8%D0%BA%D0%B0_%D1%8D%D0%BA%D0%B2%D0%B8%D0%B0%D1%84%D1%84%D0%B8%D0%BD%D0%BD%D1%8B%D1%85_%D1%81%D0%BB%D0%BE%D0%B2_%D0%B4%D0%BB%D1%8F_%D0%BF%D1%80%D0%BE%D0%B5%D0%BA%D1%82%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D1%8F_%D0%BB%D0%B5%D0%BA%D1%81%D0%B8%D0%BA%D0%BE%D0%B3%D1%80%D0%B0%D1%84%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%B8%D1%85_%D0%BA%D0%BE%D0%B4%D0%BE%D0%B2_%D1%80%D0%B0%D1%81%D1%88%D0%B8%D1%80%D0%B5%D0%BD%D0%BD%D0%BE%D0%B9_%D1%80%D0%B5%D0%B0%D0%BB%D1%8C%D0%BD%D0%BE%D1%81%D1%82%D0%B8">Комбинаторика эквиаффинных слов для проектирования лексикографических кодов расширенной реальности</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">В статье рассматривается задача построения математического описания лексикографических кодов для расширенной реальности. Найдена формальная система проектирования кодов для надёжного и устойчивого распознавания зрительных образов. Для... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_9468913" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">В статье рассматривается задача построения математического описания лексикографических кодов для расширенной реальности. Найдена формальная система проектирования кодов для надёжного и устойчивого распознавания зрительных образов. Для построения книги кодов использован классический метод комбинаторики слов.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/9468913" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="aef63737a9a38d525a5087f3f5d8fca0" rel="nofollow" data-download="{"attachment_id":35703470,"asset_id":9468913,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/35703470/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4357340" href="https://donntu.academia.edu/%D0%93%D1%83%D0%B4%D0%B0%D0%B5%D0%B2%D0%9E%D0%BB%D0%B5%D0%B3">Гудаев Олег</a><script data-card-contents-for-user="4357340" type="text/json">{"id":4357340,"first_name":"Гудаев","last_name":"Олег","domain_name":"donntu","page_name":"ГудаевОлег","display_name":"Гудаев Олег","profile_url":"https://donntu.academia.edu/%D0%93%D1%83%D0%B4%D0%B0%D0%B5%D0%B2%D0%9E%D0%BB%D0%B5%D0%B3?f_ri=1554856","photo":"https://0.academia-photos.com/4357340/1756086/2099501/s65__._.jpg"}</script></span></span></li><li class="js-paper-rank-work_9468913 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="9468913"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 9468913, container: ".js-paper-rank-work_9468913", }); });</script></li><li class="js-percentile-work_9468913 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 9468913; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_9468913"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_9468913 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="9468913"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 9468913; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=9468913]").text(description); $(".js-view-count-work_9468913").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_9468913").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="9468913"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="854" href="https://www.academia.edu/Documents/in/Computer_Vision">Computer Vision</a>, <script data-card-contents-for-ri="854" type="text/json">{"id":854,"name":"Computer Vision","url":"https://www.academia.edu/Documents/in/Computer_Vision?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3155" href="https://www.academia.edu/Documents/in/Complexity_Theory">Complexity Theory</a>, <script data-card-contents-for-ri="3155" type="text/json">{"id":3155,"name":"Complexity Theory","url":"https://www.academia.edu/Documents/in/Complexity_Theory?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5673" href="https://www.academia.edu/Documents/in/Augmented_Reality">Augmented Reality</a>, <script data-card-contents-for-ri="5673" type="text/json">{"id":5673,"name":"Augmented Reality","url":"https://www.academia.edu/Documents/in/Augmented_Reality?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="69709" href="https://www.academia.edu/Documents/in/Combinatorics_on_Words">Combinatorics on Words</a><script data-card-contents-for-ri="69709" type="text/json">{"id":69709,"name":"Combinatorics on Words","url":"https://www.academia.edu/Documents/in/Combinatorics_on_Words?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=9468913]'), work: {"id":9468913,"title":"Комбинаторика эквиаффинных слов для проектирования лексикографических кодов расширенной реальности","created_at":"2014-11-23T22:55:09.867-08:00","url":"https://www.academia.edu/9468913/%D0%9A%D0%BE%D0%BC%D0%B1%D0%B8%D0%BD%D0%B0%D1%82%D0%BE%D1%80%D0%B8%D0%BA%D0%B0_%D1%8D%D0%BA%D0%B2%D0%B8%D0%B0%D1%84%D1%84%D0%B8%D0%BD%D0%BD%D1%8B%D1%85_%D1%81%D0%BB%D0%BE%D0%B2_%D0%B4%D0%BB%D1%8F_%D0%BF%D1%80%D0%BE%D0%B5%D0%BA%D1%82%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D1%8F_%D0%BB%D0%B5%D0%BA%D1%81%D0%B8%D0%BA%D0%BE%D0%B3%D1%80%D0%B0%D1%84%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%B8%D1%85_%D0%BA%D0%BE%D0%B4%D0%BE%D0%B2_%D1%80%D0%B0%D1%81%D1%88%D0%B8%D1%80%D0%B5%D0%BD%D0%BD%D0%BE%D0%B9_%D1%80%D0%B5%D0%B0%D0%BB%D1%8C%D0%BD%D0%BE%D1%81%D1%82%D0%B8?f_ri=1554856","dom_id":"work_9468913","summary":"В статье рассматривается задача построения математического описания лексикографических кодов для расширенной реальности. Найдена формальная система проектирования кодов для надёжного и устойчивого распознавания зрительных образов. Для построения книги кодов использован классический метод комбинаторики слов.","downloadable_attachments":[{"id":35703470,"asset_id":9468913,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4357340,"first_name":"Гудаев","last_name":"Олег","domain_name":"donntu","page_name":"ГудаевОлег","display_name":"Гудаев Олег","profile_url":"https://donntu.academia.edu/%D0%93%D1%83%D0%B4%D0%B0%D0%B5%D0%B2%D0%9E%D0%BB%D0%B5%D0%B3?f_ri=1554856","photo":"https://0.academia-photos.com/4357340/1756086/2099501/s65__._.jpg"}],"research_interests":[{"id":854,"name":"Computer Vision","url":"https://www.academia.edu/Documents/in/Computer_Vision?f_ri=1554856","nofollow":false},{"id":3155,"name":"Complexity Theory","url":"https://www.academia.edu/Documents/in/Complexity_Theory?f_ri=1554856","nofollow":false},{"id":5673,"name":"Augmented Reality","url":"https://www.academia.edu/Documents/in/Augmented_Reality?f_ri=1554856","nofollow":false},{"id":69709,"name":"Combinatorics on Words","url":"https://www.academia.edu/Documents/in/Combinatorics_on_Words?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1685337,"name":"Monolithic","url":"https://www.academia.edu/Documents/in/Monolithic?f_ri=1554856"},{"id":1685338,"name":"Population Count","url":"https://www.academia.edu/Documents/in/Population_Count?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3150707" data-work_id="3150707" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3150707/Computational_Study_of_3D_Affine_Coordinate_Transformation_Part_I_3_point_Problem">Computational Study of 3D Affine Coordinate Transformation Part I. 3-point Problem</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3150707" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d82e5702ac6c253bee174f8eb60bdd6b" rel="nofollow" data-download="{"attachment_id":31055426,"asset_id":3150707,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31055426/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3602737" href="https://curtin.academia.edu/JosephAwange">Professor Joseph L Awange</a><script data-card-contents-for-user="3602737" type="text/json">{"id":3602737,"first_name":"Professor Joseph","last_name":"Awange","domain_name":"curtin","page_name":"JosephAwange","display_name":"Professor Joseph L Awange","profile_url":"https://curtin.academia.edu/JosephAwange?f_ri=1554856","photo":"https://0.academia-photos.com/3602737/1256971/7272369/s65_joseph.awange.jpg"}</script></span></span></li><li class="js-paper-rank-work_3150707 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3150707"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3150707, container: ".js-paper-rank-work_3150707", }); });</script></li><li class="js-percentile-work_3150707 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3150707; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3150707"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3150707 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3150707"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3150707; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3150707]").text(description); $(".js-view-count-work_3150707").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3150707").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3150707"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a>, <script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="32149" href="https://www.academia.edu/Documents/in/Numerical_Method">Numerical Method</a>, <script data-card-contents-for-ri="32149" type="text/json">{"id":32149,"name":"Numerical Method","url":"https://www.academia.edu/Documents/in/Numerical_Method?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="39920" href="https://www.academia.edu/Documents/in/Parameter_estimation">Parameter estimation</a>, <script data-card-contents-for-ri="39920" type="text/json">{"id":39920,"name":"Parameter estimation","url":"https://www.academia.edu/Documents/in/Parameter_estimation?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="201678" href="https://www.academia.edu/Documents/in/Computer_Algebra">Computer Algebra</a><script data-card-contents-for-ri="201678" type="text/json">{"id":201678,"name":"Computer Algebra","url":"https://www.academia.edu/Documents/in/Computer_Algebra?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3150707]'), work: {"id":3150707,"title":"Computational Study of 3D Affine Coordinate Transformation Part I. 3-point Problem","created_at":"2013-03-28T21:39:36.947-07:00","url":"https://www.academia.edu/3150707/Computational_Study_of_3D_Affine_Coordinate_Transformation_Part_I_3_point_Problem?f_ri=1554856","dom_id":"work_3150707","summary":null,"downloadable_attachments":[{"id":31055426,"asset_id":3150707,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3602737,"first_name":"Professor Joseph","last_name":"Awange","domain_name":"curtin","page_name":"JosephAwange","display_name":"Professor Joseph L Awange","profile_url":"https://curtin.academia.edu/JosephAwange?f_ri=1554856","photo":"https://0.academia-photos.com/3602737/1256971/7272369/s65_joseph.awange.jpg"}],"research_interests":[{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=1554856","nofollow":false},{"id":32149,"name":"Numerical Method","url":"https://www.academia.edu/Documents/in/Numerical_Method?f_ri=1554856","nofollow":false},{"id":39920,"name":"Parameter estimation","url":"https://www.academia.edu/Documents/in/Parameter_estimation?f_ri=1554856","nofollow":false},{"id":201678,"name":"Computer Algebra","url":"https://www.academia.edu/Documents/in/Computer_Algebra?f_ri=1554856","nofollow":false},{"id":1450019,"name":"Grobner Basis","url":"https://www.academia.edu/Documents/in/Grobner_Basis?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_5251338" data-work_id="5251338" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/5251338/Partial_PCA_in_frequency_domain">Partial PCA in frequency domain</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/5251338" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b2a7a7fb50c91ca51a30405835cec1e2" rel="nofollow" data-download="{"attachment_id":32432914,"asset_id":5251338,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/32432914/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="7188687" href="https://independent.academia.edu/FrancescTarres">Francesc Tarres</a><script data-card-contents-for-user="7188687" type="text/json">{"id":7188687,"first_name":"Francesc","last_name":"Tarres","domain_name":"independent","page_name":"FrancescTarres","display_name":"Francesc Tarres","profile_url":"https://independent.academia.edu/FrancescTarres?f_ri=1554856","photo":"https://0.academia-photos.com/7188687/11659602/13000692/s65_francesc.tarres.jpg"}</script></span></span></li><li class="js-paper-rank-work_5251338 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="5251338"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 5251338, container: ".js-paper-rank-work_5251338", }); });</script></li><li class="js-percentile-work_5251338 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 5251338; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_5251338"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_5251338 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="5251338"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 5251338; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=5251338]").text(description); $(".js-view-count-work_5251338").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_5251338").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="5251338"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="5069" href="https://www.academia.edu/Documents/in/Principal_Component_Analysis">Principal Component Analysis</a>, <script data-card-contents-for-ri="5069" type="text/json">{"id":5069,"name":"Principal Component Analysis","url":"https://www.academia.edu/Documents/in/Principal_Component_Analysis?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5110" href="https://www.academia.edu/Documents/in/Face_Recognition">Face Recognition</a>, <script data-card-contents-for-ri="5110" type="text/json">{"id":5110,"name":"Face Recognition","url":"https://www.academia.edu/Documents/in/Face_Recognition?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="119714" href="https://www.academia.edu/Documents/in/Facial_Features">Facial Features</a>, <script data-card-contents-for-ri="119714" type="text/json">{"id":119714,"name":"Facial Features","url":"https://www.academia.edu/Documents/in/Facial_Features?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="310719" href="https://www.academia.edu/Documents/in/Local_Alignment">Local Alignment</a><script data-card-contents-for-ri="310719" type="text/json">{"id":310719,"name":"Local Alignment","url":"https://www.academia.edu/Documents/in/Local_Alignment?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=5251338]'), work: {"id":5251338,"title":"Partial PCA in frequency domain","created_at":"2013-11-28T03:43:48.252-08:00","url":"https://www.academia.edu/5251338/Partial_PCA_in_frequency_domain?f_ri=1554856","dom_id":"work_5251338","summary":null,"downloadable_attachments":[{"id":32432914,"asset_id":5251338,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":7188687,"first_name":"Francesc","last_name":"Tarres","domain_name":"independent","page_name":"FrancescTarres","display_name":"Francesc Tarres","profile_url":"https://independent.academia.edu/FrancescTarres?f_ri=1554856","photo":"https://0.academia-photos.com/7188687/11659602/13000692/s65_francesc.tarres.jpg"}],"research_interests":[{"id":5069,"name":"Principal Component Analysis","url":"https://www.academia.edu/Documents/in/Principal_Component_Analysis?f_ri=1554856","nofollow":false},{"id":5110,"name":"Face Recognition","url":"https://www.academia.edu/Documents/in/Face_Recognition?f_ri=1554856","nofollow":false},{"id":119714,"name":"Facial Features","url":"https://www.academia.edu/Documents/in/Facial_Features?f_ri=1554856","nofollow":false},{"id":310719,"name":"Local Alignment","url":"https://www.academia.edu/Documents/in/Local_Alignment?f_ri=1554856","nofollow":false},{"id":885300,"name":"Eigenvectors","url":"https://www.academia.edu/Documents/in/Eigenvectors?f_ri=1554856"},{"id":1281402,"name":"Normalized Cross Correlation","url":"https://www.academia.edu/Documents/in/Normalized_Cross_Correlation?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1625072,"name":"Frequency Domain","url":"https://www.academia.edu/Documents/in/Frequency_Domain?f_ri=1554856"},{"id":1752153,"name":"Texture Mapping","url":"https://www.academia.edu/Documents/in/Texture_Mapping?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_7693057" data-work_id="7693057" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/7693057/Generation_of_3D_fractal_images_for_Mandelbrot_set">Generation of 3D fractal images for Mandelbrot set</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/7693057" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="31c4b1a53d1f7b3843af018d0e6db206" rel="nofollow" data-download="{"attachment_id":48369575,"asset_id":7693057,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48369575/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="14015944" href="https://jntu.academia.edu/BulusuRama">Bulusu Rama</a><script data-card-contents-for-user="14015944" type="text/json">{"id":14015944,"first_name":"Bulusu","last_name":"Rama","domain_name":"jntu","page_name":"BulusuRama","display_name":"Bulusu Rama","profile_url":"https://jntu.academia.edu/BulusuRama?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_7693057 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="7693057"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 7693057, container: ".js-paper-rank-work_7693057", }); });</script></li><li class="js-percentile-work_7693057 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 7693057; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_7693057"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_7693057 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="7693057"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 7693057; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=7693057]").text(description); $(".js-view-count-work_7693057").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_7693057").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="7693057"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="317" href="https://www.academia.edu/Documents/in/Fractal_Geometry">Fractal Geometry</a>, <script data-card-contents-for-ri="317" type="text/json">{"id":317,"name":"Fractal Geometry","url":"https://www.academia.edu/Documents/in/Fractal_Geometry?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="24831" href="https://www.academia.edu/Documents/in/Fractals">Fractals</a>, <script data-card-contents-for-ri="24831" type="text/json">{"id":24831,"name":"Fractals","url":"https://www.academia.edu/Documents/in/Fractals?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="56565" href="https://www.academia.edu/Documents/in/Image_compression">Image compression</a>, <script data-card-contents-for-ri="56565" type="text/json">{"id":56565,"name":"Image compression","url":"https://www.academia.edu/Documents/in/Image_compression?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="74754" href="https://www.academia.edu/Documents/in/3-D_Imaging">3-D Imaging</a><script data-card-contents-for-ri="74754" type="text/json">{"id":74754,"name":"3-D Imaging","url":"https://www.academia.edu/Documents/in/3-D_Imaging?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=7693057]'), work: {"id":7693057,"title":"Generation of 3D fractal images for Mandelbrot set","created_at":"2014-07-17T00:29:10.516-07:00","url":"https://www.academia.edu/7693057/Generation_of_3D_fractal_images_for_Mandelbrot_set?f_ri=1554856","dom_id":"work_7693057","summary":null,"downloadable_attachments":[{"id":48369575,"asset_id":7693057,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":14015944,"first_name":"Bulusu","last_name":"Rama","domain_name":"jntu","page_name":"BulusuRama","display_name":"Bulusu Rama","profile_url":"https://jntu.academia.edu/BulusuRama?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":317,"name":"Fractal Geometry","url":"https://www.academia.edu/Documents/in/Fractal_Geometry?f_ri=1554856","nofollow":false},{"id":24831,"name":"Fractals","url":"https://www.academia.edu/Documents/in/Fractals?f_ri=1554856","nofollow":false},{"id":56565,"name":"Image compression","url":"https://www.academia.edu/Documents/in/Image_compression?f_ri=1554856","nofollow":false},{"id":74754,"name":"3-D Imaging","url":"https://www.academia.edu/Documents/in/3-D_Imaging?f_ri=1554856","nofollow":false},{"id":117470,"name":"Mandelbrot Set","url":"https://www.academia.edu/Documents/in/Mandelbrot_Set?f_ri=1554856"},{"id":152778,"name":"Recursion","url":"https://www.academia.edu/Documents/in/Recursion?f_ri=1554856"},{"id":321836,"name":"Spectrum","url":"https://www.academia.edu/Documents/in/Spectrum?f_ri=1554856"},{"id":1432574,"name":"Scale Invariance","url":"https://www.academia.edu/Documents/in/Scale_Invariance?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_16015968 coauthored" data-work_id="16015968" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/16015968/Automatic_fish_classification_for_underwater_species_behavior_understanding">Automatic fish classification for underwater species behavior understanding</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/16015968" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="afd24894acc514d83a04368e684b0780" rel="nofollow" data-download="{"attachment_id":42784373,"asset_id":16015968,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/42784373/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="35159157" href="https://unict.academia.edu/RobertoDiSalvo">Roberto Di Salvo</a><script data-card-contents-for-user="35159157" type="text/json">{"id":35159157,"first_name":"Roberto","last_name":"Di Salvo","domain_name":"unict","page_name":"RobertoDiSalvo","display_name":"Roberto Di Salvo","profile_url":"https://unict.academia.edu/RobertoDiSalvo?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-16015968">+1</span><div class="hidden js-additional-users-16015968"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://hw.academia.edu/YunhehChenburger">Yun-heh Chen-burger</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-16015968'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-16015968').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_16015968 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="16015968"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 16015968, container: ".js-paper-rank-work_16015968", }); });</script></li><li class="js-percentile-work_16015968 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 16015968; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_16015968"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_16015968 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="16015968"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 16015968; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=16015968]").text(description); $(".js-view-count-work_16015968").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_16015968").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="16015968"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="160144" href="https://www.academia.edu/Documents/in/Feature_Extraction">Feature Extraction</a>, <script data-card-contents-for-ri="160144" type="text/json">{"id":160144,"name":"Feature Extraction","url":"https://www.academia.edu/Documents/in/Feature_Extraction?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="464260" href="https://www.academia.edu/Documents/in/Gray_Level_Co-occurrence_Matrix">Gray Level Co-occurrence Matrix</a>, <script data-card-contents-for-ri="464260" type="text/json">{"id":464260,"name":"Gray Level Co-occurrence Matrix","url":"https://www.academia.edu/Documents/in/Gray_Level_Co-occurrence_Matrix?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="878219" href="https://www.academia.edu/Documents/in/Texture_Features">Texture Features</a>, <script data-card-contents-for-ri="878219" type="text/json">{"id":878219,"name":"Texture Features","url":"https://www.academia.edu/Documents/in/Texture_Features?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="917523" href="https://www.academia.edu/Documents/in/Species_Description">Species Description</a><script data-card-contents-for-ri="917523" type="text/json">{"id":917523,"name":"Species Description","url":"https://www.academia.edu/Documents/in/Species_Description?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=16015968]'), work: {"id":16015968,"title":"Automatic fish classification for underwater species behavior understanding","created_at":"2015-09-22T02:33:11.514-07:00","url":"https://www.academia.edu/16015968/Automatic_fish_classification_for_underwater_species_behavior_understanding?f_ri=1554856","dom_id":"work_16015968","summary":null,"downloadable_attachments":[{"id":42784373,"asset_id":16015968,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":35159157,"first_name":"Roberto","last_name":"Di Salvo","domain_name":"unict","page_name":"RobertoDiSalvo","display_name":"Roberto Di Salvo","profile_url":"https://unict.academia.edu/RobertoDiSalvo?f_ri=1554856","photo":"/images/s65_no_pic.png"},{"id":35423873,"first_name":"Yun-heh","last_name":"Chen-burger","domain_name":"hw","page_name":"YunhehChenburger","display_name":"Yun-heh Chen-burger","profile_url":"https://hw.academia.edu/YunhehChenburger?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":160144,"name":"Feature Extraction","url":"https://www.academia.edu/Documents/in/Feature_Extraction?f_ri=1554856","nofollow":false},{"id":464260,"name":"Gray Level Co-occurrence Matrix","url":"https://www.academia.edu/Documents/in/Gray_Level_Co-occurrence_Matrix?f_ri=1554856","nofollow":false},{"id":878219,"name":"Texture Features","url":"https://www.academia.edu/Documents/in/Texture_Features?f_ri=1554856","nofollow":false},{"id":917523,"name":"Species Description","url":"https://www.academia.edu/Documents/in/Species_Description?f_ri=1554856","nofollow":false},{"id":1010802,"name":"Curvature Scale Space","url":"https://www.academia.edu/Documents/in/Curvature_Scale_Space?f_ri=1554856"},{"id":1269419,"name":"Multiple Views","url":"https://www.academia.edu/Documents/in/Multiple_Views?f_ri=1554856"},{"id":1407513,"name":"Fourier Descriptors","url":"https://www.academia.edu/Documents/in/Fourier_Descriptors?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1569002,"name":"Gabor Filter","url":"https://www.academia.edu/Documents/in/Gabor_Filter?f_ri=1554856"},{"id":1815859,"name":"Tracking system","url":"https://www.academia.edu/Documents/in/Tracking_system?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_81432113 coauthored" data-work_id="81432113" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/81432113/An_architectural_framework_for_automatic_detection_of_autism_using_deep_convolution_networks_and_genetic_algorithm">An architectural framework for automatic detection of autism using deep convolution networks and genetic algorithm</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The brainchild in any medical image processing lied in how accurately the diseases are diagnosed. Especially in the case of neural disorders such as autism spectrum disorder (ASD), accurate detection was still a challenge. Several... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_81432113" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The brainchild in any medical image processing lied in how accurately the diseases are diagnosed. Especially in the case of neural disorders such as autism spectrum disorder (ASD), accurate detection was still a challenge. Several noninvasive neuroimaging techniques provided experts information about the functionality and anatomical structure of the brain. As autism is a neural disorder, magnetic resonance imaging (MRI) of the brain gave a complex structure and functionality. Many machine learning techniques were proposed to improve the classification and detection accuracy of autism in MRI images. Our work focused mainly on developing the architecture of convolution neural networks (CNN) combining the genetic algorithm. Such artificial intelligence (AI) techniques were very much needed for training as they gave better accuracy compared to traditional statistical methods.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/81432113" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ffb686cba67fd4a60469e68bfc461d2c" rel="nofollow" data-download="{"attachment_id":87477437,"asset_id":81432113,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/87477437/download_file?st=MTczMzI2MzE2Miw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="163474776" href="https://independent.academia.edu/JournalIJECE">International Journal of Electrical and Computer Engineering (IJECE)</a><script data-card-contents-for-user="163474776" type="text/json">{"id":163474776,"first_name":"International Journal of Electrical and Computer Engineering","last_name":"(IJECE)","domain_name":"independent","page_name":"JournalIJECE","display_name":"International Journal of Electrical and Computer Engineering (IJECE)","profile_url":"https://independent.academia.edu/JournalIJECE?f_ri=1554856","photo":"https://0.academia-photos.com/163474776/123357473/112705609/s65_international_journal_of_electrical_and_computer_engineering._ijece_.jpg"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-81432113">+1</span><div class="hidden js-additional-users-81432113"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://vtu.academia.edu/NagashreeMallikarjun">Nagashree Mallikarjun</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-81432113'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-81432113').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_81432113 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="81432113"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 81432113, container: ".js-paper-rank-work_81432113", }); });</script></li><li class="js-percentile-work_81432113 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 81432113; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_81432113"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_81432113 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="81432113"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 81432113; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=81432113]").text(description); $(".js-view-count-work_81432113").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_81432113").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="81432113"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">18</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="491" href="https://www.academia.edu/Documents/in/Information_Technology">Information Technology</a>, <script data-card-contents-for-ri="491" type="text/json">{"id":491,"name":"Information Technology","url":"https://www.academia.edu/Documents/in/Information_Technology?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="923" href="https://www.academia.edu/Documents/in/Technology">Technology</a>, <script data-card-contents-for-ri="923" type="text/json">{"id":923,"name":"Technology","url":"https://www.academia.edu/Documents/in/Technology?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="4202" href="https://www.academia.edu/Documents/in/Control_Engineering">Control Engineering</a><script data-card-contents-for-ri="4202" type="text/json">{"id":4202,"name":"Control Engineering","url":"https://www.academia.edu/Documents/in/Control_Engineering?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=81432113]'), work: {"id":81432113,"title":"An architectural framework for automatic detection of autism using deep convolution networks and genetic algorithm","created_at":"2022-06-13T20:37:51.220-07:00","url":"https://www.academia.edu/81432113/An_architectural_framework_for_automatic_detection_of_autism_using_deep_convolution_networks_and_genetic_algorithm?f_ri=1554856","dom_id":"work_81432113","summary":"The brainchild in any medical image processing lied in how accurately the diseases are diagnosed. Especially in the case of neural disorders such as autism spectrum disorder (ASD), accurate detection was still a challenge. Several noninvasive neuroimaging techniques provided experts information about the functionality and anatomical structure of the brain. As autism is a neural disorder, magnetic resonance imaging (MRI) of the brain gave a complex structure and functionality. Many machine learning techniques were proposed to improve the classification and detection accuracy of autism in MRI images. Our work focused mainly on developing the architecture of convolution neural networks (CNN) combining the genetic algorithm. Such artificial intelligence (AI) techniques were very much needed for training as they gave better accuracy compared to traditional statistical methods.","downloadable_attachments":[{"id":87477437,"asset_id":81432113,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":163474776,"first_name":"International Journal of Electrical and Computer Engineering","last_name":"(IJECE)","domain_name":"independent","page_name":"JournalIJECE","display_name":"International Journal of Electrical and Computer Engineering (IJECE)","profile_url":"https://independent.academia.edu/JournalIJECE?f_ri=1554856","photo":"https://0.academia-photos.com/163474776/123357473/112705609/s65_international_journal_of_electrical_and_computer_engineering._ijece_.jpg"},{"id":130614215,"first_name":"Nagashree","last_name":"Mallikarjun","domain_name":"vtu","page_name":"NagashreeMallikarjun","display_name":"Nagashree Mallikarjun","profile_url":"https://vtu.academia.edu/NagashreeMallikarjun?f_ri=1554856","photo":"https://0.academia-photos.com/130614215/70209689/58623342/s65_nagashree.mallikarjun.jpeg"}],"research_interests":[{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=1554856","nofollow":false},{"id":491,"name":"Information Technology","url":"https://www.academia.edu/Documents/in/Information_Technology?f_ri=1554856","nofollow":false},{"id":923,"name":"Technology","url":"https://www.academia.edu/Documents/in/Technology?f_ri=1554856","nofollow":false},{"id":4202,"name":"Control Engineering","url":"https://www.academia.edu/Documents/in/Control_Engineering?f_ri=1554856","nofollow":false},{"id":4758,"name":"Electronics","url":"https://www.academia.edu/Documents/in/Electronics?f_ri=1554856"},{"id":6132,"name":"Soft Computing","url":"https://www.academia.edu/Documents/in/Soft_Computing?f_ri=1554856"},{"id":6200,"name":"Magnetic Resonance Imaging","url":"https://www.academia.edu/Documents/in/Magnetic_Resonance_Imaging?f_ri=1554856"},{"id":14725,"name":"Internet of Things","url":"https://www.academia.edu/Documents/in/Internet_of_Things?f_ri=1554856"},{"id":15665,"name":"Video Processing","url":"https://www.academia.edu/Documents/in/Video_Processing?f_ri=1554856"},{"id":26860,"name":"Cloud Computing","url":"https://www.academia.edu/Documents/in/Cloud_Computing?f_ri=1554856"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=1554856"},{"id":66379,"name":"Automation","url":"https://www.academia.edu/Documents/in/Automation?f_ri=1554856"},{"id":130165,"name":"Power Engineering","url":"https://www.academia.edu/Documents/in/Power_Engineering?f_ri=1554856"},{"id":234882,"name":"Autism Spectrum Disorder","url":"https://www.academia.edu/Documents/in/Autism_Spectrum_Disorder?f_ri=1554856"},{"id":355159,"name":"Drives","url":"https://www.academia.edu/Documents/in/Drives?f_ri=1554856"},{"id":844366,"name":"Digital signal","url":"https://www.academia.edu/Documents/in/Digital_signal?f_ri=1554856"},{"id":1433808,"name":"Convolutional Neural Networks","url":"https://www.academia.edu/Documents/in/Convolutional_Neural_Networks?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19213177 coauthored" data-work_id="19213177" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19213177/On_the_Algebraic_Expression_of_the_AES_S_Box_Like_S_Boxes">On the Algebraic Expression of the AES S-Box Like S-Boxes</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19213177" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ab3396f411e52e60f1d61ba846b30e5d" rel="nofollow" data-download="{"attachment_id":40494377,"asset_id":19213177,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40494377/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="39441024" href="https://istanbultek.academia.edu/OsmanKaraahmeto%C4%9Flu">Osman Karaahmetoğlu</a><script data-card-contents-for-user="39441024" type="text/json">{"id":39441024,"first_name":"Osman","last_name":"Karaahmetoğlu","domain_name":"istanbultek","page_name":"OsmanKaraahmetoğlu","display_name":"Osman Karaahmetoğlu","profile_url":"https://istanbultek.academia.edu/OsmanKaraahmeto%C4%9Flu?f_ri=1554856","photo":"https://0.academia-photos.com/39441024/10863747/12124153/s65_osman.karaahmeto_lu.jpg"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19213177">+1</span><div class="hidden js-additional-users-19213177"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/AslanBora">Bora Aslan</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19213177'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19213177').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19213177 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19213177"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19213177, container: ".js-paper-rank-work_19213177", }); });</script></li><li class="js-percentile-work_19213177 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19213177; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19213177"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19213177 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19213177"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19213177; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19213177]").text(description); $(".js-view-count-work_19213177").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19213177").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19213177"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="721506" href="https://www.academia.edu/Documents/in/Finite_Field">Finite Field</a>, <script data-card-contents-for-ri="721506" type="text/json">{"id":721506,"name":"Finite Field","url":"https://www.academia.edu/Documents/in/Finite_Field?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="790925" href="https://www.academia.edu/Documents/in/Block_Cipher">Block Cipher</a>, <script data-card-contents-for-ri="790925" type="text/json">{"id":790925,"name":"Block Cipher","url":"https://www.academia.edu/Documents/in/Block_Cipher?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1032572" href="https://www.academia.edu/Documents/in/Digital_and_Networked_Performance-1">Digital & Networked Performance</a>, <script data-card-contents-for-ri="1032572" type="text/json">{"id":1032572,"name":"Digital \u0026 Networked Performance","url":"https://www.academia.edu/Documents/in/Digital_and_Networked_Performance-1?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1554856" href="https://www.academia.edu/Documents/in/Affine_Transformation">Affine Transformation</a><script data-card-contents-for-ri="1554856" type="text/json">{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19213177]'), work: {"id":19213177,"title":"On the Algebraic Expression of the AES S-Box Like S-Boxes","created_at":"2015-11-30T00:12:09.666-08:00","url":"https://www.academia.edu/19213177/On_the_Algebraic_Expression_of_the_AES_S_Box_Like_S_Boxes?f_ri=1554856","dom_id":"work_19213177","summary":null,"downloadable_attachments":[{"id":40494377,"asset_id":19213177,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":39441024,"first_name":"Osman","last_name":"Karaahmetoğlu","domain_name":"istanbultek","page_name":"OsmanKaraahmetoğlu","display_name":"Osman Karaahmetoğlu","profile_url":"https://istanbultek.academia.edu/OsmanKaraahmeto%C4%9Flu?f_ri=1554856","photo":"https://0.academia-photos.com/39441024/10863747/12124153/s65_osman.karaahmeto_lu.jpg"},{"id":39608467,"first_name":"Bora","last_name":"Aslan","domain_name":"independent","page_name":"AslanBora","display_name":"Bora Aslan","profile_url":"https://independent.academia.edu/AslanBora?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":721506,"name":"Finite Field","url":"https://www.academia.edu/Documents/in/Finite_Field?f_ri=1554856","nofollow":false},{"id":790925,"name":"Block Cipher","url":"https://www.academia.edu/Documents/in/Block_Cipher?f_ri=1554856","nofollow":false},{"id":1032572,"name":"Digital \u0026 Networked Performance","url":"https://www.academia.edu/Documents/in/Digital_and_Networked_Performance-1?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1847679" data-work_id="1847679" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1847679/Characterization_and_monitoring_of_the_%C3%85knes_rockslide_using_terrestrial_laser_scanning">Characterization and monitoring of the Åknes rockslide using terrestrial laser scanning</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1847679" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c03ae1cdf1db8686dad8e2fa5108e91e" rel="nofollow" data-download="{"attachment_id":25883251,"asset_id":1847679,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/25883251/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="2281250" href="https://ngu.academia.edu/ThierryOppikofer">Thierry Oppikofer</a><script data-card-contents-for-user="2281250" type="text/json">{"id":2281250,"first_name":"Thierry","last_name":"Oppikofer","domain_name":"ngu","page_name":"ThierryOppikofer","display_name":"Thierry Oppikofer","profile_url":"https://ngu.academia.edu/ThierryOppikofer?f_ri=1554856","photo":"https://0.academia-photos.com/2281250/725151/900439/s65_thierry.oppikofer.jpg"}</script></span></span></li><li class="js-paper-rank-work_1847679 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1847679"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1847679, container: ".js-paper-rank-work_1847679", }); });</script></li><li class="js-percentile-work_1847679 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1847679; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1847679"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1847679 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1847679"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1847679; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1847679]").text(description); $(".js-view-count-work_1847679").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1847679").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1847679"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="406" href="https://www.academia.edu/Documents/in/Geology">Geology</a>, <script data-card-contents-for-ri="406" type="text/json">{"id":406,"name":"Geology","url":"https://www.academia.edu/Documents/in/Geology?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="8618" href="https://www.academia.edu/Documents/in/Natural_Hazards">Natural Hazards</a>, <script data-card-contents-for-ri="8618" type="text/json">{"id":8618,"name":"Natural Hazards","url":"https://www.academia.edu/Documents/in/Natural_Hazards?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="78564" href="https://www.academia.edu/Documents/in/Terrestrial_Laser_Scanning">Terrestrial Laser Scanning</a>, <script data-card-contents-for-ri="78564" type="text/json">{"id":78564,"name":"Terrestrial Laser Scanning","url":"https://www.academia.edu/Documents/in/Terrestrial_Laser_Scanning?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="184909" href="https://www.academia.edu/Documents/in/Structure_Analysis">Structure Analysis</a><script data-card-contents-for-ri="184909" type="text/json">{"id":184909,"name":"Structure Analysis","url":"https://www.academia.edu/Documents/in/Structure_Analysis?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1847679]'), work: {"id":1847679,"title":"Characterization and monitoring of the Åknes rockslide using terrestrial laser scanning","created_at":"2012-08-09T19:00:04.927-07:00","url":"https://www.academia.edu/1847679/Characterization_and_monitoring_of_the_%C3%85knes_rockslide_using_terrestrial_laser_scanning?f_ri=1554856","dom_id":"work_1847679","summary":null,"downloadable_attachments":[{"id":25883251,"asset_id":1847679,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":2281250,"first_name":"Thierry","last_name":"Oppikofer","domain_name":"ngu","page_name":"ThierryOppikofer","display_name":"Thierry Oppikofer","profile_url":"https://ngu.academia.edu/ThierryOppikofer?f_ri=1554856","photo":"https://0.academia-photos.com/2281250/725151/900439/s65_thierry.oppikofer.jpg"}],"research_interests":[{"id":406,"name":"Geology","url":"https://www.academia.edu/Documents/in/Geology?f_ri=1554856","nofollow":false},{"id":8618,"name":"Natural Hazards","url":"https://www.academia.edu/Documents/in/Natural_Hazards?f_ri=1554856","nofollow":false},{"id":78564,"name":"Terrestrial Laser Scanning","url":"https://www.academia.edu/Documents/in/Terrestrial_Laser_Scanning?f_ri=1554856","nofollow":false},{"id":184909,"name":"Structure Analysis","url":"https://www.academia.edu/Documents/in/Structure_Analysis?f_ri=1554856","nofollow":false},{"id":309086,"name":"High Resolution","url":"https://www.academia.edu/Documents/in/High_Resolution?f_ri=1554856"},{"id":445981,"name":"Point Cloud","url":"https://www.academia.edu/Documents/in/Point_Cloud?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_8262438" data-work_id="8262438" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/8262438/A_new_fractal_algorithm_to_model_discrete_sequences">A new fractal algorithm to model discrete sequences</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Employing the properties of the affine mappings, a very novel fractal model scheme based on the iterative function system is proposed. We obtain the vertical scaling factors by a set of the middle points in each affine transform, solving... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_8262438" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Employing the properties of the affine mappings, a very novel fractal model scheme based on the iterative function system is proposed. We obtain the vertical scaling factors by a set of the middle points in each affine transform, solving the difficulty in determining the vertical scaling factors, one of the most difficult challenges faced by the fractal interpolation. The proposed method is carried out by interpolating the known attractor and the real discrete sequences from seismic data. The results show that a great accuracy in reconstruction of the known attractor and seismic profile is found, leading to a significant improvement over other fractal interpolation schemes.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/8262438" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="695d38d7e835ce987de62f883e1740dc" rel="nofollow" data-download="{"attachment_id":48162698,"asset_id":8262438,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48162698/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="16357119" href="https://independent.academia.edu/mingyuezhai">ming-yue zhai</a><script data-card-contents-for-user="16357119" type="text/json">{"id":16357119,"first_name":"ming-yue","last_name":"zhai","domain_name":"independent","page_name":"mingyuezhai","display_name":"ming-yue zhai","profile_url":"https://independent.academia.edu/mingyuezhai?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_8262438 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="8262438"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 8262438, container: ".js-paper-rank-work_8262438", }); });</script></li><li class="js-percentile-work_8262438 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 8262438; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_8262438"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_8262438 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="8262438"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 8262438; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=8262438]").text(description); $(".js-view-count-work_8262438").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_8262438").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="8262438"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="80414" href="https://www.academia.edu/Documents/in/Mathematical_Sciences">Mathematical Sciences</a>, <script data-card-contents-for-ri="80414" type="text/json">{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="118582" href="https://www.academia.edu/Documents/in/Physical_sciences">Physical sciences</a>, <script data-card-contents-for-ri="118582" type="text/json">{"id":118582,"name":"Physical sciences","url":"https://www.academia.edu/Documents/in/Physical_sciences?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="403149" href="https://www.academia.edu/Documents/in/Iterated_Function_System">Iterated Function System</a><script data-card-contents-for-ri="403149" type="text/json">{"id":403149,"name":"Iterated Function System","url":"https://www.academia.edu/Documents/in/Iterated_Function_System?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=8262438]'), work: {"id":8262438,"title":"A new fractal algorithm to model discrete sequences","created_at":"2014-09-09T14:53:13.632-07:00","url":"https://www.academia.edu/8262438/A_new_fractal_algorithm_to_model_discrete_sequences?f_ri=1554856","dom_id":"work_8262438","summary":"Employing the properties of the affine mappings, a very novel fractal model scheme based on the iterative function system is proposed. We obtain the vertical scaling factors by a set of the middle points in each affine transform, solving the difficulty in determining the vertical scaling factors, one of the most difficult challenges faced by the fractal interpolation. The proposed method is carried out by interpolating the known attractor and the real discrete sequences from seismic data. The results show that a great accuracy in reconstruction of the known attractor and seismic profile is found, leading to a significant improvement over other fractal interpolation schemes.","downloadable_attachments":[{"id":48162698,"asset_id":8262438,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":16357119,"first_name":"ming-yue","last_name":"zhai","domain_name":"independent","page_name":"mingyuezhai","display_name":"ming-yue zhai","profile_url":"https://independent.academia.edu/mingyuezhai?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=1554856","nofollow":false},{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=1554856","nofollow":false},{"id":118582,"name":"Physical sciences","url":"https://www.academia.edu/Documents/in/Physical_sciences?f_ri=1554856","nofollow":false},{"id":403149,"name":"Iterated Function System","url":"https://www.academia.edu/Documents/in/Iterated_Function_System?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_9216087" data-work_id="9216087" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/9216087/Parallax_Free_Long_Bone_X_ray_Image_Stitching">Parallax-Free Long Bone X-ray Image Stitching</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this paper, we present a novel method to create parallax-free panoramic X-ray images of long bones during surgery by making the C-arm rotate around its X-ray source, relative to the patient’s table. In order to ensure that the C-arm... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_9216087" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this paper, we present a novel method to create parallax-free panoramic X-ray images of long bones during surgery by making the C-arm rotate around its X-ray source, relative to the patient’s table. In order to ensure that the C-arm motion is a relative pure rotation around its X-ray source, we move the table to compensate for the translational part of the motion based on C-arm pose estimation, for which we employed a Camera Augmented Mobile C-arm system [1] and a visual planar marker pattern. Thus, we are able to produce a parallax-free panoramic X-ray image that preserves the property of linear perspective projection. We additionally implement a method to reduce the error caused by varying intrinsic parameters of C-arm X-ray imaging. The results show that our proposed method can generate a parallax-free panoramic X-ray image, independent of the configuration of bone structures and without the requirement of a fronto-parallel setup or any overlap in the X-ray images. The resulting panoramic images have a negligible difference (below 2 pixels) in the overlap between two consecutive individual X-ray images and have a high visual quality, which promises suitability for intra-operative clinical applications in orthopedic and trauma surgery.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/9216087" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="cf7c858d524393e61ecdde8b3d62ba9c" rel="nofollow" data-download="{"attachment_id":47849236,"asset_id":9216087,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47849236/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21123361" href="https://turn-de.academia.edu/JoergTraub">Joerg Traub</a><script data-card-contents-for-user="21123361" type="text/json">{"id":21123361,"first_name":"Joerg","last_name":"Traub","domain_name":"turn-de","page_name":"JoergTraub","display_name":"Joerg Traub","profile_url":"https://turn-de.academia.edu/JoergTraub?f_ri=1554856","photo":"https://0.academia-photos.com/21123361/5830896/6624667/s65_joerg.traub.jpg"}</script></span></span></li><li class="js-paper-rank-work_9216087 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="9216087"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 9216087, container: ".js-paper-rank-work_9216087", }); });</script></li><li class="js-percentile-work_9216087 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 9216087; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_9216087"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_9216087 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="9216087"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 9216087; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=9216087]").text(description); $(".js-view-count-work_9216087").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_9216087").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="9216087"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">27</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="428" href="https://www.academia.edu/Documents/in/Algorithms">Algorithms</a>, <script data-card-contents-for-ri="428" type="text/json">{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="10654" href="https://www.academia.edu/Documents/in/X-ray_imaging">X-ray imaging</a>, <script data-card-contents-for-ri="10654" type="text/json">{"id":10654,"name":"X-ray imaging","url":"https://www.academia.edu/Documents/in/X-ray_imaging?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="67357" href="https://www.academia.edu/Documents/in/Transducers">Transducers</a><script data-card-contents-for-ri="67357" type="text/json">{"id":67357,"name":"Transducers","url":"https://www.academia.edu/Documents/in/Transducers?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=9216087]'), work: {"id":9216087,"title":"Parallax-Free Long Bone X-ray Image Stitching","created_at":"2014-11-09T20:56:36.607-08:00","url":"https://www.academia.edu/9216087/Parallax_Free_Long_Bone_X_ray_Image_Stitching?f_ri=1554856","dom_id":"work_9216087","summary":"In this paper, we present a novel method to create parallax-free panoramic X-ray images of long bones during surgery by making the C-arm rotate around its X-ray source, relative to the patient’s table. In order to ensure that the C-arm motion is a relative pure rotation around its X-ray source, we move the table to compensate for the translational part of the motion based on C-arm pose estimation, for which we employed a Camera Augmented Mobile C-arm system [1] and a visual planar marker pattern. Thus, we are able to produce a parallax-free panoramic X-ray image that preserves the property of linear perspective projection. We additionally implement a method to reduce the error caused by varying intrinsic parameters of C-arm X-ray imaging. The results show that our proposed method can generate a parallax-free panoramic X-ray image, independent of the configuration of bone structures and without the requirement of a fronto-parallel setup or any overlap in the X-ray images. The resulting panoramic images have a negligible difference (below 2 pixels) in the overlap between two consecutive individual X-ray images and have a high visual quality, which promises suitability for intra-operative clinical applications in orthopedic and trauma surgery.","downloadable_attachments":[{"id":47849236,"asset_id":9216087,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21123361,"first_name":"Joerg","last_name":"Traub","domain_name":"turn-de","page_name":"JoergTraub","display_name":"Joerg Traub","profile_url":"https://turn-de.academia.edu/JoergTraub?f_ri=1554856","photo":"https://0.academia-photos.com/21123361/5830896/6624667/s65_joerg.traub.jpg"}],"research_interests":[{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=1554856","nofollow":false},{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=1554856","nofollow":false},{"id":10654,"name":"X-ray imaging","url":"https://www.academia.edu/Documents/in/X-ray_imaging?f_ri=1554856","nofollow":false},{"id":67357,"name":"Transducers","url":"https://www.academia.edu/Documents/in/Transducers?f_ri=1554856","nofollow":false},{"id":101839,"name":"Lighting","url":"https://www.academia.edu/Documents/in/Lighting?f_ri=1554856"},{"id":112619,"name":"Time of Flight","url":"https://www.academia.edu/Documents/in/Time_of_Flight?f_ri=1554856"},{"id":123287,"name":"Three Dimensional Imaging","url":"https://www.academia.edu/Documents/in/Three_Dimensional_Imaging?f_ri=1554856"},{"id":229390,"name":"Real Time","url":"https://www.academia.edu/Documents/in/Real_Time?f_ri=1554856"},{"id":230436,"name":"Pose Estimation","url":"https://www.academia.edu/Documents/in/Pose_Estimation?f_ri=1554856"},{"id":322954,"name":"Chip","url":"https://www.academia.edu/Documents/in/Chip?f_ri=1554856"},{"id":372581,"name":"Image Enhancement","url":"https://www.academia.edu/Documents/in/Image_Enhancement?f_ri=1554856"},{"id":549280,"name":"Reproducibility of Results","url":"https://www.academia.edu/Documents/in/Reproducibility_of_Results?f_ri=1554856"},{"id":727153,"name":"Visual Quality","url":"https://www.academia.edu/Documents/in/Visual_Quality?f_ri=1554856"},{"id":786355,"name":"Image Sensor","url":"https://www.academia.edu/Documents/in/Image_Sensor?f_ri=1554856"},{"id":901876,"name":"Sensitivity and Specificity","url":"https://www.academia.edu/Documents/in/Sensitivity_and_Specificity?f_ri=1554856"},{"id":957203,"name":"Perspective Projection","url":"https://www.academia.edu/Documents/in/Perspective_Projection?f_ri=1554856"},{"id":959921,"name":"X ray Computed Tomography","url":"https://www.academia.edu/Documents/in/X_ray_Computed_Tomography?f_ri=1554856"},{"id":1145520,"name":"Equipment Design","url":"https://www.academia.edu/Documents/in/Equipment_Design?f_ri=1554856"},{"id":1154231,"name":"Immobilization","url":"https://www.academia.edu/Documents/in/Immobilization?f_ri=1554856"},{"id":1157424,"name":"Equipment Failure Analysis","url":"https://www.academia.edu/Documents/in/Equipment_Failure_Analysis?f_ri=1554856"},{"id":1256683,"name":"Bone and Bones","url":"https://www.academia.edu/Documents/in/Bone_and_Bones?f_ri=1554856"},{"id":1275883,"name":"*Radiographic Image Enhancement","url":"https://www.academia.edu/Documents/in/_Radiographic_Image_Enhancement?f_ri=1554856"},{"id":1275886,"name":"Clinical Application","url":"https://www.academia.edu/Documents/in/Clinical_Application?f_ri=1554856"},{"id":1281395,"name":"Panoramic Image","url":"https://www.academia.edu/Documents/in/Panoramic_Image?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1747211,"name":"Endoscopes","url":"https://www.academia.edu/Documents/in/Endoscopes?f_ri=1554856"},{"id":1748489,"name":"Image Computing","url":"https://www.academia.edu/Documents/in/Image_Computing?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_17481124 coauthored" data-work_id="17481124" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/17481124/Robust_Blind_Watermarking_of_Point_Sampled_Geometry">Robust Blind Watermarking of Point-Sampled Geometry</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/17481124" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="13edbcf7fcda8698881b63ba9d9d5262" rel="nofollow" data-download="{"attachment_id":39534316,"asset_id":17481124,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/39534316/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="147845398" href="https://independent.academia.edu/ParagAgarwal7">Parag Agarwal</a><script data-card-contents-for-user="147845398" type="text/json">{"id":147845398,"first_name":"Parag","last_name":"Agarwal","domain_name":"independent","page_name":"ParagAgarwal7","display_name":"Parag Agarwal","profile_url":"https://independent.academia.edu/ParagAgarwal7?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-17481124">+1</span><div class="hidden js-additional-users-17481124"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/BalakrishnanPrabhakaran">Balakrishnan Prabhakaran</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-17481124'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-17481124').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_17481124 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="17481124"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 17481124, container: ".js-paper-rank-work_17481124", }); });</script></li><li class="js-percentile-work_17481124 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 17481124; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_17481124"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_17481124 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="17481124"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 17481124; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=17481124]").text(description); $(".js-view-count-work_17481124").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_17481124").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="17481124"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="209855" href="https://www.academia.edu/Documents/in/Time_Complexity">Time Complexity</a>, <script data-card-contents-for-ri="209855" type="text/json">{"id":209855,"name":"Time Complexity","url":"https://www.academia.edu/Documents/in/Time_Complexity?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="445981" href="https://www.academia.edu/Documents/in/Point_Cloud">Point Cloud</a>, <script data-card-contents-for-ri="445981" type="text/json">{"id":445981,"name":"Point Cloud","url":"https://www.academia.edu/Documents/in/Point_Cloud?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1038541" href="https://www.academia.edu/Documents/in/Copyright_Protection">Copyright Protection</a><script data-card-contents-for-ri="1038541" type="text/json">{"id":1038541,"name":"Copyright Protection","url":"https://www.academia.edu/Documents/in/Copyright_Protection?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=17481124]'), work: {"id":17481124,"title":"Robust Blind Watermarking of Point-Sampled Geometry","created_at":"2015-10-29T13:33:35.446-07:00","url":"https://www.academia.edu/17481124/Robust_Blind_Watermarking_of_Point_Sampled_Geometry?f_ri=1554856","dom_id":"work_17481124","summary":null,"downloadable_attachments":[{"id":39534316,"asset_id":17481124,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":147845398,"first_name":"Parag","last_name":"Agarwal","domain_name":"independent","page_name":"ParagAgarwal7","display_name":"Parag Agarwal","profile_url":"https://independent.academia.edu/ParagAgarwal7?f_ri=1554856","photo":"/images/s65_no_pic.png"},{"id":37238978,"first_name":"Balakrishnan","last_name":"Prabhakaran","domain_name":"independent","page_name":"BalakrishnanPrabhakaran","display_name":"Balakrishnan Prabhakaran","profile_url":"https://independent.academia.edu/BalakrishnanPrabhakaran?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=1554856","nofollow":false},{"id":209855,"name":"Time Complexity","url":"https://www.academia.edu/Documents/in/Time_Complexity?f_ri=1554856","nofollow":false},{"id":445981,"name":"Point Cloud","url":"https://www.academia.edu/Documents/in/Point_Cloud?f_ri=1554856","nofollow":false},{"id":1038541,"name":"Copyright Protection","url":"https://www.academia.edu/Documents/in/Copyright_Protection?f_ri=1554856","nofollow":false},{"id":1455513,"name":"Digital Watermark","url":"https://www.academia.edu/Documents/in/Digital_Watermark?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":2050175,"name":"Quantization Index Modulation","url":"https://www.academia.edu/Documents/in/Quantization_Index_Modulation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_58593408" data-work_id="58593408" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/58593408/Robust_image_registration_using_log_polar_transform">Robust image registration using log-polar transform</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/58593408" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bce2440288cf23f83cec4f009ef390e9" rel="nofollow" data-download="{"attachment_id":72929962,"asset_id":58593408,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/72929962/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="38559321" href="https://independent.academia.edu/GeorgeWolberg">George Wolberg</a><script data-card-contents-for-user="38559321" type="text/json">{"id":38559321,"first_name":"George","last_name":"Wolberg","domain_name":"independent","page_name":"GeorgeWolberg","display_name":"George Wolberg","profile_url":"https://independent.academia.edu/GeorgeWolberg?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_58593408 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="58593408"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 58593408, container: ".js-paper-rank-work_58593408", }); });</script></li><li class="js-percentile-work_58593408 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 58593408; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_58593408"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_58593408 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="58593408"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 58593408; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=58593408]").text(description); $(".js-view-count-work_58593408").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_58593408").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="58593408"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">17</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5057" href="https://www.academia.edu/Documents/in/Iterative_Methods">Iterative Methods</a>, <script data-card-contents-for-ri="5057" type="text/json">{"id":5057,"name":"Iterative Methods","url":"https://www.academia.edu/Documents/in/Iterative_Methods?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="29731" href="https://www.academia.edu/Documents/in/Image_Registration">Image Registration</a>, <script data-card-contents-for-ri="29731" type="text/json">{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="30347" href="https://www.academia.edu/Documents/in/Translation">Translation</a><script data-card-contents-for-ri="30347" type="text/json">{"id":30347,"name":"Translation","url":"https://www.academia.edu/Documents/in/Translation?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=58593408]'), work: {"id":58593408,"title":"Robust image registration using log-polar transform","created_at":"2021-10-17T06:54:13.273-07:00","url":"https://www.academia.edu/58593408/Robust_image_registration_using_log_polar_transform?f_ri=1554856","dom_id":"work_58593408","summary":null,"downloadable_attachments":[{"id":72929962,"asset_id":58593408,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":38559321,"first_name":"George","last_name":"Wolberg","domain_name":"independent","page_name":"GeorgeWolberg","display_name":"George Wolberg","profile_url":"https://independent.academia.edu/GeorgeWolberg?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=1554856","nofollow":false},{"id":5057,"name":"Iterative Methods","url":"https://www.academia.edu/Documents/in/Iterative_Methods?f_ri=1554856","nofollow":false},{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false},{"id":30347,"name":"Translation","url":"https://www.academia.edu/Documents/in/Translation?f_ri=1554856","nofollow":false},{"id":39920,"name":"Parameter estimation","url":"https://www.academia.edu/Documents/in/Parameter_estimation?f_ri=1554856"},{"id":56541,"name":"Motion estimation","url":"https://www.academia.edu/Documents/in/Motion_estimation?f_ri=1554856"},{"id":84210,"name":"Digital Images","url":"https://www.academia.edu/Documents/in/Digital_Images?f_ri=1554856"},{"id":113117,"name":"Scale","url":"https://www.academia.edu/Documents/in/Scale?f_ri=1554856"},{"id":279495,"name":"Robustness","url":"https://www.academia.edu/Documents/in/Robustness?f_ri=1554856"},{"id":323690,"name":"Hybrid Algorithm","url":"https://www.academia.edu/Documents/in/Hybrid_Algorithm?f_ri=1554856"},{"id":775583,"name":"Shear","url":"https://www.academia.edu/Documents/in/Shear?f_ri=1554856"},{"id":818658,"name":"Rotation","url":"https://www.academia.edu/Documents/in/Rotation?f_ri=1554856"},{"id":825003,"name":"Registers","url":"https://www.academia.edu/Documents/in/Registers?f_ri=1554856"},{"id":907382,"name":"Digital Image","url":"https://www.academia.edu/Documents/in/Digital_Image?f_ri=1554856"},{"id":1231240,"name":"Fourier Transforms","url":"https://www.academia.edu/Documents/in/Fourier_Transforms?f_ri=1554856"},{"id":1388478,"name":"Least-squares Approximation","url":"https://www.academia.edu/Documents/in/Least-squares_Approximation?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_50486800" data-work_id="50486800" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/50486800/Optimising_ontology_classification">Optimising ontology classification</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Ontology classification—the computation of subsumption hierarchies for classes and properties—is one of the most important tasks for OWL reasoners. Based on the algorithm by Shearer and Horrocks [9], we present a new classification... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_50486800" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Ontology classification—the computation of subsumption hierarchies for classes and properties—is one of the most important tasks for OWL reasoners. Based on the algorithm by Shearer and Horrocks [9], we present a new classification procedure that addresses several open issues of the original algorithm, and that uses several novel optimisations in order to achieve superior performance. We also consider the classification of (object and data) properties. We show that algorithms commonly used to implement that task are incomplete ...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/50486800" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="4543f696164e90377a7520d69e474e0b" rel="nofollow" data-download="{"attachment_id":68454373,"asset_id":50486800,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/68454373/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="177741308" href="https://uitm.academia.edu/MOHDFAISOLRAHIM">MOHD FAISOL RAHIM</a><script data-card-contents-for-user="177741308" type="text/json">{"id":177741308,"first_name":"MOHD FAISOL","last_name":"RAHIM","domain_name":"uitm","page_name":"MOHDFAISOLRAHIM","display_name":"MOHD FAISOL RAHIM","profile_url":"https://uitm.academia.edu/MOHDFAISOLRAHIM?f_ri=1554856","photo":"https://0.academia-photos.com/177741308/59306438/47549544/s65_mohd_faisol.rahim.jpeg"}</script></span></span></li><li class="js-paper-rank-work_50486800 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="50486800"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 50486800, container: ".js-paper-rank-work_50486800", }); });</script></li><li class="js-percentile-work_50486800 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 50486800; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_50486800"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_50486800 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="50486800"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 50486800; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=50486800]").text(description); $(".js-view-count-work_50486800").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_50486800").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="50486800"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">20</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="37" href="https://www.academia.edu/Documents/in/Information_Systems">Information Systems</a>, <script data-card-contents-for-ri="37" type="text/json">{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="4510" href="https://www.academia.edu/Documents/in/Deterrence">Deterrence</a>, <script data-card-contents-for-ri="4510" type="text/json">{"id":4510,"name":"Deterrence","url":"https://www.academia.edu/Documents/in/Deterrence?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="14212" href="https://www.academia.edu/Documents/in/Group_communication">Group communication</a>, <script data-card-contents-for-ri="14212" type="text/json">{"id":14212,"name":"Group communication","url":"https://www.academia.edu/Documents/in/Group_communication?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="16542" href="https://www.academia.edu/Documents/in/Cryptography">Cryptography</a><script data-card-contents-for-ri="16542" type="text/json">{"id":16542,"name":"Cryptography","url":"https://www.academia.edu/Documents/in/Cryptography?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=50486800]'), work: {"id":50486800,"title":"Optimising ontology classification","created_at":"2021-08-01T01:21:46.324-07:00","url":"https://www.academia.edu/50486800/Optimising_ontology_classification?f_ri=1554856","dom_id":"work_50486800","summary":"Ontology classification—the computation of subsumption hierarchies for classes and properties—is one of the most important tasks for OWL reasoners. Based on the algorithm by Shearer and Horrocks [9], we present a new classification procedure that addresses several open issues of the original algorithm, and that uses several novel optimisations in order to achieve superior performance. We also consider the classification of (object and data) properties. We show that algorithms commonly used to implement that task are incomplete ...","downloadable_attachments":[{"id":68454373,"asset_id":50486800,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":177741308,"first_name":"MOHD FAISOL","last_name":"RAHIM","domain_name":"uitm","page_name":"MOHDFAISOLRAHIM","display_name":"MOHD FAISOL RAHIM","profile_url":"https://uitm.academia.edu/MOHDFAISOLRAHIM?f_ri=1554856","photo":"https://0.academia-photos.com/177741308/59306438/47549544/s65_mohd_faisol.rahim.jpeg"}],"research_interests":[{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=1554856","nofollow":false},{"id":4510,"name":"Deterrence","url":"https://www.academia.edu/Documents/in/Deterrence?f_ri=1554856","nofollow":false},{"id":14212,"name":"Group communication","url":"https://www.academia.edu/Documents/in/Group_communication?f_ri=1554856","nofollow":false},{"id":16542,"name":"Cryptography","url":"https://www.academia.edu/Documents/in/Cryptography?f_ri=1554856","nofollow":false},{"id":58707,"name":"Cryptanalysis","url":"https://www.academia.edu/Documents/in/Cryptanalysis?f_ri=1554856"},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=1554856"},{"id":97450,"name":"Intervention","url":"https://www.academia.edu/Documents/in/Intervention?f_ri=1554856"},{"id":296505,"name":"Convexity","url":"https://www.academia.edu/Documents/in/Convexity?f_ri=1554856"},{"id":459384,"name":"Energy efficient","url":"https://www.academia.edu/Documents/in/Energy_efficient?f_ri=1554856"},{"id":678153,"name":"Dukan Dijeta","url":"https://www.academia.edu/Documents/in/Dukan_Dijeta?f_ri=1554856"},{"id":819765,"name":"Constraint Satisfaction","url":"https://www.academia.edu/Documents/in/Constraint_Satisfaction?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1689234,"name":"Constrained Optimization","url":"https://www.academia.edu/Documents/in/Constrained_Optimization?f_ri=1554856"},{"id":1724034,"name":"Data Encryption Standard","url":"https://www.academia.edu/Documents/in/Data_Encryption_Standard?f_ri=1554856"},{"id":1789170,"name":"Hamming weight","url":"https://www.academia.edu/Documents/in/Hamming_weight?f_ri=1554856"},{"id":1950746,"name":"Heuristic algorithm","url":"https://www.academia.edu/Documents/in/Heuristic_algorithm?f_ri=1554856"},{"id":2004933,"name":"Hybrid System","url":"https://www.academia.edu/Documents/in/Hybrid_System?f_ri=1554856"},{"id":2070034,"name":"Data Format","url":"https://www.academia.edu/Documents/in/Data_Format?f_ri=1554856"},{"id":2649207,"name":"Gd","url":"https://www.academia.edu/Documents/in/Gd?f_ri=1554856"},{"id":3115633,"name":"Discrete time","url":"https://www.academia.edu/Documents/in/Discrete_time?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4077157" data-work_id="4077157" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4077157/RADIOMETRIC_AND_GEOMETRIC_EVALUATION_OF_IKONOS_GEO_IMAGES_AND_THEIR_USE_FOR_3D_BUILDING_MODELLING">RADIOMETRIC AND GEOMETRIC EVALUATION OF IKONOS GEO IMAGES AND THEIR USE FOR 3D BUILDING MODELLING</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4077157" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="7673f1eb95f283ee788c5292c14efbfd" rel="nofollow" data-download="{"attachment_id":50044835,"asset_id":4077157,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50044835/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4915276" href="https://independent.academia.edu/PaterakiMaria">Maria Pateraki</a><script data-card-contents-for-user="4915276" type="text/json">{"id":4915276,"first_name":"Maria","last_name":"Pateraki","domain_name":"independent","page_name":"PaterakiMaria","display_name":"Maria Pateraki","profile_url":"https://independent.academia.edu/PaterakiMaria?f_ri=1554856","photo":"https://0.academia-photos.com/4915276/2118686/2488765/s65_maria.pateraki.jpg"}</script></span></span></li><li class="js-paper-rank-work_4077157 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4077157"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4077157, container: ".js-paper-rank-work_4077157", }); });</script></li><li class="js-percentile-work_4077157 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4077157; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4077157"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4077157 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4077157"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4077157; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4077157]").text(description); $(".js-view-count-work_4077157").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4077157").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4077157"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="37434" href="https://www.academia.edu/Documents/in/Quantitative_analysis">Quantitative analysis</a>, <script data-card-contents-for-ri="37434" type="text/json">{"id":37434,"name":"Quantitative analysis","url":"https://www.academia.edu/Documents/in/Quantitative_analysis?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="49247" href="https://www.academia.edu/Documents/in/Higher_Order_Thinking">Higher Order Thinking</a>, <script data-card-contents-for-ri="49247" type="text/json">{"id":49247,"name":"Higher Order Thinking","url":"https://www.academia.edu/Documents/in/Higher_Order_Thinking?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="92750" href="https://www.academia.edu/Documents/in/Noise_estimation">Noise estimation</a>, <script data-card-contents-for-ri="92750" type="text/json">{"id":92750,"name":"Noise estimation","url":"https://www.academia.edu/Documents/in/Noise_estimation?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="208877" href="https://www.academia.edu/Documents/in/Satellite_Imagery">Satellite Imagery</a><script data-card-contents-for-ri="208877" type="text/json">{"id":208877,"name":"Satellite Imagery","url":"https://www.academia.edu/Documents/in/Satellite_Imagery?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4077157]'), work: {"id":4077157,"title":"RADIOMETRIC AND GEOMETRIC EVALUATION OF IKONOS GEO IMAGES AND THEIR USE FOR 3D BUILDING MODELLING","created_at":"2013-07-21T19:32:03.300-07:00","url":"https://www.academia.edu/4077157/RADIOMETRIC_AND_GEOMETRIC_EVALUATION_OF_IKONOS_GEO_IMAGES_AND_THEIR_USE_FOR_3D_BUILDING_MODELLING?f_ri=1554856","dom_id":"work_4077157","summary":null,"downloadable_attachments":[{"id":50044835,"asset_id":4077157,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4915276,"first_name":"Maria","last_name":"Pateraki","domain_name":"independent","page_name":"PaterakiMaria","display_name":"Maria Pateraki","profile_url":"https://independent.academia.edu/PaterakiMaria?f_ri=1554856","photo":"https://0.academia-photos.com/4915276/2118686/2488765/s65_maria.pateraki.jpg"}],"research_interests":[{"id":37434,"name":"Quantitative analysis","url":"https://www.academia.edu/Documents/in/Quantitative_analysis?f_ri=1554856","nofollow":false},{"id":49247,"name":"Higher Order Thinking","url":"https://www.academia.edu/Documents/in/Higher_Order_Thinking?f_ri=1554856","nofollow":false},{"id":92750,"name":"Noise estimation","url":"https://www.academia.edu/Documents/in/Noise_estimation?f_ri=1554856","nofollow":false},{"id":208877,"name":"Satellite Imagery","url":"https://www.academia.edu/Documents/in/Satellite_Imagery?f_ri=1554856","nofollow":false},{"id":445981,"name":"Point Cloud","url":"https://www.academia.edu/Documents/in/Point_Cloud?f_ri=1554856"},{"id":490810,"name":"Building Reconstruction","url":"https://www.academia.edu/Documents/in/Building_Reconstruction?f_ri=1554856"},{"id":641216,"name":"Quantitative Analysis","url":"https://www.academia.edu/Documents/in/Quantitative_Analysis-1?f_ri=1554856"},{"id":1305573,"name":"High Resolution Satellite Imagery","url":"https://www.academia.edu/Documents/in/High_Resolution_Satellite_Imagery?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1752153,"name":"Texture Mapping","url":"https://www.academia.edu/Documents/in/Texture_Mapping?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4077163" data-work_id="4077163" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4077163/POTENTIAL_OF_IKONOS_AND_QUICKBIRD_IMAGERY_FOR_ACCURATE_3D_POINT_POSITIONING_ORTHOIMAGE_AND_DSM_GENERATION">POTENTIAL OF IKONOS AND QUICKBIRD IMAGERY FOR ACCURATE 3D POINT POSITIONING, ORTHOIMAGE AND DSM GENERATION</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4077163" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1b5e5a4f08caaa80b0c23301cfcaf0a2" rel="nofollow" data-download="{"attachment_id":31604790,"asset_id":4077163,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31604790/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4915276" href="https://independent.academia.edu/PaterakiMaria">Maria Pateraki</a><script data-card-contents-for-user="4915276" type="text/json">{"id":4915276,"first_name":"Maria","last_name":"Pateraki","domain_name":"independent","page_name":"PaterakiMaria","display_name":"Maria Pateraki","profile_url":"https://independent.academia.edu/PaterakiMaria?f_ri=1554856","photo":"https://0.academia-photos.com/4915276/2118686/2488765/s65_maria.pateraki.jpg"}</script></span></span></li><li class="js-paper-rank-work_4077163 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4077163"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4077163, container: ".js-paper-rank-work_4077163", }); });</script></li><li class="js-percentile-work_4077163 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4077163; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4077163"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4077163 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4077163"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4077163; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4077163]").text(description); $(".js-view-count-work_4077163").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4077163").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4077163"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">3</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="309086" href="https://www.academia.edu/Documents/in/High_Resolution">High Resolution</a>, <script data-card-contents-for-ri="309086" type="text/json">{"id":309086,"name":"High Resolution","url":"https://www.academia.edu/Documents/in/High_Resolution?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1358275" href="https://www.academia.edu/Documents/in/Rational_Polynomial_Coefficient">Rational Polynomial Coefficient</a>, <script data-card-contents-for-ri="1358275" type="text/json">{"id":1358275,"name":"Rational Polynomial Coefficient","url":"https://www.academia.edu/Documents/in/Rational_Polynomial_Coefficient?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1554856" href="https://www.academia.edu/Documents/in/Affine_Transformation">Affine Transformation</a><script data-card-contents-for-ri="1554856" type="text/json">{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4077163]'), work: {"id":4077163,"title":"POTENTIAL OF IKONOS AND QUICKBIRD IMAGERY FOR ACCURATE 3D POINT POSITIONING, ORTHOIMAGE AND DSM GENERATION","created_at":"2013-07-21T19:32:04.896-07:00","url":"https://www.academia.edu/4077163/POTENTIAL_OF_IKONOS_AND_QUICKBIRD_IMAGERY_FOR_ACCURATE_3D_POINT_POSITIONING_ORTHOIMAGE_AND_DSM_GENERATION?f_ri=1554856","dom_id":"work_4077163","summary":null,"downloadable_attachments":[{"id":31604790,"asset_id":4077163,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4915276,"first_name":"Maria","last_name":"Pateraki","domain_name":"independent","page_name":"PaterakiMaria","display_name":"Maria Pateraki","profile_url":"https://independent.academia.edu/PaterakiMaria?f_ri=1554856","photo":"https://0.academia-photos.com/4915276/2118686/2488765/s65_maria.pateraki.jpg"}],"research_interests":[{"id":309086,"name":"High Resolution","url":"https://www.academia.edu/Documents/in/High_Resolution?f_ri=1554856","nofollow":false},{"id":1358275,"name":"Rational Polynomial Coefficient","url":"https://www.academia.edu/Documents/in/Rational_Polynomial_Coefficient?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_28864706" data-work_id="28864706" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/28864706/The_determination_of_implicit_polynomial_canonical_curves">The determination of implicit polynomial canonical curves</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/28864706" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5c5909b29b0ba3403a319fc681cf7861" rel="nofollow" data-download="{"attachment_id":49290193,"asset_id":28864706,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49290193/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="54342220" href="https://independent.academia.edu/MustafaUnel">Mustafa Unel</a><script data-card-contents-for-user="54342220" type="text/json">{"id":54342220,"first_name":"Mustafa","last_name":"Unel","domain_name":"independent","page_name":"MustafaUnel","display_name":"Mustafa Unel","profile_url":"https://independent.academia.edu/MustafaUnel?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_28864706 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="28864706"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 28864706, container: ".js-paper-rank-work_28864706", }); });</script></li><li class="js-percentile-work_28864706 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 28864706; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_28864706"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_28864706 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="28864706"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 28864706; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=28864706]").text(description); $(".js-view-count-work_28864706").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_28864706").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="28864706"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="37" href="https://www.academia.edu/Documents/in/Information_Systems">Information Systems</a>, <script data-card-contents-for-ri="37" type="text/json">{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="854" href="https://www.academia.edu/Documents/in/Computer_Vision">Computer Vision</a>, <script data-card-contents-for-ri="854" type="text/json">{"id":854,"name":"Computer Vision","url":"https://www.academia.edu/Documents/in/Computer_Vision?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="81788" href="https://www.academia.edu/Documents/in/Edge_Detection">Edge Detection</a>, <script data-card-contents-for-ri="81788" type="text/json">{"id":81788,"name":"Edge Detection","url":"https://www.academia.edu/Documents/in/Edge_Detection?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="102887" href="https://www.academia.edu/Documents/in/Object_Recognition">Object Recognition</a><script data-card-contents-for-ri="102887" type="text/json">{"id":102887,"name":"Object Recognition","url":"https://www.academia.edu/Documents/in/Object_Recognition?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=28864706]'), work: {"id":28864706,"title":"The determination of implicit polynomial canonical curves","created_at":"2016-10-02T06:13:39.050-07:00","url":"https://www.academia.edu/28864706/The_determination_of_implicit_polynomial_canonical_curves?f_ri=1554856","dom_id":"work_28864706","summary":null,"downloadable_attachments":[{"id":49290193,"asset_id":28864706,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":54342220,"first_name":"Mustafa","last_name":"Unel","domain_name":"independent","page_name":"MustafaUnel","display_name":"Mustafa Unel","profile_url":"https://independent.academia.edu/MustafaUnel?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=1554856","nofollow":false},{"id":854,"name":"Computer Vision","url":"https://www.academia.edu/Documents/in/Computer_Vision?f_ri=1554856","nofollow":false},{"id":81788,"name":"Edge Detection","url":"https://www.academia.edu/Documents/in/Edge_Detection?f_ri=1554856","nofollow":false},{"id":102887,"name":"Object Recognition","url":"https://www.academia.edu/Documents/in/Object_Recognition?f_ri=1554856","nofollow":false},{"id":230436,"name":"Pose Estimation","url":"https://www.academia.edu/Documents/in/Pose_Estimation?f_ri=1554856"},{"id":370219,"name":"Matrix Decomposition","url":"https://www.academia.edu/Documents/in/Matrix_Decomposition?f_ri=1554856"},{"id":441926,"name":"Scattering","url":"https://www.academia.edu/Documents/in/Scattering?f_ri=1554856"},{"id":969030,"name":"Polynomials","url":"https://www.academia.edu/Documents/in/Polynomials?f_ri=1554856"},{"id":1130298,"name":"Critical Point","url":"https://www.academia.edu/Documents/in/Critical_Point?f_ri=1554856"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1671586,"name":"Transformation Matrix","url":"https://www.academia.edu/Documents/in/Transformation_Matrix?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_6767303" data-work_id="6767303" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/6767303/Using_k_d_Trees_for_Robust_3D_Point_Pattern_Matching">Using k-d Trees for Robust 3D Point Pattern Matching</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">We propose a new method for matching two 3D point sets of identical cardinality with global similarity but locally nonrigid distribution. This problem arises from marker-based optical motion capture systems. The point-sets are extracted... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_6767303" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">We propose a new method for matching two 3D point sets of identical cardinality with global similarity but locally nonrigid distribution. This problem arises from marker-based optical motion capture systems. The point-sets are extracted from similar design poses of two subjects with underlying nonrigidity and possible distribution discrepancies, one being a model set (manually identified) and the other representing observation of another subject, to be matched to the model set. There exists neither a single global scale, nor an affine transformation between the point-sets. To establish the goal of a one-to-one for identification, we introduce a k-dimensional tree based method, which is well adapted and robust to such data, typically with distribution errors due to underlying subject nonrigidity. First, we construct a k-d tree for the model set. Then a similarity k-d tree of the data set is constructed following the structure information embedded in the model tree. Matching sequences of the two point sets are generated by traversing the identically structured trees. Experimental results confirm that this method is applicable for robust spatial matching of sparse point sets under nonrigid distortion.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/6767303" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1bf07af79fee635556b9877d434b2e61" rel="nofollow" data-download="{"attachment_id":48728669,"asset_id":6767303,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48728669/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="11160957" href="https://aber.academia.edu/HorstHolstein">Horst Holstein</a><script data-card-contents-for-user="11160957" type="text/json">{"id":11160957,"first_name":"Horst","last_name":"Holstein","domain_name":"aber","page_name":"HorstHolstein","display_name":"Horst Holstein","profile_url":"https://aber.academia.edu/HorstHolstein?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_6767303 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="6767303"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 6767303, container: ".js-paper-rank-work_6767303", }); });</script></li><li class="js-percentile-work_6767303 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 6767303; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_6767303"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_6767303 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="6767303"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 6767303; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=6767303]").text(description); $(".js-view-count-work_6767303").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_6767303").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="6767303"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="221756" href="https://www.academia.edu/Documents/in/Motion_Capture">Motion Capture</a>, <script data-card-contents-for-ri="221756" type="text/json">{"id":221756,"name":"Motion Capture","url":"https://www.academia.edu/Documents/in/Motion_Capture?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="533468" href="https://www.academia.edu/Documents/in/Spatial_Data">Spatial Data</a>, <script data-card-contents-for-ri="533468" type="text/json">{"id":533468,"name":"Spatial Data","url":"https://www.academia.edu/Documents/in/Spatial_Data?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="634758" href="https://www.academia.edu/Documents/in/Dim">Dim</a>, <script data-card-contents-for-ri="634758" type="text/json">{"id":634758,"name":"Dim","url":"https://www.academia.edu/Documents/in/Dim?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1323379" href="https://www.academia.edu/Documents/in/Point_Pattern_Matching">Point Pattern Matching</a><script data-card-contents-for-ri="1323379" type="text/json">{"id":1323379,"name":"Point Pattern Matching","url":"https://www.academia.edu/Documents/in/Point_Pattern_Matching?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=6767303]'), work: {"id":6767303,"title":"Using k-d Trees for Robust 3D Point Pattern Matching","created_at":"2014-04-15T08:21:00.837-07:00","url":"https://www.academia.edu/6767303/Using_k_d_Trees_for_Robust_3D_Point_Pattern_Matching?f_ri=1554856","dom_id":"work_6767303","summary":"We propose a new method for matching two 3D point sets of identical cardinality with global similarity but locally nonrigid distribution. This problem arises from marker-based optical motion capture systems. The point-sets are extracted from similar design poses of two subjects with underlying nonrigidity and possible distribution discrepancies, one being a model set (manually identified) and the other representing observation of another subject, to be matched to the model set. There exists neither a single global scale, nor an affine transformation between the point-sets. To establish the goal of a one-to-one for identification, we introduce a k-dimensional tree based method, which is well adapted and robust to such data, typically with distribution errors due to underlying subject nonrigidity. First, we construct a k-d tree for the model set. Then a similarity k-d tree of the data set is constructed following the structure information embedded in the model tree. Matching sequences of the two point sets are generated by traversing the identically structured trees. Experimental results confirm that this method is applicable for robust spatial matching of sparse point sets under nonrigid distortion.","downloadable_attachments":[{"id":48728669,"asset_id":6767303,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":11160957,"first_name":"Horst","last_name":"Holstein","domain_name":"aber","page_name":"HorstHolstein","display_name":"Horst Holstein","profile_url":"https://aber.academia.edu/HorstHolstein?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":221756,"name":"Motion Capture","url":"https://www.academia.edu/Documents/in/Motion_Capture?f_ri=1554856","nofollow":false},{"id":533468,"name":"Spatial Data","url":"https://www.academia.edu/Documents/in/Spatial_Data?f_ri=1554856","nofollow":false},{"id":634758,"name":"Dim","url":"https://www.academia.edu/Documents/in/Dim?f_ri=1554856","nofollow":false},{"id":1323379,"name":"Point Pattern Matching","url":"https://www.academia.edu/Documents/in/Point_Pattern_Matching?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1944655,"name":"Information Embedding","url":"https://www.academia.edu/Documents/in/Information_Embedding?f_ri=1554856"},{"id":2163622,"name":"Possibility Distribution","url":"https://www.academia.edu/Documents/in/Possibility_Distribution?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_11225900" data-work_id="11225900" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/11225900/Data_Hiding_for_Binary_Documents_Robust_to_Print_Scan_Photocopy_and_Geometric_Distortions">Data Hiding for Binary Documents Robust to Print-Scan, Photocopy and Geometric Distortions</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/11225900" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f744353fcce41c5b026b0959ff7c59c4" rel="nofollow" data-download="{"attachment_id":36841680,"asset_id":11225900,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/36841680/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="27126458" href="https://usp-br.academia.edu/HaeYongKim">Hae Yong Kim</a><script data-card-contents-for-user="27126458" type="text/json">{"id":27126458,"first_name":"Hae Yong","last_name":"Kim","domain_name":"usp-br","page_name":"HaeYongKim","display_name":"Hae Yong Kim","profile_url":"https://usp-br.academia.edu/HaeYongKim?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_11225900 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="11225900"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 11225900, container: ".js-paper-rank-work_11225900", }); });</script></li><li class="js-percentile-work_11225900 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 11225900; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_11225900"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_11225900 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="11225900"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 11225900; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=11225900]").text(description); $(".js-view-count-work_11225900").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_11225900").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="11225900"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="11193" href="https://www.academia.edu/Documents/in/Watermarking">Watermarking</a>, <script data-card-contents-for-ri="11193" type="text/json">{"id":11193,"name":"Watermarking","url":"https://www.academia.edu/Documents/in/Watermarking?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="85871" href="https://www.academia.edu/Documents/in/Data_Hiding">Data Hiding</a>, <script data-card-contents-for-ri="85871" type="text/json">{"id":85871,"name":"Data Hiding","url":"https://www.academia.edu/Documents/in/Data_Hiding?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="433449" href="https://www.academia.edu/Documents/in/Cryptographic_Protocols">Cryptographic Protocols</a>, <script data-card-contents-for-ri="433449" type="text/json">{"id":433449,"name":"Cryptographic Protocols","url":"https://www.academia.edu/Documents/in/Cryptographic_Protocols?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1554856" href="https://www.academia.edu/Documents/in/Affine_Transformation">Affine Transformation</a><script data-card-contents-for-ri="1554856" type="text/json">{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=11225900]'), work: {"id":11225900,"title":"Data Hiding for Binary Documents Robust to Print-Scan, Photocopy and Geometric Distortions","created_at":"2015-03-03T04:18:00.747-08:00","url":"https://www.academia.edu/11225900/Data_Hiding_for_Binary_Documents_Robust_to_Print_Scan_Photocopy_and_Geometric_Distortions?f_ri=1554856","dom_id":"work_11225900","summary":null,"downloadable_attachments":[{"id":36841680,"asset_id":11225900,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":27126458,"first_name":"Hae Yong","last_name":"Kim","domain_name":"usp-br","page_name":"HaeYongKim","display_name":"Hae Yong Kim","profile_url":"https://usp-br.academia.edu/HaeYongKim?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":11193,"name":"Watermarking","url":"https://www.academia.edu/Documents/in/Watermarking?f_ri=1554856","nofollow":false},{"id":85871,"name":"Data Hiding","url":"https://www.academia.edu/Documents/in/Data_Hiding?f_ri=1554856","nofollow":false},{"id":433449,"name":"Cryptographic Protocols","url":"https://www.academia.edu/Documents/in/Cryptographic_Protocols?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_26266028" data-work_id="26266028" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/26266028/Image_registration_in_multispectral_data_sets">Image registration in multispectral data sets</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/26266028" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f6c86289f7b83cbf8cc604269122a951" rel="nofollow" data-download="{"attachment_id":46579232,"asset_id":26266028,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/46579232/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="50179794" href="https://shams.academia.edu/HMahdi">Hani Mahdi</a><script data-card-contents-for-user="50179794" type="text/json">{"id":50179794,"first_name":"Hani","last_name":"Mahdi","domain_name":"shams","page_name":"HMahdi","display_name":"Hani Mahdi","profile_url":"https://shams.academia.edu/HMahdi?f_ri=1554856","photo":"https://0.academia-photos.com/50179794/13187106/14481545/s65_hani.mahdi.jpg"}</script></span></span></li><li class="js-paper-rank-work_26266028 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="26266028"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 26266028, container: ".js-paper-rank-work_26266028", }); });</script></li><li class="js-percentile-work_26266028 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 26266028; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_26266028"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_26266028 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="26266028"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 26266028; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=26266028]").text(description); $(".js-view-count-work_26266028").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_26266028").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="26266028"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="431" href="https://www.academia.edu/Documents/in/Parallel_Algorithms">Parallel Algorithms</a>, <script data-card-contents-for-ri="431" type="text/json">{"id":431,"name":"Parallel Algorithms","url":"https://www.academia.edu/Documents/in/Parallel_Algorithms?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1252" href="https://www.academia.edu/Documents/in/Remote_Sensing">Remote Sensing</a>, <script data-card-contents-for-ri="1252" type="text/json">{"id":1252,"name":"Remote Sensing","url":"https://www.academia.edu/Documents/in/Remote_Sensing?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5026" href="https://www.academia.edu/Documents/in/Genetic_Algorithms">Genetic Algorithms</a>, <script data-card-contents-for-ri="5026" type="text/json">{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="29731" href="https://www.academia.edu/Documents/in/Image_Registration">Image Registration</a><script data-card-contents-for-ri="29731" type="text/json">{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=26266028]'), work: {"id":26266028,"title":"Image registration in multispectral data sets","created_at":"2016-06-17T15:05:26.222-07:00","url":"https://www.academia.edu/26266028/Image_registration_in_multispectral_data_sets?f_ri=1554856","dom_id":"work_26266028","summary":null,"downloadable_attachments":[{"id":46579232,"asset_id":26266028,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":50179794,"first_name":"Hani","last_name":"Mahdi","domain_name":"shams","page_name":"HMahdi","display_name":"Hani Mahdi","profile_url":"https://shams.academia.edu/HMahdi?f_ri=1554856","photo":"https://0.academia-photos.com/50179794/13187106/14481545/s65_hani.mahdi.jpg"}],"research_interests":[{"id":431,"name":"Parallel Algorithms","url":"https://www.academia.edu/Documents/in/Parallel_Algorithms?f_ri=1554856","nofollow":false},{"id":1252,"name":"Remote Sensing","url":"https://www.academia.edu/Documents/in/Remote_Sensing?f_ri=1554856","nofollow":false},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=1554856","nofollow":false},{"id":29731,"name":"Image Registration","url":"https://www.academia.edu/Documents/in/Image_Registration?f_ri=1554856","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=1554856"},{"id":238230,"name":"Scaling","url":"https://www.academia.edu/Documents/in/Scaling?f_ri=1554856"},{"id":285356,"name":"Hyperspectral Imaging","url":"https://www.academia.edu/Documents/in/Hyperspectral_Imaging?f_ri=1554856"},{"id":818658,"name":"Rotation","url":"https://www.academia.edu/Documents/in/Rotation?f_ri=1554856"},{"id":1130224,"name":"Hyperspectral Sensors","url":"https://www.academia.edu/Documents/in/Hyperspectral_Sensors?f_ri=1554856"},{"id":1381061,"name":"Image Sensors","url":"https://www.academia.edu/Documents/in/Image_Sensors?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_74639759" data-work_id="74639759" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/74639759/Similarity_and_symmetry_measures_for_convex_shapes_using_Minkowski_addition">Similarity and symmetry measures for convex shapes using Minkowski addition</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/74639759" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="59d3c9e3c4a4c0debf60140d4cc218f4" rel="nofollow" data-download="{"attachment_id":82720207,"asset_id":74639759,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/82720207/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="47765021" href="https://independent.academia.edu/ATuzikov">Alexander Tuzikov</a><script data-card-contents-for-user="47765021" type="text/json">{"id":47765021,"first_name":"Alexander","last_name":"Tuzikov","domain_name":"independent","page_name":"ATuzikov","display_name":"Alexander Tuzikov","profile_url":"https://independent.academia.edu/ATuzikov?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_74639759 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="74639759"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 74639759, container: ".js-paper-rank-work_74639759", }); });</script></li><li class="js-percentile-work_74639759 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 74639759; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_74639759"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_74639759 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="74639759"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 74639759; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=74639759]").text(description); $(".js-view-count-work_74639759").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_74639759").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="74639759"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">13</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="37" href="https://www.academia.edu/Documents/in/Information_Systems">Information Systems</a>, <script data-card-contents-for-ri="37" type="text/json">{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="300" href="https://www.academia.edu/Documents/in/Mathematics">Mathematics</a>, <script data-card-contents-for-ri="300" type="text/json">{"id":300,"name":"Mathematics","url":"https://www.academia.edu/Documents/in/Mathematics?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1185" href="https://www.academia.edu/Documents/in/Image_Processing">Image Processing</a><script data-card-contents-for-ri="1185" type="text/json">{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=74639759]'), work: {"id":74639759,"title":"Similarity and symmetry measures for convex shapes using Minkowski addition","created_at":"2022-03-26T12:30:51.395-07:00","url":"https://www.academia.edu/74639759/Similarity_and_symmetry_measures_for_convex_shapes_using_Minkowski_addition?f_ri=1554856","dom_id":"work_74639759","summary":null,"downloadable_attachments":[{"id":82720207,"asset_id":74639759,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":47765021,"first_name":"Alexander","last_name":"Tuzikov","domain_name":"independent","page_name":"ATuzikov","display_name":"Alexander Tuzikov","profile_url":"https://independent.academia.edu/ATuzikov?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems?f_ri=1554856","nofollow":false},{"id":300,"name":"Mathematics","url":"https://www.academia.edu/Documents/in/Mathematics?f_ri=1554856","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=1554856","nofollow":false},{"id":1185,"name":"Image Processing","url":"https://www.academia.edu/Documents/in/Image_Processing?f_ri=1554856","nofollow":false},{"id":14417,"name":"Machine Vision","url":"https://www.academia.edu/Documents/in/Machine_Vision?f_ri=1554856"},{"id":29169,"name":"Reflection","url":"https://www.academia.edu/Documents/in/Reflection?f_ri=1554856"},{"id":126829,"name":"Symmetry","url":"https://www.academia.edu/Documents/in/Symmetry?f_ri=1554856"},{"id":149059,"name":"Efficient Algorithm for ECG Coding","url":"https://www.academia.edu/Documents/in/Efficient_Algorithm_for_ECG_Coding?f_ri=1554856"},{"id":800990,"name":"Reflectivity","url":"https://www.academia.edu/Documents/in/Reflectivity?f_ri=1554856"},{"id":1120502,"name":"Experimental Data","url":"https://www.academia.edu/Documents/in/Experimental_Data?f_ri=1554856"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":3628876,"name":"Mixed Volume","url":"https://www.academia.edu/Documents/in/Mixed_Volume?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_68491778" data-work_id="68491778" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/68491778/On_the_Algebraic_Expression_of_the_AES_S_Box_Like_S_Boxes">On the Algebraic Expression of the AES S-Box Like S-Boxes</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Abstract. In the literature, there are several proposed block ciphers like AES, Square, Shark and Hierocrypt which use S-boxes that are based on inversion mapping over a finite field. Because of the simple algebraic structure of S-boxes... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_68491778" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Abstract. In the literature, there are several proposed block ciphers like AES, Square, Shark and Hierocrypt which use S-boxes that are based on inversion mapping over a finite field. Because of the simple algebraic structure of S-boxes generated in this way, these ciphers usually ...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/68491778" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="05268620a1e7fcc8a40fa0cb5aed8bd8" rel="nofollow" data-download="{"attachment_id":78947580,"asset_id":68491778,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/78947580/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="36509594" href="https://independent.academia.edu/ercanbulu%C5%9F">ercan buluş</a><script data-card-contents-for-user="36509594" type="text/json">{"id":36509594,"first_name":"ercan","last_name":"buluş","domain_name":"independent","page_name":"ercanbuluş","display_name":"ercan buluş","profile_url":"https://independent.academia.edu/ercanbulu%C5%9F?f_ri=1554856","photo":"https://0.academia-photos.com/36509594/11503065/12829895/s65_ercan.bulu_.jpg"}</script></span></span></li><li class="js-paper-rank-work_68491778 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="68491778"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 68491778, container: ".js-paper-rank-work_68491778", }); });</script></li><li class="js-percentile-work_68491778 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 68491778; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_68491778"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_68491778 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="68491778"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 68491778; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=68491778]").text(description); $(".js-view-count-work_68491778").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_68491778").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="68491778"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="721506" href="https://www.academia.edu/Documents/in/Finite_Field">Finite Field</a>, <script data-card-contents-for-ri="721506" type="text/json">{"id":721506,"name":"Finite Field","url":"https://www.academia.edu/Documents/in/Finite_Field?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="790925" href="https://www.academia.edu/Documents/in/Block_Cipher">Block Cipher</a>, <script data-card-contents-for-ri="790925" type="text/json">{"id":790925,"name":"Block Cipher","url":"https://www.academia.edu/Documents/in/Block_Cipher?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1032572" href="https://www.academia.edu/Documents/in/Digital_and_Networked_Performance-1">Digital & Networked Performance</a><script data-card-contents-for-ri="1032572" type="text/json">{"id":1032572,"name":"Digital \u0026 Networked Performance","url":"https://www.academia.edu/Documents/in/Digital_and_Networked_Performance-1?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=68491778]'), work: {"id":68491778,"title":"On the Algebraic Expression of the AES S-Box Like S-Boxes","created_at":"2022-01-17T00:33:01.304-08:00","url":"https://www.academia.edu/68491778/On_the_Algebraic_Expression_of_the_AES_S_Box_Like_S_Boxes?f_ri=1554856","dom_id":"work_68491778","summary":"Abstract. In the literature, there are several proposed block ciphers like AES, Square, Shark and Hierocrypt which use S-boxes that are based on inversion mapping over a finite field. Because of the simple algebraic structure of S-boxes generated in this way, these ciphers usually ...","downloadable_attachments":[{"id":78947580,"asset_id":68491778,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":36509594,"first_name":"ercan","last_name":"buluş","domain_name":"independent","page_name":"ercanbuluş","display_name":"ercan buluş","profile_url":"https://independent.academia.edu/ercanbulu%C5%9F?f_ri=1554856","photo":"https://0.academia-photos.com/36509594/11503065/12829895/s65_ercan.bulu_.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=1554856","nofollow":false},{"id":721506,"name":"Finite Field","url":"https://www.academia.edu/Documents/in/Finite_Field?f_ri=1554856","nofollow":false},{"id":790925,"name":"Block Cipher","url":"https://www.academia.edu/Documents/in/Block_Cipher?f_ri=1554856","nofollow":false},{"id":1032572,"name":"Digital \u0026 Networked Performance","url":"https://www.academia.edu/Documents/in/Digital_and_Networked_Performance-1?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_48292225" data-work_id="48292225" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/48292225/The_shape_and_psychophysics_of_cinematic_space">The shape and psychophysics of cinematic space</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">For the film goer who sits to the front and side of a movie theater, the virtual space "behind" the screen undergoes affine and perspective transformations. These transformations should, one would think, make the rigidity of objects on... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_48292225" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">For the film goer who sits to the front and side of a movie theater, the virtual space "behind" the screen undergoes affine and perspective transformations. These transformations should, one would think, make the rigidity of objects on the screen very difficult to discern. Despite the fact that it has long been known that viewers are not very sensitive to such distortions, a phenome- non I call La Gournerie’s paradox, the effect is without a good theoretical account. Two possibili- ties are: (1) that viewers rectify the distortions of Euclidean space through the use of information about screen slant, and (2) that sufficient information is preserved under these transformations so that perception may be unperturbed. This paper presents preliminary arguments for the information-preservation view and introduces a new technique, that of using simulated projec- tion surfaces, whose use in experimental situations suggests that Euclidean rectification is not necessary.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/48292225" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="079638614edd0d790860f5eb40b7ef63" rel="nofollow" data-download="{"attachment_id":66981965,"asset_id":48292225,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/66981965/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="250083" href="https://cornell.academia.edu/JamesECutting">James E Cutting</a><script data-card-contents-for-user="250083" type="text/json">{"id":250083,"first_name":"James","last_name":"Cutting","domain_name":"cornell","page_name":"JamesECutting","display_name":"James E Cutting","profile_url":"https://cornell.academia.edu/JamesECutting?f_ri=1554856","photo":"https://0.academia-photos.com/250083/14350119/15280125/s65_james.cutting.jpg"}</script></span></span></li><li class="js-paper-rank-work_48292225 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="48292225"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 48292225, container: ".js-paper-rank-work_48292225", }); });</script></li><li class="js-percentile-work_48292225 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 48292225; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_48292225"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_48292225 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="48292225"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 48292225; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=48292225]").text(description); $(".js-view-count-work_48292225").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_48292225").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="48292225"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">13</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="221" href="https://www.academia.edu/Documents/in/Psychology">Psychology</a>, <script data-card-contents-for-ri="221" type="text/json">{"id":221,"name":"Psychology","url":"https://www.academia.edu/Documents/in/Psychology?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="237" href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a>, <script data-card-contents-for-ri="237" type="text/json">{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5359" href="https://www.academia.edu/Documents/in/Visual_perception">Visual perception</a>, <script data-card-contents-for-ri="5359" type="text/json">{"id":5359,"name":"Visual perception","url":"https://www.academia.edu/Documents/in/Visual_perception?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="41041" href="https://www.academia.edu/Documents/in/Image">Image</a><script data-card-contents-for-ri="41041" type="text/json">{"id":41041,"name":"Image","url":"https://www.academia.edu/Documents/in/Image?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=48292225]'), work: {"id":48292225,"title":"The shape and psychophysics of cinematic space","created_at":"2021-05-04T11:49:44.167-07:00","url":"https://www.academia.edu/48292225/The_shape_and_psychophysics_of_cinematic_space?f_ri=1554856","dom_id":"work_48292225","summary":"For the film goer who sits to the front and side of a movie theater, the virtual space \"behind\" the screen undergoes affine and perspective transformations. These transformations should, one would think, make the rigidity of objects on the screen very difficult to discern. Despite the fact that it has long been known that viewers are not very sensitive to such distortions, a phenome- non I call La Gournerie’s paradox, the effect is without a good theoretical account. Two possibili- ties are: (1) that viewers rectify the distortions of Euclidean space through the use of information about screen slant, and (2) that sufficient information is preserved under these transformations so that perception may be unperturbed. This paper presents preliminary arguments for the information-preservation view and introduces a new technique, that of using simulated projec- tion surfaces, whose use in experimental situations suggests that Euclidean rectification is not necessary.","downloadable_attachments":[{"id":66981965,"asset_id":48292225,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":250083,"first_name":"James","last_name":"Cutting","domain_name":"cornell","page_name":"JamesECutting","display_name":"James E Cutting","profile_url":"https://cornell.academia.edu/JamesECutting?f_ri=1554856","photo":"https://0.academia-photos.com/250083/14350119/15280125/s65_james.cutting.jpg"}],"research_interests":[{"id":221,"name":"Psychology","url":"https://www.academia.edu/Documents/in/Psychology?f_ri=1554856","nofollow":false},{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=1554856","nofollow":false},{"id":5359,"name":"Visual perception","url":"https://www.academia.edu/Documents/in/Visual_perception?f_ri=1554856","nofollow":false},{"id":41041,"name":"Image","url":"https://www.academia.edu/Documents/in/Image?f_ri=1554856","nofollow":false},{"id":48999,"name":"Information","url":"https://www.academia.edu/Documents/in/Information?f_ri=1554856"},{"id":86034,"name":"Mathematical Analysis","url":"https://www.academia.edu/Documents/in/Mathematical_Analysis?f_ri=1554856"},{"id":90162,"name":"Kinematics","url":"https://www.academia.edu/Documents/in/Kinematics?f_ri=1554856"},{"id":128803,"name":"Distortion","url":"https://www.academia.edu/Documents/in/Distortion?f_ri=1554856"},{"id":184711,"name":"Shape","url":"https://www.academia.edu/Documents/in/Shape?f_ri=1554856"},{"id":505472,"name":"Euclidean space","url":"https://www.academia.edu/Documents/in/Euclidean_space?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":2485584,"name":"Behavior Methods","url":"https://www.academia.edu/Documents/in/Behavior_Methods?f_ri=1554856"},{"id":3801921,"name":"Distorsion","url":"https://www.academia.edu/Documents/in/Distorsion?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_45493689" data-work_id="45493689" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/45493689/A_self_adaptive_algorithm_to_defeat_text_based_CAPTCHA">A self-adaptive algorithm to defeat text-based CAPTCHA</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">CAPTCHA (Completely Automated Public Turing test to Tell Computers and Humans Apart) is almost everywhere in data entry due to automated scripts like bots. Nowadays, text-based scheme is still applied most widely, which typically need the... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_45493689" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">CAPTCHA (Completely Automated Public Turing test to Tell Computers and Humans Apart) is almost everywhere in data entry due to automated scripts like bots. Nowadays, text-based scheme is still applied most widely, which typically need the users to answer questions regarding recognition task. In particular, the segmentations of different types of CAPTCHAs are not always the same. As so far, there isn't any universal way to solve the segmentation problems. In this paper, we present a novel adaptive algorithm and based on that we create a system to defeat several CAPTCHAs at the same time. The CAPTCHA datasets we used are from the State Administration for Industry&Commerce of the People's Republic of China. There are totally 33 entrances of CAPTCHAs we need to solve. In this experiments, we assume that each of the entrance is known. Results are provided showing how our algorithms work well towards these CAPTCHAs.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/45493689" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="2f45c8701b493c1edd1c389c261b625a" rel="nofollow" data-download="{"attachment_id":65989292,"asset_id":45493689,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/65989292/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="183600006" href="https://tamu.academia.edu/MiLu">Mi Lu</a><script data-card-contents-for-user="183600006" type="text/json">{"id":183600006,"first_name":"Mi","last_name":"Lu","domain_name":"tamu","page_name":"MiLu","display_name":"Mi Lu","profile_url":"https://tamu.academia.edu/MiLu?f_ri=1554856","photo":"https://0.academia-photos.com/183600006/50950521/39001356/s65_mi.lu.jpg"}</script></span></span></li><li class="js-paper-rank-work_45493689 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="45493689"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 45493689, container: ".js-paper-rank-work_45493689", }); });</script></li><li class="js-percentile-work_45493689 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 45493689; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_45493689"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_45493689 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="45493689"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 45493689; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=45493689]").text(description); $(".js-view-count-work_45493689").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_45493689").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="45493689"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="5486" href="https://www.academia.edu/Documents/in/Clustering_and_Classification_Methods">Clustering and Classification Methods</a>, <script data-card-contents-for-ri="5486" type="text/json">{"id":5486,"name":"Clustering and Classification Methods","url":"https://www.academia.edu/Documents/in/Clustering_and_Classification_Methods?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="55371" href="https://www.academia.edu/Documents/in/Captchas">Captchas</a>, <script data-card-contents-for-ri="55371" type="text/json">{"id":55371,"name":"Captchas","url":"https://www.academia.edu/Documents/in/Captchas?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="56687" href="https://www.academia.edu/Documents/in/Turing_Test">Turing Test</a>, <script data-card-contents-for-ri="56687" type="text/json">{"id":56687,"name":"Turing Test","url":"https://www.academia.edu/Documents/in/Turing_Test?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="232008" href="https://www.academia.edu/Documents/in/Graphic_CAPTCHA">Graphic CAPTCHA</a><script data-card-contents-for-ri="232008" type="text/json">{"id":232008,"name":"Graphic CAPTCHA","url":"https://www.academia.edu/Documents/in/Graphic_CAPTCHA?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=45493689]'), work: {"id":45493689,"title":"A self-adaptive algorithm to defeat text-based CAPTCHA","created_at":"2021-03-12T11:47:30.552-08:00","url":"https://www.academia.edu/45493689/A_self_adaptive_algorithm_to_defeat_text_based_CAPTCHA?f_ri=1554856","dom_id":"work_45493689","summary":"CAPTCHA (Completely Automated Public Turing test to Tell Computers and Humans Apart) is almost everywhere in data entry due to automated scripts like bots. Nowadays, text-based scheme is still applied most widely, which typically need the users to answer questions regarding recognition task. In particular, the segmentations of different types of CAPTCHAs are not always the same. As so far, there isn't any universal way to solve the segmentation problems. In this paper, we present a novel adaptive algorithm and based on that we create a system to defeat several CAPTCHAs at the same time. The CAPTCHA datasets we used are from the State Administration for Industry\u0026Commerce of the People's Republic of China. There are totally 33 entrances of CAPTCHAs we need to solve. In this experiments, we assume that each of the entrance is known. Results are provided showing how our algorithms work well towards these CAPTCHAs.","downloadable_attachments":[{"id":65989292,"asset_id":45493689,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":183600006,"first_name":"Mi","last_name":"Lu","domain_name":"tamu","page_name":"MiLu","display_name":"Mi Lu","profile_url":"https://tamu.academia.edu/MiLu?f_ri=1554856","photo":"https://0.academia-photos.com/183600006/50950521/39001356/s65_mi.lu.jpg"}],"research_interests":[{"id":5486,"name":"Clustering and Classification Methods","url":"https://www.academia.edu/Documents/in/Clustering_and_Classification_Methods?f_ri=1554856","nofollow":false},{"id":55371,"name":"Captchas","url":"https://www.academia.edu/Documents/in/Captchas?f_ri=1554856","nofollow":false},{"id":56687,"name":"Turing Test","url":"https://www.academia.edu/Documents/in/Turing_Test?f_ri=1554856","nofollow":false},{"id":232008,"name":"Graphic CAPTCHA","url":"https://www.academia.edu/Documents/in/Graphic_CAPTCHA?f_ri=1554856","nofollow":false},{"id":349061,"name":"Turing machine","url":"https://www.academia.edu/Documents/in/Turing_machine?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":1834351,"name":"Captcha as Graphical Passwords—A New Security Primitive Based on Hard AI Problems PPT","url":"https://www.academia.edu/Documents/in/Captcha_as_Graphical_Passwords_A_New_Security_Primitive_Based_on_Hard_AI_Problems_PPT?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_30966842" data-work_id="30966842" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/30966842/Affine_Illumination_Compensation_for_Multispectral_Images">Affine Illumination Compensation for Multispectral Images</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/30966842" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="7e013e4b1118d64490ed471a08e34df1" rel="nofollow" data-download="{"attachment_id":51398723,"asset_id":30966842,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/51398723/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="54395" href="https://liu-se.academia.edu/ReinerLenz">Reiner Lenz</a><script data-card-contents-for-user="54395" type="text/json">{"id":54395,"first_name":"Reiner","last_name":"Lenz","domain_name":"liu-se","page_name":"ReinerLenz","display_name":"Reiner Lenz","profile_url":"https://liu-se.academia.edu/ReinerLenz?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_30966842 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="30966842"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 30966842, container: ".js-paper-rank-work_30966842", }); });</script></li><li class="js-percentile-work_30966842 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 30966842; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_30966842"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_30966842 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="30966842"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 30966842; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=30966842]").text(description); $(".js-view-count-work_30966842").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_30966842").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="30966842"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="65455" href="https://www.academia.edu/Documents/in/Model_Transformation">Model Transformation</a>, <script data-card-contents-for-ri="65455" type="text/json">{"id":65455,"name":"Model Transformation","url":"https://www.academia.edu/Documents/in/Model_Transformation?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="85880" href="https://www.academia.edu/Documents/in/Singular_value_decomposition">Singular value decomposition</a>, <script data-card-contents-for-ri="85880" type="text/json">{"id":85880,"name":"Singular value decomposition","url":"https://www.academia.edu/Documents/in/Singular_value_decomposition?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="113434" href="https://www.academia.edu/Documents/in/Performance_Model">Performance Model</a>, <script data-card-contents-for-ri="113434" type="text/json">{"id":113434,"name":"Performance Model","url":"https://www.academia.edu/Documents/in/Performance_Model?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1024164" href="https://www.academia.edu/Documents/in/Multispectral_Images">Multispectral Images</a><script data-card-contents-for-ri="1024164" type="text/json">{"id":1024164,"name":"Multispectral Images","url":"https://www.academia.edu/Documents/in/Multispectral_Images?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=30966842]'), work: {"id":30966842,"title":"Affine Illumination Compensation for Multispectral Images","created_at":"2017-01-17T13:37:37.182-08:00","url":"https://www.academia.edu/30966842/Affine_Illumination_Compensation_for_Multispectral_Images?f_ri=1554856","dom_id":"work_30966842","summary":null,"downloadable_attachments":[{"id":51398723,"asset_id":30966842,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":54395,"first_name":"Reiner","last_name":"Lenz","domain_name":"liu-se","page_name":"ReinerLenz","display_name":"Reiner Lenz","profile_url":"https://liu-se.academia.edu/ReinerLenz?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":65455,"name":"Model Transformation","url":"https://www.academia.edu/Documents/in/Model_Transformation?f_ri=1554856","nofollow":false},{"id":85880,"name":"Singular value decomposition","url":"https://www.academia.edu/Documents/in/Singular_value_decomposition?f_ri=1554856","nofollow":false},{"id":113434,"name":"Performance Model","url":"https://www.academia.edu/Documents/in/Performance_Model?f_ri=1554856","nofollow":false},{"id":1024164,"name":"Multispectral Images","url":"https://www.academia.edu/Documents/in/Multispectral_Images?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_30735481" data-work_id="30735481" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/30735481/_title_Comparison_research_of_algorithms_about_ortho_rectification_for_remote_sensing_image_title_"><title>Comparison research of algorithms about ortho-rectification for remote sensing image</title></a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/30735481" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="e187bbfe88fc4e862ac6a58cba3b32a6" rel="nofollow" data-download="{"attachment_id":51182246,"asset_id":30735481,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/51182246/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="58540333" href="https://independent.academia.edu/HuangWenli">Wenli Huang</a><script data-card-contents-for-user="58540333" type="text/json">{"id":58540333,"first_name":"Wenli","last_name":"Huang","domain_name":"independent","page_name":"HuangWenli","display_name":"Wenli Huang","profile_url":"https://independent.academia.edu/HuangWenli?f_ri=1554856","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_30735481 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="30735481"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 30735481, container: ".js-paper-rank-work_30735481", }); });</script></li><li class="js-percentile-work_30735481 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 30735481; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_30735481"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_30735481 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="30735481"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 30735481; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=30735481]").text(description); $(".js-view-count-work_30735481").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_30735481").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="30735481"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">14</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="428" href="https://www.academia.edu/Documents/in/Algorithms">Algorithms</a>, <script data-card-contents-for-ri="428" type="text/json">{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1252" href="https://www.academia.edu/Documents/in/Remote_Sensing">Remote Sensing</a>, <script data-card-contents-for-ri="1252" type="text/json">{"id":1252,"name":"Remote Sensing","url":"https://www.academia.edu/Documents/in/Remote_Sensing?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2923" href="https://www.academia.edu/Documents/in/Methodology">Methodology</a>, <script data-card-contents-for-ri="2923" type="text/json">{"id":2923,"name":"Methodology","url":"https://www.academia.edu/Documents/in/Methodology?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5348" href="https://www.academia.edu/Documents/in/Transformation">Transformation</a><script data-card-contents-for-ri="5348" type="text/json">{"id":5348,"name":"Transformation","url":"https://www.academia.edu/Documents/in/Transformation?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=30735481]'), work: {"id":30735481,"title":"\u003ctitle\u003eComparison research of algorithms about ortho-rectification for remote sensing image\u003c/title\u003e","created_at":"2017-01-04T07:34:45.672-08:00","url":"https://www.academia.edu/30735481/_title_Comparison_research_of_algorithms_about_ortho_rectification_for_remote_sensing_image_title_?f_ri=1554856","dom_id":"work_30735481","summary":null,"downloadable_attachments":[{"id":51182246,"asset_id":30735481,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":58540333,"first_name":"Wenli","last_name":"Huang","domain_name":"independent","page_name":"HuangWenli","display_name":"Wenli Huang","profile_url":"https://independent.academia.edu/HuangWenli?f_ri=1554856","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=1554856","nofollow":false},{"id":1252,"name":"Remote Sensing","url":"https://www.academia.edu/Documents/in/Remote_Sensing?f_ri=1554856","nofollow":false},{"id":2923,"name":"Methodology","url":"https://www.academia.edu/Documents/in/Methodology?f_ri=1554856","nofollow":false},{"id":5348,"name":"Transformation","url":"https://www.academia.edu/Documents/in/Transformation?f_ri=1554856","nofollow":false},{"id":11598,"name":"Neural Networks","url":"https://www.academia.edu/Documents/in/Neural_Networks?f_ri=1554856"},{"id":26066,"name":"Neural Network","url":"https://www.academia.edu/Documents/in/Neural_Network?f_ri=1554856"},{"id":61108,"name":"Geometric model","url":"https://www.academia.edu/Documents/in/Geometric_model?f_ri=1554856"},{"id":220049,"name":"Accuracy","url":"https://www.academia.edu/Documents/in/Accuracy?f_ri=1554856"},{"id":581652,"name":"Data Processing","url":"https://www.academia.edu/Documents/in/Data_Processing?f_ri=1554856"},{"id":638808,"name":"Precision","url":"https://www.academia.edu/Documents/in/Precision?f_ri=1554856"},{"id":765332,"name":"Transformations","url":"https://www.academia.edu/Documents/in/Transformations?f_ri=1554856"},{"id":874949,"name":"Orthorectification","url":"https://www.academia.edu/Documents/in/Orthorectification?f_ri=1554856"},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"},{"id":2579286,"name":"mathematical equations","url":"https://www.academia.edu/Documents/in/mathematical_equations?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3689373" data-work_id="3689373" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3689373/A_better_scaled_local_tangent_space_alignment_algorithm">A better scaled local tangent space alignment algorithm</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3689373" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="89603ff93dbb67a969a82f3ffe061c70" rel="nofollow" data-download="{"attachment_id":50177346,"asset_id":3689373,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50177346/download_file?st=MTczMzI2MzE2Myw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4506839" href="https://oregonstate.academia.edu/FuxinLi">Fuxin Li</a><script data-card-contents-for-user="4506839" type="text/json">{"id":4506839,"first_name":"Fuxin","last_name":"Li","domain_name":"oregonstate","page_name":"FuxinLi","display_name":"Fuxin Li","profile_url":"https://oregonstate.academia.edu/FuxinLi?f_ri=1554856","photo":"https://0.academia-photos.com/4506839/1856178/2205700/s65_fuxin.li.jpg"}</script></span></span></li><li class="js-paper-rank-work_3689373 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3689373"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3689373, container: ".js-paper-rank-work_3689373", }); });</script></li><li class="js-percentile-work_3689373 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3689373; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3689373"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3689373 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3689373"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3689373; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3689373]").text(description); $(".js-view-count-work_3689373").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3689373").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3689373"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="53293" href="https://www.academia.edu/Documents/in/Software">Software</a>, <script data-card-contents-for-ri="53293" type="text/json">{"id":53293,"name":"Software","url":"https://www.academia.edu/Documents/in/Software?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="64561" href="https://www.academia.edu/Documents/in/Computer_Software">Computer Software</a>, <script data-card-contents-for-ri="64561" type="text/json">{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="505472" href="https://www.academia.edu/Documents/in/Euclidean_space">Euclidean space</a>, <script data-card-contents-for-ri="505472" type="text/json">{"id":505472,"name":"Euclidean space","url":"https://www.academia.edu/Documents/in/Euclidean_space?f_ri=1554856","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="951818" href="https://www.academia.edu/Documents/in/Nonlinear_Dimensionality_Reduction">Nonlinear Dimensionality Reduction</a><script data-card-contents-for-ri="951818" type="text/json">{"id":951818,"name":"Nonlinear Dimensionality Reduction","url":"https://www.academia.edu/Documents/in/Nonlinear_Dimensionality_Reduction?f_ri=1554856","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3689373]'), work: {"id":3689373,"title":"A better scaled local tangent space alignment algorithm","created_at":"2013-06-11T07:17:03.067-07:00","url":"https://www.academia.edu/3689373/A_better_scaled_local_tangent_space_alignment_algorithm?f_ri=1554856","dom_id":"work_3689373","summary":null,"downloadable_attachments":[{"id":50177346,"asset_id":3689373,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4506839,"first_name":"Fuxin","last_name":"Li","domain_name":"oregonstate","page_name":"FuxinLi","display_name":"Fuxin Li","profile_url":"https://oregonstate.academia.edu/FuxinLi?f_ri=1554856","photo":"https://0.academia-photos.com/4506839/1856178/2205700/s65_fuxin.li.jpg"}],"research_interests":[{"id":53293,"name":"Software","url":"https://www.academia.edu/Documents/in/Software?f_ri=1554856","nofollow":false},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=1554856","nofollow":false},{"id":505472,"name":"Euclidean space","url":"https://www.academia.edu/Documents/in/Euclidean_space?f_ri=1554856","nofollow":false},{"id":951818,"name":"Nonlinear Dimensionality Reduction","url":"https://www.academia.edu/Documents/in/Nonlinear_Dimensionality_Reduction?f_ri=1554856","nofollow":false},{"id":1554856,"name":"Affine Transformation","url":"https://www.academia.edu/Documents/in/Affine_Transformation?f_ri=1554856"}]}, }) } })();</script></ul></li></ul></div></div></div><div class="u-taCenter Pagination"><ul class="pagination"><li class="next_page"><a href="/Documents/in/Affine_Transformation?after=50%2C27732525" rel="next">Next</a></li><li class="last next"><a href="/Documents/in/Affine_Transformation?page=last">Last »</a></li></ul></div></div><div class="hidden-xs hidden-sm"><div class="u-pl6x"><div style="width: 300px;"><div class="panel panel-flat u-mt7x"><div class="panel-heading u-p5x"><div class="u-tcGrayDark u-taCenter u-fw700 u-textUppercase">Related Topics</div></div><ul class="list-group"><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Perspective_Projection">Perspective Projection</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="957203">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="957203">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Objective_function">Objective function</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="2421822">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="2421822">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/High_resolution_satelite_image">High resolution satelite image</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="319514">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="319514">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Wireless_Control_Network">Wireless Control Network</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="973134">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="973134">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Image_Registration">Image Registration</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="29731">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="29731">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Schubert_Calculus">Schubert Calculus</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="3520">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="3520">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Hadron_Physics">Hadron Physics</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="5189">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="5189">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Naive_Realism">Naive Realism</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="9774">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="9774">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Eventology">Eventology</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="10637">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="10637">Following</a></div></li></ul></div></div></div></div></div></div><script>// MIT License // Copyright © 2011 Sebastian Tschan, https://blueimp.net // Permission is hereby granted, free of charge, to any person obtaining a copy of // this software and associated documentation files (the "Software"), to deal in // the Software without restriction, including without limitation the rights to // use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of // the Software, and to permit persons to whom the Software is furnished to do so, // subject to the following conditions: // The above copyright notice and this permission notice shall be included in all // copies or substantial portions of the Software. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS // FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR // COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN // CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. !function(n){"use strict";function d(n,t){var r=(65535&n)+(65535&t);return(n>>16)+(t>>16)+(r>>16)<<16|65535&r}function f(n,t,r,e,o,u){return d((c=d(d(t,n),d(e,u)))<<(f=o)|c>>>32-f,r);var c,f}function l(n,t,r,e,o,u,c){return f(t&r|~t&e,n,t,o,u,c)}function v(n,t,r,e,o,u,c){return f(t&e|r&~e,n,t,o,u,c)}function g(n,t,r,e,o,u,c){return f(t^r^e,n,t,o,u,c)}function m(n,t,r,e,o,u,c){return f(r^(t|~e),n,t,o,u,c)}function i(n,t){var r,e,o,u;n[t>>5]|=128<<t%32,n[14+(t+64>>>9<<4)]=t;for(var c=1732584193,f=-271733879,i=-1732584194,a=271733878,h=0;h<n.length;h+=16)c=l(r=c,e=f,o=i,u=a,n[h],7,-680876936),a=l(a,c,f,i,n[h+1],12,-389564586),i=l(i,a,c,f,n[h+2],17,606105819),f=l(f,i,a,c,n[h+3],22,-1044525330),c=l(c,f,i,a,n[h+4],7,-176418897),a=l(a,c,f,i,n[h+5],12,1200080426),i=l(i,a,c,f,n[h+6],17,-1473231341),f=l(f,i,a,c,n[h+7],22,-45705983),c=l(c,f,i,a,n[h+8],7,1770035416),a=l(a,c,f,i,n[h+9],12,-1958414417),i=l(i,a,c,f,n[h+10],17,-42063),f=l(f,i,a,c,n[h+11],22,-1990404162),c=l(c,f,i,a,n[h+12],7,1804603682),a=l(a,c,f,i,n[h+13],12,-40341101),i=l(i,a,c,f,n[h+14],17,-1502002290),c=v(c,f=l(f,i,a,c,n[h+15],22,1236535329),i,a,n[h+1],5,-165796510),a=v(a,c,f,i,n[h+6],9,-1069501632),i=v(i,a,c,f,n[h+11],14,643717713),f=v(f,i,a,c,n[h],20,-373897302),c=v(c,f,i,a,n[h+5],5,-701558691),a=v(a,c,f,i,n[h+10],9,38016083),i=v(i,a,c,f,n[h+15],14,-660478335),f=v(f,i,a,c,n[h+4],20,-405537848),c=v(c,f,i,a,n[h+9],5,568446438),a=v(a,c,f,i,n[h+14],9,-1019803690),i=v(i,a,c,f,n[h+3],14,-187363961),f=v(f,i,a,c,n[h+8],20,1163531501),c=v(c,f,i,a,n[h+13],5,-1444681467),a=v(a,c,f,i,n[h+2],9,-51403784),i=v(i,a,c,f,n[h+7],14,1735328473),c=g(c,f=v(f,i,a,c,n[h+12],20,-1926607734),i,a,n[h+5],4,-378558),a=g(a,c,f,i,n[h+8],11,-2022574463),i=g(i,a,c,f,n[h+11],16,1839030562),f=g(f,i,a,c,n[h+14],23,-35309556),c=g(c,f,i,a,n[h+1],4,-1530992060),a=g(a,c,f,i,n[h+4],11,1272893353),i=g(i,a,c,f,n[h+7],16,-155497632),f=g(f,i,a,c,n[h+10],23,-1094730640),c=g(c,f,i,a,n[h+13],4,681279174),a=g(a,c,f,i,n[h],11,-358537222),i=g(i,a,c,f,n[h+3],16,-722521979),f=g(f,i,a,c,n[h+6],23,76029189),c=g(c,f,i,a,n[h+9],4,-640364487),a=g(a,c,f,i,n[h+12],11,-421815835),i=g(i,a,c,f,n[h+15],16,530742520),c=m(c,f=g(f,i,a,c,n[h+2],23,-995338651),i,a,n[h],6,-198630844),a=m(a,c,f,i,n[h+7],10,1126891415),i=m(i,a,c,f,n[h+14],15,-1416354905),f=m(f,i,a,c,n[h+5],21,-57434055),c=m(c,f,i,a,n[h+12],6,1700485571),a=m(a,c,f,i,n[h+3],10,-1894986606),i=m(i,a,c,f,n[h+10],15,-1051523),f=m(f,i,a,c,n[h+1],21,-2054922799),c=m(c,f,i,a,n[h+8],6,1873313359),a=m(a,c,f,i,n[h+15],10,-30611744),i=m(i,a,c,f,n[h+6],15,-1560198380),f=m(f,i,a,c,n[h+13],21,1309151649),c=m(c,f,i,a,n[h+4],6,-145523070),a=m(a,c,f,i,n[h+11],10,-1120210379),i=m(i,a,c,f,n[h+2],15,718787259),f=m(f,i,a,c,n[h+9],21,-343485551),c=d(c,r),f=d(f,e),i=d(i,o),a=d(a,u);return[c,f,i,a]}function a(n){for(var t="",r=32*n.length,e=0;e<r;e+=8)t+=String.fromCharCode(n[e>>5]>>>e%32&255);return t}function h(n){var t=[];for(t[(n.length>>2)-1]=void 0,e=0;e<t.length;e+=1)t[e]=0;for(var r=8*n.length,e=0;e<r;e+=8)t[e>>5]|=(255&n.charCodeAt(e/8))<<e%32;return t}function e(n){for(var t,r="0123456789abcdef",e="",o=0;o<n.length;o+=1)t=n.charCodeAt(o),e+=r.charAt(t>>>4&15)+r.charAt(15&t);return e}function r(n){return unescape(encodeURIComponent(n))}function o(n){return a(i(h(t=r(n)),8*t.length));var t}function u(n,t){return function(n,t){var r,e,o=h(n),u=[],c=[];for(u[15]=c[15]=void 0,16<o.length&&(o=i(o,8*n.length)),r=0;r<16;r+=1)u[r]=909522486^o[r],c[r]=1549556828^o[r];return e=i(u.concat(h(t)),512+8*t.length),a(i(c.concat(e),640))}(r(n),r(t))}function t(n,t,r){return t?r?u(t,n):e(u(t,n)):r?o(n):e(o(n))}"function"==typeof define&&define.amd?define(function(){return t}):"object"==typeof module&&module.exports?module.exports=t:n.md5=t}(this);</script><script>window.AbTest = (function() { return { 'ab_test': (uniqueId, test_name, buckets) => { let override = new URLSearchParams(window.location.search).get(`ab_test[${test_name}]`); if ( override ) { return override; } const bucketNames = buckets.map((bucket) => { return typeof bucket === 'string' ? bucket : Object.keys(bucket)[0]; }); const weights = buckets.map((bucket) => { return typeof bucket === 'string' ? 1 : Object.values(bucket)[0]; }); const total = weights.reduce((sum, weight) => sum + weight); const hash = md5(`${uniqueId}${test_name}`); const hashNum = parseInt(hash.slice(-12), 16); let bucketPoint = total * (hashNum % 100000) / 100000; const bucket = bucketNames.find((_, i) => { if (weights[i] > bucketPoint) { return true; } bucketPoint -= weights[i]; return false; }); return bucket; } }; })();</script><div data-auto_select="false" data-client_id="331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b" data-landing_url="https://www.academia.edu/Documents/in/Affine_Transformation" data-login_uri="https://www.academia.edu/registrations/google_one_tap" data-moment_callback="onGoogleOneTapEvent" id="g_id_onload"></div><script>function onGoogleOneTapEvent(event) { var momentType = event.getMomentType(); var momentReason = null; if (event.isNotDisplayed()) { momentReason = event.getNotDisplayedReason(); } else if (event.isSkippedMoment()) { momentReason = event.getSkippedReason(); } else if (event.isDismissedMoment()) { momentReason = event.getDismissedReason(); } Aedu.arbitraryEvents.write('GoogleOneTapEvent', { moment_type: momentType, moment_reason: momentReason, }); }</script><script>(function() { var auvid = unescape( document.cookie .split(/; ?/) .find((s) => s.startsWith('auvid')) .substring(6)); var bucket = AbTest.ab_test(auvid, 'lo_ri_one_tap_google_sign_on', ['control', 'one_tap_google_sign_on']); if (bucket === 'control') return; var oneTapTag = document.createElement('script') oneTapTag.async = true oneTapTag.defer = true oneTapTag.src = 'https://accounts.google.com/gsi/client' document.body.appendChild(oneTapTag) })();</script></div></div></div> </div> <div class="bootstrap login"><div class="modal fade login-modal" id="login-modal"><div class="login-modal-dialog modal-dialog"><div class="modal-content"><div class="modal-header"><button class="close close" data-dismiss="modal" type="button"><span aria-hidden="true">×</span><span class="sr-only">Close</span></button><h4 class="modal-title text-center"><strong>Log In</strong></h4></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><button class="btn btn-fb btn-lg btn-block btn-v-center-content" id="login-facebook-oauth-button"><svg style="float: left; width: 19px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="facebook-square" class="svg-inline--fa fa-facebook-square fa-w-14" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><path fill="currentColor" d="M400 32H48A48 48 0 0 0 0 80v352a48 48 0 0 0 48 48h137.25V327.69h-63V256h63v-54.64c0-62.15 37-96.48 93.67-96.48 27.14 0 55.52 4.84 55.52 4.84v61h-31.27c-30.81 0-40.42 19.12-40.42 38.73V256h68.78l-11 71.69h-57.78V480H400a48 48 0 0 0 48-48V80a48 48 0 0 0-48-48z"></path></svg><small><strong>Log in</strong> with <strong>Facebook</strong></small></button><br /><button class="btn btn-google btn-lg btn-block btn-v-center-content" id="login-google-oauth-button"><svg style="float: left; width: 22px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="google-plus" class="svg-inline--fa fa-google-plus fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M256,8C119.1,8,8,119.1,8,256S119.1,504,256,504,504,392.9,504,256,392.9,8,256,8ZM185.3,380a124,124,0,0,1,0-248c31.3,0,60.1,11,83,32.3l-33.6,32.6c-13.2-12.9-31.3-19.1-49.4-19.1-42.9,0-77.2,35.5-77.2,78.1S142.3,334,185.3,334c32.6,0,64.9-19.1,70.1-53.3H185.3V238.1H302.2a109.2,109.2,0,0,1,1.9,20.7c0,70.8-47.5,121.2-118.8,121.2ZM415.5,273.8v35.5H380V273.8H344.5V238.3H380V202.8h35.5v35.5h35.2v35.5Z"></path></svg><small><strong>Log in</strong> with <strong>Google</strong></small></button><br /><style type="text/css">.sign-in-with-apple-button { width: 100%; height: 52px; border-radius: 3px; border: 1px solid black; cursor: pointer; }</style><script src="https://appleid.cdn-apple.com/appleauth/static/jsapi/appleid/1/en_US/appleid.auth.js" type="text/javascript"></script><div class="sign-in-with-apple-button" data-border="false" data-color="white" id="appleid-signin"><span   ="Sign Up with Apple" class="u-fs11"></span></div><script>AppleID.auth.init({ clientId: 'edu.academia.applesignon', scope: 'name email', redirectURI: 'https://www.academia.edu/sessions', state: "e94abf5ed7cb3a91515fabd6b19c4facef888650139f6133aa5e859488024f7e", });</script><script>// Hacky way of checking if on fast loswp if (window.loswp == null) { (function() { const Google = window?.Aedu?.Auth?.OauthButton?.Login?.Google; const Facebook = window?.Aedu?.Auth?.OauthButton?.Login?.Facebook; if (Google) { new Google({ el: '#login-google-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } if (Facebook) { new Facebook({ el: '#login-facebook-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } })(); }</script></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><div class="hr-heading login-hr-heading"><span class="hr-heading-text">or</span></div></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><form class="js-login-form" action="https://www.academia.edu/sessions" accept-charset="UTF-8" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><input type="hidden" name="authenticity_token" value="x7y5bKlB+lkiCVtS0srJjEh2gkO6xXkwV+KqU3P2fLTmpBDTTSWmBUWFdHpxLK1ycCxWKxBJHymYMvor5uYNpQ==" autocomplete="off" /><div class="form-group"><label class="control-label" for="login-modal-email-input" style="font-size: 14px;">Email</label><input class="form-control" id="login-modal-email-input" name="login" type="email" /></div><div class="form-group"><label class="control-label" for="login-modal-password-input" style="font-size: 14px;">Password</label><input class="form-control" id="login-modal-password-input" name="password" type="password" /></div><input type="hidden" name="post_login_redirect_url" id="post_login_redirect_url" value="https://www.academia.edu/Documents/in/Affine_Transformation" autocomplete="off" /><div class="checkbox"><label><input type="checkbox" name="remember_me" id="remember_me" value="1" checked="checked" /><small style="font-size: 12px; margin-top: 2px; display: inline-block;">Remember me on this computer</small></label></div><br><input type="submit" name="commit" value="Log In" class="btn btn-primary btn-block btn-lg js-login-submit" data-disable-with="Log In" /></br></form><script>typeof window?.Aedu?.recaptchaManagedForm === 'function' && window.Aedu.recaptchaManagedForm( document.querySelector('.js-login-form'), document.querySelector('.js-login-submit') );</script><small style="font-size: 12px;"><br />or <a data-target="#login-modal-reset-password-container" data-toggle="collapse" href="javascript:void(0)">reset password</a></small><div class="collapse" id="login-modal-reset-password-container"><br /><div class="well margin-0x"><form class="js-password-reset-form" action="https://www.academia.edu/reset_password" accept-charset="UTF-8" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><input type="hidden" name="authenticity_token" value="q6/QTMTRyqcj8GGE9jYDo0IbDzDUP1LPojN9h6PWEkWKt3nzILWW+0R8TqxV0GddekHbWH6zNNZt4y3/NsZjVA==" autocomplete="off" /><p>Enter the email address you signed up with and we'll email you a reset link.</p><div class="form-group"><input class="form-control" name="email" type="email" /></div><script src="https://recaptcha.net/recaptcha/api.js" async defer></script> <script> var invisibleRecaptchaSubmit = function () { var closestForm = function (ele) { var curEle = ele.parentNode; while (curEle.nodeName !== 'FORM' && curEle.nodeName !== 'BODY'){ curEle = curEle.parentNode; } return curEle.nodeName === 'FORM' ? curEle : null }; var eles = document.getElementsByClassName('g-recaptcha'); if (eles.length > 0) { var form = closestForm(eles[0]); if (form) { form.submit(); } } }; </script> <input type="submit" data-sitekey="6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj" data-callback="invisibleRecaptchaSubmit" class="g-recaptcha btn btn-primary btn-block" value="Email me a link" value=""/> </form></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/collapse-45805421cf446ca5adf7aaa1935b08a3a8d1d9a6cc5d91a62a2a3a00b20b3e6a.js"], function() { // from javascript_helper.rb $("#login-modal-reset-password-container").on("shown.bs.collapse", function() { $(this).find("input[type=email]").focus(); }); }); </script> </div></div></div><div class="modal-footer"><div class="text-center"><small style="font-size: 12px;">Need an account? <a rel="nofollow" href="https://www.academia.edu/signup">Click here to sign up</a></small></div></div></div></div></div></div><script>// If we are on subdomain or non-bootstrapped page, redirect to login page instead of showing modal (function(){ if (typeof $ === 'undefined') return; var host = window.location.hostname; if ((host === $domain || host === "www."+$domain) && (typeof $().modal === 'function')) { $("#nav_log_in").click(function(e) { // Don't follow the link and open the modal e.preventDefault(); $("#login-modal").on('shown.bs.modal', function() { $(this).find("#login-modal-email-input").focus() }).modal('show'); }); } })()</script> <div class="bootstrap" id="footer"><div class="footer-content clearfix text-center padding-top-7x" style="width:100%;"><ul class="footer-links-secondary footer-links-wide list-inline margin-bottom-1x"><li><a href="https://www.academia.edu/about">About</a></li><li><a href="https://www.academia.edu/press">Press</a></li><li><a rel="nofollow" href="https://medium.com/academia">Blog</a></li><li><a href="https://www.academia.edu/documents">Papers</a></li><li><a href="https://www.academia.edu/topics">Topics</a></li><li><a href="https://www.academia.edu/journals">Academia.edu Journals</a></li><li><a rel="nofollow" href="https://www.academia.edu/hiring"><svg style="width: 13px; height: 13px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="briefcase" class="svg-inline--fa fa-briefcase fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M320 336c0 8.84-7.16 16-16 16h-96c-8.84 0-16-7.16-16-16v-48H0v144c0 25.6 22.4 48 48 48h416c25.6 0 48-22.4 48-48V288H320v48zm144-208h-80V80c0-25.6-22.4-48-48-48H176c-25.6 0-48 22.4-48 48v48H48c-25.6 0-48 22.4-48 48v80h512v-80c0-25.6-22.4-48-48-48zm-144 0H192V96h128v32z"></path></svg> <strong>We're Hiring!</strong></a></li><li><a rel="nofollow" href="https://support.academia.edu/"><svg style="width: 12px; height: 12px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="question-circle" class="svg-inline--fa fa-question-circle fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M504 256c0 136.997-111.043 248-248 248S8 392.997 8 256C8 119.083 119.043 8 256 8s248 111.083 248 248zM262.655 90c-54.497 0-89.255 22.957-116.549 63.758-3.536 5.286-2.353 12.415 2.715 16.258l34.699 26.31c5.205 3.947 12.621 3.008 16.665-2.122 17.864-22.658 30.113-35.797 57.303-35.797 20.429 0 45.698 13.148 45.698 32.958 0 14.976-12.363 22.667-32.534 33.976C247.128 238.528 216 254.941 216 296v4c0 6.627 5.373 12 12 12h56c6.627 0 12-5.373 12-12v-1.333c0-28.462 83.186-29.647 83.186-106.667 0-58.002-60.165-102-116.531-102zM256 338c-25.365 0-46 20.635-46 46 0 25.364 20.635 46 46 46s46-20.636 46-46c0-25.365-20.635-46-46-46z"></path></svg> <strong>Help Center</strong></a></li></ul><ul class="footer-links-tertiary list-inline margin-bottom-1x"><li class="small">Find new research papers in:</li><li class="small"><a href="https://www.academia.edu/Documents/in/Physics">Physics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Chemistry">Chemistry</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Biology">Biology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Health_Sciences">Health Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Ecology">Ecology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Earth_Sciences">Earth Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Mathematics">Mathematics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a></li></ul></div></div><div class="DesignSystem" id="credit" style="width:100%;"><ul class="u-pl0x footer-links-legal list-inline"><li><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li>Academia ©2024</li></ul></div><script> //<![CDATA[ window.detect_gmtoffset = true; window.Academia && window.Academia.set_gmtoffset && Academia.set_gmtoffset('/gmtoffset'); //]]> </script> <div id='overlay_background'></div> <div id='bootstrap-modal-container' class='bootstrap'></div> <div id='ds-modal-container' class='bootstrap DesignSystem'></div> <div id='full-screen-modal'></div> </div> </body> </html>