• Title/Summary/Keyword: 증가분 기반 계산

Search Result 53, Processing Time 0.026 seconds

고굴절률 PECVD SiNx 박막의 성장 및 그 표면특성 분석

  • Chu, Seong-Jung;Jeong, Jae-Uk;Jeong, Ui-Seok;Park, Jeong-Ho
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2011.02a
    • /
    • pp.121-122
    • /
    • 2011
  • 광도파로 기반 센서의 성능을 개선시키기 위해서는 코어와 클래딩 층의 굴절률 차를 크게 하여 표면감도를 향상시켜야 한다. 이를 위해 센서용 광도파로 코어 층을 위한 고굴절률 SiNx 박막을 플라즈마 화학기상증착(PECVD, plasma enhanced chemical vapor deposition)법을 이용하여 성장한 후 그 표면특성을 분석하였다. 이 때 플라즈마 화학기상증착 공정 조건 중 NH3 가스를 제외하여 Si 성분이 많은 고굴절률 SiNx 박막의 성장을 유도하고 He/SiH4 가스유량비를 0에서 100까지 변화시켜 SiNx 박막의 표면거칠기를 제어하였다. Si기판 위에 SiNx 박막을 10분 성장 후 BOE(buffered oxide etchant)로 선택식각하여 그 박막두께를 alpha step으로 측정하는 방법으로 He/SiH4 가스유량비 조건별 박막성장률을 계산하였다. 그 결과 He/SiH4 가스유량비 증가함에 따라 박막성장률이 33 nm/min에서 19 nm/min으로 선형적인 감소함을 알 수 있었다. 박막두께가 190 nm가 되도록 He/SiH4 가스유량비 조건별 SiNx 박막을 성장한 후 그 표면특성을 AFM (atomic force microscope)으로 관찰하였다. 이를 통해 He/SiH4 가스유량비가 50일 때 SiNx 박막의 표면거칠기가 최소가 됨을 알 수 있었다.

  • PDF

Makeup transfer by applying a loss function based on facial segmentation combining edge with color information (에지와 컬러 정보를 결합한 안면 분할 기반의 손실 함수를 적용한 메이크업 변환)

  • Lim, So-hyun;Chun, Jun-chul
    • Journal of Internet Computing and Services
    • /
    • v.23 no.4
    • /
    • pp.35-43
    • /
    • 2022
  • Makeup is the most common way to improve a person's appearance. However, since makeup styles are very diverse, there are many time and cost problems for an individual to apply makeup directly to himself/herself.. Accordingly, the need for makeup automation is increasing. Makeup transfer is being studied for makeup automation. Makeup transfer is a field of applying makeup style to a face image without makeup. Makeup transfer can be divided into a traditional image processing-based method and a deep learning-based method. In particular, in deep learning-based methods, many studies based on Generative Adversarial Networks have been performed. However, both methods have disadvantages in that the resulting image is unnatural, the result of makeup conversion is not clear, and it is smeared or heavily influenced by the makeup style face image. In order to express the clear boundary of makeup and to alleviate the influence of makeup style facial images, this study divides the makeup area and calculates the loss function using HoG (Histogram of Gradient). HoG is a method of extracting image features through the size and directionality of edges present in the image. Through this, we propose a makeup transfer network that performs robust learning on edges.By comparing the image generated through the proposed model with the image generated through BeautyGAN used as the base model, it was confirmed that the performance of the model proposed in this study was superior, and the method of using facial information that can be additionally presented as a future study.

Separation of Uranium(VI) and Vanadium(V) from Sulfuric Acid Media by Amine Based Extractants through Liquid-liquid Extraction Technique (황산 용액으로부터 아민계 추출제의 액-액 추출법에 의한 우라늄(VI)과 바나듐(V)의 분리)

  • Jeon, Jong-Hyuk;Lee, Jin-Young;Kim, Joon Soo;Yoon, Ho-Sung;Jyothi, Rajesh Kumar
    • Resources Recycling
    • /
    • v.30 no.4
    • /
    • pp.64-74
    • /
    • 2021
  • The importance of uranium metal is growing day by day in light of its increasing global demand for fulfilling societal needs through atomic power programs. Considering the high demand for uranium, it is necessary to find innovative hydrometallurgical techniques to separate uranium from other associated elements, especially vanadium. This study deals with the separation of uranium(VI) and vanadium(V) from sulfuric acid solutions using commercial amine-based extractants diluted in kerosene. The concentrations of the sulfuric acid solutions ranged from 0.005 to 5.0 mol/L. The effect of extractant concentration ranging from 0.005 to 0.2 mol/L was studied. The temperature was maintained at 25℃ and the experiment was performed for 30 min at an aqueous: organic phase ratio of 1 (A:O = 1:1). The calculated separation factors (SFs) are presented and comparisons are made among all the experiments.

