GB1255654A - Improvements in or relating to character recognition systems - Google Patents
Improvements in or relating to character recognition systemsInfo
- Publication number
- GB1255654A GB1255654A GB35873/68A GB3587368A GB1255654A GB 1255654 A GB1255654 A GB 1255654A GB 35873/68 A GB35873/68 A GB 35873/68A GB 3587368 A GB3587368 A GB 3587368A GB 1255654 A GB1255654 A GB 1255654A
- Authority
- GB
- United Kingdom
- Prior art keywords
- point
- points
- marked
- line
- character
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/40—Extraction of image or video features
- G06V10/44—Local feature extraction by analysis of parts of the pattern, e.g. by detecting edges, contours, loops, corners, strokes or intersections; Connectivity analysis, e.g. of connected components
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V30/00—Character recognition; Recognising digital ink; Document-oriented image-based pattern recognition
- G06V30/10—Character recognition
Landscapes
- Engineering & Computer Science (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Multimedia (AREA)
- Theoretical Computer Science (AREA)
- Character Discrimination (AREA)
Abstract
1,255,654. Character recognition. MULLARD Ltd. 28 March, 1969 [26 July, 1968], No. 35873/68. Heading G4R. Apparatus for processing a thin digitized character so as to effectively reconstruct the character by joining the points into continuous lines uses alternately (a) a forward search with a biased direction to find successive points of a line, stopping at a line end or on detection of a loop, (b) a radial search from the points of the line found to locate further points which are then joined to the line. The invention is applied in a character recognition system to a digitized character, thinned to one bit thickness as in Specification 1,153,703 or 1,255,653. Successive points are joined by a join from one matrix point to the next along a row (2 possible directions), column (2 directions) or diagonal (4 directions), or by a sequence of such joins. The forward search conducted from a given point on the line is biased in that one of the 8 directions taken by the (last) join leading to the given point and consists of considering matrix points ahead and to the sides of the given point in turn giving priority to those nearest to the given point and closest to the ahead direction until a black point is found. This point is marked. The co-ordinates of the character (black) points are stored in a list of character points in a computer store. The list is initially searched for an unmarked point (the sequence can be restarted if it terminates prematurely), from which a radial search pattern is conducted to locate another black point which is marked and a forward search in the (last) join direction performed, this being repeated to trace out the character line until a forward search gives no result (line end) or arrives at an already marked point (loop). Then a radial search is performed, the first point in the search pattern being considered starting from each marked point (these having been placed in an output list) in turn, then the second point in the search pattern starting from each marked point in turn, and so on until a black point is found, this being marked. The radial search pattern is a (digitized) outwardly progressing spiral. In the above process of alternating searches, which continues until all the character points are marked (" used "), line-end points are marked once, points at line junctions are marked three or more times, other points are marked twice, and small loops and small line segments are ignored. Line ends and junctions are detected on the basis of number of marks, in the output list. Loops (of sufficient size) were marked in a results list as they were detected. The searches used respective search lists of increments (to point co-ordinates). During operation, lists of ends and junctions are formed, and the mean directions of lines joining them are stored, together with whether the lines are essentially straight or curved.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB35873/68A GB1255654A (en) | 1968-07-26 | 1968-07-26 | Improvements in or relating to character recognition systems |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB35873/68A GB1255654A (en) | 1968-07-26 | 1968-07-26 | Improvements in or relating to character recognition systems |
Publications (1)
Publication Number | Publication Date |
---|---|
GB1255654A true GB1255654A (en) | 1971-12-01 |
Family
ID=10382498
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
GB35873/68A Expired GB1255654A (en) | 1968-07-26 | 1968-07-26 | Improvements in or relating to character recognition systems |
Country Status (1)
Country | Link |
---|---|
GB (1) | GB1255654A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5164996A (en) * | 1986-04-07 | 1992-11-17 | Jose Pastor | Optical character recognition by detecting geo features |
-
1968
- 1968-07-26 GB GB35873/68A patent/GB1255654A/en not_active Expired
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5164996A (en) * | 1986-04-07 | 1992-11-17 | Jose Pastor | Optical character recognition by detecting geo features |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Smith et al. | A general algorithm for solution of the n-job, M-machine sequencing problem of the flow shop | |
US5778000A (en) | Frame synchronization method | |
GB1255654A (en) | Improvements in or relating to character recognition systems | |
US3740538A (en) | Digital sorter and ranker | |
GB1284421A (en) | Data processing apparatus | |
JPS5340244A (en) | On-line system constitution system | |
JPS6426979A (en) | Searching device for logic circuit | |
Dinitz et al. | A fast algorithm for finding strong starters | |
GB1375992A (en) | ||
JPH04153764A (en) | System for increasing processing speed of decentralized cpu | |
US3374486A (en) | Information retrieval system | |
Wu | Continuity in topological groups | |
JPS644872A (en) | Method and device for processing image information | |
JPH04315259A (en) | Character string collation processing system | |
JPS5870382A (en) | On-line handwriting character recognizing device | |
SU851744A2 (en) | Digital adjustable delay line | |
JPH05750B2 (en) | ||
KR940003619B1 (en) | Key scanning method and processing apparatus therefor | |
SU628507A1 (en) | Graphic information readout arrangement | |
OA01234A (en) | A method and apparatus for transporting a fluid from offshore to land. | |
MAIsoNNEuvE | Processes of excursions and processes of incursions(Markovian characteristics of time dependent excursions and independent incursions processes provided with limits to left and continuous to right, noting Poisson punctual process and Borel sets) | |
JPS60249554A (en) | Automatic feed inversion for profile machining | |
ATE30792T1 (en) | METHOD AND ARRANGEMENT FOR RETRIEVING DATA OF A DATA SEQUENCE CORRESPONDING TO A PREFERRED SEARCH ARGUMENT IN A HYBRID ASSOCIATIVE MEMORY. | |
PAPANTONI-KAZAKOS et al. | Robust algorithms for detecting a change in a stochastic process with infinite memory(Technical Report, 1 Jul. 1987- 30 Jun. 1988) | |
Hwan | A Note on the Minimization of the Expected Makespan and the Expected Flow Time in M Machine Flow Shops with Blocking |