• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2161-2166
• /
• 2015

This paper analyzes the straight line detection using the principal component analysis (PCA) and proposes its improved algorithm to which two new functions are added. The first function removes invalid pixels through the detected straight line and detects a line again. The second function detects lines from non-overlapped blocks, selects valid line candidates, and detects a valid line from pixels adjacent to each line candidate. The proposed algorithm detects a more accurate straight line with a low computation in comparison with the conventional algorithm in an image with somewhat refined lines.

• Journal of the Korean Society of Radiology
• /
• v.16 no.3
• /
• pp.281-288
• /
• 2022

In this study, four algorithms (Soft, Standard, Detail, Bone) were used for general CT scan (Before MAR) images and MAR (After MAR) images for patients with metal implants inserted into the hip joint. was applied to compare and analyze Noise, SNR, and CNR to find out the optimal algorithm for quantitative evaluation. As the analysis method, Image J program, which can calculate image analysis and area and pixel values on the image reconstructed with four algorithms, was used. In order to obtain Noise, SNR, and CNR, the HU mean value and HU SD value were obtained by designating the bone (ischium) closest to the metal implant in the image for the measurement site, and the background noise was the surrounding muscle. The region of interest (ROI) was equally designated as 15 × 15 mm in consideration of the size of the bone, and the values of SNR and CNR were calculated according to the given equation. As a result, for noise, After MAR and Soft algorithms showed the lowest noise, and SNR and CNR showed the highest for Before MAR and Soft algorithms. Therefore, the soft algorithm is judged to be the most appropriate algorithm for metal implant hip joint CT.

• Korean Journal of Applied Biomechanics
• /
• v.31 no.2
• /
• pp.87-94
• /
• 2021

Objective: Identification of meaningful patterns and trends in large volumes of unstructured data is an important task in various research areas. In the present study, we gathered golf swing image data and did quantitative analysis of swing image. Method: We collected golf swing images of 30 novice players and 30 professional players in this study. Results: We selected important features of swing posture and employed data mining algorithm to classify whether a player is an expert or a novice. Moreover, our proposed method could offer quantitative advices for golf beginners for correcting their swing. Conclusion: Finally, we found a possibility that our proposed method can be expanded to golf swing correction system

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.353-360
• /
• 2006

This paper presents a robust algorithm for segmenting a vehicle license plate area from a road image. We consider the features of license plates in three aspects : 1) edges due to the characters in the plate, 2) colors in the plate, and 3) geometric properties of the plate. In the preprocessing step, we compute the thresholds based on each feature to decide whether a pixel is inside a plate or not. A statistical approach is applied to the sample images to compute the thresholds. For a given road image, our algorithm binarizes it by using the thresholds. Then, we select three candidate regions to be a plate by searching the binary image with a moving window. The plate area is selected among the candidates with simple heuristics. This algorithm robustly detects the plate against the transformation or the difference of color intensity of the plate in the input image. Moreover, the preprocessing step requires only a small number of sample images for the statistical processing. The experimental results show that the algorithm has 97.8% of successful segmentation of the plate from 228 input images. Our prototype implementation shows average processing time of 0.676 seconds per image for a set of $1280{\times}960$ images, executed on a 3GHz Pentium4 PC with 512M byte memory.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.3
• /
• pp.383-391
• /
• 2017

In image processing, image segmentation has been studied by various methods in a long time. Image segmentation is the process of partitioning a digital image into multiple objects and face detection is a typical image segmentation field being used in a variety of applications that identifies human faces in digital images. In this paper, we propose a method for extracting the contours of faces included in images. Using the Viola-Jones algorithm, to do this, we detect the approximate locations of faces from images. But, the Viola-Jones algorithm could detected the approximate location of face not the correct position. In order to extract a more accurate face region from image, we use skin color in this paper. In details, face region would be extracted using the analysis of horizontal and vertical histograms on the skin area. Finally, the face contour is extracted using snake algorithm for the extracted face area. In this paperr, a modified snake energy function is proposed for face contour extraction based snake algorithm proposed by Williams et al.[7]

• Journal of Biosystems Engineering
• /
• v.22 no.3
• /
• pp.295-302
• /
• 1997

