• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.68 no.3
• /
• pp.471-479
• /
• 2019

This research proposes a indoor magnetic map matching algorithm that improves the position accuracy by employing multiple magnetic sensors and probabilistic candidate weighting function. Since the magnetic field is easily distorted by the surrounding environment, the distorted magnetic field can be used for position mapping, and multiple sensor configuration is useful to improve mapping accuracy. Nevertheless, the position error is likely to increase because the external magnetic disturbances have repeated pattern in indoor environment and several points have similar magnetic field distortion characteristics. Those errors cause large position error, which reduces the accuracy of the position detection. In order to solve this problem, we propose a method to reduce the error using multiple sensors and likelihood boundaries that uses human walking characteristics. Also, to reduce the maximum position error, we propose an algorithm that weights according to their importance. We performed indoor walking tests to evaluate the performance of the algorithm and analyzed the position detection error rate and maximum distance error. From the results we can confirm that the accuracy of position detection is greatly improved.

• Journal of the Semiconductor & Display Technology
• /
• v.9 no.2
• /
• pp.123-126
• /
• 2010

An implementation of modified stereo matching using efficient belief propagation (BP) algorithm is presented in this paper. We do recommend the use of the simple sobel, prewitt edge operator. The application of B band sobel edge operator over image demonstrates result with somewhat noisy (distinct border). When we adopt the only MRF + BP algorithm, however, borders cannot be distinguished due to that the message functions in the BP algorithm is just the mechanism which passes energy data to the only large gap of each Message functions In order to address the abovementioned disadvantageous phenomenon, we use the sobel edge operator + MRF + BP algorithm to distinguish the border that is located between the similar message data. Using edge information, the result shows that our proposed process diminishes the propagation of wrong probabilistic information. The enhanced result is due to that our proposed method effectively reduced errors incurred by ambiguous scene properties.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.5
• /
• pp.1089-1097
• /
• 2016

It is well-known that, if additional information other than a plaintext-ciphertext pair is available, breaking the RSA cryptosystem may be much easier than factorizing the RSA modulus. For example, Coppersmith showed that, given the 1/2 fraction of the least or most significant bits of one of two RSA primes, the RSA modulus can be factorized in a polynomial time. More recently, Henecka et. al showed that the RSA private key of the form (p, q, d, $d_p$, $d_q$) can efficiently be recovered whenever the bits of the private key are erroneous with error rate less than 23.7%. It is notable that their algorithm is based on counting the matching bits between the candidate key bit string and the given decayed RSA private key bit string. And, extending the algorithm, this paper proposes a new RSA private key recovery algorithm using a generalized probabilistic measure for measuring the consistency between the candidate key bits and the given decayed RSA private key bits.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1946-1956
• /
• 2001

In this paper, we propose a novel 2-D partial matching algorithm based on model-based stochastic analysis of feature correspondences in a relation vector space, which is quite robust to shape variations as well as invariant to geometric transformations. We represent an object using the ARG (Attributed Relational Graph) model with features of a set of relation vectors. In addition, we statistically model the partial occlusion or noise as the distortion of the relation vector distribution in the relation vector space. Our partial matching algorithm consists of two-phases. First, a finite number of candidate sets areselected by using logical constraint embedding local and structural consistency Second, the feature loss detection is done iteratively by error detection and voting scheme thorough the error analysis of relation vector space. Experimental results on real images demonstrate that the proposed algorithm is quite robust to noise and localize target objects correctly even inseverely noisy and occluded scenes.

• The Journal of the Korea Contents Association
• /
• v.22 no.3
• /
• pp.54-61
• /
• 2022

Ship is a huge system including a variety of pipe arrangements. Pipes are installed according to the design layout, however the end poistion of pipes are not well matched owing to its measurement and construction errors. In this situation, the customized pipe fitting is frequently designed to connect with both pipes, the position of which are manually measured. This paper focused that these two coordinates are measured by point cloud from RGBD sensor and the relative transformation induced by positional and orientational differences is calculated by inverse kinematics in robotics theory. Therefore, the result applies for the methodology of the pipe connection design. The pipe coordinate that is estimated by the matching and the probabilistic RANSAC method will be verified by experiments. The kinematic design parameters are computationally calculated by using the minimum degree of freedom that connects both pipe coordinates.

