scispace - formally typeset
Search or ask a question

Showing papers on "Character (mathematics) published in 1983"



Journal ArticleDOI
J. M. White1, G. D. Rohrer1
TL;DR: Two new, cost-effective thresholding algorithms for use in extracting binary images of characters from machine- or hand-printed documents are described, with a more aggressive approach directed toward specialized, high-volume applications which justify extra complexity.
Abstract: Two new, cost-effective thresholding algorithms for use in extracting binary images of characters from machine- or hand-printed documents are described. The creation of a binary representation from an analog image requires such algorithms to determine whether a point is converted into a binary one because it falls within a character stroke or a binary zero because it does not. This thresholding is a critical step in Optical Character Recognition (OCR). It is also essential for other Character Image Extraction (CIE) applications, such as the processing of machine-printed or handwritten characters from carbon copy forms or bank checks, where smudges and scenic backgrounds, for example, may have to be suppressed. The first algorithm, a nonlinear, adaptive procedure, is implemented with a minimum of hardware and is intended for many CIE applications. The second is a more aggressive approach directed toward specialized, high-volume applications which justify extra complexity.

283 citations


Patent
29 Sep 1983
TL;DR: In this paper, a method and apparatus of processing data is disclosed for recognizing unknown characters of a known character set, some of the characters having diacritical marks, which includes the steps of storing the image data of an unknown character which may contain a dicritical mark.
Abstract: A method and apparatus of processing data is disclosed for recognizing unknown characters of a known character set, some of the characters having diacritical marks. The method includes the steps of storing the image data of an unknown character which may contain a diacritical mark. From the stored image data a predetermined localized area of data is extracted that corresponds to the expected location of the diacritical mark. The extracted diacritical mark image data and at least a portion of the stored image data of the unknown character are examined to recognize the character and any diacritical mark associated therewith. Also disclosed are video preprocessing techniques for segmenting the characters using profiles thereof, inclusive-bit-coding to separate characters based upon differences in size, justification of the extracted diacritical mark image data, unique encoding of the recognition results, and post-processing verification for characters including diacritical marks.

124 citations


