• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1058-1060
• /
• 2003

A ground control point (GCP) is a point on the surface of Earth where image coord inates and map coordinates can be identified. The GCP is useful for the geometric correction of systematic and unsystematic errors usually contained in a remotely sensed data. Especially in case of synthetic aperture radar (SAR) data, it has serious geometric distortions caused by inherent side looking geometry. In addition, SAR images are usually severely corrupted by speckle noises so that it is difficult to identify ground control points. We developed a ground point extraction algorithm that has an improved capability. An application of radargrammetry to Daejon area in Korea was studied to acquire the geometric information. For the ground control point extraction algorithm, an ERS SAR data with precise Delft orbit information and rough digital elevation model (DEM) were used. We analyze the accuracy of the results from our algorithm by using digital map and GPS survey data.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.177-180
• /
• 2002

Generally, it is very difficult to inspect geometric shape of large 2D objects after machining. To maintain the accuracy for inspection, a robot vision is used to divide overall shape into several enlarged images, and image processing technique is applied to acquire one minute geometric contour. The inspection is to compare the NC data with the measured contour data by the vision system, and the algorithm is to rotate to minimize the maximum deviation coinciding two geometric centers. This paper experimentally shows that the proposed inspection algorithm is very useful fur a large machined object.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.10
• /
• pp.116-126
• /
• 2001

This paper suggests a numerical method to find optimal geometric path and minimum-time motion for a spatial 6-link manipulator arm (PUMA 560 type). To find a minimum-time motion, the optimal geometric paths minimizing 2 different dynamic performance indices are searched first, and the minimum-time motions are searched on these optimal paths. In the algorithm to find optimal geometric paths, the objective functions (performance indices) are selected to minimize joint velocities, actuator forces or the combinations of them as well as to avoid one static obstacle. In the minimum-time algorithm the traveling time is expressed by the power series including 21 terms. The coefficients of the series are obtained using nonlinear programming to minimize the total traveling time subject to the constraints of velocity-dependent actuator forces.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.462-465
• /
• 2000

It is important to compress three dimensional (3D) data efficiently, since 3D data are too large to store or transmit in general. In this paper, we propose a lossless compression algorithm of the 3D mesh connectivity, based on the vertex degree. Most techniques for the 3D mesh compression treat the connectivity and the geometric separately, but our approach attempts to exploit the geometric information for compressing the connectivity information. We use the geometric angle constraint of the vertex fanout pattern to predict the vertex degree, so the proposed algorithm yields higher compression efficiency than the conventional algorithms.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.1444-1447
• /
• 2004

For the OLED evaporation process, thin film thickness uniformity is of great practical importance. In order to achieve the better thickness uniformity, geometric simulation of film thickness distribution profile is required. In this paper, a geometric modeling algorithm is introduced for process simulation of full-color OLED evaporating system. The physical fact of the evaporation process is modeled mathematically. Based on the developed method, the uniformity of the organic layer thickness can be successfully controlled.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.3
• /
• pp.209-219
• /
• 2019

Satellite imagery occurs geometric and radiometric errors due to external environmental factors at the acquired time, which in turn causes false-alarm in change detection. These errors should be eliminated by geometric and radiometric corrections. In this study, we propose a methodology that automatically and simultaneously performs geometric and radiometric corrections by using the SURF (Speeded-Up Robust Feature) algorithm and the mask filter. The MPs (Matching Points), which show invariant properties between multi-temporal imagery, extracted through the SURF algorithm are used for automatic geometric correction. Using the properties of the extracted MPs, PIFs (Pseudo Invariant Features) used for relative radiometric correction are selected. Subsequently, secondary PIFs are extracted by generated mask filters around the selected PIFs. After performing automatic using the extracted MPs, we could confirm that geometric and radiometric errors are eliminated as the result of performing the relative radiometric correction using PIFs in geo-rectified images.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.247-250
• /
• 2001

In this paper, we propose an growing and pruning algorithm to design the adaptive structure of modular wavelet neural network(MWNN) with F-projection and geometric growing criterion. Geometric growing criterion consists of estimated error criterion considering local error and angle criterion which attempts to assign wavelet function that is nearly orthogonal to all other existing wavelet functions. These criteria provide a methodology that a network designer can constructs wavelet neural network according to one's intention. The proposed growing algorithm grows the module and the size of modules. Also, the pruning algorithm eliminates unnecessary node of module or module from constructed MWNN to overcome the problem due to localized characteristic of wavelet neural network which is used to modules of MWNN. We apply the proposed constructing algorithm of the adaptive structure of MWNN to approximation problems of 1-D function and 2-D function, and evaluate the effectiveness of the proposed algorithm.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.445-451
• /
• 2007

An adaptive modulation scheme is presented for multiuser orthogonal frequency-division multiplexing systems. The aim of the scheme is to minimize the total transmit power with a constraint on the transmission rate for users, assuming knowledge of the instantaneous channel gains for all users using a combined bit-loading and subcarrier allocation algorithm. The subcarrier allocation algorithm identifies the appropriate assignment of subcarriers to the users, while the bit-loading algorithm determines the number of bits given to each subcarrier. The proposed bit-loading algorithm is derived from the geometric progression of the additional transmission power required by the subcarriers and the arithmetic-geometric means inequality. This algorithm has a simple procedure and low computational complexity. A heuristic approach is also used for the subcarrier allocation algorithm, providing a trade-off between complexity and performance. Numerical results demonstrate that the proposed algorithms provide comparable performance with existing algorithms with low computational cost.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.542-542
• /
• 2002

Geometric correction is a critical step to remove geometric distortions in satellite images. For correct geometric correction, Ground Control Points (GCPs) have to be chosen carefully to guarantee the quality of corrected satellite images. In this paper, we present an automatic approach for geometric correction by constructing GCP Chip database (GCP DB) that is a collection of pieces of images with geometric information. The GCP DB is constructed by exploiting Landsat's nadir-viewing property and the constructed GCP DB is combined with a simple block matching algorithm for efficient GCP matching. This approach reduces time and energy for tedious manual geometric correction and promotes usage of Landsat images.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.12
• /
• pp.204-213
• /
• 1999

This paper suggests a numerical method of finding optimal geometric path and minimum-time motion for a manipulator arm. To find the minimum-time motion, the optimal geometric path is searched first, and the minimum-time motion is searched on this optimal path. In the algorithm finding optimal geometric path, the objective function is minimizing the combination of joint velocities, joint-jerks, and actuator forces as well as avoiding several static obstacles, where global search is performed by adjusting the seed points of the obstacle models. In the minimum-time algorithm, the traveling time is expressed by the linear combinations of finite-term quintic B-splines and the coefficients of the splines are obtained by nonlinear programming to minimize the total traveling time subject to the constraints of the velocity-dependent actuator forces. These two search algorithms are basically similar and their convergences are quite stable.