We present a new method for summarizing images for the purposes of matching and registration. We take the point of view that large, coherent regions in the image provide a concise...
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Abstract. This paper describes adaptive path planning, a novel approach to path planning for car-like mobile robots. Instead of creating a new plan from scratch, whenever changes i...
— The Bath University Matching Pursuit (BUMP) project aims at developing new matching pursuit (MP) algorithms for still image and video compression. Compared to traditional MP co...
: Image segmentation is an essential step in image processing. The goal of segmentation is to simplify and/or to change the representation of an image into a form easier to analyze...