• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.248-249
• /
• 2022

In this paper, we propose a method for classifying and tracking objects based on information of multiple users obtained using RGB-D cameras. The 3D information and color information acquired through the RGB-D camera are acquired and information about each user is stored. We propose a user classification and location tracking algorithm in the entire image by calculating the similarity between users in the current frame and the previous frame through the information on the location and appearance of each user obtained from the entire image.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.631-634
• /
• 2008

인터넷을 이용한 사람들의 사회 참여가 확대되면서 다양한 의견(Opinion)들이 급속도로 증가하고 있으며 이러한 의견을 분석하여 유용한 정보로 활용하기 위한 연구가 활발히 진행되고 있다. 그 중에서도 상품리뷰는 기업에서 연구, 개발, 마케팅의 주요 자료로 사용되고 있으며 사용자가 상품의 구매를 결정하는 중요한 요인 중 하나로 작용하고 있다. 본 논문에서는 한국어로 이루어진 상품 리뷰를 분석하여 의견 자질(Feature)을 추출하고 분류(Classification)하는 시스템을 설계하고 구현하였다. 한글 의견 자질 추출을 위하여 먼저 한글 상품 리뷰를 분석하여 의견 사전을 구축하였다. 의견 사전으로는 의견 자질과 의견 어휘, 독립의견어휘, 의견 숙어, 부정어 등의 각기 다른 세부 사전을 구축하여 리뷰 분석 시 단계적으로 적용하여 정확도를 높일 수 있도록 설계하였다. 이렇게 구현된 시스템을 평가하기 위하여 각기 다른 3개의 도메인에서 실제 한국어 리뷰를 수집하여 실험을 수행하였으며 자질 추출에서는 평균 78.86% 정확률, 61.41% 재현율을, 극성 분류에서는 평균 69.46% 정확률, 42.26% 재현율을 나타냈다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.125-128
• /
• 2008

현대사회에서 건강을 해치는 요인으로 흡연, 당뇨, 비만 및 스트레스 등이 있다. 이와 같은 요인들로 순환기질환의 발병이 증가하고 있으며, 특히 심장 질환 사망률이 점차 증가하고 있는 실정이다. 이를 해결하기 위해 본 논문에서는 심장 질환에 대한 조기 진단을 위한 음성 분석학적 특징 요소를 분석하여 결과값을 추출하고자 한다. 이를 위해 본 논문에서는 대전 지역에 거주하고 있는 성인 남성중에서 심장 질환을 앓고 있는 환자들과 심장에 이상이 없는 정상인들로 피실험자 집단을 구성하고 이들의 음성을 수집하여 음성 분석학적 특징 요소들을 추출하고자 한다. 특히 동의보감에서 제시한 심장의 소리를 음성 공학적으로 입증하기 위해 제 5 포먼트와 지터 등의 출력값을 비교, 분석하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.605-607
• /
• 2023

Recent research has highlighted the effectiveness of Deep Learning (DL) techniques in automating the detection of lung sound anomalies. However, the available lung sound datasets often suffer from limitations in both size and balance, prompting DL methods to employ data preprocessing such as augmentation and transfer learning techniques. These strategies, while valuable, contribute to the increased complexity of DL models and necessitate substantial training memory. In this study, we proposed a streamlined and lightweight DL method but effectively detects lung sound anomalies from small and imbalanced dataset. The utilization of 1D dilated convolutional neural networks enhances sensitivity to lung sound anomalies by efficiently capturing deep temporal features and small variations. We conducted a comprehensive evaluation of the ICBHI dataset and achieved a notable improvement over state-of-the-art results, increasing the average score of sensitivity and specificity metrics by 2.7%.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.5
• /
• pp.259-265
• /
• 2023

Pedestrian detection is used to effectively detect pedestrians in various situations based on deep learning. Pedestrian detection has difficulty detecting pedestrians due to problems such as camera performance, pedestrian description, height, and occlusion. Even in the same pedestrian, performance in detecting them can differ according to the height of the pedestrian. The height of general pedestrians encompasses various scales, such as those of infants, adolescents, and adults, so when the model is applied to one group, the extraction of data becomes inaccurate. Therefore, this study proposed a pedestrian detection method that fine-tunes the pedestrian area by Refining Layer and Feature Concatenation to consider various heights of pedestrians. Through this, the score and location value for the pedestrian area were finely adjusted. Experiments on four types of test data demonstrate that the proposed model achieves 2-5% higher average precision (AP) compared to Faster R-CNN and DRPN.

• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.209-213
• /
• 2023

