• Title/Summary/Keyword: Path extraction

Search Result 127, Processing Time 0.029 seconds

Extraction of Simplified Boundary In Binary Image (이진 영상에서의 단순화된 윤곽선 추출 방법)

  • 김성영
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.4
    • /
    • pp.34-39
    • /
    • 1999
  • In this paper, boundary extraction algorithm is suggested by removing boundary noises efficiently and simplifying object shape in binary image. To remove boundary noises, $2{times}2$ mask boundary extraction algorithm is modified . Proposed method is designed to generate a symmetric path for the parasitic branch noise and to analysis traced features on end point of noise. It can extract more simplified object boundary but preserve original object shape by combining white background color extraction result with foreground extraction result. The usefulness of the proposed method was proved through experiments with various binary images.

  • PDF

A Fast Flight-path Generation Algorithm for Virtual Colonoscopy System (가상 대장 내시경 시스템을 위한 고속 경로 생성 알고리즘)

  • 강동구;이재연;나종범
    • Journal of Biomedical Engineering Research
    • /
    • v.24 no.2
    • /
    • pp.77-82
    • /
    • 2003
  • Virtual colonoscopy is a non-invasive computerized procedure to detect polyps by examining the colon from a CT data set. To fly through the inside of colons. the extraction of a suitable flight-path is necessary to Provide the viewpoint and view direction of a virtual camera. However. manual path extraction by Picking Points is a very time-consuming and difficult task due 1,c, the long and complex shape of colon. Also, existing automatic methods are computationally complex. and tend to generate an improper and/or discontinuous path for complicated regions. In this paper, we propose a fast flight-path generation algorithm using the distance and order maps. The order map Provides all Possible directions of a path. The distance map assigns the Euclidean distance value from each inside voxel to the nearest background voxel. By jointly using these two maps. we can obtain a proper centerline regardless of thickness and curvature of an object. Also, we Propose a simple smoothing technique that guarantees not to collide with the surface of an object. The phantom and real colon data are used for experiments. Experimental results show that for a set of human colon data, the proposed algorithm can provide a smoothened and connected flight-path within a minute on an 800MHz PC. And it is proved that the obtained flight-Path provides successive volume-rendered images satisfactory for virtual navigation.

Extracting Information from XML Documents by Reverse Generating DTDs (DTD 역 구성을 통한 XML문서에서의 정보추출)

  • 정종석;오동익
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.2
    • /
    • pp.309-318
    • /
    • 2003
  • XML documents are widely used for exchanging information in the distributed computing environment. Here, actual information contained in the document can only be interpreted with the provision of a proper DTD. However, XML documents collected from the web nay not always be accompanied by corresponding DTD, so that it may not be easy to extract information from such sources. In this study, we reverse construct a DTD from DTU-unknown XML sources. We then use the DTD to extract information from XML inputs and to store it into the underlying DB. The DTD construction module developed is designed in such a way that, it scans input XML files in 1-path, where most other implementations use 2-path approach. The information extraction module provides clean Java programming interfaces as well, so that it can be easily integrated with other web applications.

  • PDF

Query-based Answer Extraction using Korean Dependency Parsing (의존 구문 분석을 이용한 질의 기반 정답 추출)

  • Lee, Dokyoung;Kim, Mintae;Kim, Wooju
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.3
    • /
    • pp.161-177
    • /
    • 2019
  • In this paper, we study the performance improvement of the answer extraction in Question-Answering system by using sentence dependency parsing result. The Question-Answering (QA) system consists of query analysis, which is a method of analyzing the user's query, and answer extraction, which is a method to extract appropriate answers in the document. And various studies have been conducted on two methods. In order to improve the performance of answer extraction, it is necessary to accurately reflect the grammatical information of sentences. In Korean, because word order structure is free and omission of sentence components is frequent, dependency parsing is a good way to analyze Korean syntax. Therefore, in this study, we improved the performance of the answer extraction by adding the features generated by dependency parsing analysis to the inputs of the answer extraction model (Bidirectional LSTM-CRF). The process of generating the dependency graph embedding consists of the steps of generating the dependency graph from the dependency parsing result and learning the embedding of the graph. In this study, we compared the performance of the answer extraction model when inputting basic word features generated without the dependency parsing and the performance of the model when inputting the addition of the Eojeol tag feature and dependency graph embedding feature. Since dependency parsing is performed on a basic unit of an Eojeol, which is a component of sentences separated by a space, the tag information of the Eojeol can be obtained as a result of the dependency parsing. The Eojeol tag feature means the tag information of the Eojeol. The process of generating the dependency graph embedding consists of the steps of generating the dependency graph from the dependency parsing result and learning the embedding of the graph. From the dependency parsing result, a graph is generated from the Eojeol to the node, the dependency between the Eojeol to the edge, and the Eojeol tag to the node label. In this process, an undirected graph is generated or a directed graph is generated according to whether or not the dependency relation direction is considered. To obtain the embedding of the graph, we used Graph2Vec, which is a method of finding the embedding of the graph by the subgraphs constituting a graph. We can specify the maximum path length between nodes in the process of finding subgraphs of a graph. If the maximum path length between nodes is 1, graph embedding is generated only by direct dependency between Eojeol, and graph embedding is generated including indirect dependencies as the maximum path length between nodes becomes larger. In the experiment, the maximum path length between nodes is adjusted differently from 1 to 3 depending on whether direction of dependency is considered or not, and the performance of answer extraction is measured. Experimental results show that both Eojeol tag feature and dependency graph embedding feature improve the performance of answer extraction. In particular, considering the direction of the dependency relation and extracting the dependency graph generated with the maximum path length of 1 in the subgraph extraction process in Graph2Vec as the input of the model, the highest answer extraction performance was shown. As a result of these experiments, we concluded that it is better to take into account the direction of dependence and to consider only the direct connection rather than the indirect dependence between the words. The significance of this study is as follows. First, we improved the performance of answer extraction by adding features using dependency parsing results, taking into account the characteristics of Korean, which is free of word order structure and omission of sentence components. Second, we generated feature of dependency parsing result by learning - based graph embedding method without defining the pattern of dependency between Eojeol. Future research directions are as follows. In this study, the features generated as a result of the dependency parsing are applied only to the answer extraction model in order to grasp the meaning. However, in the future, if the performance is confirmed by applying the features to various natural language processing models such as sentiment analysis or name entity recognition, the validity of the features can be verified more accurately.

