• Cartoon and Animation Studies
• /
• s.14
• /
• pp.37-51
• /
• 2008

The computer has become an indispensable tool for animation works. However if you don't understand the characteristics of the computer and its software, you might not have the result satisfying your efforts. The incorrect understanding of image format sometimes causes it. Habitually image formats are selected usually for most of works but there is a distinct difference among those image formats while the efficient usages of them are different from each other. For your more efficient work therefore, you need to identify the characteristics of various kinds of image format used mostly for animation works. First I took a look at the theories of the lossy compression and lossless compression, which are two types of data compression widely used in the whole parts of computer world and the difference between bitmap method and vector method, which are respectably different in terms of the way of expressing images and finally the 24 bit true color and 8 bits alpha channel. Based on those characteristics, I have analyzed the functional difference among image formats used between various types of animation works such as 2D, 3D, composing and editing and also the benefits and weakness of them. Additionally I've proved it is wrong that the JPEG files consume a small space in computer work. In conclusion, I suggest the TIF format as the most efficient format for whatever it is editing, composing, 3D and 2D in considering capacity, function and image quality and also I'd like to recommend PSD format which has compatibility and excellent function, since the Adobe educational programs are used a lot for the school education. I hope this treatise to contribute to your right choice of image format in school education and practical works.

• Journal of Korea Multimedia Society
• /
• v.11 no.10
• /
• pp.1359-1365
• /
• 2008

The portion of header in H.264 gets higher than those of previous standards instead of its better compression efficiency. Therefore, this paper proposes a new technique to compress the header of H.264. Unifying a sentence elementary in H.264, H.264 does not consider the distribution of element which be encoded and uses existing Exp-Golomb method, but it is uneffective for variable length coding. Most of the header are block type(s) and motion vector difference(s), and there are redundancies in the header of H.264. The redundancies in the header of H.264 which are analyzed in this paper are three. There are frequently appearing symbols and non-frequently appearing symbols in block types. And when mode 8 is selected in macroblock, all of four sub-macroblock types are transferred. At last, same values come in motion vector difference, especially '0.' This paper proposes the algorithm using type code and quadtree, and with them presents the redundant information of header in H.264. The type code indicates shape of the macroblock and the quadtree does the tree structured motion compensation. Experimental results show that proposed algorithm achieves lower total number of encoded bits over JM12.4 up to 32.51% bit reduction.

• Journal of Biomedical Engineering Research
• /
• v.25 no.1
• /
• pp.43-47
• /
• 2004

Interests in human brain functionality and its connectivity have much frown up. DTI (Diffusion tensor imaging) has been known as a non-invasive MR) technique capable of providing information on water diffusion in tissues and the organization of white matter tract. Thus. It can provide us the information on the direction of brain fiber tract and the connectivity among many important cortical regions which can not be examined by other anatomical or functional MRI techniques. In this study. was used the 24 bit color coding scheme on the IDL platform in the windows environment to visualize the orientation of major fiber tracts of brain such as main association, projection, commissural fibers and corticospinal tracts. We additionally implemented a color coding scheme for each directional component and FA (fractional anisotropy), and used various color tables for them to be visualized more definitely. Consequently we implemented a fancy and basic technique to visualize the directional information of fiber tracts efficiently and we confirmed the feasibility of the 24 bit color coding scheme in DTI by visualizing main fiber tracts.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.9
• /
• pp.76-84
• /
• 1999

EZW proposed by Shapiro is based on a zerotree constructed in a way that a parent coefficient in a subband is related to four child coefficients in the next finer subband of similar orientation. This fixed treeing based on 1-to-4 parent-child is suitable to exploti hierachical correlations among subbands but not to exploit spatial correlations within a subband. A new treeing by Joo, et al. is suggested to simulatneously exploit those two correlatins by extending parent-child relationship in a flexible way. The flexible treeing leads to increasing the number of symbols and lowering entorpy comparing to the fixed treeing, and therefore a better compression can be resulted. In this paper, we suggest two techniques to suppress the increasing of symbols. First, a probing bit is generated to avoid redundant scan for insignivicant coefficients. Second, since all subbands do not always require the same kind of symbol-set, produced symbols are re-symbolized into binary codes according to a pre-defined procedure. Owing to those techniques, all symbols are generated as binary codes. The binary symbols can be entropy-coded by an adaptive arithmetic coding. Moerover, the binary symbol stream can give comparatively good performances without help of additional entropy coding. Our proposed coding scheme is suggested in two modes: binary coding mode and arithmetic coding mode. We evaluate the effectivenessof our modifications by comparing with the original EZW.

• Journal of Intelligence and Information Systems
• /
• v.12 no.3
• /
• pp.67-82
• /
• 2006

