• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.5
• /
• pp.772-772
• /
• 2001

In this paper, we proposed the image-based 3D ray-tracing indoor propagation model using patch scattering model which can calculate the scattering phenomenon of the indoor structures. A patch scattering model for modeling indoor structures defines a scattering phenomenon by using RCS(Radar Cross Section) about rectangular patch without complex calculation, for example generating image antennas about each indoor structures. RCS is simply defined as a ratio of scattering power to incident power, and we use bistatic PCS which is simplified numerically by Physical Optics. Also, a simple indoor compensation factor is defined as empirical constant from measured data instead of complex numerical expression because basic patch scattering model cannot include important multipath components, so we san use patch scattering model in indoor environment using indoor compensation factor.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.5
• /
• pp.722-733
• /
• 2001

In this paper, we proposed the image-based 3D ray-tracing indoor propagation model using patch scattering model which can calculate the scattering phenomenon of the indoor structures. A patch scattering model for modeling indoor structures defines a scattering phenomenon by using RCS(Radar Cross Section) about rectangular patch without complex calculation, for example generating image antennas about each indoor structures. RCS is simply defined as a ratio of scattering power to incident power, and we use bistatic PCS which is simplified numerically by Physical Optics. Also, a simple indoor compensation factor is defined as empirical constant from measured data instead of complex numerical expression because basic patch scattering model cannot include important multipath components, so we san use patch scattering model in indoor environment using indoor compensation factor.

• Journal of Internet Computing and Services
• /
• v.20 no.6
• /
• pp.29-36
• /
• 2019

When dealing with outdoor images in a variety of computer vision applications, the presence of shadow degrades performance. In order to understand the information occluded by shadow, it is essential to remove the shadow. To solve this problem, in many studies, involves a two-step process of shadow detection and removal. However, the field of shadow detection based on CNN has greatly improved, but the field of shadow removal has been difficult because it needs to be restored after removing the shadow. In this paper, it is assumed that shadow is detected, and shadow-less image is generated by using original image and shadow mask. In previous methods, based on CGAN, the image created by the generator was learned from only the aspect of the image patch in the adversarial learning through the discriminator. In the contrast, we propose a novel method using a discriminator that judges both the whole image and the local patch at the same time. We not only use the residual generator to produce high quality images, but we also use joint loss, which combines reconstruction loss and GAN loss for training stability. To evaluate our approach, we used an ISTD datasets consisting of a single image. The images generated by our approach show sharp and restored detailed information compared to previous methods.

• Journal of Korea Multimedia Society
• /
• v.24 no.2
• /
• pp.178-185
• /
• 2021

Three-dimensional high-resolution magnetic resonance imaging (MRI) provides fine-level anatomical information for disease diagnosis. However, there is a limitation in obtaining high resolution due to the long scan time for wide spatial coverage. Therefore, in order to obtain a clear high-resolution(HR) image in a wide spatial coverage, a super-resolution technology that converts a low-resolution(LR) MRI image into a high-resolution is required. In this paper, we propose a super-resolution technique through filter learning based on information on the surrounding gradient information in 3D space from 3D MRI images. In the learning step, the gradient features of each voxel are computed through eigen-decomposition from 3D patch. Based on these features, we get the learned filters that minimize the difference of intensity between pairs of LR and HR images for similar features. In test step, the gradient feature of the patch is obtained for each voxel, and the filter is applied by selecting a filter corresponding to the feature closest to it. As a result of learning 100 T1 brain MRI images of HCP which is publicly opened, we showed that the performance improved by up to about 11% compared to the traditional interpolation method.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.465-467
• /
• 1992

This paper shows 3D vision system based on halftone image analysis. Any halftone image has its own surface vector normal to surface patch. To classily the given 3D images, all the patch on 3D object are transformed to black/white halftone. First we extract the general learning patterns which represents required slopes and their attributes. And next we propose 3D segmentation by searching intensity, slope and density. Artificial neural network is found to be very suitable in this approach, because it has powerful learning quality and noise tolerant. In this study, 3D shape reconstruct using pyramidian model. Our results are evaluated to enhance the quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.682-687
• /
• 2000

