• Title/Summary/Keyword: probabilistic matching

Search Result 43, Processing Time 0.025 seconds

Sensor Model Design of Range Sensor Based Probabilistic Localization for the Autonomous Mobile Robot (자율 주행 로봇의 확률론적 자기 위치 추정기법을 위해 거리 센서를 이용한 센서 모델 설계)

  • Kim, Kyung-Rock;Chung, Woo-Jin;Kim, Mun-Sang
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.27-29
    • /
    • 2004
  • This paper presents a sensor model design based on Monte Carlo Localization method. First, we define the measurement error of each sample using a map matching method by 2-D laser scanners and a pre-constructed grid-map of the environment. Second, samples are assigned probabilities due to matching errors from the gaussian probability density function considered of the sample's convergence. Simulation using real environment data shows good localization results by the designed sensor model.

  • PDF

Stereo Matching with Efficeient Belief Propagation Using Edge Detection (엣지 정보를 이용한 개선된 BP 기반의 스테레오 정합)

  • Choi, Jung-Hun;Na, In-Tae;Jeong, Hong
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.931-932
    • /
    • 2008
  • An implementation of modified stereo matching using efficient belief propagation(BP) algorithm is presented in this paper. Edges of the image were found using conventional edge detection algorithms. Resulting edge information is used to suppress propagation of wrong probabilistic information. Proposed method can effectively reduce errors that incurred by ambiguous scene properties.

  • PDF

Discriminative Training of Sequence Taggers via Local Feature Matching

  • Kim, Minyoung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.14 no.3
    • /
    • pp.209-215
    • /
    • 2014
  • Sequence tagging is the task of predicting frame-wise labels for a given input sequence and has important applications to diverse domains. Conventional methods such as maximum likelihood (ML) learning matches global features in empirical and model distributions, rather than local features, which directly translates into frame-wise prediction errors. Recent probabilistic sequence models such as conditional random fields (CRFs) have achieved great success in a variety of situations. In this paper, we introduce a novel discriminative CRF learning algorithm to minimize local feature mismatches. Unlike overall data fitting originating from global feature matching in ML learning, our approach reduces the total error over all frames in a sequence. We also provide an efficient gradient-based learning method via gradient forward-backward recursion, which requires the same computational complexity as ML learning. For several real-world sequence tagging problems, we empirically demonstrate that the proposed learning algorithm achieves significantly more accurate prediction performance than standard estimators.

A Probabilistic Modeling of Feature Distribution Between Corresponding minutiae in Fingerprint Matching (동일 특징점의 확률분포 모델링을 이용한 지문정합)

  • 전성욱;이응봉;류춘우;김학일
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10d
    • /
    • pp.613-615
    • /
    • 2002
  • 특징점 기반의 지문 정합 시스템은 동일 특징점의 검색을 통하여, 주어진 두 지문의 동일 여부를 결정하는 것을 목적으로 하고 있다. 정합과정의 검색 단계에서 동일 특징점으로 결정된 두 특징점간 거리 및 각도차의 분포를 확률적으로 모델링함으로써, 검색된 동일 특징점의 신뢰도를 높이고자 하였으며 전체적으로 지문 정합시스템의 성능향상을 목적으로 한다. 본 논문에서는 확률기법을 사용한 동일 특징점 유사도 산출 방법과 이를 통한 지문의 동일여부 결정방법을 제시하였으며 구현결과, EER의 경우 2.64%에서 0.78%로 70%의 감소효과를 얻을 수 있었다.

  • PDF

Advanced Big Data Analysis, Artificial Intelligence & Communication Systems

  • Jeong, Young-Sik;Park, Jong Hyuk
    • Journal of Information Processing Systems
    • /
    • v.15 no.1
    • /
    • pp.1-6
    • /
    • 2019
  • Recently, big data and artificial intelligence (AI) based on communication systems have become one of the hottest issues in the technology sector, and methods of analyzing big data using AI approaches are now considered essential. This paper presents diverse paradigms to subjects which deal with diverse research areas, such as image segmentation, fingerprint matching, human tracking techniques, malware distribution networks, methods of intrusion detection, digital image watermarking, wireless sensor networks, probabilistic neural networks, query processing of encrypted data, the semantic web, decision-making, software engineering, and so on.

Harmonics Assessment for an Electric Railroad Feeding System using Moments Matching Method (모멘트 정합 방법(Moment Matching Method)을 이용한 전기철도 급전시스템의 고조파 평가)

  • Lee, Jun-Kyong;Lee, Seung-Hyuk;Kim, Jin-O
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.1
    • /
    • pp.1-7
    • /
    • 2007
  • Generally, an electric railroad feeding system has many problems due to the different characteristics in contrast with a load of general three-phase AC electric power system. One of them is harmonics problem caused by the switching device existing in the feeding system, and moreover, the time-varying dynamic loads of rail way is inherently another cause to increase this harmonics problem. In Korea power systems, the electric railroad feeding system is directly supplied from the substation of KEPCO. Therefore, if voltages fluctuation or unbalanced voltages are created by the voltage and current distortion or voltage drop during operation, it affects directly the source of supply. The trainloads of electric railway system have non-periodic but iterative harmonic characteristics as operating condition, because the electric characteristic of the electric railroad feeding system is changed by physical conditions of the each trainload. According to the traditional study, the estimation of harmonics has been performed by deterministic way using the steady state data at the specific time. This method is easy to analyze harmonics, but it has limits in some cases which needs an assessment of dynamic load and reliability. Therefore, this paper proposes the probabilistic estimation method, moments matching method(MW) in order to overcome the drawback of deterministic method. In this paper, distributions for each harmonics are convolved to obtain the moments and cumulants of TDD(Total Demand Distortion), and this can be generalized for any number of trains. For the case study, the electric railway system of LAT(Intra Airport Transit) in Incheon International Airport is modeled using PSCAD/EMTDC dynamic simulator. The raw data of harmonics for the moments matching method is acquired from simulation of the LAT model.

