• Asian Pacific Journal of Cancer Prevention
• /
• 제17권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.

• 대한전자공학회논문지
• /
• 제12권2호
• /
• pp.1-10
• /
• 1975

본 논문은 사진데이타에 쉽게 적용할수있는 한 adaptive data compression 방법을 노표시하였다. 이웃 sample data 사이의 높은 correlation때문에 발생할 부호화 복잡성을 간편한 sample difference data로 대처하였으며, 자단의 statistical nonstationarity에 적응키 위해서 여덟가지 부호(code)로 구성된 code set중에서 최적부호를 선택토록 하였다. code erst는 두가지 등장부호와 여섯가지 보완형 Shannon-Fanro 부호로 되었다. difference data의 확률분포는 Laplacian model로, entropy의 확률분포는 Gaussian model대 하였다. 부호선별 Paranleter로서 entropy와 Pr[차이값=0]=Po를 비교하였다. 콤퓨타 실험결과 이 adaptive coding 방법으로 2대 1의 데이타 감축비를 얻었다. 이 방법은 fixed coding에 비해서 데이타 감축비와 부호화효율에서 약 10%와 15%의 이득을 주었다. 또한 도는 entropy보다 휠신 편리한 부호선별 parameter인 중시에 entropy 경우와 1% 내외의 좋은 결과를 얻을수 있음이 확인되었다. 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 pr[difference value=0]=po. 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, po is found to he not only a convenient criterion for code selection, but also such efficient a parameter as to perform almost like entropy.

• 조명전기설비학회논문지
• /
• 제17권6호
• /
• pp.154-159
• /
• 2003

본 논문에서는 ITU G.726 규격을 만족하는 표준형 ADPCM 부호화 법을 이용하여 배경잡음의 크기에 따라 음성의 부호화율이 두가지로 가변하도록 함으로써, 낮은 데이터 전송률을 가지고도 단일 부호화율의 경우보다 개선된 음질을 갖는 부호화 기법을 제안하였다. 이를 위하여 배경잡음보다 큰 음성신호에 대하여는 데이터의 양이 커지더라도 음질을 향상시키기 위하여 40 [Kbps]로 압축하고, 작은 음성신호에 대하여는 16[Kbps]로 압축하여 데이터의 양을 줄이도록 하여 전체적으로 압축데이터의 양을 줄이면서 음질을 개선하도록 하였다. 입력된 음성신호에 대하여 두가지 압축율을 결정하기 위하여 영교차율(ZCR)을 사용하여 처리속도를 빠르도록 하였다.

• 대한전자공학회논문지SD
• /
• 제49권3호
• /
• pp.30-36
• /
• 2012

BTC 압축은 간단하고 효율적인 압축 알고리즘으로 알려져 있다. 본 논문에서는, 컬러 이미지 압축을 위한 RMC-BTC 알고리즘(RMC : reduction method chrominace data)을 제안한다. RMC-BTC coding은 chrominace data를 축소시키기 위해서, 각 BTC 블록에서, chrominace data를 평균으로 표현하는 방법과, luminance 데이터 의 bit-map을 chrominace 데이터의 bit-map으로 활용하여 chrominace 데이터를 표현하는 방법을 사용하였다. 시뮬레에션 결과는 기존의 BTC 알고리즘의 PSNR과 압축비율의 비교를 통해서, 제안한 알고리즘의 효율성을 확인하였다.

• Journal of Communications and Networks
• /
• 제18권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
• /
• 제26권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).

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• 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
• /
• 제5권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(1)
• /
• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• 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.