A Complexity-Level Analysis of the Sensor Planning Task for Object Search
Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the i...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ye, Yiming [verfasserIn] Tsotsos, John K. [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|
| Erschienen: |
Boston, USA and Oxford, UK: Blackwell Publishers Inc ; 2001 |
|---|
| Schlagwörter: |
|---|
| Umfang: |
Online-Ressource |
|---|
| Reproduktion: |
2002 ; Blackwell Publishing Journal Backfiles 1879-2005 |
|---|---|
| Übergeordnetes Werk: |
In: Computational intelligence - Oxford [u.a.] : Wiley-Blackwell, 1985, 17(2001), 4, Seite 0 |
| Übergeordnetes Werk: |
volume:17 ; year:2001 ; number:4 ; pages:0 |
| Links: |
|---|
| DOI / URN: |
10.1111/0824-7935.00166 |
|---|
| Katalog-ID: |
NLEJ242522602 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ242522602 | ||
| 003 | DE-627 | ||
| 005 | 20210707160340.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 120427s2001 xx |||||o 00| ||und c | ||
| 024 | 7 | |a 10.1111/0824-7935.00166 |2 doi | |
| 035 | |a (DE-627)NLEJ242522602 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 100 | 1 | |a Ye, Yiming |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A Complexity-Level Analysis of the Sensor Planning Task for Object Search |
| 264 | 1 | |a Boston, USA and Oxford, UK |b Blackwell Publishers Inc |c 2001 | |
| 300 | |a Online-Ressource | ||
| 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 Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete. | ||
| 533 | |d 2002 |f Blackwell Publishing Journal Backfiles 1879-2005 |7 |2002|||||||||| | ||
| 650 | 4 | |a computer vision | |
| 700 | 1 | |a Tsotsos, John K. |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i In |t Computational intelligence |d Oxford [u.a.] : Wiley-Blackwell, 1985 |g 17(2001), 4, Seite 0 |h Online-Ressource |w (DE-627)NLEJ243926685 |w (DE-600)2016539-0 |x 1467-8640 |7 nnns |
| 773 | 1 | 8 | |g volume:17 |g year:2001 |g number:4 |g pages:0 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1111/0824-7935.00166 |q text/html |x Verlag |z Deutschlandweit zugänglich |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a ZDB-1-DJB | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 17 |j 2001 |e 4 |h 0 | ||
| author_variant |
y y yy j k t jk jkt |
|---|---|
| matchkey_str |
article:14678640:2001----::cmlxtlvlnlssfhsnopannt |
| hierarchy_sort_str |
2001 |
| publishDate |
2001 |
| allfields |
10.1111/0824-7935.00166 doi (DE-627)NLEJ242522602 DE-627 ger DE-627 rakwb Ye, Yiming verfasserin aut A Complexity-Level Analysis of the Sensor Planning Task for Object Search Boston, USA and Oxford, UK Blackwell Publishers Inc 2001 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete. 2002 Blackwell Publishing Journal Backfiles 1879-2005 |2002|||||||||| computer vision Tsotsos, John K. verfasserin aut In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 17(2001), 4, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:17 year:2001 number:4 pages:0 http://dx.doi.org/10.1111/0824-7935.00166 text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 17 2001 4 0 |
| spelling |
10.1111/0824-7935.00166 doi (DE-627)NLEJ242522602 DE-627 ger DE-627 rakwb Ye, Yiming verfasserin aut A Complexity-Level Analysis of the Sensor Planning Task for Object Search Boston, USA and Oxford, UK Blackwell Publishers Inc 2001 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete. 2002 Blackwell Publishing Journal Backfiles 1879-2005 |2002|||||||||| computer vision Tsotsos, John K. verfasserin aut In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 17(2001), 4, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:17 year:2001 number:4 pages:0 http://dx.doi.org/10.1111/0824-7935.00166 text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 17 2001 4 0 |
| allfields_unstemmed |
10.1111/0824-7935.00166 doi (DE-627)NLEJ242522602 DE-627 ger DE-627 rakwb Ye, Yiming verfasserin aut A Complexity-Level Analysis of the Sensor Planning Task for Object Search Boston, USA and Oxford, UK Blackwell Publishers Inc 2001 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete. 2002 Blackwell Publishing Journal Backfiles 1879-2005 |2002|||||||||| computer vision Tsotsos, John K. verfasserin aut In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 17(2001), 4, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:17 year:2001 number:4 pages:0 http://dx.doi.org/10.1111/0824-7935.00166 text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 17 2001 4 0 |
| allfieldsGer |
10.1111/0824-7935.00166 doi (DE-627)NLEJ242522602 DE-627 ger DE-627 rakwb Ye, Yiming verfasserin aut A Complexity-Level Analysis of the Sensor Planning Task for Object Search Boston, USA and Oxford, UK Blackwell Publishers Inc 2001 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete. 2002 Blackwell Publishing Journal Backfiles 1879-2005 |2002|||||||||| computer vision Tsotsos, John K. verfasserin aut In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 17(2001), 4, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:17 year:2001 number:4 pages:0 http://dx.doi.org/10.1111/0824-7935.00166 text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 17 2001 4 0 |
| allfieldsSound |
10.1111/0824-7935.00166 doi (DE-627)NLEJ242522602 DE-627 ger DE-627 rakwb Ye, Yiming verfasserin aut A Complexity-Level Analysis of the Sensor Planning Task for Object Search Boston, USA and Oxford, UK Blackwell Publishers Inc 2001 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete. 2002 Blackwell Publishing Journal Backfiles 1879-2005 |2002|||||||||| computer vision Tsotsos, John K. verfasserin aut In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 17(2001), 4, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:17 year:2001 number:4 pages:0 http://dx.doi.org/10.1111/0824-7935.00166 text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 17 2001 4 0 |
| source |
In Computational intelligence 17(2001), 4, Seite 0 volume:17 year:2001 number:4 pages:0 |
| sourceStr |
In Computational intelligence 17(2001), 4, Seite 0 volume:17 year:2001 number:4 pages:0 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
computer vision |
| isfreeaccess_bool |
false |
| container_title |
Computational intelligence |
| authorswithroles_txt_mv |
Ye, Yiming @@aut@@ Tsotsos, John K. @@aut@@ |
| publishDateDaySort_date |
2001-01-01T00:00:00Z |
| hierarchy_top_id |
NLEJ243926685 |
| id |
NLEJ242522602 |
| 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">NLEJ242522602</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210707160340.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">120427s2001 xx |||||o 00| ||und c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1111/0824-7935.00166</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ242522602</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="100" ind1="1" ind2=" "><subfield code="a">Ye, Yiming</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Complexity-Level Analysis of the Sensor Planning Task for Object Search</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, USA and Oxford, UK</subfield><subfield code="b">Blackwell Publishers Inc</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</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">Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="d">2002</subfield><subfield code="f">Blackwell Publishing Journal Backfiles 1879-2005</subfield><subfield code="7">|2002||||||||||</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">computer vision</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tsotsos, John K.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Computational intelligence</subfield><subfield code="d">Oxford [u.a.] : Wiley-Blackwell, 1985</subfield><subfield code="g">17(2001), 4, Seite 0</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ243926685</subfield><subfield code="w">(DE-600)2016539-0</subfield><subfield code="x">1467-8640</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:17</subfield><subfield code="g">year:2001</subfield><subfield code="g">number:4</subfield><subfield code="g">pages:0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1111/0824-7935.00166</subfield><subfield code="q">text/html</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</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">ZDB-1-DJB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">17</subfield><subfield code="j">2001</subfield><subfield code="e">4</subfield><subfield code="h">0</subfield></datafield></record></collection>
|
| series2 |
Blackwell Publishing Journal Backfiles 1879-2005 |
| author |
Ye, Yiming |
| spellingShingle |
Ye, Yiming misc computer vision A Complexity-Level Analysis of the Sensor Planning Task for Object Search |
| authorStr |
Ye, Yiming |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ243926685 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
NL |
| publishPlace |
Boston, USA and Oxford, UK |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1467-8640 |
| topic_title |
A Complexity-Level Analysis of the Sensor Planning Task for Object Search computer vision |
| publisher |
Blackwell Publishers Inc |
| publisherStr |
Blackwell Publishers Inc |
| topic |
misc computer vision |
| topic_unstemmed |
misc computer vision |
| topic_browse |
misc computer vision |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| hierarchy_parent_title |
Computational intelligence |
| hierarchy_parent_id |
NLEJ243926685 |
| hierarchy_top_title |
Computational intelligence |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ243926685 (DE-600)2016539-0 |
| title |
A Complexity-Level Analysis of the Sensor Planning Task for Object Search |
| ctrlnum |
(DE-627)NLEJ242522602 |
| title_full |
A Complexity-Level Analysis of the Sensor Planning Task for Object Search |
| author_sort |
Ye, Yiming |
| journal |
Computational intelligence |
| journalStr |
Computational intelligence |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2001 |
| contenttype_str_mv |
zzz |
| container_start_page |
0 |
| author_browse |
Ye, Yiming Tsotsos, John K. |
| container_volume |
17 |
| physical |
Online-Ressource |
| format_se |
Elektronische Aufsätze |
| author-letter |
Ye, Yiming |
| doi_str_mv |
10.1111/0824-7935.00166 |
| author2-role |
verfasserin |
| title_sort |
a complexity-level analysis of the sensor planning task for object search |
| title_auth |
A Complexity-Level Analysis of the Sensor Planning Task for Object Search |
| abstract |
Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete. |
| abstractGer |
Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete. |
| abstract_unstemmed |
Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete. |
| collection_details |
GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE |
| container_issue |
4 |
| title_short |
A Complexity-Level Analysis of the Sensor Planning Task for Object Search |
| url |
http://dx.doi.org/10.1111/0824-7935.00166 |
| remote_bool |
true |
| author2 |
Tsotsos, John K. |
| author2Str |
Tsotsos, John K. |
| ppnlink |
NLEJ243926685 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1111/0824-7935.00166 |
| up_date |
2024-07-06T02:16:31.193Z |
| _version_ |
1803794190114488320 |
| 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">NLEJ242522602</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210707160340.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">120427s2001 xx |||||o 00| ||und c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1111/0824-7935.00166</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ242522602</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="100" ind1="1" ind2=" "><subfield code="a">Ye, Yiming</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Complexity-Level Analysis of the Sensor Planning Task for Object Search</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, USA and Oxford, UK</subfield><subfield code="b">Blackwell Publishers Inc</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</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">Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP-Complete.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="d">2002</subfield><subfield code="f">Blackwell Publishing Journal Backfiles 1879-2005</subfield><subfield code="7">|2002||||||||||</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">computer vision</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tsotsos, John K.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Computational intelligence</subfield><subfield code="d">Oxford [u.a.] : Wiley-Blackwell, 1985</subfield><subfield code="g">17(2001), 4, Seite 0</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ243926685</subfield><subfield code="w">(DE-600)2016539-0</subfield><subfield code="x">1467-8640</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:17</subfield><subfield code="g">year:2001</subfield><subfield code="g">number:4</subfield><subfield code="g">pages:0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1111/0824-7935.00166</subfield><subfield code="q">text/html</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</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">ZDB-1-DJB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">17</subfield><subfield code="j">2001</subfield><subfield code="e">4</subfield><subfield code="h">0</subfield></datafield></record></collection>
|
| score |
7.398569 |