• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2339-2355
• /
• 2021

In this paper, a joint probabilistic data association algorithm based on loss function (LJPDA) is proposed so that the computation load and accuracy of the multi-target tracking algorithm can be guaranteed simultaneously. Firstly, data association is divided in to three cases based on the relationship among validation gates and the number of measurements in the overlapping area for validation gates. Also the contribution coefficient is employed for evaluating the contribution of a measurement to a target, and the loss function, which reflects the cost of the new proposed data association algorithm, is defined. Moreover, the equation set of optimal contribution coefficient is given by minimizing the loss function, and the optimal contribution coefficient can be attained by using the Newton-Raphson method. In this way, the weighted value of each target can be achieved, and the data association among measurements and tracks can be realized. Finally, we compare performances of LJPDA proposed and joint probabilistic data association (JPDA) algorithm via numerical simulations, and much attention is paid on real-time performance and estimation error. Theoretical analysis and experimental results reveal that the LJPDA algorithm proposed exhibits small estimation error and low computation complexity.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.12
• /
• pp.638-646
• /
• 2002

This paper presents an efficient algorithm for evaluating the Profit and revenue of generating units in a competitive electricity market based on the probabilistic production costing technique. The accurate evaluation of the profit and revenue of generating units for long-term perspectives is one of the most important issues in a competitive electricity market environment. For efficient calculation of the profit and revenue of generating units under the equivalent load duration curve(ELDC), a new approach to figure out the marginal plants and the corresponding market clearing prices during a time period in a probabilistic manner is developed. The mathematical formulation and illustrative application of the suggested method is presented.

• Journal of Information Processing Systems
• /
• v.11 no.4
• /
• pp.643-654
• /
• 2015

Face recognition under controlled settings, such as limited viewpoint and illumination change, can achieve good performance nowadays. However, real world application for face recognition is still challenging. In this paper, we propose using the combination of Affine Scale Invariant Feature Transform (SIFT) and Probabilistic Similarity for face recognition under a large viewpoint change. Affine SIFT is an extension of SIFT algorithm to detect affine invariant local descriptors. Affine SIFT generates a series of different viewpoints using affine transformation. In this way, it allows for a viewpoint difference between the gallery face and probe face. However, the human face is not planar as it contains significant 3D depth. Affine SIFT does not work well for significant change in pose. To complement this, we combined it with probabilistic similarity, which gets the log likelihood between the probe and gallery face based on sum of squared difference (SSD) distribution in an offline learning process. Our experiment results show that our framework achieves impressive better recognition accuracy than other algorithms compared on the FERET database.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.22 no.1
• /
• pp.1-10
• /
• 2019

In this paper, we propose the track initiation algorithm based on the weighted score for TWS radar tracking. This algorithm utilizes radar velocity information to calculate the probabilistic track score and applies the Non-Maximum-Suppression(NMS) to confirm the targets to track. This approach is understood as a modification of a conventional track initiation algorithm in a probabilistic manner. Also, we additionally apply the weighted Hough transform to compensate a measurement error, and it helps to improve the track detection probability. We designed the simulator in order to demonstrate the performance of the proposed track initiation algorithm. The simulation result show that the proposed algorithm, which reduces about 40 % of a false track probability, is better than the conventional algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.1
• /
• pp.119-131
• /
• 1988

Vehicle Scheduling Problem (VSP) is a generic name given to a whole class of problems involving the visiting of "stations" by "vehicles," where a time is associated with each activity. The studies performed to date have the common feature of a single objective while satisfying a set of restrictions and known customer supplies or demands. However, VSPs may involve relevant multiple objectives and probabilistic supplies or demands at stations, creating multicriteria stochastic VSPs. This paper proposes a heuristic algorithm based on goal programming approach to schedule the most satisfactory vehicle routes of a bicriteria VSP with probabilistic supplies at stations. The two relevant objectives are the minimization of the expected travel distance of vehicles and the minimization of the due time violation for collection service at stations by vehicles. The algorithm developed consists of three major stages. In the first stage, an artificial capacity of vehicle is determined, on the basis of decision maker's subjective estimates. The second one clusters a set of stations into subsets by applying an efficient cluster method developed. In the third one, the stations in each subset are scheduled by applying an iterative goal programming heuristic procedure to each cluster.

