85 search results - page 12 / 17 » Optimal Blurred Segments Decomposition in Linear Time |
ISAAC
2005
Springer
14 years 6 days ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
ICPR
2010
IEEE
14 years 1 months ago
2010
IEEE
This paper deals with feature matching and segmentation of common objects in a pair of images, simultaneously. For the feature matching problem, the matching likelihoods of all fea...
FSTTCS
2003
Springer
13 years 12 months ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
ICCV
2007
IEEE
14 years 8 months ago
2007
IEEE
An interactive framework for soft segmentation and matting of natural images and videos is presented in this paper. The proposed technique is based on the optimal, linear time, co...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...