• International Journal of Computer Science & Network Security
• /
• v.22 no.2
• /
• pp.193-198
• /
• 2022

Face Detection is one of the most important aspects of image processing, it considers a time-consuming problem in real-time applications such as surveillance systems, face recognition systems, attendance system and many. At present, commodity hardware is getting more and more heterogeneity in terms of architectures such as GPU and MIC co-processors. Utilizing those co-processors along with the existing traditional CPUs gives the algorithm a better chance to make use of both architectures to achieve faster implementations. This paper presents a hybrid implementation of the face detection based on the local binary pattern (LBP) algorithm that is deployed on both traditional CPU and MIC co-processor to enhance the speed of the LBP algorithm. The experimental results show that the proposed implementation achieved improvement in speed by 3X when compared to a single architecture individually.

• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.596-598
• /
• 2010

본 논문에서는 의료영상 중 X-ray 영상을 대상으로 영상을 분류하고 분류 결과에 따라 다중 키워드를 생성하는 방법을 제시한다. X-ray영상은 대부분 그레이 영상임으로 Local Binary Patterns (LBP)을 이용하여 픽셀간의 연관성을 특징으로 추출하고, 실시간 학습 및 분류가 가능한 Random Forests 분류기로 영상들을 30개의 클래스로 분류한다. 또한, 미리 정의된 신체 부위간의 관계 가중치를 분류 스코어에 결합하여 신뢰값을 생성하고 이를 기반으로 영상에 대해 다중 주석을 부여하게 된다. 이렇게 부여된 다중 주석은 키워드 기반의 의료영상을 가능케 함으로 보다 쉽고 효율적인 검색 환경을 제공할 수 있다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.2
• /
• pp.146-159
• /
• 2023

This paper proposes a hybrid algorithm combining K-means clustering and watershed algorithms for flower segmentation and counting. We use the K-means clustering algorithm to obtain the main colors in a complex background according to the cluster centers and then take a color space transformation to extract pixel values for the hue, saturation, and value of flower color. Next, we apply the threshold segmentation technique to segment flowers precisely and obtain the binary image of flowers. Based on this, we take the Euclidean distance transformation to obtain the distance map and apply it to find the local maxima of the connected components. Afterward, the proposed algorithm adaptively determines a minimum distance between each peak and apply it to label connected components using the watershed segmentation with eight-connectivity. On a dataset of 30 images, the test results reveal that the proposed method is more efficient and precise for the counting of overlapped flowers ignoring the degree of overlap, number of overlap, and relatively irregular shape.

• ETRI Journal
• /
• v.46 no.3
• /
• pp.526-537
• /
• 2024

Monitoring fetal growth in utero is crucial to anomaly diagnosis. However, current computer-vision models struggle to accurately assess the key metrics (i.e., head circumference and occipitofrontal and biparietal diameters) from ultrasound images, largely owing to a lack of training data. Mitigation usually entails image augmentation (e.g., flipping, rotating, scaling, and translating). Nevertheless, the accuracy of our task remains insufficient. Hence, we offer a U-Net fetal head measurement tool that leverages a hybrid Dice and binary cross-entropy loss to compute the similarity between actual and predicted segmented regions. Ellipse-fitted two-dimensional ultrasound images acquired from the HC18 dataset are input, and their lower feature layers are reused for efficiency. During regression, a novel region of interest pooling layer extracts elliptical feature maps, and during segmentation, feature pyramids fuse field-layer data with a new scale attention method to reduce noise. Performance is measured by Dice similarity, mean pixel accuracy, and mean intersection-over-union, giving 97.90%, 99.18%, and 97.81% scores, respectively, which match or outperform the best U-Net models.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.578-589
• /
• 2014

Window image is displayed through a monitor screen when we execute the application programs on the computer. This includes webpage, video player and a number of applications. The webpage delivers a variety of information by various types in comparison with other application. Unlike a natural image captured from a camera, the window image like a webpage includes diverse components such as text, logo, icon, subimage and so on. Each component delivers various types of information to users. However, the components with different characteristic need to be divided locally, because text and image are served by various type. In this paper, we divide window images into many sub blocks, and classify each divided region into background, text and subimage. The detected subimages can be applied into 2D-to-3D conversion, image retrieval, image browsing and so forth. There are many subimage classification methods. In this paper, we utilize AdaBoost for verifying that the machine learning-based algorithm can be efficient for subimage detection. In the experiment, we showed that the subimage detection ratio is 93.4 % and false alarm is 13 %.

• The Journal of the Korea Contents Association
• /
• v.10 no.7
• /
• pp.107-114
• /
• 2010

