forked from manhofer/Line3Dpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
clustering.h
130 lines (111 loc) · 3.26 KB
/
clustering.h
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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#ifndef I3D_LINE3D_PP_CLUSTERING_H_
#define I3D_LINE3D_PP_CLUSTERING_H_
/*
* Disclaimer:
* Re-implementation of the algorithm described in the paper
*
* Efficient Graph-based Image Segmentation,
* P. Fezenszwalb, F. Huttenlocher,
* International Journal of Computer Vision, 2004.
*
* and based on their official source code, which can be found at
* from http://cs.brown.edu/~pff/segment/
*
* Their code is put under the GNU GENERAL PUBLIC LICENSE,
* and so is this version.
*/
/*
Line3D++ - Line-based Multi View Stereo
Copyright (C) 2015 Manuel Hofer
This program 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.
This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <list>
#include <algorithm>
#include "universe.h"
/**
* Clustering
* ====================
* Clustering/Segmentation Algorithm.
* [Felzenswalb & Huttenlocher, IJCV 2004]
*
* This code is an adaption of their original source code,
* to fit into our datastructures.
* ====================
* Author: M.Hofer, 2015
*/
namespace L3DPP
{
// edge in affinity matrix
typedef struct {
int i_;
int j_;
float w_;
} CLEdge;
// point on clustered 2D line
typedef struct {
unsigned int lineID_;
float x_;
float y_;
float pos_;
} CLPointOnLine;
// sorting function for edges
static bool sortEdges(const CLEdge& a, const CLEdge& b)
{
return a.w_ < b.w_;
}
static bool sortEdgesByRow(const CLEdge& a, const CLEdge& b)
{
if(a.i_ < b.i_)
return true;
else if(a.i_ == b.i_ && a.j_ < b.j_)
return true;
else
return false;
}
static bool sortEdgesByCol(const CLEdge& a, const CLEdge& b)
{
if(a.j_ < b.j_)
return true;
else if(a.j_ == b.j_ && a.i_ < b.i_)
return true;
else
return false;
}
// sort entries for sparse affinity matrix (CLEdges)
static bool sortCLEdgesByCol(const CLEdge a1, const CLEdge a2)
{
if(a1.j_ < a2.j_)
return true;
else if(a1.j_ == a2.j_ && a1.i_ < a2.i_)
return true;
else
return false;
}
static bool sortCLEdgesByRow(const CLEdge a1, const CLEdge a2)
{
if(a1.i_ < a2.i_)
return true;
else if(a1.i_ == a2.i_ && a1.j_ < a2.j_)
return true;
else
return false;
}
// sorting function for projected points on a line
static bool sortPointsOnLine(const CLPointOnLine& a, const CLPointOnLine& b)
{
return a.pos_ < b.pos_;
}
// perform graph clustering
CLUniverse* performClustering(std::list<CLEdge> edges, int numNodes,
float c);
}
#endif //I3D_LINE3D_PP_CLUSTERING_H_