• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1996년도 학술대회
• /
• pp.223-227
• /
• 1996

In this paper we propose an adaptive fast image restoration filter, which is suitable for reducing the blocking artifacts in the compressed image in real-time. The proposed restoration filter is based on the observation that quantization operation in a series of coding process is a nonlinear and many-to-one mapping operator. And then we propose an approximated version of constrained optimization technique as a restoration process for removing the nonlinear and space varying degradation operator. We also propose a novel block classification method for adaptively choosing the direction of a highpass filter, which serves as a constraint in the optimization process. The proposed classification method adopts the bias-corrected maximized likelihood, which is used to determine the number of regions in the image for the unsupervised segmentation. The proposed restoration filter can be realized either in the discrete Fourier transform domain or in the spatial domain in the form of a truncated finite impulse response (FIR) filter structure for real-time processing. In order to demonstrate the validity of the proposed restoration filter experimental results will be shown.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.1007-1010
• /
• 2002

In this paper, we present a new blocking artifact reduction algorithm using interpolation and signal adaptive filter (SAF) based on the edge map. Generally, block-based coding, such as JPEG and MPEG, is the most popular image compression method. However, for high compression it produces noticeable blocking and ringing artifacts in the decoded image. In proposed method, all the block is classified into low and high frequency blocks in block classification procedure. And edge map is obtained by using Sobel operator on decoded image. And according to the block property we applied blocking artifacts reduction algorithm. Namely, four neighbor low frequency block is participated in interpolation based on edge map. And ringing artifacts is removed by applying a signal adaptive filter around the edge using edge map in high frequency block. The computer simulation results confirmed a better performance by the proposed method in both the subjective and objective image qualities.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.427-430
• /
• 2005

In this paper, we propose a new post-processing method, based on the theory of the projection onto convex sets (POCS) to reduce the blocking artifacts in decoded images. We propose a new smoothness constraint set (SCS) and its projection operator in the wavelet transform (WT) domain to remove unnecessary high-frequency components caused by blocking artifacts. We also propose a new method to find and preserve the original high frequency components of the image edge. Experimental results show that the proposed method can not only achieve a significantly enhanced subjective quality, but also have the PSNR improvement in the output image.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 제14회 신호처리 합동 학술대회 논문집
• /
• pp.755-758
• /
• 2001

In this paper. Ive propose a postprocessing technique based on the theory of projection on convex sets(POCS) to reduce the blocking artifacts in HDTV decoded images. In BDCT of HDTV. the image is divided into a grid of non-overlapped 8 ${\times}$ 8 blocks. and then each block is coded separately. A block which is located one pixel apart from the grid of BDCT will include the boundary of the original 8 ${\times}$ 8 block. If the blocking artifact is Introduced alone the block boundary. this block will have different frequency characteristic from that of the original block. Thus, a comparison of frequency characteristics of these two overlapping blocks can detect the undesired high-frequency components mainly caused by the blocking artifact. By eliminating these undesired high-frequency components adaptively, robust smoothing projection operator can be obtained. Simulation results with real image sequences indicate that the proposed method performs better than conventional algorithms.

• 한국통신학회논문지
• /
• 제33권8C호
• /
• pp.583-590
• /
• 2008

본 논문에서는 H.264 동영상 표준 부호화 방식의 블록화 현상 제거 및 화질 개선을 위한 적응적 후처리 기법에 대해 제안한다. H.264의 루프 필터는 부호화기 내부에 위치함에 따라 부호화 복잡도를 증가시키곤 블록화 현상을 완벽히 제거하지 못하며, 영상을 과도하게 열화 시킨다. 따라서 본 논문에서는 부호화기의 복잡도를 낮추는 동시에 고화질의 영상을 복원하기 위해 Constraint Least Squares(CLS) 기법과 투영 기법을 결합하였다. 또한 인간의 시각 시스템을 반영하기 위해 가중치 norm CLS 기법을 사용하였으며, 이를 위해 블록 경계와 블록 내부에 위치한 화소들의 위치에 따라 각기 다른 국부 분산과 라플라시안 연산자를 새롭게 정의하였다. 국부 화소들은 높은 상관관계를 갖는다는 특성을 이용하여 투영 기법을 위한 투영 집합을 정의하였다. 끝으로 0.264의 양자화 인덱스(QP)를 완화도 조절을 위해 공통적으로 사용하였다. 실험 결과를 통해 제안된 후처리 기법이 H.264의 루프 필터보다 블록화 현상을 효과적으로 제거하는 동시에 CLS 기법보다 빠르게 수렴함을 확인할 수 있었다.

