type_gmorph.html

来自「一个由Mike Gashler完成的机器学习方面的includes neural」· HTML 代码 · 共 36 行

HTML
36
字号
<html><head><title>Generated Documentation</title></head><body>	<image src="headerimage.png">	<br><br><table><tr><td><big><big><big style="font-family: arial;"><b>GMorph</b></big></big></big><br><br></td><td></td></tr></table><br><br><big><big><i>Statics (public)</i></big></big><br><div style="margin-left: 40px;">void <big><b>GetCorrespondingPoints</b></big>(<a href="type_GArffRelation.html">GArffRelation</a>* pRelation, <a href="type_GArffData.html">GArffData</a>* pData1, <a href="type_GArffData.html">GArffData</a>* pData2, double dOutputToInputRatio, <a href="type_GIntArray.html">GIntArray</a>* pPoints)<br><div style="margin-left: 80px;"><font color=brown> Produce a set of points that correspond between the two data sets. Each point p is encoded such that p = i * m_pData2->GetSize() + j, where i is the index in m_pData1 and j is the index in m_pData2. So i = p / m_pData2->GetSize(), and j = p % m_pData2->GetSize().</font></div><br></div><br><big><big><i>Constructors (non-public)</i></big></big><br><div style="margin-left: 40px;"><big><b>GMorph</b></big>(<a href="type_GArffRelation.html">GArffRelation</a>* pRelation, <a href="type_GArffData.html">GArffData</a>* pData1, <a href="type_GArffData.html">GArffData</a>* pData2, double dOutputToInputRatio)<br><div style="margin-left: 80px;"><font color=brown> When dOutputToInputRatio is 0, it just does linear interpolation of the output values. When dOutputToInputRatio is very large, it does linear interpolation of the input values. When dOutputToInputRatio is 1, it weights inputs and outputs equally.</font></div><br></div><br><big><big><i>Destructors</i></big></big><br><div style="margin-left: 40px;"><big><b>~GMorph</b></big>()<br></div><br><big><big><i>Protected</i></big></big><br><div style="margin-left: 40px;">bool <big><b>CheckEdge</b></big>(double* pOrigin, double* pTarget)<br><div style="margin-left: 80px;"><font color=brown> Returns true iff the dot product of (pTarget - pOrigin) with m_pEdgeMask is > 0. (This effectively gives a direction to every edge. We can use this direction to make sure we only put the edge in the graph once, and to determine which node is responsible for the edge's capacity value.)</font></div><br>void <big><b>FindCorrespondence</b></big>(<a href="type_GIntArray.html">GIntArray</a>* pPoints)<br>void <big><b>GatherPathPoints</b></big>(<a href="type_GGraphCut.html">GGraphCut</a>* pGraph, <a href="type_GIntArray.html">GIntArray</a>* pPoints)<br>void <big><b>MakeGraph</b></big>(<a href="type_GGraphCut.html">GGraphCut</a>* pGraph, int nSource)<br></div><br></body></html>

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?