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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkWatershedSegmentTable.txx,v $
Language: C++
Date: $Date: 2004-03-03 19:15:19 $
Version: $Revision: 1.7 $
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#ifndef __itkWatershedSegmentTable_txx
#define __itkWatershedSegmentTable_txx
namespace itk
{
namespace watershed
{
template <class TScalarType>
void SegmentTable<TScalarType>
::PruneEdgeLists(ScalarType maximum_saliency)
{
Iterator it;
typename edge_list_t::iterator e;
for (it = this->Begin(); it != this->End(); ++it)
{
for (e = (*it).second.edge_list.begin();
e != (*it).second.edge_list.end();
e++)
{
if ( ( e->height - (*it).second.min ) > maximum_saliency )
{ // dump the rest of the list, assumes list is sorted
e++;
(*it).second.edge_list.erase(e, (*it).second.edge_list.end() );
break; // through with this segment
}
}
}
}
template <class TScalarType>
void SegmentTable<TScalarType>
::SortEdgeLists()
{
Iterator it;
for (it = this->Begin(); it != this->End(); ++it)
{
(*it).second.edge_list.sort();
}
}
template <class TScalarType>
bool SegmentTable<TScalarType>
::Add(unsigned long a, const segment_t &t)
{
std::pair<Iterator, bool> result;
result = m_HashMap.insert( ValueType(a, t) );
if (result.second == false) return false;
else return true;
}
//template <class TScalarType>
//void SegmentTable<TScalarType>
//::PrintHashTable() const
//{
// std::cout << "This has table has " << m_HashMap.size() << " entries." <<
// std::endl;
// std::cout << "Maximum depth is " << m_MaximumDepth << std::endl;
// unsigned long i = 0;
//
// edge_list_t::const_iterator e;
// ConstIterator it = this->Begin();
// while (it != this->End() )
// {
// std::cout << "KEY: " << (*it).first << " = " << std::endl;
// std::cout << " min " << (*it).second.min << std::endl;
// std::cout << " edge_list = { ";
// e = (*it).second.edge_list.begin();
// while (e != (*it).second.edge_list.end() )
// {
// std::cout << "(" << (*e).label << ", " << (*e).height << ") ";
// e++;
// }
// std::cout << std::endl;
// it++;
// i++;
// }
// std::cout << "Verified " << i << " entries" << std::endl;
//}
template <class TScalarType>
void
SegmentTable<TScalarType>
::PrintSelf(std::ostream& os, Indent indent) const
{
Superclass::PrintSelf(os,indent);
}
}// end namespace watershed
}// end namespace itk
#endif
|
