<!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: itkRankHistogram.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>itkRankHistogram.h</h1><a href="itkRankHistogram_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: itkRankHistogram.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-10-04 12:43:20 $</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 __itkRankHistogram_h</span>
<a name="l00020"></a>00020 <span class="preprocessor"></span><span class="preprocessor">#define __itkRankHistogram_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="preprocessor">#include <sstream></span>
<a name="l00034"></a>00034
<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_1RankHistogram.html">00036</a> <span class="keyword">class </span><a class="code" href="classitk_1_1RankHistogram.html">RankHistogram</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_1RankHistogram.html#f11dda020035bb80d324012a1b4c6940">00039</a> <a class="code" href="classitk_1_1RankHistogram.html#f11dda020035bb80d324012a1b4c6940">RankHistogram</a>()
<a name="l00040"></a>00040 {
<a name="l00041"></a>00041 <a class="code" href="classitk_1_1RankHistogram.html#84a0518c078754df6b850a1c1c1159ea">m_Rank</a> = 0.5;
<a name="l00042"></a>00042 }
<a name="l00043"></a><a class="code" href="classitk_1_1RankHistogram.html#50c02123f29a6b890143534616f114c0">00043</a> <span class="keyword">virtual</span> <a class="code" href="classitk_1_1RankHistogram.html#50c02123f29a6b890143534616f114c0">~RankHistogram</a>(){}
<a name="l00044"></a>00044
<a name="l00045"></a><a class="code" href="classitk_1_1RankHistogram.html#9f934deb0e054984b2610e112797f9d4">00045</a> <span class="keyword">virtual</span> <a class="code" href="classitk_1_1RankHistogram.html">RankHistogram</a> * <a class="code" href="classitk_1_1RankHistogram.html#9f934deb0e054984b2610e112797f9d4">Clone</a>()<span class="keyword"> const </span>
<a name="l00046"></a>00046 <span class="keyword"> </span>{
<a name="l00047"></a>00047 <span class="keywordflow">return</span> 0;
<a name="l00048"></a>00048 }
<a name="l00049"></a>00049
<a name="l00050"></a><a class="code" href="classitk_1_1RankHistogram.html#0de7ca76e64d15d76912d1a15838bb7f">00050</a> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1RankHistogram.html#0de7ca76e64d15d76912d1a15838bb7f">AddPixel</a>(<span class="keyword">const</span> TInputPixel &<a class="code" href="itkMacro_8h.html#6be3b439282da7a34278c0594589b972">itkNotUsed</a>(p)){}
<a name="l00051"></a>00051
<a name="l00052"></a><a class="code" href="classitk_1_1RankHistogram.html#b0bbb3caee87f2cbdc021c4bb1a08550">00052</a> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1RankHistogram.html#b0bbb3caee87f2cbdc021c4bb1a08550">RemovePixel</a>(<span class="keyword">const</span> TInputPixel &<a class="code" href="itkMacro_8h.html#6be3b439282da7a34278c0594589b972">itkNotUsed</a>(p)){}
<a name="l00053"></a>00053
<a name="l00054"></a><a class="code" href="classitk_1_1RankHistogram.html#0d2e86dbbe938135ae31591433945e53">00054</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1RankHistogram.html#0d2e86dbbe938135ae31591433945e53">AddBoundary</a>(){}
<a name="l00055"></a>00055
<a name="l00056"></a><a class="code" href="classitk_1_1RankHistogram.html#0d5e0dc50c160324cf9784a2cc1175dc">00056</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1RankHistogram.html#0d5e0dc50c160324cf9784a2cc1175dc">RemoveBoundary</a>(){}
<a name="l00057"></a>00057
<a name="l00058"></a><a class="code" href="classitk_1_1RankHistogram.html#dceddbde919832f553b453bd86a7fe2a">00058</a> <span class="keyword">virtual</span> TInputPixel <a class="code" href="classitk_1_1RankHistogram.html#dceddbde919832f553b453bd86a7fe2a">GetValue</a>( <span class="keyword">const</span> TInputPixel & ){<span class="keywordflow">return</span> 0;}
<a name="l00059"></a>00059
<a name="l00060"></a><a class="code" href="classitk_1_1RankHistogram.html#e5e868c122e4ac7f97bd5aafccae22a4">00060</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1RankHistogram.html#e5e868c122e4ac7f97bd5aafccae22a4">SetRank</a>(<span class="keywordtype">float</span> rank)
<a name="l00061"></a>00061 {
<a name="l00062"></a>00062 <a class="code" href="classitk_1_1RankHistogram.html#84a0518c078754df6b850a1c1c1159ea">m_Rank</a> = rank;
<a name="l00063"></a>00063 }
<a name="l00064"></a>00064
<a name="l00065"></a>00065 <span class="keyword">protected</span>:
<a name="l00066"></a><a class="code" href="classitk_1_1RankHistogram.html#84a0518c078754df6b850a1c1c1159ea">00066</a> <span class="keywordtype">float</span> <a class="code" href="classitk_1_1RankHistogram.html#84a0518c078754df6b850a1c1c1159ea">m_Rank</a>;
<a name="l00067"></a>00067 };
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="keyword">template</span> <<span class="keyword">class</span> TInputPixel, <span class="keyword">class</span> TCompare>
<a name="l00070"></a><a class="code" href="classitk_1_1RankHistogramMap.html">00070</a> <span class="keyword">class </span><a class="code" href="classitk_1_1RankHistogramMap.html">RankHistogramMap</a> : <span class="keyword">public</span> <a class="code" href="classitk_1_1RankHistogram.html">RankHistogram</a><TInputPixel>
<a name="l00071"></a>00071 {
<a name="l00072"></a>00072 <span class="keyword">public</span>:
<a name="l00073"></a>00073
<a name="l00074"></a><a class="code" href="classitk_1_1RankHistogramMap.html#eb39a8f57790baf9b5a51ab5aa949d82">00074</a> <span class="keyword">typedef</span> <a class="code" href="classitk_1_1RankHistogram.html">RankHistogram<TInputPixel></a> <a class="code" href="classitk_1_1RankHistogram.html">Superclass</a>;
<a name="l00075"></a>00075
<a name="l00076"></a>00076 <span class="keyword">public</span>:
<a name="l00077"></a><a class="code" href="classitk_1_1RankHistogramMap.html#5fa7a09a686d1b0f260e770586e474ca">00077</a> <a class="code" href="classitk_1_1RankHistogramMap.html#5fa7a09a686d1b0f260e770586e474ca">RankHistogramMap</a>()
<a name="l00078"></a>00078 {
<a name="l00079"></a>00079 m_Below = m_Entries = 0;
<a name="l00080"></a>00080 <span class="comment">// can't set m_RankIt until something has been put in the histogram</span>
<a name="l00081"></a>00081 m_Initialized = <span class="keyword">false</span>;
<a name="l00082"></a>00082 <span class="keywordflow">if</span>( m_Compare( NumericTraits< TInputPixel >::max(),
<a name="l00083"></a>00083 NumericTraits< TInputPixel >::NonpositiveMin() ) )
<a name="l00084"></a>00084 {
<a name="l00085"></a>00085 m_InitVal = NumericTraits< TInputPixel >::NonpositiveMin();
<a name="l00086"></a>00086 }
<a name="l00087"></a>00087 <span class="keywordflow">else</span>
<a name="l00088"></a>00088 {
<a name="l00089"></a>00089 m_InitVal = NumericTraits< TInputPixel >::max();
<a name="l00090"></a>00090 }
<a name="l00091"></a>00091 m_RankValue = m_InitVal;
<a name="l00092"></a>00092 m_RankIt = m_Map.begin(); <span class="comment">// equivalent to setting to the intial value</span>
<a name="l00093"></a>00093 }
<a name="l00094"></a><a class="code" href="classitk_1_1RankHistogramMap.html#80e6a06b7537241bad2c61cdee4cfae0">00094</a> <a class="code" href="classitk_1_1RankHistogramMap.html#80e6a06b7537241bad2c61cdee4cfae0">~RankHistogramMap</a>()
<a name="l00095"></a>00095 {
<a name="l00096"></a>00096 }
<a name="l00097"></a>00097
<a name="l00098"></a><a class="code" href="classitk_1_1RankHistogramMap.html#c557940084247ba4e2cf9ce8f4bd85a0">00098</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1RankHistogramMap.html#c557940084247ba4e2cf9ce8f4bd85a0">AddPixel</a>(<span class="keyword">const</span> TInputPixel &p)
<a name="l00099"></a>00099 {
<a name="l00100"></a>00100 m_Map[ p ]++;
<a name="l00101"></a>00101 ++m_Entries;
<a name="l00102"></a>00102 <span class="keywordflow">if</span> (!m_Initialized)
<a name="l00103"></a>00103 {
<a name="l00104"></a>00104 m_Initialized = <span class="keyword">true</span>;
<a name="l00105"></a>00105 m_RankIt = m_Map.begin();
<a name="l00106"></a>00106 m_RankValue = p;
<a name="l00107"></a>00107 }
<a name="l00108"></a>00108 <span class="keywordflow">if</span> (m_Compare(p, m_RankValue) || p == m_RankValue)
<a name="l00109"></a>00109 {
<a name="l00110"></a>00110 ++m_Below;
<a name="l00111"></a>00111 }
<a name="l00112"></a>00112
<a name="l00113"></a>00113 }
<a name="l00114"></a>00114
<a name="l00115"></a><a class="code" href="classitk_1_1RankHistogramMap.html#bb5b7c025f3ac2b9a71b1ec99755a67c">00115</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1RankHistogramMap.html#bb5b7c025f3ac2b9a71b1ec99755a67c">RemovePixel</a>(<span class="keyword">const</span> TInputPixel &p)
<a name="l00116"></a>00116 {
<a name="l00117"></a>00117 m_Map[ p ]--;
<a name="l00118"></a>00118 <span class="keywordflow">if</span> (m_Compare(p, m_RankValue) || p == m_RankValue)
<a name="l00119"></a>00119 {
<a name="l00120"></a>00120 --m_Below;
<a name="l00121"></a>00121 }
<a name="l00122"></a>00122 --m_Entries;
<a name="l00123"></a>00123 }
<a name="l00124"></a>00124
<a name="l00125"></a><a class="code" href="classitk_1_1RankHistogramMap.html#c116029c1b7ab029fa6770e4c9ce1691">00125</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1RankHistogramMap.html#c116029c1b7ab029fa6770e4c9ce1691">Initialize</a>()
<a name="l00126"></a>00126 {
<a name="l00127"></a>00127 m_RankIt = m_Map.begin();
<a name="l00128"></a>00128 }
<a name="l00129"></a>00129
<a name="l00130"></a><a class="code" href="classitk_1_1RankHistogramMap.html#46c58a7954655406b1f3ebbc12aeb2fd">00130</a> TInputPixel <a class="code" href="classitk_1_1RankHistogramMap.html#46c58a7954655406b1f3ebbc12aeb2fd">GetValue</a>( <span class="keyword">const</span> TInputPixel & )
<a name="l00131"></a>00131 {
<a name="l00132"></a>00132 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> target = (int)(this-><a class="code" href="classitk_1_1RankHistogram.html#84a0518c078754df6b850a1c1c1159ea">m_Rank</a> * (m_Entries-1)) + 1;
<a name="l00133"></a>00133 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> total = m_Below;
<a name="l00134"></a>00134 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> ThisBin;
<a name="l00135"></a>00135 <span class="keywordtype">bool</span> eraseFlag = <span class="keyword">false</span>;
<a name="l00136"></a>00136
<a name="l00137"></a>00137 <span class="comment">// an assert is better than a log message in that case</span>
<a name="l00138"></a>00138 assert(m_Initialized);
<a name="l00139"></a>00139
<a name="l00140"></a>00140 <span class="keywordflow">if</span> (total < target)
<a name="l00141"></a>00141 {
<a name="l00142"></a>00142 <span class="keyword">typename</span> MapType::iterator searchIt = m_RankIt;
<a name="l00143"></a>00143 <span class="keyword">typename</span> MapType::iterator eraseIt;
<a name="l00144"></a>00144
<a name="l00145"></a>00145 <span class="keywordflow">while</span> (searchIt != m_Map.end())
<a name="l00146"></a>00146 {
<a name="l00147"></a>00147 <span class="comment">// cleaning up the map - probably a better way of organising</span>
<a name="l00148"></a>00148 <span class="comment">// the loop. Currently makes sure that the search iterator is</span>
<a name="l00149"></a>00149 <span class="comment">// incremented before deleting</span>
<a name="l00150"></a>00150 ++searchIt;
<a name="l00151"></a>00151 ThisBin = searchIt->second;
<a name="l00152"></a>00152 total += ThisBin;
<a name="l00153"></a>00153 <span class="keywordflow">if</span> (eraseFlag)
<a name="l00154"></a>00154 {
<a name="l00155"></a>00155 m_Map.erase(eraseIt);
<a name="l00156"></a>00156 eraseFlag = <span class="keyword">false</span>;
<a name="l00157"></a>00157 }
<a name="l00158"></a>00158 <span class="keywordflow">if</span> (ThisBin <= 0)
<a name="l00159"></a>00159 {
<a name="l00160"></a>00160 eraseFlag = <span class="keyword">true</span>;
<a name="l00161"></a>00161 eraseIt = searchIt;
<a name="l00162"></a>00162 }
<a name="l00163"></a>00163 <span class="keywordflow">if</span> (total >= target)
<a name="l00164"></a>00164 <span class="keywordflow">break</span>;
<a name="l00165"></a>00165 }
<a name="l00166"></a>00166 m_RankValue = searchIt->first;
<a name="l00167"></a>00167 m_RankIt = searchIt;
<a name="l00168"></a>00168 }
<a name="l00169"></a>00169 <span class="keywordflow">else</span>
<a name="l00170"></a>00170 {
<a name="l00171"></a>00171 <span class="keyword">typename</span> MapType::iterator searchIt = m_RankIt;
<a name="l00172"></a>00172 <span class="keyword">typename</span> MapType::iterator eraseIt;
<a name="l00173"></a>00173
<a name="l00174"></a>00174 <span class="keywordflow">while</span>(searchIt != m_Map.begin())
<a name="l00175"></a>00175 {
<a name="l00176"></a>00176 ThisBin = searchIt->second;
<a name="l00177"></a>00177 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> tbelow = total - ThisBin;
<a name="l00178"></a>00178 <span class="keywordflow">if</span> (tbelow < target) <span class="comment">// we've overshot</span>
<a name="l00179"></a>00179 <span class="keywordflow">break</span>;
<a name="l00180"></a>00180 <span class="keywordflow">if</span> (eraseFlag)
<a name="l00181"></a>00181 {
<a name="l00182"></a>00182 m_Map.erase(eraseIt);
<a name="l00183"></a>00183 eraseFlag = <span class="keyword">false</span>;
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185 <span class="keywordflow">if</span> (ThisBin <= 0)
<a name="l00186"></a>00186 {
<a name="l00187"></a>00187 eraseIt = searchIt;
<a name="l00188"></a>00188 eraseFlag = <span class="keyword">true</span>;
<a name="l00189"></a>00189 }
<a name="l00190"></a>00190 total = tbelow;
<a name="l00191"></a>00191 <span class="comment">// std::cout << searchIt->first << std::endl;</span>
<a name="l00192"></a>00192
<a name="l00193"></a>00193 --searchIt;
<a name="l00194"></a>00194 }
<a name="l00195"></a>00195 m_RankValue = searchIt->first;
<a name="l00196"></a>00196 m_RankIt = searchIt;
<a name="l00197"></a>00197 }
<a name="l00198"></a>00198
<a name="l00199"></a>00199 m_Below = total;
<a name="l00200"></a>00200
<a name="l00201"></a>00201 <span class="keywordflow">return</span>(m_RankValue);
<a name="l00202"></a>00202
<a name="l00203"></a>00203 }
<a name="l00204"></a>00204
<a name="l00205"></a><a class="code" href="classitk_1_1RankHistogramMap.html#ed77e091a3b4a93091d7b490bd34b15d">00205</a> <a class="code" href="classitk_1_1RankHistogram.html">Superclass</a> * <a class="code" href="classitk_1_1RankHistogramMap.html#ed77e091a3b4a93091d7b490bd34b15d">Clone</a>()<span class="keyword"> const</span>
<a name="l00206"></a>00206 <span class="keyword"> </span>{
<a name="l00207"></a>00207 <a class="code" href="classitk_1_1RankHistogramMap.html">RankHistogramMap</a> *result = <span class="keyword">new</span> <a class="code" href="classitk_1_1RankHistogramMap.html#5fa7a09a686d1b0f260e770586e474ca">RankHistogramMap</a>();
<a name="l00208"></a>00208 result->m_Map = this->m_Map;
<a name="l00209"></a>00209 result-><a class="code" href="classitk_1_1RankHistogram.html#84a0518c078754df6b850a1c1c1159ea">m_Rank</a> = this-><a class="code" href="classitk_1_1RankHistogram.html#84a0518c078754df6b850a1c1c1159ea">m_Rank</a>;
<a name="l00210"></a>00210 result->m_Below = this->m_Below;
<a name="l00211"></a>00211 result->m_Entries = this->m_Entries;
<a name="l00212"></a>00212 result->m_InitVal = this->m_InitVal;
<a name="l00213"></a>00213 result->m_RankValue = this->m_RankValue;
<a name="l00214"></a>00214 result->m_Initialized = this->m_Initialized;
<a name="l00215"></a>00215 <span class="keywordflow">if</span> (result->m_Initialized)
<a name="l00216"></a>00216 result->m_RankIt = result->m_Map.find(this->m_RankValue);
<a name="l00217"></a>00217 <span class="keywordflow">return</span>(result);
<a name="l00218"></a>00218 }
<a name="l00219"></a>00219
<a name="l00220"></a>00220 <span class="keyword">private</span>:
<a name="l00221"></a>00221 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::map< TInputPixel, unsigned long, TCompare > MapType;
<a name="l00222"></a>00222
<a name="l00223"></a>00223 MapType m_Map;
<a name="l00224"></a>00224 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> m_Below;
<a name="l00225"></a>00225 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> m_Entries;
<a name="l00226"></a>00226 TInputPixel m_RankValue;
<a name="l00227"></a>00227 TInputPixel m_InitVal;
<a name="l00228"></a>00228 TCompare m_Compare;
<a name="l00229"></a>00229 <span class="keywordtype">bool</span> m_Initialized;
<a name="l00230"></a>00230 <span class="comment">// This iterator will point at the desired rank value</span>
<a name="l00231"></a>00231 <span class="keyword">typename</span> MapType::iterator m_RankIt;
<a name="l00232"></a>00232 };
<a name="l00233"></a>00233
<a name="l00234"></a>00234 <span class="keyword">template</span> <<span class="keyword">class</span> TInputPixel, <span class="keyword">class</span> TCompare>
<a name="l00235"></a><a class="code" href="classitk_1_1RankHistogramVec.html">00235</a> <span class="keyword">class </span><a class="code" href="classitk_1_1RankHistogramVec.html">RankHistogramVec</a> : <span class="keyword">public</span> <a class="code" href="classitk_1_1RankHistogram.html">RankHistogram</a><TInputPixel>
<a name="l00236"></a>00236 {
<a name="l00237"></a>00237 <span class="keyword">public</span>:
<a name="l00238"></a><a class="code" href="classitk_1_1RankHistogramVec.html#4560498ec5f4f87fd7edd3c766363097">00238</a> <span class="keyword">typedef</span> <a class="code" href="classitk_1_1RankHistogram.html">RankHistogram<TInputPixel></a> <a class="code" href="classitk_1_1RankHistogram.html">Superclass</a>;
<a name="l00239"></a>00239
<a name="l00240"></a>00240 <span class="keyword">public</span>:
<a name="l00241"></a><a class="code" href="classitk_1_1RankHistogramVec.html#3dbc4d7899652cb513a60400597965a1">00241</a> <a class="code" href="classitk_1_1RankHistogramVec.html#3dbc4d7899652cb513a60400597965a1">RankHistogramVec</a>()
<a name="l00242"></a>00242 {
<a name="l00243"></a>00243 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="l00244"></a>00244 NumericTraits< TInputPixel >::NonpositiveMin() + 1 );
<a name="l00245"></a>00245 m_Vec.resize(m_Size, 0 );
<a name="l00246"></a>00246 <span class="keywordflow">if</span>( m_Compare( NumericTraits< TInputPixel >::max(),
<a name="l00247"></a>00247 NumericTraits< TInputPixel >::NonpositiveMin() ) )
<a name="l00248"></a>00248 {
<a name="l00249"></a>00249 m_InitVal = NumericTraits< TInputPixel >::NonpositiveMin();
<a name="l00250"></a>00250 }
<a name="l00251"></a>00251 <span class="keywordflow">else</span>
<a name="l00252"></a>00252 {
<a name="l00253"></a>00253 m_InitVal = NumericTraits< TInputPixel >::max();
<a name="l00254"></a>00254 }
<a name="l00255"></a>00255 m_Entries = m_Below = 0;
<a name="l00256"></a>00256 m_RankValue = m_InitVal - NumericTraits< TInputPixel >::NonpositiveMin();
<a name="l00257"></a>00257 }
<a name="l00258"></a>00258
<a name="l00259"></a><a class="code" href="classitk_1_1RankHistogramVec.html#dbffa40e21a101c8777fc87f5adf9df8">00259</a> <a class="code" href="classitk_1_1RankHistogramVec.html#3dbc4d7899652cb513a60400597965a1">RankHistogramVec</a>(<span class="keywordtype">bool</span> NoInit)
<a name="l00260"></a>00260 {
<a name="l00261"></a>00261 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="l00262"></a>00262 NumericTraits< TInputPixel >::NonpositiveMin() + 1 );
<a name="l00263"></a>00263 <span class="keywordflow">if</span> (!NoInit) m_Vec.resize(m_Size, 0 );
<a name="l00264"></a>00264 <span class="keywordflow">if</span>( m_Compare( NumericTraits< TInputPixel >::max(),
<a name="l00265"></a>00265 NumericTraits< TInputPixel >::NonpositiveMin() ) )
<a name="l00266"></a>00266 {
<a name="l00267"></a>00267 m_InitVal = NumericTraits< TInputPixel >::NonpositiveMin();
<a name="l00268"></a>00268 }
<a name="l00269"></a>00269 <span class="keywordflow">else</span>
<a name="l00270"></a>00270 {
<a name="l00271"></a>00271 m_InitVal = NumericTraits< TInputPixel >::max();
<a name="l00272"></a>00272 }
<a name="l00273"></a>00273 m_Entries = m_Below = 0;
<a name="l00274"></a>00274 m_RankValue = m_InitVal - NumericTraits< TInputPixel >::NonpositiveMin();
<a name="l00275"></a>00275 }
<a name="l00276"></a>00276
<a name="l00277"></a>00277
<a name="l00278"></a><a class="code" href="classitk_1_1RankHistogramVec.html#a3ffb1ef80ad9b00302c4b3ab5082d69">00278</a> <a class="code" href="classitk_1_1RankHistogramVec.html#a3ffb1ef80ad9b00302c4b3ab5082d69">~RankHistogramVec</a>()
<a name="l00279"></a>00279 {
<a name="l00280"></a>00280 }
<a name="l00281"></a>00281
<a name="l00282"></a><a class="code" href="classitk_1_1RankHistogramVec.html#cf29e2c5dfeb5d876cbea9155ef31e54">00282</a> TInputPixel <a class="code" href="classitk_1_1RankHistogramVec.html#cf29e2c5dfeb5d876cbea9155ef31e54">GetValue</a>( <span class="keyword">const</span> TInputPixel & )
<a name="l00283"></a>00283 {
<a name="l00284"></a>00284 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> target = (int)(this-><a class="code" href="classitk_1_1RankHistogram.html#84a0518c078754df6b850a1c1c1159ea">m_Rank</a> * (m_Entries-1)) + 1;
<a name="l00285"></a>00285 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> total = m_Below;
<a name="l00286"></a>00286 <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="l00287"></a>00287
<a name="l00288"></a>00288 <span class="keywordflow">if</span> (total < target)
<a name="l00289"></a>00289 {
<a name="l00290"></a>00290 <span class="keywordflow">while</span> (pos < m_Size)
<a name="l00291"></a>00291 {
<a name="l00292"></a>00292 ++pos;
<a name="l00293"></a>00293 total += m_Vec[pos];
<a name="l00294"></a>00294 <span class="keywordflow">if</span> (total >= target)
<a name="l00295"></a>00295 <span class="keywordflow">break</span>;
<a name="l00296"></a>00296 }
<a name="l00297"></a>00297 }
<a name="l00298"></a>00298 <span class="keywordflow">else</span>
<a name="l00299"></a>00299 {
<a name="l00300"></a>00300 <span class="keywordflow">while</span>(pos > 0)
<a name="l00301"></a>00301 {
<a name="l00302"></a>00302 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> tbelow = total - m_Vec[pos];
<a name="l00303"></a>00303 <span class="keywordflow">if</span> (tbelow < target) <span class="comment">// we've overshot</span>
<a name="l00304"></a>00304 <span class="keywordflow">break</span>;
<a name="l00305"></a>00305 total = tbelow;
<a name="l00306"></a>00306 --pos;
<a name="l00307"></a>00307 }
<a name="l00308"></a>00308 }
<a name="l00309"></a>00309
<a name="l00310"></a>00310 m_RankValue = (TInputPixel)(pos + NumericTraits< TInputPixel >::NonpositiveMin());
<a name="l00311"></a>00311 m_Below = total;
<a name="l00312"></a>00312 <span class="keywordflow">return</span>(m_RankValue);
<a name="l00313"></a>00313 }
<a name="l00314"></a>00314
<a name="l00315"></a><a class="code" href="classitk_1_1RankHistogramVec.html#242751a3dac72c5cf7110c7a5d2098fd">00315</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1RankHistogramVec.html#242751a3dac72c5cf7110c7a5d2098fd">AddPixel</a>(<span class="keyword">const</span> TInputPixel &p)
<a name="l00316"></a>00316 {
<a name="l00317"></a>00317 <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="l00318"></a>00318 m_Vec[ idx ]++;
<a name="l00319"></a>00319 <span class="keywordflow">if</span> (m_Compare(p, m_RankValue) || p == m_RankValue)
<a name="l00320"></a>00320 {
<a name="l00321"></a>00321 ++m_Below;
<a name="l00322"></a>00322 }
<a name="l00323"></a>00323 ++m_Entries;
<a name="l00324"></a>00324 }
<a name="l00325"></a>00325
<a name="l00326"></a><a class="code" href="classitk_1_1RankHistogramVec.html#713ec9a02050b5d4321cec9d6e07cc0a">00326</a> <span class="keywordtype">void</span> <a class="code" href="classitk_1_1RankHistogramVec.html#713ec9a02050b5d4321cec9d6e07cc0a">RemovePixel</a>(<span class="keyword">const</span> TInputPixel &p)
<a name="l00327"></a>00327 {
<a name="l00328"></a>00328 assert(p - NumericTraits< TInputPixel >::NonpositiveMin() >= 0);
<a name="l00329"></a>00329 assert(p - NumericTraits< TInputPixel >::NonpositiveMin() < (<span class="keywordtype">int</span>)m_Vec.size());
<a name="l00330"></a>00330 assert(m_Entries >= 1);
<a name="l00331"></a>00331 m_Vec[ (<span class="keywordtype">long</span> <span class="keywordtype">unsigned</span> int)(p - NumericTraits< TInputPixel >::NonpositiveMin()) ]--;
<a name="l00332"></a>00332 --m_Entries;
<a name="l00333"></a>00333
<a name="l00334"></a>00334 <span class="keywordflow">if</span> (m_Compare(p, m_RankValue) || p == m_RankValue)
<a name="l00335"></a>00335 {
<a name="l00336"></a>00336 --m_Below;
<a name="l00337"></a>00337 }
<a name="l00338"></a>00338 }
<a name="l00339"></a>00339
<a name="l00340"></a><a class="code" href="classitk_1_1RankHistogramVec.html#ba25d1e8f0f0c7ccc2caa5c322371112">00340</a> <a class="code" href="classitk_1_1RankHistogram.html">Superclass</a> * <a class="code" href="classitk_1_1RankHistogramVec.html#ba25d1e8f0f0c7ccc2caa5c322371112">Clone</a>()<span class="keyword"> const</span>
<a name="l00341"></a>00341 <span class="keyword"> </span>{
<a name="l00342"></a>00342 <a class="code" href="classitk_1_1RankHistogramVec.html">RankHistogramVec</a> *result = <span class="keyword">new</span> <a class="code" href="classitk_1_1RankHistogramVec.html#3dbc4d7899652cb513a60400597965a1">RankHistogramVec</a>(<span class="keyword">true</span>);
<a name="l00343"></a>00343 result->m_Vec = this->m_Vec;
<a name="l00344"></a>00344 result->m_Size = this->m_Size;
<a name="l00345"></a>00345 <span class="comment">//result->m_CurrentValue = this->m_CurrentValue;</span>
<a name="l00346"></a>00346 result->m_InitVal = this->m_InitVal;
<a name="l00347"></a>00347 result->m_Entries = this->m_Entries;
<a name="l00348"></a>00348 result->m_Below = this->m_Below;
<a name="l00349"></a>00349 result-><a class="code" href="classitk_1_1RankHistogram.html#84a0518c078754df6b850a1c1c1159ea">m_Rank</a> = this-><a class="code" href="classitk_1_1RankHistogram.html#84a0518c078754df6b850a1c1c1159ea">m_Rank</a>;
<a name="l00350"></a>00350 result->m_RankValue = this->m_RankValue;
<a name="l00351"></a>00351 <span class="keywordflow">return</span>(result);
<a name="l00352"></a>00352 }
<a name="l00353"></a>00353
<a name="l00354"></a>00354 <span class="keyword">private</span>:
<a name="l00355"></a>00355 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::vector<unsigned long> VecType;
<a name="l00356"></a>00356
<a name="l00357"></a>00357 VecType m_Vec;
<a name="l00358"></a>00358 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m_Size;
<a name="l00359"></a>00359 TCompare m_Compare;
<a name="l00360"></a>00360 <span class="comment">//unsigned int m_CurrentValue;</span>
<a name="l00361"></a>00361 <span class="comment">//TInputPixel m_CurrentValue;</span>
<a name="l00362"></a>00362 TInputPixel m_RankValue;
<a name="l00363"></a>00363 TInputPixel m_InitVal;
<a name="l00364"></a>00364 <span class="keywordtype">int</span> m_Below;
<a name="l00365"></a>00365 <span class="keywordtype">int</span> m_Entries;
<a name="l00366"></a>00366 };
<a name="l00367"></a>00367
<a name="l00368"></a>00368 } <span class="comment">// end namespace itk</span>
<a name="l00369"></a>00369 <span class="preprocessor">#endif</span>
<a name="l00370"></a>00370 <span class="preprocessor"></span>
</pre></div></div>
<hr><address><small>
Generated at Thu May 7 23:58:59 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
>
17077