Fast Partition Decision Using Rotation Forest for Intra-Frame Coding in HEVC Screen Content Coding Extension (회전 포레스트 분류기법을 이용한 HEVC 스크린 콘텐츠 화면 내 부호화 조기분할 결정 방법)

  • Heo, Jeonghwan;Jeong, Jechang
    • Journal of Broadcast Engineering
    • /
    • v.23 no.1
    • /
    • pp.115-125
    • /
    • 2018
  • This paper presents a fast partition decision framework for High Efficiency Video Coding (HEVC) Screen Content Coding (SCC) based on machine learning. Currently, the HEVC performs quad-tree block partitioning process to achieve optimal coding efficiency. Since this process requires a high computational complexity of the encoding device, the fast encoding process has been studied as determining the block structure early. However, in the case of the screen content video coding, it is difficult to apply the conventional early partition decision method because it shows different partition characteristics from natural content. The proposed method solves the problem by classifying the screen content blocks after partition decision, and it shows an increase of 3.11% BD-BR and 42% time reduction compared to the SCC common test condition.

A Study on the Underwater Channel Model based on a High-Order Finite Difference Method using GPUs (그래픽 프로세서를 이용한 고차 유한 차분식 기반 수중채널모델 연구)

  • Bae, Ho Seuk;Kim, Won-Ki;Son, Su-Uk;Ha, Wansoo
    • Journal of the Korea Society for Simulation
    • /
    • v.30 no.1
    • /
    • pp.11-20
    • /
    • 2021
  • As unmanned underwater systems have recently emerged, a high-speed underwater channel modeling technique, which is one of the most important techniques in the system, has received a lot of attention. In this paper, we proposed a high-speed sound propagation model and verified the applicability through quantitative performance analyses. We used a high-order finite difference method (FDM) for wave propagation modeling in the water, and a domain decomposition method was adopted using multiple general-purpose graphics processing units (GPUs) to increase the calculation efficiency. We compared the results of the model we proposed with the analytic solution in the half-infinite media and results of the Virtual Timeseries Experiment (VirTEX) model, which is based on the ray method. Finally, we analyzed the performance of the model quantitatively using numerical examples. Through quantitative analyses of the improvement in computational performance, we confirmed that the computational speed increases linearly as the number of GPUs increases. The computation times are increased by 2 times and 8 times, respectively, when the domain size of computation and the maximum frequency are doubled. We expect that the proposed high-speed underwater channel modeling technique is able to contribute to the enhancement of national defense as an underwater communication channel model and analysis tool to develop the underwater communication technique for the unmanned underwater system.

