Deinterlacing apparatus of digital image data
First Claim
Patent Images
1. A deinterlacing apparatus comprising:
- a field data storage unit which stores field data;
a BD &
BPPD detecting unit which calculates a brightness profile pattern difference (BPPD) value and a brightness difference (BD) value between a current interlaced field n and a previous interlaced field (n−
2);
a combiner which respectively limits the BD and BPPD values by a threshold value, maps the limited BD and BPPD values to preset levels, compares the magnitudes and decides a presence and extent of motion to output detected motion;
a motion extender which extends an effect of the detected motion to pixels adjacent to a pixel to be interpolated;
an edge detector which detects an edge direction around a pixel to be interpolated; and
a interpolation unit which interpolates a pixel according to the output of the edge detector and the output of the motion extender, and outputs a non-interlaced field.
2 Assignments
0 Petitions
Accused Products
Abstract
A deinterlacing method and apparatus for digital image data is disclosed. In the present invention, one of various interpolations appropriately performed according to a detected extent and direction of motion in a pixel to be interpolated. Thus, a screen quality can significantly be improved.
87 Citations
20 Claims
-
1. A deinterlacing apparatus comprising:
-
a field data storage unit which stores field data;
a BD &
BPPD detecting unit which calculates a brightness profile pattern difference (BPPD) value and a brightness difference (BD) value between a current interlaced field n and a previous interlaced field (n−
2);
a combiner which respectively limits the BD and BPPD values by a threshold value, maps the limited BD and BPPD values to preset levels, compares the magnitudes and decides a presence and extent of motion to output detected motion;
a motion extender which extends an effect of the detected motion to pixels adjacent to a pixel to be interpolated;
an edge detector which detects an edge direction around a pixel to be interpolated; and
a interpolation unit which interpolates a pixel according to the output of the edge detector and the output of the motion extender, and outputs a non-interlaced field. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
3. An apparatus of claim 2, wherein the value of Med45, Med0, and Med−
- 45 are each compared with either an identical threshold value or respectively compared with three different threshold values, and an edge direction is determined to be present in at least one direction corresponding to the values Med45, Med0, and Med−
45 depending upon the comparison.
- 45 are each compared with either an identical threshold value or respectively compared with three different threshold values, and an edge direction is determined to be present in at least one direction corresponding to the values Med45, Med0, and Med−
-
4. An apparatus of claim 2, wherein the values of Med45, Med0, and Med−
- 45 are each compared to a threshold value Eth as follows;
If Med45<
Eth, edge45°
=0 else edge45°
=Med45If Med0<
Eth, edge0°
=0 else edge0°
=Med0If Med−
45<
Eth, edge−
45°
=0 else edge−
45°
=Med−
45and a edge direction corresponding to a minimum value among edge45°
, edge0°
, edge−
45°
is determined to be present.
- 45 are each compared to a threshold value Eth as follows;
-
5. An apparatus of claim 4, wherein the edge direction is determined according to the following table where α
- <
β and
l*m*n,
- <
-
6. An apparatus of claim 4, wherein a pixel is interpolated according to the following table,
-
7. An apparatus of claim 1, wherein said edge detector also obtains a local correlation around a pixel to be interpolated.
-
8. An apparatus of claim 7, wherein the local correlation is obtained using one of three methods below, where Vth indicates a vertical direction threshold, Hth represents a horizontal direction threshold, and Vcor=0 indicates a local correlation in a vertical direction:
-
(1) Vcor=1 if Med{|P(i, j−
1)−
P(i+1, j−
1)|, |P(i, j)−
P(i+1, j)|, |P(i, j+1)−
P(i+1, j+1)}<
Vth;
(2) Vcor=1 if |Med{P(i, j−
1), P(i, j), P(i, j+1)}−
Med{P(i+1, j−
1), P(i+1, j), P(i+1, j+1)}|<
Vth;
or(3) i) Hedge1=0 if |Med{P(i, j−
2), P(i, j−
1), P(i, j)}−
Med{P(i, j), P(i, j+1), P(i, j+2)}|<
Hth,ii) Hedge2=0 if Med{P(i+1, j−
2), P(i+1, j−
1), P(i+1, j)}−
Med{P(i+1, j), P(i+1, j+1), P(i+1, j+2)}|<
Hth,iii) Vedge=0 if |Med{P(i, j−
1), P(i, j), P(i, j+1)}−
Med{P(i+1, j−
1), P(i+1, j), P(i+1, j+1)}|<
Vth,where Vcor=NOT(Hedge1 XOR Hedge2 OR Vedge).
-
-
9. An apparatus of claim 1, wherein the interpolation unit comprises:
-
a soft switch which mixes the output value of the edge detector and the output of the motion extender, and outputs the mixed value to appropriately interpolate a pixel value; and
a vertical line converter which converts a number of vertical lines to conform with a required display format, by using data of the current interlaced field and interpolated pixels from the soft switch, and outputs a non-interlaced field.
-
-
10. An apparatus of claim 1, further comprising a median filter which eliminates a noise component in the motion detected by the combiner, groups portions with motion and outputs the result to the motion extender.
-
11. A method for deinterlacing digital image comprising:
-
(a) calculating a BPPD value and a BD value between a current interlaced field and a previous interlaced field;
(b) limiting the BD and BPPD values respectively by a threshold value, mapping the limited BD and BPPD values to preset levels, comparing the magnitudes and deciding a presence and extent of motion to output detected motion;
(c) extending an effect of the detected motion to pixels adjacent to a pixel to be interpolated;
(d) detecting an edge direction around the pixel to be interpolated; and
(e) interpolating the pixel according to an edge direction and a value from (c), and outputting a non-interlaced field. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
13. A method of claim 12, wherein the value of Med45, Med0, and Med−
- 45 are each compared with either an identical threshold value or respectively compared with three different threshold values, and an edge direction is determined to be present in at least one direction corresponding to the values Med45, Med0, and Med−
45 depending upon the comparison.
- 45 are each compared with either an identical threshold value or respectively compared with three different threshold values, and an edge direction is determined to be present in at least one direction corresponding to the values Med45, Med0, and Med−
-
14. A method of claim 12, wherein the values of Med45, Med0, and Med−
- 45 are each compared to a threshold value Eth as follows;
If Med45<
Eth, edge45°
=0 else edge45°
=Med45If Med0<
Eth, edge0°
=0 else edge0°
=Med0If Med−
45<
Eth, edge−
45°
=0 else edge−
45°
=Med−
45and a edge direction corresponding to a minimum value among edge45°
, edge0°
, edge−
45°
is determined to be present.
- 45 are each compared to a threshold value Eth as follows;
-
15. A method of claim 14, wherein the edge direction is determined according to the following table where α
- <
β and
l*m*n,
- <
-
16. A method of claim 14, wherein a pixel is interpolated according to the following table,
-
17. A method of claim 11, wherein in (d) further obtaining a local correlation around a pixel to be interpolated and wherein in (e) interpolating according to the edge direction, a local correlation and the value from (c).
-
18. A method of claim 17, wherein the local correlation is obtained using one of three methods below, where Vth indicates a vertical direction threshold, Hth represent a horizontal direction threshold, and Vcor=0 indicates a local correlation in a vertical direction:
-
(1) Vcor=1 if Med{|P(i, j−
1)−
P(i+1, j−
1)|, |P(i, j)−
P(i+1, j)|, |P(i, j+1)−
P(i+1, j+1)|}<
Vth;
(2) Vcor=1 if |Med{P(i, j−
1), P(i, j), P(i, j+1)}−
Med{P(i+1, j−
1), P(i+1, j), P(i+1, j+1)}|<
Vth;
or(3) i) Hedge1=0 if |Med{P(i, j−
2), P(i, j−
1), P(i, j)}−
Med{P(i, j), P(i, j+1), P(i, j+2)}|<
Hth,ii) Hedge2=0 if Med{P(i+1, j−
2), P(i+1, j−
1), P(i+1, j)}−
Med{P(i+1, j), P(i+1, j+1), P(i+1, j+2)}|<
Hth,iii) Vedge=0 if |Med{P(i, j−
1), P(i, j), P(i, j+1)}−
Med{P(i+1, j−
1), P(i+1, j), P(i+1, j+1)}|<
Vth,where Vcor=NOT(Hedge1 XOR Hedge2 OR Vedge).
-
-
19. A method of claim 11, wherein (e) comprises:
-
mixing the edge direction and the value from (c), and outputting the mixed value to appropriately interpolate a pixel value; and
converting a number of vertical lines to conform with a required display format, by using data of the current interlaced field and interpolated pixels from the soft switch, and outputting a non-interlaced field.
-
-
20. A method of claim 11, further comprising eliminating a noise component in the detected motion in (b) and grouping portions with motion.
Specification