• Title/Summary/Keyword: 데이터 영역

Search Result 4,385, Processing Time 0.038 seconds

Validity Review of Mixed Convection Flow Regime Map in Vertical Cylinders (수직 원형관내 혼합대류 유동영역지도의 유효성 검토)

  • Kang, Gyeong-Uk;Kim, Hyoung-Jin;Yoon, Si-Tae;Chung, Bum-Jin
    • Journal of Energy Engineering
    • /
    • v.23 no.3
    • /
    • pp.27-35
    • /
    • 2014
  • The existing flow regime map on mixed convection in vertical cylinders was investigated through an analysis of original literatures and its re-formation. The original literatures related to the existing map were reviewed. Using the investigated data and heat transfer correlations, the map was redrawn independently, and compared with the existing map. The redrawn map showed that mixed convection regime was not curved lines but straight lines and the transition regime was unable to be reproduced. Unlike the existing map with a little data, there are lots of data in the redrawn map. The reviews revealed that the existing map used the data selectively among the experimental and theoretical results, and a detailed description for lines forming mixed convection and transition regime was not provided. While considerable studies on mixed convection have been performed since that of Metais and Eckert, the existing map has still been used as the best method to distinguish natural, forced and mixed convection regime.

Development of Solar Activity Monitoring Map and Its Application to the Space Weather Forecasting System

  • Shin, Junho;Moon, Yong-Jae;Lee, Jae-Hyung
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.42 no.2
    • /
    • pp.83.1-83.1
    • /
    • 2017
  • SDO/AIA와 STEREO/EUVI 두 태양 관측 위성의 193 파장에서의 실시간 영상 이미지를 이용하여 Stonyhurst Heliographic Map을 작성하고 각각의 위성 데이터 분석으로부터 얻어진 결과들을 종합적으로 재구성하여 태양 전면 및 후면의 활동 영역들을 동시에 표출하는 태양 활동성 지도 (Solar Activity Monitoring Map)를 작성하는 프로그램을 제작하였다. 태양 활동성 지도를 이용하여 태양 후면에서의 극자외선 밝기 분포를 경도에 따라 등간격으로 나눈 후 각 지역에서 얻은 극자외선량을 실시간으로 갱신하며 그래프를 작성하는 프로그램도 함께 제작하고 그로부터 태양 후면 영역의 활동성이 향후 지구에 어떠한 방식으로 영향을 미칠 것인지 사전에 예측 가능하도록 하였다. 또한 태양 후면에서 발생하는 활동 영역 (Active Region) 및 코로나홀들을 자동적으로 탐지한 후 실시간으로 변화 정도를 추적 및 기록하는 프로그램도 제작하였다. 태양 활동성 지도는 193 파장에서 뿐만 아니라 두 위성이 공유하는 세 개의 동일 혹은 유사한 파장대 (171,211,304)에서 얻어진 데이터들도 함께 이용하여 각 파장대에서 독립적으로 작성하였는데 이로 인해 각각의 에너지 영역의 특성에 해당하는 태양 활동성을 동시에 표출하는 것이 가능하게 되었다. 이러한 프로그램을 이용하여 태양 후면에서의 활동 영역의 발생 및 변화를 사전에 인식하고 그들이 태양 전면으로 나타나기 전에 대비할 수 있는 예보 장치가 마련되었다. 본 연구들과 더불어 극자외선 영역에서의 태양 활동성 조사로부터 플레어의 발생을 예측할 수 있을 것인지의 가능성 여부를 타진하기 위해 과거 극자외선 관측에서 얻어진 활동 영역들의 데이터와 연 X-선 관측으로부터 기록된 플레어 발생 여부의 상관관계를 조사하는 연구가 현재 진행 중이다. 이러한 연구로부터 긍정적인 결과가 도출되는 경우 극자외선 영역에서의 관측 데이터를 이용하여 플레어 발생 가능성을 예측하는 새로운 방법을 제시하는 것이 가능해질 것이다.

  • PDF

CNVR Detection Reflecting the Properties of the Reference Sequence in HLA Region (레퍼런스 시퀀스의 특성을 고려한 HLA 영역에서의 CNVR 탐지)

  • Lee, Jong-Keun;Hong, Dong-Wan;Yoon, Jee-Hee
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.712-716
    • /
    • 2010
  • In this paper, we propose a novel shape-based approach to detect CNV regions (CNVR) by analyzing the coverage graph obtained by aligning the giga-sequencing data onto the human reference sequence. The proposed algorithm proceeds in two steps: a filtering step and a post-processing step. In the filtering step, it takes several shape parameters as input and extracts candidate CNVRs having various depth and width. In the post-processing step, it revises the candidate regions to make up for errors potentially included in the reference sequence and giga-sequencing data, and filters out regions with high ratio of GC-contents, and returns the final result set from those candidate CNVRs. To verify the superiority of our approach, we performed extensive experiments using giga-sequencing data publicly opened by "1000 genome project" and verified the accuracy by comparing our results with those registered in DGV database. The result revealed that our approach successfully finds the CNVR having various shapes (gains or losses) in HLA (Human Leukocyte Antigen) region.

