Sciweavers

2064 search results - page 59 / 413
» Segmentation Problems
Sort
View
ICDAR
2009
IEEE
13 years 5 months ago
Learning on the Fly: Font-Free Approaches to Difficult OCR Problems
Despite ubiquitous claims that optical character recognition (OCR) is a "solved problem," many categories of documents continue to break modern OCR software such as docu...
Andrew Kae, Erik G. Learned-Miller
DCG
2002
76views more  DCG 2002»
13 years 7 months ago
The Unit Distance Problem for Centrally Symmetric Convex Polygons
Let f(n) be the maximum number of unit distances determined by the vertices of a convex n-gon. Erdos and Moser conjectured that this function is linear. Supporting this conjecture...
Bernardo M. Ábrego, Silvia Fernández...
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
13 years 11 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
ICPR
2008
IEEE
14 years 8 months ago
Relative advantage of touch over vision in the exploration of texture
Texture segmentation is an effortless process in scene analysis, yet its mechanisms have not been sufficiently understood. A common assumption in most current approaches is that t...
Choonseog Park, Yoon Ho Bai, Yoonsuck Choe
ICDAR
2007
IEEE
14 years 1 months ago
An Efficient Word Segmentation Technique for Historical and Degraded Machine-Printed Documents
Word segmentation is a crucial step for segmentation-free document analysis systems and is used for creating an index based on word matching. In this paper, we propose a novel met...
Michael Makridis, N. Nikolaou, Basilios Gatos