Abstract We study weighted total least squares problems on infinite dimensional spaces. present some necessary and sufficient conditions for the regularized problem to have a solution. The existence of solution can also be assured minimization with constraint special subsets. Furthermore, we show that regularization in is necessary, since most cases without does not admit

Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in many practical applications, some a priori knowledge exists which considerably simplifies the problem. In visual navigation, for example, the motion between successive positions is usually either small or approximately known, but a more precise registration is required for environment modeling. The...

In this paper, we are interested in finding an approximate solution $ \hat{\mathcal{X}} of the tensor least-squares minimization problem$ \min_{\mathcal{X}}\left\|\mathcal{X}\times_1A^{(1)}\times_2A^{(2)}\times_3\cdots\times_NA^{(N)}-\mathcal{G}\right\|$, where \mathcal{G}\in \mathbb{R}^{J_1\times J_2\times \cdots \times J_N}$ and A^{(i)}\in \mathbb{R}^{J_i\times I_i} ($ i=1,\ldots,N $) known \...