• 방송공학회논문지
• /
• 제7권4호
• /
• pp.327-334
• /
• 2002

본 논문에서는 H.26L 동영상 부호화 표준 방식의 블록화 현상 및 링 현상을 효과적으로 제거하여 화질 개선된 영상을 얻기 위한 루프 필터 방식에 대한 제안한다. 기존 동영상 부호화 방식과 다른 형태의 움직임 보상 및 변환 방식을 기반으로 하는 H.26L 동영상 압축 방식의 블록화 현상 및 링 현상의 정도는 부호화 형태, 양자화 크기 및 움직임 정토에 의해 다르게 표현되므로 제안 방식에 서는 상기 정보에 따라 필터 형태 및 필터 계수가 다르게 설정되도록 하였으며, 필터 과정에서 발생할 수 있는 과잉 열화 현상을 줄이기 위한 제약 조건을 투영 연산 과정을 통해 정의하였다. 상기 부가 정보는 부호화부 및 복호화부 과정에서 이용 가능하므로 루프 필터 형태로 이용했으며, 부호화부 및 복호화부의 계산량을 절감하기 위해 알고리즘을 단순화 시켰다. 제안된 방식의 성능을 실험을 통해 확인할 수 있었다.

• 대한전자공학회논문지SP
• /
• 제43권3호
• /
• pp.1-8
• /
• 2006

본 논문에서는 복원된 영상에서 블록현상을 제거하기 위해 POCS 이론을 기반으로 효율적인 후처리 기법을 제안한다. 블록 현상을 나타내는 불필요한 고주파성분을 제거하기 위해 웨이브렛 변환으로 효과적인 SCS 및 그 투영자를 제안한다. 또한 원 영상에서 에지로 나타나는 고주파성분은 찾아서 유지하는 방법도 제안한다. 실험결과로 제안하는 방법은 향상된 주관적 화질뿐만 아니라, 복원된 출력 영상에서의 PSNR이 향상됨을 알 수 있다.

• International Journal of Computer Science & Network Security
• /
• 제21권8호
• /
• pp.28-34
• /
• 2021

Internet Service Providers (ISPs) constantly endeavor to resolve network congestion, in order to provide fast and cheap services to the customers. This study suggests two models based on Markov chain, using three and four access attempts to complete the call. It involves a comparative study of four models to check the relationship between Internet Access sharing traffic, and the possibility of network jamming. The first model is a Markov chain, based on call-by-call attempt, whereas the second is based on two attempts. Models III&IV suggested by the authors are based on the assumption of three and four attempts. The assessment reveals that sometimes by increasing the number of attempts for the same operator, the chances for the customers to complete the call, is also increased due to blocking probabilities. Three and four attempts express the actual relationship between traffic sharing and blocking probability based on Markov using MATLAB tools with initial probability values. The study reflects shouting results compared to I&II models using one and two attempts. The success ratio of the first model is 84.5%, and that of the second is 90.6% to complete the call, whereas models using three and four attempts have 94.95% and 95.12% respectively to complete the call.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2002년도 학술대회지
• /
• pp.815-818
• /
• 2002

The elliptic relaxation model(ERM) with the inhomogeneous correction intermediate between near wall with and far from the wall. The source of the ERM usually was appled quasi-homogeneous pressure-strain correlation in homogeneous situations. This formulation was easily applied to the linear model or non-linear pressure-strain model. It is observed that the boundary conditions of the relaxation operator dominate the homogeneous pressure-strain model in the near wall region. While looking at high-Reynolds number flows, it was found necessary to modify the effect of the relaxation operator throughout the log region by accounting for gradients of the flatness variable and turbulent length scales. These effects are kinematic blocking of the wall normal velocity fluctuation and pressure reflections from the surface. This model is wall distances and unit vectors which make the model applicable to flows boundary by a complex geometry. Inhomogeneous correction model is computed inertial and non-inertial channel flow These are compared DNS(Kim et at., Kristofffrsen & Andersson) for channel flow. The present model could be predicted well for rotating flows.

• 디지털산업정보학회논문지
• /
• 제7권2호
• /
• pp.39-46
• /
• 2011

Privacy IP hacking problems such as invasion of privacy, password cracking, voice wiretapping and internet over charged occurred, because VoIP internet voice phone service gradually spread. This thesis attempted to attack the VoIP service network by application. First use application to spoof IP address then attempted wiretap the VoIP service and sends a lot of messages to disturb service movement. At this point, we connected VoIP soft terminal, so we can operate real-time filtering operator to block the SIP Flooding offence by monitor the traffic and detect the location where it got attacked. This thesis used experiment to prove it is possible to detect the offence and defend from SIP Flooding offence.