• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.10-18
• /
• 2004

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The operations of unaligned linear quadtrees, which are operations among the linear quadtrees with different origin, are able to perform the translated or rotated images efficiently. And this operations requires alignment of the linear quadtrees. In this paper, we present an efficient algorithm to perform alignment of unaligned linear quadtrees, using three-dimensional $n{\pm}n{\pm}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\pm}n{\pm}n$ RMESH.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1947-1954
• /
• 2012

The first frame is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the initial QP for the first frame affects the first frame as well as the following frames. Traditionally, the initial QP is determined among four constant values only depending on the bpp. In the case of low bit rate video coding, the initial QP value is fixed to 40 regardless of the output bandwidth. Although this initialization scheme is simple, yet it is not accurate enough. An accurate initial QP prediction scheme should not only depends on bpp but also on the complexity of the video sequence and the output bandwidth. In the proposed scheme, we determine the initial QP according to the ratio of the first frame to the total bits allocated to a GOP. To estimate the QP of the allocated bits, Rate-QP model is used. It is shown by experimental results that the new algorithm can predict the optimal initial QP more accurately and generate the PSNR performance better than that of the existing JVT algorithm.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.357-368
• /
• 2003

Evaluation of shape similarity for 3D models is essential in many areas - medicine, mechanical engineering, molecular biology, etc. Moreover, as 3D models are commonly used on the Web, many researches have been made on the classification and retrieval of 3D models. In this paper, we describe methods for 3D shape representation and major concepts of similarity evaluation, and analyze the key features of recent researches for shape comparison after classifying them into four categories including multi-resolution, topology, 2D image, and statistics based methods. In addition, we evaluated the performance of the reviewed methods by the selected criteria such as uniqueness, robustness, invariance, multi-resolution, efficiency, and comparison scope. Multi-resolution based methods have resulted in decreased computation time for comparison and increased preprocessing time. The methods using geometric and topological information were able to compare more various types of models and were robust to partial shape comparison. 2D image based methods incurred overheads in time and space complexity. Statistics based methods allowed for shape comparison without pose-normalization and showed robustness against affine transformations and noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8C
• /
• pp.591-597
• /
• 2008

In this paper, we present a improved rate distortion optimization (RDO) for H.264 intra coding. By using new mode decision criteria pass for $I4{\times}4$ in company with the original RDO, the proposed method can achieve the better coding efficiency comparing with the original RDO. Our experimental results show that the proposed algorithm can archive about $0.64{\sim}1.6578%$ bit rate decrease at the same PSNR and $0.049{\sim}0.101dB$ PSNR increase at the same bit rate.

• Journal of the HCI Society of Korea
• /
• v.6 no.1
• /
• pp.9-16
• /
• 2011

The previous researches of 3D object modeling have been performed in a limited environment where a target object only exists. However, in order to model an object in the real environment, we need to consider a dynamic environment, which has various objects and a frequently changing background. Therefore, this paper presents a segmentation and tracking method for a foreground which includes a target object in the dynamic environment. By using depth information than color information, the foreground region can be segmented and tracked more robustly. In addition, the foreground region can be tracked on the sequential images by referring depth distributions of the foreground region because both the position and the status in the consecutive images of the foreground region are almost unchanged. Experimental results show that our proposed method can robustly segment and track the foreground region in various conditions of the real environment. Moreover, as an application of the proposed method, it is presented a method for modeling an object extracting the object regions from the foreground region that is segmented and tracked.

• Journal of the Korea Convergence Society
• /
• v.9 no.6
• /
• pp.25-31
• /
• 2018

Captive Flight Test (CFT) is one of the most important tests to acquire data when developing complex weapon systems. In this paper, we introduce the design and test result of our POD system for CFT. POD system uses POD set which consists of left and right POD. The exterior and mass properties of POD set are equal to those of fuel tank for aircraft so that we can omit Airworthiness Certification. Also, we adequately placed inner-equipments in order to acquire data including target image, navigation result and reference data to verify and analyse software algorithm. The POD system for CFT we developed is complex system as both mechanical and electronic factors are applied. As we repeatedly performed CFT, useful and various data for weapon development were acquired.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.3
• /
• pp.70-77
• /
• 2017

Recently, Internet of Things (IoT) and deep learning techniques have affected video surveillance systems in various ways. The surveillance features that perform detection, tracking, and classification of specific objects in Closed Circuit Television (CCTV) video are becoming more intelligent. This paper presents real-time algorithm that can run in a PC environment using only a low power CPU. Traditional tracking algorithms combine background modeling using the Gaussian Mixture Model (GMM), Hungarian algorithm, and a Kalman filter; they have relatively low complexity but high detection errors. To supplement this, deep learning technology was used, which can be trained from a large amounts of data. In particular, an SRGB(Sequential RGB)-3 Layer CNN was used on tracked objects to emphasize the features of moving people. Performance evaluation comparing the proposed algorithm with existing ones using HOG and SVM showed move-in and move-out error rate reductions by 7.6 % and 9.0 %, respectively.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.6
• /
• pp.127-136
• /
• 1998

This paper proposes a new MVQMultistage Vector Quantizer) using a hybrid structure. While in a conventional MVQ, the quantizers of all stages perform the encoding procedure for input signals, we introduce a quantizer that performs selectively. The proposed quantizer with a hybrid structure is composed of a FSVQ(Finite-State Vector Quantizer) for the first stage and a ordinary VQ(Vector Quantizer) for the second stage. A input block is firstly encoded by the FSVQ of the first stage. If the Euclidean distortion measure between original signals and the codevector selected from the state codebook of the FSVQ is less than a prespecified value, only the FSVQ is used for image coding. Otherwise, both the FSVQ of the first stage and the ordinary VQ of the second stage are used for image coding. While the conventional MVQ has an advantage that can achieve low encoding complexity in comparison to the ordinary VQ, but has a disadvantage that is suboptimal with respect to the performance measure and can not achieve the bit rate reduction, the proposed method achieve not only the bit rate reduction but also the performance improvement.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.103-112
• /
• 2011

Motion estimation (ME) is regarded as an important component in a video encoding process, because it consumes a large computation complexity. H.264/AVC requires additional computation overheads for fractional search and interpolation. This causes a problem that computational complexity is increased. In Motion estimation, SATD(Sum of Transform Difference) has the characteristics of a parabolic based on the minimum point. In this paper, we propose new prediction algorithm to reduce search point in motion estimation by sub-pixel interpolation characteristics. The proposed algorithm reduces the time of encoding process by decreasing computational complexity. Experimental results show that the proposed method reduces 20% of the computation complexity of motion estimation, while the degradation in video quality is negligible.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.12
• /
• pp.95-101
• /
• 2009

s economic development has been achieved and society gets complicated, problems of traffic system have been also exposed. Due to these problems, drivers have to endure economic loss and delayed time. A web-based parking lot management system has been proposed to solve this problem. Because a parking lot is an important resource of traffic system, efficient management of parking lots can be means to solve critical problems of traffic system. In this study a simple method is introduced to detect moving vehicles with geometric information of moving objects that has been computed from surveillance cameras installed in a parking lot. Statistical information processed from image data is also stored on a server side, such as total number of parking lots, a number of parked cars and a number of available parking spots. A client who wants to know the nearest parking place can share the information via a mobile device and shorten his or her driving time. Great benefit to both drivers and society is expected if many parking lots are equipped with this system.