Probabilistic Method to reduce the Deviation of WPS Positioning Estimation (WPS 측위 편차폭을 줄이기 위한 확률적 접근법)

  • Kim, Jae-Hoon;Kang, Suk-Yon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7B
    • /
    • pp.586-594
    • /
    • 2012
  • The drastic growth of mobile communication and spreading of smart phone make the significant attention on Location Based Service. The one of most important things for vitalization of LBS is the accurate estimating position for mobile object. Focusing on AP's probabilistic position estimation, we develop an AP distribution map and new pattern matching algorithm for position estimation. The developed approaches can strengthen the advantages of Radio fingerprint based Wi-Fi Positioning System, especiall on the algorithms and data handling. Compared on the existing approaches of fingerprint pattern matching algorithm, we achieve the comparable higher performance on both of average error of estimation and deviation of errors. Furthermore all fingerprint data have been harvested from the actual measurement of radio fingerprint of Seoul, Kangnam area. This can approve the practical usefulness of proposed methodology.

On the edge independence number of a random (N,N)-tree

  • J. H. Cho;Woo, Moo-Ha
    • Bulletin of the Korean Mathematical Society
    • /
    • v.33 no.1
    • /
    • pp.119-126
    • /
    • 1996
  • In this paper we study the asymptotic behavior of the edge independence number of a random (n,n)-tree. The tools we use include the matrix-tree theorem, the probabilistic method and Hall's theorem. We begin with some definitions. An (n,n)_tree T is a connected, acyclic, bipartite graph with n light and n dark vertices (see [Pa92]). A subset M of edges of a graph is called independent(or matching) if no two edges of M are adfacent. A subset S of vertices of a graph is called independent if no two vertices of S are adjacent. The edge independence number of a graph T is the number $\beta_1(T)$ of edges in any largest independent subset of edges of T. Let $\Gamma(n,n)$ denote the set of all (n,n)-tree with n light vertices labeled 1, $\ldots$, n and n dark vertices labeled 1, $\ldots$, n. We give $\Gamma(n,n)$ the uniform probability distribution. Our aim in this paper is to find bounds on $\beta_1$(T) for a random (n,n)-tree T is $\Gamma(n,n)$.

  • PDF

Seismic performance assessment of NPP concrete containments considering recent ground motions in South Korea

  • Kim, Chanyoung;Cha, Eun Jeong;Shin, Myoungsu
    • Nuclear Engineering and Technology
    • /
    • v.54 no.1
    • /
    • pp.386-400
    • /
    • 2022
  • Seismic fragility analysis, a part of seismic probabilistic risk assessment (SPRA), is commonly used to establish the relationship between a representative property of earthquakes and the failure probability of a structure, component, or system. Current guidelines on the SPRA of nuclear power plants (NPPs) used worldwide mainly reflect the earthquake characteristics of the western United States. However, different earthquake characteristics may have a significant impact on the seismic fragility of a structure. Given the concern, this study aimed to investigate the effects of earthquake characteristics on the seismic fragility of concrete containments housing the OPR-1000 reactor. Earthquake time histories were created from 30 ground motions (including those of the 2016 Gyeongju earthquake) by spectral matching to the site-specific response spectrum of Hanbit nuclear power plants in South Korea. Fragility curves of the containment structure were determined under the linear response history analysis using a lumped-mass stick model and 30 ground motions, and were compared in terms of earthquake characteristics. The results showed that the median capacity and high confidence of low probability of failure (HCLPF) tended to highly depend on the sustained maximum acceleration (SMA), and increase when using the time histories which have lower SMA compared with the others.

Bayesian Inferrence and Context-Tree Matching Method for Intelligent Services in a Mobile Environment (모바일 환경에서의 지능형 서비스를 위한 베이지안 추론과 컨텍스트 트리 매칭방법)

  • Kim, Hee-Taek;Min, Jun-Ki;Cho, Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.2
    • /
    • pp.144-152
    • /
    • 2009
  • To provide intelligent service in mobile environment, it needs to estimate user's intention or requirement, through analyzing context information of end-users such as preference or behavior patterns. In this paper, we infer context information from uncertain log stored in mobile device. And we propose the inference method of end-user's behavior to match context information with service, and the proposed method is based on context-tree. We adopt bayesian probabilistic method to infer uncertain context information effectively, and the context-tree is constructed to utilize non-numerical context which is hard to handled with mathematical method. And we verify utility of proposed method by appling the method to intelligent phone book service.