In recent years, the image processing mechanisms are used widely in several medical areas for improving earlier detection and treatment stages, in which the time factor is very important to discover the disease in the patient as possible as fast, especially in various cancer tumors such as the liver cancer. Liver cancer has been attracting the attention of medical and sciatic communities in the latest years because of its high prevalence allied with the difficult treatment. Statistics indicate that liver cancer, throughout world, is the one that attacks the greatest number of people. Over the time, study of MR images related to cancer detection in the liver or abdominal area has been difficult. Early detection of liver cancer is very important for successful treatment. There are few methods available to detect cancerous cells. In this paper, an automatic approach that integrates the intensity-based segmentation and k-means clustering approach for detection of cancer region in MRI scan images of liver.

• Journal of Information Processing Systems
• /
• v.19 no.5
• /
• pp.663-672
• /
• 2023

Most vehicle detection methods have poor vehicle feature extraction performance at night, and their robustness is reduced; hence, this study proposes a night vehicle detection method based on style transfer image enhancement. First, a style transfer model is constructed using cycle generative adversarial networks (cycleGANs). The daytime data in the BDD100K dataset were converted into nighttime data to form a style dataset. The dataset was then divided using its labels. Finally, based on a YOLOv5s network, a nighttime vehicle image is detected for the reliable recognition of vehicle information in a complex environment. The experimental results of the proposed method based on the BDD100K dataset show that the transferred night vehicle images are clear and meet the requirements. The precision, recall, mAP@.5, and mAP@.5:.95 reached 0.696, 0.292, 0.761, and 0.454, respectively.

• Journal of information and communication convergence engineering
• /
• v.22 no.1
• /
• pp.56-63
• /
• 2024

Despite the rapid strides in content-based image retrieval, a notable disparity persists between the visual features of images and the semantic features discerned by humans. Hence, image retrieval based on the association of semantic similarities recognized by humans with visual similarities is a difficult task for most image-retrieval systems. Our study endeavors to bridge this gap by refining image semantics, aligning them more closely with human perception. Deep learning techniques are used to semantically classify images and retrieve those that are semantically similar to personalized images. Moreover, we introduce a keyword-based image retrieval, enabling automatic labeling of images in mobile environments. The proposed approach can improve the performance of a mobile device with limited resources and bandwidth by performing retrieval based on the visual features and keywords of the image on the mobile device.

• Journal of Broadcast Engineering
• /
• v.22 no.6
• /
• pp.713-723
• /
• 2017

Since the panoramic image can overcome the limitation of the viewing angle of the camera and have a wide field of view, it has been studied effectively in the fields of computer vision and stereo camera. In order to generate a panoramic image, stitching images taken by a plurality of general cameras instead of using a wide-angle camera, which is distorted, is widely used because it can reduce image distortion. The image stitching technique creates descriptors of feature points extracted from multiple images, compares the similarities of feature points, and links them together into one image. Each feature point has several hundreds of dimensions of information, and data processing time increases as more images are stitched. In particular, when a panorama is generated on the basis of an image photographed by a plurality of unspecified cameras with respect to an object, the extraction processing time of the overlapping feature points for similar images becomes longer. In this paper, we propose a preprocessing process to efficiently process stitching based on an image obtained from a number of unspecified cameras for one object or environment. In this way, the data processing time can be reduced by pre-grouping images based on camera sensor information and reducing the number of images to be stitched at one time. Later, stitching is done hierarchically to create one large panorama. Through the grouping preprocessing proposed in this paper, we confirmed that the stitching time for a large number of images is greatly reduced by experimental results.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.359-368
• /
• 2002

In this paper, we propose effective boundary line extraction algorithm for moving objects by matching error image and moving vectors, and fast tracking algorithm for moving object by partial boundary lines. We extracted boundary line for moving object by generating seeds with probability distribution function based on Watershed algorithm, and by extracting boundary line for moving objects through extending seeds, and then by using moving vectors. We processed tracking algorithm for moving object by using a part of boundary lines as features. We set up a part of every-direction boundary line for moving object as the initial feature vectors for moving objects. Then, we tracked moving object within current frames by using feature vector for the previous frames. As the result of the simulation for tracking moving object on the real images, we found that tracking processing of the proposed algorithm was simple due to tracking boundary line only for moving object as a feature, in contrast to the traditional tracking algorithm for active contour line that have varying processing cost with the length of boundary line. The operations was reduced about 39% as contrasted with the full search BMA. Tracking error was less than 4 pixel when the feature vector was $(15\times{5)}$ through the information of every-direction boundary line. The proposed algorithm just needed 200 times of search operation.