Sciweavers

281 search results - page 31 / 57
» The Complexity of Planar Counting Problems
Sort
View
CVPR
2007
IEEE
14 years 2 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
SIGACT
2008
103views more  SIGACT 2008»
13 years 7 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
KDD
2002
ACM
148views Data Mining» more  KDD 2002»
14 years 8 months ago
Tumor cell identification using features rules
Advances in imaging techniques have led to large repositories of images. There is an increasing demand for automated systems that can analyze complex medical images and extract me...
Bin Fang, Wynne Hsu, Mong-Li Lee
ALGORITHMICA
2010
192views more  ALGORITHMICA 2010»
13 years 8 months ago
Circular Stable Matching and 3-way Kidney Transplant
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...
Chien-Chung Huang
ICASSP
2008
IEEE
14 years 2 months ago
Parametric estimation of affine deformations of binary images
We consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches...
Csaba Domokos, Zoltan Kato, Joseph M. Francos