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
|
/*
//
// Copyright 1997-2009 Torsten Rohlfing
//
// Copyright 2004-2011, 2014 SRI International
//
// This file is part of the Computational Morphometry Toolkit.
//
// http://www.nitrc.org/projects/cmtk/
//
// The Computational Morphometry Toolkit is free software: you can
// redistribute it and/or modify it under the terms of the GNU General Public
// License as published by the Free Software Foundation, either version 3 of
// the License, or (at your option) any later version.
//
// The Computational Morphometry Toolkit is distributed in the hope that it
// will be useful, but WITHOUT ANY WARRANTY; without even the implied
// warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with the Computational Morphometry Toolkit. If not, see
// <http://www.gnu.org/licenses/>.
//
// $Revision: 5436 $
//
// $LastChangedDate: 2018-12-10 19:01:20 -0800 (Mon, 10 Dec 2018) $
//
// $LastChangedBy: torstenrohlfing $
//
*/
#include <Segmentation/cmtkLabelCombinationVoting.h>
#include <vector>
#include <algorithm>
namespace
cmtk
{
/** \addtogroup Segmentation */
//@{
LabelCombinationVoting::LabelCombinationVoting( const std::vector<TypedArray::SmartPtr>& data )
{
const size_t nValues = data[ 0 ]->GetDataSize();
this->m_Result = TypedArray::SmartPtr( TypedArray::Create( TYPE_SHORT, nValues ) );
this->m_Result->SetDataClass( DATACLASS_LABEL );
size_t numberOfClasses = 1;
for ( size_t k = 0; k < data.size(); ++k )
{
const Types::DataItemRange range = data[k]->GetRange();
numberOfClasses = std::max( numberOfClasses, 1+static_cast<size_t>( range.m_UpperBound ) );
}
std::vector<unsigned int> label( 1+numberOfClasses );
for ( size_t i = 0; i < nValues; ++i )
{
std::fill( label.begin(), label.end(), 0 );
for ( size_t curr = 0; curr < data.size(); ++curr )
{
Types::DataItem v;
if ( data[ curr ]->Get( v, i ) )
{
++label[ std::min( numberOfClasses, static_cast<size_t>( v ) ) ];
}
}
// Compute winner of label voting.
short maxLab = 0;
unsigned int maxCnt = 0;
for ( size_t lab=0; lab < numberOfClasses; ++lab )
{
// do something with tie case
if ( label[ lab ] > maxCnt )
{
maxCnt = label[ lab ];
maxLab = lab;
}
else
{
if ( label[lab] == maxCnt )
{
maxLab = -1;
}
}
}
this->m_Result->Set( maxLab, i );
}
}
} // namespace cmtk
|