Edge Extraction using Fuzzy Techniques in Coronary Artery Image (Fuzzy 기법을 이용한 관상동맥영상의 에지추출)

  • Kim, Seong-Hu;Lee, Ju-Won;Kim, Joo-Ho;Lee, Han-Wook;Jung, Won-Geun;Lee, Gun-Ki
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.3
    • /
    • pp.585-590
    • /
    • 2012
  • Coronary Intervention treatment has become the core that is the test of cardiac catheterization to conduct treatment with Coronary Arteriography. Operators must be careful in Coronary Intervention treatment because the stent is inserted into the point of narrowing of blood vessel. So, the operator must correctly recognize the path of blood vessel to deal with the problems which are damages and ruptures of blood vessel, and there would be some errors of finding the path of blood vessel by bad qualify of the image. Therefore in this paper, median filtering is conducted by preprocessing to evaluate the performance of the effect of noise of the image that affects quality of the image and Fuzzy Edge Extraction Techniques is tested by using Soble Edge Extraction Techniques to compare the performance with The Fuzzy Edge Extraction Techniques. In result, the performance, removing the noise and extracting the signal of Fuzzy Edge Extraction Techniques using median filtering, demonstrates the superiority.

SPONTANEOUS NORMAL ERUPTION OF PERMANENT TOOTH WITH ABNORMAL ERUPTION PATH (비정상적인 맹출 경로를 보이는 소구치의 자발적 맹출 유도)

  • Kim, Sang-Min;Park, Ho-Won;Lee, Ju-Hyun;Seo, Hyun-Woo
    • Journal of the korean academy of Pediatric Dentistry
    • /
    • v.38 no.1
    • /
    • pp.82-87
    • /
    • 2011
  • The pulp infection of primary tooth is often caused by dental caries or trauma. But, if it is not managed properly, it can be produce the periapical lesion. The periapical lesion can cause some complications such as enamel hypoplasia, displacement, root dilaceration and impaction. Treatment options of displaced permanent successor are clinical and radiological follow-up after extraction of primary teeth, surgical opening, orthodontic traction, transplantation and extraction. In these cases, the premolars with abnormal eruption path caused by periapical lesion of the primary tooth have shown successful spontaneous eruption just as a result of extraction of infected primary tooth and space maintenance.

The method for extraction of meaningful places based on behavior information of user (실생활 정보를 이용한 사용자의 의미 있는 장소 추출 방법)

  • Lee, Seung-Hoon;Kim, Bo-Keong;Yoon, Tae-Bok;Lee, Jee-Hyong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.4
    • /
    • pp.503-508
    • /
    • 2010
  • Recently, the advance of mobile devices has made various services possible beyond simple communication. One of services is the predicting the future path of users and providing the most suitable location based service based on the prediction results. Almost of these prediction methods are based on previous path data. Thus, calculating similarities between current location information and the previous trajectories for path prediction is an important operation. The collected trajectory data have a huge amount of location information generally. These information needs the high computational cost for calculating similarities. For reducing computational cost, the meaningful location based trajectory model approaches are proposed. However, most of the previous researches are considering only the physical information such as stay time and the distance for extracting the meaningful locations. Thus, they will probably ignore the characteristics of users for meaningful location extraction. In this paper, we suggest a meaningful location extracting and trajectory simplification approach considering the stay time, distance, and additionally interaction information of user. The method collects the location information using GPS device and interaction information between the user and the others. Using these data, the proposed method defines the proximity of the people who are related with the user. The system extracts the meaningful locations based on the calculated proximities, stay time and distance. Using the selected meaningful locations the trajectories are simplified. For verifying the usability of the proposed method, we collect the behavioral data of smart phone users. Using these data, we measure the suitability of meaningful location extraction method, and the accuracy of prediction approach based on simplified trajectories. Following these result, we confirmed the usability of proposed method.

