• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.885-890
• /
• 2003

The Core Base Tree (CBT) multicast routing architecture is a multicast routing protocol for the internet. The CBT establishes a single shared tree for a multicast connection. The shared tree Is rooted at a center node called core. The location of the core may affect the cost and performance of the CBT. The core placement method requires the knowledge of the network topology In this Paper, we propose a simple and effective method for selecting the core. This method requires the distance vector information. in addition, we used results that calculated sample correlation coefficient. And then we select suitable routing algorithm according to member's arrangement states in muliticast group. we select core node that have minimum average cost or PIM-SM protocol is selected. The performance of this method is compared with several other methods by extensive simulations (i.e mean delay, maximum delay, and total cost). Our results shows that this method for Selecting Core is very effective.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8B
• /
• pp.1424-1435
• /
• 2000

A bit-rate controller that can achieve a constant bit rate when coding object-based video sequences is an important part to achieve an adaptation to bit-rate constraints, desired video quality, distribution of bits among objects, relationship between texture and shape coding, and determination of frame skip or not. Therefore we design content-based bit rate controller which will be used for relevant bit-rate control. The implementation is an extension of MPEG-4 rate control algorithm which employs a quadratic rate-quantizer model. The importance of different objects in a video is analyzed and segmented into a number of VOPs which are adaptively bit-allocated using the object-based modelling. Some test sequences are observed by a number of non-experts and interests in each object are analysed. The initial total target bit-rate for all objects is obtained by using the proposed technique. Then the total target bits are jointly analyzed for preventing from overflow or underflow of the buffer fullness. The target bits are distributed to each object in view of its importance, not only of statistical analysis such as motion vector magnitude, size of object shape, and coding distortion of previous frame. The scheme is compared with the rate controller adopted by the MPEG-4 VM8 video coder by representing their statistics and performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.871-879
• /
• 2009

The performance variations of a spatio temporal smart antenna which is equipped at the basestation of CDMA cellular communication network due to the parametric change of multipath fading environment are studied in this paper. The smart antenna of interest employs space diversity based adaptive array structure in conjunction with rake receiver that has fingers the number of which is the same as that of multipath links. The beamforming is achieved via LMS(Least Mean Square) algorithm in which a reference signal is generated using decision directed formula. It has been shown by computer simulation that the performance of our smart antenna of interest depends significantly upon not only the degree of desired signal's DOA(Direction of Arrival)spread but the number of fingers of the rake receiver. The relative insensitivity of the smart antenna's performance on desired signal's delay spread has also been observed. Computer simulation has shown that the increase of the number of fingers brings in a nonlinear enhancement of the performance of our smart antenna. The renewal of weight vector in the beamforming procedure is taken place at post PN despread stage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.496-512
• /
• 2007

In this paper, we propose a novel JPEG-2000 compressed image retrieval system using feature vector extracted through partial entropy decoding. Main idea of the proposed method is to utilize the context information that is generated during entropy encoding/decoding. In the framework of JPEG-2000, the context of a current coefficient is determined depending on the pattern of the significance and/or the sign of its neighbors in three bit-plane coding passes and four coding modes. The contexts provide a model for estimating the probability of each symbol to be coded. And they can efficiently describe texture images which have different pattern because they represent the local property of images. In addition, our system can directly search the images in the JPEG-2000 compressed domain without full decompression. Therefore, our proposed scheme can accelerate the work of retrieving images. We create various distortion and similarity image databases using MIT VisTex texture images for simulation. we evaluate the proposed algorithm comparing with the previous ones. Through simulations, we demonstrate that our method achieves good performance in terms of the retrieval accuracy as well as the computational complexity.

• The KIPS Transactions:PartB
• /
• v.16B no.6
• /
• pp.463-470
• /
• 2009

In this paper, we propose the advanced fire-flame detection algorithm using camera image for better performance than previous sensors-based systems which is limited on small area. Also, previous works using camera image were depend on a lot of heuristic thresholds or required an additional computation time. To solve these problems, we use statistical values and divide image into blocks to reduce the processing time. First, from the captured image, candidate flame regions are detected by a background model and fire colored models of the fire-flame. After the probability models are formed using the change of luminance, wavelet transform and the change of motion on time axis, they are used for membership function of fuzzy logic. Finally, the result function is made by the defuzzification, and the probability value of fire-flame is estimated. The proposed system has shown better performance when it compared to Toreyin's method which perform well among existing algorithms.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.4
• /
• pp.307-314
• /
• 2009

