• Korean Journal of Remote Sensing
• /
• v.28 no.4
• /
• pp.347-355
• /
• 2012

A fast algorithm for endmember extraction is proposed in this study which extracts min. and max. pixels from each band after MNF transform as candidate pixels for endmember. This method finds endmembers not from the entire image pixels but only from the previously extracted candidate pixels. The experimental results by N-FINDR using a simulated hyperspectral image data and AVIRIS Cuprite image data showed that the proposed fast algorithm extracts the same endmembers with the conventional methods. More studies on the effect of noise and more adaptive criteria in extracting candidate pixels are expected to increase the usability of this method for more fast and efficient analysis of hyperspectral image data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1785-1801
• /
• 2017

In recent years, image encryption algorithms have been developed rapidly in order to ensure the security of image transmission. With the assistance of our previous work, this paper proposes a novel chaotic image encryption algorithm based on self-adaptive model and feedback mechanism to enhance the security and improve the efficiency. Different from other existing methods where the permutation is performed by the self-adaptive model, the initial values of iteration are generated in a novel way to make the distribution of initial values more uniform. Unlike the other schemes which is on the strength of the feedback mechanism in the stage of diffusion, the piecewise linear chaotic map is first introduced to produce the intermediate values for the sake of resisting the differential attack. The security and efficiency analysis has been performed. We measure our scheme through comprehensive simulations, considering key sensitivity, key space, encryption speed, and resistance to common attacks, especially differential attack.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1843-1859
• /
• 2013

The continuous increase of the spatial resolution of remote sensing images brings great challenge to image analysis and processing. Traditional prior knowledge-based region detection and target recognition algorithms for processing high resolution remote sensing images generally employ a global searching solution, which results in prohibitive computational complexity. In this paper, a more efficient region of interest (ROI) detection algorithm based on visual attention and threshold segmentation (VA-TS) is proposed, wherein a visual attention mechanism is used to eliminate image segmentation and feature detection to the entire image. The input image is subsampled to decrease the amount of data and the discrete moment transform (DMT) feature is extracted to provide a finer description of the edges. The feature maps are combined with weights according to the amount of the "strong points" and the "salient points". A threshold segmentation strategy is employed to obtain more accurate region of interest shape information with the very low computational complexity. Experimental statistics have shown that the proposed algorithm is computational efficient and provide more visually accurate detection results. The calculation time is only about 0.7% of the traditional Itti's model.

• Journal of Magnetics
• /
• v.18 no.3
• /
• pp.311-316
• /
• 2013

Digital image processing has increasingly been implemented in nanostructural analysis and would be an ideal tool to characterize the morphology and position of self-assembled magnetic nanoparticles for high density recording. In this work, magnetic nanoparticles were synthesized by the modified polyol process using $Fe(acac)_3$ and $Pt(acac)_2$ as starting materials. Transmission electron microscope (TEM) images of as-synthesized products were inspected using an image processing procedure. Grayscale images ($800{\times}800$ pixels, 72 dot per inch) were converted to binary images by using Otsu's thresholding. Each particle was then detected by using the closing algorithm with disk structuring elements of 2 pixels, the Canny edge detection, and edge linking algorithm. Their centroid, diameter and area were subsequently evaluated. The degree of polydispersity of magnetic nanoparticles can then be compared using the size distribution from this image processing procedure.

• Korean Journal of Artificial Intelligence
• /
• v.12 no.1
• /
• pp.1-6
• /
• 2024

Recently, various techniques are being applied through the development of medical AI, and research has been conducted on the application of super-resolution AI models. In this study, evaluate the results of the application of the super-resolution AI model to brain CT as the basic data for future research. Acquiring CT images of the brain, algorithm for brain and bone windowing setting, and the resolution was downscaled to 5 types resolution image based on the original resolution image, and then upscaled to resolution to create an LR image and used for network input with the original imaging. The SRCNN model was applied to each of these images and analyzed using PSNR, SSIM, Loss. As a result of quantitative index analysis, the results were the best at 256×256, the brain and bone window setting PSNR were the same at 33.72, 35.2, and SSIM at 0.98 respectively, and the loss was 0.0004 and 0.0003, respectively, showing relatively excellent performance in the bone window setting CT image. The possibility of future studies aimed image quality and exposure dose is confirmed, and additional studies that need to be verified are also presented, which can be used as basic data for the above studies.

• Economic and Environmental Geology
• /
• v.32 no.1
• /
• pp.19-31
• /
• 1999

