Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
A
audiowmark
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Stefan Westerfeld
audiowmark
Commits
94233e5b
Commit
94233e5b
authored
Jan 17, 2024
by
Stefan Westerfeld
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Refactor/cleanup speed detection code.
Signed-off-by:
Stefan Westerfeld
<
stefan@space.twc.de
>
parent
9e595cda
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
31 additions
and
45 deletions
+31
-45
wmspeed.cc
src/wmspeed.cc
+31
-45
No files found.
src/wmspeed.cc
View file @
94233e5b
...
@@ -686,73 +686,59 @@ detect_speed (const vector<Key>& key_list, const WavData& in_data, bool print_re
...
@@ -686,73 +686,59 @@ detect_speed (const vector<Key>& key_list, const WavData& in_data, bool print_re
vector
<
SpeedSync
::
Score
>
scores
;
vector
<
SpeedSync
::
Score
>
scores
;
};
};
vector
<
KeySpeedSearch
>
key_speed_search_vec
;
vector
<
KeySpeedSearch
>
key_speed_search_vec
;
ThreadPool
thread_pool
;
ThreadPool
thread_pool
;
for
(
auto
&
key
:
key_list
)
{
const
double
clip_location
=
get_best_clip_location
(
key
,
in_data
,
scan1
.
seconds
,
clip_candidates
);
key_speed_search_vec
.
push_back
({
key
,
std
::
make_unique
<
SpeedSearch
>
(
in_data
,
clip_location
),
{}});
auto
run_search
=
[
&
]
(
const
SpeedScanParams
&
scan_params
,
auto
get_speeds
)
{
}
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
key_speed_search
.
speed_search
->
start_prepare_jobs
(
thread_pool
,
key_speed_search
.
key
,
scan_params
,
get_speeds
(
key_speed_search
));
/* initial search using grid */
thread_pool
.
wait_all
();
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
key_speed_search
.
speed_search
->
start_prepare_jobs
(
thread_pool
,
key_speed_search
.
key
,
scan1
,
{
1.0
});
thread_pool
.
wait_all
();
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
key_speed_search
.
speed_search
->
start_search_jobs
(
thread_pool
,
scan_params
);
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
thread_pool
.
wait_all
();
key_speed_search
.
speed_search
->
start_search_jobs
(
thread_pool
,
scan1
);
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
key_speed_search
.
scores
=
key_speed_search
.
speed_search
->
get_results
();
};
thread_pool
.
wait_all
();
/* initial search using grid */
for
(
auto
&
key
:
key_list
)
{
const
double
clip_location
=
get_best_clip_location
(
key
,
in_data
,
scan1
.
seconds
,
clip_candidates
);
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
key_speed_search_vec
.
push_back
({
key
,
std
::
make_unique
<
SpeedSearch
>
(
in_data
,
clip_location
),
{}});
key_speed_search
.
scores
=
key_speed_search
.
speed_search
->
get_results
();
}
run_search
(
scan1
,
[]
(
auto
&
key_speed_search
)
->
vector
<
double
>
{
return
{
1.0
};
});
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
/* improve N best matches */
run_search
(
scan2
,
[
n_best
]
(
auto
&
key_speed_search
)
->
vector
<
double
>
{
{
/* improve N best matches */
select_n_best_scores
(
key_speed_search
.
scores
,
n_best
);
select_n_best_scores
(
key_speed_search
.
scores
,
n_best
);
vector
<
double
>
speeds
;
vector
<
double
>
speeds
;
for
(
auto
score
:
key_speed_search
.
scores
)
for
(
auto
score
:
key_speed_search
.
scores
)
speeds
.
push_back
(
score
.
speed
);
speeds
.
push_back
(
score
.
speed
);
key_speed_search
.
speed_search
->
start_prepare_jobs
(
thread_pool
,
key_speed_search
.
key
,
scan2
,
speeds
);
return
speeds
;
}
});
thread_pool
.
wait_all
();
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
key_speed_search
.
speed_search
->
start_search_jobs
(
thread_pool
,
scan2
);
thread_pool
.
wait_all
();
/* improve or refine best match */
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
key_speed_search
.
scores
=
key_speed_search
.
speed_search
->
get_results
();
select_n_best_scores
(
key_speed_search
.
scores
,
1
);
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
{
/* improve or refine best match */
select_n_best_scores
(
key_speed_search
.
scores
,
1
);
}
if
(
Params
::
detect_speed_patient
)
if
(
Params
::
detect_speed_patient
)
{
{
// slower version: prepare magnitudes again, according to best speed
// slower version: prepare magnitudes again, according to best speed
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
run_search
(
scan3
,
[]
(
auto
&
key_speed_search
)
->
vector
<
double
>
key_speed_search
.
speed_search
->
start_prepare_jobs
(
thread_pool
,
key_speed_search
.
key
,
scan3
,
{
key_speed_search
.
scores
[
0
].
speed
});
{
return
{
key_speed_search
.
scores
[
0
].
speed
};
thread_pool
.
wait_all
();
});
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
key_speed_search
.
speed_search
->
start_search_jobs
(
thread_pool
,
scan3
);
thread_pool
.
wait_all
();
for
(
auto
&
key_speed_search
:
key_speed_search_vec
)
key_speed_search
.
scores
=
key_speed_search
.
speed_search
->
get_results
();
}
}
else
else
{
{
...
...
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