Despite recent advances in video inpainting techniques, reconstructing large missing regions of a moving subject while its scale changes remains an elusive goal. In this paper, we have introduced a scale-change invariant method for large missing regions to tackle this problem. Using this framework, first the moving foreground is separated from the background and its scale is equalized. Then, a ...

For geostationary meteorological satellite (GSMS) remote sensing image registration, high computational cost and matching error are the two main challenging problems. To address these issues, this paper proposes a novel algorithm named slope-restricted multi-scale feature matching. In multi-scale feature matching, images are subsampled to different scales. From a small scale to a large scale, t...

Schema matching is a crucial task to gather information of the same domain. This is even more the case when dealing with data warehouses, where a large number of data sources are available and require matching and integration. However, the matching process is still largely performed manually or semiautomatically, thus discouraging the use of large scale integration systems. Indeed, these large ...

This paper introduces a depth-computation architecture designed for, but not limited to, a single-chip current mode analog VLSI (aVLSI) implementation of stereo vision. The architecture implements a modified version of the block matching algorithm; pixel blocks are averaged (summed) vertically before comparison along the horizontal axis. This both reduces the effects of noise and provides an or...

This paper proposes a novel array architecture for full-search block matching motion estimation. The design efforts are focused on transforming the array computation in a way that minimizes the memory and I/O costs while satisfying the highest throughput requirements. Compared with the existing architectures, this one ensures feasible solutions for the HDTV picture format with twice lower memor...

| This paper describes a VLSI architecture which can be recon gured to support both Full Search Block{Matching algorithm and 3{step Hierarchical Search Block{Matching algorithm. By using a recon gurable register{ mux array and a parameterizable adder tree, the 2{D array architecture provides e cient real time motion estimation for many video applications. We also propose a memory architecture a...

Similarity measures based on correlation have been used extensively for matching tasks. However, traditional correlation-based image matching methods are sensitive to rotation and scale changes. This paper presents a fast correlation-based method for matching two images with large rotation and significant scale changes. Multiscale oriented corner correlation (MOCC) is used to evaluate the degre...

Many real-world problems require graphs of such large size that polynomial time algorithms are too costly as soon as their runtime is superlinear. Examples include problems in VLSI-design or problems in bioinformatics. For such problems the question arises: What is the best solution that can be obtained in linear time? We survey linear time approximation algorithms for some classical problems f...

A Golomb ruler with m marks can be defined as a set of m distinct integers such that the differences between them are all distinct. An optimal Golomb ruler minimizes the value of the largest mark. The Golomb ruler problem is highly combinatorial and difficult to solve efficiently even for small sizes. Golomb rulers and related problems play an important role in, e.g., radio communication, VLSI ...