A breadth-first quadtree coding scheme for multicolored spatial data
Identifieur interne : 000A99 ( Istex/Corpus ); précédent : 000A98; suivant : 000B00A breadth-first quadtree coding scheme for multicolored spatial data
Auteurs : Henry Ker-Chang Chang ; Cheng-Kuan TsoSource :
- Computers and Geosciences [ 0098-3004 ] ; 1996.
Abstract
In this paper, we apply the newly developed linear quadtree coding technique 2DTE to construct a single multicolored quadtree for a multicolored thematic map. The proposed 2DTE technique is designed on the basis of a Morton sequence, template matching, and the breadth-first traversal order. With the Morton sequence, we can generate the quaternary codes for various functions of a multicolored thematic map; the decision of decomposition is derived using the concept of template matching. The performance, in terms of memory space and time complexity, for the proposed 2DTE technique is analyzed and compared using an agricultural image of four objects. The result of a single multicolored quadtree derived by the breadth-first traversal order is compared with that of a set of linear quadtrees based on Gargantini's method. The experimental results show that the proposed method has an advantage of obvious memory space reduction over the result of Gargantini's method. Besides, theoretic analysis is derived from an image of size 2n × 2n, where n is the resolution parameter and there are 2n × 2n colors. The proposed method needs 8n × 4n − 1 bits to encode whereas Gargantini's method needs 12n × 4n − 1 bits. The feasibility of the proposed scheme therefore can be verified by the performance comparisons.
Url:
DOI: 10.1016/0098-3004(95)00087-9
Links to Exploration step
ISTEX:1C80FFB74800724119AEC5E0AE528F79053BA78FLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>A breadth-first quadtree coding scheme for multicolored spatial data</title><author><name sortKey="Chang, Henry Ker Chang" sort="Chang, Henry Ker Chang" uniqKey="Chang H" first="Henry Ker-Chang" last="Chang">Henry Ker-Chang Chang</name><affiliation><mods:affiliation>Graduate School of Resources Management, National Defense Management College, P.O. Box 90046-17, Chung-Ho, Taipei, Taiwan, Republic of China</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: chang@rs360.ndmc.edu.tw</mods:affiliation></affiliation></author><author><name sortKey="Tso, Cheng Kuan" sort="Tso, Cheng Kuan" uniqKey="Tso C" first="Cheng-Kuan" last="Tso">Cheng-Kuan Tso</name><affiliation><mods:affiliation>Graduate School of Resources Management, National Defense Management College, P.O. Box 90046-17, Chung-Ho, Taipei, Taiwan, Republic of China</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1C80FFB74800724119AEC5E0AE528F79053BA78F</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1016/0098-3004(95)00087-9</idno><idno type="url">https://api.istex.fr/document/1C80FFB74800724119AEC5E0AE528F79053BA78F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000A99</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000A99</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">A breadth-first quadtree coding scheme for multicolored spatial data</title><author><name sortKey="Chang, Henry Ker Chang" sort="Chang, Henry Ker Chang" uniqKey="Chang H" first="Henry Ker-Chang" last="Chang">Henry Ker-Chang Chang</name><affiliation><mods:affiliation>Graduate School of Resources Management, National Defense Management College, P.O. Box 90046-17, Chung-Ho, Taipei, Taiwan, Republic of China</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: chang@rs360.ndmc.edu.tw</mods:affiliation></affiliation></author><author><name sortKey="Tso, Cheng Kuan" sort="Tso, Cheng Kuan" uniqKey="Tso C" first="Cheng-Kuan" last="Tso">Cheng-Kuan Tso</name><affiliation><mods:affiliation>Graduate School of Resources Management, National Defense Management College, P.O. Box 90046-17, Chung-Ho, Taipei, Taiwan, Republic of China</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Computers and Geosciences</title><title level="j" type="abbrev">CAGEO</title><idno type="ISSN">0098-3004</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1996">1996</date><biblScope unit="volume">22</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="139">139</biblScope><biblScope unit="page" to="143">143</biblScope></imprint><idno type="ISSN">0098-3004</idno></series><idno type="istex">1C80FFB74800724119AEC5E0AE528F79053BA78F</idno><idno type="DOI">10.1016/0098-3004(95)00087-9</idno><idno type="PII">0098-3004(95)00087-9</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0098-3004</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this paper, we apply the newly developed linear quadtree coding technique 2DTE to construct a single multicolored quadtree for a multicolored thematic map. The proposed 2DTE technique is designed on the basis of a Morton sequence, template matching, and the breadth-first traversal order. With the Morton sequence, we can generate the quaternary codes for various functions of a multicolored thematic map; the decision of decomposition is derived using the concept of template matching. The performance, in terms of memory space and time complexity, for the proposed 2DTE technique is analyzed and compared using an agricultural image of four objects. The result of a single multicolored quadtree derived by the breadth-first traversal order is compared with that of a set of linear quadtrees based on Gargantini's method. The experimental results show that the proposed method has an advantage of obvious memory space reduction over the result of Gargantini's method. Besides, theoretic analysis is derived from an image of size 2n × 2n, where n is the resolution parameter and there are 2n × 2n colors. The proposed method needs 8n × 4n − 1 bits to encode whereas Gargantini's method needs 12n × 4n − 1 bits. The feasibility of the proposed scheme therefore can be verified by the performance comparisons.</div></front></TEI><istex><corpusName>elsevier</corpusName><author><json:item><name>Henry Ker-Chang Chang</name><affiliations><json:string>Graduate School of Resources Management, National Defense Management College, P.O. Box 90046-17, Chung-Ho, Taipei, Taiwan, Republic of China</json:string><json:string>E-mail: chang@rs360.ndmc.edu.tw</json:string></affiliations></json:item><json:item><name>Cheng-Kuan Tso</name><affiliations><json:string>Graduate School of Resources Management, National Defense Management College, P.O. Box 90046-17, Chung-Ho, Taipei, Taiwan, Republic of China</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>Linear quadtree</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Two-dimensional template-based encoding (2DTE)</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Multicolored spatial data</value></json:item></subject><language><json:string>eng</json:string></language><originalGenre><json:string>Full-length article</json:string></originalGenre><abstract>In this paper, we apply the newly developed linear quadtree coding technique 2DTE to construct a single multicolored quadtree for a multicolored thematic map. The proposed 2DTE technique is designed on the basis of a Morton sequence, template matching, and the breadth-first traversal order. With the Morton sequence, we can generate the quaternary codes for various functions of a multicolored thematic map; the decision of decomposition is derived using the concept of template matching. The performance, in terms of memory space and time complexity, for the proposed 2DTE technique is analyzed and compared using an agricultural image of four objects. The result of a single multicolored quadtree derived by the breadth-first traversal order is compared with that of a set of linear quadtrees based on Gargantini's method. The experimental results show that the proposed method has an advantage of obvious memory space reduction over the result of Gargantini's method. Besides, theoretic analysis is derived from an image of size 2n × 2n, where n is the resolution parameter and there are 2n × 2n colors. The proposed method needs 8n × 4n − 1 bits to encode whereas Gargantini's method needs 12n × 4n − 1 bits. The feasibility of the proposed scheme therefore can be verified by the performance comparisons.</abstract><qualityIndicators><score>7.49</score><pdfVersion>1.2</pdfVersion><pdfPageSize>504 x 756 pts</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>3</keywordCount><abstractCharCount>1310</abstractCharCount><pdfWordCount>4958</pdfWordCount><pdfCharCount>29630</pdfCharCount><pdfPageCount>9</pdfPageCount><abstractWordCount>211</abstractWordCount></qualityIndicators><title>A breadth-first quadtree coding scheme for multicolored spatial data</title><pii><json:string>0098-3004(95)00087-9</json:string></pii><genre><json:string>research-article</json:string></genre><host><volume>22</volume><pii><json:string>S0098-3004(00)X0004-0</json:string></pii><pages><last>143</last><first>139</first></pages><issn><json:string>0098-3004</json:string></issn><issue>2</issue><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><title>Computers and Geosciences</title><publicationDate>1996</publicationDate></host><categories><wos><json:string>science</json:string><json:string>geosciences, multidisciplinary</json:string><json:string>computer science, interdisciplinary applications</json:string></wos><scienceMetrix><json:string>natural sciences</json:string><json:string>earth & environmental sciences</json:string><json:string>geochemistry & geophysics</json:string></scienceMetrix></categories><publicationDate>1996</publicationDate><copyrightDate>1996</copyrightDate><doi><json:string>10.1016/0098-3004(95)00087-9</json:string></doi><id>1C80FFB74800724119AEC5E0AE528F79053BA78F</id><score>0.04186546</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/1C80FFB74800724119AEC5E0AE528F79053BA78F/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/1C80FFB74800724119AEC5E0AE528F79053BA78F/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/1C80FFB74800724119AEC5E0AE528F79053BA78F/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a">A breadth-first quadtree coding scheme for multicolored spatial data</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>ELSEVIER</publisher><availability><p>ELSEVIER</p></availability><date>1996</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a">A breadth-first quadtree coding scheme for multicolored spatial data</title><author xml:id="author-1"><persName><forename type="first">Henry Ker-Chang</forename><surname>Chang</surname></persName><email>chang@rs360.ndmc.edu.tw</email><affiliation>Graduate School of Resources Management, National Defense Management College, P.O. Box 90046-17, Chung-Ho, Taipei, Taiwan, Republic of China</affiliation></author><author xml:id="author-2"><persName><forename type="first">Cheng-Kuan</forename><surname>Tso</surname></persName><affiliation>Graduate School of Resources Management, National Defense Management College, P.O. Box 90046-17, Chung-Ho, Taipei, Taiwan, Republic of China</affiliation></author></analytic><monogr><title level="j">Computers and Geosciences</title><title level="j" type="abbrev">CAGEO</title><idno type="pISSN">0098-3004</idno><idno type="PII">S0098-3004(00)X0004-0</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1996"></date><biblScope unit="volume">22</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="139">139</biblScope><biblScope unit="page" to="143">143</biblScope></imprint></monogr><idno type="istex">1C80FFB74800724119AEC5E0AE528F79053BA78F</idno><idno type="DOI">10.1016/0098-3004(95)00087-9</idno><idno type="PII">0098-3004(95)00087-9</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1996</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>In this paper, we apply the newly developed linear quadtree coding technique 2DTE to construct a single multicolored quadtree for a multicolored thematic map. The proposed 2DTE technique is designed on the basis of a Morton sequence, template matching, and the breadth-first traversal order. With the Morton sequence, we can generate the quaternary codes for various functions of a multicolored thematic map; the decision of decomposition is derived using the concept of template matching. The performance, in terms of memory space and time complexity, for the proposed 2DTE technique is analyzed and compared using an agricultural image of four objects. The result of a single multicolored quadtree derived by the breadth-first traversal order is compared with that of a set of linear quadtrees based on Gargantini's method. The experimental results show that the proposed method has an advantage of obvious memory space reduction over the result of Gargantini's method. Besides, theoretic analysis is derived from an image of size 2n × 2n, where n is the resolution parameter and there are 2n × 2n colors. The proposed method needs 8n × 4n − 1 bits to encode whereas Gargantini's method needs 12n × 4n − 1 bits. The feasibility of the proposed scheme therefore can be verified by the performance comparisons.</p></abstract><textClass><keywords scheme="keyword"><list><head>Keywords</head><item><term>Linear quadtree</term></item><item><term>Two-dimensional template-based encoding (2DTE)</term></item><item><term>Multicolored spatial data</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1996">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/1C80FFB74800724119AEC5E0AE528F79053BA78F/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Elsevier, elements deleted: tail"><istex:xmlDeclaration>version="1.0" encoding="utf-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//ES//DTD journal article DTD version 4.5.2//EN//XML" URI="art452.dtd" name="istex:docType"></istex:docType><istex:document><converted-article version="4.5.2" docsubtype="fla"><item-info><jid>CAGEO</jid><aid>95000879</aid><ce:pii>0098-3004(95)00087-9</ce:pii><ce:doi>10.1016/0098-3004(95)00087-9</ce:doi><ce:copyright type="unknown" year="1996"></ce:copyright></item-info><head><ce:title>A breadth-first quadtree coding scheme for multicolored spatial data</ce:title><ce:author-group><ce:author><ce:given-name>Henry Ker-Chang</ce:given-name><ce:surname>Chang</ce:surname><ce:e-address>chang@rs360.ndmc.edu.tw</ce:e-address></ce:author><ce:author><ce:given-name>Cheng-Kuan</ce:given-name><ce:surname>Tso</ce:surname></ce:author><ce:affiliation><ce:textfn>Graduate School of Resources Management, National Defense Management College, P.O. Box 90046-17, Chung-Ho, Taipei, Taiwan, Republic of China</ce:textfn></ce:affiliation></ce:author-group><ce:date-received day="24" month="8" year="1994"></ce:date-received><ce:date-accepted day="5" month="12" year="1995"></ce:date-accepted><ce:abstract><ce:section-title>Abstract</ce:section-title><ce:abstract-sec><ce:simple-para>In this paper, we apply the newly developed linear quadtree coding technique 2DTE to construct a single multicolored quadtree for a multicolored thematic map. The proposed 2DTE technique is designed on the basis of a Morton sequence, template matching, and the breadth-first traversal order. With the Morton sequence, we can generate the quaternary codes for various functions of a multicolored thematic map; the decision of decomposition is derived using the concept of template matching. The performance, in terms of memory space and time complexity, for the proposed 2DTE technique is analyzed and compared using an agricultural image of four objects. The result of a single multicolored quadtree derived by the breadth-first traversal order is compared with that of a set of linear quadtrees based on Gargantini's method. The experimental results show that the proposed method has an advantage of obvious memory space reduction over the result of Gargantini's method. Besides, theoretic analysis is derived from an image of size 2<ce:sup><ce:italic>n</ce:italic></ce:sup> × 2<ce:sup><ce:italic>n</ce:italic></ce:sup>, where <ce:italic>n</ce:italic> is the resolution parameter and there are 2<ce:sup><ce:italic>n</ce:italic></ce:sup> × 2<ce:sup><ce:italic>n</ce:italic></ce:sup> colors. The proposed method needs 8<ce:italic>n</ce:italic> × 4<ce:sup><ce:italic>n</ce:italic> − 1</ce:sup> bits to encode whereas Gargantini's method needs 12<ce:italic>n</ce:italic> × 4<ce:sup><ce:italic>n</ce:italic> − 1</ce:sup> bits. The feasibility of the proposed scheme therefore can be verified by the performance comparisons.</ce:simple-para></ce:abstract-sec></ce:abstract><ce:keywords><ce:section-title>Keywords</ce:section-title><ce:keyword><ce:text>Linear quadtree</ce:text></ce:keyword><ce:keyword><ce:text>Two-dimensional template-based encoding (2DTE)</ce:text></ce:keyword><ce:keyword><ce:text>Multicolored spatial data</ce:text></ce:keyword></ce:keywords></head></converted-article></istex:document></istex:metadataXml><mods version="3.6"><titleInfo><title>A breadth-first quadtree coding scheme for multicolored spatial data</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>A breadth-first quadtree coding scheme for multicolored spatial data</title></titleInfo><name type="personal"><namePart type="given">Henry Ker-Chang</namePart><namePart type="family">Chang</namePart><affiliation>Graduate School of Resources Management, National Defense Management College, P.O. Box 90046-17, Chung-Ho, Taipei, Taiwan, Republic of China</affiliation><affiliation>E-mail: chang@rs360.ndmc.edu.tw</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Cheng-Kuan</namePart><namePart type="family">Tso</namePart><affiliation>Graduate School of Resources Management, National Defense Management College, P.O. Box 90046-17, Chung-Ho, Taipei, Taiwan, Republic of China</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="Full-length article"></genre><originInfo><publisher>ELSEVIER</publisher><dateIssued encoding="w3cdtf">1996</dateIssued><copyrightDate encoding="w3cdtf">1996</copyrightDate></originInfo><language><languageTerm type="code" authority="iso639-2b">eng</languageTerm><languageTerm type="code" authority="rfc3066">en</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">In this paper, we apply the newly developed linear quadtree coding technique 2DTE to construct a single multicolored quadtree for a multicolored thematic map. The proposed 2DTE technique is designed on the basis of a Morton sequence, template matching, and the breadth-first traversal order. With the Morton sequence, we can generate the quaternary codes for various functions of a multicolored thematic map; the decision of decomposition is derived using the concept of template matching. The performance, in terms of memory space and time complexity, for the proposed 2DTE technique is analyzed and compared using an agricultural image of four objects. The result of a single multicolored quadtree derived by the breadth-first traversal order is compared with that of a set of linear quadtrees based on Gargantini's method. The experimental results show that the proposed method has an advantage of obvious memory space reduction over the result of Gargantini's method. Besides, theoretic analysis is derived from an image of size 2n × 2n, where n is the resolution parameter and there are 2n × 2n colors. The proposed method needs 8n × 4n − 1 bits to encode whereas Gargantini's method needs 12n × 4n − 1 bits. The feasibility of the proposed scheme therefore can be verified by the performance comparisons.</abstract><subject><genre>Keywords</genre><topic>Linear quadtree</topic><topic>Two-dimensional template-based encoding (2DTE)</topic><topic>Multicolored spatial data</topic></subject><relatedItem type="host"><titleInfo><title>Computers and Geosciences</title></titleInfo><titleInfo type="abbreviated"><title>CAGEO</title></titleInfo><genre type="journal">journal</genre><originInfo><dateIssued encoding="w3cdtf">199603</dateIssued></originInfo><identifier type="ISSN">0098-3004</identifier><identifier type="PII">S0098-3004(00)X0004-0</identifier><part><date>199603</date><detail type="volume"><number>22</number><caption>vol.</caption></detail><detail type="issue"><number>2</number><caption>no.</caption></detail><extent unit="issue pages"><start>101</start><end>194</end></extent><extent unit="pages"><start>139</start><end>143</end></extent></part></relatedItem><identifier type="istex">1C80FFB74800724119AEC5E0AE528F79053BA78F</identifier><identifier type="DOI">10.1016/0098-3004(95)00087-9</identifier><identifier type="PII">0098-3004(95)00087-9</identifier><recordInfo><recordContentSource>ELSEVIER</recordContentSource></recordInfo></mods></metadata><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Agronomie/explor/SisAgriV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A99 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000A99 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Agronomie
|area= SisAgriV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:1C80FFB74800724119AEC5E0AE528F79053BA78F
|texte= A breadth-first quadtree coding scheme for multicolored spatial data
}}
| This area was generated with Dilib version V0.6.28. |  |