• 한국감성과학회:학술대회논문집
• /
• 한국감성과학회 2000년도 춘계 학술대회 및 국제 감성공학 심포지움 논문집 Proceeding of the 2000 Spring Conference of KOSES and International Sensibility Ergonomics Symposium
• /
• pp.126-132
• /
• 2000

This paper presents a facial expression recognition based on Gabor wavelets that uses a fuzzy C-means(FCM) clustering algorithm and neural network. Features of facial expressions are extracted to two steps. In the first step, Gabor wavelet representation can provide edges extraction of major face components using the average value of the image's 2-D Gabor wavelet coefficient histogram. In the next step, we extract sparse features of facial expressions from the extracted edge information using FCM clustering algorithm. The result of facial expression recognition is compared with dimensional values of internal stated derived from semantic ratings of words related to emotion. The dimensional model can recognize not only six facial expressions related to Ekman's basic emotions, but also expressions of various internal states.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume I
• /
• pp.188-190
• /
• 2006

A multistage hierarchical clustering technique, which is an unsupervised technique, was suggested in this paper for classifying large remotely-sensed imagery. The multistage algorithm consists of two stages. The local segmentor of the first stage performs regiongrowing segmentation by employing the hierarchical clustering procedure of CN-chain with the restriction that pixels in a cluster must be spatially contiguous. This stage uses a sliding window strategy with boundary blocking to alleviate a computational problem in computer memory for an enormous data. The global segmentor of the second stage has not spatial constraints for merging to classify the segments resulting from the previous stage. The experimental results show that the new approach proposed in this study efficiently performs the segmentation for the images of very large size and an extensive number of bands

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2371-2374
• /
• 2003

In transmitting compressed video bit-stream over Internet, packet loss causes error propagation in both spatial and temporal domain, which in turn leads to severe degradation in image qualify In this paper, a new approach for the recovery of lost or erroneous Motion Vector(MV)s by clustering the movements of neighboring blocks by their homogeneity is proposed. MVs of neighboring blocks are clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in many cases than existing methods.

• 한국정보통신학회논문지
• /
• 제16권7호
• /
• pp.1377-1382
• /
• 2012

본 논문에서는 가전기기에 탑재 된 FND에 표시되는 부호화 된 코드를 스마트폰으로 촬영하여 이로부터 원문데이터를 추출하는 인식기법에 대해 제안한다. 제안하는 스마트폰 기반의 FND 인식 기법은 먼저 차영상을 이용하여 입력되는 영상에서 FND의 위치를 추정한 뒤 RGB값 클러스터링을 통해 Segment를 추출한다. 다음으로 기울어진 Segment에 대한 정규화 과정을 거친 뒤 상대적인 거리를 이용하여 각각의 Segment를 인식한다. 실험을 통해 실제 스마트폰에서 사용 시 속도와 인식률이 모두 양호함을 확인하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.117-118
• /
• 2007

A robot needs a human detection algorithm for interaction with a human. This paper proposes a method that finds people using a SVM (support vector machine) classifier and a stereo camera. Feature vectors of SVM are extracted by HoG (histogram of gradient) within images. After training extracted vectors from the clustered images, the SVM algorithm creates a classifier for human detection. Each candidate for a human in the image is generated by clustering of depth information from a stereo camera and the candidate is evaluated by the classifier. When compared with the existing method of creating candidates for a human, clustering reduces computational time. The experimental results demonstrate that the proposed approach can be executed in real time.

• 대한자기공명의과학회:학술대회논문집
• /
• 대한자기공명의과학회 2002년도 제7차 학술대회 초록집
• /
• pp.126-126
• /
• 2002

Purpose： For quantitative analysis of the cardiac diseases, it is necessary to segment the left-ventricle(LV) in MR cardiac images. Snake or active contour model has been used to segment LV boundary. In using these models, however, the contour of the LV may not converge to the desirable one because the contour may fall into local minimum value due to image artifact in inner region of the LV Therefore, in this paper, we propose the new preprocessing method using K-means clustering and merging algorithms that can improve the performance of the active contour model.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2012년도 추계학술발표대회
• /
• pp.367-368
• /
• 2012

Possibilistic c-means (PCM) 알고리즘은 fuzzy c-means (FCM) 의 노이즈 민감성을 극복하기 위해 제안 되었다. 하지만, PCM 은 사용되는 시스템 파라미터들의 초기화와 coincident 클러스터링 문제로 인하여 그 성능이 민감하다. 본 논문에서는 이러한 문제점들을 극복하기 위해 개미군집 알고리즘(Ant colony algorithm)을 이용한 퍼지 클러스터링(fuzzy clustering) 알고리즘을 제안한다. 먼저, 개미군집 알고리즘을 통해 PCM 의 클러스터 개수 및 중심 값 파라미터를 최적화 하고, 미리 분류된 화소 정보를 이용하여 PCM 의 coincident 클러스터링 문제를 해결하였다. 제안된 알고리즘의 효율성을 의료 영상 분할 문제에 적용하여 확인하였다.

• 대한임베디드공학회논문지
• /
• 제6권1호
• /
• pp.8-15
• /
• 2011

This paper presents an effective method for detecting vehicles in front of the camera-assisted car during nighttime driving. The proposed method detects vehicles based on detecting vehicle headlights and taillights using techniques of image segmentation and clustering. First, in order to effectively extract spotlight of interest, a pre-signal-processing process based on camera lens filter and labeling method is applied on road-scene images. Second, to spatial clustering vehicle of detecting lamps, a grouping process use light tracking method and locating vehicle lighting patterns. For simulation, we are implemented through Da-vinci 7437 DSP board with visible light mono-camera and tested it in urban and rural roads. Through the test, classification performances are above 89% of precision rate and 94% of recall rate evaluated on real-time environment.

• ETRI Journal
• /
• 제40권6호
• /
• pp.788-793
• /
• 2018

3D reconstruction of urban architecture, land, and roads is an important part of building a "digital city." Unmanned aerial vehicles (UAVs) are gradually replacing other platforms, such as satellites and aircraft, in geographical image collection; the reason for this is not only lower cost and higher efficiency, but also higher data accuracy and a larger amount of obtained information. Recent 3D reconstruction algorithms have a high degree of automation, but their computation time is long and the reconstruction models may have many voids. This paper decomposes the object into multiple regional parallel reconstructions using the clustering principle, to reduce the computation time and improve the model quality. It is proposed to detect the planar area under low resolution, and then reduce the number of point clouds in the complex area.

• 컴퓨터교육학회논문지
• /
• 제8권1호
• /
• pp.81-91
• /
• 2005

본 논문에서는 칼라와 에지 정보를 이용한 내용기반 영상검색 기법을 제안하였다. 기존의 RGB 공간 정보를 이용하기 보다는, 시각적 인식에 보다 중점을 둔 HSI칼라 공간에서 고찰하였다. 비슷한 류의 색을 대표색으로 통합 표현하여, 개선된 칼라 정보 이용법을 본 연구에서 제안하였다. 또한 칼라 정보만을 이용했을 때의 시스템 성능상의 결점을 보완하기 위하여, 효율적인 에지 디텍션 기법을 함께 사용하였다. 칼라와 에지 기법을 통합함에 있어서, 각각의 기법에 적절한 가중치를 배분함으로써 시스템 성능을 실험적으로 향상시켰다.