• 대한산업공학회지
• /
• 제41권3호
• /
• pp.267-274
• /
• 2015

In the semiconductor manufacturing post-FAB process, predicting a package test result accurately in the wafer testing phase is a key element to ensure the competitiveness of companies. The prediction of package test can reduce unnecessary inspection time and expense. However, an analysing method is not sufficient to analyze data collected at wafer testing phase. Therefore, many companies have been using a summary information such as a mean, weighted sum and variance, and the summarized data reduces a prediction accuracy. In the paper, we propose an analysis method for Wafer Map Image collected at wafer testing process and conduct an experiment using real data.

• 한국컴퓨터그래픽스학회논문지
• /
• 제3권1호
• /
• pp.23-28
• /
• 1997

본 논문은 range map과 texture map이 포함된 range image를 삼각형 메쉬로 된 3차원 형상으로 복원하고, 이 삼각형 메쉬를 기하학적 축소 알고리즘을 적용하여 간략화하는 방법에 대하여 기술한다. 그리고 이 논문에는 복원된 3차원 모델에 texture mapping이 가능하고 간략한 정도를 사용자가 쉽게 결정할 수 있으며, 실시간 multiple level-of-detail에 적용 가능한 빠른 속도의 간략화 방법을 제시한다. 구현한 방법을 국보급 문화재를 스캐닝한 실험 데이터에 적용하여 그 유효성을 입증한다.

• 대한원격탐사학회지
• /
• 제23권5호
• /
• pp.455-464
• /
• 2007

Lee(2007) suggested the Point-Jacobian iteration MAP estimation(PJIMAP) for noise removal of the images that are corrupted by multiplicative speckle noise. It is to find a MAP estimation of noisy-free imagery based on a Bayesian model using the lognormal distribution for image intensity and an MRF for image texture. When the image intensity is logarithmically transformed, the speckle noise is approximately Gaussian additive noise, and it tends to a normal probability much faster than the intensity distribution. The MRF is incorporated into digital image analysis by viewing pixel types as states of molecules in a lattice-like physical system. In this study, the MAP estimation is computed by the Point-Jacobian iteration using adaptive parameters. At each iteration, the parameters related to the Bayesian model are adaptively estimated using the updated information. The results of the proposed scheme were compared to them of PJIMAP with SAR simulation data generated by the Monte Carlo method. The experiments demonstrated an improvement in relaxing speckle noise and estimating noise-free intensity by using the adaptive parameters for the Ponit-Jacobian iteration.

• 대한수학회논문집
• /
• 제21권2호
• /
• pp.337-345
• /
• 2006

John Harer conjectured that the canonical map from braid group to mapping class group induces zero homology homomorphism. To prove the conjecture it suffices to show that this map preserves the first Araki-Kudo-Dyer-Lashof operation. To get information on this homology operation we need to investigate the image of braiding under the Harer map. The main result of this paper is to give both algebraic and geometric interpretations of the image of braiding under the Harer map. For this we need to calculate long chains of consecutive actions of Dehn twists on the fundamental group of surface.

• 반도체디스플레이기술학회지
• /
• 제21권3호
• /
• pp.17-21
• /
• 2022

A variety of techniques have been proposed in the literature for depth improvement in depth from focus method. Unfortunately, these techniques over-smooth the depth maps over the regions of depth discontinuities. In this paper, we propose a robust technique for improving the depth map by employing a nonconvex smoothness function that preserves the depth edges. In addition, the proposed technique exploits the mutual structures between the depth map and a guidance map. This guidance map is designed by taking the mean of image intensities in the image sequence. The depth map is updated iteratively till the nonconvex objective function converges. Experiments performed on real complex image sequences revealed the effectiveness of the proposed technique.

• 한국농공학회논문집
• /
• 제59권2호
• /
• pp.81-90
• /
• 2017

Recent floodplain data are important for river master plan, storm and flood damage reduction comprehensive plan and pre-disaster impact assessment. Hazard map, base of floodplain data, is being emphasized as important method of non-structural flood prevention and consist of inundation trace map, inundation expected map and hazard information map. Inundation trace map describes distribution of area that damaged from typhoons, heavy rain and tsunamis and includes identified flood level, flood depth and flood time from flooding area. However due to lack of these data by local government, which are foundational and supposed to be well prepared nationwide, having hard time for making inundation trace map or hazard information map. To overcome this problem, time consumption and budget reduction is required through various research. From this study, DEM (Digital Elevation Model) from image material from UAVS (Unmanned Aerial Vehicle System) and numeric geographic map from National Geographic Information Institute are used for calculating flooding damaged area and compared with inundation trace map. As results, inundation trace map DEM based on image material from UAVS had better accuracy than that used DEM based on numeric geographic map. And making hazard map could be easier and more accurate by utilizing image material from UAVS than before.

• Communications for Statistical Applications and Methods
• /
• 제19권4호
• /
• pp.619-628
• /
• 2012

Noise reduction is an important issue in the field of image processing because image noise lowers the quality of the original pure image. The basic difficulty is that the noise and the signal are not easily distinguished. Simple smoothing is the most basic and important procedure to effectively remove the noise; however, the weakness is that the feature area is simultaneously blurred. In this research, we use ways to measure the degree of noise with respect to the degree of image features and propose a Bayesian noise reduction method based on MAP (maximum a posteriori). Simulation results show that the proposed adaptive noise reduction algorithm using Bayesian MAP provides good performance regardless of the level of noise variance.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
• /
• pp.118-122
• /
• 2000

Nowadays, it is popular to use the spread spectrum watermarking algorithm for still image. But there is high error probability of the retrieved watermark in the spread spectrum owing to the correlation between image and spreaded watermark sequence. In this paper, two methods are proposed. One is Ordering Map Method and the other is Alteration of Image. Based on pixel value, the order by which the spreaded watermark bits is embedded is created in Ordering Map Method. By the covariance function between image and the spreaded sequence, image is altered in Alteration of Image. Hence, bit error of retrieved watermark is clearly reduced to zero by this two method.

• 센서학회지
• /
• 제29권2호
• /
• pp.133-140
• /
• 2020

This study proposes a method of blending visible and near infrared images to enhance edge details and local contrast. The proposed method consists of radiance map generation and color compensation. The radiance map is produced by a Laplacian pyramid and a soft mixing method based on principal component analysis. The color compensation method uses the ratio between the composed radiance map and the luminance channel of a visible image to preserve the visible image chrominance. The proposed method has better edge details compared to a conventional visible and NIR image blending method.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.99-102
• /
• 2009

In this paper a hierarchical stereo matching algorithm based on feature extraction is proposed. The boundary (edge) as feature point in an image is first obtained by segmenting an image into red, green, blue and white regions. With the obtained boundary information, disparities are extracted by matching window on the image boundary, and the initial disparity map is generated when assigned the same disparity to neighbor pixels. The final disparity map is created with the initial disparity. The regions with the same initial disparity are classified into the regions with the same color and we search the disparity again in each region with the same color by changing block size and search range. The experiment results are evaluated on the Middlebury data set and it show that the proposed algorithm performed better than a phase based algorithm in the sense that only about 14% of the disparities for the entire image are inaccurate in the final disparity map. Furthermore, it was verified that the boundary of each region with the same disparity was clearly distinguished.