• Journal of Information Processing Systems
• /
• v.13 no.2
• /
• pp.305-320
• /
• 2017

The selection of subset size is of great importance to the accuracy of digital image correlation (DIC). In the traditional DIC, a constant subset size is used for computing the entire image, which overlooks the differences among local speckle patterns of the image. Besides, it is very laborious to find the optimal global subset size of a speckle image. In this paper, a self-adaptive and bidirectional dynamic subset selection (SBDSS) algorithm is proposed to make the subset sizes vary according to their local speckle patterns, which ensures that every subset size is suitable and optimal. The sum of subset intensity variation (${\eta}$) is defined as the assessment criterion to quantify the subset information. Both the threshold and initial guess of subset size in the SBDSS algorithm are self-adaptive to different images. To analyze the performance of the proposed algorithm, both numerical and laboratory experiments were performed. In the numerical experiments, images with different speckle distribution, different deformation and noise were calculated by both the traditional DIC and the proposed algorithm. The results demonstrate that the proposed algorithm achieves higher accuracy than the traditional DIC. Laboratory experiments performed on a substrate also demonstrate that the proposed algorithm is effective in selecting appropriate subset size for each point.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.5073-5086
• /
• 2015

The rock fracture detection by image analysis is significant for fracture measurement and assessment engineering. The paper proposes a novel image segmentation algorithm for the centerline tracing of a rock fracture based on Hessian Matrix at Multi-scales and Steger algorithm. A traditional fracture detection method, which does edge detection first, then makes image binarization, and finally performs noise removal and fracture gap linking, is difficult for images of rough rock surfaces. To overcome the problem, the new algorithm extracts the centerlines directly from a gray level image. It includes three steps: (1) Hessian Matrix and Frangi filter are adopted to enhance the curvilinear structures, then after image binarization, the spurious-fractures and noise are removed by synthesizing the area, circularity and rectangularity; (2) On the binary image, Steger algorithm is used to detect fracture centerline points, then the centerline points or segments are linked according to the gap distance and the angle differences; and (3) Based on the above centerline detection roughly, the centerline points are searched in the original image in a local window along the direction perpendicular to the normal of the centerline, then these points are linked. A number of rock fracture images have been tested, and the testing results show that compared to other traditional algorithms, the proposed algorithm can extract rock fracture centerlines accurately.

• Journal of radiological science and technology
• /
• v.44 no.3
• /
• pp.225-229
• /
• 2021

The digital image such as medical X-ray and nuclear medicine field mainly contains noise distribution. The noise degree in image degrades image quality. That is why, the noise reduction algorithm is efficient for medical image field. In this study, we confirmed effectiveness of application for median modified Wiener filter (MMWF) algorithm for noise reduction in PET/MR image compared with median filter image, which is used as conventional noise redcution algorithm. The Jaszczak PET phantom was used by using 18F solution and filled with NaCl+NiSO4 fluids. In addition, the radioactivity ratio between background and six spheres in the phantom is maintained to 1:8. In order to mimic noise distribution in the image, we applied Gaussian noise using MATLAB software. To evlauate image quality, the contrast to noise ratio (CNR) and coefficient of variation (COV) were used. According to the results, compared with noise image and images with MMWF algorithm, the image with MMWF algorithm is increased approximately 33.2% for CNR result, decreased approximately 79.3% for COV result. In conclusion, we proved usefulness of MMWF algorithm in the PET/MR images.

• Nuclear Engineering and Technology
• /
• v.56 no.6
• /
• pp.2057-2062
• /
• 2024

Among photon counting detector (PCD)-based technologies, the K-edge subtraction (KES) method has a very high material decomposition efficiency. Yet, since the increase in noise in the X-ray image to which the KES method is applied is inevitable, research on image quality improvement is essential. Here, we modeled a block-matching and 3D filtering (BM3D) algorithm and applied it to PCD-based X-ray images with the improved KES (IKES) method. For PCD modeling, Monte Carlo simulation was used, and a phantom composed of iodine substances with different concentrations was designed. The IKES method was modeled by adding a log term to KES, and the X-ray image used for subtraction was obtained by applying the 3.0 keV range based on the K-edge region of iodine. As a result, the IKES image using the BM3D algorithm showed the lowest normalized noise power spectrum value. In addition, we confirmed that the contrast-to-noise ratio and no-reference-based evaluation results when the BM3D algorithm was applied to the IKES image were improved by 29.36 % and 20.56 %, respectively, compared to the noisy image. In conclusion, we demonstrated that the IKES imaging technique using a PCD-based detector and the BM3D algorithm fusion technique were very efficient for X-ray imaging.

