CN1533181A - Corresponding point information compressing method and device - Google Patents
Corresponding point information compressing method and device Download PDFInfo
- Publication number
- CN1533181A CN1533181A CNA2004100297103A CN200410029710A CN1533181A CN 1533181 A CN1533181 A CN 1533181A CN A2004100297103 A CNA2004100297103 A CN A2004100297103A CN 200410029710 A CN200410029710 A CN 200410029710A CN 1533181 A CN1533181 A CN 1533181A
- Authority
- CN
- China
- Prior art keywords
- mentioned
- pixel
- grid
- image
- file
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 230000011218 segmentation Effects 0.000 claims description 9
- 238000003709 image segmentation Methods 0.000 claims description 2
- 230000006835 compression Effects 0.000 description 8
- 238000007906 compression Methods 0.000 description 8
- 230000008030 elimination Effects 0.000 description 2
- 238000003379 elimination reaction Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 239000000654 additive Substances 0.000 description 1
- 230000000996 additive effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/10—Segmentation; Edge detection
- G06T7/11—Region-based segmentation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding
- G06T9/40—Tree coding, e.g. quadtree, octree
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Signal Processing (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The method includes a step which, regarding a first pixel, reads a primitive map file MFA to describe a corresponding pixel in a second image relatively closely and a step for dividing the first image into mesh, compressing the primitive map file by leaving the corresponding picture element only with regard to a pixel corresponding to a vertex of each mesh, and generating a simplified map file MFB to describe the corresponding pixel relatively roughly. The step for generation has a step for dividing the mesh irregularly and subdividing the mesh so that errors caused by differences between the primary map file and the simplified map file are reduced.
Description
Technical field
The present invention relates to the corresponding points compressionism, particularly the method and apparatus of the corresponding points information between compressed image.
Background technology
When the activity compression view data, known have by detecting with the corresponding points between the picture frame that separates in time to a certain degree, and based on this corresponding points information, interpolation generates between picture frame, the technology of getting picture frame between coming thus.No. 2927350 communique of Japan Patent (in full) (patent documentation 1) is exactly the technology of this respect.In addition, the picture frame that former state is utilized for getting between not carrying out is hereinafter referred to as " key frame ", for the picture frame that generates by the interpolation between key frame, hereinafter referred to as " intermediate frame ".
In patent documentation 1, between key frame, detect the corresponding points of pixel unit, the amount of information of corresponding points is bigger.Get between also can considering simply it to be carried out, but in this case, can become compromise (trade-off) certainly with the intermediate frame picture element.
Summary of the invention
The present invention finishes in view of these actual conditions, and purpose is to provide a kind of technology that can reduce the corresponding points amount of information and keep the intermediate frame picture element.
First technical scheme of the present invention provides a kind of compression method that relates to corresponding points information, comprising: read step, read in the original transform file of more thickly recording and narrating about respective pixel pixel, in its 2nd image of the 1st image; Generate step, the 1st image is carried out grid cut apart, only the pixel that is positioned at each grid vertex is kept respective pixel, compress the original transform file thus, generate the summary change file of recording and narrating respective pixel thinly; Wherein, above-mentioned generation step is non-cuts apart above-mentioned grid canonically.
Above-mentioned generation step can be with above-mentioned grid sectionalization, the feasible caused error of difference that reduces summary change file and original transform file.Grid is cut apart in field that can be bigger to above-mentioned error once more.
Above-mentioned generation step can become the 1st image segmentation on two triangles, carries out the processing cut apart once more by the predetermined triangle of cutting apart in the triangle that obtains repeatedly, generates above-mentioned grid thus.Can select the above-mentioned predetermined triangle of conduct that error is bigger in this delta-shaped region.Above-mentioned error can be when the position of the respective pixel of drawing non-summit pixel from the respective pixel of above-mentioned predetermined leg-of-mutton 3 summit pixels, obtains as the error of the original position of the respective pixel of derivative position and above-mentioned non-summit pixel.
When cutting apart triangle, when newly-generated vertex of a triangle places on other leg-of-mutton limits when being cut apart by this, cut apart this other triangles, any one triangle is all maintained the state that does not have other vertexs of a triangle on its limit.
Second technical scheme of the present invention provides a kind of compression method that relates to corresponding points information, comprising: read step, read in the original transform file of more thickly recording and narrating about respective pixel pixel, in its 2nd image of the 1st image; Generate step, the 1st image is carried out grid cut apart, only the pixel that is positioned at each grid vertex is kept respective pixel, compress the original transform file thus, generate the summary change file of recording and narrating respective pixel thinly; Wherein, above-mentioned generation step until satisfying predetermined condition, with regard to the resulting grid of its result, generates above-mentioned summary change file to above-mentioned grid sectionalization.
As above-mentioned predetermined condition, can be set at: the caused error of difference of summary change file and original transform file falls in the predetermined threshold value; The number of regions of being cut apart by grid falls in the predetermined threshold value; The size of data of summary change file falls in the predetermined threshold value; The segmentation times that is used for above-mentioned sectionalization falls in the predetermined threshold value.
The 3rd technical scheme of the present invention provides a kind of compression set that relates to corresponding points information, comprising: input unit, read in the original transform file of more thickly recording and narrating about respective pixel pixel, in its 2nd image of the 1st image; Control unit carries out grid to the 1st image and cuts apart, and only the pixel that is positioned at each grid vertex is kept respective pixel, compresses the original transform file thus, generates the summary change file of recording and narrating respective pixel thinly; Wherein, above-mentioned control unit is non-cuts apart above-mentioned grid canonically.
The 4th technical scheme of the present invention provides a kind of compression set that relates to corresponding points information, comprising: input unit, read in the original transform file of more thickly recording and narrating about respective pixel pixel, in its 2nd image of the 1st image; Control unit carries out grid to the 1st image and cuts apart, and only the pixel that is positioned at each grid vertex is kept respective pixel, compresses the original transform file thus, generates the summary change file of recording and narrating respective pixel thinly; Wherein, above-mentioned control unit until satisfying predetermined condition, with regard to the resulting grid of its result, generates above-mentioned summary change file to above-mentioned grid sectionalization.
Description of drawings
Fig. 1 is the figure of structure of the corresponding points information generation device of expression execution mode.
Fig. 2 is the figure of the structure of expression original transform (map) file MFA.
Fig. 3 is the step of corresponding informance is derived in expression by interpolation figure.
Fig. 4 is the figure of expression grid segmentation procedure.
Fig. 5 is the figure of expression grid segmentation procedure.
Fig. 6 is the figure of expression grid segmentation procedure.
Fig. 7 is the figure of expression grid segmentation procedure.
Fig. 8 is the figure of expression grid segmentation procedure.
Fig. 9 is the figure of expression grid segmentation procedure.
Figure 10 is the figure of expression grid segmentation procedure.
Figure 11 is the figure that represents the structure of the summary change file MFB that finally obtains.
Figure 12 is the figure that the step of isolated vertex is eliminated in expression.
Figure 13 is the figure that the step of isolated vertex is eliminated in expression.
Embodiment
Fig. 1 represents the structure of the corresponding points information generation device 10 of execution mode.This device 10 comprises the holding unit 18 of preserving key frame KF1, KF2, between key frame KF1, KF2, carry out images match and generation and recorded and narrated the matched-field processors 22 of the original transform file MFA of corresponding points information, and the compression set 12 of compression original transform file MFA.
Compression set 12 comprises the input unit 14 of input original transform file MFA and original transform file MFA is compressed the control unit 16 of processing.
Mate between the image that is undertaken by matched-field processors 22, can adopt the matching process of pixel unit of use singular point of the applicant's for example No. the 2927350th, Japan Patent.But, also can utilize light stream additive methods such as (optical flow) in addition.
Original transform file MFA is with the correspondence between density record pixel to a certain degree.Here about each pixel of the 1st key frame KF1, it is corresponding with which pixel of the 2nd key frame KF2 to record and narrate its pixel with motion vector.
Fig. 2 represents the structure of original transform file MFA.(how i j) moves to corresponding pixel in the 2nd key frame KF2 to represent each pixel p with vector vij.For example, when the pixel of the coordinate (20,17) of the pixel of the coordinate of the 1st key frame KF1 (10,15) and the 2nd key frame KF2 was corresponding, the vector of this pixel was recorded and narrated and is (10 ,-2).
Original transform file MFA promptly has corresponding informance for all pixels for all points.But control unit 16 is defined as a part by the pixel that will have corresponding informance, generates summary change file MFB.The pixel that will have corresponding informance is called " independent pixel ".The corresponding informance of the pixel (being called " subordinate pixel ") beyond the independent pixel can be tried to achieve with interpolation from the corresponding informance of independent pixel where necessary.When utilizing this interpolation to ask for the corresponding informance of subordinate pixel, certain hope is the smaller the better with the error of the corresponding informance that this subordinate pixel is had in original transform file MFA at first.For this reason, 16 pairs of these errors of control unit are estimated, and determine independent pixel so that error diminishes.
Fig. 3 schematically shows original transform file MFA integral body.In order to estimate error, express the summary of interpolation.Now, MFA is used as image the original transform file, with central oblique line it is divided into two triangles.In the figure, the vertex of a triangle A of upside, B, C are corresponding with the pixel that is positioned at this position respectively, as corresponding informance separately, have vector va, vb, vc.For triangle ABC, independent pixel has only 3 points of ABC.Obtain the vector vp of arbitrfary point P with following formula.
vp＝Sa·va+Sb·vb+Sc·vc
Sa, Sb, Sc are respectively the area of triangle PBC, PAC, PAB, are normalized to Sa+Sb+Sc=1.The absolute value of the vp that tries to achieve like this, be expressed as the error " Ep " of a P with the difference of the vector vp_original that in original transform file MFA, had of some P.
Evaluation is as the error of triangle ABC integral body.During evaluation, some P all in the diabolo ABC calculate Ep, with " the error assessment value " of its maximum as triangle ABC, below the error assessment value are called leg-of-mutton " energy ".But, energy can also be with the absolute value of the error of a had P average or on average waiting of its square replace.
The generation of summary change file MFB is carried out under pushing up extremely.That is, suppose MIN independent pixel at first,,, make the grid sectionalization from big the cutting apart again successively of its energy for the triangle of forming by these independent pixels that grid comprised.The summit of grid is added as independent pixel.The condition that stops sectionalization is:
1. by the caused error of difference of summary change file MFB and original transform file MFA, promptly the leg-of-mutton ceiling capacity that comprised of this moment grid falls in the predetermined threshold value
2. the leg-of-mutton quantity that grid comprised falls in the predetermined threshold value
3. the size of data of summary change file MFB falls in the predetermined threshold value
4. the number of times of cutting apart that is used for sectionalization falls into predetermined threshold value with interior etc.
Fig. 4 represents the 1st time cut apart (S10).Utilize main line ml, original transform file MFA is divided into two triangles.For simplicity, triangle is expressed as L, R respectively up and down.Fig. 5 represents later to cut apart the rule that the triangle that is presented is given L, R to the 2nd time, and when making hypotenuse with right-angled triangle place the below, getting the little triangle in the right is R, and the left side is L.
Fig. 6 represents the 2nd time cut apart (S12).The triangle of being cut apart has ceiling capacity constantly at this.Here suppose that triangle R has ceiling capacity, cuts apart it.As a result, the triangle from triangle R produces a half-size scale is expressed as triangle RR, RL respectively.
At this constantly, shown in a P1, the summit of grid appears on the hypotenuse of triangle L.If other vertexs of a triangle (such summit is called isolated vertex) on leg-of-mutton limit, occur, inconvenience will be produced in the interpolation afterwards.That is,, carry out interpolation from its 3 summits for triangle L, but for triangle RR, RL, owing to carry out interpolation respectively from the summit that comprises a P1, so just produce discontinuous interpolation result at a P1.Therefore, when certain vertex of a triangle appeared on other leg-of-mutton limits, control unit 16 was just cut apart above-mentioned other triangles, does not exist up to this isolated vertex.In Fig. 6, image pattern 7 is such, utilizes some P2 that triangle L is divided into triangle LL and LR (S14).
Fig. 8 represents cut apart (S16) again.Here putting P3 is added and is that independent pixel, triangle RL are split into two triangle RLL and RLR.Fig. 9 also is same processing (S18), and triangle RLR is split into triangle RLRR and RLRL.Here, be isolated vertex owing to put P4, so as shown in Figure 10, by following processing (S20), set-point P5 is cut apart triangle LRR and LRL, and the latter further is divided into triangle LRLL and LRLR again.
Figure 11 represents leg-of-mutton cutting apart with tree structure.Initial zero is tree root, generates L and R in S10, generates L and R below the R in S12, below carries out equally.Judge that isolated vertex is very simple on handling, the stage (its implication is the 1st grade, represents with ST1) in the layers 1 and 2 that forms tree, if continuing, node is L → L or R → R, the path after then will being reversed to the L in this path and R is appended on the tree.This has utilized and has clipped the fact that main line mlL and R occur symmetrically.In Figure 11,, be R → R owing to continue, so append L → L at ST1.This path is equivalent to the elimination of isolated vertex among the S14, and appending of path is illustrated among Figure 12.
Equally, forming the stage ST2 of the 3rd layer and the 4th layer, because the rightmost path of Figure 11 produces R → R, so " L → R → L → L " after " R → L → R → R " as this path integral body reversed appends as shown in Figure 13.This is equivalent to eliminate the isolated vertex among the S20.In addition, when cutting apart triangle, just carry out the elimination of isolated vertex.
If isolated vertex is eliminated the processing vague generalization, then the leaf of tree is from behind promptly reviewed more simple, as follows from end.But the odd even of layer is deferred to Figure 11.
" review from the leaf of tree, from the odd-level of even level to last layer, when continuing to R → R or L → L, then append make that these two nodes and this path comprised than the L of all nodes of these two more close tree root sides of node and the path after the R counter-rotating.”
In addition, the final like this tree that obtains can utilize known method, for example, by from last and from the order on the left side, adopts " node that child is arranged is 0 ", and " node as leaf is 1 " encodes.If with this coded data and by the sequence arrangement that in tree, is encoded the data of corresponding informance of node merged, just become summary change file MFB.
Claims (14)
1. a corresponding points information compressing method is characterized in that, comprising:
Read step is read in the original transform file of more thickly recording and narrating about respective pixel pixel, in its 2nd image of the 1st image;
Generate step, the 1st image is carried out grid cut apart, only the pixel that is positioned at each grid vertex is kept respective pixel, compress the original transform file thus, generate the summary change file of recording and narrating respective pixel thinly;
Wherein, above-mentioned generation step is non-cuts apart above-mentioned grid canonically.
2. corresponding points information compressing method according to claim 1 is characterized in that:
Above-mentioned generation step is above-mentioned grid sectionalization, makes the caused error of difference that reduces summary change file and original transform file.
3. corresponding points information compressing method according to claim 2 is characterized in that:
Grid is cut apart in the field bigger to above-mentioned error once more.
4. corresponding points information compressing method according to claim 1 is characterized in that:
Above-mentioned generation step becomes two triangles with the 1st image segmentation, carries out the processing cut apart once more by the predetermined triangle of cutting apart in the triangle that obtains repeatedly, generates above-mentioned grid thus.
5. corresponding points information compressing method according to claim 4 is characterized in that:
Select the above-mentioned predetermined triangle of conduct that error is bigger in this delta-shaped region.
6. corresponding points information compressing method according to claim 5 is characterized in that:
Above-mentioned error when the position of the respective pixel of drawing non-summit pixel from the respective pixel of above-mentioned predetermined leg-of-mutton 3 summit pixels, is obtained as the error of the original position of the respective pixel of derivative position and above-mentioned non-summit pixel.
7. corresponding points information compressing method according to claim 4 is characterized in that:
When cutting apart triangle, when newly-generated vertex of a triangle places on other leg-of-mutton limits when being cut apart by this, cut apart this other triangles, any one triangle is all maintained the state that does not have other vertexs of a triangle on its limit.
8. a corresponding points information compressing method is characterized in that, comprising:
Read step is read in the original transform file of more thickly recording and narrating about respective pixel pixel, in its 2nd image of the 1st image;
Generate step, the 1st image is carried out grid cut apart, only the pixel that is positioned at each grid vertex is kept respective pixel, compress the original transform file thus, generate the summary change file of recording and narrating respective pixel thinly;
Wherein, above-mentioned generation step until satisfying predetermined condition, with regard to the resulting grid of its result, generates above-mentioned summary change file to above-mentioned grid sectionalization.
9. corresponding points information compressing method according to claim 8 is characterized in that:
The caused error of difference of setting summary change file and original transform file falls in the predetermined threshold value, as above-mentioned predetermined condition.
10. corresponding points information compressing method according to claim 8 is characterized in that:
The number of regions that setting is cut apart by grid falls in the predetermined threshold value, as above-mentioned predetermined condition.
11. corresponding points information compressing method according to claim 8 is characterized in that:
The size of data of setting the summary change file falls in the predetermined threshold value, as above-mentioned predetermined condition.
12. corresponding points information compressing method according to claim 8 is characterized in that:
The segmentation times that setting is used for above-mentioned sectionalization falls in the predetermined threshold value, as above-mentioned predetermined condition.
13. a corresponding points information compressor is characterized in that, comprising:
Input unit reads in the original transform file of more thickly recording and narrating about respective pixel pixel, in its 2nd image of the 1st image;
Control unit carries out grid to the 1st image and cuts apart, and only the pixel that is positioned at each grid vertex is kept respective pixel, compresses the original transform file thus, generates the summary change file of recording and narrating respective pixel thinly;
Wherein, above-mentioned control unit is non-cuts apart above-mentioned grid canonically.
14. a corresponding points information compressor is characterized in that, comprising:
Input unit reads in the original transform file of more thickly recording and narrating about respective pixel pixel, in its 2nd image of the 1st image;
Control unit carries out grid to the 1st image and cuts apart, and only the pixel that is positioned at each grid vertex is kept respective pixel, compresses the original transform file thus, generates the summary change file of recording and narrating respective pixel thinly;
Wherein, above-mentioned control unit until satisfying predetermined condition, with regard to the resulting grid of its result, generates above-mentioned summary change file to above-mentioned grid sectionalization.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP086636/2003 | 2003-03-26 | ||
| JP2003086636A JP2004297416A (en) | 2003-03-26 | 2003-03-26 | Method and device for compressing information on corresponding point |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1533181A true CN1533181A (en) | 2004-09-29 |
| CN1279762C CN1279762C (en) | 2006-10-11 |
Family
ID=33401206
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100297103A Expired - Fee Related CN1279762C (en) | 2003-03-26 | 2004-03-22 | Corresponding point information compressing method and device |
Country Status (3)
| Country | Link |
|---|---|
| JP (1) | JP2004297416A (en) |
| KR (1) | KR100647803B1 (en) |
| CN (1) | CN1279762C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020259372A1 (en) * | 2019-06-24 | 2020-12-30 | 杭州海康威视数字技术股份有限公司 | Coding and decoding method, apparatus and devicethereof |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7660475B2 (en) | 2004-12-22 | 2010-02-09 | Ntt Docomo, Inc. | Method and apparatus for coding positions of coefficients |
| EP3207699B1 (en) | 2014-11-14 | 2021-06-09 | Huawei Technologies Co., Ltd. | Systems and methods for processing a block of a digital image |
| JP6664819B2 (en) | 2014-11-14 | 2020-03-13 | ホアウェイ・テクノロジーズ・カンパニー・リミテッド | System and method for mask-based processing of blocks of digital images |
| CN108293125B (en) | 2014-11-14 | 2020-08-07 | 华为技术有限公司 | Digital image processing system and method |
-
2003
- 2003-03-26 JP JP2003086636A patent/JP2004297416A/en active Pending
-
2004
- 2004-03-22 CN CNB2004100297103A patent/CN1279762C/en not_active Expired - Fee Related
- 2004-03-25 KR KR20040020420A patent/KR100647803B1/en not_active IP Right Cessation
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020259372A1 (en) * | 2019-06-24 | 2020-12-30 | 杭州海康威视数字技术股份有限公司 | Coding and decoding method, apparatus and devicethereof |
Also Published As
| Publication number | Publication date |
|---|---|
| KR20040084847A (en) | 2004-10-06 |
| JP2004297416A (en) | 2004-10-21 |
| CN1279762C (en) | 2006-10-11 |
| KR100647803B1 (en) | 2006-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10657689B2 (en) | Method and apparatus for point cloud color processing | |
| CN1130919C (en) | Apparatus for encoding contour of regions contained in video signal | |
| CN1681330B (en) | Adaptive 2n-ary tree generating method, and method and apparatus for encoding and decoding 3d volume data using it | |
| RU2267161C2 (en) | Method for encoding and decoding given three-dimensional objects and device for realization of said method | |
| KR20120009605A (en) | Apparatus and method for scalable encoding 3d mesh, and apparatus and method for scalable decoding 3d mesh | |
| JPH07154784A (en) | Channel error correction method for video signal by quantization of classified vector | |
| CN115428459A (en) | Video-based mesh compression | |
| US11151748B2 (en) | 3D point cloud data encoding/decoding method and apparatus | |
| KR20060087647A (en) | Single-rate connectivity codec for triangle meshes | |
| KR20060088136A (en) | Single-rate connectivity codec for quad meshes | |
| TW202037169A (en) | Method and apparatus of patch segmentation for video-based point cloud coding | |
| CN1279762C (en) | Corresponding point information compressing method and device | |
| JP2002058031A (en) | Method and apparatus for encoding image as well as method and apparatus for decoding image | |
| Salahieh et al. | Test model 8 for MPEG immersive video | |
| Schiopu et al. | Lossy depth image compression using greedy rate-distortion slope optimization | |
| WO2022126333A1 (en) | Image filling method and apparatus, decoding method and apparatus, electronic device, and medium | |
| JPH07154783A (en) | Class error detection method for video signal by quantization of classified vector | |
| JP2023541271A (en) | High density mesh compression | |
| WO2020207186A1 (en) | Method for generating shape id listing employing video file format | |
| JP2022187683A (en) | Data compression/decompression system and method | |
| Vidhya et al. | Kriging interpolation technique with triangulated irregular network for image compression using image inpainting | |
| WO2021108970A1 (en) | Point cloud processing method, encoder, decoder and storage medium | |
| KR0169662B1 (en) | A classified pts vq encoder | |
| CN116711301A (en) | Virtual viewpoint generating, rendering and decoding methods and devices, equipment and storage medium | |
| CN113822815B (en) | Method and apparatus for high performance picture clutter removal using GPU rendering |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C56 | Change in the name or address of the patentee |
Owner name: JIANFEI CO., LTD. Free format text: FORMER NAME OR ADDRESS: TELFI HOLDINGS LTD. |
|
| CP03 | Change of name, title or address |
Address after: Jersey, England Patentee after: Telfey Holding Co., Ltd. Address before: Jersey, England Patentee before: Delphi Holdings Inc. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: CO., LTD. TORREMOLINOS Free format text: FORMER OWNER: JIANFEI CO., LTD. Effective date: 20080516 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20080516 Address after: Tokyo, Japan, Japan Patentee after: Monolith Co., Ltd. Address before: Jersey, England Patentee before: Telfey Holding Co., Ltd. |
|
| ASS | Succession or assignment of patent right |
Owner name: JBF PARTENERSHIP CO., LTD. Free format text: FORMER OWNER: CO., LTD. TORREMOLINOS Effective date: 20080704 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20080704 Address after: Tokyo, Japan, Japan Patentee after: JBF KK Address before: Tokyo, Japan, Japan Patentee before: Monolith Co., Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20061011 Termination date: 20160322 |