• Korean Journal of Remote Sensing
• /
• v.37 no.5_1
• /
• pp.1135-1147
• /
• 2021

In order to geometrically correct high-resolution satellite imagery, the sensor modeling process that restores the geometric relationship between the satellite sensor and the ground surface at the image acquisition time is required. In general, high-resolution satellites provide RPC (Rational Polynomial Coefficient) information, but the vendor-provided RPC includes geometric distortion caused by the position and orientation of the satellite sensor. GCP (Ground Control Point) is generally used to correct the RPC errors. The representative method of acquiring GCP is field survey to obtain accurate ground coordinates. However, it is difficult to find the GCP in the satellite image due to the quality of the image, land cover change, relief displacement, etc. By using image maps acquired from various sensors as reference data, it is possible to automate the collection of GCP through the image matching algorithm. In this study, the RPC of KOMPSAT-3A satellite image was corrected through the extracted matching point using the UAV (Unmanned Aerial Vehichle) imagery. We propose a pre-porocessing method for the extraction of matching points between the UAV imagery and KOMPSAT-3A satellite image. To this end, the characteristics of matching points extracted by independently applying the SURF (Speeded-Up Robust Features) and the phase correlation, which are representative feature-based matching method and area-based matching method, respectively, were compared. The RPC adjustment parameters were calculated using the matching points extracted through each algorithm. In order to verify the performance and usability of the proposed method, it was compared with the GCP-based RPC correction result. The GCP-based method showed an improvement of correction accuracy by 2.14 pixels for the sample and 5.43 pixelsfor the line compared to the vendor-provided RPC. In the proposed method using SURF and phase correlation methods, the accuracy of sample was improved by 0.83 pixels and 1.49 pixels, and that of line wasimproved by 4.81 pixels and 5.19 pixels, respectively, compared to the vendor-provided RPC. Through the experimental results, the proposed method using the UAV imagery presented the possibility as an alternative to the GCP-based method for the RPC correction.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.247-259
• /
• 2000

This paper introduces a new technique that reduces the search times and Improves the accuracy of motion estimation using high temporal and spatial correlation of motion vector. Instead of using the fixed first search Point of previously proposed search algorithms, the proposed method finds more accurate first search point as to compensating searching area using high temporal and spatial correlation of motion vector. Therefore, the main idea of proposed method is to find first search point to improve the performance of motion estimation and reduce the search times. The proposed method utilizes the direction of the same coordinate block of the previous frame compared with a block of the current frame to use temporal correlation and the direction of the adjacent blocks of the current frame to use spatial correlation. Based on these directions, we compute the first search point. We search the motion vector in the middle of computed first search point with two fixed search patterns. Using that idea, an efficient adaptive predicted direction search algorithm (APDSA) for block matching motion estimation is proposed. In the experimental results show that the PSNR values are improved up to the 3.6dB as depend on the Image sequences and advanced about 1.7dB on an average. The results of the comparison show that the performance of the proposed APDSA algorithm is better than those of other fast search algorithms whether the image sequence contains fast or slow motion, and is similar to the performance of the FS (Full Search) algorithm. Simulation results also show that the performance of the APDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS algorithm.

• The KIPS Transactions:PartB
• /
• v.15B no.4
• /
• pp.307-314
• /
• 2008

This paper presents a new robust watermarking method for curves that uses informed-detection. To embed watermarks, the presented algorithm parameterizes a curve using the B-spline model and acquires the control points of the B-spline model. For these control points, 2D mesh are created by applying Delaunay triangulation and then the mesh spectral analysis is performed to calculate the mesh spectral coefficients where watermark messages are embedded in a spread spectrum way. The watermarked coefficients are inversely transformed to the coordinates of the control points and the watermarked curve is reconstructed by calculating B-spline model with the control points. To detect the embedded watermark, we apply curve matching algorithm using inflection points of curve. After curve registration, we calculate the difference between the original and watermarked mesh spectral coefficients with the same process for embedding. By calculating correlation coefficients between the detected and candidate watermark, we decide which watermark was embedded. The experimental results prove the proposed scheme is more robust than previous watermarking schemes against print-scan process as well as geometrical distortions.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.2
• /
• pp.655-666
• /
• 2014

Recently, as the appearance and exterior design of the construction structure are highlighted, the irregularly shaped structures are increasing in a construction facility. Many softwares provide a quantity take-off function of 3D object under BIM environment, however, they are focused on the limited function based on the solid modeling method. Because the vast geometric information of the curved surface is difficult to extract in the 3D objects that consist of major changes in vertical section shape as the irregularly shaped structures, it is difficult to express a 3D object as a solid model. On the other hand, the irregularly shaped structures can be expressed in relatively free in the surface model because the surface model consists of points, lines and surfaces. Accordingly, the surface modeling method is suitable for the modeling of large irregularly shaped structures. This study suggests a quantity take-off algorithm for the irregularly shaped structures using the surface modeling approach that is beneficial in the design work of structures. Some case projects are used for verifying the accuracy of the proposed method.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.15 no.4
• /
• pp.26-41
• /
• 2012

