• 제목/요약/키워드: Post-processing algorithm

검색결과 292건 처리시간 0.025초

광조형물의 표면 거칠기 저감을 위한 성형방향의 선정 (Selection of Build Orientation for Reducing Surface Roughness with Stereolithography Parts)

  • 안대건;김호찬;이석희
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1997년도 추계학술대회 논문집
    • /
    • pp.137-140
    • /
    • 1997
  • In general, stereolithography parts is not suitable for master pattern. Because of its bad surface roughness. Therefore, To reduce roughness it requires post-process that is depending on user skill and takes long time to do. This study aims to develop an expert system which can select an optimal build orientation, reduce roughness and shorten post-processing time. Genetic Algorithm was introduced for optimization. A simplified computation model was developed for real-time response. For accurate roughness estimation, mterpolation of experimental data was implemented.

  • PDF

퓨리에 후처리 보상 기법을 이용한 향상된 MELP 음성부호화기 (Improved MELP Coder Using Fourier Post Processing Compensation Method)

  • 고봉옥;김종교
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 2002년도 하계학술발표대회 논문집 제21권 1호
    • /
    • pp.195-198
    • /
    • 2002
  • This paper presents an improved MELP Coder using Fourier magnitude compensation method chosen the new 2.4 kbit/s U.S. federal Standard. Although the MELP is quite good, it has some distortion for low-pitch male speakers. An improved MELP coder includes a post processing for the fourier magnitude model that allows the MELP to reconstruct the lower frequency spectrum more accurately and improve the speech quality. In this new compensation algorithm, the harmonic magnitudes in the low frequencies are adaptively modified by removing the effect of the two filters. Also, the bit rate of the improved MELP coder is the same as that of the Federal Standard MELP coder. formal quality tests show that the improved MELP coder was preferred over the Federal Standard MELP coder by $80.8\%$.

  • PDF

MODf : 대규모 단백질 DB에서 효과적이고 빠르게 PTM을 동정하는 알고리즘 (MODf : An Effective and Fast Algorithm for Identification of PTM in Large Protein Sequence Database)

  • 신성호;박희진;백은옥
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2010년도 추계학술발표대회
    • /
    • pp.1834-1836
    • /
    • 2010
  • 프로테오믹스는 세포 안 또는 개체 안의 모든 단백질을 총체적으로 연구하는 분야이다. 단백질 동정은 단백질이 어떤 아미노산의 서열로 구성되었는지를 확인하는 것이다. 하지만 Post-translational modification과 같은 단백질 변형을 고려하게 되면 단백질 동정은 매우 어렵게 된다. $MOD^i$ 알고리즘은 단백질 동정을 할 때 Post-translational modification의 종류나 개수에 제한 없이 단백질 동정을 정확하게 수행한다. 하지만, 대용량 단백질 서열 데이터베이스를 사용하면 수행시간이 많이 걸리는 단점이 있다. 본 논문에서는 $MOD^i$를 보완하기 위해 대용량 데이터베이스에서 후보 단백질을 선정하는 알고리즘을 통해서 개선된 $MOD^f$ 알고리즘을 제안하고 Target-decoy search strategy를 적용하여 정확성을 분석한다. 후보 단백질 선정 알고리즘과 Target-decoy search strategy 적용 결과 $MOD^f$$MOD^i$에 비해 정확도를 희생하지 않으면서 수행속도는 약 2배 향상되었다.

