• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.671-676
• /
• 2016

Recently, according to the limelight of Fintech, simple payment using biometric at smartphone is widely used. In this paper, we propose a new contactless biometric method using thumb image without additional sensors unlike previous biometrics such as fingerprint, iris, and vein recognition. In our method, length, width, and skin texture information are used as features. For that, illumination normalization, skin region segmentation, size normalization and alignment procedures are sequentially performed from the captured thumb image. Then, correlation coefficient is calculated for similarity measurement. To analyze recognition accuracy, genuine and imposter matchings are performed. At result, we confirmed the FAR of 1.68% at the FRR of 1.55%. In here, because the distribution of imposter matching is almost normal distribution, our method has the advantage of low FAR. That is, because 0% FAR can be achieved at the FRR of 15%, the proposed method is enough to 1:1 matching for payment verification.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.8
• /
• pp.636-645
• /
• 2017

A scanning radar is exploited widely such as for ground surveillance, disaster rescue, and etc. However, the range resolution is limited by transmitted bandwidth and cross-range resolution is limited by beam width. In this paper, we propose a method for super-resolution radar imaging. If the distribution of reflectivity is sparse, the distribution is called sparse signal. That is, the problem could be formulated as compressive sensing problem. In this paper, 2D super-resolution radar image is generated via reweighted ${\ell}_1-Minimization$. In the simulation results, we compared the images obtained by the proposed method with those of the conventional Orthogonal Matching Pursuit(OMP) and Synthetic Aperture Radar(SAR).

• Korean Journal of Remote Sensing
• /
• v.26 no.2
• /
• pp.175-188
• /
• 2010

A new correction method is required for the Geostationary Ocean Color Imager (GOCI), which is the world's first ocean color observing sensor in geostationary orbit. In this paper we introduce a new method of atmospheric and the Bidirectional Reflectance Distribution Function(BRDF) correction for GOCI. The Spectral Shape Matching Method(SSMM) and the Sun Glint Correction Algorithm(SGCA) were developed for atmospheric correction, and BRDF correction was improved using Inherent Optical Property(IOP) data. Each method was applied to the Sea-Viewing Wide Field-of-view Sensor(SeaWiFS) images obtained in the Korean sea area. More accurate estimates of chlorophyll concentrations could be possible in the turbid coastal waters as well as areas severely affected by aerosols.

• Journal of Auto-vehicle Safety Association
• /
• v.14 no.2
• /
• pp.39-44
• /
• 2022

This paper presents LiDAR static obstacle map based vehicle position correction algorithm for urban autonomous driving. Real Time Kinematic (RTK) GPS is commonly used in highway automated vehicle systems. For urban automated vehicle systems, RTK GPS have some trouble in shaded area. Therefore, this paper represents a method to estimate the position of the host vehicle using AVM camera, front camera, LiDAR and low-cost GPS based on Extended Kalman Filter (EKF). Static obstacle map (STOM) is constructed only with static object based on Bayesian rule. To run the algorithm, HD map and Static obstacle reference map (STORM) must be prepared in advance. STORM is constructed by accumulating and voxelizing the static obstacle map (STOM). The algorithm consists of three main process. The first process is to acquire sensor data from low-cost GPS, AVM camera, front camera, and LiDAR. Second, low-cost GPS data is used to define initial point. Third, AVM camera, front camera, LiDAR point cloud matching to HD map and STORM is conducted using Normal Distribution Transformation (NDT) method. Third, position of the host vehicle position is corrected based on the Extended Kalman Filter (EKF).The proposed algorithm is implemented in the Linux Robot Operating System (ROS) environment and showed better performance than only lane-detection algorithm. It is expected to be more robust and accurate than raw lidar point cloud matching algorithm in autonomous driving.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.651-660
• /
• 2010

In this paper, we implement an efficient histogram-based prefiltering to compensate the illumination mismatches in regions between neighboring views. In multi-view video, such illumination disharmony can primarily occur on account of different camera location and orientation and an imperfect camera calibration. This discrepancy can cause the performance decrease of multi-view video coding(MVC) algorithm. A histogram matching algorithm can be exploited to make up for these differences in a prefiltering step. Once all camera frames of a multi-view sequence are adjusted to a predefined reference through the histogram matching, the coding efficiency of MVC is improved. However general frames of multi-view video sequence are composed of several regions with different color composition and their histogram distribution which are mutually independent of each other. In addition, the location and depth of these objects from sequeuces captured from different cameras can be different with different frames. Thus we propose a new algorithm which classify a image into several subpartitions by its depth information first and then histogram matching is performed for each region individually. Experimental results show that the compression ratio for the proposed algorithm is improved comparing with the conventional image-based algorithms.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.10
• /
• pp.731-740
• /
• 2003