Relevance Feedback using Region-of-interest in Retrieval of Satellite Images (위성영상 검색에서 사용자 관심영역을 이용한 적합성 피드백)

  • Kim, Sung-Jin;Chung, Chin-Wan;Lee, Seok-Lyong;Kim, Deok-Hwan
    • Journal of KIISE:Databases
    • /
    • v.36 no.6
    • /
    • pp.434-445
    • /
    • 2009
  • Content-based image retrieval(CBIR) is the retrieval technique which uses the contents of images. However, in contrast to text data, multimedia data are ambiguous and there is a big difference between system's low-level representation and human's high-level concept. So it doesn't always mean that near points in the vector space are similar to user. We call this the semantic-gap problem. Due to this problem, performance of image retrieval is not good. To solve this problem, the relevance feedback(RF) which uses user's feedback information is used. But existing RF doesn't consider user's region-of-interest(ROI), and therefore, irrelevant regions are used in computing new query points. Because the system doesn't know user's ROI, RF is proceeded in the image-level. We propose a new ROI RF method which guides a user to select ROI from relevant images for the retrieval of complex satellite image, and this improves the accuracy of the image retrieval by computing more accurate query points in this paper. Also we propose a pruning technique which improves the accuracy of the image retrieval by using images not selected by the user in this paper. Experiments show the efficiency of the proposed ROI RF and the pruning technique.

Expanded Object Localization Learning Data Generation Using CAM and Selective Search and Its Retraining to Improve WSOL Performance (CAM과 Selective Search를 이용한 확장된 객체 지역화 학습데이터 생성 및 이의 재학습을 통한 WSOL 성능 개선)

  • Go, Sooyeon;Choi, Yeongwoo
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.10 no.9
    • /
    • pp.349-358
    • /
    • 2021
  • Recently, a method of finding the attention area or localization area for an object of an image using CAM (Class Activation Map)[1] has been variously carried out as a study of WSOL (Weakly Supervised Object Localization). The attention area extraction from the object heat map using CAM has a disadvantage in that it cannot find the entire area of the object by focusing mainly on the part where the features are most concentrated in the object. To improve this, using CAM and Selective Search[6] together, we first expand the attention area in the heat map, and a Gaussian smoothing is applied to the extended area to generate retraining data. Finally we train the data to expand the attention area of the objects. The proposed method requires retraining only once, and the search time to find an localization area is greatly reduced since the selective search is not needed in this stage. Through the experiment, the attention area was expanded from the existing CAM heat maps, and in the calculation of IOU (Intersection of Union) with the ground truth for the bounding box of the expanded attention area, about 58% was improved compared to the existing CAM.

Hyper-Rectangle Based Prototype Selection Algorithm Preserving Class Regions (클래스 영역을 보존하는 초월 사각형에 의한 프로토타입 선택 알고리즘)

  • Baek, Byunghyun;Euh, Seongyul;Hwang, Doosung
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.9 no.3
    • /
    • pp.83-90
    • /
    • 2020
  • Prototype selection offers the advantage of ensuring low learning time and storage space by selecting the minimum data representative of in-class partitions from the training data. This paper designs a new training data generation method using hyper-rectangles that can be applied to general classification algorithms. Hyper-rectangular regions do not contain different class data and divide the same class space. The median value of the data within a hyper-rectangle is selected as a prototype to form new training data, and the size of the hyper-rectangle is adjusted to reflect the data distribution in the class area. A set cover optimization algorithm is proposed to select the minimum prototype set that represents the whole training data. The proposed method reduces the time complexity that requires the polynomial time of the set cover optimization algorithm by using the greedy algorithm and the distance equation without multiplication. In experimented comparison with hyper-sphere prototype selections, the proposed method is superior in terms of prototype rate and generalization performance.

Performance Measurement Model for Open Big Data Platform (공공 빅데이터 플랫폼 성과평가 모형)

  • RHEE, Gyuyurb;Park, Sang Cheol;Ryoo, Sung Yul
    • Knowledge Management Research
    • /
    • v.21 no.4
    • /
    • pp.243-263
    • /
    • 2020
  • The purpose of this study is to propose the performance measurement model for open big data platform. In order to develop the performance measurement model, we have integrated big data reference architecture(NIST 2018) with performance prism model(Neely et al. 2001) in the platform perspective of open big data. Our proposed model consists of five key building blocks for measuring performance of open data platform as follows: stakeholder contribution, big data governance capabilities, big data service capabilities, big data IT capabilities, and stakeholder satisfaction. In addition, our proposed model have twenty four evaluation indices and seventy five measurement items. We believe that our model could offer both research and practical implications for relevant research.

