• Title/Summary/Keyword: Conditional random field

Search Result 47, Processing Time 0.022 seconds

Railway Object Recognition Using Mobile Laser Scanning Data (모바일 레이저 스캐닝 데이터로부터 철도 시설물 인식에 관한 연구)

  • Luo, Chao;Jwa, Yoon Seok;Sohn, Gun Ho;Won, Jong Un;Lee, Suk
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.19 no.2
    • /
    • pp.85-91
    • /
    • 2014
  • The objective of the research is to automatically recognize railway objects from MLS data in which 9 key objects including terrain, track, bed, vegetation, platform, barrier, posts, attachments, powerlines are targeted. The proposed method can be divided into two main sub-steps. First, multi-scale contextual features are extracted to take the advantage of characterizing objects of interest from different geometric levels such as point, line, volumetric and vertical profile. Second, by considering contextual interactions amongst object labels, a contextual classifier is utilized to make a prediction with local coherence. In here, the Conditional Random Field (CRF) is used to incorporate the object context. By maximizing the object label agreement in the local neighborhood, CRF model could compensate the local inconsistency prediction resulting from other local classifiers. The performance of proposed method was evaluated based on the analysis of commission and omission error and shows promising results for the practical use.

Identification of flexible vehicle parameters on bridge using particle filter method

  • Talukdar, S.;Lalthlamuana, R.
    • Structural Engineering and Mechanics
    • /
    • v.57 no.1
    • /
    • pp.21-43
    • /
    • 2016
  • A conditional probability based approach known as Particle Filter Method (PFM) is a powerful tool for system parameter identification. In this paper, PFM has been applied to identify the vehicle parameters based on response statistics of the bridge. The flexibility of vehicle model has been considered in the formulation of bridge-vehicle interaction dynamics. The random unevenness of bridge has been idealized as non homogeneous random process in space. The simulated response has been contaminated with artificial noise to reflect the field condition. The performance of the identification system has been examined for various measurement location, vehicle velocity, bridge surface roughness factor, noise level and assumption of prior probability density. Identified vehicle parameters are found reasonably accurate and reconstructed interactive force time history with identified parameters closely matches with the simulated results. The study also reveals that crude assumption of prior probability density function does not end up with an incorrect estimate of parameters except requiring longer time for the iterative process to converge.

Slow Feature Analysis for Mitotic Event Recognition

  • Chu, Jinghui;Liang, Hailan;Tong, Zheng;Lu, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1670-1683
    • /
    • 2017
  • Mitotic event recognition is a crucial and challenging task in biomedical applications. In this paper, we introduce the slow feature analysis and propose a fully-automated mitotic event recognition method for cell populations imaged with time-lapse phase contrast microscopy. The method includes three steps. First, a candidate sequence extraction method is utilized to exclude most of the sequences not containing mitosis. Next, slow feature is learned from the candidate sequences using slow feature analysis. Finally, a hidden conditional random field (HCRF) model is applied for the classification of the sequences. We use a supervised SFA learning strategy to learn the slow feature function because the strategy brings image content and discriminative information together to get a better encoding. Besides, the HCRF model is more suitable to describe the temporal structure of image sequences than nonsequential SVM approaches. In our experiment, the proposed recognition method achieved 0.93 area under curve (AUC) and 91% accuracy on a very challenging phase contrast microscopy dataset named C2C12.

CRF-Based Figure/Ground Segmentation with Pixel-Level Sparse Coding and Neighborhood Interactions

  • Zhang, Lihe;Piao, Yongri
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.3
    • /
    • pp.205-214
    • /
    • 2015
  • In this paper, we propose a new approach to learning a discriminative model for figure/ground segmentation by incorporating the bag-of-features and conditional random field (CRF) techniques. We advocate the use of image patches instead of superpixels as the basic processing unit. The latter has a homogeneous appearance and adheres to object boundaries, while an image patch often contains more discriminative information (e.g., local image structure) to distinguish its categories. We use pixel-level sparse coding to represent an image patch. With the proposed feature representation, the unary classifier achieves a considerable binary segmentation performance. Further, we integrate unary and pairwise potentials into the CRF model to refine the segmentation results. The pairwise potentials include color and texture potentials with neighborhood interactions, and an edge potential. High segmentation accuracy is demonstrated on three benchmark datasets: the Weizmann horse dataset, the VOC2006 cow dataset, and the MSRC multiclass dataset. Extensive experiments show that the proposed approach performs favorably against the state-of-the-art approaches.

Probabilistic Analyrgis of Slope Stactility for Progressive Failure (진행성 파괴에 대한 사면안정의 확률론적 해석)

  • 김영수
    • Geotechnical Engineering
    • /
    • v.4 no.2
    • /
    • pp.5-14
    • /
    • 1988
  • A probabilistic model for the progressive failure in a homogeneous soil slope consisting of strain-softening material is presented. The local safety margin of any slice above failure surface is assumed to follow a normal distribution. Uncertainties of the shear strength along potential failure surface are expressed by one-dimensional random field models. In this paper, only the case where failure initiates at toe and propagates up to the crest is considerd. The joint distribution of the safety margin of any two adjacent slices above the failure surface is assumed to be bivariate normal. The overall probability of the sliding failure is expressed as a product of probabilities of a series of conditional el.eats. Finally, the developed procedure has been applied in a case study to yield the reliability of a cut slope.

  • PDF

