<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><meta name="robots" content="noindex">
<meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>ITK: itkMaskedRankHistogram.h Source File</title>
<link href="DoxygenStyle.css" rel="stylesheet" type="text/css">
</head><body bgcolor="#ffffff">
<!-- Section customized for INSIGHT : Tue Jul 17 01:02:45 2001 -->
<center>
<a href="index.html" class="qindex">Main Page</a>
<a href="modules.html" class="qindex">Groups</a>
<a href="namespaces.html" class="qindex">Namespace List</a>
<a href="hierarchy.html" class="qindex">Class Hierarchy</a>
<a href="classes.html" class="qindex">Alphabetical List</a>
<a href="annotated.html" class="qindex">Compound List</a>
<a href="files.html" class="qindex">File
List</a>
<a href="namespacemembers.html" class="qindex">Namespace Members</a>
<a href="functions.html" class="qindex">Compound Members</a>
<a href="globals.html" class="qindex">File Members</a>
<a href="pages.html" class="qindex">Concepts</a></center>
<!-- Generated by Doxygen 1.5.9 -->
<div class="navpath"><a class="el" href="dir_02e23d841c198393a6e961e9a0678fff.html">Code</a> » <a class="el" href="dir_dd352b1cbb04f9ff09fa5f33693fed9f.html">Review</a>
</div>
<div class="contents">
<h1>itkMaskedRankHistogram.h</h1><a href="itkMaskedRankHistogram_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*=========================================================================</span>
<a name="l00002"></a>00002 <span class="comment"></span>
<a name="l00003"></a>00003 <span class="comment"> Program: Insight Segmentation & Registration Toolkit</span>
<a name="l00004"></a>00004 <span class="comment"> Module: $RCSfile: itkMaskedRankHistogram.h,v $</span>
<a name="l00005"></a>00005 <span class="comment"> Language: C++</span>
<a name="l00006"></a>00006 <span class="comment"> Date: $Date: 2008-09-29 18:36:38 $</span>
<a name="l00007"></a>00007 <span class="comment"> Version: $Revision: 1.4 $</span>
<a name="l00008"></a>00008 <span class="comment"></span>
<a name="l00009"></a>00009 <span class="comment"> Copyright (c) Insight Software Consortium. All rights reserved.</span>
<a name="l00010"></a>00010 <span class="comment"> See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.</span>
<a name="l00011"></a>00011 <span class="comment"></span>
<a name="l00012"></a>00012 <span class="comment"> This software is distributed WITHOUT ANY WARRANTY; without even </span>
<a name="l00013"></a>00013 <span class="comment"> the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR </span>
<a name="l00014"></a>00014 <span class="comment"> PURPOSE. See the above copyright notices for more information.</span>
<a name="l00015"></a>00015 <span class="comment"></span>
<a name="l00016"></a>00016 <span class="comment">=========================================================================*/</span>
<a name="l00017"></a>00017
<a name="l00018"></a>00018 <span class="comment">// histogram from the moving histogram operations</span>
<a name="l00019"></a>00019 <span class="preprocessor">#ifndef __itkMaskedRankHistogram_h</span>
<a name="l00020"></a>00020 <span class="preprocessor"></span><span class="preprocessor">#define __itkMaskedRankHistogram_h</span>
<a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#include "itkNumericTraits.h"</span>
<a name="l00022"></a>00022
<a name="l00023"></a>00023 <span class="keyword">namespace </span>itk {
<a name="l00024"></a>00024
<a name="l00025"></a>00025 <span class="comment">// a simple histogram class hierarchy. One subclass will be maps, the</span>
<a name="l00026"></a>00026 <span class="comment">// other vectors.</span>
<a name="l00027"></a>00027 <span class="comment">// This version is intended for keeping track of arbitary ranks. It is</span>
<a name="l00028"></a>00028 <span class="comment">// based on the code from consolidatedMorphology.</span>
<a name="l00029"></a>00029 <span class="comment">//</span>
<a name="l00030"></a>00030 <span class="comment">// Support for different TCompare hasn't been tested, and shouldn't be</span>
<a name="l00031"></a>00031 <span class="comment">// necessary for the rank filters.</span>
<a name="l00032"></a>00032 <span class="comment">//</span>
<a name="l00033"></a>00033 <span class="comment">// This is a modified version for use with masks. Need to allow for</span>
<a name="l00034"></a>00034 <span class="comment">// the situation in which the map is empty</span>
<a name="l00035"></a>00035 <span class="keyword">template</span> <<span class="keyword">class</span> TInputPixel>
<a name="l00036"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html">00036</a> <span class="keyword">class </span><a class="code" href="classitk_1_1MaskedRankHistogram.html">MaskedRankHistogram</a>
<a name="l00037"></a>00037 {
<a name="l00038"></a>00038 <span class="keyword">public</span>:
<a name="l00039"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#627d9f93c592b436e4ce9bbea2fda6a9">00039</a> <a class="code" href="classitk_1_1MaskedRankHistogram.html#627d9f93c592b436e4ce9bbea2fda6a9">MaskedRankHistogram</a>()
<a name="l00040"></a>00040 {
<a name="l00041"></a>00041 <a class="code" href="classitk_1_1MaskedRankHistogram.html#d1c0acf54931551655177732e4ba853f">m_Rank</a> = 0.5;
<a name="l00042"></a>00042 }
<a name="l00043"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#06b61f16c9ac1f45bb0fda5a174ba07b">00043</a> <span class="keyword">virtual</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html#06b61f16c9ac1f45bb0fda5a174ba07b">~MaskedRankHistogram</a>(){}
<a name="l00044"></a>00044
<a name="l00045"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#54972b501741a7001fe24cc890c48419">00045</a> <span class="keyword">virtual</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html">MaskedRankHistogram</a> * <a class="code" href="classitk_1_1MaskedRankHistogram.html#54972b501741a7001fe24cc890c48419">Clone</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> 0; }
<a name="l00046"></a>00046
<a name="l00047"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#9490774c4eeba9f552f18c67041c76a6">00047</a> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html#9490774c4eeba9f552f18c67041c76a6">Reset</a>(){}
<a name="l00048"></a>00048
<a name="l00049"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#5758d9291d23eda0434a17309485fec7">00049</a> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html#5758d9291d23eda0434a17309485fec7">AddPixel</a>(<span class="keyword">const</span> TInputPixel & <a class="code" href="itkMacro_8h.html#6be3b439282da7a34278c0594589b972">itkNotUsed</a>(p)){}
<a name="l00050"></a>00050
<a name="l00051"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#39931c7e10c89fef890bd64134fe4e35">00051</a> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html#39931c7e10c89fef890bd64134fe4e35">RemovePixel</a>(<span class="keyword">const</span> TInputPixel & <a class="code" href="itkMacro_8h.html#6be3b439282da7a34278c0594589b972">itkNotUsed</a>(p)){}
<a name="l00052"></a>00052
<a name="l00053"></a>00053 <span class="comment">// For the map based version - to be called after there is some data</span>
<a name="l00054"></a>00054 <span class="comment">// included. Meant to be an optimization so that the rank value</span>
<a name="l00055"></a>00055 <span class="comment">// iterator is properly set.</span>
<a name="l00056"></a>00056 <span class="comment">// virtual void Initialize(){};</span>
<a name="l00057"></a>00057
<a name="l00058"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#76e3fcef98549fcbc9bd27d1e37d850d">00058</a> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html#76e3fcef98549fcbc9bd27d1e37d850d">IsValid</a>()
<a name="l00059"></a>00059 {
<a name="l00060"></a>00060 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00061"></a>00061 }
<a name="l00062"></a>00062
<a name="l00063"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#eee654e8714f8e1750e3003534112f85">00063</a> <span class="keyword">virtual</span> TInputPixel <a class="code" href="classitk_1_1MaskedRankHistogram.html#eee654e8714f8e1750e3003534112f85">GetValue</a>( <span class="keyword">const</span> TInputPixel & )
<a name="l00064"></a>00064 {
<a name="l00065"></a>00065 <span class="keywordflow">return</span> NumericTraits<TInputPixel>::Zero;
<a name="l00066"></a>00066 }
<a name="l00067"></a>00067
<a name="l00068"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#c5918c24b88a5f8845c226478adcaabc">00068</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html#c5918c24b88a5f8845c226478adcaabc">SetRank</a>(<span class="keywordtype">float</span> rank)
<a name="l00069"></a>00069 {
<a name="l00070"></a>00070 <a class="code" href="classitk_1_1MaskedRankHistogram.html#d1c0acf54931551655177732e4ba853f">m_Rank</a> = rank;
<a name="l00071"></a>00071 }
<a name="l00072"></a>00072
<a name="l00073"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#39aa21fef74fa35cc5acc8f2400fde68">00073</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html#39aa21fef74fa35cc5acc8f2400fde68">AddBoundary</a>(){}
<a name="l00074"></a>00074
<a name="l00075"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#3494b062d25f5266dc079527dd294fba">00075</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html#3494b062d25f5266dc079527dd294fba">RemoveBoundary</a>(){}
<a name="l00076"></a>00076
<a name="l00077"></a>00077 <span class="keyword">protected</span>:
<a name="l00078"></a><a class="code" href="classitk_1_1MaskedRankHistogram.html#d1c0acf54931551655177732e4ba853f">00078</a> <span class="keywordtype">float</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html#d1c0acf54931551655177732e4ba853f">m_Rank</a>;
<a name="l00079"></a>00079
<a name="l00080"></a>00080 };
<a name="l00081"></a>00081
<a name="l00082"></a>00082 <span class="keyword">template</span> <<span class="keyword">class</span> TInputPixel, <span class="keyword">class</span> TCompare>
<a name="l00083"></a><a class="code" href="classitk_1_1MaskedRankHistogramMap.html">00083</a> <span class="keyword">class </span><a class="code" href="classitk_1_1MaskedRankHistogramMap.html">MaskedRankHistogramMap</a> : <span class="keyword">public</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html">MaskedRankHistogram</a><TInputPixel>
<a name="l00084"></a>00084 {
<a name="l00085"></a>00085 <span class="keyword">public</span>:
<a name="l00086"></a>00086
<a name="l00087"></a><a class="code" href="classitk_1_1MaskedRankHistogramMap.html#0b8d296a2736886466a571fdb857b4ca">00087</a> <span class="keyword">typedef</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html">MaskedRankHistogram<TInputPixel></a> <a class="code" href="classitk_1_1MaskedRankHistogram.html">Superclass</a>;
<a name="l00088"></a>00088
<a name="l00089"></a>00089 <span class="keyword">public</span>:
<a name="l00090"></a><a class="code" href="classitk_1_1MaskedRankHistogramMap.html#2c67e03ffec16f358cb45ae7b5cd762e">00090</a> <a class="code" href="classitk_1_1MaskedRankHistogramMap.html#2c67e03ffec16f358cb45ae7b5cd762e">MaskedRankHistogramMap</a>()
<a name="l00091"></a>00091 {
<a name="l00092"></a>00092 m_Below = m_Entries = 0;
<a name="l00093"></a>00093 <span class="comment">// can't set m_RankIt until something has been put in the histogram</span>
<a name="l00094"></a>00094 m_Initialized = <span class="keyword">false</span>;
<a name="l00095"></a>00095 <span class="keywordflow">if</span>( m_Compare( NumericTraits< TInputPixel >::max(),
<a name="l00096"></a>00096 NumericTraits< TInputPixel >::NonpositiveMin() ) )
<a name="l00097"></a>00097 {
<a name="l00098"></a>00098 m_InitVal = NumericTraits< TInputPixel >::max();
<a name="l00099"></a>00099 }
<a name="l00100"></a>00100 <span class="keywordflow">else</span>
<a name="l00101"></a>00101 {
<a name="l00102"></a>00102 m_InitVal = NumericTraits< TInputPixel >::NonpositiveMin();
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104 m_RankValue = m_InitVal;
<a name="l00105"></a>00105 m_RankIt = m_Map.begin(); <span class="comment">// equivalent to setting to the intial value</span>
<a name="l00106"></a>00106 }
<a name="l00107"></a><a class="code" href="classitk_1_1MaskedRankHistogramMap.html#f3d1bd0d3a30c021c006a901590b726f">00107</a> <a class="code" href="classitk_1_1MaskedRankHistogramMap.html#f3d1bd0d3a30c021c006a901590b726f">~MaskedRankHistogramMap</a>()
<a name="l00108"></a>00108 {
<a name="l00109"></a>00109 }
<a name="l00110"></a>00110
<a name="l00111"></a><a class="code" href="classitk_1_1MaskedRankHistogramMap.html#949a1bda2414cf548dc03962eb71549d">00111</a> <a class="code" href="classitk_1_1MaskedRankHistogram.html">Superclass</a> * <a class="code" href="classitk_1_1MaskedRankHistogramMap.html#949a1bda2414cf548dc03962eb71549d">Clone</a>()<span class="keyword"> const</span>
<a name="l00112"></a>00112 <span class="keyword"> </span>{
<a name="l00113"></a>00113 <a class="code" href="classitk_1_1MaskedRankHistogramMap.html">MaskedRankHistogramMap</a> *result = <span class="keyword">new</span> <a class="code" href="classitk_1_1MaskedRankHistogramMap.html#2c67e03ffec16f358cb45ae7b5cd762e">MaskedRankHistogramMap</a>();
<a name="l00114"></a>00114 result->m_Map = this->m_Map;
<a name="l00115"></a>00115 result-><a class="code" href="classitk_1_1MaskedRankHistogram.html#d1c0acf54931551655177732e4ba853f">m_Rank</a> = this-><a class="code" href="classitk_1_1MaskedRankHistogram.html#d1c0acf54931551655177732e4ba853f">m_Rank</a>;
<a name="l00116"></a>00116 result->m_Below = this->m_Below;
<a name="l00117"></a>00117 result->m_Entries = this->m_Entries;
<a name="l00118"></a>00118 result->m_InitVal = this->m_InitVal;
<a name="l00119"></a>00119 result->m_RankValue = this->m_RankValue;
<a name="l00120"></a>00120 result->m_Initialized = this->m_Initialized;
<a name="l00121"></a>00121 <span class="keywordflow">if</span> (result->m_Initialized)
<a name="l00122"></a>00122 result->m_RankIt = result->m_Map.find(this->m_RankValue);
<a name="l00123"></a>00123 <span class="keywordflow">return</span>(result);
<a name="l00124"></a>00124 }
<a name="l00125"></a><a class="code" href="classitk_1_1MaskedRankHistogramMap.html#51c8be9ec342f514dd585df09e3eca87">00125</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogramMap.html#51c8be9ec342f514dd585df09e3eca87">Reset</a>()
<a name="l00126"></a>00126 {
<a name="l00127"></a>00127 m_Map.clear();
<a name="l00128"></a>00128 m_RankValue = m_InitVal;
<a name="l00129"></a>00129 m_Entries = m_Below = 0;
<a name="l00130"></a>00130 }
<a name="l00131"></a>00131
<a name="l00132"></a><a class="code" href="classitk_1_1MaskedRankHistogramMap.html#0b8e37af3034f4c9c98be10accf2a20d">00132</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogramMap.html#0b8e37af3034f4c9c98be10accf2a20d">AddPixel</a>(<span class="keyword">const</span> TInputPixel &p)
<a name="l00133"></a>00133 {
<a name="l00134"></a>00134 m_Map[ p ]++;
<a name="l00135"></a>00135 <span class="keywordflow">if</span> (!m_Initialized)
<a name="l00136"></a>00136 {
<a name="l00137"></a>00137 m_Initialized = <span class="keyword">true</span>;
<a name="l00138"></a>00138 m_RankIt = m_Map.begin();
<a name="l00139"></a>00139 m_Entries = m_Below = 0;
<a name="l00140"></a>00140 m_RankValue = p;
<a name="l00141"></a>00141 }
<a name="l00142"></a>00142 <span class="keywordflow">if</span> (m_Compare(p, m_RankValue) || p == m_RankValue)
<a name="l00143"></a>00143 {
<a name="l00144"></a>00144 ++m_Below;
<a name="l00145"></a>00145 }
<a name="l00146"></a>00146 ++m_Entries;
<a name="l00147"></a>00147 }
<a name="l00148"></a>00148
<a name="l00149"></a><a class="code" href="classitk_1_1MaskedRankHistogramMap.html#b48406b4c30f70c00d93f007bb14ec69">00149</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogramMap.html#b48406b4c30f70c00d93f007bb14ec69">RemovePixel</a>(<span class="keyword">const</span> TInputPixel &p)
<a name="l00150"></a>00150 {
<a name="l00151"></a>00151 m_Map[ p ]--;
<a name="l00152"></a>00152 <span class="keywordflow">if</span> (m_Compare(p, m_RankValue) || p == m_RankValue)
<a name="l00153"></a>00153 {
<a name="l00154"></a>00154 --m_Below;
<a name="l00155"></a>00155 }
<a name="l00156"></a>00156 --m_Entries;
<a name="l00157"></a>00157 <span class="comment">// this is the change that makes this version less efficient. The</span>
<a name="l00158"></a>00158 <span class="comment">// simplest approach I can think of with maps, though</span>
<a name="l00159"></a>00159 <span class="keywordflow">if</span> (m_Entries <= 0)
<a name="l00160"></a>00160 {
<a name="l00161"></a>00161 m_Initialized = <span class="keyword">false</span>;
<a name="l00162"></a>00162 m_Below = 0;
<a name="l00163"></a>00163 m_Map.clear();
<a name="l00164"></a>00164 }
<a name="l00165"></a>00165 }
<a name="l00166"></a>00166
<a name="l00167"></a>00167 <span class="comment">// void Initialize()</span>
<a name="l00168"></a>00168 <span class="comment">// {</span>
<a name="l00169"></a>00169 <span class="comment">// m_RankIt = m_Map.begin();</span>
<a name="l00170"></a>00170 <span class="comment">// }</span>
<a name="l00171"></a>00171
<a name="l00172"></a><a class="code" href="classitk_1_1MaskedRankHistogramMap.html#3dbd2558e4c5de9a78532b724723546e">00172</a> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classitk_1_1MaskedRankHistogramMap.html#3dbd2558e4c5de9a78532b724723546e">IsValid</a>()
<a name="l00173"></a>00173 {
<a name="l00174"></a>00174 <span class="keywordflow">return</span> m_Initialized;
<a name="l00175"></a>00175 }
<a name="l00176"></a>00176
<a name="l00177"></a>00177
<a name="l00178"></a><a class="code" href="classitk_1_1MaskedRankHistogramMap.html#b7b0ae7147f4fdc2ece53c1e175d3f18">00178</a> TInputPixel <a class="code" href="classitk_1_1MaskedRankHistogramMap.html#b7b0ae7147f4fdc2ece53c1e175d3f18">GetValue</a>( <span class="keyword">const</span> TInputPixel & )
<a name="l00179"></a>00179 {
<a name="l00180"></a>00180 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> target = (int)(this-><a class="code" href="classitk_1_1MaskedRankHistogram.html#d1c0acf54931551655177732e4ba853f">m_Rank</a> * (m_Entries-1)) + 1;
<a name="l00181"></a>00181 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> total = m_Below;
<a name="l00182"></a>00182 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> ThisBin;
<a name="l00183"></a>00183 <span class="keywordtype">bool</span> eraseFlag = <span class="keyword">false</span>;
<a name="l00184"></a>00184
<a name="l00185"></a>00185 <span class="keywordflow">if</span> (total < target)
<a name="l00186"></a>00186 {
<a name="l00187"></a>00187 <span class="keyword">typename</span> MapType::iterator searchIt = m_RankIt;
<a name="l00188"></a>00188 <span class="keyword">typename</span> MapType::iterator eraseIt;
<a name="l00189"></a>00189
<a name="l00190"></a>00190 <span class="keywordflow">while</span> (searchIt != m_Map.end())
<a name="l00191"></a>00191 {
<a name="l00192"></a>00192 <span class="comment">// cleaning up the map - probably a better way of organising</span>
<a name="l00193"></a>00193 <span class="comment">// the loop. Currently makes sure that the search iterator is</span>
<a name="l00194"></a>00194 <span class="comment">// incremented before deleting</span>
<a name="l00195"></a>00195 ++searchIt;
<a name="l00196"></a>00196 ThisBin = searchIt->second;
<a name="l00197"></a>00197 total += ThisBin;
<a name="l00198"></a>00198 <span class="keywordflow">if</span> (eraseFlag)
<a name="l00199"></a>00199 {
<a name="l00200"></a>00200 m_Map.erase(eraseIt);
<a name="l00201"></a>00201 eraseFlag = <span class="keyword">false</span>;
<a name="l00202"></a>00202 }
<a name="l00203"></a>00203 <span class="keywordflow">if</span> (ThisBin <= 0)
<a name="l00204"></a>00204 {
<a name="l00205"></a>00205 eraseFlag = <span class="keyword">true</span>;
<a name="l00206"></a>00206 eraseIt = searchIt;
<a name="l00207"></a>00207 }
<a name="l00208"></a>00208 <span class="keywordflow">if</span> (total >= target)
<a name="l00209"></a>00209 <span class="keywordflow">break</span>;
<a name="l00210"></a>00210 }
<a name="l00211"></a>00211 m_RankValue = searchIt->first;
<a name="l00212"></a>00212 m_RankIt = searchIt;
<a name="l00213"></a>00213 }
<a name="l00214"></a>00214 <span class="keywordflow">else</span>
<a name="l00215"></a>00215 {
<a name="l00216"></a>00216 <span class="keyword">typename</span> MapType::iterator searchIt = m_RankIt;
<a name="l00217"></a>00217 <span class="keyword">typename</span> MapType::iterator eraseIt;
<a name="l00218"></a>00218
<a name="l00219"></a>00219 <span class="keywordflow">while</span>(searchIt != m_Map.begin())
<a name="l00220"></a>00220 {
<a name="l00221"></a>00221 ThisBin = searchIt->second;
<a name="l00222"></a>00222 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> tbelow = total - ThisBin;
<a name="l00223"></a>00223 <span class="keywordflow">if</span> (tbelow < target) <span class="comment">// we've overshot</span>
<a name="l00224"></a>00224 <span class="keywordflow">break</span>;
<a name="l00225"></a>00225 <span class="keywordflow">if</span> (eraseFlag)
<a name="l00226"></a>00226 {
<a name="l00227"></a>00227 m_Map.erase(eraseIt);
<a name="l00228"></a>00228 eraseFlag = <span class="keyword">false</span>;
<a name="l00229"></a>00229 }
<a name="l00230"></a>00230 <span class="keywordflow">if</span> (ThisBin <= 0)
<a name="l00231"></a>00231 {
<a name="l00232"></a>00232 eraseIt = searchIt;
<a name="l00233"></a>00233 eraseFlag = <span class="keyword">true</span>;
<a name="l00234"></a>00234 }
<a name="l00235"></a>00235 total = tbelow;
<a name="l00236"></a>00236
<a name="l00237"></a>00237 --searchIt;
<a name="l00238"></a>00238 }
<a name="l00239"></a>00239 m_RankValue = searchIt->first;
<a name="l00240"></a>00240 m_RankIt = searchIt;
<a name="l00241"></a>00241 }
<a name="l00242"></a>00242
<a name="l00243"></a>00243 m_Below = total;
<a name="l00244"></a>00244 <span class="keywordflow">return</span>(m_RankValue);
<a name="l00245"></a>00245
<a name="l00246"></a>00246 }
<a name="l00247"></a>00247
<a name="l00248"></a>00248 <span class="preprocessor">#if 0</span>
<a name="l00249"></a>00249 <span class="preprocessor"></span> TInputPixel <a class="code" href="classitk_1_1MaskedRankHistogramMap.html#b7b0ae7147f4fdc2ece53c1e175d3f18">GetValue</a>( <span class="keyword">const</span> TInputPixel & )
<a name="l00250"></a>00250 { <span class="comment">// clean the map</span>
<a name="l00251"></a>00251 <span class="keyword">typename</span> MapType::iterator mapIt = m_Map.begin();
<a name="l00252"></a>00252 <span class="keywordflow">while</span>( mapIt != m_Map.end() )
<a name="l00253"></a>00253 {
<a name="l00254"></a>00254 <span class="keywordflow">if</span>( mapIt->second <= 0 )
<a name="l00255"></a>00255 {
<a name="l00256"></a>00256 <span class="comment">// this value must be removed from the histogram</span>
<a name="l00257"></a>00257 <span class="comment">// The value must be stored and the iterator updated before removing the value</span>
<a name="l00258"></a>00258 <span class="comment">// or the iterator is invalidated.</span>
<a name="l00259"></a>00259 TInputPixel toErase = mapIt->first;
<a name="l00260"></a>00260 mapIt++;
<a name="l00261"></a>00261 m_Map.erase( toErase );
<a name="l00262"></a>00262 }
<a name="l00263"></a>00263 <span class="keywordflow">else</span>
<a name="l00264"></a>00264 {
<a name="l00265"></a>00265 mapIt++;
<a name="l00266"></a>00266 <span class="comment">// don't remove all the zero value found, just remove the one before the current maximum value</span>
<a name="l00267"></a>00267 <span class="comment">// the histogram may become quite big on real type image, but it's an important increase of performances</span>
<a name="l00268"></a>00268 <span class="keywordflow">break</span>;
<a name="l00269"></a>00269 }
<a name="l00270"></a>00270 }
<a name="l00271"></a>00271
<a name="l00272"></a>00272 <span class="comment">// and return the value</span>
<a name="l00273"></a>00273 <span class="keywordflow">return</span> m_Map.begin()->first;
<a name="l00274"></a>00274 }
<a name="l00275"></a>00275 <span class="preprocessor">#endif</span>
<a name="l00276"></a>00276 <span class="preprocessor"></span>
<a name="l00277"></a>00277 <span class="keyword">private</span>:
<a name="l00278"></a>00278 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::map< TInputPixel, unsigned long, TCompare > MapType;
<a name="l00279"></a>00279
<a name="l00280"></a>00280 MapType m_Map;
<a name="l00281"></a>00281 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> m_Below;
<a name="l00282"></a>00282 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> m_Entries;
<a name="l00283"></a>00283 TInputPixel m_RankValue;
<a name="l00284"></a>00284 TInputPixel m_InitVal;
<a name="l00285"></a>00285 TCompare m_Compare;
<a name="l00286"></a>00286 <span class="keywordtype">bool</span> m_Initialized;
<a name="l00287"></a>00287 <span class="comment">// This iterator will point at the desired rank value</span>
<a name="l00288"></a>00288 <span class="keyword">typename</span> MapType::iterator m_RankIt;
<a name="l00289"></a>00289
<a name="l00290"></a>00290 };
<a name="l00291"></a>00291
<a name="l00292"></a>00292 <span class="keyword">template</span> <<span class="keyword">class</span> TInputPixel, <span class="keyword">class</span> TCompare>
<a name="l00293"></a><a class="code" href="classitk_1_1MaskedRankHistogramVec.html">00293</a> <span class="keyword">class </span><a class="code" href="classitk_1_1MaskedRankHistogramVec.html">MaskedRankHistogramVec</a> : <span class="keyword">public</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html">MaskedRankHistogram</a><TInputPixel>
<a name="l00294"></a>00294 {
<a name="l00295"></a>00295 <span class="keyword">public</span>:
<a name="l00296"></a>00296
<a name="l00297"></a><a class="code" href="classitk_1_1MaskedRankHistogramVec.html#3123d8785c09d0f83e8b908bb8ae1f12">00297</a> <span class="keyword">typedef</span> <a class="code" href="classitk_1_1MaskedRankHistogram.html">MaskedRankHistogram<TInputPixel></a> <a class="code" href="classitk_1_1MaskedRankHistogram.html">Superclass</a>;
<a name="l00298"></a>00298
<a name="l00299"></a>00299 <span class="keyword">public</span>:
<a name="l00300"></a>00300
<a name="l00301"></a><a class="code" href="classitk_1_1MaskedRankHistogramVec.html#a28533b49fb2c6bd15616cfc38f9c45c">00301</a> <a class="code" href="classitk_1_1MaskedRankHistogramVec.html#a28533b49fb2c6bd15616cfc38f9c45c">MaskedRankHistogramVec</a>()
<a name="l00302"></a>00302 {
<a name="l00303"></a>00303 m_Size = <span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">></span>( NumericTraits< TInputPixel >::max() -
<a name="l00304"></a>00304 NumericTraits< TInputPixel >::NonpositiveMin() + 1 );
<a name="l00305"></a>00305 m_Vec.resize(m_Size, 0 );
<a name="l00306"></a>00306 <span class="keywordflow">if</span>( m_Compare( NumericTraits< TInputPixel >::max(),
<a name="l00307"></a>00307 NumericTraits< TInputPixel >::NonpositiveMin() ) )
<a name="l00308"></a>00308 {
<a name="l00309"></a>00309 m_InitVal = NumericTraits< TInputPixel >::NonpositiveMin();
<a name="l00310"></a>00310 }
<a name="l00311"></a>00311 <span class="keywordflow">else</span>
<a name="l00312"></a>00312 {
<a name="l00313"></a>00313 m_InitVal = NumericTraits< TInputPixel >::max();
<a name="l00314"></a>00314 }
<a name="l00315"></a>00315 m_Entries = m_Below = 0;
<a name="l00316"></a>00316 m_RankValue = m_InitVal - NumericTraits< TInputPixel >::NonpositiveMin();
<a name="l00317"></a>00317 }
<a name="l00318"></a>00318
<a name="l00319"></a><a class="code" href="classitk_1_1MaskedRankHistogramVec.html#6514228931c70b029bd4bd7e8169aaa1">00319</a> <a class="code" href="classitk_1_1MaskedRankHistogramVec.html#a28533b49fb2c6bd15616cfc38f9c45c">MaskedRankHistogramVec</a>(<span class="keywordtype">bool</span> NoInit)
<a name="l00320"></a>00320 {
<a name="l00321"></a>00321 m_Size = <span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">></span>( NumericTraits< TInputPixel >::max() -
<a name="l00322"></a>00322 NumericTraits< TInputPixel >::NonpositiveMin() + 1 );
<a name="l00323"></a>00323 <span class="keywordflow">if</span> (!NoInit) m_Vec.resize(m_Size, 0 );
<a name="l00324"></a>00324 <span class="keywordflow">if</span>( m_Compare( NumericTraits< TInputPixel >::max(),
<a name="l00325"></a>00325 NumericTraits< TInputPixel >::NonpositiveMin() ) )
<a name="l00326"></a>00326 {
<a name="l00327"></a>00327 m_InitVal = NumericTraits< TInputPixel >::NonpositiveMin();
<a name="l00328"></a>00328 }
<a name="l00329"></a>00329 <span class="keywordflow">else</span>
<a name="l00330"></a>00330 {
<a name="l00331"></a>00331 m_InitVal = NumericTraits< TInputPixel >::max();
<a name="l00332"></a>00332 }
<a name="l00333"></a>00333 m_Entries = m_Below = 0;
<a name="l00334"></a>00334 m_RankValue = m_InitVal - NumericTraits< TInputPixel >::NonpositiveMin();
<a name="l00335"></a>00335 }
<a name="l00336"></a>00336
<a name="l00337"></a>00337
<a name="l00338"></a><a class="code" href="classitk_1_1MaskedRankHistogramVec.html#b01754327aaf3453d90ff2fda9cf8f9e">00338</a> <a class="code" href="classitk_1_1MaskedRankHistogramVec.html#b01754327aaf3453d90ff2fda9cf8f9e">~MaskedRankHistogramVec</a>()
<a name="l00339"></a>00339 {
<a name="l00340"></a>00340 }
<a name="l00341"></a>00341
<a name="l00342"></a><a class="code" href="classitk_1_1MaskedRankHistogramVec.html#1448de761f042997364bcbae13e680d5">00342</a> <a class="code" href="classitk_1_1MaskedRankHistogram.html">Superclass</a> * <a class="code" href="classitk_1_1MaskedRankHistogramVec.html#1448de761f042997364bcbae13e680d5">Clone</a>()<span class="keyword"> const</span>
<a name="l00343"></a>00343 <span class="keyword"> </span>{
<a name="l00344"></a>00344 <a class="code" href="classitk_1_1MaskedRankHistogramVec.html">MaskedRankHistogramVec</a> *result = <span class="keyword">new</span> <a class="code" href="classitk_1_1MaskedRankHistogramVec.html#a28533b49fb2c6bd15616cfc38f9c45c">MaskedRankHistogramVec</a>(<span class="keyword">true</span>);
<a name="l00345"></a>00345 result->m_Vec = this->m_Vec;
<a name="l00346"></a>00346 result->m_Size = this->m_Size;
<a name="l00347"></a>00347 <span class="comment">//result->m_CurrentValue = this->m_CurrentValue;</span>
<a name="l00348"></a>00348 result->m_InitVal = this->m_InitVal;
<a name="l00349"></a>00349 result->m_Entries = this->m_Entries;
<a name="l00350"></a>00350 result->m_Below = this->m_Below;
<a name="l00351"></a>00351 result-><a class="code" href="classitk_1_1MaskedRankHistogram.html#d1c0acf54931551655177732e4ba853f">m_Rank</a> = this-><a class="code" href="classitk_1_1MaskedRankHistogram.html#d1c0acf54931551655177732e4ba853f">m_Rank</a>;
<a name="l00352"></a>00352 result->m_RankValue = this->m_RankValue;
<a name="l00353"></a>00353 <span class="keywordflow">return</span>(result);
<a name="l00354"></a>00354 }
<a name="l00355"></a>00355
<a name="l00356"></a><a class="code" href="classitk_1_1MaskedRankHistogramVec.html#99549287abee7c02c34c49197e31542a">00356</a> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classitk_1_1MaskedRankHistogramVec.html#99549287abee7c02c34c49197e31542a">IsValid</a>()
<a name="l00357"></a>00357 {
<a name="l00358"></a>00358 <span class="keywordflow">return</span> m_Entries > 0;
<a name="l00359"></a>00359 }
<a name="l00360"></a>00360
<a name="l00361"></a>00361
<a name="l00362"></a><a class="code" href="classitk_1_1MaskedRankHistogramVec.html#92d0473bc2689a6f53bc1d219ed89f14">00362</a> TInputPixel <a class="code" href="classitk_1_1MaskedRankHistogramVec.html#92d0473bc2689a6f53bc1d219ed89f14">GetValue</a>( <span class="keyword">const</span> TInputPixel & )
<a name="l00363"></a>00363 {
<a name="l00364"></a>00364 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> target = (int)(this-><a class="code" href="classitk_1_1MaskedRankHistogram.html#d1c0acf54931551655177732e4ba853f">m_Rank</a> * (m_Entries-1)) + 1;
<a name="l00365"></a>00365 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> total = m_Below;
<a name="l00366"></a>00366 <span class="keywordtype">long</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pos = (<span class="keywordtype">long</span> <span class="keywordtype">unsigned</span> int)(m_RankValue - NumericTraits< TInputPixel >::NonpositiveMin());
<a name="l00367"></a>00367
<a name="l00368"></a>00368 <span class="keywordflow">if</span> (total < target)
<a name="l00369"></a>00369 {
<a name="l00370"></a>00370 <span class="keywordflow">while</span> (pos < m_Size)
<a name="l00371"></a>00371 {
<a name="l00372"></a>00372 ++pos;
<a name="l00373"></a>00373 total += m_Vec[pos];
<a name="l00374"></a>00374 <span class="keywordflow">if</span> (total >= target)
<a name="l00375"></a>00375 <span class="keywordflow">break</span>;
<a name="l00376"></a>00376 }
<a name="l00377"></a>00377 }
<a name="l00378"></a>00378 <span class="keywordflow">else</span>
<a name="l00379"></a>00379 {
<a name="l00380"></a>00380 <span class="keywordflow">while</span>(pos > 0)
<a name="l00381"></a>00381 {
<a name="l00382"></a>00382 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> tbelow = total - m_Vec[pos];
<a name="l00383"></a>00383 <span class="keywordflow">if</span> (tbelow < target) <span class="comment">// we've overshot</span>
<a name="l00384"></a>00384 <span class="keywordflow">break</span>;
<a name="l00385"></a>00385 total = tbelow;
<a name="l00386"></a>00386 --pos;
<a name="l00387"></a>00387 }
<a name="l00388"></a>00388 }
<a name="l00389"></a>00389
<a name="l00390"></a>00390 m_RankValue = (TInputPixel)(pos + NumericTraits< TInputPixel >::NonpositiveMin());
<a name="l00391"></a>00391 m_Below = total;
<a name="l00392"></a>00392 <span class="keywordflow">return</span>(m_RankValue);
<a name="l00393"></a>00393 }
<a name="l00394"></a>00394
<a name="l00395"></a><a class="code" href="classitk_1_1MaskedRankHistogramVec.html#f16ee7553457b1a6683cba16aa793ee6">00395</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogramVec.html#f16ee7553457b1a6683cba16aa793ee6">Reset</a>()
<a name="l00396"></a>00396 {
<a name="l00397"></a>00397 std::fill(&(m_Vec[0]), &(m_Vec[m_Size-1]),0);
<a name="l00398"></a>00398 m_RankValue = m_InitVal;
<a name="l00399"></a>00399 m_Entries = m_Below = 0;
<a name="l00400"></a>00400 }
<a name="l00401"></a>00401
<a name="l00402"></a><a class="code" href="classitk_1_1MaskedRankHistogramVec.html#c007823cca360c23e17a3fb978d185cf">00402</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogramVec.html#c007823cca360c23e17a3fb978d185cf">AddPixel</a>(<span class="keyword">const</span> TInputPixel &p)
<a name="l00403"></a>00403 {
<a name="l00404"></a>00404 <span class="keywordtype">long</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx = (<span class="keywordtype">long</span> <span class="keywordtype">unsigned</span> int)(p - NumericTraits< TInputPixel >::NonpositiveMin());
<a name="l00405"></a>00405 m_Vec[ idx ]++;
<a name="l00406"></a>00406 <span class="keywordflow">if</span> (m_Compare(p, m_RankValue) || p == m_RankValue)
<a name="l00407"></a>00407 {
<a name="l00408"></a>00408 ++m_Below;
<a name="l00409"></a>00409 }
<a name="l00410"></a>00410 ++m_Entries;
<a name="l00411"></a>00411 }
<a name="l00412"></a>00412
<a name="l00413"></a><a class="code" href="classitk_1_1MaskedRankHistogramVec.html#4dfddcfbff502df0c0bd9c5b363de621">00413</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1MaskedRankHistogramVec.html#4dfddcfbff502df0c0bd9c5b363de621">RemovePixel</a>(<span class="keyword">const</span> TInputPixel &p)
<a name="l00414"></a>00414 {
<a name="l00415"></a>00415 assert(p - NumericTraits< TInputPixel >::NonpositiveMin() >= 0);
<a name="l00416"></a>00416 assert(p - NumericTraits< TInputPixel >::NonpositiveMin() < (<span class="keywordtype">int</span>)m_Vec.size());
<a name="l00417"></a>00417 assert(m_Entries >= 1);
<a name="l00418"></a>00418 m_Vec[ (<span class="keywordtype">long</span> <span class="keywordtype">unsigned</span> int)(p - NumericTraits< TInputPixel >::NonpositiveMin()) ]--;
<a name="l00419"></a>00419 --m_Entries;
<a name="l00420"></a>00420
<a name="l00421"></a>00421 <span class="keywordflow">if</span> (m_Compare(p, m_RankValue) || p == m_RankValue)
<a name="l00422"></a>00422 {
<a name="l00423"></a>00423 --m_Below;
<a name="l00424"></a>00424 }
<a name="l00425"></a>00425 }
<a name="l00426"></a>00426
<a name="l00427"></a>00427 <span class="keyword">private</span>:
<a name="l00428"></a>00428 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::vector<unsigned long> VecType;
<a name="l00429"></a>00429
<a name="l00430"></a>00430 VecType m_Vec;
<a name="l00431"></a>00431 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m_Size;
<a name="l00432"></a>00432 TCompare m_Compare;
<a name="l00433"></a>00433 TInputPixel m_RankValue;
<a name="l00434"></a>00434 TInputPixel m_InitVal;
<a name="l00435"></a>00435 <span class="keywordtype">int</span> m_Below;
<a name="l00436"></a>00436 <span class="keywordtype">int</span> m_Entries;
<a name="l00437"></a>00437 };
<a name="l00438"></a>00438
<a name="l00439"></a>00439 } <span class="comment">// end namespace itk</span>
<a name="l00440"></a>00440 <span class="preprocessor">#endif</span>
<a name="l00441"></a>00441 <span class="preprocessor"></span>
</pre></div></div>
<hr><address><small>
Generated at Thu May 7 23:27:02 2009 for ITK by <a href="http://www.stack.nl/~dimitri/doxygen/index.html"> <img
src="http://www.stack.nl/~dimitri/doxygen/doxygen.png" alt="doxygen"
align="middle" border=0 width=110 height=53>
</a> 1.5.9 written by <a href="mailto:dimitri@stack.nl">Dimitri van Heesch</a>,
© 1997-2000</small></address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
d5e74628f0e673bb8680aebce32b2c04
>
files
>
16417
