• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3312-3334
• /
• 2015

In this paper, a mechanism for spectrum allocation in overlay cognitive radio networks is proposed. In overlay cognitive radio networks, the secondary users (SUs) must first sense the activity of primary users (PUs) to identify unoccupied spectrum bands. Based on their different contributions for the spectrum sensing, the SUs get payoffs that are computed by the fusion center (FC). The unoccupied bands will be auctioned and SUs are asked to bid using payoffs they earned or saved. Coalitions are allowed to form among SUs because each SU may only need a portion of the bands. We formulate the coalition forming process as a coalition forming game and analyze it by game theory. In the coalition formation game, debtor-creditor relationship may occur among the SUs because of their limited payoff storage. A debtor asks a creditor for payoff help, and in return provides the creditor with a portion of transmission time to relay data for the creditor. The negotiations between debtors and creditors can be modeled as a Bayesian game because they lack complete information of each other, and the equilibria of the game is investigated. Theoretical analysis and numerical results show that the proposed auction yields data rate improvement and certain fairness among all SUs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1200-1215
• /
• 2023

With the development of IoT and artificial intelligence, location-based services are getting more and more attention. For solving the current problem that indoor positioning error is large and generalization is poor, this paper proposes a Model Stacking Algorithm for Indoor Positioning System using WiFi fingerprinting. Firstly, we adopt a model stacking method based on Bayesian optimization to predict the location of indoor targets to improve indoor localization accuracy and model generalization. Secondly, Taking the predicted position based on model stacking as the observation value of particle filter, collaborative particle filter localization based on model stacking algorithm is realized. The experimental results show that the algorithm can control the position error within 2m, which is superior to KNN, GBDT, Xgboost, LightGBM, RF. The location accuracy of the fusion particle filter algorithm is improved by 31%, and the predicted trajectory is close to the real trajectory. The algorithm can also adapt to the application scenarios with fewer wireless access points.

• Nuclear Engineering and Technology
• /
• v.54 no.11
• /
• pp.4209-4214
• /
• 2022

Precise modelling of the interaction of ions with materials is important for many applications including material characterization, ion implantation in devices, thermonuclear fusion, hadron therapy, secondary particle production (e.g. neutron), etc. In this study, a new approach using the Geant4 toolkit in combination with the Bayesian regularization (BR) learning algorithm of the feed-forward neural network (FFNN) is developed to estimate the range of ions in materials accurately and quickly. The different incident ions at different energies are interacted with the target materials. The Geant4 is utilized to model the interactions and to calculate the range of the ions. Afterward, the appropriate architecture of the FFNN-BR with the relevant input features is utilized to learn the modelled ranges and to estimate the new ranges for the new cases. The notable achievements of the proposed approach are: 1- The range of ions in different materials is given as quickly as possible and the time required for estimating the ranges can be neglected (i.e. less than 0.01 s by a typical personal computer). 2- The proposed approach can generalize its ability for estimating the new untrained cases. 3- There is no need for a pre-made lookup table for the estimation of the range values.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.75-88
• /
• 2008

This paper presents a spatial-level nonparametric multi-focus image fusion technique based on kernel estimates of input image blocks' underlying class-conditional probability density functions. Image fusion is approached as a classification task whose posterior class probabilities, P($wi{\mid}Bikl$), are calculated with likelihood density functions that are estimated from the training patterns. For each of the C input images Ii, the proposed method defines i classes wi and forms the fused image Z(k,l) from a decision map represented by a set of $P{\times}Q$ blocks Bikl whose features maximize the discriminant function based on the Bayesian decision principle. Performance of the proposed technique is evaluated in terms of RMSE and Mutual Information (MI) as the output quality measures. The width of the kernel functions, ${\sigma}$, were made to vary, and different kernels and block sizes were applied in performance evaluation. The proposed scheme is tested with C=2 and C=3 input images and results exhibited good performance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.40-48
• /
• 2007

This paper presents a novel texture segmentation method using multilayer perceptron (MLP) networks and Markov random fields in multiscale Bayesian framework. Multiscale wavelet coefficients are used as input for the neural networks. The output of the neural network is modeled as a posterior probability. Texture classification at each scale is performed by the posterior probabilities from MLP networks and MAP (maximum a posterior) classification. Then, in order to obtain the more improved segmentation result at the finest scale, our proposed method fuses the multiscale MAP classifications sequentially from coarse to fine scales. This process is done by computing the MAP classification given the classification at one scale and a priori knowledge regarding contextual information which is extracted from the adjacent coarser scale classification. In this fusion process, the MRF (Markov random field) prior distribution and Gibbs sampler are used, where the MRF model serves as the smoothness constraint and the Gibbs sampler acts as the MAP classifier. The proposed segmentation method shows better performance than texture segmentation using the HMT (Hidden Markov trees) model and HMTseg.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4976-4994
• /
• 2018

