• The Journal of the Acoustical Society of Korea
• /
• v.39 no.1
• /
• pp.38-46
• /
• 2020

LOw Frequency Analysis Recording (LOFAR) and Demodulation of Envelop Modulation On Noise (DEMON) grams are bearing-time-frequency plots of underwater acoustic signals, to visualize features for passive sonar. Those grams are characterized by tonal components, for which conventional data coding methods are not suitable. In this work, a novel LOFAR/DEMON gram compression algorithm based on binary map and prediction methods is proposed. We first generate a binary map, from which prediction for each frequency bin is determined, and then divide a frame into several macro blocks. For each macro block, we apply intra and inter prediction modes and compute residuals. Then, we perform the prediction of available bins in the binary map and quantize residuals for entropy coding. By transmitting the binary map and prediction modes, the decoder can reconstructs grams using the same process. Simulation results show that the proposed algorithm provides significantly better compression performance on LOFAR and DEMON grams than conventional data coding methods.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.1
• /
• pp.1-9
• /
• 2004

In this paper, we proposed a hardware(H/W) structure which can compress and recontruct the input image in real time operation and implemented it into a FPGA platform using VHDL(VHSIC Hardware Description Language). All the image processing element to process both compression and reconstruction in a FPGA were considered each of them was mapped into a H/W with the efficient structure for FPGA. We used the DWT(discrete wavelet transform) which transforms the data from spatial domain to the frequency domain, because use considered the motion JPEG2000 as the application. The implemented H/W is separated to both the data path part and the control part. The data path part consisted of the image processing blocks and the data processing blocks. The image processing blocks consisted of the DWT Kernel for the filtering by DWT, Quantizer/Huffman Encoder, Inverse Adder/Buffer for adding the low frequency coefficient to the high frequency one in the inverse DWT operation, and Huffman Decoder. Also there existed the interface blocks for communicating with the external application environments and the timing blocks for buffering between the internal blocks. The global operations of the designed H/W are the image compression and the reconstruction, and it is operated by the unit or a field synchronized with the A/D converter. The implemented H/W used the 54％(12943) LAB(Logic Array Block) and 9％(28352) ESB(Embedded System Block) in the APEX20KC EP20K600CB652-7 FPGA chip of ALTERA, and stably operated in the 70MHz clock frequency. So we verified the real time operation. that is. processing 60 fields/sec(30 frames/sec).

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.1
• /
• pp.56-63
• /
• 2009

Nowdays, Most of Internet Contents delivered as a compressed file. It gives many advantages like deduction of communication bandwidth and transmission time etc. In case of JPEG Compression, Quantization is the most important procedure which accomplish the compression. In general signal processing, Quantization is the process which converts continuous analog signal to discrete digital signal. As you known already, Quantization over JPEG compression is to reduce magnitude of pixel value in spatial domain or coefficient in frequency domain. A lot of Data Hiding algorithms also developed to applicable for those compressed files. In this paper, we are going to unveil the influence of quantization table which used in the process of JPEG compression. Even thought most of algorithm modify frequency coefficients with considering image quality, they are ignoring the influence of quantization factor corresponding with the modified frequency coefficient. If existing algorithm adapt this result, they can easily evaluate their performances.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.6
• /
• pp.827-836
• /
• 2001

Data is represented by file structure in Computer System. But the file size is to be larger, it is hard to control and transmit. Therefore, in recent years, many researchers have developed new algorithms for the data compression. And now, we introduce a new Dynamic Compression Technique, making up for the weaknesses of huffman's. The huffman compression technique has two weaknesses. The first, it needs two steps of reading, one for acquiring character frequency and the other for real compression. The second, low compression rate caused by storing tree information. These weaknesses can be solved by our new Dynamic Relocatable Method, reducing the reading pass by relocating data file to dynamic form, and then storing tree information from pipeline structure. The first, it needs two steps of reading, one for acquiring character frequency and the other for real compression. The second, low compression rate caused by storing tree information. These weaknesses can be solved by our new Dynamic Relocatable Method, reducing the reading pass by relocating data file to dynamic form, and then storing tree information from pipeline structure.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.863-866
• /
• 1998

In this paper, we proposes Moving Picture Compression reducing bit numbers within the block by probability in 3D-DCT considered of temporal axis. From Delta Modification theory for frequency components, bit numbers within the block(4$\times$4) were properly compressed by using the Probability Entropy. At the result for the proposed algorithm, we could find that the values of PSNR for resolution and the compression rate were better than existing methods.

