• 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 the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.88-98
• /
• 2011

Recently, according as the importance of GIS(geography information system) database security is embossed, much researches had been achieved about GIS network security. But most such researches are weak against sourceful illegal reproductions and distributions of GIS vector data map. In this paper, we proposed an efficient layer unit contents based partial encryption technique in the vector map compression domain to prevent illegal distributions and unauthorized accesses. This method achieves a partial encryption about each central coordinate and directional parameters of a MCA(minimum coding attribute) that is created at the vector map compression processing in the vector space. First, the position encryption is applied as permutating randomly the center coordinate of each record that is minimum unit of vector map shape. And second, the direction encryption that changing shapes of vector map topography is applied as encrypting the direction of vertices's coordinates of each record. In experimental results, we confirmed that our proposed method can encipher the large volumed vector map data effectively in low computational complexity. Also, we could minimize the decline of compression efficiency that occurred by conventional contents based encryption schemes using AES or DES algorithms.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.411-417
• /
• 2006

Motion Estimation (ME) is an important part of video coding process and it takes the largest amount of computation in video compression. Half-pixel and quarter-pixel motion estimation can improve the video compression rate at the cost of higher computational complexity In this paper, we suggest a new efficient low-complexity algorithm for half-pixel and quarter pixel motion estimation. It is based on the experimental results that the sum of absolute differences(SAD) shows parabolic shape and thus can be approximated by using interpolation techniques. The sub-pixel motion vector is searched from the minimum SAD integer-pixel motion vector. The sub-pixel search direction is determined toward the neighboring pixel with the lowest SAD among 8 neighbors. Experimental results show that more than 20% reduction in computation time can be achieved without affecting the quality of video.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.2
• /
• pp.78-84
• /
• 2009

In general video coding systems, motion estimation (ME) is regarded as a vital component in a video coder as it consumes a large amount of computation resources. Fractional pixel motion estimation can improve the video compression rate at the cost of higher computational complexity. It is based on the experimental results that the sum of absolute differences (SAD) shows parabolic shape and thus can be approximated by using interpolation technique. In this paper, we propose a fast fractional pixel search algorithm by combining SASR (Simplified Adaptive Search Range) and the CBCDS (Center Biased Cross-Diamond Search) pattern with the predicted motion vector. Compare with the fractional pel full search and the CBFPS, the proposed CBCDS algorithms can reduce fractional pel search points up to 81.4%, respectively with the PSNR lost about 0.05dB.

• BMB Reports
• /
• v.41 no.9
• /
• pp.651-656
• /
• 2008

A mouse with cataract, Kec, was generated from N-ethyl-N-nitrosourea (ENU) mutagenesis. Cataract in the Kec mouse was observable at about 5 weeks after birth and this gradually progressed to become completely opaque by 12 weeks. Dissection microscopy revealed that vacuoles with a radial or irregular shape were located primarily in the cortex of the posterior and equatorial regions of the lens. At the late stage, the lens structure was distorted, but not ruptured. This cataract phenotype was inherited in an autosomal recessive manner. We performed a genetic linkage analysis using 133 mutant and 67 normal mice produced by mating Kec mutant (BALB/c) and F1 (C57BL/6 $\times$ Kec) mice. The Kec locus was mapped to the 3 cM region encompassed by D14Mit34 and D14Mit69. In addition we excluded coding sequences of 9 genes including Rcbtb2, P2ry5, Itm2b, Med4, Nudt15, Esd, Lcp1, Slc25a30, and 2810032E02Rik as the candidate gene that causes cataract in the Kec mouse.

• Journal of Biomedical Engineering Research
• /
• v.29 no.3
• /
• pp.212-221
• /
• 2008

