Sciweavers

266 search results - page 40 / 54
» New algorithms for computing directional discrete Fourier tr...
Sort
View
CVPR
2006
IEEE
14 years 9 months ago
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
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...
David Tolliver, Gary L. Miller
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 5 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
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...
Jeff Erickson
ICPR
2000
IEEE
14 years 8 months ago
Content-Based Watermarking Model
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...
Ruizhen Liu, Tieniu Tan
ECCV
2000
Springer
14 years 1 days ago
Approximate N-View Stereo
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...
Kiriakos N. Kutulakos
ICIP
1999
IEEE
14 years 9 months ago
A Model-Based Approach for Compression of Fingerprint Images
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...
Fikret Erçal, Ilker Ersoy, Muhittin Gö...