• Journal of Ecology and Environment
• /
• v.41 no.4
• /
• pp.114-119
• /
• 2017

This study tried to analyze error range and resolution of drone images using a rotary wing by comparing them with field measurement results and to analyze stands patterns in actual vegetation map preparation by comparing drone images with aerial images provided by National Geographic Information Institute of Korea. A total of 11 ground control points (GCPs) were selected in the area, and coordinates of the points were identified. In the analysis of aerial images taken by a drone, error per pixel was analyzed to be 0.284 cm. Also, digital elevation model (DEM), digital surface model (DSM), and orthomosaic image were abstracted. When drone images were comparatively analyzed with coordinates of ground control points (GCPs), root mean square error (RMSE) was analyzed as 2.36, 1.37, and 5.15 m in the direction of X, Y, and Z. Because of this error, there were some differences in locations between images edited after field measurement and images edited without field measurement. Also, drone images taken in the stream and the forest and 51 and 25 cm resolution aerial images provided by the National Geographic Information Institute of Korea were compared to identify stands patterns. To have a standard to classify polygons according to each aerial image, image analysis software (eCognition) was used. As a result, it was analyzed that drone images made more precise polygons than 51 and 25 cm resolution images provided by the National Geographic Information Institute of Korea. Therefore, if we utilize drones appropriately according to characteristics of subject, we can have advantages in vegetation change survey and general monitoring survey as it can acquire detailed information and can take images continuously.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.1
• /
• pp.43-48
• /
• 2014

Usually, image deconvolution is applied as a preprocessing step in surveillance systems to reduce the effect of motion or out-of-focus blur problem. In this paper, we propose a blind-image deconvolution filtering approach based on genetic programming (GP). A numerical expression is developed using GP process for image restoration which optimally combines and exploits dependencies among features of the blurred image. In order to develop such function, first, a set of feature vectors is formed by considering a small neighborhood around each pixel. At second stage, the estimator is trained and developed through GP process that automatically selects and combines the useful feature information under a fitness criterion. The developed function is then applied to estimate the image pixel intensity of the degraded image. The performance of developed function is estimated using various degraded image sequences. Our comparative analysis highlights the effectiveness of the proposed filter.

• Journal of the Institute of Convergence Signal Processing
• /
• v.23 no.4
• /
• pp.194-199
• /
• 2022

Preprocessing for high-quality data is required for high accuracy and usability in various and complex image data-based industries. However, when a contaminated hostile example that combines noise with existing image or video data is introduced, which can pose a great risk to the company, it is necessary to restore the previous damage to ensure the company's reliability, security, and complete results. As a countermeasure for this, restoration was previously performed using Defense-GAN, but there were disadvantages such as long learning time and low quality of the restoration. In order to improve this, this paper proposes a method using adversarial examples created through FGSM according to image segmentation in addition to using the VQ-VAE model. First, the generated examples are classified as a general classifier. Next, the unsegmented data is put into the pre-trained VQ-VAE model, restored, and then classified with a classifier. Finally, the data divided into quadrants is put into the 4-split-VQ-VAE model, the reconstructed fragments are combined, and then put into the classifier. Finally, after comparing the restored results and accuracy, the performance is analyzed according to the order of combining the two models according to whether or not they are split.

• International Journal of Advanced Culture Technology
• /
• v.7 no.1
• /
• pp.64-69
• /
• 2019

With the advent of the fourth industry, the need for office automation with automatic character recognition capabilities is increasing day by day. Therefore, in this paper, we study a character recognition algorithm that effectively recognizes a new experimental data character by using learning data characters. The proposed algorithm computes the degree of similarity that the structural regions of learning data characters match the corresponding regions of the experimental data character. It has been confirmed that satisfactory results can be obtained by selecting the learning data character with the highest degree of similarity in the matching process as the final recognition result for a given experimental data character.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.4
• /
• pp.949-956
• /
• 2014

Recently, with the development of hardware and software technology related with image information delivery, the demand for various multimedia service has increased. But, the process of treating, sending, and storing image signals generates image degradation by various external causes. The main cause of image degradation is noise. image is mostly damaged by AWGN (additive white Gaussian noise). Therefore, there have been active researches on noise elimination. This paper, to reduce the effects of AWGN added to the image, suggests a noise-eliminating algorithm which is excellent in low-frequency and high-frequency characteristics in space. And, this paper, through simulation techniques, compared the result of the suggested algorithm with those of the existing methods. And, to evaluate the performance of it, PSNR (peak signal to noise ratio) was used.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2547-2567
• /
• 2021

