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
9ca65083
Commit
9ca65083
authored
Oct 02, 2025
by
Andrey Filippov
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
debugging
parent
5c63b739
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
31 additions
and
3 deletions
+31
-3
CuasMotion.java
src/main/java/com/elphel/imagej/cuas/CuasMotion.java
+31
-3
No files found.
src/main/java/com/elphel/imagej/cuas/CuasMotion.java
View file @
9ca65083
...
...
@@ -11,6 +11,8 @@ import java.util.ArrayList;
import
java.util.Arrays
;
import
java.util.Collections
;
import
java.util.Comparator
;
import
java.util.Queue
;
import
java.util.concurrent.ConcurrentLinkedQueue
;
import
java.util.concurrent.atomic.AtomicInteger
;
import
javax.imageio.ImageIO
;
import
java.nio.file.Paths
;
...
...
@@ -5632,8 +5634,8 @@ public class CuasMotion {
if
(
dbg_tile
>=
0
)
{
System
.
out
.
println
(
"calcMathingTargetsLengths().0 max_mismatch="
+
max_mismatch
+
", max_mismatch2="
+
max_mismatch2
);
}
int
num_grp_before
=
0
;
final
double
[][][][][]
bbox_ba
=
new
double
[
2
][
num_seq
][
num_tiles
][][];
// minx, miny, maxx, maxy
for
(
int
aba
=
0
;
aba
<=
1
;
aba
++)
{
// first pass - calculating connected keyframes before each current keyframe tile/target alternative
final
int
ba
=
aba
;
for
(
int
nseq
=
0
;
nseq
<
num_seq
;
nseq
++)
{
...
...
@@ -5758,11 +5760,27 @@ public class CuasMotion {
}
ImageDtt
.
startAndJoin
(
threads
);
}
System
.
out
.
println
(
"calcMatchingTargetsLengths(): ba="
+
ba
+
", agrp="
+
agrp
);
if
(
ba
==
0
)
{
num_grp_before
=
agrp
.
get
();
}
System
.
out
.
println
(
"calcMatchingTargetsLengths(): ba="
+
ba
+
", agrp="
+
agrp
.
get
());
}
/*
// final ArrayList<ConcurrentLinkedQueue<Integer>> cqueue_list = new ArrayList<ConcurrentLinkedQueue<Integer>>();
// final ConcurrentLinkedQueue<ConcurrentLinkedQueue<Integer>> cqueue_list = new ConcurrentLinkedQueue<ConcurrentLinkedQueue<Integer>>();
final ConcurrentLinkedQueue<Integer> [] cqueue_arr = new ConcurrentLinkedQueue<Integer>[num_grp_before];
for (int bgrp = 1; bgrp < num_grp_before; bgrp++) {
cqueue_list.add(new ConcurrentLinkedQueue<Integer>());
}
*/
final
int
len_grp_before
=
num_grp_before
;
final
int
len_grp_after
=
agrp
.
get
()-
len_grp_before
;
final
boolean
[]
pairs
=
new
boolean
[(
len_grp_before
-
1
)
*
len_grp_after
];
ai
.
set
(
0
);
// combine before/after into a single value
for
(
int
ithread
=
0
;
ithread
<
threads
.
length
;
ithread
++)
{
threads
[
ithread
]
=
new
Thread
()
{
...
...
@@ -5801,6 +5819,16 @@ public class CuasMotion {
if
(
MM_AFTER
<=
good_mismatch
)
{
target
[
CuasMotionLMA
.
RSLT_QMATCH
]
+=
Math
.
max
(
0
,(
good_mismatch
-
MM_AFTER
)/
good_mismatch
);
// 0 .. 1
}
int
grp_before
=
target_grp
[
0
][
nSeq
][
ntile
][
ntarg
]-
1
;
int
grp_after
=
target_grp
[
1
][
nSeq
][
ntile
][
ntarg
]
-
len_grp_before
;
int
indx
=
grp_after
+
grp_before
*
len_grp_after
;
pairs
[
indx
]
=
true
;
/*
ConcurrentLinkedQueue<Integer> cqueue = cqueue_list.get(grp_before-1);
if (!cqueue.contains(grp_after)) {
cqueue.add(grp_after);
}
*/
if
(
ntile
==
dbg_tile
)
{
System
.
out
.
println
(
"calcMathingTargetsLengths().4 nSeq = "
+
nSeq
+
", targets["
+
ntarg
+
"][CuasMotionLMA.RSLT_MATCH_LENGTH]="
+
target
[
CuasMotionLMA
.
RSLT_MATCH_LENGTH
]+
", travel="
+
target
[
CuasMotionLMA
.
RSLT_SEQ_TRAVEL
]);
...
...
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