• Journal of Korea Game Society
• /
• v.13 no.4
• /
• pp.25-34
• /
• 2013

Spatial partitioning trees are needed for processing collision detections efficiently. In order to select split planes for spatial partitioning trees, the tree balance and the number of polygons overlapped with the split plane should be considered. In this paper, the heuristic algorithm controlling weight values of tree build criteria is proposed for spatial partitioning trees of 3D games. As the weight values are changed, tree build time, T-junction elimination time which can cause visual artifacts in splitting polygons overlapped with the split plane, rendering speed (frame per second: FPS) according to tree balance are analysed under 3D game simulations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.85-91
• /
• 2015

This paper presents a novel frame rate up-conversion (FRUC) algorithm. Existing algorithms, in general, employ rectangular blocks for motion estimation and arbitrary shape of an actual object region cannot be precisely represented. On the other hand, the proposed wedge-shaped block partitioning algorithm partitions a rectangular block into two wedge-shaped blocks using the texture information, which makes better approximation for an actual object region. The wedge-shaped block partitioning algorithm as well as the adaptive motion vector prediction algorithm is used to reliably estimate the actual motion. Experimental results show that the proposed FRUC algorithm is superior to existing algorithms up to 1.988dB in PSNR and 0.0167 in SSIM comparisons.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.585-590
• /
• 2002

In the typical data partitioning for error-resilient video coding, motion and macroblock header information is separated from the texture information. It can be an effective tool for the transmission of video over the error prone environment. For Intra-coded frames, however, the loss of DCT (discrete cosine transform) coefficients is fatal because there is no ther information to reconstruct the corrupted macroblocks by errors. For Inter-coded frames, when error occurs in DCT coefficients, the picture quality is degraded because all DCT coefficients are discarded in those packets. In this paper, we propose an efficient data partitioning and coding method for DCT-based error-resilient video. The quantized DCT coefficients are partitioned into the even-value approximation and the remainder parts. It is shown that the proposed algorithm provides a better quality of the high priority part than the conventional methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.62-69
• /
• 2015

In this paper, a new frame rate up conversion (FRUC) algorithm using adaptive motion estimation (AME-FRUC) is proposed. The proposed algorithm performs extended bilateral motion estimation (EBME) conducts motion estimation (ME) processes on the static region, and extract region of interest with the motion vector (MV). In the region of interest block, the proposed AME-FRUC uses the texture block partitioning scheme and the unilateral motion estimation for improving ME accuracy. Finally, motion compensated frame interpolation (MCFI) are adopted to interpolate the intermediate frame in which MCFI is employed adaptively based on ME scheme. Experimental results show that the proposed algorithm improves the PSNR up to 3dB, the SSIM up to 0.07 and 68% lower SAD calculations compared to the EBME and the conventional FRUC algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.165-182
• /
• 2014

An RFID systems employ efficient Anti-Collision Algorithms (ACAs) to enhance the performance in various applications. The EPC-Global G2 RFID system utilizes Frame Slotted Aloha (FSA) as its ACA. One of the common approaches used to maximize the system performance (tag identification efficiency) of FSA-based RFID systems involves finding the optimal value of the frame length relative to the contending population size of the RFID tags. Several analytical models for finding the optimal frame length have been developed; however, they are not perfectly optimized because they lack precise characterization for the timing details of the underlying ACA. In this paper, we investigate this promising direction by precisely characterizing the timing details of the EPC-Global G2 protocol and use it to derive a precise-optimal frame length model. The main objective of the model is to determine the optimal frame length value for the estimated number of tags that maximizes the performance of an RFID system. However, because precise estimation of the contending tags is difficult, we utilize a parametric-heuristic approach to maximize the system performance and propose two simple schemes based on the obtained optimal frame length-namely, Improved Dynamic-Frame Slotted Aloha (ID-FSA) and Exponential Random Partitioning-Frame Slotted Aloha (ERP-FSA). The ID-FSA scheme is based on the tag set estimation and frame size update mechanisms, whereas the ERP-FSA scheme adjusts the contending tag population in such a way that the applied frame size becomes optimal. The results of simulations conducted indicate that the ID-FSA scheme performs better than several well-known schemes in various conditions, while the ERP-FSA scheme performs well when the frame size is small.

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.2
• /
• pp.94-100
• /
• 2010

