• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.2
• /
• pp.15-22
• /
• 1980

For efficient coding of graphic image data, the statistical characteristics for both Korean lettered images and English lettered images are measurpd and co mpared. Also, the measured run length distribution is compared with the run length distribution hased on Markov model. It is shown that the measured white run length distribution is more Bike a negative - power distribution than an exponential distribution . This fact is stronger in the Korean lettered images than is the English lettered images, The performances of four typical run length codes are compared for the same set of graphic data files,, and it is shown that the codes perform better in the Korean ]entered images :hart In Eng]isle lettered images.

• IE interfaces
• /
• v.15 no.1
• /
• pp.20-25
• /
• 2002

In this research, a nameplate engraving system for images and texts downloaded through Internet on nameplate is developed. The system consists of two subsystems: thinning algorithm and NC code generation module. In the thinning algorithm, the concept of connectivity is used and center lines of images and texts, which will be used as NC tool paths, can be obtained successfully. Because the center lines are composed of a lot of pixels, NC code would be too long. In the NC code generation module, many useless pixel data are removed and linear interpolation algorithm is applied to only the remaining pixels. By performing actual experiments, the thinning algorithm and the NC code generation module are verified.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.458-461
• /
• 2000

Variable length codes are often used in entropy coding, but are very vulnerable in noisy environments. Reversible variable length codes, however, muse possible to decode instantaneously in both forward and backward directions, so that more usable data can be retrieved when bit errors occur via transmission. Furthermore, partial decodability is desirable to introduce in the reversible variable length code because ROI (Region Of Interest) decoding function is sometimes required in recent image information systems such as the medical imaging, the digital museum and so on. In this paper, we propose a partially decodable and reversible variable length code by modifying Golomb-Rice code.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1105-1108
• /
• 1999

In this paper, we propose a new addressing mode, which can be used for programmable image processor to perform image- processing algorithms effectively. Conventional addressing modes are suitable for one-dimensional data processing such as voice, but the proposed addressing mode consider two-dimensional characteristics of image data. The proposed instruction for two-dimensional addressing requires two operands to specify a pixel and doesn't require any change of memory architecture. Combining several instructions to load a pixel-data from an external memory to a register, the proposed instruction reduces code size so that satisfy hish performance and low power requirements of image processor. In addition, it uses inherent two-dimensional characteristics of image data and offers user-friendly instruction to assembler programmer.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1375-1378
• /
• 1987

In this paper, an efficient data compression algorithm for binary image is proposed. This algorithm makes use of the fact that boundaries contain all the information about such images. The compression efficiency is then further increased by efficient coding of Boundary Information Matrix. The comparison of performance with modified Huffman coding was made by a computer simulation with some images. The results of simulation showed that the proposed algorithm was more efficient than modified Huffman code.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.4
• /
• pp.569-574
• /
• 2017

In order to transmit information in a channel environment in which noise exists, a coding technique of information is required. One of the coding techniques used for error detection and correction close to the Shannon limit is Low Density Parity Code(LDPC). LDPC and decoding characteristic features by Sum-product algorithm are matched for the performance to Turbo Code, RA(Repeat Accumulate) code, in case of very long code length of LDPC surpass their performance. This paper explains LDPC coding scheme of image data and decoding scheme, implements LDPC decoder in FPGA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10C
• /
• pp.798-804
• /
• 2008

This paper proposes a low-power circuit for detecting and correcting L2 cache errors during microprocessor data image processing. A simplescalar-ARM is used to analyze input and output data by accessing the microprocessor's L2 cache during image processing in terms of the data input and output frequency as well as the variation of each bit for 32-bit processing. The circuit is implemented based on an H-matrix capable of achieving low power consumption by extracting bits with small and large amounts of variation and allocating bits with similarities in variation. Simulation is performed using H-spice to compare power consumption of the proposed circuit to the odd-weight-column code used in a conventional microprocessor. The experimental results indicated that the proposed circuit reduced power consumption by 17% compared to the odd-weight-column code.

• Computers and Concrete
• /
• v.24 no.6
• /
• pp.561-570
• /
• 2019

Understanding the realistic behavior of concrete up to failure under different loading conditions within the framework of damage mechanics and plasticity would lead to an enhanced design of concrete structures. In the present investigation, QR (Quick Response) code based random speckle pattern is used as a non-contact sensor, which is an innovative approach in the field of digital image correlation (DIC). A four-point bending test was performed on RC beams of size 1800 mm × 150 mm × 200 mm. Image processing was done using an open source Ncorr algorithm for the results obtained using random speckle pattern and QR code based random speckle pattern. Load-deflection curves of RC beams were plotted for the results obtained using both contact and non-contact (DIC) sensors, and further, Moment (M)-Curvature (κ) relationship of RC beams was developed. The loading curves obtained were used as input data for material model parameters in finite element analysis. In finite element method (FEM) based software, concrete damage plasticity (CDP) constitutive model is used to predict the realistic nonlinear quasi-static flexural behavior of RC beams for monotonic loading condition. The results obtained using QR code based DIC are observed to be on par with conventional results and FEM results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.3
• /
• pp.307-316
• /
• 2016

Reversible data hiding is a technique to hide any data without affecting the original image. Zhang proposed the encryption of original image and a data hiding scheme in encrypted image. First, the encrypted image is decrypted and uses the fluctuation function which exploits the spatial correlation property of decrypted image to extract hidden data. In this paper, the new fluctuation function is proposed to reduce errors which arise from the process extracting hidden data and the performance is verified by simulation.

• 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.