• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.1
• /
• pp.62-68
• /
• 1999

The attitude of a vehicle can be precisely determined using GPS carrier phase measurements from more than two antennas attached to a vehicle and an efficient integer ambiguity resolution technique. Many methods utilizing the known baseline length as a constraint of independent elements of integer ambiguities are proposed to resolve integer ambiguity at real time. Three-dimensional search space is reduced to two-dimensional search space with this constraint. Thus the true integer ambiguity can be easily determined with less computational burden and fewer number of measurements. But there are still strong requirements for the real time integer ambiguity resolution, which uses single epoch measurement of long baseline. In this paper, a new constraint from the geometry of multiple baselines is derived. With this new constraint, two-dimensional search space is further reduced to one-dimensional search space. It makes possible to determine integer ambiguity with single epoch measurement. The proposed method is applied to real data to show its effectiveness.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.441-444
• /
• 2013

It is shown that any two-dimensional globally hyperbolic spacetime with noncompact Cauchy surfaces has no null cut points.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.24 no.7
• /
• pp.730-736
• /
• 2013

Time-domain clutter generation model for airborne pulse doppler phase-array radar is presented. Time-domain surface clutter signal is generated assuming earth of a sphere and considering geometry of a clutter patch, and generation of sub-array clutter signal is presented. The generated sub-array clutter signal can be used by simulation input signal in various radar applications of DBF(Digital Beamforming), ABF(Adaptive Beamforming), Stap(Space-Time Adaptive Processing) and etc.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05a
• /
• pp.137-141
• /
• 1996

A new general high order consistent nodal method for solving the 3-D multigroup neutron kinetic equations in (x-y-z) geometry has been derived by expending the flux in a multiple polynomial series for the space variables by without the quadratic fit approximations of the transverse leakage and for the time variable and using a weighted-integral technique. The derived equation set is consistent mathematically, and therefore, we can expect very accurate solutions and less computing time since we can use coarse meshes in time variable as well as in spatial variables and the solution would converge exactly in fine mesh limit.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.865-872
• /
• 2006

Cooperative communications (CC) have received a great deal of attention recently as an efficient way to obtain the spatial diversity without physical arrays. Thus, space-time block codes (STBC) which are well-known for use in co-located multi-antenna systems can be still utilized for single-antenna users in a distributed fashion. In this paper, we propose a cooperative signaling structure using the $\frac{3}{4}$-rate STBC and derive closed-form BER expression which takes the effect of network geometry and transmit power constraint into account. A variety of simulated and numerical results demonstrated the cooperation considerably outperforms the direct transmission when partners are located in appropriate positions.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.1
• /
• pp.107-117
• /
• 2004

A new algorithm for planning a collision-free path based on an algebraic curve as well as the concept of path space is developed. Robot path planning has so far been concerned with generating a single collision-free path connecting two specified points in a given robot workspace with appropriate constraints. In this paper, a novel concept of path space (PS) is introduced. A PS is a set of points that represent a connection between two points in Euclidean metric space. A geometry mapping (GM) for the systematic construction of path space is also developed. A GM based on the 2$^{nd}$ order base curve, specifically Bezier curve of order two is investigated for the construction of PS and for collision-free path planning. The Bezier curve of order two consists of three vertices that are the start, S, the goal, G, and the middle vertex. The middle vertex is used to control the shape of the curve, and the origin of the local coordinate (p, $\theta$) is set at the centre of S and G. The extreme locus of the base curve should cover the entire area of actual workspace (AWS). The area defined by the extreme locus of the path is defined as quadratic workspace (QWS). The interference of the path with obstacles creates images in the PS. The clear areas of the PS that are not mapped by obstacle images identify collision-free paths. Hence, the PS approach converts path planning in Euclidean space into a point selection problem in path space. This also makes it possible to impose additional constraints such as determining the shortest path or the safest path in the search of the collision-free path. The QWS GM algorithm is implemented on various computer systems. Simulations are carried out to measure performance of the algorithm and show the execution time in the range of 0.0008 ~ 0.0014 sec.

• Journal of Platform Technology
• /
• v.6 no.4
• /
• pp.18-25
• /
• 2018

This paper describes a real-time human and robot tracking method in Intelligent Space with multi-camera networks. The proposed method detects candidates for humans and robots by using the histogram of oriented gradients (HOG) feature in an image. To classify humans and robots from the candidates in real time, we apply cascaded structure to constructing a strong classifier which consists of many weak classifiers as follows: a linear support vector machine (SVM) and a radial-basis function (RBF) SVM. By using the multiple view geometry, the method estimates the 3D position of humans and robots from their 2D coordinates on image coordinate system, and tracks their positions by using stochastic approach. To test the performance of the method, humans and robots are asked to move according to given rectangular and circular paths. Experimental results show that the proposed method is able to reduce the localization error and be good for a practical application of human-centered services in the Intelligent Space.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.162-171
• /
• 1999

Plane sweep plays an important role in computational geometry. This paper shows that an extension of topological plane sweep to three-dimensional space can calculate the volume swept by rotating a solid polyhedral object about a fixed axis. Analyzing the characteristics of rotational swept volumes, we present an incremental algorithm based on the three-dimensional topological sweep technique. Our solution shows the time bound of O(n²·2?+T?), where n is the number of vertices in the original object and T? is time for handling face cycles. Here, α(n) is the inverse of Ackermann's function.

• Journal of Computing Science and Engineering
• /
• v.4 no.3
• /
• pp.207-224
• /
• 2010

This paper presents a compression scheme for mesh geometry, which is suitable for mobile graphics. The main focus is to enable real-time decoding of compressed vertex positions while providing reasonable compression ratios. Our scheme is based on local quantization of vertex positions with mesh partitioning. To prevent visual seams along the partitioning boundaries, we constrain the locally quantized cells of all mesh partitions to have the same size and aligned local axes. We propose a mesh partitioning algorithm to minimize the size of locally quantized cells, which relates to the distortion of a restored mesh. Vertex coordinates are stored in main memory and transmitted to graphics hardware for rendering in the quantized form, saving memory space and system bus bandwidth. Decoding operation is combined with model geometry transformation, and the only overhead to restore vertex positions is one matrix multiplication for each mesh partition. In our experiments, a 32-bit floating point vertex coordinate is quantized into an 8-bit integer, which is the smallest data size supported in a mobile graphics library. With this setting, the distortions of the restored meshes are comparable to 11-bit global quantization of vertex coordinates. We also apply the proposed approach to compression of vertex attributes, such as vertex normals and texture coordinates, and show that gains similar to vertex geometry can be obtained through local quantization with mesh partitioning.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.14 no.2
• /
• pp.68-74
• /
• 2000

In this paper the concentration, yield and generation quantity of the ozone by the superposition discharge according to the coaxial electrodes geometry is described. In order to improve the ozone generation, a new type of ozonizer is proposed, where a silent discharge and a surface discharge are generated in the separated discharge spaces at the same time. To investigate the ozone generation dependency on electrode geometry, a few discharge tubes with different geometry were fabricated. In our experiment, the 60[Hz] one phase voltage is applied to the discharge tube which has three electrodes. And three kinds of discharges, two silent discharges and a surface discharge are superposed in the same space of the ozonizer. As a result, the followings are obvious. When two kinds of discharges are superposed under the condition using 3 electrode-3gap discharge tube, the maximum ozone efficiency is obtained.