• Journal of Positioning, Navigation, and Timing
• /
• v.10 no.4
• /
• pp.279-289
• /
• 2021

GNSS receivers capable of tracking multiple Global Navigation Systems (GNSSs) simultaneously are widely used. In order to estimate accurate user position and velocity, it is necessary to consider the key elements that contribute to the interoperability of the different GNSSs. Typical examples are the time system and the coordinate system. Each GNSS is operated based on its own reference time system depending on when the system was developed and whether the leap seconds are applied. In addition, each GNSS is designed based on its own coordinate system based on earth model constant values. This paper addresses the interoperability issues from the viewpoint of Single Point Positioning (SPP) users utilizing multiple GNSS signals from GPS, GLONASS, BeiDou, and Galileo. Since the broadcast ephemerides of each GNSS are based on their own time and coordinate systems, the time and the coordinate systems should be unified for any user algorithm. For this purpose, this paper proposes a method of converting each GNSS coordinate system into the reference coordinate system through Helmert transformation. The error of the broadcast ephemerides was calculated with the precise ephemerides provided by the International GNSS Service (IGS). The effectiveness of the proposed multi-GNSS correction and transformation method is verified using the Multi-GNSS Experiment (MGEX) station data.

• Journal of Broadcast Engineering
• /
• v.21 no.1
• /
• pp.3-10
• /
• 2016

In this paper, two reconstructed point cloud sets with the information of 3D features are analyzed. For a certain 3D reconstruction of the interior of a building, the first image set is taken from the sequential passive camera movement along the regular grid path and the second set is from the application of the laser scanning process. Matched key points over all images are obtained by the SIFT(Scale Invariant Feature Transformation) algorithm and are used for the registration of the point cloud data. The obtained results are point cloud number, average density of point cloud and the generating time for point cloud. Experimental results show the necessity of images from the additional sensors as well as the images from the camera for the more accurate 3D reconstruction of the interior of a building.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1998.06a
• /
• pp.521-525
• /
• 1998

In this paper, we propose a fast algorithm for fractal image coding to shorten long time to take on fractal image encoding. For its performance evaluation, the algorithm compares with other traditional fractal coding methods. In the traditional fractal image coding methods, an original image is contracted by a factor in order to make an image to be matched. Then, the whole area of the contracted image is searched in order to find contractive transformation point of the original image corresponding to the contacted image. It needs a lot of searching time on encoding and remains limitation in the improvement of compression ratio. However, the proposed algorithm not only considerably reduces encoding tin e by using scaling method and limited search area method but also improves compression ratio by using bit-plane. When comparing the proposed algorithm with Jacquin's method, the proposed algorithm provides much shorter encoding time and better compression ratio with a little degradation of the decoded image quality than Jacquin's method.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.2
• /
• pp.93-100
• /
• 2014

3D object recognition using only 2D images is a difficult work because each images are generated different to according to the view direction of cameras. Because SIFT algorithm defines the local features of the projected images, recognition result is particularly limited in case of input images with strong perspective transformation. In this paper, we propose the object recognition method that improves SIFT algorithm by using several sequential images captured from rotating 3D object around a rotation axis. We use the geometric relationship between adjacent images and merge several images into a generated feature space during recognizing object. To clarify effectiveness of the proposed algorithm, we keep constantly the camera position and illumination conditions. This method can recognize the appearance of 3D objects that previous approach can not recognize with usually SIFT algorithm.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.210-213
• /
• 2000

In the closed range space, the parallel two CCD cameras are used to acquire a pair of stereo image. The acquired stereo image are computed with Wavelet Transform repeatedly and including the low frequency component, the image size of those are reduced. It is the pyramid structure. The optimum matching point is searched to the pixel. Then appling the optimum matching point to DLT, it extract the three - dimensional surface coordinate from a stereo image. The direct linear transformation(DLT) method is used to calibrate the stereo camera compute the coordinate on a three dimensional space. To find the parameters for the DLT method, 30 control points which marked on the cylinder type object are used. To improve the matching algorithm, the paper select the pyramid structure for Wavelet Transform. The acquired disparity information is used to represent the really three-dimensional surface coordinate.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.2
• /
• pp.544-556
• /
• 1991

The optimization of many engineering design problems requires a nonlinear programming algorithm that is robust and efficient. A general-purpose nonlinear optimization program IDOL (Interactive Design Optimization Library) is developed based on the Augmented Lagrange Mulitiplier (ALM) method. The ideas of selecting a good initial design point, using resonable initial values for Lagrange multipliers, constraints scaling, descent vector restarting, and dynamic stopping criterion are employed for computational enhancement to the ALM method. A descent vector is determined by using the Broydon-Fletcher-Goldfarb-Shanno (BFGS) method. For line search, the Incremental-Search method is first used to find bounds on the solution, then the bounds are reduced by the Golden Section method, and finally a cubic polynomial approximation technique is applied to locate the next design point. Seven typical test problems are solved to show IDOL efficient and robust.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.429-433
• /
• 1995

Compound solid is maded for specially fixed object. A number of compound soild are devided as a unit germetric solid. The special case of rotation about an arbitrary axis makes according selection modelfor transformation. View plane and View region are estiblished for back face removal. After back-face removal eachedge is checked for point of intersection. The designing of of fset surface id maded and tool-path gernerted on the part surface. In tersection point is checked among the offset surfaces. The paper used an efficient algorithm for generating tool paths to apply a notion view volume. Through machining experiments with a 3-axis machining centre, the adequacy of the analysis was confirmed.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.7 no.6
• /
• pp.72-79
• /
• 1998

In this paper, image processing algorithm is studied to enhance the preciseness of the geometry while converting captured images to CAD data. A program is developed as a result. The code, in the image processing, utilizes outline trace, point data smoothing algorithm. It is capable of automatically generating design data by converting input image data to the CAD data. The output can be made in DXF, IGES formats. The current research can be utilized as a base data for the development of factory automation or flexible manufacturing system which adopt image processing based automatic inspection and measuring system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.16-20
• /
• 1988

This paper presents a new algorithm for solving the inverse kinematics in real-time applications. The end-tip movement of each link can be resolved into the basic resolution unit, .DELTA.l, which depends on link length, reduction ratio and resolution of the incremental encoder attached to the joint. When x- and y-axis projection of the end-tip movement are expressed in .DELTA.l unit, projectional increments .DELTA.x and .DELTA.y become -1, 0 or I by truncation. By using the incremental computation with these ternary value and some simple logic rules, a coordinate transformation can be realized. Through this approach, it should be noted that the floating-point arithmetic and the manipulation of trigonometric functions are completely eliminated. This paper demonstrates the proposed method in a parallelogram linkage type, two-link arm.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.3
• /
• pp.42-48
• /
• 1996

In this paper, a position correction system of industrial robot for door-chassis assembly tast is developed in connection with the position correction algorithm shown in Part I. Tow notches and a hole of auto chassis are selected as the reference measure points and a vision based error detection algorithm is devised to measure in accuracy of less than 0.07mm. And also, the transformation between base and tool coordinates of the robot is shown to send the suitable correction quantities caaording to robot's option. The obtained algorithms were satisfactorily implemented for a real door-chassis model such that the system could accomplish visually acceptable door-chassis assembly task.