• Journal of Korea Multimedia Society
• /
• v.19 no.12
• /
• pp.1943-1950
• /
• 2016

Recently, gender classification has attracted a great deal of attention in the field of video surveillance system. It can be useful in many applications such as detecting crimes for women and business intelligence. In this paper, we proposed a method which can detect pedestrians from CCTV video and classify the gender of the detected objects. So far, many algorithms have been proposed to classify people according the their gender. This paper presents a gender classification using convolutional neural network. The detection phase is performed by AdaBoost algorithm based on Haar-like features and LBP features. Classifier and detector is trained with data-sets generated form CCTV images. The experimental results of the proposed method is male matching rate of 89.9% and the results shows 90.7% of female videos. As results of simulations, it is shown that the proposed gender classification is better than conventional classification algorithm.

• Journal of Creative Information Culture
• /
• v.5 no.2
• /
• pp.145-156
• /
• 2019

In this study, we have developed and evaluated an information extracting module based on the named entity recognition technique. For the given purpose in this paper, the module was designed to apply to the problem dealing with extraction of postal address information from arbitrary documents without any prior knowledge on the document layout. From the perspective of information technique practice, our approach can be said as a probabilistic n-gram (bi- or tri-gram) method which is a generalized technique compared with a uni-gram based keyword matching. It is the main difference between our approach and the conventional methods adopted in natural language processing that applying sentence detection, tokenization, and POS tagging recursively rather than applying the models sequentially. The test results with approximately two thousands documents are presented at this paper.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.8
• /
• pp.32-41
• /
• 1999

In this paper, an inversion method using chirp signals and two near field receivers is proposed. Inversion problems can be formulated into the probabilistic models composed of signals, a forward model and noise. Forward model to simulate chirp signals is chosen to be the source-wavelet-convolution planewave modeling method. The solution of the inversion problem is defined by a posteriori pdf. The wavelet matching technique, using weighted least-squares fitting, estimates the sediment sound-speed and thickness on which determination of the ranges for a priori uniform distribution is based. The genetic algorithm can be applied to a global optimization problem to find a maximum a posteriori solution for determined a priori search space. Here the object function is defined by an L₂norm of the difference between measured and modeled signals. The observed signals can be separated into a set of two signals reflected from the upper and lower boundaries of a sediment. The separation of signals and successive applications of the genetic algorithm optimization process reduce the search space, therefore improving the inversion results. Not only the marginal pdf but also the statistics are calculated by numerical evaluation of integrals using the samples selected during importance sampling process of the genetic algorithm. The examples applied here show that, for synthetic data with noise, it is possible to carry out an inversion for sedimentary layers using the proposed inversion method.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.1
• /
• pp.35-45
• /
• 2007

The log data collected from mobile devices contains diverse meaningful and practical personal information. However, this information is usually ignored because of its limitation of memory capacity, computation power and analysis. We propose a novel method that detects landmarks of meaningful information for users by analyzing the log data in distributed modules to overcome the problems of mobile environment. The proposed method adopts Bayesian probabilistic approach to enhance the inference accuracy under the uncertain environments. The new cooperative modularization technique divides Bayesian network into modules to compute efficiently with limited resources. Experiments with artificial data and real data indicate that the result with artificial data is amount to about 84% precision rate and about 76% recall rate, and that including partial matching with real data is about 89% hitting rate.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.3
• /
• pp.178-185
• /
• 2005

This paper presents a new music identification method using probabilistic and dynamic characteristics of melody. The propo3ed method uses pitch and MFCC parameters as feature vectors for the characteristics of music notes and represents melody pattern by pitch histogram and temporal sequence of codeword indices. We also propose a new pattern matching method for the hybrid method. We have tested the proposed algorithm in small (drama OST) and broad (1.005 popular songs) search spaces. The experimental results on search areas of OST and 1,005 popular songs showed better performance of the proposed method over conventional methods. We achieved the performance improvement of average $9.9\%$ and $10.2\%$ in error reduction rate on each search area.