Prediction by Partial Matching (PPM) is a lossless compression algorithm which consistently performs well on text compression benchmarks. This paper introduces a new PPM implementation called PPM-Ens which uses unbounded context lengths and ensemble voting to combine multiple contexts. The algorithm is evaluated on the Calgary corpus. The results indicate that combining multiple contexts leads ...

Stereo matching by correlation near occlusions is a very challenging problem. When a partial occlusion occurs, most of the standard methods fail to produce acceptable results. This is because the techniques used do not take into account the presence of the occluding region. We propose a robust technique which we call partial correlation. This technique makes use of the least median square metho...

In this paper, we address the stereo matching problem in stereo videos using partially informed Markov Random Fields (MRFs) using the motion information between subsequent frames as a side information. We use the motion vectors within one of the videos to regularize the disparity estimate using this motion field. The proposed scheme enables us to obtain good disparity estimates using faster and...

The extended abstract describes a method for recognizing similar sub-parts of objects described by 3D polygonal meshes. The innovation of this method is the coupling of structure and geometry in the matching process. First of all, the structure of the shape is coded in a graph where each node is associated to a sub-part of the shape. Then, the matching between two shapes is approached using a g...

Appearance matching methods use raw or filtered pixel brightness values to perform recognition. To expedite recognition, subspace methods are used to achieve compact representations of images. In many cases it is advantageous to recognize an image based on only a subset of its pixels, for example, when a part of an image is occluded, or to expedite recognition. Currently, such subsets are selec...

We propose an efficient procedure for calculating partial dense intrinsic correspondence between deformable shapes performed entirely in the spectral domain. Our technique relies on the recently introduced partial functional maps formalism and on the joint approximate diagonalization (JAD) of the Laplace-Beltrami operators previously introduced for matching non-isometric shapes. We show that a ...

Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A particularly challenging setting of this problem is partial matching, where the two shapes are dissimilar in general, but have significant similar parts. In this paper, we show an approach allowing to find matching parts of ri...

Given two point sets in the plane, we study the minimization of the (lexiocographic) bottleneck distance between the smaller set and an equally-sized subset of the larger set under translations. We relate this problem to two Voronoi-type diagrams, which are of interest for related problems. Their complexity is shown to be polynomial in the sizes of the sets and algorithms for their construction...