The indexing for one-dimensional proportionally-scaled strings
Related problems of scaled matching and indexing, which aim to determine all positions in a text T that a pattern P occurs in its scaled form, are considered important because of their applications to computer vision. However, previous results only focus on enlarged patterns, and do not allow shrunk...
Gespeichert in:
| Veröffentlicht in: | Information processing letters 2011-03, Vol.111 (7), p.318-322 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 322 |
|---|---|
| container_issue | 7 |
| container_start_page | 318 |
| container_title | Information processing letters |
| container_volume | 111 |
| creator | Peng, Yung-Hsing Yang, Chang-Biau Tseng, Chiou-Ting Hor, Chiou-Yi |
| description | Related problems of scaled matching and indexing, which aim to determine all positions in a text
T that a pattern
P occurs in its scaled form, are considered important because of their applications to computer vision. However, previous results only focus on enlarged patterns, and do not allow shrunk patterns since they may disappear. In this paper, we give the definition and an efficient indexing algorithm for proportionally-scaled patterns that can be visually enlarged or shrunk. The proposed indexing algorithm takes
O
(
|
T
|
)
time in its preprocessing phase, and achieves
O
(
|
P
|
+
U
p
+
log
m
)
time in its answering phase, where
|
T
|
,
|
P
|
,
U
p
, and
m denote the length of
T, the length of
P, the number of reported positions, and the length of
T under run-length representation, respectively.
► We give the first algorithm for indexing strings that can be enlarged or shrunk. ► The proposed algorithm is nearly optimal. ► Our definition for scaled strings considers the visual effect to human eyes. |
| doi_str_mv | 10.1016/j.ipl.2010.12.001 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_864395423</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020019010003935</els_id><sourcerecordid>864395423</sourcerecordid><originalsourceid>FETCH-LOGICAL-c338t-87b46abed714e5282b1552fd0fa654e2137d3533144fb0c828b9ab6c8d4019423</originalsourceid><addsrcrecordid>eNp9kE1LxDAURYMoOI7-AHdFEFet-WqbIggy-AUDbsZ1SJNXTek0NemI8-9NncGFC1fhwbkv9x2EzgnOCCbFdZvZocsonmaaYUwO0IyIkqYFIdUhmmFMcYpJhY_RSQgtxrjgrJyh29U7JLY38GX7t6RxPnE9pMauoQ_W9apLBu8G58efodumQasOTBJGHwPhFB01qgtwtn_n6PXhfrV4Spcvj8-Lu2WqGRNjKsqaF6oGUxIOORW0JnlOG4MbVeQcKGGlYTljhPOmxlpQUVeqLrQwPHbmlM3R1W5vbPOxgTDKtQ0auk714DZBinhNlUcwkhd_yNZtfOweIV7RXORFGSGyg7R3IXho5ODtWvmtJFhOPmUro085-ZSEyugzZi73i9XkoPGq1zb8BikTRawvInez4yD6-LTgZdAWeg3GetCjNM7-88s3ks6JRA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>849258567</pqid></control><display><type>article</type><title>The indexing for one-dimensional proportionally-scaled strings</title><source>Elsevier ScienceDirect Journals</source><creator>Peng, Yung-Hsing ; Yang, Chang-Biau ; Tseng, Chiou-Ting ; Hor, Chiou-Yi</creator><creatorcontrib>Peng, Yung-Hsing ; Yang, Chang-Biau ; Tseng, Chiou-Ting ; Hor, Chiou-Yi</creatorcontrib><description>Related problems of scaled matching and indexing, which aim to determine all positions in a text
T that a pattern
P occurs in its scaled form, are considered important because of their applications to computer vision. However, previous results only focus on enlarged patterns, and do not allow shrunk patterns since they may disappear. In this paper, we give the definition and an efficient indexing algorithm for proportionally-scaled patterns that can be visually enlarged or shrunk. The proposed indexing algorithm takes
O
(
|
T
|
)
time in its preprocessing phase, and achieves
O
(
|
P
|
+
U
p
+
log
m
)
time in its answering phase, where
|
T
|
,
|
P
|
,
U
p
, and
m denote the length of
T, the length of
P, the number of reported positions, and the length of
T under run-length representation, respectively.
► We give the first algorithm for indexing strings that can be enlarged or shrunk. ► The proposed algorithm is nearly optimal. ► Our definition for scaled strings considers the visual effect to human eyes.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/j.ipl.2010.12.001</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Computer science; control theory; systems ; Computer vision ; Design of algorithms ; Exact sciences and technology ; Expansion ; Indexing ; Information processing ; Matching ; Miscellaneous ; Proportional ; Scale ; String matching ; Strings ; Studies ; Texts ; Theoretical computing</subject><ispartof>Information processing letters, 2011-03, Vol.111 (7), p.318-322</ispartof><rights>2010 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Mar 1, 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c338t-87b46abed714e5282b1552fd0fa654e2137d3533144fb0c828b9ab6c8d4019423</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0020019010003935$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23861448$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Peng, Yung-Hsing</creatorcontrib><creatorcontrib>Yang, Chang-Biau</creatorcontrib><creatorcontrib>Tseng, Chiou-Ting</creatorcontrib><creatorcontrib>Hor, Chiou-Yi</creatorcontrib><title>The indexing for one-dimensional proportionally-scaled strings</title><title>Information processing letters</title><description>Related problems of scaled matching and indexing, which aim to determine all positions in a text
T that a pattern
P occurs in its scaled form, are considered important because of their applications to computer vision. However, previous results only focus on enlarged patterns, and do not allow shrunk patterns since they may disappear. In this paper, we give the definition and an efficient indexing algorithm for proportionally-scaled patterns that can be visually enlarged or shrunk. The proposed indexing algorithm takes
O
(
|
T
|
)
time in its preprocessing phase, and achieves
O
(
|
P
|
+
U
p
+
log
m
)
time in its answering phase, where
|
T
|
,
|
P
|
,
U
p
, and
m denote the length of
T, the length of
P, the number of reported positions, and the length of
T under run-length representation, respectively.
► We give the first algorithm for indexing strings that can be enlarged or shrunk. ► The proposed algorithm is nearly optimal. ► Our definition for scaled strings considers the visual effect to human eyes.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer vision</subject><subject>Design of algorithms</subject><subject>Exact sciences and technology</subject><subject>Expansion</subject><subject>Indexing</subject><subject>Information processing</subject><subject>Matching</subject><subject>Miscellaneous</subject><subject>Proportional</subject><subject>Scale</subject><subject>String matching</subject><subject>Strings</subject><subject>Studies</subject><subject>Texts</subject><subject>Theoretical computing</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAURYMoOI7-AHdFEFet-WqbIggy-AUDbsZ1SJNXTek0NemI8-9NncGFC1fhwbkv9x2EzgnOCCbFdZvZocsonmaaYUwO0IyIkqYFIdUhmmFMcYpJhY_RSQgtxrjgrJyh29U7JLY38GX7t6RxPnE9pMauoQ_W9apLBu8G58efodumQasOTBJGHwPhFB01qgtwtn_n6PXhfrV4Spcvj8-Lu2WqGRNjKsqaF6oGUxIOORW0JnlOG4MbVeQcKGGlYTljhPOmxlpQUVeqLrQwPHbmlM3R1W5vbPOxgTDKtQ0auk714DZBinhNlUcwkhd_yNZtfOweIV7RXORFGSGyg7R3IXho5ODtWvmtJFhOPmUro085-ZSEyugzZi73i9XkoPGq1zb8BikTRawvInez4yD6-LTgZdAWeg3GetCjNM7-88s3ks6JRA</recordid><startdate>20110301</startdate><enddate>20110301</enddate><creator>Peng, Yung-Hsing</creator><creator>Yang, Chang-Biau</creator><creator>Tseng, Chiou-Ting</creator><creator>Hor, Chiou-Yi</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20110301</creationdate><title>The indexing for one-dimensional proportionally-scaled strings</title><author>Peng, Yung-Hsing ; Yang, Chang-Biau ; Tseng, Chiou-Ting ; Hor, Chiou-Yi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c338t-87b46abed714e5282b1552fd0fa654e2137d3533144fb0c828b9ab6c8d4019423</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer vision</topic><topic>Design of algorithms</topic><topic>Exact sciences and technology</topic><topic>Expansion</topic><topic>Indexing</topic><topic>Information processing</topic><topic>Matching</topic><topic>Miscellaneous</topic><topic>Proportional</topic><topic>Scale</topic><topic>String matching</topic><topic>Strings</topic><topic>Studies</topic><topic>Texts</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Peng, Yung-Hsing</creatorcontrib><creatorcontrib>Yang, Chang-Biau</creatorcontrib><creatorcontrib>Tseng, Chiou-Ting</creatorcontrib><creatorcontrib>Hor, Chiou-Yi</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Peng, Yung-Hsing</au><au>Yang, Chang-Biau</au><au>Tseng, Chiou-Ting</au><au>Hor, Chiou-Yi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The indexing for one-dimensional proportionally-scaled strings</atitle><jtitle>Information processing letters</jtitle><date>2011-03-01</date><risdate>2011</risdate><volume>111</volume><issue>7</issue><spage>318</spage><epage>322</epage><pages>318-322</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>Related problems of scaled matching and indexing, which aim to determine all positions in a text
T that a pattern
P occurs in its scaled form, are considered important because of their applications to computer vision. However, previous results only focus on enlarged patterns, and do not allow shrunk patterns since they may disappear. In this paper, we give the definition and an efficient indexing algorithm for proportionally-scaled patterns that can be visually enlarged or shrunk. The proposed indexing algorithm takes
O
(
|
T
|
)
time in its preprocessing phase, and achieves
O
(
|
P
|
+
U
p
+
log
m
)
time in its answering phase, where
|
T
|
,
|
P
|
,
U
p
, and
m denote the length of
T, the length of
P, the number of reported positions, and the length of
T under run-length representation, respectively.
► We give the first algorithm for indexing strings that can be enlarged or shrunk. ► The proposed algorithm is nearly optimal. ► Our definition for scaled strings considers the visual effect to human eyes.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ipl.2010.12.001</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 2011-03, Vol.111 (7), p.318-322 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_864395423 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science control theory systems Computer vision Design of algorithms Exact sciences and technology Expansion Indexing Information processing Matching Miscellaneous Proportional Scale String matching Strings Studies Texts Theoretical computing |
| title | The indexing for one-dimensional proportionally-scaled strings |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T22%3A37%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20indexing%20for%20one-dimensional%20proportionally-scaled%20strings&rft.jtitle=Information%20processing%20letters&rft.au=Peng,%20Yung-Hsing&rft.date=2011-03-01&rft.volume=111&rft.issue=7&rft.spage=318&rft.epage=322&rft.pages=318-322&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/j.ipl.2010.12.001&rft_dat=%3Cproquest_cross%3E864395423%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=849258567&rft_id=info:pmid/&rft_els_id=S0020019010003935&rfr_iscdi=true |