Since motion estimation remove the redundant data to employ the temporal correlations between adjacent frames in a video sequence, it plays an important role in digital video coding. And 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 small-cross search pattern and the block-based gradient descent search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the small-cross search pattern, and then quickly finds the other motion vectors that are not close to the center of search window using the block-based gradient descent search pattern. Through experiments, compared with the block-based gradient descent search algorithm(BBGDS), the proposed search algorithm improves as high as 26-40% in terms of average number of search point per motion vector estimation.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.12
• /
• pp.523-530
• /
• 2014

Ontology alignment is the way to share and reuse of ontology knowledge. Because of the ambiguity of concept, most ontology alignment systems combine a set of various measures and complete enumeration to provide the satisfactory result. However, calculating process becomes more complex and required time increases exponentially since the number of concept increases, more errors can appear at the same time. Lately the focus is on meta-matching using the heuristic algorithm. Existing meta-matching system tune extra parameter and it causes complex calculating, as a consequence, the results in the various data of specific domain are not good performed. In this paper, we propose a high performance algorithm by using DCS that can solve ontology alignment through simple process. It provides an efficient search strategy according to distribution of Levy Flight. In order to evaluate the approach, benchmark data from the OAEI 2012 is employed. Through the comparison of the quality of the alignments which uses DCS with state of the art ontology matching systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11C
• /
• pp.1029-1039
• /
• 2009

In this paper, the existing disparity aquisition algorithms were analyzed, on the bases of which a disparity generation technique that is superior in accuracy to the generation time was proposed. Basically it uses a pixel-by-pixel motion estimation technique. It has a merit of possibility of a high-speed operation. But the motion estimation technique has a disadvantage of lower accuracy because it depends on the similarity of the matching window regardless of the distribution characteristics of the texture in an image. Therefore, an enhanced technique to increase the accuracy of the disparity is required. This paper introduced a variable-sized window matching technique for this requirement. By the proposed technique, high accuracies could be obtained at the homogeneous regions and the object edges. A hardware to generate disparity image was designed, which was optimized to the processing speed so that a high throughput is possible. The hardware was designed by Verilog-HDL and synthesized using Hynix $0.35{\mu}m$ CMOS cell library. The designed hardware was operated stably at 120MHz using Cadence NC-VerilogTM and could process 15 frames per second at this clock frequency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11C
• /
• pp.929-939
• /
• 2010

The growth of multimedia technology forces the development of video detection for large database management and illegal copy detection. To meet this demand, this paper proposes a fast video detection method to apply to a large database. The fast video detection algorithm uses spatial features using the gray value distribution from frames and temporal features using the temporal similarity map. We form the video signature using the extracted spatial feature and temporal feature, and carry out a stepwise matching method. The performance was evaluated by accuracy, extraction and matching time, and signature size using the original videos and their modified versions such as brightness change, lossy compression, text/logo overlay. We show empirical parameter selection and the experimental results for the simple matching method using only spatial feature and compare the results with existing algorithms. According to the experimental results, the proposed method has good performance in accuracy, processing time, and signature size. Therefore, the proposed fast detection algorithm is suitable for video detection with the large database.

• Journal of Satellite, Information and Communications
• /
• v.9 no.2
• /
• pp.33-37
• /
• 2014

This paper propose a method to sort flame regions and non-flame regions in a color image based on temperature Characteristics of flame. The traditional algorithms simply detect flame regions those are colored between yellow and red and there are lot of false detection in this method. But the colors of real flame are fallen between white and red and flame color variation over the flame. In this paper, it reduce false detection by separating colors according to temperature Characteristics of flame. The proposed method firstly finds a color model to express the temperature Characteristics of fire and then the color model is non-linearly quantized based on color values and analyzed using histogram and finally detect the candidate flame regions. The proposed method has 71.8% of matching rate and if it is compared with non-matching rate of traditional algorithms, the non-matching rate is improved by 27 times than others.