ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
In this paper, we propose a new general additive watermarking model based on the content of digital images, called as CBWM (Content-Based Watermarking Model). It provides a common...
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are in...
We proposea new ngerprint imagecompressionscheme based on the hybrid model of image. Our scheme uses the essential steps of a typical automated ngerprint identi cation system (AFI...