• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.144-146
• /
• 2006

The Data Matrix of two-dimensional bar codes is a new technology capable of holding relatively large amounts of data compared to the conventional one-dimensional bar code which is just a key that can access detailed information to the host computer database. A secret key is used to prevent a watermark from malicious attacks. We encoded copyright information into a Data Matrix bar code for encoding process and it was spread a pseudo random pattern using owner key. We embedded a randomized watermark into the image using watermark's embedding position, pattern generated with a secret key. The experimental results have shown that the proposed scheme has good quality and is very robust to various attacks, such as JPEG compression and noise. Also the performance of the proposed scheme is verified by comparing the copyright information with the information which is extracted from a bar code scantier.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.473-476
• /
• 2004

Low-Density Parity-Check (LDPC) codes are recently emerged due to its excellent performance to use. However, the parity check matrices (H) of the previous works are not adequate for hardware implementation of encoders or decoders. This paper proposes a hybrid parity check matrix for partially parallel decoder structures, which is efficient in hardware implementation of both decoders and encoders. Using proposed methods, the encoding design can become practical while keeping the hardware complexity of partially parallel decoder structures.

• Journal of the Korea Convergence Society
• /
• v.4 no.3
• /
• pp.27-33
• /
• 2013

Conventional bar code has the appearance of line bars and spaces, called as one-dimensional bar code. In contrast, the information in two-dimensional bar code is represented by either a small, rectangular or square with the types of mosaic and Braille. The two-dimensional bar code is much more efficient than one-dimensional bar code because it can allow to store and express large amounts of data in a small space and so far there is also a little information about decoding the Data Matrix in base 256 mode. According to the ISO international standards, there are four kinds of bar code: QR code, Data Matrix, PDF417, and Maxi code. In this paper, among them, we focus on describing the basic concepts of Data Matrix in base 256 mode, how to encode and decode them, and how to organize them in detail. In addition, Data Matrix can be organized efficiently depending on the modes of numeric, alphanumeric characters, and binary system and expecially, we focus on describing how to decode the Data Matrix code by four modes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.56-67
• /
• 2013

Because H.264/SVC can meet the needs of different networks and user terminals, it has become more and more popular. In this paper, we focus on the spatial resolution scalability of H.264/SVC and propose a blind video watermarking algorithm for the copyright protection of H.264/SVC coded video. The watermark embedding occurs before the H.264/SVC encoding, and only the original enhancement layer sequence is watermarked. However, because the watermark is embedded into the average matrix of each macro block, it can be detected in both the enhancement layer and base layer after downsampling, video encoding, and video decoding. The proposed algorithm is examined using JSVM, and experiment results show that is robust to H.264/SVC coding and has little influence on video quality.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.8
• /
• pp.790-797
• /
• 2007

This paper proposes a new measure of cost function ruggedness in local optimization with DEAS. DEAS is a computational optimization method developed since 2002 and has been applied to various engineering fields with success. Since DEAS is a recent optimization method which is rarely introduced in Korean, this paper first provides a brief overview and description of DEAS. In minimizing cost function with this non-gradient method, information on function shape measured automatically will enhance search capability. Considering the search strategies of DEAS are well designed with binary matrix structures, analysis of search behaviors will produce beneficial shape information. This paper deals with a simple quadratic function contained with various magnitudes of noise, and DEAS finds local minimum yielding ruggedness measure of given cost function. The proposed shape information will be directly used in improving DEAS performance in future work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1C
• /
• pp.14-19
• /
• 2006

The high encoding complexity of LDPC codes can be solved by designing structured parity-check matrix. If the parity-check matrix of LDPC codes is composed of same type of blocks, decoder implementation can be simple, this structure allow structured decoding and required memory for storing the parity-check matrix can be reduced largely. In this parer, we propose a construction algorithm for short block length structured LDPC codes based on girth condition, PEG algorithm and variable node connectivity. The code designed by this algorithm shows similar performance to other codes without structured constraint in low SNR and better performance in high SNR than those by simulation

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11C
• /
• pp.901-906
• /
• 2010

Low density parity check (LDPC) code, first introduced by Gallager and re-discovered by MacKay et al, has attracted researcher's interest mainly due to their performance and low decoding complexity. It was remarkable that the performance is very close to Shannon capacity limit under the assumption of having long codeword length and iterative decoder. However, comparing to turbo codes widely used in the current mobile communication, the encoding complexity of LDPC codes has been regarded as the drawback. This paper proposes a solution for DVB-S2 LDPC encoder to reduce the encoder latency. We use the fast IRA encoder that use the transformation of the parity check matrix into block-wise form and the partial parallel process to reduce the number of system clocks for the IRA code encoding. We compare the proposed encoder with the current DVB-S2 encoder to show that the performance of proposal is better than that of the current DVB-S2 encoder.

• YAKHAK HOEJI
• /
• v.48 no.3
• /
• pp.189-196
• /
• 2004

Matrix metalloproteinases (MMPs) and tissue inhibitors of MMPs (TIMPs) playa key role in tumor invasion and metastasis. As an inhibitor of MMP-2, TIMP-2 is known to block both the invasive and metastatic behavior of cancer cells, and decrease tumor growth activity. We performed this study to investigate the effects of TIMP-2 over-expression induced by retroviral mediated gene transfer in vitro and in vivo. The human colon cancer cell line SW480 was transfected with the retroviral vector encoding TIMP-2. The effects of TIMP-2 over-expression were analyzed by invasion assay and gelatinase activity test in colon cancer cells and tumorigencity in nude mice. In evaluation of the transfection efficiency of the retroviral vector encoding TIMP-2 in colon cancer cells, we confirmed up-regulation of TIMP-2 expression dependent on the time of cell culture. In addition, inhibition of MMP-2 expression in SW480/TIMP-2 was shown by gelatin zymography. In the in vitro invasion assay SW480/TIMP-2 inhibited the invasiveness on matrigel coated with collagen. To determine whether TIMP-2 can modulate in vivo tumorigenicity and metastasis, SW480/TIMP-2 cells were injected subcutaneously in nude mice. The tumor mass formation of SW480/TIMP-2 cells in nude mice was markedly decreased compared to nontransfected cancer cells. These results showed that colon cancer cells transfected with the retroviral vector encoding TIMP-2 inhibits the invasiveness in vitro and tumorigenicity in vivo.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.619-627
• /
• 2015

This paper presents a speech enhancement method using non-negative matrix factorization (NMF). In the training phase, each basis matrix of source signal is obtained from a proper database, and these basis matrices are utilized for the source separation. In this case, the performance of speech enhancement relies heavily on the basis matrix. The proposed method for which speech basis matrix is made a high reconstruction error for noise signal shows a better performance than the standard NMF which basis matrix is trained independently. For comparison, we propose another method, and evaluate one of previous method. In the experiment result, the performance is evaluated by perceptual evaluation speech quality and signal to distortion ratio, and the proposed method outperformed the other methods.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.153-156
• /
• 2001

Fuzzy controllers also show good performance In case of the systems being nonlinear and difficult to solve. But these fuzzy controllers have problems which have to decide suitable rules and membership functions. In general we decide those using the heuristic methods or the experience of experts. Therefore, many researchers have applied genetic algorithms to make fuzzy rule automatically. In this paper, we suggest a new coding method and a new crossover method to maintain the good fuzzy rule base and the shape of membership