EMI problem is very important in a printed circuit board design. This paper deals with image plane as one of the most effective method to reduce EMI in PCB. The shielding performance of one and two layers of image planes of finite width and length is analyzed by the method of moments based on the triangular surface patch model. The current distributions were modeled as two simple line sources. It is demonstrated that proper triangulation should be made so as to take two basis functions in the boundary triangles of the surface.

• Corrosion Science and Technology
• /
• v.15 no.6
• /
• pp.265-270
• /
• 2016

The ellipso-microscopic observation of a titanium surface undergoing anodization in $0.05mol\;dm^{-3}$ of $H_2SO_4$ was conducted. During irradiation by ultra-violet (UV) light with a wavelength of 325 nm, the titanium surface allowed for the flow of a photo-induced current and showed up as a bright, patch-like image on an ellipso-microscopic view. The brightness and patch-pattern in the image changed with flowing photo-induced current. The changes in the brightness and the image corresponded to the formation and/or degradation of titanium oxide due to the photo-electrochemical reaction of the oxide. An in situ monitoring using the ellipso-microscope revealed that the film change was dependent on the irradiation light power, by UV-light increases the anodic current and results in the initiation of pitting at lower potentials as compared with the non-irradiated condition.

• Journal of Broadcast Engineering
• /
• v.22 no.6
• /
• pp.702-712
• /
• 2017

In this paper, we propose an unsharp masking algorithm using Laplacian as a weight map for the signal structure and a gamma transformation algorithm using image mean intensity as a weight map for mean intensity. The conventional weight map based on the patch has a disadvantage in that the brightness in the image is shifted to one side in the signal structure and the mean intensity region. So the detailed information is lost. In this paper, we improved the detail using unsharp masking of patch unit and proposed linearly combined the gamma transformed values using the average brightness values of the global and local images. Through the proposed algorithm, the detail information such as edges are preserved and the subjective image quality is improved by adjusting the brightness of the light. Experiment results show that the proposed algorithm show better performance than conventional algorithm.

• Journal of Magnetics
• /
• v.22 no.1
• /
• pp.55-59
• /
• 2017

The purpose of this study was to quantitatively evaluate image quality using intensity profile, coefficient of variation (COV), and peak signal to noise ratio (PSNR) with respect to noise reduction techniques in the ultrasound images. For that purpose, we compared with the median filter, Rudin-Osher-Fatemi (ROF), Anscombe and proposed patch group prior based denoising (PGPD) techniques. To evaluate image quality, the Shepp-Logan phantom and the ultrasound image were acquired using simulation and experiment, respectively. According to the results, the difference of intensity profile using PGPD technique is lowest compared with original Shepp-Logan phantom. In simulation, the measured COV was 0.249, 0.198, 0.198, 0.177, and 0.080 using noisy, median, ROF, Anscombe and PGPD technique, respectively. Also, in experimental image, the measured COV was 0.245, 0.230, 0.231, 0.242 and 0.187 using noisy, median, ROF, Anscombe and PGPD technique, respectively. Especially, when we used PGPD technique, the PSNR has highest value in both simulation and experiment. In this study, we performed simulation and experiment study to compare various denoising techniques in the ultrasound image. We can expect the PGPD technique to improve in medical diagnosis with excellent noise reduction.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.2
• /
• pp.91-100
• /
• 2018

In this paper, we propose a new method for template matching, patch ratio, to inpaint unknown pixels. Before this paper, many inpainting methods used sum of squared differences(SSD) or sum of absolute differences(SAD) to calculate distance between patches and it was very useful for closest patches for the template that we want to fill in. However, those methods don't consider about geometric similarity and that causes unnatural inpainting results for human visuality. Patch ratio can cover the geometric problem and moreover computational cost is less than using SSD or SAD. It is guaranteed about finding the most similar patches by Cauchy-Schwarz inequality. For ignoring unnecessary process, we compare only selected candidates by priority calculations. Exeperimental results show that the proposed algorithm is more efficent than Criminisi's one.