Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in / Register
Toggle navigation
O
opencv
Project
Project
Details
Activity
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
Packages
Packages
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
submodule
opencv
Commits
235a6784
Commit
235a6784
authored
Apr 04, 2013
by
Andrey Kamaev
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
SVD: always update W vector for better algorithm convergency
parent
1e9ed142
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
9 additions
and
27 deletions
+9
-27
lapack.cpp
modules/core/src/lapack.cpp
+9
-27
No files found.
modules/core/src/lapack.cpp
View file @
235a6784
...
...
@@ -577,10 +577,10 @@ JacobiSVDImpl_(_Tp* At, size_t astep, _Tp* _W, _Tp* Vt, size_t vstep,
continue
;
p
*=
2
;
double
beta
=
a
-
b
,
gamma
=
hypot
((
double
)
p
,
beta
)
,
delta
;
double
beta
=
a
-
b
,
gamma
=
hypot
((
double
)
p
,
beta
);
if
(
beta
<
0
)
{
delta
=
(
gamma
-
beta
)
*
0.5
;
d
ouble
d
elta
=
(
gamma
-
beta
)
*
0.5
;
s
=
(
_Tp
)
std
::
sqrt
(
delta
/
gamma
);
c
=
(
_Tp
)(
p
/
(
gamma
*
s
*
2
));
}
...
...
@@ -588,36 +588,18 @@ JacobiSVDImpl_(_Tp* At, size_t astep, _Tp* _W, _Tp* Vt, size_t vstep,
{
c
=
(
_Tp
)
std
::
sqrt
((
gamma
+
beta
)
/
(
gamma
*
2
));
s
=
(
_Tp
)(
p
/
(
gamma
*
c
*
2
));
delta
=
p
*
p
*
0.5
/
(
gamma
+
beta
);
}
W
[
i
]
+=
delta
;
W
[
j
]
-=
delta
;
if
(
iter
%
2
!=
0
&&
W
[
i
]
>
0
&&
W
[
j
]
>
0
)
{
k
=
vblas
.
givens
(
Ai
,
Aj
,
m
,
c
,
s
);
for
(
;
k
<
m
;
k
++
)
{
_Tp
t0
=
c
*
Ai
[
k
]
+
s
*
Aj
[
k
];
_Tp
t1
=
-
s
*
Ai
[
k
]
+
c
*
Aj
[
k
];
Ai
[
k
]
=
t0
;
Aj
[
k
]
=
t1
;
}
}
else
a
=
b
=
0
;
for
(
k
=
0
;
k
<
m
;
k
++
)
{
a
=
b
=
0
;
for
(
k
=
0
;
k
<
m
;
k
++
)
{
_Tp
t0
=
c
*
Ai
[
k
]
+
s
*
Aj
[
k
];
_Tp
t1
=
-
s
*
Ai
[
k
]
+
c
*
Aj
[
k
];
Ai
[
k
]
=
t0
;
Aj
[
k
]
=
t1
;
_Tp
t0
=
c
*
Ai
[
k
]
+
s
*
Aj
[
k
];
_Tp
t1
=
-
s
*
Ai
[
k
]
+
c
*
Aj
[
k
];
Ai
[
k
]
=
t0
;
Aj
[
k
]
=
t1
;
a
+=
(
double
)
t0
*
t0
;
b
+=
(
double
)
t1
*
t1
;
}
W
[
i
]
=
a
;
W
[
j
]
=
b
;
a
+=
(
double
)
t0
*
t0
;
b
+=
(
double
)
t1
*
t1
;
}
W
[
i
]
=
a
;
W
[
j
]
=
b
;
changed
=
true
;
...
...
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