On the family of shortest isothetic paths in a digital object—An algorithm with applications
• An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given t...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Dutt, Mousumi [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2014 |
|---|
| Schlagwörter: |
|---|
| Umfang: |
14 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Editorial Board - 2016, CVIU, San Diego, Calif |
|---|---|
| Übergeordnetes Werk: |
volume:129 ; year:2014 ; pages:75-88 ; extent:14 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.cviu.2014.07.001 |
|---|
| Katalog-ID: |
ELV039478742 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV039478742 | ||
| 003 | DE-627 | ||
| 005 | 20230624061736.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2014 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.cviu.2014.07.001 |2 doi | |
| 028 | 5 | 2 | |a GBVA2014018000001.pica |
| 035 | |a (DE-627)ELV039478742 | ||
| 035 | |a (ELSEVIER)S1077-3142(14)00152-0 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 004 | |
| 082 | 0 | 4 | |a 004 |q DE-600 |
| 082 | 0 | 4 | |a 630 |q VZ |
| 082 | 0 | 4 | |a 640 |q VZ |
| 082 | 0 | 4 | |a 610 |q VZ |
| 100 | 1 | |a Dutt, Mousumi |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a On the family of shortest isothetic paths in a digital object—An algorithm with applications |
| 264 | 1 | |c 2014 | |
| 300 | |a 14 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a • An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given to demonstrate the effectiveness of FSIP. | ||
| 650 | 7 | |a Shape analysis |2 Elsevier | |
| 650 | 7 | |a Monotone polygon |2 Elsevier | |
| 650 | 7 | |a Isothetic path |2 Elsevier | |
| 650 | 7 | |a Shortest path |2 Elsevier | |
| 650 | 7 | |a Monotone path |2 Elsevier | |
| 700 | 1 | |a Biswas, Arindam |4 oth | |
| 700 | 1 | |a Bhowmick, Partha |4 oth | |
| 700 | 1 | |a Bhattacharya, Bhargab B. |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |t Editorial Board |d 2016 |d CVIU |g San Diego, Calif |w (DE-627)ELV019616708 |
| 773 | 1 | 8 | |g volume:129 |g year:2014 |g pages:75-88 |g extent:14 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.cviu.2014.07.001 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a SSG-OLC-PHA | ||
| 951 | |a AR | ||
| 952 | |d 129 |j 2014 |h 75-88 |g 14 | ||
| 953 | |2 045F |a 004 | ||
| author_variant |
m d md |
|---|---|
| matchkey_str |
duttmousumibiswasarindambhowmickparthabh:2014----:nhfmlosotsiohtcahiaiiaojcaag |
| hierarchy_sort_str |
2014 |
| publishDate |
2014 |
| allfields |
10.1016/j.cviu.2014.07.001 doi GBVA2014018000001.pica (DE-627)ELV039478742 (ELSEVIER)S1077-3142(14)00152-0 DE-627 ger DE-627 rakwb eng 004 004 DE-600 630 VZ 640 VZ 610 VZ Dutt, Mousumi verfasserin aut On the family of shortest isothetic paths in a digital object—An algorithm with applications 2014 14 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier • An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given to demonstrate the effectiveness of FSIP. Shape analysis Elsevier Monotone polygon Elsevier Isothetic path Elsevier Shortest path Elsevier Monotone path Elsevier Biswas, Arindam oth Bhowmick, Partha oth Bhattacharya, Bhargab B. oth Enthalten in Elsevier Editorial Board 2016 CVIU San Diego, Calif (DE-627)ELV019616708 volume:129 year:2014 pages:75-88 extent:14 https://doi.org/10.1016/j.cviu.2014.07.001 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA AR 129 2014 75-88 14 045F 004 |
| spelling |
10.1016/j.cviu.2014.07.001 doi GBVA2014018000001.pica (DE-627)ELV039478742 (ELSEVIER)S1077-3142(14)00152-0 DE-627 ger DE-627 rakwb eng 004 004 DE-600 630 VZ 640 VZ 610 VZ Dutt, Mousumi verfasserin aut On the family of shortest isothetic paths in a digital object—An algorithm with applications 2014 14 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier • An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given to demonstrate the effectiveness of FSIP. Shape analysis Elsevier Monotone polygon Elsevier Isothetic path Elsevier Shortest path Elsevier Monotone path Elsevier Biswas, Arindam oth Bhowmick, Partha oth Bhattacharya, Bhargab B. oth Enthalten in Elsevier Editorial Board 2016 CVIU San Diego, Calif (DE-627)ELV019616708 volume:129 year:2014 pages:75-88 extent:14 https://doi.org/10.1016/j.cviu.2014.07.001 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA AR 129 2014 75-88 14 045F 004 |
| allfields_unstemmed |
10.1016/j.cviu.2014.07.001 doi GBVA2014018000001.pica (DE-627)ELV039478742 (ELSEVIER)S1077-3142(14)00152-0 DE-627 ger DE-627 rakwb eng 004 004 DE-600 630 VZ 640 VZ 610 VZ Dutt, Mousumi verfasserin aut On the family of shortest isothetic paths in a digital object—An algorithm with applications 2014 14 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier • An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given to demonstrate the effectiveness of FSIP. Shape analysis Elsevier Monotone polygon Elsevier Isothetic path Elsevier Shortest path Elsevier Monotone path Elsevier Biswas, Arindam oth Bhowmick, Partha oth Bhattacharya, Bhargab B. oth Enthalten in Elsevier Editorial Board 2016 CVIU San Diego, Calif (DE-627)ELV019616708 volume:129 year:2014 pages:75-88 extent:14 https://doi.org/10.1016/j.cviu.2014.07.001 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA AR 129 2014 75-88 14 045F 004 |
| allfieldsGer |
10.1016/j.cviu.2014.07.001 doi GBVA2014018000001.pica (DE-627)ELV039478742 (ELSEVIER)S1077-3142(14)00152-0 DE-627 ger DE-627 rakwb eng 004 004 DE-600 630 VZ 640 VZ 610 VZ Dutt, Mousumi verfasserin aut On the family of shortest isothetic paths in a digital object—An algorithm with applications 2014 14 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier • An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given to demonstrate the effectiveness of FSIP. Shape analysis Elsevier Monotone polygon Elsevier Isothetic path Elsevier Shortest path Elsevier Monotone path Elsevier Biswas, Arindam oth Bhowmick, Partha oth Bhattacharya, Bhargab B. oth Enthalten in Elsevier Editorial Board 2016 CVIU San Diego, Calif (DE-627)ELV019616708 volume:129 year:2014 pages:75-88 extent:14 https://doi.org/10.1016/j.cviu.2014.07.001 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA AR 129 2014 75-88 14 045F 004 |
| allfieldsSound |
10.1016/j.cviu.2014.07.001 doi GBVA2014018000001.pica (DE-627)ELV039478742 (ELSEVIER)S1077-3142(14)00152-0 DE-627 ger DE-627 rakwb eng 004 004 DE-600 630 VZ 640 VZ 610 VZ Dutt, Mousumi verfasserin aut On the family of shortest isothetic paths in a digital object—An algorithm with applications 2014 14 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier • An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given to demonstrate the effectiveness of FSIP. Shape analysis Elsevier Monotone polygon Elsevier Isothetic path Elsevier Shortest path Elsevier Monotone path Elsevier Biswas, Arindam oth Bhowmick, Partha oth Bhattacharya, Bhargab B. oth Enthalten in Elsevier Editorial Board 2016 CVIU San Diego, Calif (DE-627)ELV019616708 volume:129 year:2014 pages:75-88 extent:14 https://doi.org/10.1016/j.cviu.2014.07.001 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA AR 129 2014 75-88 14 045F 004 |
| language |
English |
| source |
Enthalten in Editorial Board San Diego, Calif volume:129 year:2014 pages:75-88 extent:14 |
| sourceStr |
Enthalten in Editorial Board San Diego, Calif volume:129 year:2014 pages:75-88 extent:14 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Shape analysis Monotone polygon Isothetic path Shortest path Monotone path |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Editorial Board |
| authorswithroles_txt_mv |
Dutt, Mousumi @@aut@@ Biswas, Arindam @@oth@@ Bhowmick, Partha @@oth@@ Bhattacharya, Bhargab B. @@oth@@ |
| publishDateDaySort_date |
2014-01-01T00:00:00Z |
| hierarchy_top_id |
ELV019616708 |
| dewey-sort |
14 |
| id |
ELV039478742 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV039478742</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230624061736.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2014 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.cviu.2014.07.001</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2014018000001.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV039478742</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S1077-3142(14)00152-0</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">630</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">640</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dutt, Mousumi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the family of shortest isothetic paths in a digital object—An algorithm with applications</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">• An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given to demonstrate the effectiveness of FSIP.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Shape analysis</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Monotone polygon</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Isothetic path</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Shortest path</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Monotone path</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Biswas, Arindam</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bhowmick, Partha</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bhattacharya, Bhargab B.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="t">Editorial Board</subfield><subfield code="d">2016</subfield><subfield code="d">CVIU</subfield><subfield code="g">San Diego, Calif</subfield><subfield code="w">(DE-627)ELV019616708</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:129</subfield><subfield code="g">year:2014</subfield><subfield code="g">pages:75-88</subfield><subfield code="g">extent:14</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.cviu.2014.07.001</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">129</subfield><subfield code="j">2014</subfield><subfield code="h">75-88</subfield><subfield code="g">14</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| author |
Dutt, Mousumi |
| spellingShingle |
Dutt, Mousumi ddc 004 ddc 630 ddc 640 ddc 610 Elsevier Shape analysis Elsevier Monotone polygon Elsevier Isothetic path Elsevier Shortest path Elsevier Monotone path On the family of shortest isothetic paths in a digital object—An algorithm with applications |
| authorStr |
Dutt, Mousumi |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV019616708 |
| format |
electronic Article |
| dewey-ones |
004 - Data processing & computer science 630 - Agriculture & related technologies 640 - Home & family management 610 - Medicine & health |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
004 004 DE-600 630 VZ 640 VZ 610 VZ On the family of shortest isothetic paths in a digital object—An algorithm with applications Shape analysis Elsevier Monotone polygon Elsevier Isothetic path Elsevier Shortest path Elsevier Monotone path Elsevier |
| topic |
ddc 004 ddc 630 ddc 640 ddc 610 Elsevier Shape analysis Elsevier Monotone polygon Elsevier Isothetic path Elsevier Shortest path Elsevier Monotone path |
| topic_unstemmed |
ddc 004 ddc 630 ddc 640 ddc 610 Elsevier Shape analysis Elsevier Monotone polygon Elsevier Isothetic path Elsevier Shortest path Elsevier Monotone path |
| topic_browse |
ddc 004 ddc 630 ddc 640 ddc 610 Elsevier Shape analysis Elsevier Monotone polygon Elsevier Isothetic path Elsevier Shortest path Elsevier Monotone path |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
a b ab p b pb b b b bb bbb |
| hierarchy_parent_title |
Editorial Board |
| hierarchy_parent_id |
ELV019616708 |
| dewey-tens |
000 - Computer science, knowledge & systems 630 - Agriculture 640 - Home & family management 610 - Medicine & health |
| hierarchy_top_title |
Editorial Board |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV019616708 |
| title |
On the family of shortest isothetic paths in a digital object—An algorithm with applications |
| ctrlnum |
(DE-627)ELV039478742 (ELSEVIER)S1077-3142(14)00152-0 |
| title_full |
On the family of shortest isothetic paths in a digital object—An algorithm with applications |
| author_sort |
Dutt, Mousumi |
| journal |
Editorial Board |
| journalStr |
Editorial Board |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2014 |
| contenttype_str_mv |
zzz |
| container_start_page |
75 |
| author_browse |
Dutt, Mousumi |
| container_volume |
129 |
| physical |
14 |
| class |
004 004 DE-600 630 VZ 640 VZ 610 VZ |
| format_se |
Elektronische Aufsätze |
| author-letter |
Dutt, Mousumi |
| doi_str_mv |
10.1016/j.cviu.2014.07.001 |
| dewey-full |
004 630 640 610 |
| title_sort |
on the family of shortest isothetic paths in a digital object—an algorithm with applications |
| title_auth |
On the family of shortest isothetic paths in a digital object—An algorithm with applications |
| abstract |
• An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given to demonstrate the effectiveness of FSIP. |
| abstractGer |
• An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given to demonstrate the effectiveness of FSIP. |
| abstract_unstemmed |
• An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given to demonstrate the effectiveness of FSIP. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA |
| title_short |
On the family of shortest isothetic paths in a digital object—An algorithm with applications |
| url |
https://doi.org/10.1016/j.cviu.2014.07.001 |
| remote_bool |
true |
| author2 |
Biswas, Arindam Bhowmick, Partha Bhattacharya, Bhargab B. |
| author2Str |
Biswas, Arindam Bhowmick, Partha Bhattacharya, Bhargab B. |
| ppnlink |
ELV019616708 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth |
| doi_str |
10.1016/j.cviu.2014.07.001 |
| up_date |
2024-07-06T20:42:50.338Z |
| _version_ |
1803863793690738688 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV039478742</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230624061736.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2014 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.cviu.2014.07.001</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2014018000001.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV039478742</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S1077-3142(14)00152-0</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">630</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">640</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dutt, Mousumi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the family of shortest isothetic paths in a digital object—An algorithm with applications</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">• An algorithm to compute Family of Shortest Isothetic Paths (FSIP) is proposed. • We make certain characterization of FSIP, which leads to the algorithm. • Algorithm is discussed in detail with demonstration. • We also show how FSIP can be used for shape analysis. • Experimental results are given to demonstrate the effectiveness of FSIP.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Shape analysis</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Monotone polygon</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Isothetic path</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Shortest path</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Monotone path</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Biswas, Arindam</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bhowmick, Partha</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bhattacharya, Bhargab B.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="t">Editorial Board</subfield><subfield code="d">2016</subfield><subfield code="d">CVIU</subfield><subfield code="g">San Diego, Calif</subfield><subfield code="w">(DE-627)ELV019616708</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:129</subfield><subfield code="g">year:2014</subfield><subfield code="g">pages:75-88</subfield><subfield code="g">extent:14</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.cviu.2014.07.001</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">129</subfield><subfield code="j">2014</subfield><subfield code="h">75-88</subfield><subfield code="g">14</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| score |
7.400853 |