• 한국정보통신학회논문지
• /
• 제10권7호
• /
• pp.1253-1258
• /
• 2006

모바일 벡터 지도 서비스 환경에는 공간 데이터의 특성상 큰 데이터 용량으로 인한 단말기 리소스 부족과 전송시간 지연과 같은 애로사항이 존재 한다. 정상적인 모바일 벡터 지도 서비스가 이루어지기 위해서는 이러한 문제점들을 극복하기 위한 대책들이 필요하다 그중에서 공간데이터 압축기법은 대역폭과 클라이언트에서의 대기 시간 축소에 도움을 줄 수 있다. 하지만 압축과 복원에 소요되는 오버헤드가 전체 효율에 미치는 영향도 함께 고찰할 필요가있다. 본 논문은 공간 데이터를 압축하기 위한 2가지 기법을 제시한다. 하나는 공간 객체별로 기준 좌표 및 상대 좌표를 전송하는상대좌표 변환 압축기법이고 또 하나는 클라이언트 좌표로 서버에서 미리 좌표 변환하는 클라이언트 좌표 변환 압축 기법이다. 그리고 구현 실험으로 그 효과와 효율을 평가한다.

• 대한임베디드공학회논문지
• /
• 제3권2호
• /
• pp.102-108
• /
• 2008

This paper describes a mapping and localization based on wave algorithm[11] and Kalman filter for effective SLAM. Each robot in a multi robot system has its own task such as building a map for its local position. By combining their data into a shared map, the robot scans actively seek to verify their relative locations. For simultaneous localization the algorithm which is well known as Kalman Filter (KF) is used. For modelling the robot position we wish to know three parameters (x, y coordinates and its orientation) which can be combined into a vector called a state variable vector. The Kalman Filter is a smart way to integrate measurement data into an estimate by recognizing that measurements are noisy and that sometimes they should ignored or have only a small effect on the state estimate. In addition to an estimate of the state variable vector, the algorithm provides an estimate of the state variable vector uncertainty i.e. how confident the estimate is, given the value for the amount of error in it.

• Journal of Electrical Engineering and Technology
• /
• 제12권1호
• /
• pp.428-435
• /
• 2017

In this paper, we propose a novel motion field estimation algorithm for which a U-disparity map and forward-and-backward error removal are applied in a vehicular environment. Generally, a motion exists in an image obtained by a camera attached to a vehicle by vehicle movement; however, the obtained motion vector is inaccurate because of the surrounding environmental factors such as the illumination changes and vehicles shaking. It is, therefore, difficult to extract an accurate motion vector, especially on the road surface, due to the similarity of the adjacent-pixel values; therefore, the proposed algorithm first removes the road surface region in the obtained image by using a U-disparity map, and uses then the optical flow that represents the motion vector of the object in the remaining part of the image. The algorithm also uses a forward-backward error-removal technique to improve the motion-vector accuracy and a vehicle's movement is predicted through the application of the RANSAC (RANdom SAmple Consensus) to the previously obtained motion vectors, resulting in the generation of a motion field. Through experiment results, we show that the performance of the proposed algorithm is superior to that of an existing algorithm.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2004년도 춘계종합학술대회
• /
• pp.358-362
• /
• 2004

컴퓨터와 통신 기술의 빠른 발전으로 모바일 인터넷 서비스의 요구가 급격히 증대하고 있다. 그러나 모바일 벡터 지도 서비스 환경에서의 가장 큰 걸림돌은 큰 데이터 용량과 제한된 대역폭이다. 많은 가능한 해결방안중 공간 데이터 압축 기법이 대역폭과 클라이언트에서의 대기 시간 축소에 공헌할 수 있을 것으로 기대된다. 본 논문은 공간 데이터를 압축하기 위한 2가지 기법을 제시한다. 하나는 공간 객체별로 기준 좌표 및 상대 좌표를 전송하는 상대좌표 변환 압축 기법이고 또 하나는 클라이언트 좌표로 서버에서 미리 좌표 변환하는 클라이언트좌표 변환 압축 기법이다. 이 두 압축 기법은 압축 효율과 응답시간을 측정하여 평가할 수 있다.