Color is a sense signal for human to perceive being through light, and the color is divided into chromatic color and achromatic color. Chromatic color has hue, intensity, and saturation, but achromatic color has only intensity among the properties of chromatic color and doesn't have hue and saturation. Therefore it is important to split colors of image into area for human to perceive colors and not to perceive ones based on vision of human being. In this paper, we find a function to split colors of image into chromatic region of chromatic color region and achromatic region of achromatic color region. First, the input image of RGB color space is converted into the image of HSI color space in consideration of human vision and get a binary image from the converted image. After then, a function to split colors into ROC(ROC: Region of chromatic.) and ROA(ROA:Region of achromatic) is yield. It is difficult to split color of a general image into ROC and ROA. Therefore, to get the chromatic area and achromatic area, we make gradient images to have all range of intensity and range of saturation and to have a little range of hue and yield the function. The evaluation is tested using subjective-quality by 50 non-experts for result images of test images and general images. The results of the proposed method get better 27.5~32.96% than these of the conventional method

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.1062-1075
• /
• 2010

In the medical image application the difference of intensity is widely used for the image segmentation and feature extraction, and a well known method is the threshold technique that determines a threshold value and generates a binary image based on the threshold. A frequently-used threshold technique is the Otsu algorithm that provides efficient processing and effective selection criterion for choosing the threshold value. However, we cannot get good segmentation results by applying the Otsu algorithm to chest X-ray images. It is because there are various organic structures around lung regions such as ribs and blood vessels, causing unclear distribution of intensity levels. To overcome the ambiguity, we propose in this paper an effective algorithm to extract pulmonary regions that utilizes the Otsu algorithm after removing the background of an X-ray image, constructs intensity-level maps, and uses them for segmenting the X-ray image. To verify the effectiveness of our method, we compared it with the existing 1-dimensional and 2-dimensional Otsu algorithms, and also the results by expert's naked eyes. The experimental result showed that our method achieved the more accurate extraction of pulmonary regions compared to the Otsu methods and showed the similar result as the naked eye's one.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.181-188
• /
• 2012

An effective extraction method for extracting a coated tongue is proposed in this paper, which is used as the diagnostic criteria in the tongue diagnosis. Proposed method uses the fluorescence response characteristics of the coated tongue that is occurred by using the ultraviolet light. Specially, this method can solved the previous problems including the issue in the limits of the diagnosis environment and in the objectivity of the diagnosis results. In our method, original tongue image is acquired by using the ultraviolet light, and binarization is performed by thresholding a valley-points in the histogram that corresponds to the color difference of tongue body and tongue coating. Final view image is presented to the oriental doctor, after applying the canny-edge algorithm to the binary image, and edge image is added to the original image. In order to evaluate the performance of the our proposed method, after building a various tongue image, we compared the true region of coated tongue by the oriental doctor's hand with the extracted region by the our method. As a result, the proposed method showed the average 87.87% extraction ratio. The shape of the extracted coated tongue region showed also significantly higher similarity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.104-115
• /
• 2001

A new content-based color image retrieval method integrating the features of the color adjacency and the gradient is proposed in this paper. As the most used feature of color image, color histogram has its own advantages that it is invariant to the changes in viewpoint and the rotation of the image etc., and the computation of the feature is simple and fast. However, it is difficult to distinguish those different images having similar color distributions using histogram-based image retrieval, because the color histogram is generated on uniformly quantized colors and the histogram itself contains no spatial information. And another shortcoming of the histogram-based image retrieval is the storage of the features is usually very large. In order to prevent the above drawbacks, the gradient that is the largest color difference of neighboring pixels is calculated in the proposed method instead of the uniform quantization which is commonly used at most histogram-based methods. And the color adjacency information which indicates major color composition feature of an image is extracted and represented as a binary form to reduce the amount of feature storage. The two features are integrated to allow the retrieval more robust to the changes of various external conditions.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.1
• /
• pp.12-20
• /
• 2018

Efforts have been made to reconstruct low-resolution underwater images to high-resolution ones by using the image SR (Super-Resolution) method, all to improve efficiency when acquiring side-scan sonar images. As side-scan sonar images are similar with the optical images with respect to exploiting 2-dimensional signals, conventional image restoration methods for optical images can be considered as a solution. One of the most typical super-resolution methods for optical image is a sparse coding and there are studies for verifying applicability of sparse coding method for underwater images by analyzing sparsity of underwater images. Sparse coding is a method that obtains recovered signal from input signal by linear combination of dictionary and sparse coefficients. However, it requires huge computational load to accurately estimate sparse coefficients. In this study, a sparse coding based underwater image super-resolution method is applied while a selective reconstruction method for object region is suggested to reduce the processing time. For this method, this paper proposes an edge detection and object and non object region classification method for underwater images and combine it with sparse coding based image super-resolution method. Effectiveness of the proposed method is verified by reducing the processing time for image reconstruction over 32 % while preserving same level of PSNR (Peak Signal-to-Noise Ratio) compared with conventional method.