Sciweavers

446 search results - page 30 / 90
» A fast algorithm for computing steiner edge connectivity
Sort
View
91
Voted
ICCV
2009
IEEE
14 years 7 months ago
Non-iterative approach for fast and accurate vanishing point detection
We present an algorithm that quickly and accurately estimates vanishing points in images of man-made environments. Contrary to previously proposed solutions, ours is neither itera...
Jean-Philippe Tardif
IPPS
2003
IEEE
15 years 2 months ago
A GRASP-Based Algorithm for Solving DVE Partitioning Problem
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
Pedro Morillo, Marcos Fernández
ICCV
2009
IEEE
14 years 7 months ago
An algebraic model for fast corner detection
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
Andrew Willis, Yunfeng Sui
WG
2004
Springer
15 years 3 months ago
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
74
Voted
AINA
2006
IEEE
15 years 3 months ago
On Optimization and Parallelization of Fuzzy Connected Segmentation for Medical Imaging
Fuzzy Connectedness is an important image segmentation routine for image processing of medical images. It is often used in preparation for surgery and sometimes during surgery. It...
Christopher Gammage, Vipin Chaudhary