• Journal of Electrical Engineering and Technology
• /
• v.2 no.2
• /
• pp.172-177
• /
• 2007

Wavelet transforms provide basis functions for time-frequency analysis and have properties that are particularly useful for the compression of analogue point on wave transient and disturbance power system signals. This paper evaluates the compression properties of the discrete wavelet transform using actual power system data. The results presented in the paper indicate that reduction ratios up to 10:1 with acceptable distortion are achievable. The paper discusses the application of the reduction method for expedient fault analysis and protection assessment.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.48 no.2
• /
• pp.207-220
• /
• 2015

This study identified the species-specific, frequency-dependent characteristics of broadband acoustic scattering that facilitate classifying fish species using the pulse compression (PC) technique. Controlled acoustic scattering laboratory experiments were conducted with nine commercially important fish species using linear chirp signals (95-220 kHz) over an orientation angle range of ${\pm}45^{\circ}$ in the dorsal plane at approximately $1^{\circ}$ increments. The results suggest that the angular-dependent characteristics of the broadband echoes and the frequency-dependent variability in target strength (TS) were useful for inferring the fish species of interest. The scattering patterns in the compressed pulse output were extremely complex due to morphological differences among fish species, but the x-ray images strongly suggested that spatial separation correlated well with scattering for the head, skeleton, bone, otoliths, and swim bladder within each specimen.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.1
• /
• pp.55-63
• /
• 2000

This paper investigated the sub-region compression effect of the three dimensional DCT(3D-DCT) using the difference component(DC) of inter-frame in images. The proposed algorithm are the method that obtain compression effect to divide the information into subband after 3D-DCT, the data appear the type of cubic block(8${\times}$8${\times}$8) in eight difference components per unit. In the frequence domain that transform the eight differential component frames into eight DCT frames with components of both spatial and temporal frequencies of inter-frame, the image data are divided into frame component(8${\times}$8 block) of time-axis direction into 4${\times}$4 sub block in order to effectively obtain compression data because image components are concentrate in corner region with low-frequency of cubic block. Here, using the weight of sub block, we progressed compression ratio as consider to adaptive sub-region of low frequency part. In simulation, we estimated compression ratio, reconstructed image resolution(PSNR) with the simpler image and the complex image contained the higher frequency component. In the result, we could obtain the high compression effect of 30.36dB(average value in the complex-image) and 34.75dB(average value in the simple-image) in compression range of 0.04~0.05bpp.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.519-528
• /
• 2016

In order to achieve fast computational speed with good visual quality of output video, we propose a frequency domain based new fractal video compression scheme. Normalized cross correlation is used to find the structural self similar domain block for the input range block. To increase the searching speed, cross correlation is implemented in the frequency domain using FFT with one computational operation for all the domain blocks instead of individual block wise calculations. The encoding time is further minimized by applying rotation and reflection DFT properties to the IFFT of zero padded range blocks. The energy of overlap small size domain blocks is pre-computed for the entire reference frame and retaining the energies of the overlapped search window portion of previous adjacent block. Quadtree decompositions are obtained by using domain block motion compensated prediction error as a threshold to control the further partitions of the block. It provides a better level of adaption to the scene contents than fixed block size approach. The result shows that, on average, the proposed method can raise the encoding speed by 48.8 % and 90 % higher than NHEXS and CPM/NCIM algorithms respectively. The compression ratio and PSNR of the proposed method is increased by 15.41 and 0.89 dB higher than that of NHEXS on average. For low bit rate videos, the proposed algorithm achieve the high compression ratio above 120 with more than 31 dB PSNR.

• The Journal of the Acoustical Society of Korea
• /
• v.31 no.5
• /
• pp.273-279
• /
• 2012

In this thesis, a nonlinear compression fitting method was studied for each frequency channel of a 64 channel digital hearing aid. Unlike conventional fitting formula method done from the result of the hearing loss test, the present fitting method uses the auditory threshold of sound pressure measured near the tympanic membrane while ITE (In-The-Ear) hearing aid is fitted into the user's ear canal. Also, the spectral distribution of the voice sound pressure was used for realizing of output sound pressure compression curves against input sound pressure level. Theoretical research results of FFT-iFFT compression algorithm has been evaluated by experimental gain measurements at each different input sound pressure level 50 dB, 70 dB, 90 dB respectively.