• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3782-3796
• /
• 2020

A three-dimensional (3D) reconstruction is an important research area in computer vision. The ability to detect and match features across multiple views of a scene is a critical initial step. The tracking matrix W obtained from a 3D reconstruction can be applied to structure from motion (SFM) algorithms for 3D modeling. We often fail to generate an acceptable number of features when processing face or medical images because such images typically contain large homogeneous regions with minimal variation in intensity. In this study, we seek to locate sufficient matching points not only in general images but also in face and medical images, where it is difficult to determine the feature points. The algorithm is implemented on an adaptive threshold value, a scale invariant feature transform (SIFT), affine SIFT, speeded up robust features (SURF), and affine SURF. By applying the algorithm to face and general images and studying the geometric errors, we can achieve quasi-dense matching points that satisfy well-functioning geometric constraints. We also demonstrate a 3D reconstruction with a respectable performance by applying a column space fitting algorithm, which is an SFM algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.4
• /
• pp.60-66
• /
• 2016

Compound logistics is a service aimed to enhance logistics efficiency by supporting that shippers and consigners jointly use logistics facilities. Many of these services have taken place both domestically and internationally, but the joint logistics services for e-commerce have not been spread yet, since the number of the parcels that the consigners transact business is usually small. As one of meaningful ways to improve utilization of compound logistics, we propose a brokerage service for shipper and consigners based on the hybrid recommendation system using very well-known classification and clustering methods. The existing recommendation system has drawn a relatively low satisfaction as it brought about one-to-one matches between consignors and logistics vendors in that such matching constrains choice range of the users to one-to-one matching each other. However, the implemented hybrid recommendation system based brokerage agent service system can provide multiple choice options to mutual users with descending ranks, which is a result of the recommendation considering transaction preferences of the users. In addition, we applied feature selection methods in order to avoid inducing a meaningless large size recommendation model and reduce a simple model. Finally, we implemented the hybrid recommendation system based brokerage agent service system that shippers and consigners can join, which is the system having capability previously described functions such as feature selection and recommendation. As a result, it turns out that the proposed hybrid recommendation based brokerage service system showed the enhanced efficiency with respect to logistics management, compared to the existing one by reporting two round simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.954-957
• /
• 2016

In cases of military communication plan, it often requires to find a proper solution for frequency assignment within feasible time. Minimizing the number of used resources are related to cost issue, hence it is a critical objective. When the dual polar antenna is used, the performance can be much developed by exploiting the polarization separation. In this paper, we propose an algorithm that assigns polarizations and frequencies within complexity of $O(N^2)$ based on the graph matching theory. We have verified that the proposed algorithm shows almost twice performance relative to the uni-polar frequency assignment algorithms and it approaches very closely to its theoretical optima.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.345-354
• /
• 2005

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 a priori knowledge 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 presents the motion detection algorithm that can run robustly about recusive motion. The motion detection compares and analyzes two frames each other, motion of whether happened judge. Through experiments, we show significant improvements in the reduction of the computational time in terms of the number of search steps without much quality degradation in the predicted image.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3223-3231
• /
• 2010

For a long time, most of advanced countries have supported the innovative firms with various support methods such as tax credit, subsidy, human resource education, and so on. Tax credit for innovation is the most popular industrial policy in these countries including Korea. However, in Korea, the effect of tax credit policy has been rarely analyzed. On the other hand, a considerable number of studies discover that tax credit policy in other countries influences positively on invest of R&D expenditure. This paper shows that tax credit policy positively influences on firm's innovation performances in Korea. The evaluated innovative effect of tax credit policy in this paper is more persuasive because it introduces various innovation performance variables including patent application with Propensity score matching method(PSM).

• Journal of Preventive Medicine and Public Health
• /
• v.46 no.5
• /
• pp.261-270
• /
• 2013

