• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.1711-1714
• /
• 2003

The noise in an image degrades image quality and deteriorates coding efficiency of compression. Recently, various edge-preserving noise filtering methods based on the nonstationary image model have been proposed to overcome this problem. In most conventional nonstationary image models, however, pixels are assumed to be uncorrelated to each other In order not to increase the computational burden too much. As a result, some detailed information is lost in the filtered results. In this paper, we propose a computationally feasible adaptive noise smoothing algorithm which considers the nonstationary correlation characteristics of images. We assume that an image has a nonstationary mean and can be segmented into subimages which have individually different stationary correlations. Taking advantage of the special structure of the covariance matrix that results from the proposed image model, we derive a computationally efficient FFT-based adaptive linear minimum mean square error filter. The justification for the proposed image model is presented and the effectiveness of the proposed algorithm is demonstrated experimentally.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.270-273
• /
• 2007

In this paper, a SAR-despeck1ing approach of adaptive iteration based a Bayesian model using the lognormal distribution for image intensity and a Gibbs random field (GRF) for image texture is proposed for noise removal of the images that are corrupted by multiplicative speckle noise. When the image intensity is logarithmically transformed, the speckle noise is approximately Gaussian additive noise, and it tends to a normal probability much faster than the intensity distribution. The MRF is incorporated into digital image analysis by viewing pixel types as states of molecules in a lattice-like physical system. The iterative approach based on MRF is very effective for the inner areas of regions in the observed scene, but may result in yielding false reconstruction around the boundaries due to using wrong information of adjacent regions with different characteristics. The proposed method suggests an adaptive approach using variable parameters depending on the location of reconstructed area, that is, how near to the boundary. The proximity of boundary is estimated by the statistics based on edge value, standard deviation, entropy, and the 4th moment of intensity distribution.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권2호
• /
• pp.104-115
• /
• 2005

Median filters in the signal processing have been most widely used and have demonstrated the strongest effects. This paper proposes the adaptive median filters with noise detection. The proposed basic algorithm of the filters is to judge whether or not the noises exist on the ground of The Noise Judgment Standards. Just in case the existence of the noises is verified by the algorithm, it takes the median filter. In order to judge the existence of the noises by the algorithm, this paper introduced the noise detection method by local central variance. As a result of comparing and analyzing the features and performance of the proposed filters and the existing [5]-[10] filters on the same conditions, it was verified that the former proved to be better than the latter, Observed even by naked eyes, it was similar, too. Accordingly, it's proved that the adaptive median filters by local central variance are useful in removing the impulse noise of the median filter and reinforce the edge preservation ability.

• ETRI Journal
• /
• 제28권5호
• /
• pp.668-671
• /
• 2006

In this letter, an adaptive scanning that improves intra coding efficiency in the H.264/AVC standard is proposed. The proposed adaptive scanning utilizes the prediction directions (modes) that include the horizontal and vertical edge information in a block. Depending on the prediction directions, the proposed method uses three scanning methods: zigzag scanning, horizontal scanning, and vertical scanning. In the proposed method, horizontal and vertical scanning are used in vertical and horizontal prediction modes, respectively, and the normal zigzag scanning in the H.264 standard is used in all other intra prediction modes. The proposed method reduces the bit rate by approximately 2.5% compared with H.264/AVC, without the degradation of video quality.

• 대한전자공학회논문지TC
• /
• 제40권6호
• /
• pp.213-224
• /
• 2003

제안된 알고리듬은 채널 잡음전력에 따라 적응적으로 문턱값 레벨을 결정하는 적응 문턱값 설정방식을 사용하여 채널특성에 관계없이 항상 최적의 문턱값을 설정한다. 또한, 이것은 그 추정성능이 다중경로채널에서의 전력지연 프로파일 변동에 대해 덜 민감하도록 만드는 특별하게 설계된 훈련심볼을 사용한다. 그 결과, 제안된 기법의 추정성능은 채널특성 변동에 대해 영향을 적게 받는다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제15권1호
• /
• pp.35-44
• /
• 2015

