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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Samuel Itzikowitz

dblp:34/4431 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1991
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorSystems, architecture and hardware · 1

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel computing
parallel implementation
0.011991
Parallel Implementation of Multiple Model Tracking Algorithms · IEEE Trans. Parallel Distributed Syst. 1991
Parallel and multicore computing › multiprocessor system
multiprocessor implementation
0.011991
Parallel Implementation of Multiple Model Tracking Algorithms · IEEE Trans. Parallel Distributed Syst. 1991

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

viterbi algorithm · 0.0shared-memory multiprocessing · 0.0interacting multiple model · 0.0
YearPublicationVenuePosition
1991 Multifilters for radar tracking of a maneuvering target-Viterbi vs. IMM
abstract
The performances of the Viterbi and the interacting multiple model (IMM) algorithms applied to radar tracking and detection are investigated and compared. In the first case considered, target acceleration is identical to one of the system models, while in the second case it is not. The algorithm performance depends monotonically on the maximal magnitude of the difference between the model acceleration, on the time interval between measurements, and on the reciprocal of the measurement error standard deviation. In general, when these parameters are relatively large, both algorithms perform well. When they are relatively small, the Viterbi algorithm is better. However, during delay periods, namely right after the start of a maneuver, the IMM algorithm provides better estimations.>
Amir Averbuch, Samuel Itzikowitz, Tal Kapon
ICASSP2
1991 Parallel Implementation of Multiple Model Tracking Algorithms
abstract
The implementations of the Viterbi algorithm (VA) and the interacting multiple model (IMM) algorithm on a shared-bus and shared-memory multiple-input multiple-data (MIMD) multiprocessor are discussed. The computational complexity as well as the speedup and efficiency are examined in detail. It is shown that the computational complexity of the parallel implementation of these algorithms is about the same in both memory space and processing time categories. Efficiency with P processors is about 1-1/P for small P and is expected to be relatively high for large P, especially when many filters and large state and measurement vectors are considered.>
Amir Averbuch, Samuel Itzikowitz, Tal Kapon
IEEE Trans. Parallel Distributed Syst.2
1990 General smoothing techniques for estimating deterministic sinusoidal frequencies from noisy data
abstract
General high-resolution smoothing techniques for estimating deterministic sinusoidal frequencies from short-record noisy data are presented. These techniques are general in the sense that methods such as the modified least squares Prony method, as well as those which are based on eigenvector decompositions, may be considered as special cases of them. The theoretical basis of these smoothing techniques is discussed, and their performance in the presence of white Gaussian noise at low signal-to-noise ratio (SNR) is examined. It is shown that close to the threshold of the maximum-likelihood method (SNR approximately=3 dB) these symmetric smoothing techniques provide better accuracy than any other current method.>
Samuel Itzikowitz, Amir Averbuch
ICASSP1