• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.17-31
• /
• 2002

The new MPEG-4 video coding standard enables content-based functionalities. Image segmentation is an indispensable process for it. This paper addresses an effective segmentation of non-rigid objects. Non-rigid objects are deformable objects with fuzzy, blurred and indefinite boundaries. So it is difficult to segment deformable objects precisely. In order to solve this problem, we propose an effective segmentation of non-rigid objects using watershed algorithms in still pictures. And we propose an automatic segmentation through intra-frame and inter-frame segmentation process in video sequences. Automatic segmentation preforms boundary-based and region-based segmentation to extract precise object boundaries.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.3
• /
• pp.233-238
• /
• 2014

Creativity is crucial in designing and producing attractive accessaries and daily supplies as well as art works. Generative design can be a paradigm to be used to obtain novel ideas or motifs for creative design works. This paper introduces a generative design method which comes up with unique ring models using genetic algorithm. It presents how the genetic algorithm works in terms of candidate solution coding, operators, and fitness evaluation function. The proposed method allows the customers to express their personal preference and later the preference to be reflected in fitness evaluation. In the final stage of the proposed method, several ring models are suggested for customers to choose on their own. The chosen ring models can be put into physical rings with the help of a 3D printer because the models are expressed in 3D geometric structures.

• Journal of Korean Academy of Nursing
• /
• v.37 no.3
• /
• pp.391-400
• /
• 2007

Purpose: The purpose of this study was to identify the nursing images appearing in elementary school textbooks. Method: This study targeted 130 textbooks of 13 subjects under the 7th national curriculum for elementary schools as of December 2005. Nursing-related texts, photographs, and illustrations in the textbooks were analyzed by using a content analysis method. As for the textbook analysis, two coders thoroughly read the textbooks to record nursing-related content per coding paper, respectively. Result: The total number of nursing-related content appearing in 130 textbooks of 13 subjects was 70. More nursing-related content was exhibited in the photograph and illustration domain(N=57, 81.4%) than in the text domain(N=13, 18.6%). Nursing-related content(N=70) appeared in the order of nursing activities with 56(80.0%), nursing as a job with 10(14.3%), and others with 4(5.7%). As for the nursing image of nursing-related content, positive images weremost with 30(42.9%), followed by negative images with 21(30.0%), and neutral images with 19(27.1%). Conclusion: Nursing-related content was dealt with too little, and dependent nursing activities such as medication, and assisting roles for doctor's examinations and treatments mainly appeared. Also, the main activity place was a hospital. To introduce proper and adequate nursing activities to the students, various types of nursing-related data and material should be distributed to front line schools, teachers, main authors, and publishing companies.

• Journal of Broadcast Engineering
• /
• v.21 no.2
• /
• pp.180-191
• /
• 2016

When up-scaling algorithms for visible light images are applied to infrared (IR) images, they rarely work because IR images are usually blurred. In order to solve such a problem, this paper proposes an up-scaling algorithm for IR images. We employ adaptive dynamic range encoding (ADRC) as a simple classifier based on the observation that IR images have weak details. Also, since human visual systems are more sensitive to edges, our algorithm focuses on edges. Then, we add pre-processing in learning phase. As a result, we can improve visibility of IR images without increasing computational cost. Comparing with Anchored neighborhood regression (A+), the proposed algorithm provides better results. In terms of just noticeable blur, the proposed algorithm shows higher values by 0.0201 than the A+, respectively.

• Journal of Broadcast Engineering
• /
• v.12 no.3
• /
• pp.278-288
• /
• 2007

We propose the fast full search algorithm that reduces the computational load of the block matching algorithm which is used for a motion estimation in the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion picture. However we proposed the efficient motion estimation method which is good for the fast and slow motion picture. Firstly, when finding the initial threshold value, we use the expanded predictor that can approximately calculate minimum threshold value. The proposed algorithm estimates the motion in the new search order after partitioning the search window and adapt the directional search order in the re-divided search window. At the result, we can check that the proposed algorithm reduces the computational load 94% in average compared to the conventional spiral full search algorithm without any loss of image quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.1100-1112
• /
• 1998