We propose the HBEM(Hybrid Behavior Evolution Model) composed of rule classification and evolutionary neural network using rule descriptor and link descriptor for evolutionary behavior of virtual robots. In our model, two levels of the knowledge of behaviors were represented. In the upper level, the representation was improved using rule and link descriptors together. And then in the lower level, behavior knowledge was represented in form of bit string and learned adapting their chromosomes by the genetic operators. A virtual robot was composed by the learned chromosome which had the best fitness. The composed virtual robot perceives the surrounding situations and they were classifying the pattern through rules and processing the result in neural network and behaving. To evaluate our proposed model, we developed HBES(Hybrid Behavior Evolution System) and adapted the problem of gathering food of the virtual robots. In the results of testing our system, the learning time was fewer than the evolution neural network of the condition which was same. And then, to evaluate the effect improving the fitness by the rules we respectively measured the fitness adapted or not about the chromosomes where the learning was completed. In the results of evaluating, if the rules were not adapted the fitness was lowered. It showed that our proposed model was better in the learning performance and more regular than the evolutionary neural network in the behavior evolution of the virtual robots.

• Journal of Music and Human Behavior
• /
• v.18 no.2
• /
• pp.45-66
• /
• 2021

This study aimed to develop a group rap making program and examine its applicability to improve communication skills of adolescents with mild intellectual disabilities (ID). Three adolescents with ID participated in a total of six 50-minute group sessions over 4 weeks. The group rap making program included three stages: understanding the context of communication, learning how to communicate with others, and applying the communicative behaviors in a group setting. To examine changes in the participants' communication skills, the rap lyrics constructed by participants were analyzed and communicative behaviors were observed during sessions and analyzed in terms of asking questions and providing information to others. Also, a social communication skills checklist was rated by the participant's caregivers. The analysis of rap lyrics showed that the expressions included in the rap were diversified as the session proceeded. Changes in observed behaviors supported that participants became to engage in communication with others more actively in order to complete the group rap. While the social communication skills checklist tended to increase, there was a difference in degree of change depending on the level of language communication skills. These results indicate that a group rap making can be an effective option for these adolescents to learn how to communicate with their peers, which presents implications for how rap making can be used for therapeutic purpose with more diversified population.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.1
• /
• pp.21-32
• /
• 2007

Vuillaume-Okeya presented unsigned receding methods for protecting modular exponentiations against side channel attacks, which are suitable for tamper-resistant implementations of RSA or DSA which does not benefit from cheap inversions. The proposed method was using a signed representation with digits set ${1,2,{\cdots},2^{\omega}-1}$, where 0 is absent. This receding method was designed to be computed only from the right-to-left, i.e., it is necessary to finish the receding and to store the receded string before starting the left-to-right evaluation stage. This paper describes new receding methods for producing SPA-resistant unsigned representations which are scanned from left to right contrary to the previous ones. Our contributions are as follows; (1) SPA-resistant unsigned left-to-right receding with general width-${\omega}$, (2) special case when ${\omega}=1$, i.e., unsigned binary representation using the digit set {1,2}, (3) SPA-resistant unsigned left-to-right Comb receding, (4) extension to unsigned radix-${\gamma}$ left-to-right receding secure against SPA. Hence, these left-to-right methods are suitable for implementing on memory limited devices such as smartcards and sensor nodes

• Journal of Korea Multimedia Society
• /
• v.4 no.3
• /
• pp.247-256
• /
• 2001

Digital watermarking is a copyright protection technique for digital images which embed a code into the digital data so the data is marked. Watermarking techniques previously deal with on-line digital data and have been developed to withstand digital attacks such image processing, compression and geometric transformation. In this paper we propose a novel method of embedding watermarks in printed images. In the proposed algorithm, watermark is embedded in a dithered binary image by comparing the $2\times{2}$ blocks of the counting array is the number of 1 (WHITE) in the $16\times{16}$ blocks of the dithered binary image with predefined reference block pattern, which is generated by watermark values. The proposed algorithm is able to provide more information at a watermark because the proposed algorithm use both '1'and '0' as watermark values. The watermark information is detected by comparing the watermark which is reconstructed from the image which is embedded watermark with the original watermark which is embedded in a binary image. The performance of the proposed algorithm is compared with that of the conventional watermark embedding algorithm for printed images by detecting watermark for scan images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1378-1383
• /
• 1999

In this paper, an effective variable-block-based image compression technique using wavelet transform is proposed. Since the statistical property of each wavelet subband is different, we apply the adaptive quantization to each wavelet subband. In the proposed algorithm, each subband is divided into non-overlapping variable-sized blocks based on directional properties. In addition, we remove wavelet coefficients which are below a certain threshold value for coding efficiency. To compress the transformed data, the proposed algorithm quantizes the wavelet coefficients using scalar quantizer in LL subband and vector quantizers for other subbands to increase compression ratio. The proposed algorithm shows improvements in compression ratio as well as PSNR compared with the existing block-based compression algorithms. In addition, it does not cause any blocking artifacts in very low bit rates even though it is also a block-based method. The proposed algorithm also has advantage in computational complexity over the existing wavelet-based compression algorithms since it is a block-based algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.30-36
• /
• 2016

In this paper, an Rx-ordering aided sphere decoding algorithm for generalized spatial modulation (GSM) systems is proposed. In the proposed sphere decoding algorithm, to efficiently reduce the search region, the received signals are optimally ordered, which results in the reduction of computational complexity. To evaluate the performance and the computational complexity of the proposed Rx-ordered sphere decoding algorithm, the simulations are performed. In the simulation results, it is observed that in GSM systems, the proposed decoding algorithm achieves the same error performance with the conventional SD, whereas it efficiently decreases the computational complexity for symbol detection.