• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.163-167
• /
• 2009

3D human body scan technique is known to be practically useful in industrial field as the technique becomes more precise and cheaper. Landmark extraction is essential for full utilization of the scan data. In this paper, we suggest an algorithm for automatic landmark extraction. For this purpose, we perform markerless matching to the target data using PCA analysis and quasi-Newton optimization. Landmarks are extracted from the topology of resulting body.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.10a
• /
• pp.71-84
• /
• 2005

The Fieller-Creasy problem involves statistical inference about the ratio of two independent normal means. It is difficult problem from either a frequentist or a likelihood perspective. As an alternatives, a Bayesian analysis with noninformative priors may provide a solution to this problem. In this paper, we extend the results of Yin and Ghosh (2001) to unbalanced sample case. We find various noninformative priors such as first and second order matching priors, reference and Jeffreys' priors. The posterior propriety under the proposed noninformative priors will be given. Using real data, we provide illustrative examples. Through simulation study, we compute the frequentist coverage probabilities for probability matching and reference priors. Some simulation results will be given.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.3
• /
• pp.601-614
• /
• 2009

This paper derives noninformative priors for scale parameter of exponential distribution when the data are collected in multiple step stress accelerated life tests. We nd the objective priors for this model and show that the reference prior satisfies first order matching criterion. Also, we show that there exists no second order matching prior. Some simulation results are given and using artificial data, we perform Bayesian analysis for proposed priors.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.1
• /
• pp.45-52
• /
• 2015

The interoperability of multi-source data has become more important due to various digital maps, produced from public institutions and enterprises. In this study, the automatic matching algorithm of multi-source building data using hierarchical matching was proposed. At first, we divide digital maps into blocks and perform the primary geometric registration of buildings with the ICP algorithm. Then, corresponding building pairs were determined by evaluating the similarity of overlap area, and the matching threshold value of similarity was automatically derived by the Otsu binary thresholding. After the first matching, we extracted error matching candidates buildings which are similar with threshold value to conduct the secondary ICP matching and to make a matching decision using turning angle function analysis. For the evaluation, the proposed method was applied to representative public digital maps, road name address map and digital topographic map 2.0. As a result, the F measures of matching and non-matching buildings increased by 2% and 17%, respectively. Therefore, the proposed method is efficient for the matching of building polygons from multi-source digital maps.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.43-51
• /
• 1997

In this paper, we quantize the image data to simplify the systolic array architecture for block matching algorithm. As the number of bits for pixel data to be processed is reduced by quantization, one can simplify the hardware of systolic array. Especially, if the bit serial input is used, one can even more simplify the structure of processing element. First, we analize the effect of quantization to a block matching. then we show the structure of quantizer and processing element when bit serial input is used. The simulation results applied to standard images have shown that the proposed block matching method has less prediction error than the conventional high speed algorithm.

• Spatial Information Research
• /
• v.15 no.2
• /
• pp.181-187
• /
• 2007

To make digital terrain data, automatic correlation matching by stereo airborne/satellite images has been researched. The result of automatic correlation matching has a limit on extracting exact ground height because of angle of sensor, tree of height. Therefore, the amount of editing works depend on the distribution of spatial feature in images as well as image quality. This paper shows that the automatic correlation matching result was affected by density and height of tree.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.5
• /
• pp.483-488
• /
• 2008

An active omni-directional raging system using an omni-directional vision with structured light has many advantages compared to the conventional ranging systems: robustness against external illumination noise because of the laser structured light and computational efficiency because of one shot image containing $360^{\circ}$ environment information from the omni-directional vision. The omni-directional range data represents a local distance map at a certain position in the workspace. In this paper, we propose a matching algorithm for the local distance map with the given global map database, thereby to localize a mobile robot in the global workspace. Since the global map database consists of line segments representing edges of environment object in general, the matching algorithm is based on relative position and orientation of line segments in the local map and the global map. The effectiveness of the proposed omni-directional ranging system and the matching are verified through experiments.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.2
• /
• pp.320-326
• /
• 2008

In this paper, we propose a new algorithm emulating the DNA characteristics for noise-tolerant pattern matching problem on digital system. The digital pattern matching becomes core technology in various fields, such as, robot vision, remote sensing, character recognition, and medical diagnosis in particular. As the properties of natural DNA strands allow hybridization with a certain portion of incompatible base pairs, DNA-inspired data structure and computation technique can be adopted to bio-signal pattern classification problems which often contain imprecise data patterns. The key feature of noise-tolerance of DNA computing comes from control of reaction temperature. Our hardware system mimics such property to diagnose cardiovascular disease and results superior classification performance over existing supervised learning pattern matching algorithms. The hardware design employing parallel architecture is also very efficient in time and area.

• Aerospace Engineering and Technology
• /
• v.6 no.2
• /
• pp.219-228
• /
• 2007

The test is performed to measure the accuracy of landmark matching process considering cloud detection performance and to analyze the evolution of this accuracy with respect to the cloud detection processing parameters. For the purpose, MTSAT-1R HiRiD data were used to induce final results. The test result shows that landmarks matching performance estimation on MTSAT-1R HiRiD data is considered as being between 0.06 and 0.09 IR pixel, corresponding to $7{\mu}rad$ and $10{\mu}rad$.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.52-53
• /
• 2012

Belief propagation (BP) is a commonly used global energy minimization algorithm for solving stereo matching problem in 3D reconstruction. However, it requires large memory bandwidth and data size. In this paper, we propose a novel memory-efficient algorithm of BP in stereo matching on the Graphics Processing Units (GPU). The data size and transfer bandwidth are significantly reduced by storing only a part of the whole message. In order to maintain the accuracy of the matching result, the local messages are reconstructed using shared memory available in GPU. Experimental result shows that there is almost an order of reduction in the global memory consumption, and 21 to 46% saving in memory bandwidth when compared to the conventional algorithm. The implementation result on a recent GPU shows that we can obtain 22.8 times speedup in execution time compared to the execution on CPU.