Objectives: This study investigated the socio-demographic characteristics and medical causes of death among meteorological disaster casualties and compared them with deaths from all causes. Methods: Based on the death data provided by the National Statistical Office from 2000 to 2011, the authors analyzed the gender, age, and region of 709 casualties whose external causes were recorded as natural events (X330-X389). Exact matching was applied to compare between deaths from meteorological disasters and all deaths. Results: The total number of deaths for last 12 years was 2 728 505. After exact matching, 642 casualties of meteorological disasters were matched to 6815 all-cause deaths, which were defined as general deaths. The mean age of the meteorological disaster casualties was 51.56, which was lower than that of the general deaths by 17.02 (p<0.001). As for the gender ratio, 62.34% of the meteorological event casualties were male. While 54.09% of the matched all-cause deaths occurred at a medical institution, only 7.6% of casualties from meteorological events did. As for occupation, the rate of those working in agriculture, forestry, and fishery jobs was twice as high in the casualties from meteorological disasters as that in the general deaths (p<0.001). Meteorological disaster-related injuries like drowning were more prevalent in the casualties of meteorological events (57.48%). The rate of amputation and crushing injury in deaths from meteorological disasters was three times as high as in the general deaths Conclusions: The new information gained on the particular characteristics contributing to casualties from meteorological events will be useful for developing prevention policies.

• Journal of Broadcast Engineering
• /
• v.3 no.1
• /
• pp.85-92
• /
• 1998

The block matching algorithm is the most popular motion estimation method in image sequence coding. In this paper, we propose a VLSI architecture. for implementing a recently proposed fast bolck matching algorith, which uses spatial correlation of motion vectors and hierarchical searching scheme. The proposed architecture consists of a basic searching unit based on a systolic array and two shift register arrays. And it covers a search range of -32~ +31. By using the basic searching unit repeatedly, it reduces the number of gatyes for implementation. For basic searching unit implementation, a proper systolic array can be selected among various conventional ones by trading-off between speed and hardware cost. In this paper, a structure is selected as the basic searching unit so that the hardware cost can be minimized. The proposed overall architecture is fast enough for low bit-rate applications (frame size of $352{\times}288$, 3Oframes/sec) and can be implemented by less than 20,000 gates. Moreover, by simply modifying the basic searching unit, the architecture can be used for the higher bit-rate application of the frame size of $720{\times}480$ and 30 frames/sec.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.965-974
• /
• 2003

Today's network consists of a large number of routers and servers running a variety of applications. In this paper, we have designed and constructed the general simulation environment of network security model composed of multiple IDSs agent and a firewall agent which coordinate by CNP (Contract Net Protocol). The CNP, the methodology for efficient integration of computer systems on heterogeneous environment such as distributed systems, is essentially a collection of agents, which cooperate to resolve a problem. Command console in the CNP is a manager who controls the execution of agents or a contractee, who performs intrusion detection. In the knowledge-based network security model, each model of simulation environment is hierarchically designed by DEVS (Discrete Event system Specification) formalism. The purpose of this simulation is the application of rete pattern-matching algorithm speeding up the inference cycle phases of the intrusion detection expert system. we evaluate the characteristics and performance of CNP architecture with rete pattern-matching algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1204-1209
• /
• 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, stock 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.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.482-486
• /
• 2010

Recently, gesture recognition methods based on dynamic time warping (DTW) have been actively investigated as more mobile devices have equipped the accelerometer. DTW has no additional training step since it uses given samples as the matching templates. However, it is difficult to apply the DTW on mobile environments because of its computational complexity of matching step where the input pattern has to be compared with every templates. In order to address the problem, this paper proposes a gesture recognition method based on DTW that uses localized subset of templates. Here, the k-means clustering algorithm is used to divide each class into subclasses in which the most centered sample in each subclass is employed as the localized template. It increases the recognition speed by reducing the number of matches while it minimizes the errors by preserving the diversities of the training patterns. Experimental results showed that the proposed method was about five times faster than the DTW with all training samples, and more stable than the randomly selected templates.