• Title/Summary/Keyword: 그리딩

Search Result 8, Processing Time 0.025 seconds

Analysis of the Stepped-Impedance Low Pass Filter using Sub-Gridding Finite-Difference Time-Domain Method (서브 그리딩 유한 차분 시간 영역법을 이용한 계단형 임피던스 저역 통과 필터 해석)

  • 노범석;최재훈;이상선;정제명
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.13 no.2
    • /
    • pp.217-224
    • /
    • 2002
  • One of the dominant aspects governing the accuracy of the FDTD method is the size of the spatial increment used in the model. The effect of having reduced cell size is to increase the computational time and memory requirements. To overcome these problems, sub-gridding technique can be used. This implies that the application of a sub-grid cell would provide improved accuracy without increasing the run time and computer resources considerably. In this paper, we describe the three dimensional sub-gridding technique that is applied to model only the fine structure region of interest. The detailed solution procedure is described and some test geometries were solved by both uniform grid and sub-grid models to validate the suggested approach. While keeping the accuracy, the computational time becomes 6 times faster and the memory requirement is reduced by a factor of 2.5 comparing to the conventional FDTD approach.

A Perfect Gridding Algorithm for DNA Chip Image Processing (DNA칩 이미지 처리를 위한 완전 그리딩 알고리즘)

  • 김판규;정호열;조환규
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10b
    • /
    • pp.392-394
    • /
    • 2000
  • 본 논문에서는 DNA칩 이미지 처리시스템을 위한 완전 그리딩 알고리즘을 제안한다. DNA칩 이미지를 분석하여 처리할 수 있는 많은 DNA칩 분석 시스템이 있다. 하지만 이전의 시스템들은 정확한 이미지 처리를 통한 올바른 유전자 발현정보를 얻기 위해서 많은 사용자의 개입이 필요한 단점이 있었다. 본 논문에서는 사용자의 개입이 없는 정확한 자동 이미지 처리를 위해서, $\varepsilon$-그래프 모델링 기법을 제시하고, MBR, Mass, Geometry 등 세가지 종류의 반점(spot) 중심을 이용한 완전 그리딩 알고리즘을 제안한다. 제시된 이미지 처리 기술은 완전한 자동 DNA칩 분석 시스템으로, 사용자의 개입없이도 정확한 DNA칩 위치 정보를 얻을 수 있다.

  • PDF

A Hierarchical Grid Alignment Algorithm for Microarray Image Analysis (마이크로어레이 이미지 분석을 위한 계층적 그리드 정렬 알고리즘)

  • Chun Bong-Kyung;Jin Hee-Jeong;Lee Pyung-Jun;Cho Hwan-Gue
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.2
    • /
    • pp.143-153
    • /
    • 2006
  • Microarray which enables us to obtain hundreds and thousands of expression of gene or genotype at once is an epoch-making technology in comparative analysis of genes. First of all, we have to measure the intensity of each gene in an microarray image from the experiment to gain the expression level of each gene. But it is difficult to analyze the microarray image in manual because it has a lot of genes. Meta-gridding method and various auto-gridding methods have been proposed for this, but thew still have some problems. For example, meta-gridding requires manual-work due to some variations in spite of experiment in same microarray, and auto-gridding nay not carried out fully or correctly when an image has a lot of noises or is lowly expressed. In this article, we propose Hierarchical Grid Alignment algorithm for new methodology combining meta-gridding method with auto-gridding method. In our methodology, we necd a meta-grid as an input, and then align it with the microarray image automatically. Experimental results show that the proposed method serves more robust and reliable gridding result than the previous methods. It is also possible for user to do more reliable batch analysis by using our algorithm.

A Parallel Approach for Accurate and High Performance Gridding of 3D Point Data (3D 점 데이터 그리딩을 위한 고성능 병렬처리 기법)

  • Lee, Changseop;Rizki, Permata Nur Miftahur;Lee, Heezin;Oh, Sangyoon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.8
    • /
    • pp.251-260
    • /
    • 2014
  • 3D point data is utilized in various industry domains for its high accuracy to the surface information of an object. It is substantially utilized in geography for terrain scanning and analysis. Generally, 3D point data need to be changed by Gridding which produces a regularly spaced array of z values from irregularly spaced xyz data. But it requires long processing time and high resource cost to interpolate grid coordination. Kriging interpolation in Gridding has attracted because Kriging interpolation has more accuracy than other methods. However it haven't been used frequently since a processing is complex and slow. In this paper, we presented a parallel Gridding algorithm which contains Kriging and an application of grid data structure to fit MapReduce paradigm to this algorithm. Experiment was conducted for 1.6 and 4.3 billions of points from Airborne LiDAR files using our proposed MapReduce structure and the results show that the total execution time is decreased more than three times to the convention sequential program on three heterogenous clusters.

