• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.633-644
• /
• 2004

In this paper, we notice that the original NTSS algorithm can be proposed as the NTSS-3 Level algorithm by the multi-resolution technique. The fast block matching algorithm affects the speed by the patten combination and this paper proposes the block matching algorithm in different levels by multi-resolution technique, quite different from the original NTSS Patten. The block matching algorithm requires the multi-candidate to reduce the occurrence of low-image quality by the local minima problem. The simulation result compared to FS shows search speed 16 times quicker, and the PSNR 0.11-0.12［dB］ gets improved Image quality compared to the original fast block matching algorithm NTSS, and the speed is improved up to 0.1 times for improved image by the search point portion.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.173-180
• /
• 2005

This paper proposes an effective algorithm that combines both the stereo matching and the marching cube algorithm. By applying the stereo matching technique to an image obtained from various angles, 3D geometry data are acquired, and using the camera extrinsic parameter, the images are combined. After reconstructing the combined data into mesh using the image index, the normal vector equivalent to each point is obtained and the mesh smoothing is processed. This paper describes the successive processes and techniques on the 3D mesh reconstruction, and by proposing the intermediate iso- surface algorithm. Therefore it improves the 3D data instability problem caused when using the conventional marching cube algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.101-104
• /
• 2015

Motion vector is that comparing a frame between previous frame and current one about how much moved. Using this motion vector, if move the image object of current frame to former frame, it could be corrected to shake from hand and camera shaking. On this thesis, compared efficiency of block matching using SAD(Sum of Absolute Difference) equation as picking out the motion vector, matching using phase correlation, matching using feature point, block matching using bitplane.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.1
• /
• pp.23-28
• /
• 2013

The process of a feature matching for two different spatial data sets is similar to the process of classification as a binary class such as matching or non-matching. In this paper, we calculated a threshold by applying an equal error rate (EER) which is widely used in biometrics that classification is a main topic into spatial data sets. In a process of discriminating what's a matching or what's not, a precision and a recall is changed and a trade-off appears between these indexes because the number of matching pairs is changed when a threshold is changed progressively. This trade-off point is EER, that is, threshold. To the result of applying this method into training data, a threshold is estimated at 0.802 of a value of shape similarity. By applying the estimated threshold into test data, F-measure that is a evaluation index of matching method is highly value, 0.940. Therefore we confirmed that an accurate threshold is calculated by EER without person intervention and this is appropriate to matching different spatial data sets.

• Korean Journal of Remote Sensing
• /
• v.23 no.4
• /
• pp.273-285
• /
• 2007

Most stereo matching methods use intensity values in small image patches to measure the correspondence between two points. If the noisy pixels are used in computing the corresponding point, the matching performance becomes low. For this reason, the noise plays a critical role in determining the matching performance. In this paper, we propose a method for combining intensity and edge filters robust to the noise in order to improve the performance of stereo matching using high resolution satellite imagery. We used intensity filters such as Mean, Median, Midpoint and Gaussian filter and edge filters such as Gradient, Roberts, Prewitt, Sobel and Laplacian filter. To evaluate the performance of intensity and edge filters, experiments were carried out on both synthetic images and satellite images with uniform or gaussian noise. Then each filter was ranked based on its performance. Among the intensity and edge filters, Median and Sobel filter showed best performance while Midpoint and Laplacian filter showed worst result. We used Ikonos satellite stereo imagery in the experiments and the matching method using Median and Sobel filter showed better matching results than other filter combinations.

• 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.

• Communications for Statistical Applications and Methods
• /
• v.9 no.1
• /
• pp.75-86
• /
• 2002

We consider the problem of estimating the change-point in mean change model with one change-point. Gombay and Huskova(1998) derived a class of change-point estimators with the score function of rank. A change-point estimator with the log score function of rank is suggested and is shown to be involved in the class of Gombay and Huskova(1988). The simulation results show that the proposed estimator has smaller rose, larger proportion of matching the true change-point than the other estimators considered in the experiment when the change-point occurs in the middle of the sample.

• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.406-413
• /
• 2001

Ordinary high-speed block matching algorithms have a disadvantage that they need to get MAD (Mean Absolute Distance) as many as the number of search points due to comparing the MAD between the current frame's search block and the reference frame's search block. To solve such disadvantage of high-speed block matching algorithm, the proposed high-speed DS algorithm employs a MMAD calculation method using a specific characteristic that neighboring pixels have almost same values. In this thesis, we can get rid of unnecessary MAD calculation between the search point block by the new calculation method which uses the previously calculated MAD as the current search point and by breaking from the established MAD calculation method which calculates the MAD of a new search point by each search stage. Comparing with the established high-speed block matching algorithm, this new calculation's estimated movement error was shown as similar, and th total calculation amount decreased by $2FN^2Ep$.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.65-70
• /
• 2015

In this paper, the solutions of TE (transverse electric) scattering problems by a conductive strip grating over grounded two dielectric layers are analyzed by applying the PMM (point matching method) known as a numerical method of electromagnetic fileld. The boundary conditions are applied to obtain the unknown field coefficients, the scattered electromagnetic fields are expanded in a series of Floquet mode functions, and the conductive boundary condition apply to analysis of conducting strip. The most normalized reflected powers of the sharp variations in minimum values are scattered in direction of the other angles except incident angle. The numerical results for normalized reflected power are analyzed by according as the width and spacing of conductive strip, the relative permittivity and thickness of the two dielectric layers, and incident angles. The numerical results of present numericl analysis are shown in good agreement compared to those of the existing papers using FGMM (fourier galerkin moment method).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.2
• /
• pp.87-92
• /
• 2016

In this paper, the solutions of TE(transverse electric) scattering problems by a conductive strip grating over two dielectric layers are analyzed by applying the PMM(point matching method) known as a numerical method of electromagnetic field. The boundary conditions are applied to obtain the unknown field coefficients, the scattered electromagnetic fields are expanded in a series of Floquet mode functions, and the conductive boundary condition apply to analysis of conducting strip. The most normalized reflected and transmitted powers having a sharp variations are scattered in direction of the other angles except incident angle. The numerical results for the normalized reflected and transmitted powers are analyzed by according as the width and spacing of conductive strip, incident angles, and the relative permittivity and thickness of the two dielectric layers. To confirm the validity of this paper, the numerical results of presented structure are shown in good agreement compared to those of the existing papers.