• Journal of Korean Society for Geospatial Information Science
• /
• v.7 no.2 s.14
• /
• pp.47-56
• /
• 1999

In this study, tie point observation in aerial triangulation was automated by the image processing methods. The technique includes boundary extraction and We matching processes. The procedures were applied to extract points of Interest and to find their conjugate points in the other images. The image coordinates of the identified points were then used to compute their absolute coordinates. An algorithm was developed in this study for the automation of observation in aerial triangulation, which is a manual process of selecting a tie point and recording the image coordinate of the selected point. The developed algorithm automates this process through the application of a mathematical operator to extract points of interest from an arbitrary image. The root m square error of image coordinates of the developed algorithm is $6.8{\mu}m$, which is close to that of the present analytical method. In a manual environment, the accuracy of the result of a photogrammetric process is heavily dependant on the level of skill and experience of the human operator. No such problem exists in an automated system. Also, as a result of the automated system, the time spent in the observation process could be reduced by a factor of 61.2%, thereby reducing the overall cost.

• Journal of Broadcast Engineering
• /
• v.25 no.3
• /
• pp.439-448
• /
• 2020

In this paper, we propose a modified optimization algorithm for point cloud matching of multi-view RGB-D cameras. In general, in the computer vision field, it is very important to accurately estimate the position of the camera. The 3D model generation methods proposed in the previous research require a large number of cameras or expensive 3D cameras. Also, the methods of obtaining the external parameters of the camera through the 2D image have a large error. In this paper, we propose a matching technique for generating a 3D point cloud and mesh model that can provide omnidirectional free viewpoint using 8 low-cost RGB-D cameras. We propose a method that uses a depth map-based function optimization method with RGB images and obtains coordinate transformation parameters that can generate a high-quality 3D model without obtaining initial parameters.

• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.199-204
• /
• 2002

Since motion estimation and motion compensation methods remove the redundant data to employ the temporal redundancy in images, it plays an important role in digital video compression. Because of its high computational complexity, however, it is difficult to apply to high-resolution applications in real time environments. If we have information about the motion of an image block before the motion estimation, the location of a better starting point for the search of an exact motion vector can be determined to expedite the searching process. In this paper, we present an adaptive motion estimation approach bated on temporal correlations of consecutive image frames that defines the search pattern and determines the location of the initial search point adaptively. Through experiments, compared with DS(Diamond Search) algorithm, the proposed algorithm is about 0.1∼0.5(dB) better than DS in terms of PSNR(Peak Signal to Noise Ratio) and improves as high as 50% compared with DS in terms of average number of search point per motion vector estimation.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.1
• /
• pp.1-6
• /
• 2018

In this paper, we propose the method to eliminate repetitive processes for key-point detection on multi-scale image space. The proposed method detects key-points from the original image, and select a good key-points using the cluster filters, and create the key-point clusters. And it select reference objects by using direction angles of the key-point clusters, predict the scale of the original image by using the distributed distance ratio. It transform the scale of the reference image, and apply the detection of key-points to the transformed reference image. In the results of the experiment, the proposed method can be found to improve the key-points detection time by 75 % and 71 % compared to SIFT method and scaled ORB method using the multi-scale images.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.1-10
• /
• 1993

In this paper, a new method of phoneme segmentation of handwritten Korean characters using the local graph pattern is proposed. At first, thinning was performed before extracting features. End-point, inflexion-point, branch-point and cross-point were extracted as features. Using these features and the angular relations between these features, local graph pattern was made. When local graph pattern is made, the of strokes is investigated on contacting point. From this process, pattern is simplified as contacting pattern of the basic form and the contacting form we must take into account can be restricted within fixed region, 4therefore phoneme segmentation not influenced by characters form and any other contact in a single character is performed as matching this local graph pattern with base patterns searched ahead. This experiments with 540 characters have been conducted. From the result of this experiment, it is shown that phoneme segmentation is independent of characters form and other contact in a single character to obtain a correct segmentation rate of 95%, manages it efficiently to reduce the time spent in lock operation when the lock.

• Journal of Korea Society of Industrial Information Systems
• /
• v.19 no.4
• /
• pp.17-24
• /
• 2014

In this paper, we propose a CMOS FM RX front-end structure with an automatic tunable input matching network and implement it using a 65nm CMOS technology. The proposed FM RX front-end is designed to change the resonance frequency of the input matching network at the low noise amplifier (LNA) according to the channel frequency selected by a phase-locked loop (PLL) for maintaining almost constant sensitivity level when an embedded antenna type with high frequency selectivity characteristic is used for FM receiver. The simulation results of implemented FM front-end show about 38dB of voltage gain, below 2.5dB of noise figure, and -15.5dBm of input referred intercept point (IIP3) respectively, while drawing only 3.5mA from 1.8V supply voltage including an LO buffer.

• Journal of the HCI Society of Korea
• /
• v.2 no.2
• /
• pp.35-43
• /
• 2007

This paper presents a system for image matching and recognition based on image feature detection and description techniques from artificial satellite photographs. We propose some kind of parameters from the varied environmental elements happen by image handling process. The essential point of this experiment is analyzes that affects match rate and recognition accuracy when to change of state of each parameter. The proposed system is basically inspired by Lowe's SIFT(Scale-Invariant Transform Feature) algorithm. The descriptors extracted from local affine invariant regions are saved into database, which are defined by k-means performed on the 128-dimensional descriptor vectors on an artificial satellite photographs from Google earth. And then, a label is attached to each cluster of the feature database and acts as guidance for an appeared building's information in the scene from camera. This experiment shows the various parameters and compares the affected results by changing parameters for the process of image matching and recognition. Finally, the implementation and the experimental results for several requests are shown.

• Journal of Advanced Navigation Technology
• /
• v.12 no.5
• /
• pp.494-501
• /
• 2008

In this paper, to merge whole 3D information of an occluded body from view point, the new image merging algorithm is introduced after obtaining images of body on the turn table from 4 directions. The two images represented by polygon meshes are merged using weight bipartite matching method with different weights according to coordinates and axes based on minimum distance since two images merged don't present abrupt variation of 3D coordinates and scan direction is one direction. To obtain entire 3D information of body, these steps are repeated 3 times since the obtained images are 4. This proposed method has advantage 200 - 300% searching time reduction rather than conventional branch and bound, dynamic programming, and hungarian method though the matching accuracy rate is a little bit less than these methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.661-668
• /
• 2012

A coaxial-cable impedance transformer that can be used in high power and wideband frequency range is an arbitrary impedance transformation ratio by an additional coaxial cable. The coaxial-cable impedance transformer to be 50-${\Omega}$ to 25-${\Omega}$ impedance transformation ratio is easily operated an wideband power divider by connecting two 50-${\Omega}$ lines at 25-${\Omega}$ impedance point. This wideband power divider has a poor output matching characteristic and a poor isolation characteristic between two output ports. In this paper, it proposes a coaxial-cable power divider to be a good output matching and isolation characteristics as it uses the singly terminated filter design theory. The odd-mode operation characteristic of the suggested power divider to use singly terminated low pass filter coefficient due to matching order and ripple value is examined by ADS program. And, it fabricates and measures the operation characteristic of 2-way power divider with 2nd-order and 4th-order matching circuit.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.57-65
• /
• 2004

In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the unit-diamond search pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the unit-diamond search pattern, and then fastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed unit-diamond and flat-hexagonal pattern search algorithm(UDFHS) improves as high as 11∼51% in terms of average number of search point per motion vector estimation and improves about 0.05∼0.74㏈ in terms of PSNR(Peak Signal to Noise Ratio).