A class of linear maps for error corrective dimensionality reduction of binary templates
Identifieur interne : 000C26 ( Istex/Corpus ); précédent : 000C25; suivant : 000C27A class of linear maps for error corrective dimensionality reduction of binary templates
Auteurs : Shovonlal KunduSource :
- Pattern Recognition [ 0031-3203 ] ; 1987.
Abstract
Binary templates are optimally encoded in a reduced dimension by a proposed class of linear maps that preserves the local neighbourhood and a prescribed minimum distance between the prototypes to a workable extent. This in effect generates a nearness criterion suitable for template matching with a level of error correcting capability in the reduced space while requiring only a fraction of memory storage space and boolean operations that would have been required otherwise. Characters and symbols may now be designed with reference to separation and shape but with a comparative freedom from the constraint of dimension, while a volume of such data can be transmitted with the speed and bandwidth of the encoded data. Some of the principal problems associated with template matching are thus overcome. Here all the necessary operations are performed in the finite field GF(2) and the methodology developed can be implemented in a microcomputer with improved system performance and economy.
Url:
DOI: 10.1016/0031-3203(88)90051-9
Links to Exploration step
ISTEX:0068BCB5AA7899DEC3532099134811FCAC2CE574Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>A class of linear maps for error corrective dimensionality reduction of binary templates</title><author><name sortKey="Kundu, Shovonlal" sort="Kundu, Shovonlal" uniqKey="Kundu S" first="Shovonlal" last="Kundu">Shovonlal Kundu</name><affiliation><mods:affiliation>Electronics and Communication Sciences Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700035, India</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:0068BCB5AA7899DEC3532099134811FCAC2CE574</idno><date when="1988" year="1988">1988</date><idno type="doi">10.1016/0031-3203(88)90051-9</idno><idno type="url">https://api.istex.fr/document/0068BCB5AA7899DEC3532099134811FCAC2CE574/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000C26</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">A class of linear maps for error corrective dimensionality reduction of binary templates</title><author><name sortKey="Kundu, Shovonlal" sort="Kundu, Shovonlal" uniqKey="Kundu S" first="Shovonlal" last="Kundu">Shovonlal Kundu</name><affiliation><mods:affiliation>Electronics and Communication Sciences Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700035, India</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Pattern Recognition</title><title level="j" type="abbrev">PR</title><idno type="ISSN">0031-3203</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1987">1987</date><biblScope unit="volume">21</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="381">381</biblScope><biblScope unit="page" to="392">392</biblScope></imprint><idno type="ISSN">0031-3203</idno></series><idno type="istex">0068BCB5AA7899DEC3532099134811FCAC2CE574</idno><idno type="DOI">10.1016/0031-3203(88)90051-9</idno><idno type="PII">0031-3203(88)90051-9</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0031-3203</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Binary templates are optimally encoded in a reduced dimension by a proposed class of linear maps that preserves the local neighbourhood and a prescribed minimum distance between the prototypes to a workable extent. This in effect generates a nearness criterion suitable for template matching with a level of error correcting capability in the reduced space while requiring only a fraction of memory storage space and boolean operations that would have been required otherwise. Characters and symbols may now be designed with reference to separation and shape but with a comparative freedom from the constraint of dimension, while a volume of such data can be transmitted with the speed and bandwidth of the encoded data. Some of the principal problems associated with template matching are thus overcome. Here all the necessary operations are performed in the finite field GF(2) and the methodology developed can be implemented in a microcomputer with improved system performance and economy.</div></front></TEI><istex><corpusName>elsevier</corpusName><author><json:item><name>Shovonlal Kundu</name><affiliations><json:string>Electronics and Communication Sciences Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700035, India</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>Algebraic algorithm</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Dimensionality reduction</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Error correction</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Linear mapping</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Minimum distance encoding</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Neighbourhood preserving transformation</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Optimal encoding</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Probabilistic algorithm</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Perfect hash function</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Template stylization</value></json:item></subject><language><json:string>eng</json:string></language><abstract>Binary templates are optimally encoded in a reduced dimension by a proposed class of linear maps that preserves the local neighbourhood and a prescribed minimum distance between the prototypes to a workable extent. This in effect generates a nearness criterion suitable for template matching with a level of error correcting capability in the reduced space while requiring only a fraction of memory storage space and boolean operations that would have been required otherwise. Characters and symbols may now be designed with reference to separation and shape but with a comparative freedom from the constraint of dimension, while a volume of such data can be transmitted with the speed and bandwidth of the encoded data. Some of the principal problems associated with template matching are thus overcome. Here all the necessary operations are performed in the finite field GF(2) and the methodology developed can be implemented in a microcomputer with improved system performance and economy.</abstract><qualityIndicators><score>6.848</score><pdfVersion>1.2</pdfVersion><pdfPageSize>562 x 792 pts</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>10</keywordCount><abstractCharCount>992</abstractCharCount><pdfWordCount>7426</pdfWordCount><pdfCharCount>39870</pdfCharCount><pdfPageCount>12</pdfPageCount><abstractWordCount>154</abstractWordCount></qualityIndicators><title>A class of linear maps for error corrective dimensionality reduction of binary templates</title><pii><json:string>0031-3203(88)90051-9</json:string></pii><genre><json:string>research-article</json:string></genre><serie><volume>Vol. II</volume><pages><last>649</last><first>621</first></pages><genre></genre><language><json:string>unknown</json:string></language><title>Handbook of Statistics</title></serie><host><volume>21</volume><pii><json:string>S0031-3203(00)X0187-2</json:string></pii><pages><last>392</last><first>381</first></pages><issn><json:string>0031-3203</json:string></issn><issue>4</issue><genre><json:string>Journal</json:string></genre><language><json:string>unknown</json:string></language><title>Pattern Recognition</title><publicationDate>1988</publicationDate></host><categories><wos><json:string>COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE</json:string><json:string>ENGINEERING, ELECTRICAL & ELECTRONIC</json:string></wos></categories><publicationDate>1987</publicationDate><copyrightDate>1988</copyrightDate><doi><json:string>10.1016/0031-3203(88)90051-9</json:string></doi><id>0068BCB5AA7899DEC3532099134811FCAC2CE574</id><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/0068BCB5AA7899DEC3532099134811FCAC2CE574/fulltext/pdf</uri></json:item><json:item><original>true</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/0068BCB5AA7899DEC3532099134811FCAC2CE574/fulltext/txt</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/0068BCB5AA7899DEC3532099134811FCAC2CE574/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/0068BCB5AA7899DEC3532099134811FCAC2CE574/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a">A class of linear maps for error corrective dimensionality reduction of binary templates</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>ELSEVIER</publisher><availability><p>ELSEVIER</p></availability><date>1988</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a">A class of linear maps for error corrective dimensionality reduction of binary templates</title><author><persName><forename type="first">Shovonlal</forename><surname>Kundu</surname></persName><affiliation>Electronics and Communication Sciences Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700035, India</affiliation></author></analytic><monogr><title level="j">Pattern Recognition</title><title level="j" type="abbrev">PR</title><idno type="pISSN">0031-3203</idno><idno type="PII">S0031-3203(00)X0187-2</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1987"></date><biblScope unit="volume">21</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="381">381</biblScope><biblScope unit="page" to="392">392</biblScope></imprint></monogr><idno type="istex">0068BCB5AA7899DEC3532099134811FCAC2CE574</idno><idno type="DOI">10.1016/0031-3203(88)90051-9</idno><idno type="PII">0031-3203(88)90051-9</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1988</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Binary templates are optimally encoded in a reduced dimension by a proposed class of linear maps that preserves the local neighbourhood and a prescribed minimum distance between the prototypes to a workable extent. This in effect generates a nearness criterion suitable for template matching with a level of error correcting capability in the reduced space while requiring only a fraction of memory storage space and boolean operations that would have been required otherwise. Characters and symbols may now be designed with reference to separation and shape but with a comparative freedom from the constraint of dimension, while a volume of such data can be transmitted with the speed and bandwidth of the encoded data. Some of the principal problems associated with template matching are thus overcome. Here all the necessary operations are performed in the finite field GF(2) and the methodology developed can be implemented in a microcomputer with improved system performance and economy.</p></abstract><textClass><keywords scheme="keyword"><list><head>Keywords</head><item><term>Algebraic algorithm</term></item><item><term>Dimensionality reduction</term></item><item><term>Error correction</term></item><item><term>Linear mapping</term></item><item><term>Minimum distance encoding</term></item><item><term>Neighbourhood preserving transformation</term></item><item><term>Optimal encoding</term></item><item><term>Probabilistic algorithm</term></item><item><term>Perfect hash function</term></item><item><term>Template stylization</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1987-06-29">Received</change><change when="1987">Published</change></revisionDesc></teiHeader></istex:fulltextTEI></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>PR</jid><aid>88900519</aid><ce:pii>0031-3203(88)90051-9</ce:pii><ce:doi>10.1016/0031-3203(88)90051-9</ce:doi><ce:copyright type="unknown" year="1988"></ce:copyright></item-info><head><ce:title>A class of linear maps for error corrective dimensionality reduction of binary templates</ce:title><ce:author-group><ce:author><ce:given-name>Shovonlal</ce:given-name><ce:surname>Kundu</ce:surname></ce:author><ce:affiliation><ce:textfn>Electronics and Communication Sciences Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700035, India</ce:textfn></ce:affiliation></ce:author-group><ce:date-received day="29" month="6" year="1987"></ce:date-received><ce:abstract><ce:section-title>Abstract</ce:section-title><ce:abstract-sec><ce:simple-para>Binary templates are optimally encoded in a reduced dimension by a proposed class of linear maps that preserves the local neighbourhood and a prescribed minimum distance between the prototypes to a workable extent. This in effect generates a nearness criterion suitable for template matching with a level of error correcting capability in the reduced space while requiring only a fraction of memory storage space and boolean operations that would have been required otherwise. Characters and symbols may now be designed with reference to separation and shape but with a comparative freedom from the constraint of dimension, while a volume of such data can be transmitted with the speed and bandwidth of the encoded data. Some of the principal problems associated with template matching are thus overcome. Here all the necessary operations are performed in the finite field GF(2) and the methodology developed can be implemented in a microcomputer with improved system performance and economy.</ce:simple-para></ce:abstract-sec></ce:abstract><ce:keywords><ce:section-title>Keywords</ce:section-title><ce:keyword><ce:text>Algebraic algorithm</ce:text></ce:keyword><ce:keyword><ce:text>Dimensionality reduction</ce:text></ce:keyword><ce:keyword><ce:text>Error correction</ce:text></ce:keyword><ce:keyword><ce:text>Linear mapping</ce:text></ce:keyword><ce:keyword><ce:text>Minimum distance encoding</ce:text></ce:keyword><ce:keyword><ce:text>Neighbourhood preserving transformation</ce:text></ce:keyword><ce:keyword><ce:text>Optimal encoding</ce:text></ce:keyword><ce:keyword><ce:text>Probabilistic algorithm</ce:text></ce:keyword><ce:keyword><ce:text>Perfect hash function</ce:text></ce:keyword><ce:keyword><ce:text>Template stylization</ce:text></ce:keyword></ce:keywords></head></converted-article></istex:document></istex:metadataXml><mods version="3.6"><titleInfo><title>A class of linear maps for error corrective dimensionality reduction of binary templates</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>A class of linear maps for error corrective dimensionality reduction of binary templates</title></titleInfo><name type="personal"><namePart type="given">Shovonlal</namePart><namePart type="family">Kundu</namePart><affiliation>Electronics and Communication Sciences Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700035, India</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">1987</dateIssued><dateCaptured encoding="w3cdtf">1987-06-29</dateCaptured><copyrightDate encoding="w3cdtf">1988</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">Binary templates are optimally encoded in a reduced dimension by a proposed class of linear maps that preserves the local neighbourhood and a prescribed minimum distance between the prototypes to a workable extent. This in effect generates a nearness criterion suitable for template matching with a level of error correcting capability in the reduced space while requiring only a fraction of memory storage space and boolean operations that would have been required otherwise. Characters and symbols may now be designed with reference to separation and shape but with a comparative freedom from the constraint of dimension, while a volume of such data can be transmitted with the speed and bandwidth of the encoded data. Some of the principal problems associated with template matching are thus overcome. Here all the necessary operations are performed in the finite field GF(2) and the methodology developed can be implemented in a microcomputer with improved system performance and economy.</abstract><subject><genre>Keywords</genre><topic>Algebraic algorithm</topic><topic>Dimensionality reduction</topic><topic>Error correction</topic><topic>Linear mapping</topic><topic>Minimum distance encoding</topic><topic>Neighbourhood preserving transformation</topic><topic>Optimal encoding</topic><topic>Probabilistic algorithm</topic><topic>Perfect hash function</topic><topic>Template stylization</topic></subject><relatedItem type="host"><titleInfo><title>Pattern Recognition</title></titleInfo><titleInfo type="abbreviated"><title>PR</title></titleInfo><genre type="Journal">journal</genre><originInfo><dateIssued encoding="w3cdtf">1988</dateIssued></originInfo><identifier type="ISSN">0031-3203</identifier><identifier type="PII">S0031-3203(00)X0187-2</identifier><part><date>1988</date><detail type="volume"><number>21</number><caption>vol.</caption></detail><detail type="issue"><number>4</number><caption>no.</caption></detail><extent unit="issue pages"><start>287</start><end>409</end></extent><extent unit="pages"><start>381</start><end>392</end></extent></part></relatedItem><identifier type="istex">0068BCB5AA7899DEC3532099134811FCAC2CE574</identifier><identifier type="DOI">10.1016/0031-3203(88)90051-9</identifier><identifier type="PII">0031-3203(88)90051-9</identifier><recordInfo><recordContentSource>ELSEVIER</recordContentSource></recordInfo></mods></metadata><enrichments><istex:catWosTEI uri="https://api.istex.fr/document/0068BCB5AA7899DEC3532099134811FCAC2CE574/enrichments/catWos"><teiHeader><profileDesc><textClass><classCode scheme="WOS">COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE</classCode><classCode scheme="WOS">ENGINEERING, ELECTRICAL & ELECTRONIC</classCode></textClass></profileDesc></teiHeader></istex:catWosTEI></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C26 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000C26 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:0068BCB5AA7899DEC3532099134811FCAC2CE574
|texte= A class of linear maps for error corrective dimensionality reduction of binary templates
}}
| This area was generated with Dilib version V0.6.32. |  |