It has been widely acknowledged that occlusion impairments adversely distress many face recognition algorithms' performance. Therefore, it is crucial to solving the problem of face image occlusion in face recognition. To solve the image occlusion problem in face recognition, this paper aims to automatically de-occlude the human face majority or discriminative regions to improve face recognition performance. To achieve this, we decompose the generative process into two key stages and employ a separate generative adversarial network (GAN)-based network in both stages. The first stage generates an initial coarse face image without an occlusion mask. The second stage refines the result from the first stage by forcing it closer to real face images or ground truth. To increase the performance and minimize the artifacts in the generated result, a new refine loss (e.g., reconstruction loss, perceptual loss, and adversarial loss) is used to determine all differences between the generated de-occluded face image and ground truth. Furthermore, we build occluded face images and corresponding occlusion-free face images dataset. We trained our model on this new dataset and later tested it on real-world face images. The experiment results (qualitative and quantitative) and the comparative study confirm the robustness and effectiveness of the proposed work in removing challenging occlusion masks with various structures, sizes, shapes, types, and positions.

• Journal of KIISE:Software and Applications
• /
• v.37 no.4
• /
• pp.264-272
• /
• 2010

Example-based super resolution is a method to restore a high resolution image from low resolution images through training and retrieval of image patches. It is not only good in its performance but also available for a single frame low-resolution image. However, its time complexity is very high because it requires lots of comparisons to retrieve image patches in restoration process. In order to improve the restoration speed, an efficient patch retrieval algorithm is essential. In this paper, we applied various high-dimensional feature retrieval methods, available for the patch retrieval, to a practical example-based super resolution system and compared their speed. As well, we propose to apply the multi-phase candidate reduction approach to the patch retrieval process, which was successfully applied in character recognition fields but not used for the super resolution. In the experiments, LSH was the fastest among conventional methods. The multi-phase candidate reduction method, proposed in this paper, was even faster than LSH: For $1024{\times}1024$ images, it was 3.12 times faster than LSH.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.455-462
• /
• 2015

Image media is used for the internet, computers and digital cameras as part of the core services of multimedia. Digital images can be easily acquired and processed, due to the development of digital home appliances and personal computers' application software. However, image degradation occurs by various external causes in the acquisition, processing and transmitting process of digital images, and its main cause is known to be noise. Therefore, this study proposed and conducted the simulation of image restoration filter algorithm that processes impulse noise and Gaussian noise by applying Lagrange interpolation and spatial weighted method according to distance, respectively. The proposed algorithm improved 8.77[dB], 8.83[dB] and 10.02[dB], respectively, compared to existing A-TMF, AWMF and MMF, as a result of processing by applying the damaged Girl images to impulse noise(P=60%) and Gaussian noise(${\sigma}=10$).

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.168-173
• /
• 2010

Error concealment techniques are significant due to the growing interest in imagery transmission over error-prone channels. This paper presents a spatial error concealment technique for losslessly compressed images using least significant bit (LSB)-based data hiding to reconstruct a close approximation after the loss of image blocks during image transmission. Before transmission, block description information (BDI) is generated by applying quantization following discrete wavelet transform. This is then embedded into the LSB plane of the original image itself at the encoder. At the decoder, this BDI is used to conceal blocks that may have been dropped during the transmission. Although the original image is modified slightly by the message embedding process, no perceptible artifacts are introduced and the visual quality is sufficient for analysis and diagnosis. In comparisons with previous methods at various loss rates, the proposed technique is shown to be promising due to its good performance in the case of a loss of isolated and continuous blocks.

• Journal of IKEEE
• /
• v.22 no.1
• /
• pp.68-73
• /
• 2018

In this paper, we propose an efficient algorithm for mapping a $360^{\circ}$ circular image to a planar image. The proposed algorithm consists of obtaining size of the planar image, calculating the distance between the camera and the planar image, calculating horizontal angle of camera and planar image, calculating vertical angle between camera and planar image, calculating the position of a pixel that matches pixels in a $360^{\circ}$ circular image to pixels in a planar image. Experiments were performed to evaluate the efficient algorithm for mapping the proposed $360^{\circ}$ circular image to the plane image. The reconstruction rate of the mapped plane image was confirmed 99% and the image quality of the mapped plane image was confirmed 72%. Since the results were higher than the standard values of commercial software, the effectiveness of the algorithm was confirmed.