Global Image Registration Using Random Projection and Local Linear Method

Author(s):  
Hayato Itoh ◽  
Tomoya Sakai ◽  
Kazuhiko Kawamoto ◽  
Atsushi Imiya
2004 ◽  
Author(s):  
Fedor V. Shugaev ◽  
Evgeni N. Terentiev ◽  
Ludmila S. Shtemenko ◽  
Olga I. Dokukina ◽  
Oksana A. Ignateva

2002 ◽  
Author(s):  
Evgeni N. Terentiev ◽  
Nikolai E. Terentiev ◽  
Fedor V. Shugaev

2009 ◽  
Vol 26 (2) ◽  
pp. 541-563 ◽  
Author(s):  
Ke-Li Xu

The local linear method is popular in estimating nonparametric continuous-time diffusion models, but it may produce negative results for the diffusion (or volatility) functions and thus lead to insensible inference. We demonstrate this using U.S. interest rate data. We propose a new functional estimation method of the diffusion coefficient based on reweighting the conventional Nadaraya–Watson estimator. It preserves the appealing bias properties of the local linear estimator and is guaranteed to be nonnegative in finite samples. A limit theory is developed under mild requirements (recurrence) of the data generating mechanism without assuming stationarity or ergodicity.


Author(s):  
Hayato Itoh ◽  
Shuang Lu ◽  
Tomoya Sakai ◽  
Atsushi Imiya

1993 ◽  
Vol 04 (03) ◽  
pp. 247-255 ◽  
Author(s):  
W. HSU ◽  
L. S. HSU ◽  
M. F. TENORIO

This paper describes a novel neural network architecture named ClusNet. This network is designed to study the trade-offs between the simplicity of instance-based methods and the accuracy of the more computational intensive learning methods. The features that make this network different from existing learning algorithms are outlined. A simple proof of convergence of the ClusNet algorithm is given. Experimental results showing the convergence of the algorithm on a specific problem is also presented. In this paper, ClusNet is applied to predict the temporal continuation of the Mackey–Glass chaotic time series. A comparison between the results obtained with ClusNet and other neural network algorithms is made. For example, ClusNet requires one-tenth the computing resources of the instance-based local linear method for this application while achieving comparable accuracy in this task. The sensitivity of ClusNet prediction accuracies on specific clustering algorithms is examined for an application. The simplicity and fast convergence of ClusNet makes it ideal as a rapid prototyping tool for applications where on-line learning is required.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Jiping Liu

The study of this theoretical problem enables sparse or dense functional data, including educational information evaluation data. The choice of different weights is subjected to principal component analysis. The evaluation of music education informatization level mainly evaluates the status quo of music education informatization development, provides a basis for formulating and adjusting music education informatization development policies, and provides support for educational decision-making, to promote the sustainable and balanced development of music education informatization. The evaluation of music education informatization has become the key promotion work of music education informatization at this stage. This paper studies the convergence rate of functional principal components based on the local linear method under general weighting conditions. First, we introduce the related research on the estimation of mean and covariance function under general weighting. Secondly, for principal functional components under general weighting, namely, eigenvalues and eigen functions, the text gives the corresponding estimated values and derives its strong uniform convergence rate. Finally, the convergence rate was verified by simulation research. The estimation methods and conclusions of this article enrich the research of functional linear regression models and will help analyze the complex and changeable problems encountered in the application of music education information.


Sign in / Sign up

Export Citation Format

Share Document