An ultimate purpose of this study was to develop an automatic system for brown rice quality inspection using image processing technique. In this study emphasis was put on developing an algorithm for discriminating the brown rice kernels depending on their external quality with a color image processing system equipped with an adaptor magnifying the input image and optical fiber for oblique lightening. Primarily, geometical and optical features of images were analyzed with paddy and the various brown rice kernel samples such as a sound, cracked, peen-transparent, green-opaque, colored, white-opaque and brokens. Secondary, geometrical and optical parameters significant for identifying each rice kernels were screened by a statistical analysis(STEPWISE and DISCRIM procedure, SAS wer. 6) and an algorithm fur on- line discrimination of the rice kernels in static state were developed, and finally its performance was evaluated. The results are summarized as follows. 1) It was ascertained that the cracked kernels can be detected when e incident angle of the oblique light is less than 2$0^{\circ}C$ but detectivity was significantly affected by the angle between the direction of the oblique light and the longitudinal axis of the rice kernel and also by the location of the embryo with respect to the oblique light. 2) The most significant Parameters which can discriminate brown rice kernels are area, length and R, B and r values among the several geometrical and optical parameters. 3) Discrimination accuracies of the algorithm were ranged from 90% to 96% for a sound, cracked, colored, broken and unhulled, about 81 % for green-transparent and white-opaque and 75 % for green-opaque, respectively.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.2
• /
• pp.231-236
• /
• 2011

The binarization algorithm frequently applies to one part of the preprocessing phase for a variety of image processing techniques such as image recognition and image analysis, etc. So it is important that binarization algorithm is determined by the selection of threshold value for binarization in image processing. The previous algorithms could get the proper threshold value in the case that shows all the difference of brightness between background and object, but if not, they could not get the proper threshold value. In this paper, we propose the efficient fuzzy binarization method which first, segments the brightness range of gray_scale images to 2 intervals to perform car license plate binarization and applies fuzzy member function to each intervals. 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 in car license plate.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.4
• /
• pp.413-423
• /
• 2016

Worldview-3 satellite sensor provides panchromatic image with high-spatial resolution and 8-band multispectral images. Therefore, an image-sharpening technique, which sharpens the spatial resolution of multispectral images by using high-spatial resolution panchromatic images, is essential for various applications of Worldview-3 images based on image interpretation and processing. The existing pansharpening algorithms tend to tradeoff between spectral distortion and spatial enhancement. In this study, we applied six pansharpening algorithms to Worldview-3 satellite imagery and assessed the quality of pansharpened images qualitatively and quantitatively. We also analyzed the effects of time lag for each multispectral band during the pansharpening process. Quantitative assessment of pansharpened images was performed by comparing ERGAS (Erreur Relative Globale Adimensionnelle de Synthèse), SAM (Spectral Angle Mapper), Q-index and sCC (spatial Correlation Coefficient) based on real data set. In experiment, quantitative results obtained by MRA (Multi-Resolution Analysis)-based algorithm were better than those by the CS (Component Substitution)-based algorithm. Nevertheless, qualitative quality of spectral information was similar to each other. In addition, images obtained by the CS-based algorithm and by division of two multispectral sensors were shaper in terms of spatial quality than those obtained by the other pansharpening algorithm. Therefore, there is a need to determine a pansharpening method for Worldview-3 images for application to remote sensing data, such as spectral and spatial information-based applications.

• The KIPS Transactions:PartB
• /
• v.15B no.3
• /
• pp.245-252
• /
• 2008

We present a classification algorithm based on ant colony system(ACS) for classifying digital images. The ACS has been recently emerged as a useful tool for the pattern recognition, image extraction, and edge detection. The classification algorithm of digital images is very important in the application areas of digital image coding, image analysis, and image recognition because it significantly influences the quality of images. The conventional procedures usually classify digital images with the fixed value for the associated parameters and it requires postprocessing. However, the proposed algorithm utilizing randomness of ants yields the stable and enhanced images even for processing the rapidly changing images. It is also expected that, due to this stability and flexibility of the present procedure, the digital images are stably classified for processing images with various noises and error signals arising from processing of the drastically fast moving images could be automatically compensated and minimized.

• Journal of Korean Society on Water Environment
• /
• v.37 no.4
• /
• pp.275-285
• /
• 2021

Algal bloom is an important issue in maintaining the safety of the drinking water supply system. Fast detection and classification of algae images are essential for the management of algal blooms. Conventional visual identification using a microscope is a labor-intensive and time-consuming method that often requires several hours to several days in order to obtain analysis results from field water samples. In recent decades, various deep learning algorithms have been developed and widely used in object detection studies. YOLO is a state-of-the-art deep learning algorithm. In this study the third version of the YOLO algorithm, namely, YOLOv3, was used to develop an algae image detection model. YOLOv3 is one of the most representative one-stage object detection algorithms with faster inference time, which is an important benefit of YOLO. A total of 1,114 algae images for 30 genera collected by microscope were used to develop the YOLOv3 algae image detection model. The algae images were divided into four groups with five, 10, 20, and 30 genera for training and testing the model. The mean average precision (mAP) was 81, 70, 52, and 41 for data sets with five, 10, 20, and 30 genera, respectively. The precision was higher than 0.8 for all four image groups. These results show the practical applicability of the deep learning algorithm, YOLOv3, for algae image detection.