• Journal of KIISE:Software and Applications
• /
• v.29 no.5
• /
• pp.319-325
• /
• 2002

Tracking moving objects is one of the most important techniques in motion analysis and understanding, and it has many difficult problems to solve. Especially, estimating and identifying moving objects, when the background and moving objects vary dynamically, are very difficult. It is possible under such a complex environment that targets may disappear totally or partially due to occlusion by other objects. The Kalman filter has been used to estimate motion information and use the information in predicting the appearance of targets in succeeding frames. In this paper, we propose another version of the Kalman filter, to be called structured Kalman filter, which can successfully work its role of estimating motion information under a deteriorating condition such as occlusion. Experimental results show that the suggested approach is very effective in estimating and tracking non-rigid moving objects reliably.

• The KIPS Transactions:PartB
• /
• v.17B no.3
• /
• pp.215-226
• /
• 2010

The structured-light 3D reconstruction technique uses a coded-pattern to find correspondences between the camera image and the projector image. To calculate the 3D coordinates of the correspondences, it is necessary to calibrate the camera and the projector. In addition, the calibration results affect the accuracy of the 3D reconstruction. Conventional camera-projector calibration techniques commonly require either expensive hardware rigs or complex algorithm. In this paper, we propose an easy camera-projector calibration technique. The proposed technique does not need any hardware rig or complex algorithm. Thus it will enhance the efficiency of structured-light 3D reconstruction. We present two camera-projector systems to show the calibration results. Error analysis on the two systems are done based on the projection error of the camera and the projector, and 3D reconstruction of world reference points.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.41 no.3
• /
• pp.277-288
• /
• 2021

Building information modeling (BIM) element to industry foundation classes (IFC) entity mappings need to be checked to ensure the semantic integrity of BIM models. Existing studies have demonstrated that machine learning algorithms trained on geometric features are able to classify BIM elements, thereby enabling the checking of these mappings. However, reliance on geometry is limited, especially for elements with similar geometric features. This study investigated the employment of relational data between elements, with the assumption that such additions provide higher classification performance. Neural structured learning, a novel approach for combining structured graph data as features to machine learning input, was used to realize the experiment. Results demonstrated that a significant improvement was attained when trained and tested on eight BIM element types with their relational semantics explicitly represented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2346-2362
• /
• 2016

As one of the most important issues in computer vision and image processing, online object tracking plays a key role in numerous areas of research and in many real applications. In this study, we present a novel tracking method based on the proposed structured sparse representation model, in which the tracked object is assumed to be sparsely represented by a set of object and background templates. The contributions of this work are threefold. First, the structure information of all the candidate samples is utilized by a joint sparse representation model, where the representation coefficients of these candidates are promoted to share the same sparse patterns. This representation model can be effectively solved by the simultaneous orthogonal matching pursuit method. In addition, we develop a tracking algorithm based on the proposed representation model, a discriminative candidate selection scheme, and a simple model updating method. Finally, we conduct numerous experiments on several challenging video clips to evaluate the proposed tracker in comparison with various state-of-the-art tracking algorithms. Both qualitative and quantitative evaluations on a number of challenging video clips show that our tracker achieves better performance than the other state-of-the-art methods.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.532-539
• /
• 2003

The paper proposes a pre-processing method for efficient processing of XML queries in information retrieval systems with a large amount of XML documents. For the pre-processing, we use a signature-based approach. In the conventional (flat document-based) information retrieval systems, user queries consist of keywords and boolean operators, and thus signatures are structured in a flat manner. However, in XML-based information retrieval systems, the user queries have the form of path query. Therefore, the flat signature cannot be effective for XML documents. In the paper, we propose a structured signature for XML documents. Through experiments, we evaluate the performance of the proposed method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.383-386
• /
• 2009

In this paper, we propose some parallel structures of the word-based nonlinear combine functions in word-based stream cipher, high-speed versions of general (bit-based) nonlinear combine functions. Especially, we propose the high-speed structures of popular three kinds in word-based nonlinear combiners using by PS-WFSR (Parallel-Shifting or Parallel-Structured Word-based FSR): m-parallel word-based nonlinear combiner without memory, m-parallel word-based nonlinear combiner with memories, and m-parallel word-based nonlinear filter function. Finally, we analyze its cryptographic security and performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.895-906
• /
• 1993

In this paper, MTSVQ(Multirate Tree-Structured Vector Quantization) is introduced for subband image coding. Original images are decomposed into a number of subband components, and multiresolution codebook is designed by MTSVQ algorithm. Optimal bit allocation among the subband components becomes the problem selecting the particular pruned subtree of MTSVQ which has the desired rate and distortion.

• Journal of the Korean Society for information Management
• /
• v.9 no.2
• /
• pp.118-153
• /
• 1992

This study att.empts to conduct a system an;~lysis and dcsign for circt~lation control in a univcr~ity library. In this proccss, structured sysltcm analys15 tcrhn~clucs Iikr data flolv diagrnms. data dictiomiry, and entity - relationship analysis, arc. vmploycd to construct both concqitual and p h p c a l data models of current and new circulation systems. Thc whole design aims at an al~tomntctf c~r.culation system on thc [nlcro-compurcr --basis in a mid dle - sized library.

• Asia pacific journal of information systems
• /
• v.9 no.2
• /
• pp.1-17
• /
• 1999

A feedback echo is a structured restatement of the user's query and informs the user what the system intends to do for the query. This provides backtracking of the user's query so that the user knows how the system has interpreted the query. This study scrutinizes whether the feedback echo, as currently available in the INTELLECT commercial system, can improve the performance of a casual user using a restricted natural language database interface. This study concludes that the particular type of feedback echo available in this commercial system was not effective in terms of overall performance for casual users. It is worth mentioning, however, that the feedback echo was effective for the specific type of error: using wrong conditions for data retrieval.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.8
• /
• pp.1444-1456
• /
• 2011

This paper presents a low-complexity algorithm for an H.264/AVC encoder. The proposed motion estimation scheme determines the best coding mode for a given macroblock (MB) by finding motion-blurred MBs; identifying, before motion estimation, an early selection of MBs; and hence saving processing time for these MBs. It has been observed that human vision is more sensitive to the movement of well-structured objects than to the movement of randomly structured objects. This study analyzed permissible perceptual distortions and assigned a larger inter-mode value to the regions that are perceptually less sensitive to human vision. Simulation results illustrate that the algorithm can reduce the computational complexity of motion estimation by up to 47.16% while maintaining high compression efficiency.