File: itkDecisionRuleTest.cxx

package info (click to toggle)
insighttoolkit 3.20.1%2Bgit20120521-3
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 80,652 kB
  • sloc: cpp: 458,133; ansic: 196,223; fortran: 28,000; python: 3,839; tcl: 1,811; sh: 1,184; java: 583; makefile: 430; csh: 220; perl: 193; xml: 20
file content (101 lines) | stat: -rw-r--r-- 2,842 bytes parent folder | download | duplicates (2)
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
/*=========================================================================

  Program:   Insight Segmentation & Registration Toolkit
  Module:    itkDecisionRuleTest.cxx
  Language:  C++
  Date:      $Date$
  Version:   $Revision$

  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.

=========================================================================*/
#if defined(_MSC_VER)
#pragma warning ( disable : 4786 )
#endif

#include "itkDecisionRule.h"
#include "itkObjectFactory.h"

namespace itk {
namespace Statistics {
namespace DecisionRuleTest {

class MyDecisionRule : public DecisionRule
{
public:
  /** Standard class typedef. */
  typedef MyDecisionRule                   Self;
  typedef DecisionRule                     Superclass;
  typedef SmartPointer< Self >             Pointer;
  typedef SmartPointer<const Self>         ConstPointer;

  /** Standard macros */
  itkTypeMacro(MyDecisionRule, DecisionRule);

  /** Method for creation through the object factory. */
  itkNewMacro(Self);
 
  /** Evaluate membership score */
  unsigned int Evaluate(const MembershipVectorType &scoreVector) const
    {
    double max = scoreVector[0];
    
    unsigned int maxIndex = 0;
    unsigned int i;
    for (i = 1; i < scoreVector.size(); i++)
      {
      if (scoreVector[i] > max) 
        {
        max = scoreVector[i];
        maxIndex = i;
        }
      }
    return maxIndex;
    } 
};

}
}
}
int itkDecisionRuleTest(int, char* [] )
{
  typedef itk::Statistics::DecisionRuleTest::MyDecisionRule DecisionRuleType;

  typedef DecisionRuleType::MembershipVectorType MembershipVectorType;

  DecisionRuleType::Pointer decisionRule = DecisionRuleType::New();

  std::cout << decisionRule->GetNameOfClass() << std::endl;
  std::cout << decisionRule->DecisionRuleType::Superclass::GetNameOfClass() << std::endl;

  decisionRule->Print(std::cout);

  MembershipVectorType membershipScoreVector;
  
  double membershipScore1;
  membershipScore1 = 0.1;
  membershipScoreVector.push_back( membershipScore1 );  

  double membershipScore2;
  membershipScore2 = 0.5;
  membershipScoreVector.push_back( membershipScore2 );  

  double membershipScore3;
  membershipScore3 = 1.9;
  membershipScoreVector.push_back( membershipScore3 );  

  // the maximum score is the third component. The decision rule should
  // return index ( 2) 
  if( decisionRule->Evaluate( membershipScoreVector ) != 2 )
    {
    std::cerr << "Decision rule computation is incorrect!" << std::endl;
    return EXIT_FAILURE;
    } 

  return EXIT_SUCCESS;
}