• Journal of the Korean Society of Radiology
• /
• v.8 no.1
• /
• pp.19-26
• /
• 2014

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, we choose new approximation coefficients using a non-linear approximation of luminance term. This boosts the fidelity. Our experiment employing the above methods shows enhancement in the coding time more than two times over traditional coding methods and shows improvement in PSNR value by about 1-3dB at the same compression rate.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.499-502
• /
• 2001

Fractal image coding suffers from the long search time of domain pool although it provides many properties including the high compression ratio. We find that the normalized variance of a block is independent of contrast, brightness. Using this observation, we introduce a self similar block searching method employing the d-dimensional nearest neighbor searching. This method takes Ο(log/N) time for searching the self similar domain blocks for each range block where N is the number of domain blocks. PSNR (Peak Signal Noise Ratio) of this method is similar to that of the full search method that requires Ο(N) time for each range block. Moreover, the image quality of this method is independent of the number of edges in the image.

• Journal of Digital Convergence
• /
• v.12 no.6
• /
• pp.271-276
• /
• 2014

In a speech coding system using excitation source of voiced and unvoiced, it would be involved a distortion of speech quality in case coexist with a voiced and unvoiced consonants in a frame. In this paper, I propose a method of 8kbps Multi-Pulse Speech Coding(FBD-MPC: Frequency Band Division MPC) by using TSIUVC(Transition Segment Including Unvoiced Consonant) searching, extraction and approximation-synthesis method in a frequency domain. I evaluate the 8kbps MPC and FBD-MPC. As a result, SNRseg of FBD-MPC was improved 0.5dB for female voice and 0.2dB for male voice respectively. Compared to the MPC, SNRseg of FBD-MPC has been improved that I was able to control the distortion of the speech waveform finally. And so, I expect to be able to this method for cellular phone and smart phone using excitation source of low bit rate.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.640-655
• /
• 2014

Many of today's video systems have additional depth camera to provide extra features such as 3D support. Thanks to these changes made in multimedia system, it is now much easier to obtain depth information of the video. Depth information can be used in various areas such as object classification, background area recognition, and so on. With depth information, we can achieve even higher coding efficiency compared to only using conventional method. Thus, in this paper, we propose the 2D video coding algorithm which uses depth information on top of the next generation 2D video codec HEVC. Background area can be recognized with depth information and by performing HEVC with it, coding complexity can be reduced. If current CU is background area, we propose the following three methods, 1) Earlier stop split structure of CU with PU SKIP mode, 2) Limiting split structure of CU with CU information in temporal position, 3) Limiting the range of motion searching. We implement our proposal using HEVC HM 12.0 reference software. With these methods results shows that encoding complexity is reduced more than 40% with only 0.5% BD-Bitrate loss. Especially, in case of video acquired through the Kinect developed by Microsoft Corp., encoding complexity is reduced by max 53% without a loss of quality. So, it is expected that these techniques can apply real-time online communication, mobile or handheld video service and so on.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.405-408
• /
• 2002

LSP(Line Spectrum Pairs) Parameter is used for speech analysis in vocoders or recognizers since it has advantages of constant spectrum sensitivity. low spectrum distortion and easy linear interpolation. However the method of transforming LPC(Linear Predictive Coding) into LSP is so complex that it takes much time to compute. Among conventional methods, the real root method is considerably simpler than others, but nevertheless, it still suffers from its jndeterministic computation time because the root searching is processed sequentially in frequency region. We suggest a method of reducing the LSP transformation time using voice characteristics The proposed method is to apply search order and interval differently according to the distribution of LSP parameters. in comparison with the conventional real root method, the proposed method results in about 46.5% reduction. And, the total computation time is reduce to about 5% in the G.723.1 vocoder.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.80-83
• /
• 2003

A Genetic algorithm is a searching algorithm that based on the law of the survival of the fittest. Multi-population Genetic Algorithms are a modified form of genetic algorithm. Therefore, experience with fuzzy logic and genetic algorithm has proven to be that a combination of them can efficiently make up for their own deficiency. The Multi-population Genetic Algorithms independently evolve subpopulations. In this paper, we suggest a new coding method that independently evolves subpopulations using the fuzzy logic controller. The fuzzy logic controller has applied two fuzzy logic controllers that are implemented to adaptively adjust the crossover rate and mutation rate during the optimization process. The migration scheme in the multi-population genetic algorithms using fuzzy logic controllers is tested for a function optimization problem, and compared with other group migration schemes, therefore the groups migration scheme is then performed. The results demonstrate that the migration scheme in the multi-population genetic algorithms using fuzzy logic controller has a much better performance.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.462-468
• /
• 2003

In a speech coding system using excitation source of voiced and unvoiced, it would be involved a distortion of speech quality in case coexist with a voiced and an unvoiced consonants in a frame. So, I propose TSIUVC(Transition Segment Including Unvoiced Consonant) searching and extraction method in order to uncoexistent with a voiced and unvoiced consonants in a frame. This paper present a new method of TSIUVC approximate-synthesis by using Least Mean Square and frequency band division. As a result, this method obtain a high quality approximation-synthesis waveforms within TSIUVC by using frequency information of 0.547KHz below and 2.813KHz above. The important thing is that the maximum error signal can be made with low distortion approximation-synthesis waveform within TSIUVC. This method has the capability of being applied to a new speech coding of Voiced/Silence/TSIUVC, speech analysis and speech synthesis.

• Journal of the Korean Society of Radiology
• /
• v.11 no.4
• /
• pp.241-246
• /
• 2017

The existing fractal compression method is effective in generating an artificial shape by approximating its partial regions to a domain block by re-dividing the whole image into a domain region and dividing it into several domain blocks, but it is difficult to implement a computer. In this study, it is difficult to approximate a complex block such as a large-sized block and an affine transformation because a large amount of calculation is required in searching for a combination of similar blocks through a transformation, so a large amount of coding time is required.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.9-16
• /
• 2006

Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.

• Journal of the Korean Society for information Management
• /
• v.1 no.1
• /
• pp.112-126
• /
• 1984

Since with the information explosion more and more bibliographic materials are continually being produced, the need for improvement of the design of bibliographic materials is urgent for quicker and easier use. One questionaire survey concerned with user preference on 7 Korean bibliographic materials was carried out and got the result that two of those 7 systems, Annual Index to Korean Periodicals, Theses for the Doctor's & Master's Degree in Korea are used most frequently and there are also lots of user discontent about currency, coverage, subject heading, layout and typography. The other study was an experimental searching on 4 Korean bibliographic materials to find out whose coding system is most efficient in information searching. According to the result all of those 4 bibliographic materials are very low in retrieval ratio and Annual Index to Korean Periodicals shows the lowest retrieval ratio. The conclusion suggests that deeper and wider investigation should be carried out as one of national projects for the most useful and efficient presentation of bibliographic materials.