Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
I
imagej-elphel
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
3
Issues
3
List
Board
Labels
Milestones
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Commits
Issue Boards
Open sidebar
Elphel
imagej-elphel
Commits
47fe5f08
Commit
47fe5f08
authored
Jun 07, 2018
by
Andrey Filippov
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Done with poorly textured areas
parent
27498290
Changes
4
Expand all
Hide whitespace changes
Inline
Side-by-side
Showing
4 changed files
with
980 additions
and
398 deletions
+980
-398
BiCamDSI.java
src/main/java/BiCamDSI.java
+27
-6
BiQuadParameters.java
src/main/java/BiQuadParameters.java
+132
-0
BiScan.java
src/main/java/BiScan.java
+73
-5
TwoQuadCLT.java
src/main/java/TwoQuadCLT.java
+748
-387
No files found.
src/main/java/BiCamDSI.java
View file @
47fe5f08
...
...
@@ -35,25 +35,46 @@ public class BiCamDSI {
double
[]
disparity
,
double
[]
strength
,
boolean
[]
trusted
,
boolean
[]
disabled
)
{
boolean
[]
disabled
,
int
scan_type
)
{
if
(
biScans
==
null
)
biScans
=
new
ArrayList
<
BiScan
>();
biScans
.
add
(
new
BiScan
(
this
,
biScans
.
size
(),
disparity
,
strength
,
trusted
,
disabled
));
biScans
.
add
(
new
BiScan
(
this
,
biScans
.
size
(),
disparity
,
strength
,
trusted
,
disabled
,
scan_type
));
return
biScans
.
size
()-
1
;
}
public
int
addBiScan
(
double
[][]
disparity_bimap
)
{
double
[][]
disparity_bimap
,
int
scan_type
)
{
return
addBiScan
(
disparity_bimap
[
ImageDtt
.
BI_TARGET_INDEX
],
// double [] disparity,
disparity_bimap
[
ImageDtt
.
BI_STR_CROSS_INDEX
],
// double [] strength,
null
,
// boolean [] trusted,
null
);
// boolean [] disabled)
null
,
// boolean [] disabled)
scan_type
);
}
public
BiScan
getLastBiScan
()
{
return
getBiScan
(-
1
);
/**
* Get last BiScan of specific type
* @param scan_type -1 - any (returns last scan), >=0 must match type. If none of the type exists, returns null
* @return
*/
public
BiScan
getLastBiScan
(
int
scan_type
)
{
if
(
scan_type
<
0
)
return
getBiScan
(-
1
);
if
(
biScans
.
isEmpty
())
return
null
;
int
last_index
=
-
1
;
for
(
int
i
=
0
;
i
<
biScans
.
size
();
i
++)
{
if
(
biScans
.
get
(
i
).
scan_type
==
scan_type
)
{
last_index
=
i
;
}
}
if
(
last_index
>=
0
)
{
return
biScans
.
get
(
last_index
);
}
else
{
return
null
;
}
}
public
BiScan
getBiScan
(
int
indx
)
{
if
(
biScans
.
isEmpty
())
return
null
;
...
...
src/main/java/BiQuadParameters.java
View file @
47fe5f08
This diff is collapsed.
Click to expand it.
src/main/java/BiScan.java
View file @
47fe5f08
...
...
@@ -25,6 +25,10 @@ import java.util.concurrent.atomic.AtomicInteger;
public
class
BiScan
{
final
static
double
THRESHOLD_LIN
=
1.0
E
-
20
;
// threshold ratio of matrix determinant to norm for linear approximation (det too low - fail)
final
static
double
THRESHOLD_QUAD
=
1.0
E
-
30
;
// threshold ratio of matrix determinant to norm for quadratic approximation (det too low - fail)
final
static
int
BISCAN_ANY
=
-
1
;
final
static
int
BISCAN_SINGLECORR
=
0
;
final
static
int
BISCAN_AVGCORR
=
1
;
// combined with low-texture averaging correlation
final
static
int
BISCAN_POLE
=
2
;
// combined with low-texture averaging correlation
double
[]
disparity_measured
;
double
[]
target_disparity
;
...
...
@@ -35,6 +39,7 @@ public class BiScan {
boolean
[]
disabled_measurement
;
// should disable source also
int
[]
src_index
;
// index of the source scan which measured data is used here (applies to disparity_measured, strength_measured, disabled_measurement
int
list_index
=
-
1
;
int
scan_type
=
-
1
;
BiCamDSI
biCamDSI
;
// public BiScan(BiCamDSI biCamDSI) {
// this.biCamDSI = biCamDSI;
...
...
@@ -49,9 +54,11 @@ public class BiScan {
double
[]
disparity
,
double
[]
strength
,
boolean
[]
trusted
,
boolean
[]
disabled
)
{
boolean
[]
disabled
,
int
scan_type
)
{
this
.
biCamDSI
=
biCamDSI
;
this
.
list_index
=
indx
;
this
.
scan_type
=
scan_type
;
int
num_tiles
=
biCamDSI
.
tnImage
.
getSizeX
()*
biCamDSI
.
tnImage
.
getSizeY
();
if
(
disparity
==
null
)
{
disparity
=
new
double
[
num_tiles
];
...
...
@@ -1572,7 +1579,7 @@ public class BiScan {
}
ImageDtt
.
startAndJoin
(
threads
);
if
(
debugLevel
>
-
2
)
{
biCamDSI
.
getLastBiScan
().
showScan
(
biCamDSI
.
getLastBiScan
(
BISCAN_ANY
).
showScan
(
"trimWeakFG_"
+
npass
);
}
...
...
@@ -2030,9 +2037,10 @@ public class BiScan {
final
int
debugLevel
)
{
final
double
[]
weights
=
{
1.0
,
0.7
};
// {ortho, corners},
final
boolean
adjust_all
=
(
neib_pull
>
0.0
);
final
double
fneib_pull
=
adjust_all
?
neib_pull:
1.0
;
//
final double fneib_pull = adjust_all ? neib_pull: 1.0;
final
TileNeibs
tnImage
=
biCamDSI
.
tnImage
;
final
int
dbg_tile
=
(
debugLevel
>
-
2
)?
(
dbg_y
*
tnImage
.
sizeX
+
dbg_x
):-
1
;
// final int dbg_tile = (debugLevel > -2)? (dbg_y * tnImage.sizeX + dbg_x):-1;
final
int
dbg_tile
=
(
debugLevel
>
0
)?
(
dbg_y
*
tnImage
.
sizeX
+
dbg_x
):-
1
;
final
int
num_tiles
=
src_disparity
.
length
;
final
Thread
[]
threads
=
ImageDtt
.
newThreadArray
(
biCamDSI
.
threadsMax
);
// max_changes may have Double.NaN value (here meaning larger than any)
...
...
@@ -2123,7 +2131,7 @@ public class BiScan {
}
}
}
if
(
debugLevel
>
-
2
)
{
if
(
debugLevel
>
0
)
{
System
.
out
.
println
(
"fillAndSmooth(): iteration "
+
fnum_iter
+
" change="
+
change
+
" (min_change="
+
min_change
+
")+ tiles updated="
+
ai_count
.
get
());
}
if
(
change
<=
min_change
)
{
// change may be NaN
...
...
@@ -2134,6 +2142,66 @@ public class BiScan {
return
ds
;
}
public
double
[][]
getLTExpanded
(
final
double
tolerance
,
final
double
[][]
ds_lt
,
final
double
[]
d_single
,
final
boolean
[]
lt_sel
,
// lt_sel and exp_sel do not intersect
final
boolean
[]
exp_sel
,
final
boolean
[]
trusted
)
{
// final int dbg_tile = (debugLevel>-2)?(dbg_x + tnImage.sizeX*dbg_y):-1;
final
int
num_tiles
=
exp_sel
.
length
;
final
double
[][]
ds
=
new
double
[
2
][
num_tiles
];
for
(
int
i
=
0
;
i
<
num_tiles
;
i
++)
ds
[
0
][
i
]
=
Double
.
NaN
;
final
Thread
[]
threads
=
ImageDtt
.
newThreadArray
(
biCamDSI
.
threadsMax
);
final
AtomicInteger
ai
=
new
AtomicInteger
(
0
);
final
TileNeibs
tnImage
=
biCamDSI
.
tnImage
;
for
(
int
ithread
=
0
;
ithread
<
threads
.
length
;
ithread
++)
{
threads
[
ithread
]
=
new
Thread
()
{
@Override
public
void
run
()
{
// max_changes[numThread]
for
(
int
nTile
=
ai
.
getAndIncrement
();
nTile
<
num_tiles
;
nTile
=
ai
.
getAndIncrement
())
if
(
lt_sel
[
nTile
])
{
// is low texture = - just copy
ds
[
0
][
nTile
]
=
ds_lt
[
0
][
nTile
];
ds
[
1
][
nTile
]
=
ds_lt
[
1
][
nTile
];
}
else
if
(
exp_sel
[
nTile
])
{
int
dbg_tileX
=
nTile
%
tnImage
.
sizeX
;
int
dbg_tileY
=
nTile
/
tnImage
.
sizeX
;
if
((
dbg_tileY
==
156
)
||
(
dbg_tileY
==
157
))
{
System
.
out
.
println
(
"getLTExpanded(): tileX="
+
dbg_tileX
+
", tileY="
+
dbg_tileY
);
System
.
out
.
println
(
"getLTExpanded(): tileX="
+
dbg_tileX
+
", tileY="
+
dbg_tileY
);
}
int
nTile0
=
tnImage
.
getNeibIndex
(
nTile
,-
1
,
0
);
if
((
nTile0
<
0
)
||
!
exp_sel
[
nTile0
]){
boolean
OK0
=
(
nTile0
<
0
)
||
lt_sel
[
nTile0
]
||
(
trusted
[
nTile0
]
&&
(
d_single
[
nTile0
]
>=
(
ds_lt
[
0
][
nTile
]
-
tolerance
)));
if
(
OK0
)
{
int
nTile1
=
tnImage
.
getNeibIndex
(
nTile
,
1
,
0
);
int
l
=
1
;
while
((
nTile1
>=
0
)
&&
exp_sel
[
nTile1
])
{
nTile1
=
tnImage
.
getNeibIndex
(
nTile1
,
1
,
0
);
l
++;
}
boolean
OK1
=
(
nTile1
<
0
)
||
lt_sel
[
nTile1
]
||
(
trusted
[
nTile1
]
&&
(
d_single
[
nTile1
]
>=
(
ds_lt
[
0
][
nTile1
-
1
]
-
tolerance
)));
if
(
OK1
)
{
for
(
int
i
=
0
;
i
<
l
;
i
++)
{
int
nt
=
nTile
+
i
;
ds
[
0
][
nt
]
=
ds_lt
[
0
][
nt
];
ds
[
1
][
nt
]
=
ds_lt
[
1
][
nt
];
}
}
}
}
}
}
};
}
ImageDtt
.
startAndJoin
(
threads
);
return
ds
;
}
}
src/main/java/TwoQuadCLT.java
View file @
47fe5f08
This diff is collapsed.
Click to expand it.
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment