Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Daniel Goryn

dblp:40/4214 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
3D vision · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
pose estimation
0.011995
On the Estimation of Rigid Body Rotation from Noisy Data · IEEE Trans. Pattern Anal. Mach. Intell. 1995
Mathematical optimization
least squares
0.011995
On the Estimation of Rigid Body Rotation from Noisy Data · IEEE Trans. Pattern Anal. Mach. Intell. 1995
Mathematical optimization › least squares
total least squares
0.011995
On the Estimation of Rigid Body Rotation from Noisy Data · IEEE Trans. Pattern Anal. Mach. Intell. 1995

Methods — techniques the papers use, named apart from their topics

total least squares · 0.0procrustes analysis · 0.0
YearPublicationVenuePosition
1995 On the Estimation of Rigid Body Rotation from Noisy Data
abstract
We derive an exact solution to the problem of estimating the rotation of a rigid body from noisy 3D image data. Our approach is based on total least squares (TLS), but unlike previous work involving TLS, we include the constraint that the transformation matrix should be orthonormal. It turns out that the solution to the estimation problem has the same form as if the data are not noisy, and thus the solution to the standard Procrustes problem can be applied.
Daniel Goryn, Søren Hein
IEEE Trans. Pattern Anal. Mach. Intell.1
1993 A computation of the sliding window recursive QR decomposition
Peter Strobach, Daniel Goryn
ICASSP (4)2
1991 Direction finding networks based on the approximate maximum likelihood and covariance fit formulations
abstract
Competitive feedback network solutions for narrowband direction finding are developed. The main interest lies in estimating the directions of arrival for closely spaced sources. It is shown that if there is a priori information about the number of sources a conditional maximum likelihood solution can be obtained by the network. A suboptimal estimator that requires no a priori knowledge about the number of signals and a network that performs a covariance fit is also presented. Results are presented using both synthetic and real array data.>
Daniel Goryn, Mostafa Kaveh
ICASSP1
1988 Neural networks for narrowband and wideband direction finding
abstract
The authors have investigated the narrowband direction-finding problem with neural networks, and propose taking into consideration several snapshots of array data when programming the network. This yields an average version of the interconnection strengths and bias terms that program the network. Simulation results show that using these averaged interconnection strengths and bias terms enhances the performance of the network compared to the method used by R. Rastogi et al. (1987). The authors extend the direction-finding problem to the wideband case in which the sources have broad temporal frequency spectrum. They utilize the information present at different frequencies in the source spectrum to obtain a suitable cost function that can be minimized by a neural network.>
Daniel Goryn, Mostafa Kaveh
ICASSP1