• Title/Summary/Keyword: k-Cliques

Search Result 12, Processing Time 0.017 seconds

Region Decision Using Modified ICM Method (변형된 ICM 방식에 의한 영역판별)

  • Hwang Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.5 s.311
    • /
    • pp.37-44
    • /
    • 2006
  • In this paper, a new version of the ICM method(MICM, modified ICM) in which the contextual information is modelled by Markov random fields (MRF) is introduced. To extract the feature, a new local MRF model with a fitting block neighbourhood is proposed. This model selects contextual information not only from the relative intensity levels but also from the geometrically directional position of neighbouring cliques. Feature extraction depends on each block's contribution to the local variance. They discriminates it into several regions, for example context and background. Boundaries between these regions are also distinctive. The proposed algerian performs segmentation using directional block fitting procedure which confines merging to spatially adjacent elements and generates a partition such that pixels in unified cluster have a homogeneous intensity level. From experiment with ink rubbed copy images(Takbon, 拓本), this method is determined to be quite effective for feature identification. In particular, the new algorithm preserves the details of the images well without over- and under-smoothing problem occurring in general iterated conditional modes (ICM). And also, it may be noted that this method is applicable to the handwriting recognition.

Patent data analysis using clique analysis in a keyword network (키워드 네트워크의 클릭 분석을 이용한 특허 데이터 분석)

  • Kim, Hyon Hee;Kim, Donggeon;Jo, Jinnam
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.5
    • /
    • pp.1273-1284
    • /
    • 2016
  • In this paper, we analyzed the patents on machine learning using keyword network analysis and clique analysis. To construct a keyword network, important keywords were extracted based on the TF-IDF weight and their association, and network structure analysis and clique analysis was performed. Density and clustering coefficient of the patent keyword network are low, which shows that patent keywords on machine learning are weakly connected with each other. It is because the important patents on machine learning are mainly registered in the application system of machine learning rather thant machine learning techniques. Also, our results of clique analysis showed that the keywords found by cliques in 2005 patents are the subjects such as newsmaker verification, product forecasting, virus detection, biomarkers, and workflow management, while those in 2015 patents contain the subjects such as digital imaging, payment card, calling system, mammogram system, price prediction, etc. The clique analysis can be used not only for identifying specialized subjects, but also for search keywords in patent search systems.