In this study, we have estimated lineaments in the Euiseong area, Kyungbuk Province, from Landsat TM by applying the algorithm developed by Kim and Won et al. which can effectively reduce the look direction bias associated with the Sun's azimuth angle. Fratures over the study area were also mapped in the field at 57 selected sites to compare them with the results from the satellite image. The trends of lineaments estimated from the Landsat TM images are characterized as $N50^{\circ}$~70W, NS~$N10^{\circ}$W, and $N10^{\circ}$~$60^{\circ}$E trends. The spatial distribution of lineaments is also studied using a circular grid, and the results show that the area can be divided into two domains : domain A in which NS~$N20^{\circ}$E direction is dominant, and domain B in which west-north-west direction is prominent. The trends of lineaments can also be classified into seven groups. Among them, only C, D and G trends are found to be dominant based upon Donnelly's nearest neighbor analysis and correlations of lineament desities. In the color composite image produced by overlaying the lineament density map of these C-, D-, and G-trends, G-trend is shown to be developed in the whole study area while the eastern part of the area is dominated by D-trend. C-trend develops extensively over the whole are except the southeastern part. The orientation of fractures measured at 35 points in the field shows major trends of NS~$N30^{\circ}$E, $N50^{\circ}$~$80^{\circ}$W, and N80$^{\circ}$E~EW, which agree relatively well with the lineaments estimated form the satellite image. The rose diagram analysis fo field data shows that WNW-ESE trending discontinuities are developed in the whole area while discontinuities of NS~$N20^{\circ}$E are develped only in the estern part, which also coincide with the result from the satellite image. The combined results of lineaments from the satellite image and fracture orientation of field data at 22 points including 18 minor faults in Sindong Group imply that the WNW-ESE trend is so prominent that Gumchun and Gaum faults are possibly extended up to the lower Sindong Group in the study area.

• Journal of Astronomy and Space Sciences
• /
• v.8 no.1
• /
• pp.115-123
• /
• 1991

Automatching algorithm is suitable for cross-correlation, which showed correlation surface about maximal correlation coefficient. The size of the window area must be determined empirically, whereas window size generally chosen as a compromise between speed and accuracy. It is possible that epipolar transform prevented from mismatching and decreased search space. In application of the astronomical fields, automatching algorithm mainly used to planet surface recovery in satellite image.

• Journal of Korea Multimedia Society
• /
• v.18 no.6
• /
• pp.701-709
• /
• 2015

Image stitching method is a technique for obtaining an high-resolution image by combining two or more images. In X-ray image for clinical diagnosis, the size of the imaging region taken by one shot is limited due to the field-of-view of the equipment. Therefore, in order to obtain a high-resolution image including large regions such as a whole body, the synthesis of multiple X-ray images is required. In this paper, we propose a rapid stitching method of digital X-ray images using template-based registration. The proposed algorithm use principal component analysis(PCA) and k-nearest neighborhood(k-NN) to determine the location of input images before performing a template-based matching. After detecting the overlapping position using template-based matching, we synthesize input images by alpha blending. To improve the computational efficiency, reduced images are used for PCA and k-NN analysis. Experimental results showed that our method was more accurate comparing with the previous method with the improvement of the registration speed. Our stitching method could be usefully applied into the stitching of 2D or 3D multiple images.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.721-726
• /
• 2004

The image binarization is applied frequently as one part of the preprocessing phase for a variety of image processing techniques such as character recognition and image analysis, etc. The performance of binarization algorithms is determined by the selection of threshold value for binarization, and most of the previous binarization algorithms analyze the intensity distribution of the original images by using the histogram and determine the threshold value using the mean value of Intensity or the intensity value corresponding to the valley of the histogram. The previous algorithms could not get the proper threshold value in the case that doesn't show the bimodal characteristic in the intensity histogram or for the case that tries to separate the feature area from the original image. So, this paper proposed the novel algorithm for image binarization, which, first, segments the intensity range of grayscale images to several intervals and calculates mean value of intensity for each interval, and next, repeats the interval integration until getting the final threshold value. The interval integration of two neighborhood intervals calculates the ratio of the distances between mean value and adjacent boundary value of two intervals and determine as the threshold value of the new integrated interval the intensity value that divides the distance between mean values of two intervals according to the ratio. The experiment for performance evaluation of the proposed binarization algorithm showed that the proposed algorithm generates the more effective threshold value than the previous algorithms.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2002.10a
• /
• pp.205-208
• /
• 2002