Evaluation of effective data reduction methods for MMR coding
Identifieur interne : 004B48 ( Istex/Corpus ); précédent : 004B47; suivant : 004B49Evaluation 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 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><affiliation><mods:affiliation>Data Storage and Retrieval Division, Hitachi Ltd, Odawara, Japan 250</mods:affiliation></affiliation></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></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><mods:affiliation>Data Storage and Retrieval Division, Hitachi Ltd, Odawara, Japan 250</mods:affiliation></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><istex><corpusName>wiley</corpusName><author><json:item><name>Yasuo Kurosu</name><affiliations><json:string>Data Storage and Retrieval Division, Hitachi Ltd, Odawara, Japan 250</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>binary image</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>image compression</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>high quality</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>MMR code</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>MH code</value></json:item></subject><articleId><json:string>SCJ2</json:string></articleId><language><json:string>eng</json:string></language><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</abstract><qualityIndicators><score>6.618</score><pdfVersion>1.3</pdfVersion><pdfPageSize>612 x 792 pts (letter)</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>5</keywordCount><abstractCharCount>885</abstractCharCount><pdfWordCount>4998</pdfWordCount><pdfCharCount>28078</pdfCharCount><pdfPageCount>10</pdfPageCount><abstractWordCount>135</abstractWordCount></qualityIndicators><title>Evaluation of effective data reduction methods for MMR coding</title><genre.original><json:string>article</json:string></genre.original><genre><json:string>article</json:string></genre><host><volume>29</volume><publisherId><json:string>SCJ</json:string></publisherId><pages><total>10</total><last>18</last><first>9</first></pages><issn><json:string>0882-1666</json:string></issn><issue>2</issue><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1520-684X</json:string></eissn><title>Systems and Computers in Japan</title><doi><json:string>10.1002/(ISSN)1520-684X</json:string></doi></host><publicationDate>1998</publicationDate><copyrightDate>1998</copyrightDate><doi><json:string>10.1002/(SICI)1520-684X(199802)29:2>9::AID-SCJ2>3.0.CO;2-N</json:string></doi><id>8023E7A0D4B967E02CCC11550DDB8F01EF8754DB</id><score>1</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/8023E7A0D4B967E02CCC11550DDB8F01EF8754DB/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/8023E7A0D4B967E02CCC11550DDB8F01EF8754DB/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/8023E7A0D4B967E02CCC11550DDB8F01EF8754DB/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Evaluation of effective data reduction methods for MMR coding</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>New York</pubPlace><availability><p>WILEY</p></availability><date>1998</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Evaluation of effective data reduction methods for MMR coding</title><author><persName><forename type="first">Yasuo</forename><surname>Kurosu</surname></persName><note type="correspondence"><p>Correspondence: Data Storage and Retrieval Division, Hitachi Ltd, Odawara, Japan 250</p></note><affiliation>Data Storage and Retrieval Division, Hitachi Ltd, Odawara, Japan 250</affiliation></author></analytic><monogr><title level="j">Systems and Computers in Japan</title><title level="j" type="abbrev">Syst. Comp. Jpn.</title><idno type="pISSN">0882-1666</idno><idno type="eISSN">1520-684X</idno><idno type="DOI">10.1002/(ISSN)1520-684X</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>New York</pubPlace><date type="published" when="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></monogr><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></fileDesc><profileDesc><creation><date>1998</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>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</p></abstract><textClass xml:lang="en"><keywords scheme="keyword"><list><head>keywords</head><item><term>binary image</term></item><item><term>image compression</term></item><item><term>high quality</term></item><item><term>MMR code</term></item><item><term>MH code</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1998-02">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/8023E7A0D4B967E02CCC11550DDB8F01EF8754DB/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Wiley, elements deleted: body"><istex:xmlDeclaration>version="1.0" encoding="UTF-8" standalone="yes"</istex:xmlDeclaration><istex:document><component version="2.0" type="serialArticle" xml:lang="en"><header><publicationMeta level="product"><publisherInfo><publisherName>Wiley Subscription Services, Inc., A Wiley Company</publisherName><publisherLoc>New York</publisherLoc></publisherInfo><doi registered="yes">10.1002/(ISSN)1520-684X</doi><issn type="print">0882-1666</issn><issn type="electronic">1520-684X</issn><idGroup><id type="product" value="SCJ"></id></idGroup><titleGroup><title type="main" xml:lang="en" sort="SYSTEMS AND COMPUTERS IN JAPAN">Systems and Computers in Japan</title><title type="short">Syst. Comp. Jpn.</title></titleGroup></publicationMeta><publicationMeta level="part" position="20"><doi origin="wiley" registered="yes">10.1002/(SICI)1520-684X(199802)29:2<>1.0.CO;2-4</doi><numberingGroup><numbering type="journalVolume" number="29">29</numbering><numbering type="journalIssue">2</numbering></numberingGroup><coverDate startDate="1998-02">February 1998</coverDate></publicationMeta><publicationMeta level="unit" type="article" position="2" status="forIssue"><doi origin="wiley" registered="yes">10.1002/(SICI)1520-684X(199802)29:2<9::AID-SCJ2>3.0.CO;2-N</doi><idGroup><id type="unit" value="SCJ2"></id></idGroup><countGroup><count type="pageTotal" number="10"></count></countGroup><copyright ownership="thirdParty">Copyright © 1998 Scripta Technica</copyright><eventGroup><event type="firstOnline" date="1999-01-06"></event><event type="publishedOnlineFinalForm" date="1999-01-06"></event><event type="xmlConverted" agent="Converter:JWSART34_TO_WML3G version:2.3.2 mode:FullText source:HeaderRef result:HeaderRef" date="2010-03-04"></event><event type="xmlConverted" agent="Converter:WILEY_ML3G_TO_WILEY_ML3GV2 version:3.8.8" date="2014-02-08"></event><event type="xmlConverted" agent="Converter:WML3G_To_WML3G version:4.1.7 mode:FullText,remove_FC" date="2014-11-04"></event></eventGroup><numberingGroup><numbering type="pageFirst">9</numbering><numbering type="pageLast">18</numbering></numberingGroup><correspondenceTo>Data Storage and Retrieval Division, Hitachi Ltd, Odawara, Japan 250</correspondenceTo><linkGroup><link type="toTypesetVersion" href="file:SCJ.SCJ2.pdf"></link></linkGroup></publicationMeta><contentMeta><countGroup><count type="figureTotal" number="12"></count><count type="tableTotal" number="1"></count><count type="referenceTotal" number="10"></count></countGroup><titleGroup><title type="main" xml:lang="en">Evaluation of effective data reduction methods for MMR coding</title></titleGroup><creators><creator xml:id="au1" creatorRole="author" affiliationRef="#af1" corresponding="yes"><personName><givenNames>Yasuo</givenNames><familyName>Kurosu</familyName></personName></creator></creators><affiliationGroup><affiliation xml:id="af1" countryCode="JP" type="organization"><unparsedAffiliation>Data Storage and Retrieval Division, Hitachi Ltd, Odawara, Japan 250</unparsedAffiliation></affiliation></affiliationGroup><keywordGroup xml:lang="en" type="author"><keyword xml:id="kwd1">binary image</keyword><keyword xml:id="kwd2">image compression</keyword><keyword xml:id="kwd3">high quality</keyword><keyword xml:id="kwd4">MMR code</keyword><keyword xml:id="kwd5">MH code</keyword></keywordGroup><abstractGroup><abstract type="main" xml:lang="en"><title type="main">Abstract</title><p>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</p></abstract></abstractGroup></contentMeta></header></component></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Evaluation of effective data reduction methods for MMR coding</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Evaluation of effective data reduction methods for MMR coding</title></titleInfo><name type="personal"><namePart type="given">Yasuo</namePart><namePart type="family">Kurosu</namePart><affiliation>Data Storage and Retrieval Division, Hitachi Ltd, Odawara, Japan 250</affiliation><description>Correspondence: Data Storage and Retrieval Division, Hitachi Ltd, Odawara, Japan 250</description><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="article" displayLabel="article"></genre><originInfo><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><place><placeTerm type="text">New York</placeTerm></place><dateIssued encoding="w3cdtf">1998-02</dateIssued><copyrightDate encoding="w3cdtf">1998</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType><extent unit="figures">12</extent><extent unit="tables">1</extent><extent unit="references">10</extent></physicalDescription><abstract 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</abstract><subject lang="en"><genre>keywords</genre><topic>binary image</topic><topic>image compression</topic><topic>high quality</topic><topic>MMR code</topic><topic>MH code</topic></subject><relatedItem type="host"><titleInfo><title>Systems and Computers in Japan</title></titleInfo><titleInfo type="abbreviated"><title>Syst. Comp. Jpn.</title></titleInfo><genre type="journal">journal</genre><identifier type="ISSN">0882-1666</identifier><identifier type="eISSN">1520-684X</identifier><identifier type="DOI">10.1002/(ISSN)1520-684X</identifier><identifier type="PublisherID">SCJ</identifier><part><date>1998</date><detail type="volume"><caption>vol.</caption><number>29</number></detail><detail type="issue"><caption>no.</caption><number>2</number></detail><extent unit="pages"><start>9</start><end>18</end><total>10</total></extent></part></relatedItem><identifier type="istex">8023E7A0D4B967E02CCC11550DDB8F01EF8754DB</identifier><identifier type="DOI">10.1002/(SICI)1520-684X(199802)29:2<9::AID-SCJ2>3.0.CO;2-N</identifier><identifier type="ArticleID">SCJ2</identifier><accessCondition type="use and reproduction" contentType="copyright">Copyright © 1998 Scripta Technica</accessCondition><recordInfo><recordContentSource>WILEY</recordContentSource><recordOrigin>Wiley Subscription Services, Inc., A Wiley Company</recordOrigin></recordInfo></mods></metadata><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004B48 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 004B48 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Istex
|étape= Corpus
|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. |  |