It is necessary to manage, forecast and prepare agricultural production based on accurate and up-to-date information in order to cope with the climate change and its impacts such as global warming, floods and droughts. This study examined the applicability as well as challenges of the object-based image analysis method for developing a land cover image classification algorithm, which can support the fast thematic mapping of wide agricultural areas on a regional scale. In order to test the applicability of RapidEye's multi-temporal spectral information for differentiating agricultural land cover types, the integration of other GIS data was minimized. Under this circumstance, the land cover classification accuracy at the study area of Kimje ($1300km^2$) was 80.3%. The geometric resolution of RapidEye, 6.5m showed the possibility to derive the spatial features of agricultural land use generally cultivated on a small scale in Korea. The object-based image analysis method can realize the expert knowledge in various ways during the classification process, so that the application of spectral image information can be optimized. An additional advantage is that the already developed classification algorithm can be stored, edited with variables in detail with regard to analytical purpose, and may be applied to other images as well as other regions. However, the segmentation process, which is fundamental for the object-based image classification, often cannot be explained quantitatively. Therefore, it is necessary to draw the best results based on expert's empirical and scientific knowledge.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.171-181
• /
• 2013

Recently, ground penetrating radar(GPR) has been widely used in detecting metallic and nonmetallic buried landmines and a number of related researches have been reported. A novel preprocessing method is proposed in this paper to flag potential locations of buried mine-like objects from GPR array measurements. GPR operates by measuring the reflection of an electromagnetic pulse from discontinuities in subsurface dielectric properties. As the GPR pulse propagates in the geologic medium, it suffers nonlinear attenuation as the result of absorption and dispersion, besides spherical divergence. In the proposed algorithm, a logarithmic transformed regression model which successfully represents the time-varying signal amplitude of the GPR data is estimated at first. Then, background signals may be densely distributed near the regression model and candidate signals of targets may be far away from the regression model in the time-amplitude space. Based on the observation, GPR signals are decomposed into candidate signals of targets and background signals using residuals computed from the estimated value by regression and the measurement of GPR. Candidate signals which may contain target signals and noise signals need to be refined. Finally, targets are detected through the refinement of candidate signals based on geometric signatures of mine-like objects. Our algorithm is evaluated using real GPR data obtained from indoor controlled environment and the experimental results demonstrate remarkable performance of our mine-like object detection method.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.5 no.2
• /
• pp.109-120
• /
• 1985

This thesis is a study on multiple close range photogrammetry, and the purpose of this study is to develop the most accurate adjustment method of three dimensional object coordinates. This was achieved by comparing the standard errors of actual data to the computed values from 2 photos and multiple photos. The conventional methods for multiple photos have been analyzed by using geometric model formation. But in this study, the equation of collinearity condition which has been applied to aerial photogrammetry was derived to be a basic principle of close range photogrammetry, and the algorithm for analyzing multiple photos was developed using simultaneous bundle adjustment. The method used in this study, showed more homogeneous accuracy in coordinate and more consistent variance of error than those of conventional methods. It was found that the cases using 3, 4, and 5 photos were more accurate than using 2 photos; the accuracies were improved to 15%, 35%, and 50%, for each case. Thus this study is expected to be useful in measuring the geometry of historic monuments and other structures requiring high accuracy. Also the combined case of multiple photos is considered to be effective for the precise analysis of the objects which are difficult to measure for obstacles.

• Journal of Astronomy and Space Sciences
• /
• v.22 no.3
• /
• pp.263-272
• /
• 2005

For the Communication, Ocean and Meteorological Satellite (COMS) which will be launched in 2008, an algorithm for finding the precise location of the sun-glint point on the ocean surface is studied. The precise locations of the sun-glint are estimated by considering azimuth and elevation angles of Sun-satellite-Earth geometric position and the law of reflection. The obtained nonlinear equations are solved by using the Newton-Raphson method. As a result, when COMS is located at $116.2^{\circ}E$ or $128.2^{\circ}E$ longitude, the sun-glint covers region of ${\pm}10^{\circ}(N-S)$ latitude and $80-150^{\circ}(E-W)$ longitude. The diurnal path of the sun-glint in the southern hemisphere is curved towards the North Pole, and the path in the northern hemisphere is forwards the south pole. The algorithm presented in this paper can be applied to predict the precise location of sun-glint region in any other geostationary satellites.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.7 no.6
• /
• pp.101-108
• /
• 2003

Small-scale models have been frequently used for experimental evaluation of seismic performance because of limited testing facilities and economic reasons. However, there are not enough studies on similitude law for analogizing prototype structures accurately with small-scale models, although conventional similitude law based on geometry is not well consistent in the inelastic seismic behavior. When fabricating prototype and small-scale model of reinforced concrete structures by using the same material. added mass is demanded from a volumetric change and scale factor could be limited due to size of aggregate. Therefore, it is desirable that different material is used for small-scale models. Thus, a modified similitude law could be derived depending on geometric scale factor and equivalent modulus ratio. In this study, compressive strength tests are conducted to analyze equivalent modulus ratio of micro-concrete to normal-concrete. Equivalent modulus ratios are divided into multi phases, which are based on ultimate strain level. Therefore, an algorithm adaptable to the pseudodynamic test. considering equivalent multi-phase similitude law based on seismic damage levels, is developed. In addition, prior to the experiment. it is verified numerically if the algorithm is applicable to the pseudodynamic test.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.