摘要:
A pixel data encoder for use in a facsimile apparatus, features a first in first out memory (40) for storing one-dimensional binary pixel data sequences in synchronism with a data acquisition clock; a run length determiner (46) coupled to receive the one-dimensional binary pixel data stored in the first in first out memory, the run length determiner calculating white and black run lengths based on the one-dimensional binary pixel data received; and an encoding section (48) which issues one-bit address signal indicative of raw data and issues an N-bit raw data in the event that the run length is less than a predetermined run length N, the encoding section producing an address code and a remainder code in the event that the run length exceeds N, the address code consisting of consecutive binary level "1"s with a bit length (M-2) and a binary level "0", and the remainder code consisting of binary sequence representing the run length wherein the most significant bit is omitted, M representing the binary digit of the run length.
摘要:
A method for converting an image from a run represen-; tation to a bit map, includes the steps of: storing a plurality of run representations of an image in a buffer; initializing a line of data; converting, by table lookup, each run representation, in said line, to a picture element representation, storing said picture element representation of said line; repeating the steps of initializing, converting and storing for remaining run representations until said image has been converted to a bit map representation.
摘要:
A graphic image represented by a two-level pel-to-pel definition is compressed by one-dimensional redundancy reduction coding using an entropy preserving algorithm which allows for real time reduction of the pel-to-pel data without any loss in image resolution. The compressed data is concatenated for transmission and then separated and decoded back to a pel-to-pel format for defining a facsimile image.
摘要:
Even when character information is contained in a high-resolution image, it is possible to reduce the line memory capacity and effectively encoding/compressing the image. For every block update for an image divided into identical M (M is an integer not smaller than 1) blocks in the horizontal direction, for each of the horizontal lines in the blocks, a line memory (41) and an exclusive OR circuit (42) successively detect a difference between color codes at corresponding pixel positions in a horizontal line and the adjacent preceding horizontal line. Moreover, a run end detection circuit (43) detects a run from the difference corresponding to the horizontal line from the circuit (42). When a code creation/output circuit (44) encodes the run length, the code word for the first run includes information on the difference in the run while the code word for runs other than the first run includes, instead of the difference information in the run, transition type information indicating the type of transition to the difference in the run of the difference in the preceding run, thereby performing run length encoding.
摘要:
In the case of telefax, coding was carried until now on the basis of the run length principle, i.e. all image points of the same colour are digitally sensed until a change occurs and coded according to the MHC process. The transmission is then carried out on the basis of the phase difference or amplitude-phase-difference modulation. In the case of television, disturbances known under the terms cross colour and cross luminance were caused by the mutliplicity of carriers. The disclosed invention avoids coding delays in the case of telefax, since only the individual digits that compose the numbers are coded, for example the digits 1 to 0 for white and black. Only 20 combinations are thus required for coding. In order to further shorten transmission time, white-only lines are condensed. In the case of television, a code multiplexing condensation of all signals allows only one carrier to be used.
摘要:
An encoding (or decoding) method, by which raw data of 1 line converted into, for example, modified Huffman (MH) code (or MH code is converted into raw data) by obtaining a cumulative run-length code every transition point, at which there occurs a transition or change between a run of white to another contiguous run of black pixels, from the beginning of the line and then converting the cumulative run-length code to the MH code (or converting the MH code to the cumulative run-length code). The cumulative run-length code is defined by both of data, which indicates that a pixel of a run just prior to the transition point is black or white, and data representing a cumulative run-length of the run up to the pixel thereof just prior to the transition point. Thus, an encoding or decoding processing can be performed at a high speed
摘要:
Dans le cas des télécopieurs, le codage se faisait jusqu'à maintenant sur la base du principe des longueurs de projection, c'est-à-dire, tous les points d'image de même couleur sont saisis numériquement jusqu'à ce qu'un changement survienne, et sont codés selon le procédé MHC. La transmission se fait ensuite sur la base de la modulation de la différence entre les phases ou de la différence entre les amplitudes et les phases. Dans le cas de la télévision, l'utilisation de différentes porteuses causait des perturbations connues sous les noms de "cross colour" et de "cross luminance". La présente invention permet de réduire les délais dûs au codage dans le cas des télécopieurs, étant donné que seuls les chiffres individuels composant les nombres sont codés, par exemple les chiffres 1 à 0 pour blanc et noir. Le codage ne requiert ainsi que 20 combinaisons. Le temps de transmission est encore réduit en condensant toutes les lignes uniquement blanches. Dans le cas de la télévision, une condensation par multiplexage de codage de tous les signaux permet d'utiliser une seule porteuse.
摘要:
An encoding (or decoding) method, by which raw data of 1 line converted into, for example, modified Huffman (MH) code (or MH code is converted into raw data) by obtaining a cumulative run-length code every transition point, at which there occurs a transition or change between a run of white to another contiguous run of black pixels, from the beginning of the line and then converting the cumulative run-length code to the MH code (or converting the MH code to the cumulative run-length code). The cumulative run-length code is defined by both of data, which indicates that a pixel of a run just prior to the transition point is black or white, and data representing a cumulative run-length of the run up to the pixel thereof just prior to the transition point. Thus, an encoding or decoding processing can be performed at a high speed