CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: bilinear interpolation</title> <meta name="description" content="Search results for: bilinear interpolation"> <meta name="keywords" content="bilinear interpolation"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="bilinear interpolation" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="bilinear interpolation"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 216</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: bilinear interpolation</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">216</span> Sub-Pixel Mapping Based on New Mixed Interpolation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zeyu%20Zhou">Zeyu Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaojun%20Bi"> Xiaojun Bi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to the limited environmental parameters and the limited resolution of the sensor, the universal existence of the mixed pixels in the process of remote sensing images restricts the spatial resolution of the remote sensing images. Sub-pixel mapping technology can effectively improve the spatial resolution. As the bilinear interpolation algorithm inevitably produces the edge blur effect, which leads to the inaccurate sub-pixel mapping results. In order to avoid the edge blur effect that affects the sub-pixel mapping results in the interpolation process, this paper presents a new edge-directed interpolation algorithm which uses the covariance adaptive interpolation algorithm on the edge of the low-resolution image and uses bilinear interpolation algorithm in the low-resolution image smooth area. By using the edge-directed interpolation algorithm, the super-resolution of the image with low resolution is obtained, and we get the percentage of each sub-pixel under a certain type of high-resolution image. Then we rely on the probability value as a soft attribute estimate and carry out sub-pixel scale under the ‘hard classification’. Finally, we get the result of sub-pixel mapping. Through the experiment, we compare the algorithm and the bilinear algorithm given in this paper to the results of the sub-pixel mapping method. It is found that the sub-pixel mapping method based on the edge-directed interpolation algorithm has better edge effect and higher mapping accuracy. The results of the paper meet our original intention of the question. At the same time, the method does not require iterative computation and training of samples, making it easier to implement. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=remote%20sensing%20images" title="remote sensing images">remote sensing images</a>, <a href="https://publications.waset.org/abstracts/search?q=sub-pixel%20mapping" title=" sub-pixel mapping"> sub-pixel mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=bilinear%20interpolation" title=" bilinear interpolation"> bilinear interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=edge-directed%20interpolation" title=" edge-directed interpolation"> edge-directed interpolation</a> </p> <a href="https://publications.waset.org/abstracts/77883/sub-pixel-mapping-based-on-new-mixed-interpolation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77883.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">229</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">215</span> Identification of Classes of Bilinear Time Series Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anthony%20Usoro">Anthony Usoro</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, two classes of bilinear time series model are obtained under certain conditions from the general bilinear autoregressive moving average model. Bilinear Autoregressive (BAR) and Bilinear Moving Average (BMA) Models have been identified. From the general bilinear model, BAR and BMA models have been proved to exist for q = Q = 0, => j = 0, and p = P = 0, => i = 0 respectively. These models are found useful in modelling most of the economic and financial data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autoregressive%20model" title="autoregressive model">autoregressive model</a>, <a href="https://publications.waset.org/abstracts/search?q=bilinear%20autoregressive%20model" title=" bilinear autoregressive model"> bilinear autoregressive model</a>, <a href="https://publications.waset.org/abstracts/search?q=bilinear%20moving%20average%20model" title=" bilinear moving average model"> bilinear moving average model</a>, <a href="https://publications.waset.org/abstracts/search?q=moving%20average%20model" title=" moving average model"> moving average model</a> </p> <a href="https://publications.waset.org/abstracts/56430/identification-of-classes-of-bilinear-time-series-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56430.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">407</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">214</span> An Algorithm to Compute the State Estimation of a Bilinear Dynamical Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Eqal%20Al%20Mazrooei">Abdullah Eqal Al Mazrooei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we introduce a mathematical algorithm which is used for estimating the states in the bilinear systems. This algorithm uses a special linearization of the second-order term by using the best available information about the state of the system. This technique makes our algorithm generalizes the well-known Kalman estimators. The system which is used here is of the bilinear class, the evolution of this model is linear-bilinear in the state of the system. Our algorithm can be used with linear and bilinear systems. We also here introduced a real application for the new algorithm to prove the feasibility and the efficiency for it. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=estimation%20algorithm" title="estimation algorithm">estimation algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=bilinear%20systems" title=" bilinear systems"> bilinear systems</a>, <a href="https://publications.waset.org/abstracts/search?q=Kakman%20filter" title=" Kakman filter"> Kakman filter</a>, <a href="https://publications.waset.org/abstracts/search?q=second%20order%20linearization" title=" second order linearization"> second order linearization</a> </p> <a href="https://publications.waset.org/abstracts/51466/an-algorithm-to-compute-the-state-estimation-of-a-bilinear-dynamical-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51466.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">486</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">213</span> Kalman Filter for Bilinear Systems with Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20E.%20Al-Mazrooei">Abdullah E. Al-Mazrooei </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a new kind of the bilinear systems in the form of state space model. The evolution of this system depends on the product of state vector by its self. The well known Lotak Volterra and Lorenz models are special cases of this new model. We also present here a generalization of Kalman filter which is suitable to work with the new bilinear model. An application to real measurements is introduced to illustrate the efficiency of the proposed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bilinear%20systems" title="bilinear systems">bilinear systems</a>, <a href="https://publications.waset.org/abstracts/search?q=state%20space%20model" title=" state space model"> state space model</a>, <a href="https://publications.waset.org/abstracts/search?q=Kalman%20filter" title=" Kalman filter"> Kalman filter</a>, <a href="https://publications.waset.org/abstracts/search?q=application" title=" application"> application</a>, <a href="https://publications.waset.org/abstracts/search?q=models" title=" models"> models</a> </p> <a href="https://publications.waset.org/abstracts/3737/kalman-filter-for-bilinear-systems-with-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3737.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">441</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">212</span> The Implementation of Secton Method for Finding the Root of Interpolation Function</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nur%20Rokhman">Nur Rokhman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A mathematical function gives relationship between the variables composing the function. Interpolation can be viewed as a process of finding mathematical function which goes through some specified points. There are many interpolation methods, namely: Lagrange method, Newton method, Spline method etc. For some specific condition, such as, big amount of interpolation points, the interpolation function can not be written explicitly. This such function consist of computational steps. The solution of equations involving the interpolation function is a problem of solution of non linear equation. Newton method will not work on the interpolation function, for the derivative of the interpolation function cannot be written explicitly. This paper shows the use of Secton method to determine the numerical solution of the function involving the interpolation function. The experiment shows the fact that Secton method works better than Newton method in finding the root of Lagrange interpolation function. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Secton%20method" title="Secton method">Secton method</a>, <a href="https://publications.waset.org/abstracts/search?q=interpolation" title=" interpolation"> interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=non%20linear%20function" title=" non linear function"> non linear function</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20solution" title=" numerical solution"> numerical solution</a> </p> <a href="https://publications.waset.org/abstracts/1837/the-implementation-of-secton-method-for-finding-the-root-of-interpolation-function" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1837.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">379</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">211</span> Overview of Adaptive Spline interpolation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rongli%20Gai">Rongli Gai</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhiyuan%20Chang"> Zhiyuan Chang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> At this stage, in view of various situations in the interpolation process, most researchers use self-adaptation to adjust the interpolation process, which is also one of the current and future research hotspots in the field of CNC machining. In the interpolation process, according to the overview of the spline curve interpolation algorithm, the adaptive analysis is carried out from the factors affecting the interpolation process. The adaptive operation is reflected in various aspects, such as speed, parameters, errors, nodes, feed rates, random Period, sensitive point, step size, curvature, adaptive segmentation, adaptive optimization, etc. This paper will analyze and summarize the research of adaptive imputation in the direction of the above factors affecting imputation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20algorithm" title="adaptive algorithm">adaptive algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=CNC%20machining" title=" CNC machining"> CNC machining</a>, <a href="https://publications.waset.org/abstracts/search?q=interpolation%20constraints" title=" interpolation constraints"> interpolation constraints</a>, <a href="https://publications.waset.org/abstracts/search?q=spline%20curve%20interpolation" title=" spline curve interpolation"> spline curve interpolation</a> </p> <a href="https://publications.waset.org/abstracts/147139/overview-of-adaptive-spline-interpolation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147139.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">205</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">210</span> Exact and Approximate Controllability of Nuclear Dynamics Using Bilinear Controls</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ramdas%20Sonawane">Ramdas Sonawane</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahaveer%20Gadiya"> Mahaveer Gadiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The control problem associated with nuclear dynamics is represented by nonlinear integro-differential equation with additive controls. To control chain reaction, certain amount of neutrons is added into (or withdrawn out of) chamber as and when required. It is not realistic. So, we can think of controlling the reactor dynamics by bilinear control, which enters the system as coefficient of state. In this paper, we study the approximate and exact controllability of parabolic integro-differential equation controlled by bilinear control with non-homogeneous boundary conditions in bounded domain. We prove the existence of control and propose an explicit control strategy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20control" title="approximate control">approximate control</a>, <a href="https://publications.waset.org/abstracts/search?q=exact%20control" title=" exact control"> exact control</a>, <a href="https://publications.waset.org/abstracts/search?q=bilinear%20control" title=" bilinear control"> bilinear control</a>, <a href="https://publications.waset.org/abstracts/search?q=nuclear%20dynamics" title=" nuclear dynamics"> nuclear dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=integro-differential%20equations" title=" integro-differential equations"> integro-differential equations</a> </p> <a href="https://publications.waset.org/abstracts/58619/exact-and-approximate-controllability-of-nuclear-dynamics-using-bilinear-controls" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58619.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">444</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">209</span> On Hankel Matrices Approach to Interpolation Problem in Infinite and Finite Fields</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ivan%20Baravy">Ivan Baravy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Interpolation problem, as it was initially posed in terms of polynomials, is well researched. However, further mathematical developments extended it significantly. Trigonometric interpolation is widely used in Fourier analysis, while its generalized representation as exponential interpolation is applicable to such problem of mathematical physics as modelling of Ziegler-Biersack-Littmark repulsive interatomic potentials. Formulated for finite fields, this problem arises in decoding Reed--Solomon codes. This paper shows the relation between different interpretations of the problem through the class of matrices of special structure - Hankel matrices. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Berlekamp-Massey%20algorithm" title="Berlekamp-Massey algorithm">Berlekamp-Massey algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=exponential%20interpolation" title=" exponential interpolation"> exponential interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20fields" title=" finite fields"> finite fields</a>, <a href="https://publications.waset.org/abstracts/search?q=Hankel%20matrices" title=" Hankel matrices"> Hankel matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=Hankel%20polynomials" title=" Hankel polynomials"> Hankel polynomials</a> </p> <a href="https://publications.waset.org/abstracts/21861/on-hankel-matrices-approach-to-interpolation-problem-in-infinite-and-finite-fields" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21861.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">521</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">208</span> Evaluation of Spatial Distribution Prediction for Site-Scale Soil Contaminants Based on Partition Interpolation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pengwei%20Qiao">Pengwei Qiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Sucai%20Yang"> Sucai Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Wenxia%20Wei"> Wenxia Wei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Soil pollution has become an important issue in China. Accurate spatial distribution prediction of pollutants with interpolation methods is the basis for soil remediation in the site. However, a relatively strong variability of pollutants would decrease the prediction accuracy. Theoretically, partition interpolation can result in accurate prediction results. In order to verify the applicability of partition interpolation for a site, benzo (b) fluoranthene (BbF) in four soil layers was adopted as the research object in this paper. IDW (inverse distance weighting)-, RBF (radial basis function)-and OK (ordinary kriging)-based partition interpolation accuracies were evaluated, and their influential factors were analyzed; then, the uncertainty and applicability of partition interpolation were determined. Three conclusions were drawn. (1) The prediction error of partitioned interpolation decreased by 70% compared to unpartitioned interpolation. (2) Partition interpolation reduced the impact of high CV (coefficient of variation) and high concentration value on the prediction accuracy. (3) The prediction accuracy of IDW-based partition interpolation was higher than that of RBF- and OK-based partition interpolation, and it was suitable for the identification of highly polluted areas at a contaminated site. These results provide a useful method to obtain relatively accurate spatial distribution information of pollutants and to identify highly polluted areas, which is important for soil pollution remediation in the site. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accuracy" title="accuracy">accuracy</a>, <a href="https://publications.waset.org/abstracts/search?q=applicability" title=" applicability"> applicability</a>, <a href="https://publications.waset.org/abstracts/search?q=partition%20interpolation" title=" partition interpolation"> partition interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=site" title=" site"> site</a>, <a href="https://publications.waset.org/abstracts/search?q=soil%20pollution" title=" soil pollution"> soil pollution</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertainty" title=" uncertainty"> uncertainty</a> </p> <a href="https://publications.waset.org/abstracts/110125/evaluation-of-spatial-distribution-prediction-for-site-scale-soil-contaminants-based-on-partition-interpolation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110125.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">145</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">207</span> Node Insertion in Coalescence Hidden-Variable Fractal Interpolation Surface</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Srijanani%20Anurag%20Prasad">Srijanani Anurag Prasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Coalescence Hidden-variable Fractal Interpolation Surface (CHFIS) was built by combining interpolation data from the Iterated Function System (IFS). The interpolation data in a CHFIS comprises a row and/or column of uncertain values when a single point is entered. Alternatively, a row and/or column of additional points are placed in the given interpolation data to demonstrate the node added CHFIS. There are three techniques for inserting new points that correspond to the row and/or column of nodes inserted, and each method is further classified into four types based on the values of the inserted nodes. As a result, numerous forms of node insertion can be found in a CHFIS. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fractal" title="fractal">fractal</a>, <a href="https://publications.waset.org/abstracts/search?q=interpolation" title=" interpolation"> interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=iterated%20function%20system" title=" iterated function system"> iterated function system</a>, <a href="https://publications.waset.org/abstracts/search?q=coalescence" title=" coalescence"> coalescence</a>, <a href="https://publications.waset.org/abstracts/search?q=node%20insertion" title=" node insertion"> node insertion</a>, <a href="https://publications.waset.org/abstracts/search?q=knot%20insertion" title=" knot insertion"> knot insertion</a> </p> <a href="https://publications.waset.org/abstracts/148593/node-insertion-in-coalescence-hidden-variable-fractal-interpolation-surface" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148593.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">100</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">206</span> Pattern Recognition Search: An Advancement Over Interpolation Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shahpar%20Yilmaz">Shahpar Yilmaz</a>, <a href="https://publications.waset.org/abstracts/search?q=Yasir%20Nadeem"> Yasir Nadeem</a>, <a href="https://publications.waset.org/abstracts/search?q=Syed%20A.%20Mehdi"> Syed A. Mehdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Searching for a record in a dataset is always a frequent task for any data structure-related application. Hence, a fast and efficient algorithm for the approach has its importance in yielding the quickest results and enhancing the overall productivity of the company. Interpolation search is one such technique used to search through a sorted set of elements. This paper proposes a new algorithm, an advancement over interpolation search for the application of search over a sorted array. Pattern Recognition Search or PR Search (PRS), like interpolation search, is a pattern-based divide and conquer algorithm whose objective is to reduce the sample size in order to quicken the process and it does so by treating the array as a perfect arithmetic progression series and thereby deducing the key element’s position. We look to highlight some of the key drawbacks of interpolation search, which are accounted for in the Pattern Recognition Search. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=array" title="array">array</a>, <a href="https://publications.waset.org/abstracts/search?q=complexity" title=" complexity"> complexity</a>, <a href="https://publications.waset.org/abstracts/search?q=index" title=" index"> index</a>, <a href="https://publications.waset.org/abstracts/search?q=sorting" title=" sorting"> sorting</a>, <a href="https://publications.waset.org/abstracts/search?q=space" title=" space"> space</a>, <a href="https://publications.waset.org/abstracts/search?q=time" title=" time"> time</a> </p> <a href="https://publications.waset.org/abstracts/142819/pattern-recognition-search-an-advancement-over-interpolation-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142819.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">243</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">205</span> Infinite Impulse Response Digital Filters Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Phuoc%20Si%20Nguyen">Phuoc Si Nguyen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Infinite impulse response (IIR) filters can be designed from an analogue low pass prototype by using frequency transformation in the s-domain and bilinear z-transformation with pre-warping frequency; this method is known as frequency transformation from the s-domain to the z-domain. This paper will introduce a new method to transform an IIR digital filter to another type of IIR digital filter (low pass, high pass, band pass, band stop or narrow band) using a technique based on inverse bilinear z-transformation and inverse matrices. First, a matrix equation is derived from inverse bilinear z-transformation and Pascal’s triangle. This Low Pass Digital to Digital Filter Pascal Matrix Equation is used to transform a low pass digital filter to other digital filter types. From this equation and the inverse matrix, a Digital to Digital Filter Pascal Matrix Equation can be derived that is able to transform any IIR digital filter. This paper will also introduce some specific matrices to replace the inverse matrix, which is difficult to determine due to the larger size of the matrix in the current method. This will make computing and hand calculation easier when transforming from one IIR digital filter to another in the digital domain. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bilinear%20z-transformation" title="bilinear z-transformation">bilinear z-transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=frequency%20transformation" title=" frequency transformation"> frequency transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20bilinear%20z-transformation" title=" inverse bilinear z-transformation"> inverse bilinear z-transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=IIR%20digital%20filters" title=" IIR digital filters"> IIR digital filters</a> </p> <a href="https://publications.waset.org/abstracts/48777/infinite-impulse-response-digital-filters-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48777.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">423</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">204</span> A Nonlinear Dynamical System with Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Eqal%20Al%20Mazrooei">Abdullah Eqal Al Mazrooei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a nonlinear dynamical system is presented. This system is a bilinear class. The bilinear systems are very important kind of nonlinear systems because they have many applications in real life. They are used in biology, chemistry, manufacturing, engineering, and economics where linear models are ineffective or inadequate. They have also been recently used to analyze and forecast weather conditions. Bilinear systems have three advantages: First, they define many problems which have a great applied importance. Second, they give us approximations to nonlinear systems. Thirdly, they have a rich geometric and algebraic structures, which promises to be a fruitful field of research for scientists and applications. The type of nonlinearity that is treated and analyzed consists of bilinear interaction between the states vectors and the system input. By using some properties of the tensor product, these systems can be transformed to linear systems. But, here we discuss the nonlinearity when the state vector is multiplied by itself. So, this model will be able to handle evolutions according to the Lotka-Volterra models or the Lorenz weather models, thus enabling a wider and more flexible application of such models. Here we apply by using an estimator to estimate temperatures. The results prove the efficiency of the proposed system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lorenz%20models" title="Lorenz models">Lorenz models</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20systems" title=" nonlinear systems"> nonlinear systems</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20estimator" title=" nonlinear estimator"> nonlinear estimator</a>, <a href="https://publications.waset.org/abstracts/search?q=state-space%20model" title=" state-space model"> state-space model</a> </p> <a href="https://publications.waset.org/abstracts/60388/a-nonlinear-dynamical-system-with-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60388.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">254</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">203</span> Blind Data Hiding Technique Using Interpolation of Subsampled Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Singara%20Singh%20Kasana">Singara Singh Kasana</a>, <a href="https://publications.waset.org/abstracts/search?q=Pankaj%20Garg"> Pankaj Garg</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a blind data hiding technique based on interpolation of sub sampled versions of a cover image is proposed. Sub sampled image is taken as a reference image and an interpolated image is generated from this reference image. Then difference between original cover image and interpolated image is used to embed secret data. Comparisons with the existing interpolation based techniques show that proposed technique provides higher embedding capacity and better visual quality marked images. Moreover, the performance of the proposed technique is more stable for different images. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=interpolation" title="interpolation">interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20subsampling" title=" image subsampling"> image subsampling</a>, <a href="https://publications.waset.org/abstracts/search?q=PSNR" title=" PSNR"> PSNR</a>, <a href="https://publications.waset.org/abstracts/search?q=SIM" title=" SIM"> SIM</a> </p> <a href="https://publications.waset.org/abstracts/18926/blind-data-hiding-technique-using-interpolation-of-subsampled-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18926.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">578</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">202</span> Evaluation of High Damping Rubber Considering Initial History through Dynamic Loading Test and Program Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kyeong%20Hoon%20Park">Kyeong Hoon Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Taiji%20Mazuda"> Taiji Mazuda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> High damping rubber (HDR) bearings are dissipating devices mainly used in seismic isolation systems and have a great damping performance. Although many studies have been conducted on the dynamic model of HDR bearings, few models can reflect phenomena such as dependency of experienced shear strain on initial history. In order to develop a model that can represent the dependency of experienced shear strain of HDR by Mullins effect, dynamic loading test was conducted using HDR specimen. The reaction of HDR was measured by applying a horizontal vibration using a hybrid actuator under a constant vertical load. Dynamic program analysis was also performed after dynamic loading test. The dynamic model applied in program analysis is a bilinear type double-target model. This model is modified from typical bilinear model. This model can express the nonlinear characteristics related to the initial history of HDR bearings. Based on the dynamic loading test and program analysis results, equivalent stiffness and equivalent damping ratio were calculated to evaluate the mechanical properties of HDR and the feasibility of the bilinear type double-target model was examined. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=base-isolation" title="base-isolation">base-isolation</a>, <a href="https://publications.waset.org/abstracts/search?q=bilinear%20model" title=" bilinear model"> bilinear model</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20damping%20rubber" title=" high damping rubber"> high damping rubber</a>, <a href="https://publications.waset.org/abstracts/search?q=loading%20test" title=" loading test"> loading test</a> </p> <a href="https://publications.waset.org/abstracts/127258/evaluation-of-high-damping-rubber-considering-initial-history-through-dynamic-loading-test-and-program-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127258.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">123</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">201</span> Frequency Transformation with Pascal Matrix Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Phuoc%20Si%20Nguyen">Phuoc Si Nguyen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Frequency transformation with Pascal matrix equations is a method for transforming an electronic filter (analogue or digital) into another filter. The technique is based on frequency transformation in the s-domain, bilinear z-transform with pre-warping frequency, inverse bilinear transformation and a very useful application of the Pascal’s triangle that simplifies computing and enables calculation by hand when transforming from one filter to another. This paper will introduce two methods to transform a filter into a digital filter: frequency transformation from the s-domain into the z-domain; and frequency transformation in the z-domain. Further, two Pascal matrix equations are derived: an analogue to digital filter Pascal matrix equation and a digital to digital filter Pascal matrix equation. These are used to design a desired digital filter from a given filter. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frequency%20transformation" title="frequency transformation">frequency transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=bilinear%20z-transformation" title=" bilinear z-transformation"> bilinear z-transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=pre-warping%20frequency" title=" pre-warping frequency"> pre-warping frequency</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20filters" title=" digital filters"> digital filters</a>, <a href="https://publications.waset.org/abstracts/search?q=analog%20filters" title=" analog filters"> analog filters</a>, <a href="https://publications.waset.org/abstracts/search?q=pascal%E2%80%99s%20triangle" title=" pascal’s triangle"> pascal’s triangle</a> </p> <a href="https://publications.waset.org/abstracts/34866/frequency-transformation-with-pascal-matrix-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34866.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">549</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">200</span> A Low-Latency Quadratic Extended Domain Modular Multiplier for Bilinear Pairing Based on Non-Least Positive Multiplication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yulong%20Jia">Yulong Jia</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiang%20Zhang"> Xiang Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Ziyuan%20Wu"> Ziyuan Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Shiji%20Hu"> Shiji Hu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The calculation of bilinear pairing is the core of the SM9 algorithm, which relies on the underlying prime domain algorithm and the quadratic extension domain algorithm. Among the field algorithms, modular multiplication operation is the most time-consuming part. Therefore, the underlying modular multiplication algorithm is optimized to maximize the operation speed of bilinear pairings. This paper uses a modular multiplication method based on non-least positive (NLP) combined with Karatsuba and schoolbook multiplication to improve the Montgomery algorithm. At the same time, according to the characteristics of multiplication operation in the quadratic extension domain, a quadratic extension domain FP2-NLP modular multiplication algorithm for bilinear pairings is proposed, which effectively reduces the operation time of modular multiplication in the quadratic extension domain. The sub-expanded domain Fp₂ -NLP modular multiplication algorithm effectively reduces the operation time of modular multiplication under the second-expanded domain. The multiplication unit in the quadratic extension domain is implemented using SMIC55nm process, and two different implementation architectures are designed to cope with different application scenarios. Compared with the existing related literature, The output latency of this design can reach a minimum of 15 cycles. The shortest time for calculating the (AB+CD)r⁻¹ mod form is 37.5ns, and the comprehensive area-time product (AT) is 11400. The final R-ate pairing algorithm hardware accelerator consumes 2670k equivalent logic gates and 1.8ms computing time in 55nm process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sm9" title="sm9">sm9</a>, <a href="https://publications.waset.org/abstracts/search?q=hardware" title=" hardware"> hardware</a>, <a href="https://publications.waset.org/abstracts/search?q=NLP" title=" NLP"> NLP</a>, <a href="https://publications.waset.org/abstracts/search?q=Montgomery" title=" Montgomery"> Montgomery</a> </p> <a href="https://publications.waset.org/abstracts/194787/a-low-latency-quadratic-extended-domain-modular-multiplier-for-bilinear-pairing-based-on-non-least-positive-multiplication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/194787.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">7</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">199</span> Increasing the Apparent Time Resolution of Tc-99m Diethylenetriamine Pentaacetic Acid Galactosyl Human Serum Albumin Dynamic SPECT by Use of an 180-Degree Interpolation Method </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yasuyuki%20Takahashi">Yasuyuki Takahashi</a>, <a href="https://publications.waset.org/abstracts/search?q=Maya%20Yamashita"> Maya Yamashita</a>, <a href="https://publications.waset.org/abstracts/search?q=Kyoko%20Saito"> Kyoko Saito</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In general, dynamic SPECT data acquisition needs a few minutes for one rotation. Thus, the time-activity curve (TAC) derived from the dynamic SPECT is relatively coarse. In order to effectively shorten the interval, between data points, we adopted a 180-degree interpolation method. This method is already used for reconstruction of the X-ray CT data. In this study, we applied this 180-degree interpolation method to SPECT and investigated its effectiveness.To briefly describe the 180-degree interpolation method: the 180-degree data in the second half of one rotation are combined with the 180-degree data in the first half of the next rotation to generate a 360-degree data set appropriate for the time halfway between the first and second rotations. In both a phantom and a patient study, the data points from the interpolated images fell in good agreement with the data points tracking the accumulation of 99mTc activity over time for appropriate region of interest. We conclude that data derived from interpolated images improves the apparent time resolution of dynamic SPECT. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20SPECT" title="dynamic SPECT">dynamic SPECT</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20resolution" title=" time resolution"> time resolution</a>, <a href="https://publications.waset.org/abstracts/search?q=180-degree%20interpolation%20method" title=" 180-degree interpolation method"> 180-degree interpolation method</a>, <a href="https://publications.waset.org/abstracts/search?q=99mTc-GSA." title=" 99mTc-GSA."> 99mTc-GSA.</a> </p> <a href="https://publications.waset.org/abstracts/12762/increasing-the-apparent-time-resolution-of-tc-99m-diethylenetriamine-pentaacetic-acid-galactosyl-human-serum-albumin-dynamic-spect-by-use-of-an-180-degree-interpolation-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12762.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">493</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">198</span> Spatial Interpolation Technique for the Optimisation of Geometric Programming Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Debjani%20Chakraborty">Debjani Chakraborty</a>, <a href="https://publications.waset.org/abstracts/search?q=Abhijit%20Chatterjee"> Abhijit Chatterjee</a>, <a href="https://publications.waset.org/abstracts/search?q=Aishwaryaprajna"> Aishwaryaprajna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Posynomials, a special type of polynomials, having singularities, pose difficulties while solving geometric programming problems. In this paper, a methodology has been proposed and used to obtain extreme values for geometric programming problems by nth degree polynomial interpolation technique. Here the main idea to optimise the posynomial is to fit a best polynomial which has continuous gradient values throughout the range of the function. The approximating polynomial is smoothened to remove the discontinuities present in the feasible region and the objective function. This spatial interpolation method is capable to optimise univariate and multivariate geometric programming problems. An example is solved to explain the robustness of the methodology by considering a bivariate nonlinear geometric programming problem. This method is also applicable for signomial programming problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=geometric%20programming%20problem" title="geometric programming problem">geometric programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multivariate%20optimisation%20technique" title=" multivariate optimisation technique"> multivariate optimisation technique</a>, <a href="https://publications.waset.org/abstracts/search?q=posynomial" title=" posynomial"> posynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=spatial%20interpolation" title=" spatial interpolation"> spatial interpolation</a> </p> <a href="https://publications.waset.org/abstracts/70385/spatial-interpolation-technique-for-the-optimisation-of-geometric-programming-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70385.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">371</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">197</span> A Gradient Orientation Based Efficient Linear Interpolation Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Khan">S. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Khan"> A. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdul%20R.%20Soomrani"> Abdul R. Soomrani</a>, <a href="https://publications.waset.org/abstracts/search?q=Raja%20F.%20Zafar"> Raja F. Zafar</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Waqas"> A. Waqas</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Akbar"> G. Akbar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a low-complexity image interpolation method. Image interpolation is used to convert a low dimension video/image to high dimension video/image. The objective of a good interpolation method is to upscale an image in such a way that it provides better edge preservation at the cost of very low complexity so that real-time processing of video frames can be made possible. However, low complexity methods tend to provide real-time interpolation at the cost of blurring, jagging and other artifacts due to errors in slope calculation. Non-linear methods, on the other hand, provide better edge preservation, but at the cost of high complexity and hence they can be considered very far from having real-time interpolation. The proposed method is a linear method that uses gradient orientation for slope calculation, unlike conventional linear methods that uses the contrast of nearby pixels. Prewitt edge detection is applied to separate uniform regions and edges. Simple line averaging is applied to unknown uniform regions, whereas unknown edge pixels are interpolated after calculation of slopes using gradient orientations of neighboring known edge pixels. As a post-processing step, bilateral filter is applied to interpolated edge regions in order to enhance the interpolated edges. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=edge%20detection" title="edge detection">edge detection</a>, <a href="https://publications.waset.org/abstracts/search?q=gradient%20orientation" title=" gradient orientation"> gradient orientation</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20upscaling" title=" image upscaling"> image upscaling</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20interpolation" title=" linear interpolation"> linear interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=slope%20tracing" title=" slope tracing"> slope tracing</a> </p> <a href="https://publications.waset.org/abstracts/85765/a-gradient-orientation-based-efficient-linear-interpolation-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85765.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">260</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">196</span> Eliminating Cutter-Path Deviation For Five-Axis Nc Machining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alan%20C.%20Lin">Alan C. Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Tsong%20Der%20Lin"> Tsong Der Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study proposes a deviation control method to add interpolation points to numerical control (NC) codes of five-axis machining in order to achieve the required machining accuracy. Specific research issues include: (1) converting machining data between the CL (cutter location) domain and the NC domain, (2) calculating the deviation between the deviated path and the linear path, (3) finding interpolation points, and (4) determining tool orientations for the interpolation points. System implementation with practical examples will also be included to highlight the applicability of the proposed methodology. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CAD%2FCAM" title="CAD/CAM">CAD/CAM</a>, <a href="https://publications.waset.org/abstracts/search?q=cutter%20path" title=" cutter path"> cutter path</a>, <a href="https://publications.waset.org/abstracts/search?q=five-axis%20machining" title=" five-axis machining"> five-axis machining</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20control" title=" numerical control"> numerical control</a> </p> <a href="https://publications.waset.org/abstracts/30394/eliminating-cutter-path-deviation-for-five-axis-nc-machining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30394.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">424</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">195</span> Symbolic Computation on Variable-Coefficient Non-Linear Dispersive Wave Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Edris%20Rawashdeh">Edris Rawashdeh</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20Abu-Falahah"> I. Abu-Falahah</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20M.%20Jaradat"> H. M. Jaradat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The variable-coefficient non-linear dispersive wave equation is investigated with the aid of symbolic computation. By virtue of a newly developed simplified bilinear method, multi-soliton solutions for such an equation have been derived. Effects of the inhomogeneities of media and nonuniformities of boundaries, depicted by the variable coefficients, on the soliton behavior are discussed with the aid of the characteristic curve method and graphical analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dispersive%20wave%20equations" title="dispersive wave equations">dispersive wave equations</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20soliton%20solution" title=" multiple soliton solution"> multiple soliton solution</a>, <a href="https://publications.waset.org/abstracts/search?q=Hirota%20Bilinear%20Method" title=" Hirota Bilinear Method"> Hirota Bilinear Method</a>, <a href="https://publications.waset.org/abstracts/search?q=symbolic%20computation" title=" symbolic computation"> symbolic computation</a> </p> <a href="https://publications.waset.org/abstracts/18831/symbolic-computation-on-variable-coefficient-non-linear-dispersive-wave-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18831.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">456</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">194</span> Applications of Probabilistic Interpolation via Orthogonal Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dariusz%20Jacek%20Jak%C3%B3bczak">Dariusz Jacek Jakóbczak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mathematics and computer science are interested in methods of 2D curve interpolation and extrapolation using the set of key points (knots). A proposed method of Hurwitz- Radon Matrices (MHR) is such a method. This novel method is based on the family of Hurwitz-Radon (HR) matrices which possess columns composed of orthogonal vectors. Two-dimensional curve is interpolated via different functions as probability distribution functions: polynomial, sinus, cosine, tangent, cotangent, logarithm, exponent, arcsin, arccos, arctan, arcctg or power function, also inverse functions. It is shown how to build the orthogonal matrix operator and how to use it in a process of curve reconstruction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=2D%20data%20interpolation" title="2D data interpolation">2D data interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=hurwitz-radon%20matrices" title=" hurwitz-radon matrices"> hurwitz-radon matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=MHR%20method" title=" MHR method"> MHR method</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20modeling" title=" probabilistic modeling"> probabilistic modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=curve%20extrapolation" title=" curve extrapolation"> curve extrapolation</a> </p> <a href="https://publications.waset.org/abstracts/32599/applications-of-probabilistic-interpolation-via-orthogonal-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32599.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">525</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">193</span> Analysis of a Generalized Sharma-Tasso-Olver Equation with Variable Coefficients</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fadi%20Awawdeh">Fadi Awawdeh</a>, <a href="https://publications.waset.org/abstracts/search?q=O.%20Alsayyed"> O. Alsayyed</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Al-Shar%C3%A1"> S. Al-Shará</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Considering the inhomogeneities of media, the variable-coefficient Sharma-Tasso-Olver (STO) equation is hereby investigated with the aid of symbolic computation. A newly developed simplified bilinear method is described for the solution of considered equation. Without any constraints on the coefficient functions, multiple kink solutions are obtained. Parametric analysis is carried out in order to analyze the effects of the coefficient functions on the stabilities and propagation characteristics of the solitonic waves. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hirota%20bilinear%20method" title="Hirota bilinear method">Hirota bilinear method</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20kink%20solution" title=" multiple kink solution"> multiple kink solution</a>, <a href="https://publications.waset.org/abstracts/search?q=Sharma-Tasso-Olver%20equation" title=" Sharma-Tasso-Olver equation"> Sharma-Tasso-Olver equation</a>, <a href="https://publications.waset.org/abstracts/search?q=inhomogeneity%20of%20media" title=" inhomogeneity of media"> inhomogeneity of media</a> </p> <a href="https://publications.waset.org/abstracts/18827/analysis-of-a-generalized-sharma-tasso-olver-equation-with-variable-coefficients" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18827.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">517</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">192</span> Feature Location Restoration for Under-Sampled Photoplethysmogram Using Spline Interpolation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hangsik%20Shin">Hangsik Shin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this research is to restore the feature location of under-sampled photoplethysmogram using spline interpolation and to investigate feasibility for feature shape restoration. We obtained 10 kHz-sampled photoplethysmogram and decimated it to generate under-sampled dataset. Decimated dataset has 5 kHz, 2.5 k Hz, 1 kHz, 500 Hz, 250 Hz, 25 Hz and 10 Hz sampling frequency. To investigate the restoration performance, we interpolated under-sampled signals with 10 kHz, then compared feature locations with feature locations of 10 kHz sampled photoplethysmogram. Features were upper and lower peak of photplethysmography waveform. Result showed that time differences were dramatically decreased by interpolation. Location error was lesser than 1 ms in both feature types. In 10 Hz sampled cases, location error was also deceased a lot, however, they were still over 10 ms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=peak%20detection" title="peak detection">peak detection</a>, <a href="https://publications.waset.org/abstracts/search?q=photoplethysmography" title=" photoplethysmography"> photoplethysmography</a>, <a href="https://publications.waset.org/abstracts/search?q=sampling" title=" sampling"> sampling</a>, <a href="https://publications.waset.org/abstracts/search?q=signal%20reconstruction" title=" signal reconstruction"> signal reconstruction</a> </p> <a href="https://publications.waset.org/abstracts/53409/feature-location-restoration-for-under-sampled-photoplethysmogram-using-spline-interpolation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53409.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">368</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">191</span> Multiple-Lump-Type Solutions of the 2D Toda Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jian-Ping%20Yu">Jian-Ping Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Wen-Xiu%20Ma"> Wen-Xiu Ma</a>, <a href="https://publications.waset.org/abstracts/search?q=Yong-Li%20Sun"> Yong-Li Sun</a>, <a href="https://publications.waset.org/abstracts/search?q=Chaudry%20Masood%20Khalique"> Chaudry Masood Khalique</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a 2d Toda equation is studied, which is a classical integrable system and plays a vital role in mathematics, physics and other areas. New lump-type solution is constructed by using the Hirota bilinear method. One interesting feature of this research is that this lump-type solutions possesses two types of multiple-lump-type waves, which are one- and two-lump-type waves. Moreover, the corresponding 3d plots, density plots and contour plots are given to show the dynamical features of the obtained multiple-lump-type solutions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=2d%20Toda%20equation" title="2d Toda equation">2d Toda equation</a>, <a href="https://publications.waset.org/abstracts/search?q=Hirota%20bilinear%20method" title=" Hirota bilinear method"> Hirota bilinear method</a>, <a href="https://publications.waset.org/abstracts/search?q=Lump-type%20solution" title=" Lump-type solution"> Lump-type solution</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple-lump-type%20solution" title=" multiple-lump-type solution"> multiple-lump-type solution</a> </p> <a href="https://publications.waset.org/abstracts/104938/multiple-lump-type-solutions-of-the-2d-toda-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/104938.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">222</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">190</span> Comparison between the Quadratic and the Cubic Linked Interpolation on the Mindlin Plate Four-Node Quadrilateral Finite Elements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dragan%20Ribari%C4%87">Dragan Ribarić</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We employ the so-called problem-dependent linked interpolation concept to develop two cubic 4-node quadrilateral Mindlin plate finite elements with 12 external degrees of freedom. In the problem-independent linked interpolation, the interpolation functions are independent of any problem material parameters and the rotation fields are not expressed in terms of the nodal displacement parameters. On the contrary, in the problem-dependent linked interpolation, the interpolation functions depend on the material parameters and the rotation fields are expressed in terms of the nodal displacement parameters. Two cubic 4-node quadrilateral plate elements are presented, named Q4-U3 and Q4-U3R5. The first one is modelled with one displacement and two rotation degrees of freedom in every of the four element nodes and the second element has five additional internal degrees of freedom to get polynomial completeness of the cubic form and which can be statically condensed within the element. Both elements are able to pass the constant-bending patch test exactly as well as the non-zero constant-shear patch test on the oriented regular mesh geometry in the case of cylindrical bending. In any mesh shape, the elements have the correct rank and only the three eigenvalues, corresponding to the solid body motions are zero. There are no additional spurious zero modes responsible for instability of the finite element models. In comparison with the problem-independent cubic linked interpolation implemented in Q9-U3, the nine-node plate element, significantly less degrees of freedom are employed in the model while retaining the interpolation conformity between adjacent elements. The presented elements are also compared to the existing problem-independent quadratic linked-interpolation element Q4-U2 and to the other known elements that also use the quadratic or the cubic linked interpolation, by testing them on several benchmark examples. Simple functional upgrading from the quadratic to the cubic linked interpolation, implemented in Q4-U3 element, showed no significant improvement compared to the quadratic linked form of the Q4-U2 element. Only when the additional bubble terms are incorporated in the displacement and rotation function fields, which complete the full cubic linked interpolation form, qualitative improvement is fulfilled in the Q4-U3R5 element. Nevertheless, the locking problem exists even for the both presented elements, like in all pure displacement elements when applied to very thin plates modelled by coarse meshes. But good and even slightly better performance can be noticed for the Q4-U3R5 element when compared with elements from the literature, if the model meshes are moderately dense and the plate thickness not extremely thin. In some cases, it is comparable to or even better than Q9-U3 element which has as many as 12 more external degrees of freedom. A significant improvement can be noticed in particular when modeling very skew plates and models with singularities in the stress fields as well as circular plates with distorted meshes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mindlin%20plate%20theory" title="Mindlin plate theory">Mindlin plate theory</a>, <a href="https://publications.waset.org/abstracts/search?q=problem-independent%20linked%20interpolation" title=" problem-independent linked interpolation"> problem-independent linked interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=problem-dependent%20interpolation" title=" problem-dependent interpolation"> problem-dependent interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=quadrilateral%20displacement-based%20plate%20finite%20elements" title=" quadrilateral displacement-based plate finite elements"> quadrilateral displacement-based plate finite elements</a> </p> <a href="https://publications.waset.org/abstracts/47597/comparison-between-the-quadratic-and-the-cubic-linked-interpolation-on-the-mindlin-plate-four-node-quadrilateral-finite-elements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47597.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">312</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">189</span> Symbolic Computation for the Multi-Soliton Solutions of a Class of Fifth-Order Evolution Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rafat%20Alshorman">Rafat Alshorman</a>, <a href="https://publications.waset.org/abstracts/search?q=Fadi%20Awawdeh"> Fadi Awawdeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> By employing a simplified bilinear method, a class of generalized fifth-order KdV (gfKdV) equations which arise in nonlinear lattice, plasma physics and ocean dynamics are investigated. With the aid of symbolic computation, both solitary wave solutions and multiple-soliton solutions are obtained. These new exact solutions will extend previous results and help us explain the properties of nonlinear solitary waves in many physical models in shallow water. Parametric analysis is carried out in order to illustrate that the soliton amplitude, width and velocity are affected by the coefficient parameters in the equation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multiple%20soliton%20solutions" title="multiple soliton solutions">multiple soliton solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=fifth-order%20evolution%20equations" title=" fifth-order evolution equations"> fifth-order evolution equations</a>, <a href="https://publications.waset.org/abstracts/search?q=Cole-Hopf%20transformation" title=" Cole-Hopf transformation"> Cole-Hopf transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=Hirota%20bilinear%20method" title=" Hirota bilinear method"> Hirota bilinear method</a> </p> <a href="https://publications.waset.org/abstracts/9376/symbolic-computation-for-the-multi-soliton-solutions-of-a-class-of-fifth-order-evolution-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9376.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">320</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">188</span> Enhancing Spatial Interpolation: A Multi-Layer Inverse Distance Weighting Model for Complex Regression and Classification Tasks in Spatial Data Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yakin%20Hajlaoui">Yakin Hajlaoui</a>, <a href="https://publications.waset.org/abstracts/search?q=Richard%20Labib"> Richard Labib</a>, <a href="https://publications.waset.org/abstracts/search?q=Jean-Fran%C3%A7ois%20Plante"> Jean-François Plante</a>, <a href="https://publications.waset.org/abstracts/search?q=Michel%20Gamache"> Michel Gamache</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study introduces the Multi-Layer Inverse Distance Weighting Model (ML-IDW), inspired by the mathematical formulation of both multi-layer neural networks (ML-NNs) and Inverse Distance Weighting model (IDW). ML-IDW leverages ML-NNs' processing capabilities, characterized by compositions of learnable non-linear functions applied to input features, and incorporates IDW's ability to learn anisotropic spatial dependencies, presenting a promising solution for nonlinear spatial interpolation and learning from complex spatial data. it employ gradient descent and backpropagation to train ML-IDW, comparing its performance against conventional spatial interpolation models such as Kriging and standard IDW on regression and classification tasks using simulated spatial datasets of varying complexity. the results highlight the efficacy of ML-IDW, particularly in handling complex spatial datasets, exhibiting lower mean square error in regression and higher F1 score in classification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=deep%20learning" title="deep learning">deep learning</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-layer%20neural%20networks" title=" multi-layer neural networks"> multi-layer neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=gradient%20descent" title=" gradient descent"> gradient descent</a>, <a href="https://publications.waset.org/abstracts/search?q=spatial%20interpolation" title=" spatial interpolation"> spatial interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20distance%20weighting" title=" inverse distance weighting"> inverse distance weighting</a> </p> <a href="https://publications.waset.org/abstracts/185810/enhancing-spatial-interpolation-a-multi-layer-inverse-distance-weighting-model-for-complex-regression-and-classification-tasks-in-spatial-data-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/185810.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">52</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">187</span> Tensor Deep Stacking Neural Networks and Bilinear Mapping Based Speech Emotion Classification Using Facial Electromyography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20S.%20Jagadeesh%20Kumar">P. S. Jagadeesh Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Yang%20Yung"> Yang Yung</a>, <a href="https://publications.waset.org/abstracts/search?q=Wenli%20Hu"> Wenli Hu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Speech emotion classification is a dominant research field in finding a sturdy and profligate classifier appropriate for different real-life applications. This effort accentuates on classifying different emotions from speech signal quarried from the features related to pitch, formants, energy contours, jitter, shimmer, spectral, perceptual and temporal features. Tensor deep stacking neural networks were supported to examine the factors that influence the classification success rate. Facial electromyography signals were composed of several forms of focuses in a controlled atmosphere by means of audio-visual stimuli. Proficient facial electromyography signals were pre-processed using moving average filter, and a set of arithmetical features were excavated. Extracted features were mapped into consistent emotions using bilinear mapping. With facial electromyography signals, a database comprising diverse emotions will be exposed with a suitable fine-tuning of features and training data. A success rate of 92% can be attained deprived of increasing the system connivance and the computation time for sorting diverse emotional states. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=speech%20emotion%20classification" title="speech emotion classification">speech emotion classification</a>, <a href="https://publications.waset.org/abstracts/search?q=tensor%20deep%20stacking%20neural%20networks" title=" tensor deep stacking neural networks"> tensor deep stacking neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=facial%20electromyography" title=" facial electromyography"> facial electromyography</a>, <a href="https://publications.waset.org/abstracts/search?q=bilinear%20mapping" title=" bilinear mapping"> bilinear mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=audio-visual%20stimuli" title=" audio-visual stimuli"> audio-visual stimuli</a> </p> <a href="https://publications.waset.org/abstracts/78499/tensor-deep-stacking-neural-networks-and-bilinear-mapping-based-speech-emotion-classification-using-facial-electromyography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78499.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">254</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bilinear%20interpolation&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bilinear%20interpolation&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bilinear%20interpolation&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bilinear%20interpolation&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bilinear%20interpolation&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bilinear%20interpolation&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bilinear%20interpolation&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bilinear%20interpolation&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>