TAKES: Two-step Approach for Knowledge Extraction in Biomedical Digital Libraries

  • Song, Min
    • Journal of Information Science Theory and Practice
    • /
    • v.2 no.1
    • /
    • pp.6-21
    • /
    • 2014
  • This paper proposes a novel knowledge extraction system, TAKES (Two-step Approach for Knowledge Extraction System), which integrates advanced techniques from Information Retrieval (IR), Information Extraction (IE), and Natural Language Processing (NLP). In particular, TAKES adopts a novel keyphrase extraction-based query expansion technique to collect promising documents. It also uses a Conditional Random Field-based machine learning technique to extract important biological entities and relations. TAKES is applied to biological knowledge extraction, particularly retrieving promising documents that contain Protein-Protein Interaction (PPI) and extracting PPI pairs. TAKES consists of two major components: DocSpotter, which is used to query and retrieve promising documents for extraction, and a Conditional Random Field (CRF)-based entity extraction component known as FCRF. The present paper investigated research problems addressing the issues with a knowledge extraction system and conducted a series of experiments to test our hypotheses. The findings from the experiments are as follows: First, the author verified, using three different test collections to measure the performance of our query expansion technique, that DocSpotter is robust and highly accurate when compared to Okapi BM25 and SLIPPER. Second, the author verified that our relation extraction algorithm, FCRF, is highly accurate in terms of F-Measure compared to four other competitive extraction algorithms: Support Vector Machine, Maximum Entropy, Single POS HMM, and Rapier.

Assessment of Slope Stability With the Uncertainty in Soil Property Characterization (지반성질 불확실성을 고려한 사면안정 해석)

  • 김진만
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2003.03a
    • /
    • pp.123-130
    • /
    • 2003
  • The estimation of key soil properties and subsequent quantitative assessment of the associated uncertainties has always been an important issue in geotechnical engineering. It is well recognized that soil properties vary spatially as a result of depositional and post-depositional processes. The stochastic nature of spatially varying soil properties can be treated as a random field. A practical statistical approach that can be used to systematically model various sources of uncertainty is presented in the context of reliability analysis of slope stability Newly developed expressions for probabilistic characterization of soil properties incorporate sampling and measurement errors, as well as spatial variability and its reduced variance due to spatial averaging. Reliability analyses of the probability of slope failure using the different statistical representations of soil properties show that the incorporation of spatial correlation and conditional simulation leads to significantly lower probability of failure than obtained using simple random variable approach.

  • PDF

Named Entity Recognition for Patent Documents Based on Conditional Random Fields (조건부 랜덤 필드를 이용한 특허 문서의 개체명 인식)

  • Lee, Tae Seok;Shin, Su Mi;Kang, Seung Shik
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.9
    • /
    • pp.419-424
    • /
    • 2016
  • Named entity recognition is required to improve the retrieval accuracy of patent documents or similar patents in the claims and patent descriptions. In this paper, we proposed an automatic named entity recognition for patents by using a conditional random field that is one of the best methods in machine learning research. Named entity recognition system has been constructed from the training set of tagged corpus with 660,000 words and 70,000 words are used as a test set for evaluation. The experiment shows that the accuracy is 93.6% and the Kappa coefficient is 0.67 between manual tagging and automatic tagging system. This figure is better than the Kappa coefficient 0.6 for manually tagged results and it shows that automatic named entity tagging system can be used as a practical tagging for patent documents in replacement of a manual tagging.

Study of oversampling algorithms for soil classifications by field velocity resistivity probe

  • Lee, Jong-Sub;Park, Junghee;Kim, Jongchan;Yoon, Hyung-Koo
    • Geomechanics and Engineering
    • /
    • v.30 no.3
    • /
    • pp.247-258
    • /
    • 2022
  • A field velocity resistivity probe (FVRP) can measure compressional waves, shear waves and electrical resistivity in boreholes. The objective of this study is to perform the soil classification through a machine learning technique through elastic wave velocity and electrical resistivity measured by FVRP. Field and laboratory tests are performed, and the measured values are used as input variables to classify silt sand, sand, silty clay, and clay-sand mixture layers. The accuracy of k-nearest neighbors (KNN), naive Bayes (NB), random forest (RF), and support vector machine (SVM), selected to perform classification and optimize the hyperparameters, is evaluated. The accuracies are calculated as 0.76, 0.91, 0.94, and 0.88 for KNN, NB, RF, and SVM algorithms, respectively. To increase the amount of data at each soil layer, the synthetic minority oversampling technique (SMOTE) and conditional tabular generative adversarial network (CTGAN) are applied to overcome imbalance in the dataset. The CTGAN provides improved accuracy in the KNN, NB, RF and SVM algorithms. The results demonstrate that the measured values by FVRP can classify soil layers through three kinds of data with machine learning algorithms.

Deep recurrent neural networks with word embeddings for Urdu named entity recognition

  • Khan, Wahab;Daud, Ali;Alotaibi, Fahd;Aljohani, Naif;Arafat, Sachi
    • ETRI Journal
    • /
    • v.42 no.1
    • /
    • pp.90-100
    • /
    • 2020
  • Named entity recognition (NER) continues to be an important task in natural language processing because it is featured as a subtask and/or subproblem in information extraction and machine translation. In Urdu language processing, it is a very difficult task. This paper proposes various deep recurrent neural network (DRNN) learning models with word embedding. Experimental results demonstrate that they improve upon current state-of-the-art NER approaches for Urdu. The DRRN models evaluated include forward and bidirectional extensions of the long short-term memory and back propagation through time approaches. The proposed models consider both language-dependent features, such as part-of-speech tags, and language-independent features, such as the "context windows" of words. The effectiveness of the DRNN models with word embedding for NER in Urdu is demonstrated using three datasets. The results reveal that the proposed approach significantly outperforms previous conditional random field and artificial neural network approaches. The best f-measure values achieved on the three benchmark datasets using the proposed deep learning approaches are 81.1%, 79.94%, and 63.21%, respectively.