• 한국컴퓨터정보학회논문지
• /
• 제28권4호
• /
• pp.41-51
• /
• 2023

본 논문에서는 보행자의 걸음걸이로부터 분노 감정 검출을 위한 다중 시간 윈도 특징 추출 기술을 제안한다. 기존의 걸음걸이 기반 감정인식 기술에서는 보행자의 보폭, 한 보폭에 걸리는 시간, 보행 속력, 목과 흉부의 전방 기울기 각도(Forward Tilt Angle)를 계산하고, 전체 구간에 대해서 최솟값, 평균값, 최댓값을 계산해서 이를 특징으로 활용하였다. 하지만 이때 각 특징은 보행 전체 구간에 걸쳐 항상 균일하게 변화가 발생하는 것이 아니라, 때로는 지역적으로 변화가 발생한다. 이에 본 연구에서는 장기부터 중기 그리고 단기까지 즉, 전역적인 특징과 지역적인 특징을 모두 추출할 수 있는 다중 시간 윈도 특징 추출(Multi-Time Window Feature Extraction) 기술을 제안한다. 또한, 제안하는 특징 추출 기술을 통해 각 구간에서 추출된 특징들을 효과적으로 학습할 수 있는 앙상블 모델을 제안한다. 제안하는 앙상블 모델(Ensemble Model)은 복수의 분류기로 구성되며, 각 분류기는 서로 다른 다중 시간 윈도에서 추출된 특징으로 학습된다. 제안하는 특징 추출 기술과 앙상블 모델의 효과를 검증하기 위해 일반인에게 공개된 3차원 걸음걸이 데이터 세트를 사용하여 시험 평가를 수행했다. 그 결과, 4가지 성능 평가지표에 대해서 제안하는 앙상블 모델이 기존의 특징 추출 기술로 학습된 머신러닝(Machine Learning) 모델들과 비교하여 최고의 성능을 달성하는 것을 입증하였다.

• International Journal of Control, Automation, and Systems
• /
• 제1권3호
• /
• pp.332-338
• /
• 2003

Content-based image retrieval is the research of images from database, that are visually similar to given image examples. Gabor functions and Gabor filters are regarded as excellent methods for feature extraction and texture segmentation. However, they have a disadvantage not to perform well in case of a rotated image because of its direction-oriented filter. This paper proposes a method of extracting local texture features from blocks with central interest points detected in an image and a rotation invariant Gabor wavelet filter. We also propose a method of comparing pattern histograms of features classified by VQ (Vector Quantization) among images.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1589-1592
• /
• 1997

Among the prerequisite abilities (perception of environment, path planning and position estimation) of an autonomous mobile robot, position estimation has been seldom studied by mobile robot researchers. In most cases, conventional positioin estimation has been performed by placing landmarks or giving the entrire environmental information in advance. Unlikely to the conventional ones, the study addresses a new method that the robot itself can select distinctive features in the environment and save them as landmarks without any a priori knowledge, which can maximize the autonomous behavior of the robot. First, an orjentaion probaility model is applied to construct a lcoal map of robot's surrounding. The feature of the object in the map is then extracted and the map is saved as landmark. Also, presented is the position estimation method that utilizes the correspondence between landmarks and current local map. In dong this, the uncertainty of the robot's current positioin is estimated in order to select the corresponding landmark stored in the previous steps. The usefulness of all these approaches are illustrated with the results porduced by a real robot equipped with ultrasonic sensors.

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

In this paper we present a teleoperation system of an internet-based mobile robot based on H.263 image compression algorithm. We control remotely the networked mobile robot with vision over the internet under unknown environments in the real time. The main feature of this system is that local operators need to download and install a client program and so they can command the robot in a remote location. Image information of remote location is compressed by H.263 video codec algorithm and then transmitted to a local operator. We constructed and tested a networked autonomous mobile robot in the real field. The experimental results show the usefulness of the robot under test.

• International Journal of Control, Automation, and Systems
• /
• 제5권5호
• /
• pp.577-583
• /
• 2007

Simultaneous Localization and Mapping (SLAM) is the process of building a map of an unknown environment and simultaneously localizing a robot relative to this map. SLAM is very important for the indoor navigation of a mobile robot and much research has been conducted on this subject. Although feature-based SLAM using an Extended Kalman Filter (EKF) is widely used, it has shortcomings in that the computational complexity grows in proportion to the square of the number of features. This prohibits EKF-SLAM from operating in real time and makes it unfeasible in large environments where many features exist. This paper presents an algorithm which reduces the computational complexity of EKF-SLAM by using topological information (TI) extracted through a thinning process. The global map can be divided into local areas using the nodes of a thinning-based topological map. SLAM is then performed in local instead of global areas. Experimental results for various environments show that the performance and efficiency of the proposed EKF-SLAM/TI scheme are excellent.

• 대한임베디드공학회논문지
• /
• 제4권4호
• /
• pp.190-194
• /
• 2009

Iris recognition is a biometric technology which can identify a person using the iris pattern. Recently, using iris information is used in many fields such as access control and information security. But Perform complex operations to extract features of the iris. Because high-end hardware for real-time iris recognition is required. This paper is appropriate for the embedded environment using local gradient histogram embedded system with iris feature extraction methods based on USN(Ubiquitous Sensor Network). Experimental results show that the performance of proposed method is comparable to existing methods using Gabor transform noticeably improves recognition performance and it is noted that the processing time of the local gradient histogram transform is much faster than that of the existing method and rotation was also a strong attribute.

• 경영과학
• /
• 제22권2호
• /
• pp.99-107
• /
• 2005

Recently, Tang and Chanson proposed a minimum cost distribution model for replicated Web contents subject to an expiration-based consistency management. Their model is a progress in that it can consider multiple replicas via the network of servers located on the Web. The proposed greedy heuristic, however, has an undesirable feature that the solution tends to converge a local optimum at an early stage of the algorithm. in this paper, we propose an algorithm based on a simple idea of preventing the early local convergence. The new algorithm provides solutions whose cost are, on the average, 27$\%$ lower than in the previous algorithm.

• International Journal of Contents
• /
• 제5권4호
• /
• pp.55-61
• /
• 2009

In this paper, we propose a hierarchical method for segmenting a given 3D mesh, which hierarchically clusters sharp vertices of the mesh using the metric of geodesic distance among them. Sharp vertices are extracted from the mesh by analyzing convexity that reflects global geometry. As well as speeding up the computing time, the sharp vertices of this kind avoid the problem of local optima that may occur when feature points are extracted by analyzing the convexity that reflects local geometry. For obtaining more effective results, the sharp vertices are categorized according to the priority from the viewpoint of cognitive science, and the reasonable number of clusters is automatically determined by analyzing the geometric features of the mesh.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.45-45
• /
• 2000

This paper proposes a remote control system that combines computer network and an autonomous mobile robot. We control remotely an autonomous mobile robot with vision via the internet to guide it under unknown environments in the real time. The main feature of this system is that local operators need a World Wide Web browser and a computer connected to the internet communication network and so they can command the robot in a remote location through our Home Page. The hardware architecture of this system consists of an autonomous mobile robot, workstation, and local computers. The software architecture of this system includes the server part for communication between user and robot and the client part for the user interface and a robot control system. The server and client parts are developed using Java language which is suitable to internet application and supports multi-platform. Furthermore, this system offers an image compression method using motion JPEG concept which reduces large time delay that occurs in network during image transmission.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.311-311
• /
• 2000

We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.