• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.17-30
• /
• 2000

In this paper, we propose an efficient algorithm to produce 3-D surface model from a set of range data, based on NURBS (Non-Uniform Rational B-Splines) surface fitting technique. It is assumed that the range data is initially unorganized and scattered 3-D points, while their connectivity is also unknown. The proposed algorithm consists of three steps: initial model approximation, hierarchical representation, and construction of the NURBS patch network. The mitral model is approximated by polyhedral and triangular model using K-means clustering technique Then, the initial model is represented by hierarchically decomposed tree structure. Based on this, $G^1$ continuous NURBS patch network is constructed efficiently. The computational complexity as well as the modeling error is much reduced by means of hierarchical decomposition and precise approximation of the NURBS control mesh Experimental results show that the initial model as well as the NURBS patch network are constructed automatically, while the modeling error is observed to be negligible.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.8-15
• /
• 2011

In this paper, we propose a new structure modeling algorithm from 3D cloud points of terrestrial LADAR data. Terrestrial LIDAR data have various obstacles which make it difficult to apply conventional algorithms designed for air-borne LIDAR data. In the proposed algorithm, the field data are separated into several clusters by adopting the structure extraction method which uses color information and Hough transform. And cluster based Delaunay triangulation technique is sequentially applied to model the artificial structure. Each cluster has its own priority and it makes possible to determine whether a cluster needs to be considered not. The proposed algorithm not only minimizes the effects of noise data but also interactively controls the level of modeling by using cluster-based approach.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.6
• /
• pp.123-131
• /
• 2009

The emerging display technology has been replaced the previous position of the CRT with the LCD. The nature of hold type display such as LCD, however, causes many problems such as motion blur and motion judder. To resolve the problems, we used frame interpolation technique which improves the image quality by inserting new interpolated frames between existing frames. In this paper, we propose a novel frame interpolation technique that uses dominant MV and variance different value in each block. At first, the proposed algorithm performs unidirectional motion estimation using blocking matching algorithm. The new frame is generated by pixel average using compared block variance or by pixel motion compensation using dominant motion vector, whether the motion estimation find the target area or not. Several experiments with the proposed algorithm shows that the proposed algorithm has better image quality than the existing bidirectional frame interpolation algorithm at the rate of about 3dB PSNR and has low complexity comparing to the unidirectional frame interpolation technique.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.6
• /
• pp.58-67
• /
• 2009

A correspondence matching is one of the important tasks in computer vision, and it is not easy to find corresponding points in variable environment where a scale, rotation, view point and illumination are changed. A SURF(Speeded Up Robust Features) algorithm have been widely used to solve the problem of the correspondence matching because it is faster than SIFT(Scale Invariant Feature Transform) with closely maintaining the matching performance. However, because SURF considers only gray image and local geometric information, it is difficult to match corresponding points on the image where similar local patterns are scattered. In order to solve this problem, this paper proposes an extended SURF algorithm that uses the invariant color and global geometric information. The proposed algorithm can improves the matching performance since the color information and global geometric information is used to discriminate similar patterns. In this paper, the superiority of the proposed algorithm is proved by experiments that it is compared with conventional methods on the image where an illumination and a view point are changed and similar patterns exist.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.5
• /
• pp.54-63
• /
• 2007

The purpose of this study is to present a new energy minimization method for image completion with hierarchical approach. The goal of image completion is to fill in missing part in a possibly large region of an image so that a visually plausible outcome is obtained. An exemplar-based Markov Random Field Modeling(MRF) is proposed in this paper. This model can deal with following problems; detection of global features, flexibility on environmental changes, reduction of computational cost, and generic extension to other related domains such as image inpainting. We use the Priority Belief Propagation(Priority-BP) which is a kind of Belief propagation(BP) algorithms for the optimization of MRF. We propose the hierarchical Priority-BP that reduces the number of nodes in MRF and to apply hierarchical propagation of messages for image completion. We show that our approach which uses hierarchical Priority-BP algorithm in image completion works well on a number of examples.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.19-26
• /
• 2006

In these days, multimedia data is transmitted and processed in compressed format. Due to the decoding procedure and filtering for edge detection, the feature extraction process of MPEG-7 Edge Histogram Descriptor (EHD) is time consuming as well as computationally expensive. To improve efficiency of compressed image retrieval, we propose a new edge histogram generation algorithm in DCT domain in this paper. Using the edge information provided by the only two AC coefficients of DCT coefficients, we can get edge directions and strengths directly in DCT domain. The experimental results demonstrate that our system has good performance in terms of retrieval efficiency and effectiveness.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.91-100
• /
• 2009