하이퍼그래크 분할을 위한 재서열화 알고리즘 (Reordering Algorithm for Hypergraph Partitioning)

  • 김상진;윤태진;이창희;안광선
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제26권12호
    • /
    • pp.1548-1555
    • /
    • 1999
  • 본 논문에서는 하이퍼그래프의 {{{{k분 분할을 위한 서열화(vertex ordering) 알고리즘의 효율을 개선하기 위한 후처리 알고리즘인 재서열법을 소개한다. 제안된 알고리즘은 {{{{k분 분할을 위한 다양한 알고리즘에 쉽게 적용될 수 있다. 보통 초기 분할은 서열화를 기반으로 하는 알고리즘에 의해 형성된다. 그 후 제안된 알고리즘은 클러스터와 정점을 재배열하여 분할하는 과정을 반복함으로써 분할의 효율을 향상시켜간다. 이 방법을 여러 가지 그래프에 적용하여 향상된 결과를 얻었다.Abstract This paper addresses the post-processing algorithm for {{{{k-way hypergraph partitioning by using a cluster and vertex reordering method. The proposed algorithm applies to several {{{{k-way partitioning algorithm. Generally, the initial partition generating method is based on a vertex ordering algorithm. Our reordering algorithm construct an enhanced partitioning by iteratively partition the reodered clusters and vertices. Experimental results on several graphs demonstrate that reodering provides substantial enhancement.

Automatic Electronic Cleansing in Computed Tomography Colonography Images using Domain Knowledge

  • Manjunath, KN;Siddalingaswamy, PC;Prabhu, GK
    • Asian Pacific Journal of Cancer Prevention
    • /
    • 제16권18호
    • /
    • pp.8351-8358
    • /
    • 2016
  • Electronic cleansing is an image post processing technique in which the tagged colonic content is subtracted from colon using CTC images. There are post processing artefacts, like: 1) soft tissue degradation; 2) incomplete cleansing; 3) misclassification of polyp due to pseudo enhanced voxels; and 4) pseudo soft tissue structures. The objective of the study was to subtract the tagged colonic content without losing the soft tissue structures. This paper proposes a novel adaptive method to solve the first three problems using a multi-step algorithm. It uses a new edge model-based method which involves colon segmentation, priori information of Hounsfield units (HU) of different colonic contents at specific tube voltages, subtracting the tagging materials, restoring the soft tissue structures based on selective HU, removing boundary between air-contrast, and applying a filter to clean minute particles due to improperly tagged endoluminal fluids which appear as noise. The main finding of the study was submerged soft tissue structures were absolutely preserved and the pseudo enhanced intensities were corrected without any artifact. The method was implemented with multithreading for parallel processing in a high performance computer. The technique was applied on a fecal tagged dataset (30 patients) where the tagging agent was not completely removed from colon. The results were then qualitatively validated by radiologists for any image processing artifacts.

입체적인 데이터에서 애매성-프리 표면 재구성 (An Ambiguity-free Surface Construction from Volume Data)

  • 이의택;오광만;박규호
    • 한국컴퓨터그래픽스학회논문지
    • /
    • 제4권1호
    • /
    • pp.55-66
    • /
    • 1998
  • This paper presents a simple method for relieving the ambiguity problems within the sub-voxel based surface-fitting approach for the surface construction. ECB algorithm is proposed to avoid the ambiguity problem which is the root of the holes within the resulting polygon based approximation. The basic idea of our disambiguation strategy is the use of a set of predefined modeling primitives (we call SMP) which guarantees the topological consistency of resulted surface polygons. 20 SMPs are derived from the extension of the concept of the elementary modeling primitives in the CB algorithm [3], and fit one to five faces of them to the iso-surface crossing a cell with no further processing. A look-up table which has a surface triangle list is pre-calculated using these 20 SMPs. All of surface triangles in the table are from the faces of SMPs and are stored in the form of edge list on which vertices of each surface triangle are located. The resulted polygon based approximation is unique at every threshold value and its validity is guaranteed without considering the complicated problems such as average of density and postprocessing. ECB algorithm could be free from the need for the time consuming post-processing, which eliminates holes by revisiting every boundary cell. Through three experiments of surface construction from volume data, its capability of hole avoidance is showed.

  • PDF

그래픽처리장치를 이용한 레이놀즈 방정식의 수치 해석 가속화 (Accelerating Numerical Analysis of Reynolds Equation Using Graphic Processing Units)

  • 명훈주;강지훈;오광진
    • Tribology and Lubricants
    • /
    • 제28권4호
    • /
    • pp.160-166
    • /
    • 2012
  • This paper presents a Reynolds equation solver for hydrostatic gas bearings, implemented to run on graphics processing units (GPUs). The original analysis code for the central processing unit (CPU) was modified for the GPU by using the compute unified device architecture (CUDA). The red-black Gauss-Seidel (RBGS) algorithm was employed instead of the original Gauss-Seidel algorithm for the iterative pressure solver, because the latter has data dependency between neighboring nodes. The implemented GPU program was tested on the nVidia GTX580 system and compared to the original CPU program on the AMD Llano system. In the iterative pressure calculation, the implemented GPU program showed 20-100 times faster performance than the original CPU codes. Comparison of the wall-clock times including all of pre/post processing codes showed that the GPU codes still delivered 4-12 times faster performance than the CPU code for our target problem.

산업제어시스템의 이상 탐지 성능 개선을 위한 데이터 보정 방안 연구 (Research on Data Tuning Methods to Improve the Anomaly Detection Performance of Industrial Control Systems)

  • 전상수;이경호
    • 정보보호학회논문지
    • /
    • 제32권4호
    • /
    • pp.691-708
    • /
    • 2022
  • 머신러닝과 딥러닝의 기술이 보편화되면서 산업제어시스템의 이상(비정상) 탐지 연구에도 적용이 되기 시작하였다. 국내에서는 산업제어시스템의 이상 탐지를 위한 인공지능 연구를 활성화시키기 위하여 HAI 데이터셋을 개발하여 공개하였고, 산업제어시스템 보안위협 탐지 AI 경진대회를 시행하고 있다. 이상 탐지 연구들은 대개 기존의 딥러닝 학습 알고리즘을 변형하거나 다른 알고리즘과 함께 적용하는 앙상블 학습 모델의 방법을 통해 향상된 성능의 학습 모델을 만드는 연구가 대부분 이었다. 본 연구에서는 학습 모델과 데이터 전처리(pre-processing)의 개선을 통한 방법이 아니라, 비정상 데이터를 탐지하여 라벨링 한 결과를 보정하는 후처리(post-processing) 방법으로 이상 탐지의 성능을 개선시키는 연구를 진행하였고, 그 결과 기존 모델의 이상 탐지 성능 대비 약 10%이상의 향상된 결과를 확인하였다.

Open Source Remote Sensing of ORFEO Toolbox and Its Connection to Database of PostGIS with NIX File Importing

  • Lee, Ki-Won;Kang, Sang-Goo
    • 대한원격탐사학회지
    • /
    • 제26권3호
    • /
    • pp.361-371
    • /
    • 2010
  • In recent, interests regarding open source software for geo-spatial processing are increasing. Open source remote sensing (OSRS) is regarded as one of the progressing and advanced fields in remote sensing. Nevertheless, analyses or application cases regarding OSRS are not enough for general uses or references. In this study, three kinds of OSRS software in consideration of international popularity, types of functionalities, and development environments are taken into account: OSSIM, Opticks, and ORFEO Toolbox (OTB). First, functional comparison with respect to these is carried out on the level of the preliminary survey. According to this investigation, OTB is chosen as the most applicable OSRS software in this study. Running on OTB, NIX format importing module and database connecting module are implemented for widely general uses and further application. As for an example case, airborne image of NIX format is used to region growing segmentation algorithm in OTB, and then the results are stored and retrieved in PostGIS database to test implemented modules. Conclusively, local customization and algorithm development using OSRS software are necessary to build on-demand applications from the developers' viewpoint.

체인코드의 방향정보를 이용한 Filling과 Labelling (Filling and Labelling Algorithm Using Directional Information of Chain-code)

  • 심재창;하금숙;현기호;하영호
    • 전자공학회논문지B
    • /
    • 제29B권9호
    • /
    • pp.50-58
    • /
    • 1992
  • A new algorithm for filling the interior of contours and labelling each filled region concurrently is presented. Filling is simply accomplished by inversion method. The labelling information in every scan lines is extracted directly from current direction of chain code so that the proposed algorithm needs less comparision and is more efficient. The contours are followed by two different directions, clockwise for the outer contour and counterclockwise for the inner contour to get filling and labelling information. This algorithm can be applied in case that contours are nested or regions are continous. Simulataneously the proposed algorithm can find the structure tree of object without additional post processing.

  • PDF