• Journal of Korean Society for Geospatial Information Science
• /
• v.13 no.2 s.32
• /
• pp.65-69
• /
• 2005

Efficient 3D generation of cultural features, such as buildings in urban area is becoming increasingly important for a number of GIS applications. For reconstruction or 3D building in urban area aerial images, satellite images, LIDAR data have been used mainly. In case of automatically extracting and reconstructing of building height using single aerial images or single satellite images, there are a lot of problems, such as mismatching that result from a geometric distortion of optical images. Therefore, researches or integrating optical images and existing 2D GIS data(e.g. digital map) has been in progress. In this paper, we focused on extracting of building height by means or interest points and vortical line locus for reducing matching points. Also we used digital plotter in order to validate for the results in this study using aerial images(1/5,000) and existing digital map(1/1,000).

• Journal of the Korea Computer Industry Society
• /
• v.10 no.5
• /
• pp.227-234
• /
• 2009

The Paper introduces a new technique for block matching motion estimation. since the temporal correlation of a animation sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the scene change detection algorithm for block matching using the temporal correlation of the animation sequence and the center-biased property of motion vectors. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate point on each search region. Simulation results show that the PSNR values are improved as high as 9~32% in terms of average number of search point per motion vector estimation and improved about 0.06~0.21dB on an average except the FS(full search) algorithm.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.9-18
• /
• 2008

Web-services have originally been devised to share information as open services. In connection with it, hacking incidents have surged. Currently, Web-log analysis plays a crucial clue role in detecting Web-hacking. A growing number of cases are really related to perceiving and improving the weakness of Web-services based on Web-log analysis. Such as this, Web-log analysis plays a central role in finding out problems that Web has. Hence, Our research thesis suggests Web-DoS-hacking detective technique In the process of detecting such problems through SOM algorithm, the emergence frequency of BMU(Best Matching Unit) was studied, assuming the unit with the highest emergence frequency, as abnormal, and the problem- detection technique was recommended through the comparison of what's called BMU as input data.

• The Journal of Korea Robotics Society
• /
• v.13 no.1
• /
• pp.26-30
• /
• 2018

Planetary global localization is necessary for long-range rover missions in which communication with command center operator is throttled due to the long distance. There has been number of researches that address this problem by exploiting and matching rover surroundings with global digital elevation maps (DEM). Using conventional methods for matching, however, is challenging due to artifacts in both DEM rendered images, and/or rover 2D images caused by DEM low resolution, rover image illumination variations and small terrain features. In this work, we use train CNN discriminator to match rover 2D image with DEM rendered images using conditional Generative Adversarial Network architecture (cGAN). We then use this discriminator to search an uncertainty bound given by visual odometry (VO) error bound to estimate rover optimal location and orientation. We demonstrate our network capability to learn to translate rover image into DEM simulated image and match them using Devon Island dataset. The experimental results show that our proposed approach achieves ~74% mean average precision.

• 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 Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.90-98
• /
• 2013

The stereo system based on local matching is very popular due to its algorithmic simplicity, however it is limited to apply to various applications because it shows poor quality with low matching rates. In this paper, we propose and design a realtime stereo system based on an adaptive support-weight and the system shows low error rates and realtime performance. Generally, in the adaptive support-weight algorithm the intermediate computing results can not be reused to reduce the number of computations. In this research we modify the scheduling to reuse the intermediate results for the better performance by processing rows and columns separately. The nonlinear functions such as exponential or arc tangent have been designed with piecewise linear and step functions by empirical simulations and error analysis. The proposed architecture is composed of 9 processing elements for realtime performance. The proposed stereo system has been designed and synthesized using Donbu Hitek 0.18um standard cell library and can run up to 350Mhz operation frequency (33 frames per second) with 424K gates.

• Journal of Korea Game Society
• /
• v.18 no.1
• /
• pp.125-134
• /
• 2018

This paper presents a practical method to efficiently extract the rotational part of a $3{\times}3$ matrix that changes continuously in time. This is the key technique in the corotational FEM and the shape matching deformation popular in physics-based dynamic deformation. Recently, in contrast to the traditional polar decomposition methods independent of time, an iterative method was proposed that formulates the rotation extraction in a physics-based way and exploits an incremental representation of rotation. We develop an optimization method that reduces the number of iterations under the assumption that the maximum magnitude of the incremental rotation vector is limited within ${\pi}/2$. Realistic simulation of dynamic deformation employs a sufficiently small time step, and thus this assumption is not problematic in practice. We demonstrate the efficiency and practicality of our method in various experiments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.517-520
• /
• 2001

According to the rapid development of information and communication, various services are offered using information and communication infrastructure for example e-commerce, internet banking stork dealings, etc. This time, the most important problem is personal identification. But now secret number that is used to personal identification mostly can be misappropriated. To solve this problem, this paper proposes smart card identification system using 1 vs. 1 fingerprint matching. Information protection and security of smart card excel and use is convenient. And fingerprint becomes the focus of public attention in biometric field. Implemented system in this paper is based on PC. This system stores minutia that is fingerprint information into smart card and compare it with personal minutia. Therefore this system is sure to be on personal identification. If this system is applied to various services, safety degree of services will be enhanced.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1946-1956
• /
• 2001

In this paper, we propose a novel 2-D partial matching algorithm based on model-based stochastic analysis of feature correspondences in a relation vector space, which is quite robust to shape variations as well as invariant to geometric transformations. We represent an object using the ARG (Attributed Relational Graph) model with features of a set of relation vectors. In addition, we statistically model the partial occlusion or noise as the distortion of the relation vector distribution in the relation vector space. Our partial matching algorithm consists of two-phases. First, a finite number of candidate sets areselected by using logical constraint embedding local and structural consistency Second, the feature loss detection is done iteratively by error detection and voting scheme thorough the error analysis of relation vector space. Experimental results on real images demonstrate that the proposed algorithm is quite robust to noise and localize target objects correctly even inseverely noisy and occluded scenes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.647-659
• /
• 2003

LPM(Longest Prefix Matching)searching in If address lookup is a major bottleneck of IP packet processing in the high speed router. In the conventional lookup table for the LPM searching in CAM(Content Addressable Memory) the complexity of fast update take 0(1). In this paper, we designed pipeline architecture for fast update of 0(1) cycle of lookup table and high throughput and low area complexity on LPM searching. Lookup-table architecture was designed by CAM(Content Addressable Memory)away that uses 1bit RAM(Random Access Memory)cell. It has three pipeline stages. Its LPM searching rate is affected by both the number of key field blocks in stage 1 and stage 2, and distribution of matching Point. The RTL(Register Transistor Level) design is carried out using Verilog-HDL. The functional verification is thoroughly done at the gate level using 0.35${\mu}{\textrm}{m}$ CMOS SEC standard cell library.