• Structural Engineering and Mechanics
• /
• v.17 no.3_4
• /
• pp.483-492
• /
• 2004

This paper presents an efficient algorithm for the estimation of damage location and severity in bridge structures using Probabilistic Neural Network (PNN). Generally, the Back Propagation Neural Network (BPNN)-based damage detection methods need a lot of training patterns for neural network learning process and the optimum architecture of a BPNN is selected by trial and error. In this paper, the PNN instead of the conventional BPNN is used as a pattern classifier. The modal properties of damaged structure are somewhat different from those of undamaged one. The basic idea of proposed algorithm is that the PNN classifies a test pattern which consists of the modal characteristics from damaged structure, how close it is to each training pattern which is composed of the modal characteristics from various structural damage cases. In this algorithm, two PNNs are sequentially used. The first PNN estimates the damage location using mode shape and the results of the first PNN are put into the second PNN for the damage severity estimation using natural frequency. The proposed damage assessment algorithm using the PNN is applied to a cable-stayed bridge to verify its applicability.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.6 no.4
• /
• pp.169-179
• /
• 2002

This paper presents an efficient algorithm for the estimation of damage location and severity in structure using Probabilistic Neural Network (PNN). Artificial neural network has been being used for damage assessment by many researchers, but there are still some barriers that must be overcome to improve its accuracy and efficiency. The major problems with the conventional neural network are the necessity of many training data for neural network learning and ambiguity in the relation of neural network architecture with convergence of solution. In this paper, PNN is used as a pattern classifier to overcome those problems in the conventional neural network. The basic idea of damage assessment algorithm proposed in this paper is that modal characteristics from a damaged structure are compared with the training patterns which represent the damage in specific element to determine how close it is to training patterns in terms of the probability from PNN. The training pattern that gives a maximum probability implies that the element used in producing the training pattern is considered as a damaged one. The proposed damage assessment algorithm using PNN is applied to a 2-span continuous beam model structure to verify the algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.36.5-36
• /
• 2001

Localization is one of the key problems in the navigation of autonomous mobile robots. The probabilistic Markov localization approaches offer a good mathematical framework to deal with the uncertainty of environment and sensor readings but their use for realtime applications is limited by their computational complexity. This paper aims to reduce the high computational cost associated with the probabilistic Markov localization algorithm. We propose a hybrid landmark-based localization method combining triangulation and probabilistic approaches, which can efficiently update position probability grid, while the probabilistic framework allows to make use of any available sensor data to refine robot´s belief about its current location. The simulation results show the effectiveness and robustness of the method.

• Steel and Composite Structures
• /
• v.20 no.6
• /
• pp.1345-1368
• /
• 2016

This paper presents the probabilistic-based assessment of composite steel-concrete structures through an innovative framework. This framework combines model identification and reliability assessment procedures. The paper starts by describing current structural assessment algorithms and the most relevant uncertainty sources. The developed model identification algorithm is then presented. During this procedure, the model parameters are automatically adjusted, so that the numerical results best fit the experimental data. Modelling and measurement errors are respectively incorporated in this algorithm. The reliability assessment procedure aims to assess the structure performance, considering randomness in model parameters. Since monitoring and characterization tests are common measures to control and acquire information about those parameters, a Bayesian inference procedure is incorporated to update the reliability assessment. The framework is then tested with a set of composite steel-concrete beams, which behavior is complex. The experimental tests, as well as the developed numerical model and the obtained results from the proposed framework, are respectively present.

• The Journal of Korea Robotics Society
• /
• v.9 no.4
• /
• pp.232-241
• /
• 2014

This paper proposes an underwater localization algorithm using probabilistic object recognition. It is organized as follows; 1) recognizing artificial objects using imaging sonar, and 2) localizing the recognized objects and the vehicle using EKF(Extended Kalman Filter) based SLAM. For this purpose, we develop artificial landmarks to be recognized even under the unstable sonar images induced by noise. Moreover, a probabilistic recognition framework is proposed. In this way, the distance and bearing of the recognized artificial landmarks are acquired to perform the localization of the underwater vehicle. Using the recognized objects, EKF-based SLAM is carried out and results in a path of the underwater vehicle and the location of landmarks. The proposed localization algorithm is verified by experiments in a basin.