• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.6
• /
• pp.3021-3023
• /
• 2016

The significance, difficulty and strategy of coding cancer data according to international coding standards are discussed, and the concept, methods and realization of cancer data automatic coding in cancer registries in China are introduced in the paper. Coding cancer data automatically with software could not only reduce the time, manpower and workload, while improving the accuracy and efficiency of cancer data coding, but also enhance the validity of cancer registration and the value of cancer registry data, which is of great significance.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.2
• /
• pp.1-10
• /
• 1975

This paper presents an adaptive data compression algorithm for video data. The coling complexity due to the high correlation in the given data sequence is alleviated by coding the difference data, sequence rather than the data sequence itself. The adaptation to the nonstationary statistics of the data is confined within a code set, which consists of two constant length cades and six modified Shannon.Fano codes. lt is assumed that the probability distributions of tile difference data sequence and of the data entropy are Laplacian and Gaussion, respectively. The adaptive coding performance is compared for two code selection criteria: entropy and $P_r$[difference value=0]=$P_0$. It is shown that data compression ratio 2 : 1 is achievable with the adaptive coding. The gain by the adaptive coding over the fixed coding is shown to be about 10% in compression ratio and 15% in code efficiency. In addition, $P_0$ is found to he not only a convenient criterion for code selection, but also such efficient a parameter as to perform almost like entropy.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.6
• /
• pp.154-159
• /
• 2003

In this paper, we proposed variable threshold dual rate ADPCM coding method which adapts two coding rates of the standard ADPCM of ITU G.726 for speech quality improvement at a comparably low coding rates. The ZCR(Zero Crossing Rate) is computed for speecd data and under the noisy environment, noise data dominant region showed higher ZCR and speech data dominant region showed lower ZCR. The speech data with the higher ZCR is encoded by low coding rate for reduced coded data and the speech data with the lower ZCR is encoded by high coding rate for speech quality improvements. For coded data, 2 bits are assigned for low coding rate of 16[Kbps] and 5 bits are is assigned for high coding rate of 40[Kbps]. Through the simulation, the proposed idea is evaluated and shown that the variable dual rate ADPCM coding technique shows the qood speech quality at low coding rate.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.3
• /
• pp.30-36
• /
• 2012

block truncation coding(BTC) image compression is known as a simple and efficient technology for image compression algorithm. In this paper, we propose RMC-BTC algorithm(RMC : reduction method chrominace data) for color image compression. To compress chrominace data, in every BTC block, the RMC-BTC coding employs chrominace data expressed with average of chrominace data and using method of luminance data bit-map to represented chrominance data bit-map. Experimental results shows efficiency of proposed algorithm, as compared with PSNR and compression ratio of the conventional BTC method.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.493-501
• /
• 2016

In-network storage is an effective technique for avoiding network congestion and reducing power consumption in continuous data collection in wireless sensor networks. In recent years, network coding based storage design has been proposed as a means to achieving ubiquitous access that permits any query to be satisfied by a few random (nearby) storage nodes. To maintain data consistency in continuous data collection applications, the readings of a sensor over time must be sent to the same set of storage nodes. In this paper, we present an efficient approach to updating data at storage nodes to maintain data consistency at the storage nodes without decoding out the old data and re-encoding with new data. We studied a transmission strategy that identifies a set of storage nodes for each source sensor that minimizes the transmission cost and achieves ubiquitous access by transmitting sparsely using the sparse matrix theory. We demonstrate that the problem of minimizing the cost of transmission with coding is NP-hard. We present an approximation algorithm based on regarding every storage node with memory size B as B tiny nodes that can store only one packet. We analyzed the approximation ratio of the proposed approximation solution, and compared the performance of the proposed coding approach with other coding schemes presented in the literature. The simulation results confirm that significant performance improvement can be achieved with the proposed transmission strategy.

• ETRI Journal
• /
• v.26 no.2
• /
• pp.122-135
• /
• 2004

