This paper introduces a new extension of Riemannian elastic curve matching to general class geometric structures, which we call (weighted) shape graphs, that allows for registration with partial constraints and topological inconsistencies. Weighted graphs are the union an arbitrary number component curves in Euclidean space potential connectivity between some their boundary points, together wei...

Industrial assistive systems result from a multidisciplinary effort that integrates IoT (and IoT), Cognetics, and Artificial Intelligence. This paper evaluates the Prediction by Partial Matching algorithm as component of an assembly assistance system supports factory workers, providing choices for next manufacturing step. The evaluation proposed method was performed on datasets collected within...

Sketching is a natural way of input that provides an effective means of illustration. A sketch consists of multiple strokes that can be captured by pen-based devices to be stored in a database for future retrieval. In our prior work, we proposed a sketch retrieval method that is suitable for whole matching. However, the problem gets complicated if the retrieval is performed for partially matche...

This paper deals with segmentation of image sequences in an unsupervised manner with the goal of getting highly consistent segmentation results from frame-to-frame. We first introduce a segmentation method that uses results of the previous frame as initialization and significantly improves consistency in comparison to a single frame based approach. We also find correspondences between the segme...

Uncertain data in databases were originally denoted as null values which were later generalized to partial values Based on the concept of partial values we have further generalized the notion to probabilistic partial values In this paper an important operation division is fully studied to handle partial values and probabilistic partial values Due to the uncertainty of partial values and probabi...

Conventional finite-difference schemes for solving partial differential equations are based on approximating derivatives by finite-differences. In this work, an alternative method is proposed which views finite-difference schemes as systematic ways of matching up to the operator solution of the partial differential equation. By completely abandoning the idea of approximating derivatives directl...