The reliable multicast MAC (Medium Access Control) protocol is needed to guarantee the recipients' nonerroneous reception of the multicast data frames, which can be transmitted by the AP (Access Point) in infrastructure mode IEEE 802.11 wireless LANs. Enhancing the BMMM (Batch Mode Multicast MAC) protocol, in the literature, the connectivity-based reliable multicast MAC protocol was proposed to reduce the RAK (Request for ACKnowledgement) frame transmissions and enhance the multicast MAC performance. However, the number of necessary RAK frame transmissions increases as the number of multicast recipients increases. To alleviate the problem of the larger number of RAK frame transmissions with the larger number of multicast recipients, we propose the clustering algorithm for partitioning the recipients into a small number of clusters, so that the recipients are connected each other within the same clusters. Numerical examples are presented to show the reliable multicast MAC performance improvement by the clustering algorithm.

• Korean Journal of Applied Biomechanics
• /
• v.12 no.1
• /
• pp.125-133
• /
• 2002

The purpose of this study was to develop a method for estimating 3-D coordinates of lower trunk muscles using orientation angles during a motion. Traditional 3-D motion analysis system with DLT technique was used to track down the locations of eight reference markers which were attached on the back of the subject. In order to estimate the orientations of individual lumbar vertebrae and musculoskeletal parameters of the lower trunk muscle, the rotation matrix of the middle trunk reference frame relative to the lower trunk reference frame was determined and the angular locations of individual lumbar vertebrae were estimated by partitioning the orientation angles (Cardan angles) that represent the relative angles between the rotations of the middle and lower trunks. When the orientation angles of individual intervertebral joints were known at a given instant, the instantaneous coordinates of the origin and insertion for all selected muscles relative to the L5 local reference frame were obtained by applying the transformation matrix to the original coordinates which were relative to a local reference frame (S1, L4, L3, L2, or L1) in a rotation sequence about the Z-, X- and Y-axes. The multiplication of transformation matrices was performed to estimate the geometry and kinematics of all selected muscles. The time histories of the 3-D coordinates of the origin and insertion of all selected muscles relative to the center of the L4-L5 motion segment were determined for each trial.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.607-611
• /
• 2008

This paper proposes new video signature using spatio-temporal information for copy detection. The proposed video copy detection method is based on concentric circle partitioning method for each key frame. Firstly, key frames are extracted from whole video using temporal bilinear interpolation periodically and each frame is partitioned as a shape of concentric circle. For the partitioned sub-regions, 4 feature distributions of average intensity, its difference, symmetric difference and circular difference distributions are obtained by using the relation between the sub-regions. Finally these feature distributions are converted into binary signature by using simple hash function and merged together. For the proposed video signature, the similarity distance is calculated by simple Hamming distance so that its matching speed is very fast. From experiment results, the proposed method shows high detection success ratio of average 97.4% for various modifications. Therefore it is expected that the proposed method can be utilized for video copy detection widely.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.943-952
• /
• 2000

The surface reconstruction problem from a set of wire-frame contours is very important in diverse fields such as medical imaging or computer animation. In this paper, surface triangulation method is proposed for solving the problem. Generally, many optimal triangulation techniques suffer from the large computation time but heuristic approaches may produce very unnatural surface when contours are widely different in shape. To compensate the disadvantages of these approaches, we propose a new heuristic triangulation method which iteratively decomposes the surface generation problem from a band (a pair of vertices chain) into tow subproblems from two sub-bands. Generally, conventional greedy heuristic contour triangulation algorithm, suffer from the drastic error propagation during surface modeling when the adjacent contours are different in shape. Our divide-and-conquer algorithm, called band partitioning algorithm, processes eccentric parts of the contours first with more global information. Consequently, the resulting facet model becomes more stable and natural even though the shapes are widely different. An interesting property of our method is hat it supports multi-resolution capability in surface modeling time. According to experiments, it is proved to be very robust and efficient in many applications.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1134-1142
• /
• 2019

Detection of double compression is one of the most efficient ways of remarking the validity of videos. Many methods have been introduced to detect HEVC double compression with different coding parameters. However, HEVC double compression detection under the same coding environments is still a challenging task in video forensic. In this paper, we introduce a novel method based on the frame partitioning information in intra prediction mode for detecting double compression in with the same coding environments. We propose to extract statistical feature and Deep Convolution Neural Network (DCNN) feature from the difference of partitioning picture including Coding Unit (CU) and Transform Unit (TU) information. Finally, a softmax layer is integrated to perform the classification of the videos into single and double compression by combing the statistical and the DCNN features. Experimental results show the effectiveness of the statistical and the DCNN features with an average accuracy of 87.5% for WVGA and 84.1% for HD dataset.