Background: A small class of RNA molecules, in particular the tiny genomes of viroids, are
circular. Yet most structure prediction algorithms handle only linear RNAs. The most …

The problem of segmenting an image into separate regions and tracking them over time is
one of the most significant problems in vision. Terzopoulos et al.(1987) proposed an …

Given N ordered points in the plane and a constant M< N, an efficient algorithm is proposed
to find M points, among those given, which define a polygonal curve that is a globally …

This paper presents an approach to unsupervised segmentation of moving and static objects
occurring in a video. Objects are, in general, spatially cohesive and characterized by locally …

Curve matching is one instance of the fundamental correspondence problem. Our flexible
algorithm is designed to match curves under substantial deformations and arbitrary large …

A new method for the recognition of arbitrary two-dimensional (2D) shapes is described. It is
based on string edit distance computation. The recognition method is invariant under …

A common approach to determining corresponding points on two shapes is to compute the
cost of each possible pairing of points and solve the assignment problem (weighted bipartite …

The problem of establishing image-to-image correspondences is fundamental in computer
vision. Recently, several wide baseline matching algorithms capable of handling large …

Time series can be effectively represented by strings. The median concept is useful in
various contexts. In this chapter its adaptation to the domain of strings is discussed. We …

It is a key issue to find out all longest common subsequences of multiple sequences over a
set of finite alphabets, namely MLCS problem, in computational biology, pattern recognition …