Scene Text Detection with Length of Text (글자 수 정보를 이용한 이미지 내 글자 영역 검출 방법)

  • Yeong Woo Kim;Wonjun Kim
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2022.11a
    • /
    • pp.177-179
    • /
    • 2022
  • 딥러닝의 발전과 함께 합성곱 신경망 기반의 이미지 내 글자 영역 검출(Scene Text Detection) 방법들이 제안됐다. 그러나 이러한 방법들은 대부분 데이터셋이 제공하는 단어의 위치 정보만을 이용할 뿐 글자 영역이 갖는 고유한 정보인 글자 수는 활용하지 않는다. 따라서 본 논문에서는 글자 수 정보를 학습하여 효과적으로 이미지 내의 글자 영역을 검출하는 모듈을 제안한다. 제안하는 방법은 간단한 합성곱 신경망으로 구성된 이미지 내 글자 영역 검출 모델에 글자 수를 예측하는 모듈을 추가하여 학습을 진행하였다. 글자 영역 검출 성능 평가에 널리 사용되는 ICDAR 2015 데이터셋을 통해 기존 방법 대비 성능이 향상됨을 보였고, 글자 수 정보가 글자 영역을 감지하는 데 유효한 정보임을 확인했다.

  • PDF

Design of Volume Rendering System Using Remote Transfer to Resampled Data (리샘플링된 데이터의 원격 전송을 이용한 볼륨 렌더링 시스템의 설계)

  • 박상훈
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10b
    • /
    • pp.661-663
    • /
    • 2004
  • 여러 분야에서 산출되고 있는 볼륨 데이터의 크기는 점점 더 방대해지고 있는 추세에 있으며, 이러한 방대한 데이터 속에 내재된 유용한 정보를 알아내기 위해 데이터 전체가 아니라 어떤 특정 부분을 효과적으로 액세스하고 이를 고해상도로 가시화 하는 것은 매우 중요한 문제로 대두되고 있다. 본 논문에서는 방대한 볼륨 데이터 가시화를 위친 개발된 클라이언트-서버 기반의 볼륨 렌더링 시스템에 대해 소개한다. 범용 PC상에서 GUI형태로 구현된 클라이언트는 데이터 서버와 접속하여 특정 영역에 대한 부분 볼륨 데이터를 요청하는데, 이때 데이터 서버가 전송하는 데이터는 클라이언트의 텍스춰 메모리 크기보다 작거나 같도록 리샘플링된 것이며, 클라이언트는 이를 받아 실시간 렌더링을 수행한다. 또한 특정 영역에 대한 고해상도의 영상을 원하는 경우, 클라이언트는 렌더링 서버와 접속하여 다양한 형태의 고화질 영상을 얻을 수 있다. 본 시스템은 매우 방대한 크기의 데이터에 대한 가시화가 필수적인 자연과학, 의학, 공학 분야에서 효과적으로 응용될 수 있을 것이다.

  • PDF

Detecting Uncertain Boundary Algorithm using Constrained Delaunay Triangulation (제한된 델로네 삼각분할을 이용한 공간 불확실한 영역 탐색 기법)

  • Cho, Sunghwan
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.2
    • /
    • pp.87-93
    • /
    • 2014
  • Cadastral parcel objects as polygons are fundamental dataset which represent land administration and management of the real world. Thus it is necessary to assure topological seamlessness of cadastral datasets which means no overlaps or gaps between adjacent parcels. However, the problem of overlaps or gaps are frequently found due to non-coinciding edges between adjacent parcels. These erroneous edges are called uncertain edges, and polygons containing at least one uncertain edge are called uncertain polygons. In this paper, we proposed a new algorithm to efficiently search parcels of uncertain polygons between two adjacent cadastral datasets. The algorithm first selects points and polylines around adjacent datasets. Then the Constrained Delaunay Triangulation (CDT) is applied to extract triangles. These triangles are tagged by the number of the original cadastral datasets which intersected with the triangles. If the tagging value is zero, the area of triangles mean gaps, meanwhile, the value is two, the area means overlaps. Merging these triangles with the same tagging values according to adjacency analysis, uncertain edges and uncertain polygons could be found. We have performed experimental application of this automated derivation of partitioned boundary from a real land-cadastral dataset.