In this paper, we propose a wearable augmented reality system using gaze interaction. Gaze interaction has been considered to be the potential of easy, natural and fast way of interaction and becomes a suitable way in optical see-through HMD based wearable AR. Our system recognizes user's gaze point, half blink motion and displays the information of object seen by user to HMD. Half blink selection technique avoids the Midas touch problem and represents user's intention correctly. We've developed a AR annotation system and estimated the usability of gaze interaction. The accuracy and robustness of our technique is verified on the experimental results.

• 보존과학연구
• /
• s.32
• /
• pp.5-24
• /
• 2011

Neunghwaji(Embossed patterned paper) is a unique paper used for a traditional book cover in Korea. The research was carried out to investigate Neunghwaji's features. Physical property was studied through a test of tensile strength and folding endurance. Also, comparative analysis of virus resistance and waterproof ability was undertaken on Neunghwaji. 1. Folding endurance test showed that strength of non-embossed CB and HB decreased during deteriorating duration. Embossed CN and HN showed the strength increasing at early stage and decreasing from the 27th day of the deteriorating duration. Tensile strength was decreasing in both cases as deterioration progressed. 2. Growth of Arthrinium sp. fungus on embossed paper was 10% less than plain paper while Cladosporium sp. showed 20~30% less growth. Amur cork dyeing(H) showed 10~30% lower fungi growth than Gardenia seed dyeing(C). The result indicated that embossed paper has better virus resistance than Hanji, and Amur cork dyeing has better virus resistance than Gardenia seed dyeing. 3. Average contact angle of CN, CB, HN, and HB was $85{\sim}92^{\circ}$ and NON-N and NON-B was $59{\sim}63^{\circ}$. In detail, CN's contact angle was $1{\sim}7^{\circ}$ higher than CB's; HN was $1{\sim}6^{\circ}$ higher than HB. Therefore, it was found that embossed paper has higher contact angle than Hanji thus the former has better waterproof ability. The research suggested production technique of Neunghwaji and studied its features related to the technique. Neunghwaji was confirmed to have superior quality to Hanji though further study regarding above test result is needed to complement the research.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.3
• /
• pp.30-39
• /
• 2012

In this paper, a safe driving assistance system is proposed by detecting the status of driver's doze based on face and eye detection. By the level of the fatigue, safe driving system alarms or set the seatbelt on vibration. To reduce the effect of backward light and too strong solar light which cause a decrease of face and eye detection rate and false fatigue detection, post processing techniques like image equalization are used. Haar transform and PCA are used for face detection. By using the statistic of the face and eye structural ratio of normal Koreans, we can reduce the eye candidate area in the face, which results in reduction of the computational load. We also propose a new eye status detection algorithm based on Hough transform and eye width-height ratio, which are used to detect eye's blinking status which decides doze level by measuring the blinking period. The system alarms and operates seatbelt on vibration through controller area network(CAN) when the driver's doze level is detected. In this paper, four algorithms are implemented and proposed algorithm is made based on the probability model and we achieves 84.88% of correct detection rate through indoor and in-car environment experiments. And also we achieves 69.81% of detection rate which is better result than that of other algorithms using IR camera.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.55-65
• /
• 2006

Most of fast block motion estimation algorithms reported so far in literatures aim to reduce the computation in terms of the number of search points, thus do not fit well with multimedia processors due to their irregular data flow. For multimedia processors, proper reuse of data is more important than reducing number of absolute difference operations because the execution cycle performance strongly depends on the number of off-chip memory access. Therefore, in this paper, we propose a Hexagon-shape line search (HEXSLS) algorithm using line search pattern which can increase data reuse from on-chip local buffer, and check sub-sampling points in line search pattern to reduce unnecessary SAD operation. Our experimental results show that the prediction error (MAE) performance of the proposed HEXSLS is similar to that of the full search block matching algorithm (FSBMA), while compared with the hexagon-based search (HEXBS), the HEXSLS outperforms. Also the proposed HEXSLS requires much lesser off-chip memory access than the conventional fast motion estimation algorithm such as the hexagon-based search (HEXBS) and the predictive line search (PLS). As a result, the proposed HEXSLS algorithm requires smaller number of execution cycles on media processor.