In this paper we present a recursive algorithm for the cleaning and the enhancing of historical documents. Most of the algorithms, used to clean and enhance documents or transform ...
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
Abstract. This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, w...
Abstract Most of the existing algorithms for simplifying triangular meshes might lose some important shape features of the original model, especially at low levels of the simplifie...
The aim of this study is to propose an algorithm for simplifying color images. The assumption is made that a set of reference colors is available and that this set indicates which...