O Bulan, V Kozitsky, P Ramesh… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
… and transition probabilities, we decoded the highest probabilitycharacter sequence … selected using a grid search that maximized TPR performance for the no-LP class at 0.5% FPR. …
YT Cui, Q Huang - … of IEEE Computer Society Conference on …, 1997 - ieeexplore.ieee.org
… of characters as a Markov random field (MRF). With the MRF modeling, the extraction of characters is formulated as the problem of maximizing the a posteriori probability based on …
… In this paper, the licenseplatesegmentation module extracts the licenseplate … the extraction of characters is formulated as the problem of maximizing a posteriori probability based on a …
X Fan, G Fan - IEEE Signal Processing Letters, 2008 - ieeexplore.ieee.org
… SHMMs can be trained by the expectation maximization (EM) algorithm that has to be approxi… We can use the similar maximum likelihood (ML) estimators as [9] for learning parameters …
Y Cui, Q Huang - Machine Vision and Applications, 1998 - Springer
… as an optimization problem of maximizing the a posteriori probability given prior knowledge … 2, we use the MRF model to formulate the character extraction problem as an optimization …
GS Hsu, JC Chen, YZ Chung - IEEE transactions on vehicular …, 2012 - ieeexplore.ieee.org
… modules for plate detection, charactersegmentation, and … they are clustered using the Expectation–Maximization (EM) [… where p(xi) is the probability of the edge point xi, φ is the jth …
… a licenseplate region; 2) segmentation of the platecharacters; and 3) recognition of each character… can be modeled as the problem of maximizing a posteriori probability based on given …
… to segment the LP and finally to recognize all the characters in … Then it maximizes the contrast to improve and clarify better … layer to predicate every class probabilities. Besides, we used …
RD Castro‐Zunti, J Yépez, SB Ko - IET Intelligent Transport …, 2020 - Wiley Online Library
… a licenseplate to infer characters and their positions using hidden Markov models. The character sequence with the highest probability is … Transforms were selected to maximise class …