The total hip replacement (THR) has been used as the most effective way to restore the function of damaged hip joint. However, various factors have caused some side effects after the THR. Unfortunately, the success of the THR have been decided only by the proficiency of surgeons so far. Hence, It is necessary to find the way to minimize the side effect caused by those factors. The purpose of this study was to suggest the definite data, which can be used to design and choose the optimal hip implant. Using finite element analysis (FEA), the biomechanical condition of bone cement was evaluated. Stress patterns were analyzed in three conditions: cement mantle, procimal femur and stem-cement contact surface. Additionally, micro-motion was analyzed in the stem-cement contact surface. The 3-D femur model was reconstructed from 2-D computerized tomography (CT) images. Raw CT images were preprocessed by image processing technique (i.e. edge detection). In this study, automated edge detection system was created by MATLAB coding for effective and rapid image processing. The 3-D femur model was reconstructed based on anatomical parameters. The stem shape was designed using that parameters. The analysis of the finite element models was performed with the variation of parameters. The biomechanical influence of each parameter was analyzed and derived optimal parameters. Moreover, the results of FE A using commercial stem model (Zimmer's V erSys) were similar to the results of stem model that was used in this study. Through the study, the improved designs and optimal factors for clinical application were suggested. We expect that the results can suggest solutions to minimize various side effects.

• Korean journal of applied entomology
• /
• v.36 no.1
• /
• pp.30-36
• /
• 1997

Except for a cosmopolitan and major pest of apples, Tetranychus urticae Koch, Tetranychus mites in Korea such as T. viennensis Zaher, T. kanzawai Kishida, and T. truncams Ehara have been considered as quarantine pests by Canada and United States. Even though these mites are not feeders on apples, they are suspected to attach accidentally on apple h i t s in autumn as females enter the diapause. The characters used to identify Tetranychus mites have been confined to the shape of aedeagus in adult male. To develope a fast and accurate alternative identification protocol applied to hibernating female mites on apples, their mitochondrial DNA (mtDNA) were examined to find out any polymorphisms to discriminate each species from the other ones. Three pairs of primers for polymerase chain reaction (PCR) were used to amplify cytochrome oxidase subunit I (CO-I) coding region in mitochondrial DNA5 of four species of Tetranycus mites. The longest amplified product was estimated its size as about 680 bp. Digestion with restriction enzymes, AluI, Ddel, and Sau3A, showed length polymorphisms, which will he useful as diagnostic markers to identify Tetranychus mites. Schematic restriction maps in amplified region were shown for each species.

• International Journal of Industrial Entomology and Biomaterials
• /
• v.17 no.1
• /
• pp.125-129
• /
• 2008

The purpose of this study was to investigate the characteristics of Mamestra brassicae nucleopolyhedrovirus (MabrNPV)-K1 isolated in Korea. Polyhedra of MabrNPV-K1 showed irregular appearance in shape with the average diameter $1.8{\mu}m$. MabrNPV-K1 contained a number of nucleocapsids within a viral envelope embedded in polyhedron. The polyhedrin of MabrNPV-K1 was composed of single polypeptide with a M.W. of approximate 31 kDa which is identical to the commercialized MabrNPV, Mamestrin, as a biological control agent. The nucleotide and amino acid sequences within the coding region of MabrNPV-K1 polyhedrin shared 99.0% similarity with the polyhedrin gene from previous reported MabrNPVs. The median lethal concentrations ($LC_{50}$) of MabrNPV-K1 and Mamestrin to M. brassicae larvae were $3.9{\times}10^3$ PIBs/larva and $6.0{\times}10^4$ PIBs/larva, respectively. Mortality of the MabrNPV-K1 against to the third instars larvae was 15 times higher than that of the Mamestrin. The median lethal times ($LT_{50})$ of MabrNPV-K1 by the concentration of polyhedra were lower ($4.4{\sim}6.1$ days) than those of Mamestrin ($4.1{\sim}8.6$ days). These results suggest that a local strain MabrNPV-K1 has high pathogenicity to M. brassicae and may be useful for the development of biological control agent to control this.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.23-35
• /
• 2013

This paper proposes an effective technique that is used to automatically extract feature vectors from vibration signals for fault classification systems. Conventional mel-frequency cepstral coefficients (MFCCs) are sensitive to noise of vibration signals, degrading classification accuracy. To solve this problem, this paper proposes spectral envelope cepstral coefficients (SECC) analysis, where a 4-step filter bank based on spectral envelopes of vibration signals is used: (1) a linear predictive coding (LPC) algorithm is used to specify spectral envelopes of all faulty vibration signals, (2) all envelopes are averaged to get general spectral shape, (3) a gradient descent method is used to find extremes of the average envelope and its frequencies, (4) a non-overlapped filter is used to have centers calculated from distances between valley frequencies of the envelope. This 4-step filter bank is then used in cepstral coefficients computation to extract feature vectors. Finally, a multi-layer support vector machine (MLSVM) with various sigma values uses these special parameters to identify faulty types of induction motors. Experimental results indicate that the proposed extraction method outperforms other feature extraction algorithms, yielding more than about 99.65% of classification accuracy.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.4
• /
• pp.562-567
• /
• 2009

As a key mechanism of the human emotion interaction, Facial Expression is a powerful tools in HRI(Human Robot Interface) such as Human Computer Interface. By using a facial expression, we can bring out various reaction correspond to emotional state of user in HCI(Human Computer Interaction). Also it can infer that suitable services to supply user from service agents such as intelligent robot. In this article, We addresses the issue of expressive face modeling using an advanced active appearance model for facial emotion recognition. We consider the six universal emotional categories that are defined by Ekman. In human face, emotions are most widely represented with eyes and mouth expression. If we want to recognize the human's emotion from this facial image, we need to extract feature points such as Action Unit(AU) of Ekman. Active Appearance Model (AAM) is one of the commonly used methods for facial feature extraction and it can be applied to construct AU. Regarding the traditional AAM depends on the setting of the initial parameters of the model and this paper introduces a facial emotion recognizing method based on which is combined Advanced AAM with Bayesian Network. Firstly, we obtain the reconstructive parameters of the new gray-scale image by sample-based learning and use them to reconstruct the shape and texture of the new image and calculate the initial parameters of the AAM by the reconstructed facial model. Then reduce the distance error between the model and the target contour by adjusting the parameters of the model. Finally get the model which is matched with the facial feature outline after several iterations and use them to recognize the facial emotion by using Bayesian Network.