• Journal of the Korea Computer Industry Society
• /
• v.4 no.10
• /
• pp.581-586
• /
• 2003

In this paper, we propose a region-based deinterlacing algorithm which is computationally efficient and shows effective visual performance. Computer simulation results indicate that the proposed algorithm shows better visual performance than conventional deinterlacing algorithms.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.2
• /
• pp.92-96
• /
• 2010

Deinterlacing methods are usually divided into inter-field deinterlacing and intra-field deinterlacing. The most common method of intra-field deinterlacing is the linear method which uses line doubling or line averaging. There are also some edge-enhancement methods such as ELA(Edge Based Line Average) and modified ELA. However, the linear interpolation generates edge blurring or staircase artifacts. The methods using ELA or modified ELA show poor deinterlacing at various types of edges because of insufficient edge information in a certain direction. This paper presents an intra-field deinterlacing algorithm that considers the interpolation based on edges in 7 directions and an edge line in the horizontal direction. It demonstrates better picture quality by reducing the staircase phenomenon of object in the conventional methods.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.90-93
• /
• 2002

In this work, an efficient lifting implementation of invertible deinterlacing is proposed. The invertible deinterlacing is a technique developed for intra-frame-based video coding as a preprocessing. Unlike the conventional deinterlacing, it preserves the sampling density and has the invertibility. For a special selection of filters, it is shown that the deinterlacing can be implemented efficiently by an in-place computation. It is also shown that the deinterlacing can be combined with the lifting discrete wavelet transform (BWT) employed in JPEG2000. A bit modification of the original lifting DWT is shown to provide the simultaneous implementation of deinterlacing. This fact makes the proposed technique attractive for the application to Motion-JPEG2000. The inverse transform and the reversible lifting implementation are also discussed.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.469-472
• /
• 2005

In this paper, we propose a new deinterlacing algorithm based on motion estimation and compensation with variable block size. Motion compensated methods using a fixed block size tend to produce undesirable artifacts when there exist complicated motion and high frequency components. In the proposed algorithm, the initial block size of motion estimation is determined based on the existence of global motion. Then, the block is divided depending on block characteristics. Since motion compensated deinterlacing may not always provide satisfactory results, the proposed method also use an intrafield spatial deinterlacing. Experimental results show that the proposed method provides noticeable improvements compared to motion compensated deinterlacing with a fixed block size.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.3
• /
• pp.723-734
• /
• 2008

The main reason for deinterlacing is frame-rate conversion. The other reason for deinterlacing is of course improve clarity and reduce flicker. Using a deinterlacer can help clarity and stability of the image. Many deinterlacing algorithms are available in image processing literatures such as ELA and E-ELA. This paper propose a new statistical deinterlacing algorithm based on statistical tests such as the Bartlett test, the Levene test and the Kruskal-Wallis test. The results obtained from the proposed algorithms are found to be comparable to those from many well-known deinterlacers. However, the results in the proposed deinterlacers are found to be more efficient than other deinterlacers.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.204-208
• /
• 2011

This paper proposes a novel deinterlacing algorithm using neighboring deinterlacing pixels directions weight, which can obtain the true deinterlacing direction of the interpolated pixel. The proposed algorithm determines the direction of the current interpolated pixel using MELA direction determination method. To obtain more accurate deinterlacing direction and increase interpolation direction correlation, the directions of neighboring pixels around the current interpolated pixel are considered. The current direction and the neighboring majority direction are compared to decide an interpolated method. But it cost slightly CPU time increasing since neighboring pixels directions determination and statistics. Experimental results demonstrate that the proposed algorithm outperforms the conventional deinterlacing methods.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.569-572
• /
• 2001

본 논문에서는 비월주사 방식의 영상을 순차주사 방식의 영상으로 변환하기 위한 deinterlacing 기법에 관하여 고찰한다. 먼저, 공간 영역 상에서 수행되는 기존의 deinterlacing 기법 중에서 우수한 성능을 보이는 것으로 알려진 ELA방법의 단점을 보완하기 위하여 적응적 ELA 알고리즘을 제안하였다. 기존의 ELA방법은 수평 edge를 검출할 수 없어 수평 edge 성분을 포함하는 화소 값은 원치 않는 값으로 보간 되는 결과를 가져왔다. 이를 개선시키기 위해 수평 edge를 효과적으로 검출하는 방법을 제안하고, 수평 에지 부분을 적절히 보간할 수 있는 적응적인 필터를 제안한다. 그 결과 수평 edge 부분에서의 개선으로 기존의 ELA 방법보다 더 나은 성능을 얻었다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.1
• /
• pp.8-14
• /
• 2017

Deinterlacing is a method to convert interlaced video, including two fields (even and odd), to progressive video. It can be divided into spatial and temporal methods. The deinterlacing method in the spatial domain can easily be hardware-implemented, but yields image degradation if information about the deinterlaced pixel does not exist in the same field. On the other hand, the method in the temporal domain yields a deinterlaced image with higher quality but uses more memory, and hardware implementation is more difficult. Furthermore, the deinterlacing method in the temporal domain degrades image quality when motion is not estimated properly. The proposed method is for deinterlacing in the spatial domain. It uses several deinterlacing methods according to statistical characteristics in neighboring pixel locations. In this procedure, the proposed method uses the C4.5 algorithm, a typical classification algorithm based on entropy for choosing optimal methods from among the candidates. The simulation results show that the proposed algorithm outperforms previous deinterlacing methods in terms of objective and subjective image quality.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.41-46
• /
• 2005

Deinterlacing is the conversion from interlaced to progressive scan image that is considered to be 2 times image interpolation. In this paper, the simple and effective deinterlacing method is proposed based on the local gradient information of neighborhood pixels. In the proposed method, the weights for directions around the pixel to be interpolated are estimated, and the weighted sum for the neighborhood pixels is the final intensity value of the pixel to be interpolated. The proposed method has the structure suitable to practical implementation and can avoid the artifacts due to the wrong detection of edge direction. In the simulation, it showed improved subjective and objective performance than the ELA method and comparable performance compared with the variation of ELA method which has more complex structure and requires a couple of parameters that is determined by experience.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2209-2215
• /
• 2014

This paper presents, a deinterlacing method by improving the Direction-Oriented Interpolation (DOI) technique. The technique is considered to be a very strong tool for intrafield-based deinterlacing. However, DOI has some problems such as long processing time, wrong edge detection in periodic pattern. To remedy this problem, we replace the full search in DOI by a two-step search to reduce processing time and introduces two additional processes to improve image quality. In the proposed method, the spatial direction vectors (SDVs) misread data are reconsidered to prevent them utilizing in the next interpolation step, resulting in an accurate deinterlacing method. We conduct experiments with ISO experimental images to compare the proposed method with the existing methods including line evarage (LA), edge-based line averaging (ELA), DOI, selective deinterlacing algorithm (SDA). Experimental results show the proposed method gives better performance in objective and subjective quality than existing deinterlacing methods.