The diffusion-based salient object detection methods have shown excellent detection results and more efficient computation in recent years. However, the current diffusion-based salient object detection methods still have disadvantage of detecting the object appearing at the image boundaries and different scales. To address the above mentioned issues, this paper proposes a multi-scale diffusion-based salient object detection algorithm with background and objectness seeds. In specific, the image is firstly over-segmented at several scales. Secondly, the background and objectness saliency of each superpixel is then calculated and fused in each scale. Thirdly, manifold ranking method is chosen to propagate the Bayessian fusion of background and objectness saliency to the whole image. Finally, the pixel-level saliency map is constructed by weighted summation of saliency values under different scales. We evaluate our salient object detection algorithm with other 24 state-of-the-art methods on four public benchmark datasets, i.e., ASD, SED1, SED2 and SOD. The results show that the proposed method performs favorably against 24 state-of-the-art salient object detection approaches in term of popular measures of PR curve and F-measure. And the visual comparison results also show that our method highlights the salient objects more effectively.

• Journal of the Society of Naval Architects of Korea
• /
• v.57 no.3
• /
• pp.175-181
• /
• 2020

For the success of a structural integrity management, it is essential to acquire structural response data at some critical locations with limited number of sensors. In this study, the structural response of numerical model was estimated by data fusion approach based on the Kalman filter known as stochastic recursive filter. Firstly, transient direct analysis was conducted to calculate the acceleration and strain of the numerical standing beam model, then the noise signals were mixed to generate the numerical measurement signals. The acceleration measurement signal was provided to the Kalman filter as an information on the external load, and the displacement measurement, which was transformed from the strain measurement by using strain-displacement conversion relationship, was provided into the Kalman filter as an observation information. Finally, the Kalman filter estimated the displacement by combining both displacements calculated from each numerically measured signal, then the estimated results were compared with the results of the transient direct analysis.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.299-301
• /
• 2005

본 연구는 생체정보를 이용하여 개인을 인증하고 확인하기 위한 방법으로 기존 단일 생체인식 기법의 단점을 보완하기 위해 홍채와 얼굴을 이용한 다중생체인식(Multi-Modal Biometrics Recognition)기법을 연구하였다. 중국 홍채 데이터베이스 CASIA(Chinese Academy of Science)에 Gabor Wavelet과 FLDA(Fuzzy Linear Discriminant Analysis)를 사용하여 특징벡터를 획득하였으며, FERET(FERET(Face Recognition Technology) 얼굴영상데이터를 사용하여 FERET 연구에서 매우 우수한 성능을 보인 EBGM알고리듬으로 특징벡터를 획득하였다. 이로부터 얻어진 두 score 값에 대하여 다양한 균등화 과정을 시도해 보았으며, 등록자와 침입자를 구분하기 위한 Fusion Algorithm으로 Bayesian Classifier, Support vector machine, Fisher's linear discriminant를 사용하였다. 또한, 널리 사용되는 방법 중 Weighted Summation을 이용하여 다중생체인식의 성능을 비교해 보았다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.475-478
• /
• 2004

본 논문에서는 multistatic 소나망의 효과도 분석을 하였다. 특히 본 논문에서는 multistatic 소나망의 탐지 성능 분석을 통해 효용성을 알아보았다. Multistatic 소나망은 송/수신기가 분리된 일종의 다중 분산 센서 시스템으로, 최적의 탐지 성능을 갖기 위해서는 적절한 융합 규칙 및 센서 배치가 필요하다. 분산 센서 융합 기법으로 bayesian 결정 기법을 기반으로 한 융합 기법을 적용하였으며, 실제 해양 환경하에서의 탐지 성능 분석을 위해 개선된 bistatic 표적 강도 모델과 거리 종속 전송 손실 모델을 이용한 multistatic 소나망 탐지 모델을 제안하였다. 기존 소나망과의 모의 비교 실험을 통해 multistatic 소나망의 우수성을 입증하였다.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.4
• /
• pp.386-392
• /
• 1990

This paper discribes a sonar-based certainty grid, the probabilistic representation of the uncertain and incomplete sensor knowledge, for autonomous mobile robot navigation. We use sonar sensor range data to build a map of the robot's surroundings. This range data provides information about the location of the objects which may exist in front of the sensor. From this information, we can compute the probability of being occupied and that of being empty for each cell. In this paper, a new method using Bayesian formula is introduced, which enables us to overcome some difficulties of the Ad-Hoc formula that has been the only way of updating the grids. This new formula can be applied to other kinds of sensors as well as sonar sensor. The validity of this formula in the real world is verified through simulation and experiment. This paper also shows that a wide angle sensor such as sonar sensor can be used effectively to identify the empty area, and the simultaneous use of multiple sensors and fusion in a certainty grid can improve the quality of the map.