New Methods for Correcting the Atmospheric Effects in Landsat Imagery over Turbid (Case-2) Waters

  • Ahn Yu-Hwan;Shanmugam P.
    • Korean Journal of Remote Sensing
    • /
    • v.20 no.5
    • /
    • pp.289-305
    • /
    • 2004
  • Atmospheric correction of Landsat Visible and Near Infrared imagery (VIS/NIR) over aquatic environment is more demanding than over land because the signal from the water column is small and it carries immense information about biogeochemical variables in the ocean. This paper introduces two methods, a modified dark-pixel substraction technique (path--extraction) and our spectral shape matching method (SSMM), for the correction of the atmospheric effects in the Landsat VIS/NIR imagery in relation to the retrieval of meaningful information about the ocean color, especially from Case-2 waters (Morel and Prieur, 1977) around Korean peninsula. The results of these methods are compared with the classical atmospheric correction approaches based on the 6S radiative transfer model and standard SeaWiFS atmospheric algorithm. The atmospheric correction scheme using 6S radiative transfer code assumes a standard atmosphere with constant aerosol loading and a uniform, Lambertian surface, while the path-extraction assumes that the total radiance (L/sub TOA/) of a pixel of the black ocean (referred by Antoine and Morel, 1999) in a given image is considered as the path signal, which remains constant over, at least, the sub scene of Landsat VIS/NIR imagery. The assumption of SSMM is nearly similar, but it extracts the path signal from the L/sub TOA/ by matching-up the in-situ data of water-leaving radiance, for typical clear and turbid waters, and extrapolate it to be the spatially homogeneous contribution of the scattered signal after complex interaction of light with atmospheric aerosols and Raleigh particles, and direct reflection of light on the sea surface. The overall shape and magnitude of radiance or reflectance spectra of the atmospherically corrected Landsat VIS/NIR imagery by SSMM appears to have good agreement with the in-situ spectra collected for clear and turbid waters, while path-extraction over turbid waters though often reproduces in-situ spectra, but yields significant errors for clear waters due to the invalid assumption of zero water-leaving radiance for the black ocean pixels. Because of the standard atmosphere with constant aerosols and models adopted in 6S radiative transfer code, a large error is possible between the retrieved and in-situ spectra. The efficiency of spectral shape matching has also been explored, using SeaWiFS imagery for turbid waters and compared with that of the standard SeaWiFS atmospheric correction algorithm, which falls in highly turbid waters, due to the assumption that values of water-leaving radiance in the two NIR bands are negligible to enable retrieval of aerosol reflectance in the correction of ocean color imagery. Validation suggests that accurate the retrieval of water-leaving radiance is not feasible with the invalid assumption of the classical algorithms, but is feasible with SSMM.

An Integration of Searching Area Extraction Scheme and Bi-directional Link Searching Algorithm for the Urban ATIS Application (도시부 ATIS 효율적 적용을 위한 탐색영역기법 및 양방향 링크탐색 알고리즘의 구현)

  • 이승환;최기주;김원길
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.3
    • /
    • pp.45-59
    • /
    • 1996
  • The shortest path algorithm for route guidance is implicitly required not only to support geometrical variations of transportation network such as U-TURN or P-TURN but to efficiency search reasonable routes in searching mechanism. The purpose of this paper is to integrate such two requirements ; that is, to allow U-TURN and P-TURN possibilities and to cut down searching time in locating routes between two points (origin and destination) in networks. We also propose a new type of link searching algorithm which can solve the limitation of vine building algorithm at consecutively left-turn prohibited intersections. The test site is a block of Gangnam road network that has some left-turn prohibited and allowed U-TURN intersections. Four models have been identified to be comparatively analyzed in terms of searching efficiency. The Models are as follows : (i) Model 1 - Link Searching Dijkstra Algorithm without Searching Area Extraction (SAE) ; (ii) Model 2 - Link Searching Dijkstra Algorithm with SAE ; (iii) Model 3 - Link Searching Bidirectional Dijkstra Algorithm without SAE ; and (iv) Model 4 - Link Searching Bidirectional Dijkstra Algorithm with SAE. The results of comparative evaluation show that Model 4 can effectively find optimum path faster than any other models as expected. Some discussions and future research agenda have been presented in the light of dynamic route guidance application of the urban ATIS.

  • PDF