Parallel Algorithm for Optimal Stack Filters on MCC and CCC (MCC 및 CCC에서의 최적 스택 필터를 위한 병렬 알고리즘)

  • Jeon, Byeong-Mun;Jeong, Chang-Seong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.10
    • /
    • pp.1185-1193
    • /
    • 1999
  • 최적 스택 필터는 시그널 또는 영상의 임의의 특성 정보를 보존하고자 하는 요구조건에 의해 강제된 구조적 제약 하에서 최대의 잡음제거 효과를 얻을 수 있다. 그리고 임계치 분할 특성과 양의 부울 함수에 기반한 이진 영역에서의 처리 특성은 이 필터가 높은 병렬성을 갖고 있음을 보여준다. 본 논문에서는 두 개의 병렬 계산 모델 MCC(Mesh-Connected Computer)와 CCC(Cube-Connected Computer)에서 최적 스택 필터를 위한 1차원 병렬 알고리즘을 개발한다. 최적 스택 필터의 실행 시간은 주로 이진 median 연산에 의해 결정되고 본 논문에서 제안된 알고리즘은 선형 분리성에 의해 이 연산을 구현한다. 이를 바탕으로, M 레벨의 1-D 시그널의 길이가 L이고 윈도우 폭이 N이라고 가정할 때, 제안된 알고리즘은 {{{{root M times root M`` MCC에서 O(L sqrt{M}`) 시간에 그리고 M 개의 PE를 갖는 CCC에서 O(L log M)시간에 수행될 수 있다. 또한 잡음을 더욱 효과적으로 제거하기 위해 윈도우 폭 N을 증가시킬 때, 제안된 병렬 알고리즘의 계산 시간은 일정하게 유지됨을 보인다.Abstract An optimal stack filter achieves the maximum noise attenuation under the structural constraints imposed by the requirement of preserving certain signal or image features. And the filter provides a high parallelism due to the principles of threshold decomposition and binary processing based on positive Boolean functions(PBFs). In this paper, we develop an one-dimensional parallel algorithm for the optimal stack filter on two parallel computation models, MCC(Mesh-Connected Computer) and CCC(Cube-Connected Computer). The running time of the optimal stack filter depends mainly on the binary median operation and our algorithm realizes this operation by the linear separability. Based on this scheme, our parallel algorithm can be performed in {{{{O(L sqrt{M}`) MCC and inO(L log M) time on CCC with M PEs, when the length of M``-valued 1-D signal is L`` and window width is N`` Also, we show that the computation time of our parallel algorithm keeps constant when the window width N increases in order to achieve the best noise attenuation.

A Study on GPU-based Iterative ML-EM Reconstruction Algorithm for Emission Computed Tomographic Imaging Systems (방출단층촬영 시스템을 위한 GPU 기반 반복적 기댓값 최대화 재구성 알고리즘 연구)

  • Ha, Woo-Seok;Kim, Soo-Mee;Park, Min-Jae;Lee, Dong-Soo;Lee, Jae-Sung
    • Nuclear Medicine and Molecular Imaging
    • /
    • v.43 no.5
    • /
    • pp.459-467
    • /
    • 2009
  • Purpose: The maximum likelihood-expectation maximization (ML-EM) is the statistical reconstruction algorithm derived from probabilistic model of the emission and detection processes. Although the ML-EM has many advantages in accuracy and utility, the use of the ML-EM is limited due to the computational burden of iterating processing on a CPU (central processing unit). In this study, we developed a parallel computing technique on GPU (graphic processing unit) for ML-EM algorithm. Materials and Methods: Using Geforce 9800 GTX+ graphic card and CUDA (compute unified device architecture) the projection and backprojection in ML-EM algorithm were parallelized by NVIDIA's technology. The time delay on computations for projection, errors between measured and estimated data and backprojection in an iteration were measured. Total time included the latency in data transmission between RAM and GPU memory. Results: The total computation time of the CPU- and GPU-based ML-EM with 32 iterations were 3.83 and 0.26 see, respectively. In this case, the computing speed was improved about 15 times on GPU. When the number of iterations increased into 1024, the CPU- and GPU-based computing took totally 18 min and 8 see, respectively. The improvement was about 135 times and was caused by delay on CPU-based computing after certain iterations. On the other hand, the GPU-based computation provided very small variation on time delay per iteration due to use of shared memory. Conclusion: The GPU-based parallel computation for ML-EM improved significantly the computing speed and stability. The developed GPU-based ML-EM algorithm could be easily modified for some other imaging geometries.

GIS based Development of Module and Algorithm for Automatic Catchment Delineation Using Korean Reach File (GIS 기반의 하천망분석도 집수구역 자동 분할을 위한 알고리듬 및 모듈 개발)

  • PARK, Yong-Gil;KIM, Kye-Hyun;YOO, Jae-Hyun
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.20 no.4
    • /
    • pp.126-138
    • /
    • 2017
  • Recently, the national interest in environment is increasing and for dealing with water environment-related issues swiftly and accurately, the demand to facilitate the analysis of water environment data using a GIS is growing. To meet such growing demands, a spatial network data-based stream network analysis map(Korean Reach File; KRF) supporting spatial analysis of water environment data was developed and is being provided. However, there is a difficulty in delineating catchment areas, which are the basis of supplying spatial data including relevant information frequently required by the users such as establishing remediation measures against water pollution accidents. Therefore, in this study, the development of a computer program was made. The development process included steps such as designing a delineation method, and developing an algorithm and modules. DEM(Digital Elevation Model) and FDR(Flow Direction) were used as the major data to automatically delineate catchment areas. The algorithm for the delineation of catchment areas was developed through three stages; catchment area grid extraction, boundary point extraction, and boundary line division. Also, an add-in catchment area delineation module, based on ArcGIS from ESRI, was developed in the consideration of productivity and utility of the program. Using the developed program, the catchment areas were delineated and they were compared to the catchment areas currently used by the government. The results showed that the catchment areas were delineated efficiently using the digital elevation data. Especially, in the regions with clear topographical slopes, they were delineated accurately and swiftly. Although in some regions with flat fields of paddles and downtowns or well-organized drainage facilities, the catchment areas were not segmented accurately, the program definitely reduce the processing time to delineate existing catchment areas. In the future, more efforts should be made to enhance current algorithm to facilitate the use of the higher precision of digital elevation data, and furthermore reducing the calculation time for processing large data volume.

Parallelization of Raster GIS Operations Using PC Clusters (PC 클러스터를 이용한 래스터 GIS 연산의 병렬화)

  • 신윤호;박수홍
    • Spatial Information Research
    • /
    • v.11 no.3
    • /
    • pp.213-226
    • /
    • 2003
  • With the increasing demand of processing massive geographic data, conventional GISs based on the single processor architecture appear to be problematic. Especially, performing complex GIS operations on the massive geographic data is very time consuming and even impossible. This is due to the processor speed development does not keep up with the data volume to be processed. In the field of GIS, this PC clustering is one of the emerging technology for handling massive geographic data effectively. In this study, a MPI(Message Passing Interface)-based parallel processing approach was conducted to implement the existing raster GIS operations that typically requires massive geographic data sets in order to improve the processing capabilities and performance. Specially for this research, four types of raster CIS operations that Tomlin(1990) has introduced for systematic analysis of raster GIS operation. A data decomposition method was designed and implemented for selected raster GIS operations.

  • PDF

Design and Implementation of MPEG-21 Testbed (MPEG-21 Testbed의 설계 및 구현)

  • 손정화;권혁민;손현식;조영란;김만배
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2002.11a
    • /
    • pp.139-143
    • /
    • 2002
  • 1990 년대 후반부터 다양한 디지털 통신망을 이용하여 멀티미디어 컨텐츠 서비스가 가능하게 되었다. 하지만, 멀티미디어 컨텐츠의 전달 및 이용을 위한 기반 구조들의 독자적 발전 및 다양한 통합적 관리 체계 시스템으로 인해, 멀티미디어 컨텐츠 표현 방식의 호환성 문제, 혼재하는 네트워크 전달 방식과 단말 방식의 호환성 문제 등의 잠재적인 문제점이 발생한다. 이런 문제의 대안으로 현재 존재하는 기술 및 기반 구조들 사이의 연동을 통한 큰 프레임워크인 MPEG-21이 진행 중이다. MPEG-21 의 목표는 표준화 목표를 구체화하는 것부터 진행하여, 최종적으로 “다양한 네트워크 환경과 단말기에 있어서, 투명하고 통합적으로 멀티미디어 자원의 이용을 가능하게 하는 것”이다. 본 논문에서는 현재 표준화 작업이 진행 중인 MPEG-21 을 기반으로 하는 Testbed를 제안한다. Testbed는 server, client, DIA(Digital Item Adaptation) 의 세 모듈로 구성된다. Server 의 역할은 멀티미디어 컨텐츠를 Digital Item(DI)으로 생성하고, client 가 DI를 요구할 경우 DIA 모듈을 통해서 변환된 DI를 client 에게 제공한다. DIA 모듈은 server 에서 동작되며 client로부터 요청된 DI를 분석하고 client로부터 전송된 환경 정보를 이용하여 client 환경에 적합하게 변환된 (adapted) DI를 생성하는 것이 주 기능이다. Client 는 server 에 저장되어 있는 DI를 선택하고 user preference, terminal capability 등의 필요한 정보를 server로 전송한다. Testbed 에서는 스포츠 경기의 동영상, 정지 영상, 경기 내용 역사를 기록한 파일 등의 DI를 이용한다. 표현 언어는 XML이며, HTTP 기반의 Web 환경에서 구동되도록 설계된다.스템 사이에 의미 있는 데이터 전송, 지식 획득을 위해 정보 기술 분야에서 활용해야 할 영역으로 XML Web Services, Multi-agent Systems, 전문가 컴뮤니티를 위한 그룹웨어 연구 개발에 관해 사례 중심으로 발표한다.다 신선한 공기를 넣어 주었을 때는 배의 발달이 많이 늦어져 배양 3주째에 다른 처리보다 배의 수가 훨씬 적었다. 체세포배가 발달하는 동안에는 산소를 많이 요구하지 않으나 성숙하는 동안에는 산소를 많이 요구하는 것으로 생각된다.적인 것으로 나타났다. 다만, 곡선형은 물론 직선형에서도 열교환 튜브의 배치밀도, 튜브 길이 및 두께 등의 변화에 따른 최적화 연구가 수반되어야 할 것으로 판단된다.에서 제공된 API는 객체기반 제작/편집 도구에 응용되어 다양한 멀티미디어 컨텐츠 제작에 사용되었다.x factorization (NMF), generative topographic mapping (GTM)의 구조와 학습 및 추론알고리즘을소개하고 이를 DNA칩 데이터 분석 평가 대회인 CAMDA-2000과 CAMDA-2001에서 사용된cancer diagnosis 문제와 gene-drug dependency analysis 문제에 적용한 결과를 살펴본다.0$\mu$M이 적당하며, 초기배발달을 유기할 때의 효과적인 cysteamine의 농도는 25~50$\mu$M인 것으로 판단된다.N)A(N)/N을 제시하였다(A(N)=N에 대한 A값). 위의 실험식을 사용하여 헝가리산 Zempleni 시료(15%$S_{XRD}$)의 기본입자분포로부터 %$S_{XRD}$를 계산한 결과, 16%$S_{XRD}$의 결과값을 얻을 수 있었다. 따라서, 본 연구에서 도출한 관계식들이 유효함을 확인할 수 있었다.계식들이 유효함을 확인할 수 있었다.할 때 약간의 증가

  • PDF