• 한국세라믹학회지
• /
• 제26권2호
• /
• pp.276-288
• /
• 1989

Interpretation of high-resolution transmission electron microscopy images of defects and complex structures such as found in ceramics generally requires matching of the images with compound image simulations for reliable interpretation. A transmission electron microscopy study of the aluminum oxide was carried out at high-resolution, so that the crystal structure of the aluminum oxide could be modelled on an atomic level. In conjunction with computer simulation comparisons, the images reveal directly the atomic structure of the oxide. Results show that comparison between experimental high-resolution electron microscopy images and simulated images leads to a one to one correspondence of the image to the atomic model of the aluminum oxide. The aluminum atoms are disordered in the octahedral sites and the tetrahedral sites in the spinel aluminum oxide.

• 전자공학회논문지B
• /
• 제32B권11호
• /
• pp.153-162
• /
• 1995

When vector quantization is used in low rate image coding (e.g., R<0.5), the primary problem is the tremendous computational complexity which is required to search the whole codebook to find the closest codevector to an input vector. Since the number of code vectors in a vector quantizer is given by an exponential function of the dimension. i.e., L=2$^{nR}$ where Rn. To alleviate this problem, a multiple shell structure of hypercube feature maps (MSSHFM) is proposed. A binary HFM of k-dimension is composed of nodes at hypercube vertices and a multiple shell architecture is constructed by surrounding the k-dimensional hfm with a (k+1)-dimensional HFM. Such a multiple shell construction of nodes inherently has a complete tree structure in it and an efficient partial search scheme can be applied with drastically reduced computational complexity, computer simulations of still image coding were conducted and the validity of the proposed method has been verified.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권3호
• /
• pp.294-303
• /
• 1999

To improve the visual servoing performance, several strategies were proposed in the past such as redundant feature points, using a point with different height and weighted selection of image features. The performance of these visual servoing methods depends on the configuration between the camera and object. And redundant feature points require much computation efforts. This paper proposes the visual servoing method based on the disturbance obsever, which compensates the upper off-diagonal component of image feature jacobian to be the null. The performance indices such as sensitivity for a measure of richness, sensitivity of the control to noise, and comtrollability are shown to be improved when the image feature Jacobian is given as a block diagonal matrix. Computer simulations are carried out for a UUMA560 robot and show some results to verify the effectiveness of the proposed method.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권2호
• /
• pp.120-127
• /
• 2003

In electrical impedance tomography(EIT), various image reconstruction algorithms have been used in order to compute the internal resistivity distribution of the unknown object with its electric potential data at the boundary. Mathematically the EIT image reconstruction algorithm is a nonlinear ill-posed inverse problem. This paper presents a simulated annealing technique as a statistical reconstruction algorithm for the solution of the static EIT inverse problem. Computer simulations with the 32 channels synthetic data show that the spatial resolution of reconstructed images by the proposed scheme is improved as compared to that of the mNR algorithm or genetic algorithm at the expense of increased computational burden.

• 한국통신학회논문지
• /
• 제22권5호
• /
• pp.1107-1115
• /
• 1997

In this paper, we propose an error concealment method to recovre damaged block-based image coding schemes. Channel errors during transmission of image data such as bit errors or cell loss result in damaged image blocks in the reconstructed images. To recover damaged blocks is to estimate them using the correctly received or undamaged neighborhood information. In the proposed method, an overcomplete basis for a large block containing a damaged block at its center is introduced and damaged blocks are recovered by sequentially projecting the known neighborhood information onto the overcomplete basis function. Computer simulations show that the proposed algorithm outperforms the conventional method in subjectie recovery qualities as well as objective ones.

• 한국광학회지
• /
• 제17권6호
• /
• pp.519-524
• /
• 2006

일반적으로 Lohmann형 이진 홀로그램에서 홀로그램의 진폭과 위상을 표현할 때 사각 셀이 이용된다. 본 논문에서는 기존의 사각 셀 대신에 원형 셀을 이용하여 진폭과 위상을 표현하는 방법을 시도하였으며, 기존의 사각 셀과 본 논문에서 사용한 원형 셀을 이용하여 구현된 컴퓨터 형성 홀로그램(CCH)의 특성을 비교하기 위하여 컴퓨터 실험과 광학적 실험 데이터를 토대로 재생된 결과를 비교 분석하였다. 실험 결과 원형 셀을 여러 픽셀로 나눌 경우 보다 뚜렷한 재생상을 얻을 수 있었으며, 원형 셀이 사각 셀 보다 균일할 재생상을 얻는 측면에서는 다소 차이가 있었으나 재생시에 원형 셀이 사각 셀 보다 더욱 밝은 재생상을 얻을 수 있었다.

• 대한전자공학회논문지
• /
• 제25권5호
• /
• pp.550-558
• /
• 1988

This paper presents laplacian pyramid vector quantization (LPVQ) approach in which a vector quantizer is used to encode a series of quasi-bandpassed images generated by the laplacian pyramid processing. Performance of the LPVQ is compared to those of DCT domain methods at the same bit rate via computer simulations. Experimental results show that the PSNR's (peak signal-to-noise ratio) for the LPVQ are almost the same as those of the DCT based methods. However, subjective study indicates the LPVQ obtains slightly higher scores than the DCT based techniques.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1979년도 하계 전자.전기연합학술발표회논문집
• /
• pp.160-161
• /
• 1979

The degradation of image due to the finite size of sensing device has been one of the problems to all of the digital imaging systems. The improvement of the spatial resolution has been attempted by "differential method" with fixed sensor size and finer sampling. The computer simulations were carried out for the cases of PLF system (Parallel Linear Fan-beam) and SR(Stationary Ring) system and the results are presented.

• 대한전자공학회논문지
• /
• 제24권1호
• /
• pp.167-172
• /
• 1987

In this paper, the interpolation schemes for Direct Fourier Reconstruction in Diffraction Tomography are discussed. The interpolator using circular sampling theorem is modified so that the reconstructed image may be closer to original object than those produced with other interpolators. Reconstructed images obtained by computer simulations with several interpolators including that derived in this paper are compared to original object: two concentric cylinders.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권1호
• /
• pp.452-472
• /
• 2019

Most existing wavelet-based multiplicative watermarking methods are affected by geometric attacks to a certain extent. A serious limitation of wavelet-based multiplicative watermarking is its sensitivity to rotation, scaling, and translation. In this study, we propose an image watermarking method by using dual-tree complex wavelet transform with a multi-objective optimization approach. We embed the watermark information into an image region with a high entropy value via a multiplicative strategy. The major contribution of this work is that the trade-off between imperceptibility and robustness is simply solved by using the multi-objective optimization approach, which applies the watermark error probability and an image quality metric to establish a multi-objective optimization function. In this manner, the optimal embedding factor obtained by solving the multi-objective function effectively controls watermark strength. For watermark decoding, we adopt a maximum likelihood decision criterion. Finally, we evaluate the performance of the proposed method by conducting simulations on benchmark test images. Experiment results demonstrate the imperceptibility of the proposed method and its robustness against various attacks, including additive white Gaussian noise, JPEG compression, scaling, rotation, and combined attacks.