Method for generating masking image using general polygonal mask

• US 9,530,231 B2
• Filed: 03/05/2015
• Issued: 12/27/2016
• Est. Priority Date: 03/05/2015
• Status: Active Grant

• Current Assignee: Novatek Microelectronics Corporation (Novatek Microelectronics Corp Limited)
• Original Assignee: Novatek Microelectronics Corporation (Novatek Microelectronics Corp Limited)
• Inventors: Wang, Shiang-Fei, Liou, Chi-Fan, Kao, Jau-Hong, Wu, Yi-Jen, Lin, Chih-Huang, Chu, Min-Hui, Chen, Hong-Chu
• Primary Examiner(s): McCulley, Ryan D
• Application Number:
  US14/639,124
• Publication Number:
  US 20160260235A1
• Time in Patent Office: 663 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06T 11/00 2D [Two Dimensional] image generation
• CPC Class Codes: G06T 11/40 Filling a planar surface by adding surface attributes, e.g. colour or texture
• CPC Class Codes: G06T 15/405 using Z-buffer
• CPC Class Codes: G06T 2200/12 involving antialiasing
• CPC Class Codes: G08B 13/19606 Discriminating between target movement or movement in an area of interest and other non-signicative movements, e.g. target movements induced by camera shake or movements of pets, falling leaves, rotating fan

Abstract

A method for generating masking image using general polygonal mask includes receiving a pixel of a raw image and a polygon vertices array corresponding to a polygonal mask, determining whether the pixel is inside the polygonal mask, labeling the pixel to be a masked pixel if the pixel is inside the polygonal mask, or labeling the pixel to be a visible pixel if the pixel is outside the polygonal mask, and outputting the masked pixel or the visible pixel to generate the masking image.

Claims

1. A method for generating a masking image using a general polygonal mask, comprising:

receiving a pixel of a raw image and a polygon vertices array corresponding to a polygonal mask;

determining whether the pixel is inside the polygonal mask;

labeling the pixel to be a masked pixel if the pixel is inside the polygonal mask, or labeling the pixel to be a visible pixel if the pixel is outside the polygonal mask; and

outputting the masked pixel or the visible pixel to generate the masking image;

wherein determining whether the pixel is inside the polygonal mask comprises;

setting two consecutive vertices of the polygon vertices array to be a start point and a terminal point according to an indication, wherein the indication is one of numbers from zero to a number of edges of the polygonal mask;

checking if the pixel is bounded by the start and terminal points in a first dimension;

determining if the pixel is at a left side of a first vector according to a cross product and a direction of the first vector if the pixel is bounded by the start and terminal points in the first dimension;

increasing a count by one if the pixel is at the left side of the first vector;

checking whether relative locations between the pixel and all the edges of the polygonal mask are determined; and

checking if the count is odd to determine whether the pixel is inside the polygonal mask if the relative locations between the pixel and all the edges of the polygonal mask are checked.

2. The method of claim 1, wherein determining whether the pixel is inside the polygonal mask comprises:

determining whether the pixel is inside the polygonal mask according to the count of a function of;

3. The method of claim 2, wherein the pixel is inside the polygonal mask if the count is odd, and the count is a function of:

4. The method of claim 1, wherein checking whether the relative locations between the pixel and all the edges of the polygonal mask are determined comprises:

checking if the terminal point is a last vertex of the polygon vertices array if the pixel is not bounded by the first vector, if the cross product is smaller than zero, and after the count is increased by one; and

increasing the indication by one if the terminal point is not the last vertex of the polygon vertices array to reset the start and terminal points according to the indication.

5. The method of claim 1, wherein the pixel is inside the polygonal mask if the count is odd, and the pixel is outside the polygonal mask if the count is even.

6. The method of claim 1, further comprising:

setting the count to be zero when receiving the pixel of the raw image and the polygon vertices array corresponding to the polygonal mask.

7. The method of claim 1, wherein determining if the pixel is at the left side of the first vector according to the cross product and the direction of the first vector comprises:

determining a direction of the first vector by comparing coordinates of the start and terminal points in the first dimension;

computing the cross product according to a function of;

RC=(X_T−

X)*(Y_T−

Y_S)−

(X_T−

X_S)*(Y_T−

Y) if the first vector directs a first direction, wherein RC is the cross product, X, X_S and X_T are coordinates of the pixel, the start and terminal points in a second dimension, and Y, Y_S and Y_T are coordinates of the pixel, the start and terminal points in the first dimension;

computing the cross product according to a negative of the function if the first vector directs a second direction; and

checking if the cross product is greater than zero to determine if the pixel is at the left side of the first vector,

wherein the pixel is at the left side of the first vector if the cross product is greater than zero, and the pixel is at a right side of the first vector if the cross product is smaller than zero.

8. The method of claim 1, wherein determining if the pixel is at the left side of the first vector according to the cross product and the direction of the first vector comprises:

determining a direction of the first vector by comparing coordinates of the start and terminal points in the first dimension;

checking if a former item (X_T−

X)*(Y_T−

Y_S) is greater than a later item (X_T−

X_S)*(Y_T−

Y) if the first vector directs a first direction, wherein the pixel is at the left side of the first vector if the former item is greater than the later item; and

checking if the former item (X_T−

X)*(Y_T−

Y_S) is smaller than a later item (X_T−

X_S)*(Y_T−

Y) if the first vector directs a second direction, wherein the pixel is at the left side of the first vector if the former item is smaller than the later item,

wherein X, X_S and X_T are coordinates of the pixel, the start and terminal points in a second dimension, and Y, Y_S and Y_T are coordinates of the pixel, the start and terminal points in the first dimension.