Although frame-based MPEG-4 video services have been successfully deployed since 2000, MPEG-4 video coding is now facing great competition in becoming a dominant player in the market. Object-based coding is one of the key functionalities of MPEG-4 video coding. Real-time object-based video encoding is also important for multimedia broadcasting for the near future. Object-based video services using MPEG-4 have not yet made a successful debut due to several reasons. One of the critical problems is the coding complexity of object-based video coding over frame-based video coding. Since a video object is described with an arbitrary shape, the bitstream contains not only motion and texture data but also shape data. This has introduced additional complexity to the decoder side as well as to the encoder side. In this paper, we have analyzed the current MPEG-4 video encoding tools and proposed efficient coding technologies that reduce the complexity of the encoder. Using the proposed coding schemes, we have obtained a 56 percent reduction in shape-coding complexity over the MPEG-4 video reference software (Microsoft version, 2000 edition).

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.114-117
• /
• 2004

This paper proposes a novel algorithm for hybrid lossless audio coding, which employs integer discrete cosine transform. The proposed algorithm divides the input signal into frames of a proper length, decorrelates the framed data using the integer DCT and finally entropy-codes the frame data. In particular, the adaptive Golomb-Rice coding method used for the entropy coding selects an optimal option which gives the best compression efficiency. Since the proposed algorithm uses integer operations, it significantly improves the computation speed in comparison with an algorithm using real or floating-point operations. When the coding algorithm is implemented in hardware, the system complexity as well as the power consumption is remarkably reduced. Finally, because each frame is independently coded and is byte-aligned with respect to the frame header, it is convenient to move, search, and edit the coded data.

• Journal of Multimedia Information System
• /
• v.5 no.3
• /
• pp.201-208
• /
• 2018

High Efficiency Video Coding range extensions (HEVC RExt) is a kind of extension model of HEVC. HEVC RExt was specially designed for dealing the high quality images. HEVC RExt is very essential for studio editing which handle the very high quality and various type of images. There are some problems to dealing these massive data in studio editing. One of the most important procedure is re-encoding and decoding procedure during the editing. Various codecs are widely used for studio data editing. But most of the codecs have common problems to dealing the massive data in studio editing. First, the re-encoding and decoding processes are frequently occurred during the studio data editing and it brings enormous time-consuming and video quality loss. This paper, we suggest new video coding structure for the efficient studio video editing. The coding structure which is called "ultra-low delay (ULD)". It has the very simple and low-delayed referencing structure. To simplify the referencing structure, we can minimize the number of the frames which need decoding and re-encoding process. It also prevents the quality degradation caused by the frequent re-encoding. Various fast coding algorithms are also proposed for efficient editing such as tool-level optimization, multi-serve based distributed coding and SIMD (Single instruction, multiple data) based parallel processing. It can reduce the enormous computational complexity during the editing procedure. The proposed method shows 9500 times faster coding speed with negligible loss of quality. The proposed method also shows better coding gain compare to "intra only" structure. We can confirm that the proposed method can solve the existing problems of the studio video editing efficiently.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.5-8
• /
• 2000

In this paper, we present a new cぉnet coding method, so called MLC (Multi-Level Codes), for error detection and correction in digital wireless communication. MLC coding method we the same coding procedure wed in the convolutional coding but it is distinguished from the existing convolutional coding in point of generating the code word by using multi-level information data (M-ary signal) and in point of speed of coding procedure Through computer simulation, we analyze the performance of the coding method suggested here compared to convolutional coding method in case of modulo-operation and in case of non-binary coding Procedure respectively under various channel environments.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.275-278
• /
• 2003

Terrestrial DMB(Digital Multimedia Broadcasting) system is the standard that offers multimedia broadcasting services at mobile environment and is based on Eureka-147 DAB(Digital Audio Broadcasting) for transmission method. Also DMB provides the error protection method of convolution coding. In this paper, we study on the effective error resilience coding of MPEG-4 video stream over DMB system. To accomplish error resilience, we first partition one data into several data using the data partitioning, and we control the coding rate of the convolution coding according to the importance of the partitioned data. In this algorithm, we suggest and analyze the efficient rate control algorithm considering convolution code rate.