Evaluation of effective data reduction methods for MMR coding
Identifieur interne : 004D84 ( Main/Merge ); précédent : 004D83; suivant : 004D85Evaluation of effective data reduction methods for MMR coding
Auteurs : Yasuo KurosuSource :
- Systems and Computers in Japan [ 0882-1666 ] ; 1998-02.
English descriptors
- KwdEn :
Abstract
To obtain higher speed and higher quality of image communications economically, a standard coding method with a higher efficiency is required. This paper proposes three methods to eliminate horizontal‐mode codes (which are mainly contained in noise components) from each coding process. The idea is based on the fact that MMR coding can be highly compressed by rising 2‐D correlations. The three proposed methods are compared in respect of compression rate, processing speed, and image quality by using document images. The results show that the run‐length code reduction method is best, the compression rate being higher than conventional methods by 19.6% (maximum) and 12.7% (mean), the processing speed being 2803 times that of conventional binary‐image processing, and the image quality being high due to noise elimination. © 1998 Scripta Technica. Syst Comp Jpn, 29(2): 9–18, 1998
Url:
DOI: 10.1002/(SICI)1520-684X(199802)29:2<9::AID-SCJ2>3.0.CO;2-N
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 004B48
- to stream Istex, to step Curation: 004B48
- to stream Istex, to step Checkpoint: 003791
Links to Exploration step
ISTEX:8023E7A0D4B967E02CCC11550DDB8F01EF8754DBLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Evaluation of effective data reduction methods for MMR coding</title><author><name sortKey="Kurosu, Yasuo" sort="Kurosu, Yasuo" uniqKey="Kurosu Y" first="Yasuo" last="Kurosu">Yasuo Kurosu</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8023E7A0D4B967E02CCC11550DDB8F01EF8754DB</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1002/(SICI)1520-684X(199802)29:2<9::AID-SCJ2>3.0.CO;2-N</idno><idno type="url">https://api.istex.fr/document/8023E7A0D4B967E02CCC11550DDB8F01EF8754DB/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">004B48</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">004B48</idno><idno type="wicri:Area/Istex/Curation">004B48</idno><idno type="wicri:Area/Istex/Checkpoint">003791</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003791</idno><idno type="wicri:doubleKey">0882-1666:1998:Kurosu Y:evaluation:of:effective</idno><idno type="wicri:Area/Main/Merge">004D84</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Evaluation of effective data reduction methods for MMR coding</title><author><name sortKey="Kurosu, Yasuo" sort="Kurosu, Yasuo" uniqKey="Kurosu Y" first="Yasuo" last="Kurosu">Yasuo Kurosu</name><affiliation><wicri:noCountry code="subField">250</wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="j">Systems and Computers in Japan</title><title level="j" type="abbrev">Syst. Comp. Jpn.</title><idno type="ISSN">0882-1666</idno><idno type="eISSN">1520-684X</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>New York</pubPlace><date type="published" when="1998-02">1998-02</date><biblScope unit="volume">29</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="9">9</biblScope><biblScope unit="page" to="18">18</biblScope></imprint><idno type="ISSN">0882-1666</idno></series><idno type="istex">8023E7A0D4B967E02CCC11550DDB8F01EF8754DB</idno><idno type="DOI">10.1002/(SICI)1520-684X(199802)29:2<9::AID-SCJ2>3.0.CO;2-N</idno><idno type="ArticleID">SCJ2</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0882-1666</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>MH code</term><term>MMR code</term><term>binary image</term><term>high quality</term><term>image compression</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">To obtain higher speed and higher quality of image communications economically, a standard coding method with a higher efficiency is required. This paper proposes three methods to eliminate horizontal‐mode codes (which are mainly contained in noise components) from each coding process. The idea is based on the fact that MMR coding can be highly compressed by rising 2‐D correlations. The three proposed methods are compared in respect of compression rate, processing speed, and image quality by using document images. The results show that the run‐length code reduction method is best, the compression rate being higher than conventional methods by 19.6% (maximum) and 12.7% (mean), the processing speed being 2803 times that of conventional binary‐image processing, and the image quality being high due to noise elimination. © 1998 Scripta Technica. Syst Comp Jpn, 29(2): 9–18, 1998</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004D84 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 004D84 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:8023E7A0D4B967E02CCC11550DDB8F01EF8754DB
|texte= Evaluation of effective data reduction methods for MMR coding
}}
| This area was generated with Dilib version V0.6.31. |  |