• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.7
• /
• pp.1321-1323
• /
• 2007

A new reference point location method based on an edge map is proposed, where an orientation map is defined and used to find the edge map. Experimental results show that the proposed method can effectively detect the core point in poor quality and arch-type fingerprint images and produces better results in terms of the detection rate and accuracy than the sine map-based method.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.139-142
• /
• 2001

This paper presents a highly fast and accurate facial region extraction method by using the skin-color-reference map and motion information. First, we construct the robust skin-color-reference map and eliminate the background in image by this map. Additionally, we use the motion information for accurate and fast detection of facial region in image sequences. Then we further apply region growing in the remaining areas with the aid of proposed criteria. The simulation results show the improvement in execution time and accurate detection.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1511-1513
• /
• 2007

A new reference point location method using the cosine component is proposed, where an edge map is defined and used to find the reference point. Because all processes used in the proposed method are performed at the block level, less processing time is required. Experimental results show that the proposed method can effectively detect the reference point with higher speed and accuracy for all types of fingerprints.

• Journal of Plant Biotechnology
• /
• v.43 no.4
• /
• pp.411-416
• /
• 2016

Next-generation sequencing allows the identification of mutations responsible for mutant phenotypes by whole-genome resequencing and alignment to a reference genome. However, when the resequenced cultivar/line displays significant structural variation from the reference genome, mutations in the genome regions absent in the reference cannot be identified by simple alignment. In this review, we report the current status and prospects in identification of genes in mutant phenotypes, by using the methods MutMap, MutMap-Gap, and MutMap+. These methods delineate a candidate region harboring a mutation of interest, followed by de novo assembly, alignment, and identification of the mutation within genome gaps. These methods are likely to prove useful for cloning genes that exhibit significant structural variations, such as disease resistance genes of the nucleotide-binding site-leucine rich repeat (NBS-LRR) class.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.5 s.311
• /
• pp.12-21
• /
• 2006

In this paper, we propose a technique for extracting attentive objects in images using feature maps, regardless of the complexity of images and the position of objects. The proposed method uses feature maps with edge and color information in order to extract attentive objects. We also propose a reference map which is created by integrating feature maps. In order to create a reference map, feature maps which represent visually attentive regions in images are constructed. Three feature maps including edge map, CbCr map and H map are utilized. These maps contain the information about boundary regions by the difference of intensity or colors. Then the combination map which represents the meaningful boundary is created by integrating the reference map and feature maps. Since the combination map simply represents the boundary of objects we extract the candidate object regions including meaningful boundaries from the combination map. In order to extract candidate object regions, we use the convex hull algorithm. By applying a segmentation algorithm to the area of candidate regions to separate object regions and background regions, real object regions are extracted from the candidate object regions. Experiment results show that the proposed method extracts the attentive regions and attentive objects efficiently, with 84.3% Precision rate and 81.3% recall rate.

• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.28-35
• /
• 2010

The variable block size motion estimation (ME) and compensation (MC) using multiple reference frames is adopted in H.264/AVC to improve coding efficiency. However, the computational complexity for ME/MC increases proportional to the number of reference frames and variable blocks. In this paper, we propose a new efficient reference frame selection algorithm to reduce the complexity while keeping the visual quality. First, a motion vector reference map is constructed by SAD of $4{\times}4$ block unit for multi reference frames. Next, the variable block size motion estimation and motion compensation is performed according to the motion vector reference map. The computer simulation results show that the average loss of BDPSNR is -0.01dB, the increment of BDBR is 0.27%, and the encoding time is reduced by 38% compared with the original method for H.264/AVC.

• Journal of information and communication convergence engineering
• /
• v.14 no.4
• /
• pp.207-214
• /
• 2016

In this paper, we propose a radial reference map-based location fingerprinting technique with constant spacing from an access point (AP) to all reference points by considering the minimum dynamic range of the received signal strength indicator (RSSI) obtained through an experiment conducted in an indoor environment. Because the minimum dynamic range, 12 dBm, of the RSSI appeared every 20 cm during the training stage, a cell spacing of 80 cm was applied. Furthermore, by considering the minimum dynamic range of an RSSI in the location estimation stage, when an RSSI exceeding the cumulative average by ${\pm}6dBm$ was received, a previously estimated location was provided. We also compared the location estimation accuracy of the proposed method with that of a conventional fingerprinting technique that uses a grid reference map, and found that the average location estimation accuracy of the conventional method was 21.8%, whereas that of the proposed technique was 90.9%.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.666-669
• /
• 2000

Localization is the process of aligning the robot's local coordinates with the global coordinates of a map. A mobile robot's location is basically computed by a dead reckoning scheme, but this position information becomes increasingly inaccurate during navigation due to odometry errors. In this paper, the method of building a map of a robot's environment using ultrasonic sensor data and the occupancy grid map scheme is briefly presented. Then, the search and matching algorithms to compensate for the odometry error by comparing the local map with the reference map are proposed and verified by experiments. It is shown that the compensated error is not accumulated and exists within the limited range.

• Journal of Broadcast Engineering
• /
• v.25 no.6
• /
• pp.954-964
• /
• 2020

In immersive media, the most important factor that provides immersion is depth information. Therefore, it is essential to obtain high quality depth information in order to produce high quality immersive media. In this paper we propose an algorithm to improve depth map, considering the segmentation of images and the relationship between multiple views in multi-view systems. The proposed algorithm uses a super-pixel segmentation technique to divide the depth map of the reference view into several segments, and project each segment into adjacent view. Subsequently, the depth map of the adjacent view is improved using plane estimation using the information of the projected segment, and then reversed to the reference view. This process is repeated for several adjacent views to improve the reference depth map by updating the values of the improved adjacent views and the initial depth map of the reference view. Through simulation, the proposed algorithm is shown to surpass the conventional algorithm subjectively and objectively.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.2
• /
• pp.58-65
• /
• 1997

A new automatic classification method with high and stable accuracy for time-series image data is presented in this paper. This method is based on prior condition that a classified map of the target area already exists, or at least one of the time-series image data had been classified. The classified map is used as a reference map to specify training areas of classification categories. The new automatic classification method consists of five steps, i.e., extraction of training data using reference map, detection of changed pixels based upon the homogeneity of training data, clustering of changed pixels, reconstruction of training data, and classification as like maximum likelihood classifier. In order to evaluate the performance of this method qualitatively, four time-series Landsat TM image data were classified by using this method and a conventional method which needs a skilled operator. As a results, we could get classified maps with high reliability and fast throughput, without a skilled operator.