An Analysis of the Unequal Wilkinson Power Divider Using the Finite-Difference Time-Domain (FDTD) Method (시간 영역 유한 차분법(FDTD)을 이용한 비등분 Wilkinson 전력 분배기의 해석)

  • 김광조;김형훈;김형동
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.9 no.6
    • /
    • pp.715-724
    • /
    • 1998
  • The FDTD(Finite-Difference Time-Domain) method is applied to analyze an unequal Wilkinson power divider. Unequal Wilkinson power divider has complex structures and the standard Yee Cell modeling method is not appropriate. In this paper, nonuniform gridding and subcell modeling are used to accurately analyze the characteristics of an unequal Wilkinson power divider. For comparison, the numerical results are presented with those from a commercial circuit simulator.

  • PDF

Three-dimensional Chemical Shift Imaging with PRESS Excitation and Spiral Readouts (점구분 분광술 여기 방식과 나선형 판독경사를 이용한 삼차원 화학적 변위 영상법의 개발)

  • Kim, Dong-Hyun
    • Investigative Magnetic Resonance Imaging
    • /
    • v.12 no.1
    • /
    • pp.27-32
    • /
    • 2008
  • Purpose : We developed a 3D CSI (chemical shift imaging) sequence that uses the PRESS (point resolved spectroscopy) excitation scheme and spiral-based readout gradients. Materials and Methods : We implemented constant-density spirals ($32{\times}32$ matrix, $24{\times}24\;cm$ FOV) which use analytic equations to enable real-time prescription on the scanner. In-vivo data from the brain were collected and reconstructed using the gridding algorithm. Results : Data illustrate that with our imaging sequence, the benefits of the PRESS technique, which include elimination of lipid artifacts, remain intact while flexible scan time versus resolution tradeoffs can be achieved using the constant-density spirals. Volumetric high resolution 3D CSI covering 5760 cm3 could be obtained in 12.5 minutes. Conclusion : Spiral-based readout gradients offer a flexible tradeoff between scan time versus resolution. By combining this feature with PRESS based excitation, efficient methods of volumetric spectroscopic imaging can be accomplished by obtaining whole brain coverage while eliminating lipid contamination.

  • PDF

Development of Gridding Robot System for Genome Research (유전체 연구용 그리딩 로봇 시스템의 개발)

  • 추창환;서동현;김찬수;박지영;임용표;김기대
    • Journal of Biosystems Engineering
    • /
    • v.26 no.4
    • /
    • pp.391-398
    • /
    • 2001
  • A robot system for clone replication and gridding, which is a preliminary state of the genome research, was developed and evaluated its performance. This gridding robot system consisted of 1) a gridding heat that replicated the clone, 2) a manipulator, as a part of body of robot, which transferred the gridding head along x-, y-, z-axis, 3) a well plate arranging board, 4) a sterilization unit, and 5) a control unit. Performance of the system was evaluated with 1) repeatability of the robot system, 2) clone replication efficiency, 3) time requirement of the replication, and 4) sterilization efficiency. The repeatability error of the robot system showed 0.219 mm and 0.094 mm in the direction of x- and y-axis, respectively. The success rate of the clone replication with the gridding head was 100% on the membrane filter. The time required for the replication was four minutes and fifty-five seconds from the four 96 well plates to a 384 well plate meanwhile the required time with well experienced hand labor was three minutes thirty-five seconds. The gridding operation of clone could not be done by hand labor and the required time with robot system for the gridding on the membrance filter with the control program 5$\times$5: 1 copy and 384 gridding pins was twenty minutes and twenty-five seconds. The efficiency of the sterilization was considered to be satisfactory since no growth of fungi was found around the area of replication in the membrane filter.

  • PDF