Divide and conquer parallelisation methods for digital image processing algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Düsseldorf
VDI-Verl.
2000
|
| Ausgabe: | Als Ms. gedr. |
| Schriftenreihe: | Fortschritt-Berichte VDI
Reihe 10, Angewandte Informatik ; 649 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Zugl.: Freiburg im Breisgau, Univ., Diss., 2000 |
| Beschreibung: | VII, 104 S. Ill., graph. Darst. |
| ISBN: | 3183649101 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV013606070 | ||
| 003 | DE-604 | ||
| 005 | 20061114 | ||
| 007 | t | ||
| 008 | 010220s2000 gw ad|| mm|| 00||| eng d | ||
| 016 | 7 | |a 960660852 |2 DE-101 | |
| 020 | |a 3183649101 |9 3-18-364910-1 | ||
| 035 | |a (OCoLC)48052707 | ||
| 035 | |a (DE-599)BVBBV013606070 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-703 |a DE-210 |a DE-83 | ||
| 084 | |a ST 330 |0 (DE-625)143663: |2 rvk | ||
| 100 | 1 | |a Bieniek, Andreas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Divide and conquer parallelisation methods for digital image processing algorithms |c Andreas Bieniek |
| 246 | 1 | 3 | |a Divide-and-conquer parallelisation methods for digital image processing algorithms |
| 250 | |a Als Ms. gedr. | ||
| 264 | 1 | |a Düsseldorf |b VDI-Verl. |c 2000 | |
| 300 | |a VII, 104 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Fortschritt-Berichte VDI : Reihe 10, Angewandte Informatik |v 649 | |
| 500 | |a Zugl.: Freiburg im Breisgau, Univ., Diss., 2000 | ||
| 650 | 0 | 7 | |a Divide-and-conquer-Verfahren |0 (DE-588)4291466-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verteilter Speicher |0 (DE-588)4263487-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a MIMD |0 (DE-588)4300178-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Bildverarbeitung |0 (DE-588)4006684-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a MPI |g Schnittstelle |0 (DE-588)4456003-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a MIMD |0 (DE-588)4300178-6 |D s |
| 689 | 0 | 1 | |a Verteilter Speicher |0 (DE-588)4263487-8 |D s |
| 689 | 0 | 2 | |a MPI |g Schnittstelle |0 (DE-588)4456003-5 |D s |
| 689 | 0 | 3 | |a Bildverarbeitung |0 (DE-588)4006684-8 |D s |
| 689 | 0 | 4 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
| 689 | 0 | 5 | |a Divide-and-conquer-Verfahren |0 (DE-588)4291466-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Fortschritt-Berichte VDI |v Reihe 10, Angewandte Informatik ; 649 |w (DE-604)BV000897204 |9 649 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009294528&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
Datensatz im Suchindex
| _version_ | 1805068592059777024 |
|---|---|
| adam_text |
CONTENTS
V
CONTENTS
1
INTRODUCTION
1
2
MODELS
OF
PARALLEL
COMPUTATION
3
3
DIVIDE-AND-CONQUER
ALGORITHMS
ON
PARALLEL
SYSTEMS
6
3.1
THE
COMMUNICATION
MODEL
FOR
PARALLEL
DIVIDE-AND-CONQUER
ALGORITHMS
.
8
3.2
COMMUNICATION
GRAPHS
FOR
DIVIDE-AND-CONQUER
ALGORITHMS
.
9
3.2.1
SINGLE
MERGE
AND
SPLIT
OPERATION
.
10
3.2.2
REDUNDANT
MERGE
OPERATION
.
12
3.2.3
LOCAL
SPLIT
OPERATION
.
14
3.2.4
DISTRIBUTED
MERGE
AND
SPLIT
SCHEME
FOR
K-SEPARABLE
ALGORITHMS
.
15
3.3
GRAPH
EMBEDDINGS
FOR
DIVIDE-AND-CONQUER
ALGORITHMS
.
16
3.4
EXPERIMENTAL
RESULTS
AND
SUMMARY
.
19
4
CONNECTED
COMPONENT
LABELLING
24
4.1
THE
CONNECTED
COMPONENT
PROBLEM
.
24
4.2
THE
IMAGE
CONNECTED
COMPONENT
ALGORITHM
.
26
4.3
DESCRIPTION
OF
THE
ALGORITHM
FOR
BINARY
IMAGES
.
27
4.4
DESCRIPTION
OF
THE
ALGORITHM
FOR
GREY-LEVEL
IMAGES
.
28
4.5
PARALLEL
CONNECTED
COMPONENT
ALGORITHMS
.
29
4.5.1
PARALLEL
ALGORITHMS
FOR
SIMD
MESH-CONNECTED
COMPUTERS
.
29
4.5.2
PARALLEL
ALGORITHMS
FOR
MIMD
DISTRIBUTED
MEMORY
COMPUTERS
.
30
4.5.3
PARALLEL
ALGORITHMS
FOR
THE
PRAM
MODEL
.
31
4.6
OUTLINE
OF
THE
PARALLEL
ALGORITHM
.
32
4.7
COMPLEXITY
ANALYSIS
OF
THE
PARALLEL
CONNECTED
COMPONENT
ALGORITHM
.
35
4.7.1
ASYMPTOTICAL
BEHAVIOUR
.
35
4.7.2
COMPLEXITY
ANALYSIS
FOR
THE
IDEAL
MACHINE
MODEL
.
36
4.7.3
PERFORMANCE
ESTIMATION
OF
THE
PARALLEL
ALGORITHM
.
37
4.8
EXPERIMENTAL
RESULTS
.
37
VI
CONTENTS
5
A
CONNECTED
COMPONENT
APPROACH
FOR
THE
WATERSHED
SEGMENTATION
45
5.1
WATERSHED
ALGORITHMS
BASED
ON
HIERARCHICAL
QUEUES
.
46
5.2
DEFINITION
OF
THE
WATERSHED
SEGMENTATION
FOR
IMAGES
WITHOUT
NON-MINIMA
PLATEAUS
47
5.3
RELATION
TO
THE
TRADITIONAL
DEFINITION
OF
THE
WATERSHED
SEGMENTATION
.
49
5.4
THE
SEQUENTIAL
WATERSHED
ALGORITHM
FOR
LOWER
COMPLETE
IMAGES
.
51
5.5
EXTENSION
OF
THE
DEFINITION
FOR
IMAGES
WITH
PLATEAUS
.
52
5.6
THE
SEQUENTIAL
WATERSHED
ALGORITHM
FOR
IMAGES
WITH
PLATEAUS
.
53
5.7
COMPLEXITY
ANALYSIS
OF
THE
SEQUENTIAL
WATERSHED
ALGORITHM
AND
EXPERIMENTAL
RESULTS
55
6
THE
PARALLEL
WATERSHED
TRANSFORMATION
57
6.1
A
DIVIDE-AND-CONQUER
APPROACH
FOR
THE
PARALLEL
WATERSHED
SEGMENTATION
.
58
6.2
THE
PARALLEL
WATERSHED
ALGORITHM
FOR
IMAGES
WITHOUT
NON-MINIMA
PLATEAUS
.
59
6.3
PLATEAU
CORRECTION
WITH
ITERATIVE
RE-FLOODING
.
61
6.4
PLATEAU
CORRECTION
WITH
A
SINGLE
MERGE
OPERATION
AND
REDUNDANT
RE-FLOODING
.
62
6.5
A
DIVIDE-AND-CONQUER
WATERSHED
ALGORITHM
FOR
SHARED
MEMORY
COMPUTERS
.
62
6.6
EXPERIMENTAL
RESULTS
.
63
7
DIVIDE-AND-CONQUER
SCHEMES
TO
COLLECT
OR
EXTRACT
ICONIC
DATA
69
7.1
REDUNDANT
EXTRACTION
OF
ICONIC
DATA
.
70
7.2
REDUNDANT
EXTRACTION
OF
ICONIC
DATA
WITH
REDUCED
COMMUNICATION
.
71
7.3
REDUNDANT
EXTRACTION
OF
ICONIC
DATA
WITH
LOAD
BALANCING
.
71
7.3.1
LOAD
BALANCING
FOR
OBJECTS
WITH
CONSTANT
POST-PROCESSING
TIME
.
72
7.3.2
LOAD
BALANCING
FOR
OBJECTS
WITH
A
POST-PROCESSING
TIME
WHICH
DEPENDS
ON
THE
OBJECT
SIZE
.
74
7.4
A
DISTRIBUTED
ALGORITHM
FOR
THE
COLLECTION
OR
EXTRACTION
OF
ICONIC
DATA
.
74
8
A
PARALLEL
CONTOUR
EXTRACTION
AND
CLASSIFICATION
ALGORITHM
78
8.1
THE
SEQUENTIAL
CONTOUR
FOLLOWING
ALGORITHM
.
78
8.1.1
THE
PARALLEL
CONTOUR
FOLLOWING
ALGORITHM
.
82
8.1.2
HIERARCHY
OF
CONTOURS
.
84
8.1.3
CALCULATION
OF
CONVEX
HULLS
.
84
8.1.4
THE
NORMALISATION
STEPS
.
,
.
84
8.1.5
PARALLELISATION
OF
THE
FOURIER
ANALYSIS
.
85
8.1.6
CLASSIFICATION
.
86
8.1.7
EXPERIMENTAL
RESULTS
.
86
8.2
AN
OUTLOOK
ON
THE
APPLICATION
OF
THE
DISTRIBUTED
MERGE
AND
SPLIT
SCHEME
.
89
9
CONCLUSION
93
CONTENTS
BIBLIOGRAPHY
VII
95 |
| any_adam_object | 1 |
| author | Bieniek, Andreas |
| author_facet | Bieniek, Andreas |
| author_role | aut |
| author_sort | Bieniek, Andreas |
| author_variant | a b ab |
| building | Verbundindex |
| bvnumber | BV013606070 |
| classification_rvk | ST 330 |
| ctrlnum | (OCoLC)48052707 (DE-599)BVBBV013606070 |
| discipline | Informatik |
| edition | Als Ms. gedr. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV013606070</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20061114</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">010220s2000 gw ad|| mm|| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">960660852</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3183649101</subfield><subfield code="9">3-18-364910-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)48052707</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013606070</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-210</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 330</subfield><subfield code="0">(DE-625)143663:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bieniek, Andreas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Divide and conquer parallelisation methods for digital image processing algorithms</subfield><subfield code="c">Andreas Bieniek</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Divide-and-conquer parallelisation methods for digital image processing algorithms</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Als Ms. gedr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Düsseldorf</subfield><subfield code="b">VDI-Verl.</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 104 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Fortschritt-Berichte VDI : Reihe 10, Angewandte Informatik</subfield><subfield code="v">649</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Freiburg im Breisgau, Univ., Diss., 2000</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Divide-and-conquer-Verfahren</subfield><subfield code="0">(DE-588)4291466-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteilter Speicher</subfield><subfield code="0">(DE-588)4263487-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">MIMD</subfield><subfield code="0">(DE-588)4300178-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Bildverarbeitung</subfield><subfield code="0">(DE-588)4006684-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">MPI</subfield><subfield code="g">Schnittstelle</subfield><subfield code="0">(DE-588)4456003-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">MIMD</subfield><subfield code="0">(DE-588)4300178-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Verteilter Speicher</subfield><subfield code="0">(DE-588)4263487-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">MPI</subfield><subfield code="g">Schnittstelle</subfield><subfield code="0">(DE-588)4456003-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Bildverarbeitung</subfield><subfield code="0">(DE-588)4006684-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Divide-and-conquer-Verfahren</subfield><subfield code="0">(DE-588)4291466-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Fortschritt-Berichte VDI</subfield><subfield code="v">Reihe 10, Angewandte Informatik ; 649</subfield><subfield code="w">(DE-604)BV000897204</subfield><subfield code="9">649</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009294528&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV013606070 |
| illustrated | Illustrated |
| indexdate | 2024-07-20T03:52:34Z |
| institution | BVB |
| isbn | 3183649101 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009294528 |
| oclc_num | 48052707 |
| open_access_boolean | |
| owner | DE-703 DE-210 DE-83 |
| owner_facet | DE-703 DE-210 DE-83 |
| physical | VII, 104 S. Ill., graph. Darst. |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | VDI-Verl. |
| record_format | marc |
| series | Fortschritt-Berichte VDI |
| series2 | Fortschritt-Berichte VDI : Reihe 10, Angewandte Informatik |
| spelling | Bieniek, Andreas Verfasser aut Divide and conquer parallelisation methods for digital image processing algorithms Andreas Bieniek Divide-and-conquer parallelisation methods for digital image processing algorithms Als Ms. gedr. Düsseldorf VDI-Verl. 2000 VII, 104 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Fortschritt-Berichte VDI : Reihe 10, Angewandte Informatik 649 Zugl.: Freiburg im Breisgau, Univ., Diss., 2000 Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd rswk-swf Verteilter Speicher (DE-588)4263487-8 gnd rswk-swf MIMD (DE-588)4300178-6 gnd rswk-swf Bildverarbeitung (DE-588)4006684-8 gnd rswk-swf MPI Schnittstelle (DE-588)4456003-5 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content MIMD (DE-588)4300178-6 s Verteilter Speicher (DE-588)4263487-8 s MPI Schnittstelle (DE-588)4456003-5 s Bildverarbeitung (DE-588)4006684-8 s Paralleler Algorithmus (DE-588)4193615-2 s Divide-and-conquer-Verfahren (DE-588)4291466-8 s DE-604 Fortschritt-Berichte VDI Reihe 10, Angewandte Informatik ; 649 (DE-604)BV000897204 649 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009294528&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Bieniek, Andreas Divide and conquer parallelisation methods for digital image processing algorithms Fortschritt-Berichte VDI Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd Verteilter Speicher (DE-588)4263487-8 gnd MIMD (DE-588)4300178-6 gnd Bildverarbeitung (DE-588)4006684-8 gnd MPI Schnittstelle (DE-588)4456003-5 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd |
| subject_GND | (DE-588)4291466-8 (DE-588)4263487-8 (DE-588)4300178-6 (DE-588)4006684-8 (DE-588)4456003-5 (DE-588)4193615-2 (DE-588)4113937-9 |
| title | Divide and conquer parallelisation methods for digital image processing algorithms |
| title_alt | Divide-and-conquer parallelisation methods for digital image processing algorithms |
| title_auth | Divide and conquer parallelisation methods for digital image processing algorithms |
| title_exact_search | Divide and conquer parallelisation methods for digital image processing algorithms |
| title_full | Divide and conquer parallelisation methods for digital image processing algorithms Andreas Bieniek |
| title_fullStr | Divide and conquer parallelisation methods for digital image processing algorithms Andreas Bieniek |
| title_full_unstemmed | Divide and conquer parallelisation methods for digital image processing algorithms Andreas Bieniek |
| title_short | Divide and conquer parallelisation methods for digital image processing algorithms |
| title_sort | divide and conquer parallelisation methods for digital image processing algorithms |
| topic | Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd Verteilter Speicher (DE-588)4263487-8 gnd MIMD (DE-588)4300178-6 gnd Bildverarbeitung (DE-588)4006684-8 gnd MPI Schnittstelle (DE-588)4456003-5 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd |
| topic_facet | Divide-and-conquer-Verfahren Verteilter Speicher MIMD Bildverarbeitung MPI Schnittstelle Paralleler Algorithmus Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009294528&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000897204 |
| work_keys_str_mv | AT bieniekandreas divideandconquerparallelisationmethodsfordigitalimageprocessingalgorithms |