• 제어로봇시스템학회논문지
• /
• 제12권5호
• /
• pp.473-479
• /
• 2006

A global path planning algorithm using modified self-organizing feature map(SOFM) which is a method among a number of neural network is presented. The SOFM uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors of the 2-dimensional mesh, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the opposite direction of input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

• 한국정밀공학회지
• /
• 제20권5호
• /
• pp.47-56
• /
• 2003

Geometric cutting-simulation and verification play an important role in detecting NC machining errors in mold & die manufacturing and thereby reducing correcting time & cost on the shop floor. Current researches in the area may be categorized into view-based, solid-based, and discrete vector-based methods mainly depending on workpiece models. Each methodology has its own strengths and weaknesses in terms of computing speed, representation accuracy, and its ability of numerical inspection. The paper proposes a hybrid modeling scheme for workpiece representation with z-map model and discrete vector model, which performs 3-axis and 5-axis cutting-simulation via tool swept surface construction by connecting a sequence of silhouette curves.

• 대한수학회보
• /
• 제50권3호
• /
• pp.935-949
• /
• 2013

In this paper, we study surfaces in $\mathb{E}^3$ whose Gauss map G satisfies the equation ${\Box}G=f(G+C)$ for a smooth function $f$ and a constant vector C, where ${\Box}$ stands for the Cheng-Yau operator. We focus on surfaces with constant Gaussian curvature, constant mean curvature and constant principal curvature with such a property. We obtain some classification and characterization theorems for these kinds of surfaces. Finally, we give a characterization of surfaces whose Gauss map G satisfies the equation ${\Box}G={\lambda}(G+C)$ for a constant ${\lambda}$ and a constant vector C.

• International Journal of Internet, Broadcasting and Communication
• /
• 제9권1호
• /
• pp.9-17
• /
• 2017

This paper describes a process of developing commercial real time image recognition system with company. In this paper we will make a system that is combining an empirical kernel map method and conjugate least squares support vector machine in order to represent images in a low-dimensional subspace for real time image recognition. In the traditional approach calculating these eigenspace models, known as traditional PCA method, model must capture all the images needed to build the internal representation. Updating of the existing eigenspace is only possible when all the images must be kept in order to update the eigenspace, requiring a lot of storage capability. Proposed method allows discarding the acquired images immediately after the update. By experimental results we can show that empirical kernel map has similar accuracy compare to traditional batch way eigenspace method and more efficient in memory requirement than traditional one. This experimental result shows that proposed model is suitable for commercial real time image recognition system.

• 한국멀티미디어학회논문지
• /
• 제22권9호
• /
• pp.1122-1131
• /
• 2019

This paper covers research on terrain construction for unmanned aerial vehicle simulators using spatial information that was distributed by public institutions. Aerial photography, DEM, vector maps and 3D model data were used in order to create a realistic terrain simulator. A data converting method was suggested while researching, so it was generated to automatically arrange and build city models (vWorld provided) and classification methods so that realistic images could be generated by 3D objects. For example: rivers, forests, roads, fields and so on, were arranged by aerial photographs, vector map (land cover map) and terrain construction based on the tile map used by DEM. In order to verify the terrain data of unmanned aircraft simulators produced by the proposed method, the location accuracy was verified by mounting onto Unreal Engine and checked location accuracy.

• Journal of the Korean Data and Information Science Society
• /
• 제18권2호
• /
• pp.439-445
• /
• 2007

GVF can solve two difficulties with Snakes that are on setting initial contour and have a hard time processing into boundary concavities. But GVF takes much longer computation time than the existing Snakes because of their edge map and partial derivatives. Therefore this paper analyzed the computation time between GVF and Snakes. As a simulation result, both algorithms took almost similar computation time in simple image. In real images, GVF took about two times computation than Snakes.