The main purpose of image enhancement is to improve certain characteristics of an image to improve its visual quality. This paper proposes a method for image contrast enhancement that can be applied to both medical and natural images. The proposed algorithm is designed to achieve contrast enhancement while also preserving the local image details. To achieve this, the proposed method combines local image contrast preserving dynamic range compression and contrast limited adaptive histogram equalization (CLAHE). Global gain parameters for contrast enhancement are inadequate for preserving local image details. Therefore, in the proposed method, in order to preserve local image details, local contrast enhancement at any pixel position is performed based on the corresponding local gain parameter, which is calculated according to the current pixel neighborhood edge density. Different image quality measures are used for evaluating the performance of the proposed method. Experimental results show that the proposed method provides more information about the image details, which can help facilitate further image analysis.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제6권4호
• /
• pp.264-269
• /
• 2006

A $0.12GHz{\sim}1.4GHz$ DLL-based clock generator with the capability of multiplied four phase clock generation was designed using a 0.18um CMOS process. An adaptive bandwidth DLL with a regulated supply delay line was used for a multiphase clock generation and a low jitter. An extra phase detector (PD) in a reference DLL solves the problem of the initial VCDL delay and achieves a fast lock time. Twice multiplied four phase clocks were generated at the outputs of four edge combiners, where the timing alignment was achieved using a coarse lock signal and the 10 multiphase clocks with T/8 time difference. Those four clocks were combined one more time using a static XOR circuit. Therefore the four times multiplication was achieved. With a 1.8V supply, the rms jitter of 2.1ps and the peak-to-peak jitter of 14.4ps were measured at 1.25GHz output. The operating range is $0.12GHz{\sim}1.4GHz$. It consumes 57mW and occupies 450*325um2 of die area.

• 한국정보통신학회논문지
• /
• 제16권3호
• /
• pp.598-604
• /
• 2012

영상신호는 신호를 처리하는 과정에서 다양한 잡음에 의해 훼손되어지며, 이러한 신호를 복원하기 위한 많은 연구가 이루어지고 있다. 본 논문에서는 랜덤 임펄스 잡음을 제거하기 위한 캐스케이드 필터 알고리즘을 제안하였다. 알고리즘은 잡음검출과 잡음제거 등 두 과정으로 구성되었으며, 잡음검출을 위하여 마스크의 분산과 중앙화소에 의한 분산을 이용하였다. 또한, 잡음신호에 대해서 스위칭 self adaptive weighted median 필터로 처리한 후, 변형된 가중치 알고리즘을 적용하여 제거하였다. 제안한 알고리즘은 잡음신호만을 제거하고 비잡음신호는 그대로 보존하여, 우수한 에지 보존특성 및 잡음제거 능력을 나타내었다.

• Journal of Information Processing Systems
• /
• 제9권3호
• /
• pp.405-424
• /
• 2013

This research paper proposes a secured, robust approach of information security using steganography. It presents two component based LSB (Least Significant Bit) steganography methods for embedding secret data in the least significant bits of blue components and partial green components of random pixel locations in the edges of images. An adaptive LSB based steganography is proposed for embedding data based on the data available in MSB's (Most Significant Bits) of red, green, and blue components of randomly selected pixels across smooth areas. A hybrid feature detection filter is also proposed that performs better to predict edge areas even in noisy conditions. AES (Advanced Encryption Standard) and random pixel embedding is incorporated to provide two-tier security. The experimental results of the proposed approach are better in terms of PSNR and capacity. The comparison analysis of output results with other existing techniques is giving the proposed approach an edge over others. It has been thoroughly tested for various steganalysis attacks like visual analysis, histogram analysis, chi-square, and RS analysis and could sustain all these attacks very well.

• Journal of information and communication convergence engineering
• /
• 제9권4호
• /
• pp.411-419
• /
• 2011

In this paper, we propose an Adaptive Regulating Drop (ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services (ASs) without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate (TPR) for aggregate TCP flows. The TPR is set larger than the current input IN packet rate of aggregate TCP flows while inversely proportional to the measured input OUT packet rate. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, the ARD marker performs random early fair remarking of their excessive IN packets to OUT packets at the aggregate flow level according to the TPR. In addition, an aggregate dropper is combined to drop some excessive IN packets fairly and constantly according to the TPR. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.