• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.583-586
• /
• 1997

In this study, we proposed an application of wavelet transform or analysis of ultrasound echo signals to improve troubles of convenianced methods such as SDM, SSM. We examined method using wavelet transform to prove again our proposal which we have proposed prior time. At first, we made phantoms by adding 0.01, 0.015, 0.02, 0.025, 0.03, 0.035, 0.04, 0.045, 0.05($g/cm^3$) on constant quantity of distilled water and agar, and collected echo signals. We used SDM(spectral difference method) and WTM(wavelet transform method) as signal processing method. To compare with WTM, SDM was used. In WTM, we selected detail signals of level 3 of Daubechies 16, and got derivative, calculated area of it. Next, we calculated slopes. In SDM, it was 0.0308 and in WTM, it was 0.5248. As a result, we knew that we could know that the values using WTM showed more detailed than those using SDM. So we could concluded wavelet transform is very useful and powerful in ultrasound tissue characterization.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.1
• /
• pp.45-51
• /
• 2003

JPEG200, a new international standard for still image compression based on wavelet and bit-plane coding techniques, is developed. In this paper, we design the DWT(Discrete Wavelet Transform) and quantizer for JPEG2000 CODEC. DWT handles both lossy and lossless compression using the same transform-based framework: The Daubechies 9/7 and 5/3 transforms, and quantizer is implemented as SQ(Scalar Quantization). The architecture of the proposed DWT and SQ are synthesized and verified using Xilinx FPGA technology. It operates up to 30MHz, and executes algorithms of wavelet transform and quantization for VGA 10 frame per second.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1391-1406
• /
• 2020

A zero-watermarking algorithm in transform domain based on RGB channel and voting strategy is proposed. The registration and identification of ownership have achieved copyright protection for color images. In the ownership registration, discrete wavelet transform (DWT), discrete cosine transform (DCT), and singular value decomposition (SVD) are used comprehensively because they have the characteristics of multi-resolution, energy concentration and stability, which is conducive to improving the robustness of the proposed algorithm. In order to take full advantage of the characteristics of the image, we use three channels of R, G, and B of a color image to construct three master shares, instead of using data from only one channel. Then, in order to improve security, the master share is superimposed with the copyright watermark encrypted by the owner's key to generate an ownership share. When the ownership is authenticated, copyright watermarks are extracted from the three channels of the disputed image. Then using voting decisions, the final copyright information is determined by comparing the extracted three watermarks bit by bit. Experimental results show that the proposed zero watermarking scheme is robust to conventional attacks such as JPEG compression, noise addition, filtering and tampering, and has higher stability in various common color images.

• Journal of the Korean Statistical Society
• /
• v.25 no.1
• /
• pp.111-122
• /
• 1996

A model for a system whose state changes continuously with time is introduced. It is assumed that the system is modeled by a Brownian motion with negative drift and an absorbing barrier at the origin. A repairman arrives according to a Poisson process and repairs the system according to an (s,S) policy, i.e., he increases the state of the system up to S if and only if the state is below s. A partial differential equation is derived for the distribution function of X(t), the state of the system at time t, and the Laplace-Stieltjes transform of the distribution function is obtained by solving the partial differential equation. For the stationary case the explicit expression is deduced for the distribution function of the stationary state of the system.

• Kyungpook Mathematical Journal
• /
• v.9 no.1_2
• /
• pp.31-36
• /
• 1969

• Kyungpook Mathematical Journal
• /
• v.16 no.2
• /
• pp.259-266
• /
• 1976

• Kyungpook Mathematical Journal
• /
• v.10 no.2
• /
• pp.115-120
• /
• 1970

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1921-1936
• /
• 1999

In this paper, we analyze the blocking artifact in block transform-coded images and propose a classification algorithm which classifies each horizontal and vertical block boundary into four regions of EQ, BA, EE, and AE according to the characteristics of the blocking artifact. We also compare the performance of several blocking artifact reduction methods which can reduce blocking artifact in block transform-coded images well. As the blocking artifact reduction methods, the LOT, Kim's wavelet transform-based method, Yang's POCS, Paek's POCS, and Jang's CM have been selected. Experimental results show that each horizontal and vertical block boundary classified by using the proposed classification algorithm yields different characteristics of discontinuities due to the blocking artifact according to the classified region. It is also shown that the blocking artifact reduction methods using wavelet transform yield better performance over the other methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1686-1691
• /
• 2004

In this paper, we present an improved method to calculate Euclidean distance transform based on Guan's method. Compared to the conventional method, Euclidean distance can be computed faster using Guan's method when the number of feature pixels is small; however, overall computational cost increases proportional to the number of feature pixels in an image. To overcome this problem, we divide feature pixels into two groups: boundary feature pixels (BFPs) and non-boundary feature pixels (NFPs). Here BFPs are defined as those in the 4-neighborhood of foreground pixels. Then, only BFPs are used to calculate the Voronoi diagram resulting in a Euclidean distance map. Experimental results indicate that the proposed method takes 40 Percent less computing time on average than Guan's method. To prove the performance of the proposed method, the computing time of Euclidean distance map by proposed method is compared with the computing time of Guan's method in 16 images that are binary and the size of 512${\times}$512.

• Proceedings of the Optical Society of Korea Conference
• /
• 1996.09a
• /
• pp.50-50
• /
• 1996