Sciweavers

2064 search results - page 313 / 413
» Segmentation Problems
Sort
View
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
14 years 2 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
SCVMA
2004
Springer
14 years 2 months ago
Analysis and Interpretation of Multiple Motions Through Surface Saliency
1 . The problem of recovering the 3-D camera and scene structure has been intensively studied and is considered well understood. Starting with two images, a process of establishing...
Mircea Nicolescu, Changki Min, Gérard G. Me...
ICDAR
2003
IEEE
14 years 2 months ago
A Retargetable Framework for Interactive Diagram Recognition
The design of new diagram recognition systems remains a challenging problem. Ideally, recognition systems should accept real-world input, perform robustly, fail gracefully, and be...
Edward Lank
CASES
2003
ACM
14 years 2 months ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara
ICTAI
2002
IEEE
14 years 1 months ago
A Clustering Based Approach to Efficient Image Retrieval
This paper addresses the issue of effective and efficient content based image retrieval by presenting a novel indexing and retrieval methodology that integrates color, texture, an...
Ruofei Zhang, Zhongfei Zhang