Use of mathematical morphology in real-time path planning
If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2002 |
|---|
| Schlagwörter: |
|---|
| Umfang: |
9 |
|---|
| Reproduktion: |
Emerald Fulltext Archive Database 1994-2005 |
|---|---|
| Übergeordnetes Werk: |
In: Kybernetes - Bingley : Emerald, 1972, 31(2002), 1, Seite 115-123 |
| Übergeordnetes Werk: |
volume:31 ; year:2002 ; number:1 ; pages:115-123 ; extent:9 |
| Links: |
|---|
| DOI / URN: |
10.1108/03684920210413791 |
|---|
| Katalog-ID: |
NLEJ219711313 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ219711313 | ||
| 003 | DE-627 | ||
| 005 | 20210707091958.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 090811s2002 xxk|||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1108/03684920210413791 |2 doi | |
| 035 | |a (DE-627)NLEJ219711313 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 044 | |c XA-GB | ||
| 245 | 1 | 0 | |a Use of mathematical morphology in real-time path planning |
| 264 | 1 | |c 2002 | |
| 300 | |a 9 | ||
| 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 If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin of several applications in computer vision, in this paper we are going to describe some new features to implement morphological operations by using digital signal processors. After that, an application to path planning is proposed. The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. Consequently, a path planning algorithm which uses morphological operations and a DSP to process images is then described. | ||
| 533 | |f Emerald Fulltext Archive Database 1994-2005 | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Cybernetics | |
| 650 | 4 | |a Signal processing | |
| 650 | 4 | |a Vision | |
| 700 | 1 | |a Pujol, F.A. |4 oth | |
| 700 | 1 | |a Chamizo, J.M. García |4 oth | |
| 700 | 1 | |a Fuster, A. |4 oth | |
| 700 | 1 | |a Pujol, M. |4 oth | |
| 700 | 1 | |a Rizo, R. |4 oth | |
| 773 | 0 | 8 | |i In |t Kybernetes |d Bingley : Emerald, 1972 |g 31(2002), 1, Seite 115-123 |h Online-Ressource |w (DE-627)NLEJ219579385 |w (DE-600)1479781-1 |7 nnns |
| 773 | 1 | 8 | |g volume:31 |g year:2002 |g number:1 |g pages:115-123 |g extent:9 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1108/03684920210413791 |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a ZDB-1-EFD | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 31 |j 2002 |e 1 |h 115-123 |g 9 | ||
| matchkey_str |
pujolfachamizojmgarcafusterapujolmrizor:2002----:somteaiamrhlgiratm |
|---|---|
| hierarchy_sort_str |
2002 |
| publishDate |
2002 |
| allfields |
10.1108/03684920210413791 doi (DE-627)NLEJ219711313 DE-627 ger DE-627 rakwb eng XA-GB Use of mathematical morphology in real-time path planning 2002 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin of several applications in computer vision, in this paper we are going to describe some new features to implement morphological operations by using digital signal processors. After that, an application to path planning is proposed. The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. Consequently, a path planning algorithm which uses morphological operations and a DSP to process images is then described. Emerald Fulltext Archive Database 1994-2005 Algorithms Cybernetics Signal processing Vision Pujol, F.A. oth Chamizo, J.M. García oth Fuster, A. oth Pujol, M. oth Rizo, R. oth In Kybernetes Bingley : Emerald, 1972 31(2002), 1, Seite 115-123 Online-Ressource (DE-627)NLEJ219579385 (DE-600)1479781-1 nnns volume:31 year:2002 number:1 pages:115-123 extent:9 http://dx.doi.org/10.1108/03684920210413791 GBV_USEFLAG_U ZDB-1-EFD GBV_NL_ARTICLE AR 31 2002 1 115-123 9 |
| spelling |
10.1108/03684920210413791 doi (DE-627)NLEJ219711313 DE-627 ger DE-627 rakwb eng XA-GB Use of mathematical morphology in real-time path planning 2002 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin of several applications in computer vision, in this paper we are going to describe some new features to implement morphological operations by using digital signal processors. After that, an application to path planning is proposed. The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. Consequently, a path planning algorithm which uses morphological operations and a DSP to process images is then described. Emerald Fulltext Archive Database 1994-2005 Algorithms Cybernetics Signal processing Vision Pujol, F.A. oth Chamizo, J.M. García oth Fuster, A. oth Pujol, M. oth Rizo, R. oth In Kybernetes Bingley : Emerald, 1972 31(2002), 1, Seite 115-123 Online-Ressource (DE-627)NLEJ219579385 (DE-600)1479781-1 nnns volume:31 year:2002 number:1 pages:115-123 extent:9 http://dx.doi.org/10.1108/03684920210413791 GBV_USEFLAG_U ZDB-1-EFD GBV_NL_ARTICLE AR 31 2002 1 115-123 9 |
| allfields_unstemmed |
10.1108/03684920210413791 doi (DE-627)NLEJ219711313 DE-627 ger DE-627 rakwb eng XA-GB Use of mathematical morphology in real-time path planning 2002 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin of several applications in computer vision, in this paper we are going to describe some new features to implement morphological operations by using digital signal processors. After that, an application to path planning is proposed. The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. Consequently, a path planning algorithm which uses morphological operations and a DSP to process images is then described. Emerald Fulltext Archive Database 1994-2005 Algorithms Cybernetics Signal processing Vision Pujol, F.A. oth Chamizo, J.M. García oth Fuster, A. oth Pujol, M. oth Rizo, R. oth In Kybernetes Bingley : Emerald, 1972 31(2002), 1, Seite 115-123 Online-Ressource (DE-627)NLEJ219579385 (DE-600)1479781-1 nnns volume:31 year:2002 number:1 pages:115-123 extent:9 http://dx.doi.org/10.1108/03684920210413791 GBV_USEFLAG_U ZDB-1-EFD GBV_NL_ARTICLE AR 31 2002 1 115-123 9 |
| allfieldsGer |
10.1108/03684920210413791 doi (DE-627)NLEJ219711313 DE-627 ger DE-627 rakwb eng XA-GB Use of mathematical morphology in real-time path planning 2002 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin of several applications in computer vision, in this paper we are going to describe some new features to implement morphological operations by using digital signal processors. After that, an application to path planning is proposed. The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. Consequently, a path planning algorithm which uses morphological operations and a DSP to process images is then described. Emerald Fulltext Archive Database 1994-2005 Algorithms Cybernetics Signal processing Vision Pujol, F.A. oth Chamizo, J.M. García oth Fuster, A. oth Pujol, M. oth Rizo, R. oth In Kybernetes Bingley : Emerald, 1972 31(2002), 1, Seite 115-123 Online-Ressource (DE-627)NLEJ219579385 (DE-600)1479781-1 nnns volume:31 year:2002 number:1 pages:115-123 extent:9 http://dx.doi.org/10.1108/03684920210413791 GBV_USEFLAG_U ZDB-1-EFD GBV_NL_ARTICLE AR 31 2002 1 115-123 9 |
| allfieldsSound |
10.1108/03684920210413791 doi (DE-627)NLEJ219711313 DE-627 ger DE-627 rakwb eng XA-GB Use of mathematical morphology in real-time path planning 2002 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin of several applications in computer vision, in this paper we are going to describe some new features to implement morphological operations by using digital signal processors. After that, an application to path planning is proposed. The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. Consequently, a path planning algorithm which uses morphological operations and a DSP to process images is then described. Emerald Fulltext Archive Database 1994-2005 Algorithms Cybernetics Signal processing Vision Pujol, F.A. oth Chamizo, J.M. García oth Fuster, A. oth Pujol, M. oth Rizo, R. oth In Kybernetes Bingley : Emerald, 1972 31(2002), 1, Seite 115-123 Online-Ressource (DE-627)NLEJ219579385 (DE-600)1479781-1 nnns volume:31 year:2002 number:1 pages:115-123 extent:9 http://dx.doi.org/10.1108/03684920210413791 GBV_USEFLAG_U ZDB-1-EFD GBV_NL_ARTICLE AR 31 2002 1 115-123 9 |
| language |
English |
| source |
In Kybernetes 31(2002), 1, Seite 115-123 volume:31 year:2002 number:1 pages:115-123 extent:9 |
| sourceStr |
In Kybernetes 31(2002), 1, Seite 115-123 volume:31 year:2002 number:1 pages:115-123 extent:9 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Algorithms Cybernetics Signal processing Vision |
| isfreeaccess_bool |
false |
| container_title |
Kybernetes |
| authorswithroles_txt_mv |
Pujol, F.A. @@oth@@ Chamizo, J.M. García @@oth@@ Fuster, A. @@oth@@ Pujol, M. @@oth@@ Rizo, R. @@oth@@ |
| publishDateDaySort_date |
2002-01-01T00:00:00Z |
| hierarchy_top_id |
NLEJ219579385 |
| id |
NLEJ219711313 |
| 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">NLEJ219711313</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210707091958.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">090811s2002 xxk|||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1108/03684920210413791</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ219711313</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="044" ind1=" " ind2=" "><subfield code="c">XA-GB</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Use of mathematical morphology in real-time path planning</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9</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">If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin of several applications in computer vision, in this paper we are going to describe some new features to implement morphological operations by using digital signal processors. After that, an application to path planning is proposed. The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. Consequently, a path planning algorithm which uses morphological operations and a DSP to process images is then described.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Emerald Fulltext Archive Database 1994-2005</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cybernetics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Signal processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Vision</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pujol, F.A.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chamizo, J.M. García</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fuster, A.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pujol, M.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rizo, R.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Kybernetes</subfield><subfield code="d">Bingley : Emerald, 1972</subfield><subfield code="g">31(2002), 1, Seite 115-123</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ219579385</subfield><subfield code="w">(DE-600)1479781-1</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:31</subfield><subfield code="g">year:2002</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:115-123</subfield><subfield code="g">extent:9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1108/03684920210413791</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-EFD</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">31</subfield><subfield code="j">2002</subfield><subfield code="e">1</subfield><subfield code="h">115-123</subfield><subfield code="g">9</subfield></datafield></record></collection>
|
| series2 |
Emerald Fulltext Archive Database 1994-2005 |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ219579385 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
Use of mathematical morphology in real-time path planning Algorithms Cybernetics Signal processing Vision |
| topic |
misc Algorithms misc Cybernetics misc Signal processing misc Vision |
| spellingShingle |
misc Algorithms misc Cybernetics misc Signal processing misc Vision Use of mathematical morphology in real-time path planning |
| topic_unstemmed |
misc Algorithms misc Cybernetics misc Signal processing misc Vision |
| topic_browse |
misc Algorithms misc Cybernetics misc Signal processing misc Vision |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
f p fp j g c jg jgc a f af m p mp r r rr |
| hierarchy_parent_title |
Kybernetes |
| hierarchy_parent_id |
NLEJ219579385 |
| hierarchy_top_title |
Kybernetes |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ219579385 (DE-600)1479781-1 |
| title |
Use of mathematical morphology in real-time path planning |
| ctrlnum |
(DE-627)NLEJ219711313 |
| title_full |
Use of mathematical morphology in real-time path planning |
| journal |
Kybernetes |
| journalStr |
Kybernetes |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2002 |
| contenttype_str_mv |
zzz |
| container_start_page |
115 |
| container_volume |
31 |
| physical |
9 |
| format_se |
Elektronische Aufsätze |
| countryofpublication_str_mv |
XA-GB |
| doi_str_mv |
10.1108/03684920210413791 |
| title_sort |
use of mathematical morphology in real-time path planning |
| title_auth |
Use of mathematical morphology in real-time path planning |
| abstract |
If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin of several applications in computer vision, in this paper we are going to describe some new features to implement morphological operations by using digital signal processors. After that, an application to path planning is proposed. The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. Consequently, a path planning algorithm which uses morphological operations and a DSP to process images is then described. |
| abstractGer |
If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin of several applications in computer vision, in this paper we are going to describe some new features to implement morphological operations by using digital signal processors. After that, an application to path planning is proposed. The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. Consequently, a path planning algorithm which uses morphological operations and a DSP to process images is then described. |
| abstract_unstemmed |
If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin of several applications in computer vision, in this paper we are going to describe some new features to implement morphological operations by using digital signal processors. After that, an application to path planning is proposed. The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. Consequently, a path planning algorithm which uses morphological operations and a DSP to process images is then described. |
| collection_details |
GBV_USEFLAG_U ZDB-1-EFD GBV_NL_ARTICLE |
| container_issue |
1 |
| title_short |
Use of mathematical morphology in real-time path planning |
| url |
http://dx.doi.org/10.1108/03684920210413791 |
| remote_bool |
true |
| author2 |
Pujol, F.A. Chamizo, J.M. García Fuster, A. Pujol, M. Rizo, R. |
| author2Str |
Pujol, F.A. Chamizo, J.M. García Fuster, A. Pujol, M. Rizo, R. |
| ppnlink |
NLEJ219579385 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth oth oth |
| doi_str |
10.1108/03684920210413791 |
| up_date |
2024-07-06T05:54:40.271Z |
| _version_ |
1803807915005444096 |
| 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">NLEJ219711313</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210707091958.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">090811s2002 xxk|||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1108/03684920210413791</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ219711313</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="044" ind1=" " ind2=" "><subfield code="c">XA-GB</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Use of mathematical morphology in real-time path planning</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9</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">If an autonomous vehicle is working in an image-based system which needs real-time answers and whose response is critical, it will be very important to reduce computation times and, as we know, this could be performed by increasing the system parallelism. Since morphological filtering is the origin of several applications in computer vision, in this paper we are going to describe some new features to implement morphological operations by using digital signal processors. After that, an application to path planning is proposed. The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. Consequently, a path planning algorithm which uses morphological operations and a DSP to process images is then described.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Emerald Fulltext Archive Database 1994-2005</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cybernetics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Signal processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Vision</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pujol, F.A.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chamizo, J.M. García</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fuster, A.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pujol, M.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rizo, R.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Kybernetes</subfield><subfield code="d">Bingley : Emerald, 1972</subfield><subfield code="g">31(2002), 1, Seite 115-123</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ219579385</subfield><subfield code="w">(DE-600)1479781-1</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:31</subfield><subfield code="g">year:2002</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:115-123</subfield><subfield code="g">extent:9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1108/03684920210413791</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-EFD</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">31</subfield><subfield code="j">2002</subfield><subfield code="e">1</subfield><subfield code="h">115-123</subfield><subfield code="g">9</subfield></datafield></record></collection>
|
| score |
7.3998966 |