Journal ArticleDOI
TL;DR: In this paper, a cohomological interpretation of the sign changes in harmonic analysis on reductive groups over local fields that are caused by inner twistings is provided. But the sign change is not defined.
Abstract: Let G be a connected reductive group over a field F. In this note the author constructs an element e(G) of the Brauer group of F. The square of this element is trivial. For a local field, e(G) may be regarded as an element of { ?I} and is needed for harmonic analysis on reductive groups over that field. For a global field there is a product formula. The purpose of this note is to provide a cohomological interpretation of the sign changes in harmonic analysis on reductive groups over local fields that are caused by inner twistings. The best understood example occurs in the work of Shelstad [8] on inner twistings of real groups. Theorem 6.3 of that paper gives the following character identity: -() = ( 1)q(G')-q(G)X( ) Here G is a connected reductive group over R, G' is its quasi-split inner form, X., and X. are stabilized characters of matched tempered L-packets of G'(R) and G(R), and y' and y are matched regular semisimple elements of G'(R) and G(R). The sign change in the character identity is ()q(G')-q(G) where q(G) is one half of the dimension of the symmetric space attached to G (more precisely, attached to the simply connected cover of the derived group of G). Although q(G) may be only half integral, the difference q(G') q(G) is always integral. It is reasonable to expect an analogous character identity for groups G over a nonarchimedean local field F. We can determine what the sign change must be by considering the Steinberg characters of G(F) and G'(F), since these should be related by the character identity. Let r(G) denote the F-rank of the derived group of G; the Steinberg character of G(F) has value ( I)r(G) on the elliptic regular set of G(F), and hence the sign change in the character identity must be (_l)r(G')-r(G). There are two groups for which the character identity has been proved: the multiplicative group of a central division algebra of dimension d2 over F for d = 2 (see Proposition 15.5 on p. 484 of [4]) and d = 3 (see Theorem 1 of [1]). Later in this paper we will use a cohomological construction to define a sign e(G) = 1 for any connected reductive group G over a local field. Let G' denote a quasi-split inner form of G. We will show that e(G) = (_l)r(G')-r(G) when the base Received by the editors May 10, 1982. 1980 Mathematics Subject Classification. Primary 22E50. Partially supported by the National Science Foundation under Grant MCS 78-02331. ?1983 American Mathematical Society 0002-9947/82/0000-11 93/$03.25

102 citations


Journal ArticleDOI
TL;DR: The concept of culture is supported by combined anthropological views on culture as discussed by the authors, which form the basis of TA Cultural Analysis, and correspond to the Parent, Adu, and Educator concepts.
Abstract: Berne's concept of culture is supported by combined anthropological views on culture. Etiquette, Technicality and Character form the basis of TA Cultural Analysis, and correspond to the Parent, Adu...

57 citations


Patent
01 Aug 1983
TL;DR: In this article, a method for recognizing and providing an output corresponding to a character in which the character is received by an imager, digitized, and transmitted to a memory is presented.
Abstract: A method for recognizing and providing an output corresponding to a character in which the character is received by an imager, digitized, and transmitted to a memory. Data in the memory is read in a sequence which circumnavigates the test character. Only data representative of the periphery of the character are read. During the circumnavigation, character parameters, such as height, width, perimeter, area and waveform are determined. The character parameters are compared with reference character parameters and the ASCII code for the reference character which matches the character is provided as an output.

52 citations


Patent
03 Mar 1983
TL;DR: In this paper, a discrimination signal is used to select the picture signals to be output only when the character signals do not exist in processing circuit, so that the characters may be processed with a resolving power higher than that for the original picture.
Abstract: In scanning and recording an original picture and a character document so as to produce a reproduce synthesized from said picture and said document, picture signals and character signals both generated by the scanning are arranged in data formats of the same word length. Each character signal is caused to correspond to plural fine picture elements that are defined by finely dividing one picture element of the original picture so that the characters may be processed with a resolving power higher than that for said picture. The data formats include a discrimination signal by which the picture signals are selected to be output only when the character signals do not exist in processing circuit.

52 citations


Journal ArticleDOI
Walter Feit1
TL;DR: In this paper, it was shown that the Schur index of an irreducible character of a finite group can be computed from a knowledge of the character table of the group.
Abstract: Let χ be an irreducible character of a finite groupG. Letp=∞ or a prime. Letm p (χ) denote the Schur index of χ overQ p , the completion ofQ atp. It is shown that ifx is ap′-element ofG such that $$X_u \left( x \right) \in Q_p \left( X \right)$$ for all irreducible charactersX u ofG thenm p (χ)/vbχ(x). This result provides an effective tool in computing Schur indices of characters ofG from a knowledge of the character table ofG. For instance, one can read off Benard’s Theorem which states that every irreducible character of the Weyl groupsW(E n), n=6,7,8 is afforded by a rational representation. Several other applications are given including a complete list of all local Schur indices of all irreducible characters of all sporadic simple groups and their covering groups (there is still an open question concerning one character of the double cover of Suz).

51 citations


Patent
13 Dec 1983
TL;DR: In this article, a photoreactive transducer is employed to detect the presence of a touch and luminous character information in a CRT display, which is then employed to interrogate registers associated with the raster scan circuitry.
Abstract: A touch-sensitive overlay (20) for cooperative, optically proximate engagement with a visual display (22) of luminous character information (38) latently occupying one or more of a plurality of character locations (26) defined with a position-multiplexed coordinate array one from another, is comprised of a mask (44) of a photoreactive transducer (52) having at least one photoelectric parameter which varies as a function of incident light from the display of character information striking the transducer, and a signal circuit element (92) responsive to a variation in the photoelectric parameter in communication with the mask for developing a characteristic logic pulse indicative of the position of one or more character locations within the array upon a touch thereof and the coincident presence of character information thereat (48). In a highly preferred implementation, the visual display is a CRT display where the raster scan (24) and associated driving circuitry (96) provides -the position-multiplexing of character locations and selective illumination thereof, while the photoreactive transducer is an open photovoltaic cell for developing a localized electric potential at luminous character locations, completed upon a manual touch by the operator at a selected location to develop an output voltage pulse indicative of the position(s) touched, which pulse is thence employed to interrogate registers (98) associated with the raster scan circuitry in order to provide spatial determination of the location(s) corresponomg to une comnc- dent presence of a touch and luminous character information thereat.

45 citations


Journal ArticleDOI
TL;DR: A method for handprinted Kanji character classificatin is proposed and a feature vector that represents the distribution of strokes is generated and is matched with average vectors in a dictionary.

44 citations


Patent
21 Oct 1983
TL;DR: In this paper, an apparatus for recognizing a character written using a stylus applied to a tablet which stylus and tablet include an arrangement for providing an indication of position of the stylus with respect to a surface of the tablet.
Abstract: An apparatus for recognizing a character (including an alpha-numeric character, mark or other character) written using a stylus applied to a tablet which stylus and tablet include an arrangement for providing an indication of position of the stylus with respect to a surface of the tablet. The character recognition apparatus determines the length and gradient (slope) of line segments of strokes drawn by a user which strokes combine to form characters. After determining length and gradient of a line segment, there is assigned to the line segment a distinctive code. A particular character is determined by examining the order of codes which define particular combinations of strokes. Recognition of characters is carried out in substantially real time.

Patent
01 Sep 1983
TL;DR: In this paper, a front for test patterns is made programmable by programming individual "characters" to be displayed on a video display, which can be adjusted in height and width, as well as in color and intensity.
Abstract: A front for test patterns is made programmable by programming individual "characters" to be displayed on a video display. The individual characters are assigned memory locations and can be adjusted in height and width, as well as in color and intensity. Complex characters are formed by programming additional features onto a character memory space assigned to each character. The system provides a greater ratio of pattern generating capability-to-required hardware, while providing most features of a fixed character generator. The system's programmability is particularly adapted to use with a test system which has capabilities of incrementally varying scan rate and raster patterns, as well as a capability of random stroke and fixed mode stimuli generation.

Journal ArticleDOI
TL;DR: In the Aeneid, actions are consistent with character and psychology, indeed indicative of character and behavior as discussed by the authors, and one should not hastily assume otherwise, even if one is inclined to do so.
Abstract: In the Aeneid actions are consistent with character and psychology, indeed indicative of character and psychology. This statement has, I think, general if not universal truth. At any rate, one should not hastily assume otherwise.

Journal ArticleDOI
TL;DR: In this article, a detailed exposition of the construction of models of tori that are not decomposable over the base field is given, and a quite complete description of projective Demazure models in low dimensions is given.
Abstract: This paper gives a detailed exposition of the construction of models of tori that are not decomposable over the base field. The presence of a finite number of nonconjugate subgroups in the group GL(n,Z) enables one to classify the tori of given dimension by the Bravais type of their modules of rational characters. A quite complete description of projective Demazure models in low dimensions is given. The rationality of tori with cubic character lattices is proved. Bibliography: 15 titles.


Patent
01 Feb 1983
TL;DR: In this paper, a method for compressing character or pictorial image data which contemplates to compress a quantity of data by means of establishing sampling points and establishing blocks as well as storing information for specifying outlines of a character in the case where the outlines of characters, pictorial images or the like are approximated with sets of functional curves or straight lines.
Abstract: A method for compressing character or pictorial image data which contemplates to compress a quantity of data by means of a method for establishing sampling points and a method for establishing blocks as well as storing information for specifying outlines of a character in the case where the outlines of character, pictorial image or the like are approximated with sets of functional curves or straight lines to effect data compression.



Patent
29 Sep 1983
TL;DR: In this article, a method and apparatus for segmenting character images in an optical image system where the character images have a predetermined pitch was described. But the method was not described.
Abstract: A method and apparatus are disclosed for segmenting character images in an optical image system where the character images have a predetermined pitch. The optical image system generates character information in the form of a successive series of scan lines of data. Profiles of the character images being scanned are generated, and a profile segment meeting certain criteria is selected. The center of the selected profile segment is located, and segmentation points between the character images are established as a linear function of the character image pitch and located center. The segmentation points are integer multiples of the pitch.

Journal ArticleDOI
TL;DR: In this paper, the authors explore an idea first recognized in 1927 which links atomic size to metallic properties, and explore an approach to link atomic size and metallic properties in the same way.
Abstract: The authors explore an idea first recognized in 1927 which links atomic size to metallic properties.




Book
01 Mar 1983
TL;DR: In this article, a ready reference details every cartoon and every cartoon character ever created and every production from 1911 to the present with more than 2200 cartoon entries, including more than 1,200 cartoon characters.
Abstract: This ready reference details every cartoon and every cartoon character ever created. This guide documents every production from 1911 to the present with more than 2200 cartoon entries.'

Patent
13 Jun 1983
TL;DR: In this paper, an image of a two-dimensional matrix to be displayed is formed in a refresh memory entirely by the execution of sequences of "pattern modulated" line segments termed "vectors", two sequences of vectors are generated for writing each character cell into the refresh memory.
Abstract: An image of a two-dimensional matrix to be displayed is formed in a refresh memory entirely by the execution of sequences of "pattern modulated" line segments termed "vectors". Two sequences of vectors are generated for writing each character cell into the refresh memory. The first, or outer, sequence provides the starting position and pattern for each of the vectors in a second, or inner, sequence. The inner and outer vectors are generated, respectively by inner and outer vector generators. Both inner and outer vectors are drawn from a current, starting position in a selected direction to an end point position a given length away, based upon the contents of definable registers in the image generating hardware. One of the registers identifies the data to be written into the successive pixel locations in memory selected by the vector generators during the writing of each line segment. Characters are drawn by breaking the two-dimensional character pattern into a set of nested one-dimensional patterns, which are related to columns and rows. Each row of the character pattern is drawn by generating an inner vector at an angle and length selected for the cell. The vector length is set equal to the width of the character and other variables are set appropriately to generate the desired angle. A second vector generating procedure is used to create a vector which, instead of providing illumination points, provides the starting (x,y) location to be used for drawing each successive inner vector in the matrix. This vector, too, has a starting location, length spatial orientation, and a pattern. The angle of the outer vector can be set independently of the angle of the inner vector. The direction, repetition, and location of these sequences may be varied dynamically, creating the ability to vary the size, angular orientation and spacing of characters, as well as font, plus providing other text enhancements.

Patent
12 Aug 1983
TL;DR: In this article, a raster scan display system includes a plurality of storage maps, which can be addressable in either of two modes: the first mode contains bit mapped data and the maps are addressed together to provide color signals from which color video signals are derived; the second mode contains character representing data and a further map, character display dot patterns.
Abstract: A raster scan display system includes a plurality of storage maps. These maps are addressable in either of two modes. In the first mode each map contains bit mapped data and the maps are addressed together to provide color signals from which color video signals are derived. In the second mode, one map contains character representing data and a further map, character display dot patterns. In this mode the first map is addressed to provide partial addresses for the further map. These partial addresses are combined with row scan data signals to access the further map from which the character display dot data is used to generate the video signals.


Patent
07 Dec 1983
TL;DR: In this paper, the read character information is stored primarily character by character each for approximately one and a half line width and the 15-line information is then dissected in the line direction into blocks each having a line length of two character spacings.
Abstract: An apparatus for a printed character reading system in which prior to the recognition process, the information obtained by reading the characters on a source document is separated line by line to obtain a line information and then, starting at its one end, the line information is successively separated character by character to obtain a character information for each of the individual characters In this apparatus, the read character information is stored primarily character by character each for approximately one and a half line width and the 15-line information is then dissected in the line direction into blocks each having a line length of two character spacings Then, a linewise projection information is produced for each of the blocks so that in accordance with the resulting projection information the intended line information is separated into blocks and then the character information for the respective characters are separated successively from the character information contained in each of the blocks

Patent
26 Aug 1983
TL;DR: In this article, a page containing characters to be read is scanned with successive scan lines from top to bottom and the data contained in each scan line is transmitted to a buffer memory for temporary storage.
Abstract: A method for scanning a page and locating individual characters on that page so that character recognition can be performed is disclosed. A page containing characters to be read is scanned with successive scan lines from top to bottom and the data contained in each scan line is transmitted to a buffer memory for temporary storage. An additional set of data which represents the significant amount of character information within a scan line is also generated and stored in a separate memory. When the microprocessor is ready to begin recognizing characters the set of data which indicates those scan lines containing significant character data is accessed and read. The microprocessor then accesses a different set of data which represents the significant character information as arranged in vertical pixel lines. When the microprocessor locates a vertical pixel line having significant character information the microprocessor then begins reading data from the buffer memory at locations as determined by the external data sets. The microprocessor does not read data in the buffer memory unless it corresponds to areas in which significant character data is located. The microprocessor is able to quickly scan an entire page and locate all characters within the page to provide for fast optical character recognition.