• Advances in Automotive Engineering
• /
• v.1 no.1
• /
• pp.143-152
• /
• 2018

In this study an economical image stitching algorithm for use in automotive industry is developed for retrofittable panoramic image assistance applications. The aim of this project is to develop a driving assistance system known as Panoramic Parking Assistance (PPA) which is cheap, retrofittable and compatible for every type of automobiles. PPA generates bird's eye view image using cameras installed on the automobiles. Image stitching requires to get bird's eye view position of the vehicle. Panoramic images are wide area images that cannot be available by taking one shot, attained by stitching the overlapping areas. To achieve correct stitching many algorithms are used. This study includes some type of these algorithms and presents a simple one that is economical and practical. Firstly, the mathematical model of a wide view of angle camera is provided. Then distorted image correction is performed. Stitching is implemented by using the SIFT and SURF algorithms. It has been seen that using such algorithms requires complex image processing knowledge and implementation of high quality digital processors, which would be impracticle and costly for automobile use. Thus a simpler algorithm has been developed to decrase the complexity. The proposed algorithm uses one matching point for every couple of images and has ease of use and does not need high power processors. To show the efficiency, images coming from four distinct cameras are stitched by using the algorithm developed for the study and usability for automotive application is analyzed.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.713-718
• /
• 1987

In this paper, an iterative restoration algorithm from power spectral density with 1 bit sign information of real part of two dimensional Fourier transform of image corrupted by additive white Gaussian noise is proposed. This method is a modified version of image reconstruction algorithm from power spectral density. From the results of computer simulation with original 32 gray level imgae of 64x64 pixels, we can find that restorated image after each iteration converge to original image very fast, and SNR gain be at least 8[dB] after 10th iteration for corrupted image with additive white Gaussian noise.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.8
• /
• pp.33-40
• /
• 1993

This paper presents a hardware for image alignment based on proposed new algorithm which can align a small misaligned document image simply by one transformation with a parallel shifting of pixels. This hardware is simulated with VHDL and estimated to be about 65 ms to align an image made up of 380 by 480 pixels. Also, we will demonstrate the effectiveness of the proposed image alignment algorithm in OCR system by comparing its characteristics with those of the existing image rotation algorithms.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.11
• /
• pp.2292-2298
• /
• 2009

In this paper, the lossy image compression algorithm using the quad tree and the bandlets is proposed. The proposed algorithm transforms input images by the discrete wavelet transform (DWT) and represents the geometrical structures of high frequency bands using the bandlets with a 8 block- size. In addition, the proposed algorithm searches the position information of the significant coefficients by using the quad tree algorithm and computes the magnitude and the sign information of the significant coefficients by using the Embedded Image Coding using Zerotrees of Wavelet Coefficients (EZW) algorithm. The compression result by using the quad tree algorithm improves the PSNR performance of high frequency images up to 1 dB, compared to that of JPEG-2000 algorithm and that of S+P algorithm. The PSNR performance by using DWT and bandlets improves up to 7.5dB, compared to that by using only DWT.

• Journal of Broadcast Engineering
• /
• v.11 no.4 s.33
• /
• pp.396-406
• /
• 2006

This paper proposes an omni-directional image generation algorithm with parametric image compensation. The algorithm generates an omni-directional image by transforming each planar image to the spherical image on spherical coordinate. Parametric image compensation method is presented in order to compensate vignetting and illumination distortions caused by properties of a camera system and lighting condition. The proposed algorithm can generates realistic and seamless omni-directional video and synthesize any point of view from the stitched omni-directional image on the spherical image. Experimental results show that the proposed omni-directional system with vignetting and illumination compensation is approximately $1{\sim}4dB$ better than that which does not consider the said effects.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.24 no.2
• /
• pp.153-160
• /
• 2000

A Particle Image Velocimetry(PIV) algorithm is developed to analyze whole flow field both qualitatively and quantitatively. The practical use of PIV requires the use of fast, reliable, computer-based methods for tracking numerous particles suspended in a flow field. The TSS, NTSS, FFT-Hybrid, which are developed in the area of image compression and coding, are introduced to develop fast vector search algorithm. The numerical solution of the lid-driven cavity flow by the ADI algorithm with the Wachspress Formula is introduced to produce synthetic data for the validation of the tracking algorithms. The algorithms are applied to image data of real flow experiments. The comparisons in CPU time and mean error show, with a small loss of accuracy, CPU time for tracking is reduced considerably.