In this paper, a novel method of minimizing the phase error is proposed. A DP-PLL system using this method is implemented and its performacnce is investigated, too. The DP-PLL system detects the phase error between reference clock and locally generated system clock. The phase difference is then reported as a PEV(Phase Error Variation), which is propoced from the delayted n-tap rising dege clock circuit with 5ns resolution in the phase detector. The algorithm is used to track the optimal DAC coefficients, which are adjusted from sample to sample in such a way as to minimize the PEV. The proposed method is found to have remarkable good potential for fast and accurate phase error tracking characteristic. The algorithm shows good performance to supress the low frequency jitter.-ending points, we design new basis functions based on the Legendre polynomial and then transform the error signals with them. When applied to synthetic images such as circles, ellipses and etc., the proposed method provides, in overall, outstanding results in respect to the transform coding gain compared with DCT and DST. And in the case when applied to natural images, the proposed method gives better image quality over DCT and comparable results with DST.

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

In an H.264/AVC video encoder, the motion estimation at fractional pixel accuracy improves a coding efficiency and image quality. However, it requires additional computation overheads for fractional search and interpolation, and thus, reducing the computation complexity of fractional search becomes more important. This paper proposes a Pixel Re-composition Fractional Motion Estimation (PRFME) algorithm for an H.264/AVC video encoder. Fractional Motion Estimation performs interpolation for the overlapped pixels which increases the computational complexity. PRFME can reduce the computational complexity by eliminating the overlapped pixel interpolation. Compared with the fast full search, the proposed algorithm can reduce 18.1% of computational complexity, meanwhile, the maximum PSNR degradation is less than 0.067dB. Therefore, the proposed PRFME algorithm is quite suitable for mobile applications requiring low power and complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.505-513
• /
• 2004

Most video codecs including the international standards use the block-based hybrid structure for efficient compression. But for low bit-rate applications such as video transmission through wireless channels, the blocking artifacts degrade image qualify seriously. In this paper, we propose an adaptive de-blocking algorithm using characteristics of the block boundaries. Blocking artifacts contain the high frequency components near the block boundaries, therefore the lowpass filtering can remove them. However, simple lowpass filtering results into blurring by removing important information such as edges. To overcome this problem, we determine the modes depending upon the characteristics of pixels adjacent to block boundary then proper filter is applied to each area. Simulation results show that proposed method improves de-blocking performance compared to that of MPEG-4.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.27-32
• /
• 2005

An effective video watermarking algorithm is proposed to protect the copyright. The watermarking procedure is based on a three-dimensional discrete wavelet transform (3D DWT) and spread spectrum sequences. Two perceptual binary watermarks are preprocessed using mixing and pseudorandom permutation. After dividing the video sequence into video shots, the 3D DWT is performed, then the preprocessed watermarks are embedded into the 3D DWT coefficients, while considering robustness and invisibility, using two spread spectrum sequences defined as the user key. Experimental results show that the watermarked frames are subjectively indistinguishable from the original frames, plus the proposed video watermarking algorithm is sufficiently robust against such attacks as low pass filtering, frame dropping, frame average, and MPEG coding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1669-1676
• /
• 2004

In H.264, 7 modes {16${\times}$16, 16${\times}$8, 8${\times}$16, 8${\times}$8, 8${\times}$4, 4${\times}$8, 4${\times}$4) are used to enhance the coding efficiency. The motion vector estimation with 7 modes may require huge computing time. In this paper, to speed up the motion vector estimation procedure while the high image quality remains, we propose a motion vector refinement scheme using the temporary motion vector generated with little computation. The proposed estimation process consists of three phases: Mode decision for a 16${\times}$16 macroblock, Composing a temporary motion vector, Refinement of the temporary motion vector. We demonstrate the effectiveness of the proposed method by computer simulation. In the results, the encoding time consumed by the proposed scheme has been reduced significantly while the encoded video quality remains unchanged.