Line following robots are used in numerous application areas. The tracking of weak line is challenging, especially if SNR is high, so application of Track-Before-Detect algorithm is necessary. The viterbi algorithm is...
详细信息
ISBN:
(纸本)9783319238142;9783319238135
Line following robots are used in numerous application areas. The tracking of weak line is challenging, especially if SNR is high, so application of Track-Before-Detect algorithm is necessary. The viterbi algorithm is assumed in this paper and the possibilities of optimization are considered. Two metric are applied in Monte Carlo tests-the direct metric and proposed boundary metric. The optimization of viterbi algorithm is based on non single row movements of moving window.
In this paper we present an algorithm for segmenting English sentences, without spaces, into their constituent words based on a dictionary using a variation of the viterbi algorithm. We call this variation the diction...
详细信息
ISBN:
(纸本)9781728162515
In this paper we present an algorithm for segmenting English sentences, without spaces, into their constituent words based on a dictionary using a variation of the viterbi algorithm. We call this variation the dictionary based viterbi algorithm for word boundary identification. The input to the algorithm is a sequence of English words which are not space separated and the output is list of the top-k possible word segmentations. The top-k segmentation of the input into the constituent words is determined on the basis of an optimality criteria applied to a scoring function which computes the "segmentation score" of each possible word sequence for the given input. Our implementation works from the back (right) of the input string and creates a data structure for storing the possible word boundaries during the first pass. The data structure consists of an index (a list of nodes) of length equal to the number of input characters in the string. The i(th) node in the index contains a pointer to the optimal list of words for the substring starting at position i of the input sequence. The list of possible breakdowns including the optimal one is collected during a second pass through the data structure. Due to the way the initial data structure is built during the first pass we call our algorithm the Reverse Sequence Search (RSS) algorithm. We report experimental results on several datasets including the entire Brown corpus with over one million words to show how fast our algorithm works. We also compare our implementation with a dynamic programming implementation provided by Norvig [1] which is one of the classical algorithms for the problem of word segmentation. Furthermore we show that our algorithm runs in O(n) time and space.
In this paper, a Multiple-symbol differential detection (MSDD) receiver by using the viterbi algorithm for double differential phase-shift keying (DDPSK) signals is presented. The structure of branch metric is also de...
详细信息
ISBN:
(纸本)9781467321969
In this paper, a Multiple-symbol differential detection (MSDD) receiver by using the viterbi algorithm for double differential phase-shift keying (DDPSK) signals is presented. The structure of branch metric is also derived. It is shown that the proposed receiver has lower computational complexity, since it reduces the number of trellis paths searched in performing maximum likelihood sequence estimation (MLSE). Computer simulations demonstrate that the performance of the proposed receiver can reach the lower bound on the error probability of MSDD with very lower complexity.
Optimum receiver model for channels with Intersymbol Interference (ISI) and Additive White Gaussian Noise (AWGN) are introduced to deduce the viterbi algorithm in the Maximum-Likelihood Sequence Estimation (MLSE). Fin...
详细信息
ISBN:
(纸本)9783037854969
Optimum receiver model for channels with Intersymbol Interference (ISI) and Additive White Gaussian Noise (AWGN) are introduced to deduce the viterbi algorithm in the Maximum-Likelihood Sequence Estimation (MLSE). Finally, we use Matlab to simulate the algorithm in three different channels and analyze the experiment results. Analyses show that the viterbi algorithm is applicable for any channel which is optimum from a probability of error viewpoint;the MLSE for channels with ISI has a computational complexity that grows exponentially with the length of channels time dispersion L;the loss of performance is negligible when the decoding delay achieves 5L.
Any information that has to be transmitted undergoes a number of processes including the noise channels before it is extracted by the receiver. This brings in the need for reliable reception of information with minimu...
详细信息
ISBN:
(纸本)9781538649855
Any information that has to be transmitted undergoes a number of processes including the noise channels before it is extracted by the receiver. This brings in the need for reliable reception of information with minimum error rate. The main aim of this paper is to shed light on viterbi algorithm as an error detection and correction method used to maintain the reliability of the system. This paper focuses on viterbi Decoder, an efficient Hard/Soft algorithm devised to estimate the most likely path for convolutionally encoded data with implementation details on Hard and Soft decision techniques through various communication channels.
Demand response is an integral component of a future Smart Grid, whereby customers use aggregated power consumption data (available locally via Smart Meters) and real-time pricing information (send pre-emptively from ...
详细信息
ISBN:
(纸本)9781538643280
Demand response is an integral component of a future Smart Grid, whereby customers use aggregated power consumption data (available locally via Smart Meters) and real-time pricing information (send pre-emptively from the utility) to schedule their future energy use to enhance conservation goals. This requires enabling customers to determine disaggre-gated consumption at individual appliance level from aggregate power consumption data. Current disaggregation algorithms suffer either from limited accuracy or costly installation and maintenance. Furthermore, many do not achieve sufficiently low disaggregation delay implying constraints on (near) real-time operation necessary for Demand Side Management. The primary contribution of this work is a real-time disaggregation algorithm based on a new Markov Chain model for the power consumption of individual electrical appliances. The model incorporates both temporal and inter-device correlations which are used to estimate the appliance-level disaggregated power consumption through the application of the viterbi algorithm. The performance is vetted through significant testing with real minute-resolution power consumption data.
I have developed a novel location estimation method that is based on the viterbi algorithm. Using this method enables us to estimate the most likely location at several 10 nsec by using past location transition and si...
详细信息
ISBN:
(纸本)9781424425143
I have developed a novel location estimation method that is based on the viterbi algorithm. Using this method enables us to estimate the most likely location at several 10 nsec by using past location transition and signal detection. In addition, the system implementing this method can be composed of a single LSI. Since the viterbi algorithm has two functions, signal detection from noisy received signal and finding a maximum likelihood sequence path, this method can be applied to location estimation. The level of the received signal is proportional to the distance between the move terminal and the fixed node. The trellis of viterbi decoder/encoder is similar to the track of move terminal. The viterbi algorithm has no backward search function like the Fano algorithm, so the time needed for detection is fixed and short. The scale of the execution circuit is reduced with the truncation path memory because of the survivor path selection. When the location for the 16 x 16 array was located, there were 256 states. The required number of elements was 10 k, and the required memory was 68 kbit. This shows that using the proposed method can achieve a highly effective medium-scale FPGA. In a field test, when the 3D location (8 x 8x 8 array) was estimated with the proposed viterbi algorithm, accuracy was 70% higher than when using the conventional method due to pattern matching the received signal strength to detect location.
This paper proposes a novel algorithm, named "Recursive vector viterbi algorithm" applied. for the multibeam interference cancellers. The proposed algorithm make it possible to reduce the computational compl...
详细信息
ISBN:
(纸本)0780377575
This paper proposes a novel algorithm, named "Recursive vector viterbi algorithm" applied. for the multibeam interference cancellers. The proposed algorithm make it possible to reduce the computational complexity of the cancellers, ultimately. The basic idea of the algorithm is to divide the state transition of the vector viterbi algorithm into the several steps, each of which corresponds to each beam in the multibeam. In spite of the division, the performance of the canceller based on the proposed algorithm scarcely degrades by virtue of assistance of the adaptive beam control implemented in the multibeam interference cancellers. Indeed, It is verified by computer simulation that 3-beam interference canceller has only 0.2dB performance degradation in 2-path Rayleigh fading channel in spite of one third of computational complexity compared with the conventional one.
We present a global tracking algorithm for tracking particles with dynamic motion models. The tracking algorithm augments a existing global track linking algorithm based on the viterbi algorithm with a Gaussian Mixtur...
详细信息
ISBN:
(纸本)9781479923748
We present a global tracking algorithm for tracking particles with dynamic motion models. The tracking algorithm augments a existing global track linking algorithm based on the viterbi algorithm with a Gaussian Mixture Probability Hypothesis Density filter. This allows the tracking algorithm to use the target velocities to link tracks. The algorithm can handle clutter, missed detections, and random appearance and disappearance of particles in the field of view. The algorithm can also handle targets that switch between different motion models according to a Markov process. The algorithm is evaluated on the synthetic datasets used in the ISBI 2012 Particle Tracking Challenge, which simulate vesicles, receptors, microtubules, and viruses at different particle densities and signal to noise ratios. The evaluation shows that our algorithm performs well across a wide range of particle tracking problems in both 2D and 3D.
We introduce a variant of the viterbi algorithm termed "p-viterbi algorithm" based on the p-norm of a vector of the log transition probabilities. It includes the conventional viterbi algorithm as well as a v...
详细信息
ISBN:
(纸本)9781538618950
We introduce a variant of the viterbi algorithm termed "p-viterbi algorithm" based on the p-norm of a vector of the log transition probabilities. It includes the conventional viterbi algorithm as well as a variant termed "minimax viterbi algorithm" that finds the sequence of the hidden states that maximizes the minimum transition probability along the sequence (not the product of the transition probabilities). We carry out a numerical experiment to show an advantage of the p-viterbi algorithm over the minimax viterbi algorithm when they are applied to practical applications.
暂无评论