• Journal of the Korean Society of Radiology
• /
• v.13 no.4
• /
• pp.509-516
• /
• 2019

In the linear transformation method, the original image is divided into a plurality of range blocks, and a partial transform system for finding an optimal domain block existing in the image for each range block is used to adjust the performance of the compression ratio and the picture quality, The nonlinear transformation method uses only the rotation transformation among eight shuffle transforms. Since the search is performed only in the limited domain block, the coding time is faster than the linear transformation method of searching the domain block for any block in the image, Since the optimal domain block for the range block can not be selected in the image, the performance may be lower than other methods. Therefore, the nonlinear transformation method improves the performance by increasing the approximation degree of the brightness coefficient conversion instead of selecting the optimal domain block, The smaller the size of the block, the higher the PSNR value, The higher the compression ratio is increased groups were quadtree block divided to encode the image at best.

• 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 IKEEE
• /
• v.26 no.4
• /
• pp.577-583
• /
• 2022

Verilog-HDL-based modeling can be performed to confirm the fast operation characteristics after setting the design parameters of each block considering the stability of the system by performing linear phase-domain modeling on the phase-locked loop. This paper proposed Verilog-HDL modeling including DCO noise and DTC nonlinear characteristic. After completing the modeling, the time-domain transient simulation can be performed to check the feasibility and the functionality of the proposed PLL system, then the phase noise result from the system design based on the functional model can be verified comparing with the ideal phase noise graph. As a result of the comparison of simulation time (6 us), the Verilog-HDL-based modeling method (1.43 second) showed 484 times faster than the analog transistor level design (692 second) implemented by TSMC 0.18-㎛.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.5
• /
• pp.730-736
• /
• 2009

It is more important to analysis of huge gemonics data in Bioinformatics. Here we present a novel datamining approach to predict structure and function using protein's primnary structure only. We propose not also to develope n-Block substring search algorithm in reducing enormous search space effectively in relation to feature selection, but to formulate weighted linear algorithm in a prediction of structure and function of a protein using primary structure. And we show efficient in protein domain characterization and classification by calculation weight value in determining domain association in each selected substring, and also reveal that more efficient results are acquired through claculated model score result in an inference about degree of association with each CDS(coding sequence) in domain.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1077-1088
• /
• 2003

To increase the retrieval performance in spatial database systems, it is required to develop spatial indexing methods considered the spatial locality. The spatial locality is related to the location property of objects. The previous spatial indexing methods are not considered the circular location property that objects will be taken. In this paper, we propose a dynamic spatial index structure called $Cr^*$-tree, and evaluate the performance of the proposed index structure. This is a new spatial index structure considered the circular location property of objects in which a search space is constructed with the circular and linear domains. By the simulation results, the $Cr^*$-tree shows that the number of disk across is low and the bucket utilization is high regardless of object distribution and bucket capacity.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.513-516
• /
• 2001

마이크로폰을 배열을 이용한 음성개선 기법 중에서 저주파 영역에서의 높은 상관성과 고주파 영역에서의 spatial aliasing을 동시에 고려하기 위하여 대수적인 선형 마이크로폰 배열을 사용하고 웨이브렛 도메인에서의 Wiener 필터에 기반한 postfiltering을 수행하는 방법이 제안된 바 있는데[l], 본 논문에서는 이 방법의 문제점을 분석하고 해결방안을 제시하였다. 제안한 알고리즘을 사용하여 시뮬레이션한 결과, 마이크에 입력되는 음성신호의 SNR이 0dB일 때와 l0dB일 때, 기존의 알고리즘에 비해 약 1.7dB와 2.5dB의 성능개선이 있었으며, 청취실험을 통해서도 음질의 향상을 확인할 수 있었다.

• Journal of the Korean Crystal Growth and Crystal Technology
• /
• v.16 no.2
• /
• pp.49-52
• /
• 2006

Periodic electric field assisted poling low loss (${\sim}0.1dB/cm$) single-mode Ti-diffused waveguides in $LiNbO_3$ has been achieved using a periodically patterned electrode on the +Z surface of Ti : $LiNbO_3$ crystal and homogeneous LiCl solution. Using selective chemical etching, we confirmed the periodic (${\sim}16{\mu}m$) domain inverted structure and measured SH (second harmonic) properties of fabricated periodically poled Ti : $LiNbO_3$ waveguides.

• Journal of Korea Multimedia Society
• /
• v.16 no.6
• /
• pp.756-763
• /
• 2013

Bilateral filter (BF), functioning by two Gaussian filters, domain and range filter is a nonlinear filter for sharpness enhancement and noise removal. In infrared (IR) small target detection field, the BF is designed by background predictor for predicting background not including small target. For this, the standard deviations of the two Gaussian filters need to be changed adaptively in background and target region of an infrared image. In this paper, the proposed bilateral filter make the standard deviations changed adaptively, using variance feature of mean values of surrounding block neighboring local filter window. And, in case the variance of mean values for surrounding blocks is low for any processed pixel, the pixel is classified to flat background and target region for enhancing background prediction. On the other hand, any pixel with high variance for surrounding blocks is classified to edge region. Small target can be detected by subtracting predicted background from original image. In experimental results, we confirmed that the proposed bilateral filter has superior target detection rate, compared with existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.863-870
• /
• 2009

Bilateral filter (BF) is a nonlinear filter for sharpness enhancement and noise removal. The BF performs the function by the two Gaussian filters, the domain filter and the range filter. To apply the BF to infrared (IR) small target detection, the standard deviation of the two Gaussian filters need to be changed adaptively between the background region and the target region. This paper presents a new BF with the adaptive standard deviation based on the analysis of the edge component of the local window, also having the variable filter size. This enables the BF to perform better and become more suitable in the field of small target detection Experimental results demonstrate that the proposed method is robust and efficient than the conventional methods.

• Journal of Intelligence and Information Systems
• /
• v.10 no.2
• /
• pp.165-187
• /
• 2004

Constraint Programming in AS and Optimization in OR started and have grown in different backgrounds to solve common decision-making problems in real world. This paper tries to integrate results from those different fields by suggesting a hybrid solver as an integration framework. Starting with an integrating modeling language, a way to implement a hybrid solver will be discussed using Warren's abstract machine and an finite domain constraint programming solver structures. This paper will also propose some issues rising when implementing the hybrid solver and provide their solutions.