The present paper briefly describes the space frame element and the fundamental strategies in computational elastic bifurcation theory of geometrically nonlinear, single load parameter conservative elastic spatial structures. A method for large deformation(rotation) analysis of space frame is based on an eulerian formulation, which takes into consideration the effects of large joint translations and rotations with finite deformation(rotation). The local member force-deformation relationships are based on the beam-column approach, and the change in member chord lengths caused by axial strain and flexural bowing are taken into account. and the derived geometric stiffness matrix is unsymmetric because of the fact that finite rotations are not commutative under addition. To detect the singular point such as bifurcation point, an iterative pin-pointing algorithm is proposed. And the path switching mode for bifurcation path is based on the non-negative eigen-value and it's corresponding eigen-vector. Some numerical examples for bifurcation analysis are carried out for a plane frame, plane circular arch and space dome structures are described.

• Geophysics and Geophysical Exploration
• /
• v.10 no.2
• /
• pp.147-153
• /
• 2007

The conjugate gradient (CG) method is one of the most efficient algorithms for solving a linear system of equations. In addition to being used as a linear equation solver, it can be applied to a least-squares problem. When the CG method is applied to large-scale three-dimensional inversion of magnetotelluric data, two approaches have been pursued; one is the linear CG inversion in which each step of the Gauss-Newton iteration is incompletely solved using a truncated CG technique, and the other is referred to as the nonlinear CG inversion in which CG is directly applied to the minimization of objective functional for a nonlinear inverse problem. In each procedure we only need to compute the effect of the sensitivity matrix or its transpose multiplying an arbitrary vector, significantly reducing the computational requirements needed to do large-scale inversion.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.3
• /
• pp.55-63
• /
• 2008

This paper presents a panorama background generation and object tracking technique using a Pan-Tilt-Zoom camera. The proposed method estimates local motion vectors rapidly using phase correlation matching at the prespecified multiple local regions, and it makes minimized estimation error by vector quantization. We obtain the required image patches, by estimating the overlapped region using local motion vectors, we can then project the images to cylinder and realign the images to make the panoramic image. The object tracking is performed by extracting object's motion and by separating foreground from input image using background subtraction. The proposed PTZ-based object tracking method can efficiently generated a stable panorama background, which covers up to 360 degree FOV The proposed algorithm is designed for real-time implementation and it can be applied to many commercial applications such as object shape detection and face recognition in various surveillance video systems.

• Journal of Digital Contents Society
• /
• v.16 no.5
• /
• pp.805-813
• /
• 2015

Many researchers expect the compressive sensing and sparse recovery problem can overcome the limitation of conventional digital techniques. However, these new approaches require to solve the l1 norm optimization problems when it comes to signal reconstruction. In the signal reconstruction process, the transform computation by multiplication of a random matrix and a vector consumes considerable computing power. To address this issue, parallel processing is applied to the optimization problems. In particular, due to huge size of original signal, it is hard to store the random matrix directly in memory, which makes one need to design a procedural approach in handling the random matrix. This paper presents a new parallel algorithm to calculate random partial Haar wavelet transform based on Single Instruction Multiple Threads (SIMT) platform.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10A
• /
• pp.784-795
• /
• 2009

An accurate positioning estimation in the wireless sensor networks (WSN) is very important in which each sensor node is aware of neighbor conditions. The multi-hop positioning estimation technique is considered as one of the suitable techniques for the WSN with many low power devices. However geographical holes, where there is no sensor node, may severely decrease the positioning accuracy so that the positioning error can be beyond the tolerable range. Therefore in this paper, we analyze error factors of DV-hop and hole effect to obtain node's accurate position. The proposed methods include boundary node detection, distance level adjustment, and unreliable anchor elimination. The simulation results show that the proposed method can achieve higher positioning accuracy using the hole detection and enhanced distance calculation methods compared with the conventional DV-hop.