summaryrefslogtreecommitdiff
path: root/macros/latex/contrib/sectionbox/example/sectionboxexample.bib
blob: 8d45364c35daab481861440e08b8569623e01163 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

@String{ismm2005 ={Mathematical Morphology: 40 Years On, Proc. Int. Symp. Math. Morphology (ISMM) 2005}}
@String{tpami = {IEEE Trans. Pattern Anal. Mach. Intell.}}
@String{icip2005 = {Proc. Int. Conf. Image Proc. 2005}}

@InProceedings{ouzounis05:_count_overs_partit_based_connec,
  author = 	 {G. K. Ouzounis and M. H. F. Wilkinson},
  title = 	 {Countering Oversegmentation in Partitioning-Based Connectivities},
  booktitle =	 icip2005,
  year =	 2005,
  address =	 {Genova, Italy},
  month =	 {September 11--14},
  note =	 {in press}
}


@InProceedings{ouzounis05:_secon_order_connec_attrib_filter,
  author = 	 {G. K. Ouzounis and M. H. F. Wilkinson},
  title = 	 {Second-Order Connected Attribute Filters Using {M}ax-Trees},
  booktitle =	 ismm2005,
  year =	 2005,
  pages =        {65--74},
  month =        {18-20 April},
  address =      {Paris}
}


@InProceedings{urbach05:_vector_attrib_filter,
  author = 	 {E. R. Urbach and N. J. Boersma and M. H. F. Wilkinson},
  title = 	 {Vector-Attribute Filters},
  booktitle =	 ismm2005,
  pages =        {95--104},
  year =	 2005,
  month =        {18-20 April},
  address =      {Paris},
}

@Article{Meijster:Wilkinson:PAMI,
  author = 	 {A. Meijster and M. H. F. Wilkinson},
  title = 	 {A comparison of algorithms for connected set openings and closings},
  journal = 	 tpami,
  year = 	 2002,
  volume =       24,
  number =       4,
  pages  =       {484-494}
}

@InProceedings{wilkinson01:_shape_preser_filam_enhan_filter,
  author = 	 {M. H. F. Wilkinson and M. A. Westenberg},
  editor =       {W. J. Niessen and M. A. Viergever},
  title = 	 {Shape Preserving Filament Enhancement Filtering},
  booktitle = 	 {Proc. MICCAI'2001},
  series =       {Lecture Notes in Computer Science},
  volume =       2208,
  year =	 2001,
  pages =        {770-777}
}