This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions...
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
In this paper, we present a fast watershed algorithm based on the rainfalling simulation. We present the various techniques and data structures utilized in our approach. Throughou...
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
We propose a block motion estimation (ME) algorithm that meets high quality requirements and allows for cost efficient VLSI realizations. It relies on a set of rules common to all...