Text String Extraction in Delaunay Triangulation
نویسندگان
چکیده
This paper establishes a Delaunay triangulation model for detecting text strings in an image. In this method, text regions are represented based on Delaunay triangles that can be extracted easily. A searching mechanism based on the left and right arms of a discrete symmetric axis is developed to locate text in an image. The discrete symmetric axis consists of a group of off-curve-edge adjacent Delaunay triangles that are identifiable. Our experiment shows that the approach can detect multi-orientated texts and is efficient and effective.
منابع مشابه
Feature Extraction of 2-manifold Using Delaunay Triangulation
This paper is dedicated to a proposition of a novel feature extraction method for 2-manifold objects in 3D. The topological description was used as a base of the method. The curvatures of the surface are used to obtain the description independent on the position and the orientation of the object. In the addition, the Morse theory and the Delaunay triangulation are combined together to generate ...
متن کاملA Quick Image Registration Algorithm Based on Delaunay Triangulation
The traditional image matching algorithms adopt more complex strategies when dealing with mismatch caused by a lot of noise. In this paper, a simple, intuitive and effective noise processing algorithm is proposed based on Delaunay triangulation in computational geometry. The algorithm extracts feature points using SIFT method, respectively establishes Delaunay triangulation in multi-spectral an...
متن کاملEfficient Proximity Search for -D Cuboids
In this paper, we give the definition for the voronoi diagram and its dual graph – Delaunay triangulation for 3D cuboids. We prove properties of the 3D Delaunay triangulation, and provide algorithms to construct and update the Delaunay triangulation. The Delaunay triangulation data structure is used to perform proximity searches for both static and kinetic cases. We describe experimental result...
متن کاملBlocking Delaunay triangulations
Given a set B of n black points in general position, we say that a set of white points W blocks B if in the Delaunay triangulation of [Formula: see text] there is no edge connecting two black points. We give the following bounds for the size of the smallest set W blocking B: (i) [Formula: see text] white points are always sufficient to block a set of n black points, (ii) if B is in convex posit...
متن کاملFacial Feature Location with Delaunay Triangulation/Voronoi Diagram Calculation
Facial features determination is essential in many applications such as personal identification, 3D face modeling and model based video coding. Fast and accurate facial feature extraction is still a filed to be explored. In this paper, an automatic extracting algorithm is developed to locate “key points” of facial features. The Delaunay Triangulation/Voronoi Diagram technique well known in comp...
متن کامل