TW201141212A - Video data processing system - Google Patents
Video data processing system Download PDFInfo
- Publication number
- TW201141212A TW201141212A TW99127216A TW99127216A TW201141212A TW 201141212 A TW201141212 A TW 201141212A TW 99127216 A TW99127216 A TW 99127216A TW 99127216 A TW99127216 A TW 99127216A TW 201141212 A TW201141212 A TW 201141212A
- Authority
- TW
- Taiwan
- Prior art keywords
- frame
- scaling
- movie
- film
- frames
- Prior art date
Links
- 238000012545 processing Methods 0.000 title claims abstract description 24
- 238000000034 method Methods 0.000 claims abstract description 44
- 230000008569 process Effects 0.000 claims abstract description 11
- 230000000007 visual effect Effects 0.000 claims description 13
- 239000013598 vector Substances 0.000 claims description 11
- 238000005457 optimization Methods 0.000 claims description 9
- 238000005520 cutting process Methods 0.000 claims description 8
- 238000009826 distribution Methods 0.000 claims description 8
- 238000009499 grossing Methods 0.000 claims description 4
- 230000003287 optical effect Effects 0.000 claims description 4
- 230000002123 temporal effect Effects 0.000 claims description 3
- 238000013139 quantization Methods 0.000 claims description 2
- 240000000233 Melia azedarach Species 0.000 claims 1
- 230000008676 import Effects 0.000 claims 1
- 230000006870 function Effects 0.000 description 18
- 230000033001 locomotion Effects 0.000 description 12
- 230000008859 change Effects 0.000 description 10
- 238000005516 engineering process Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 239000000463 material Substances 0.000 description 6
- 238000012360 testing method Methods 0.000 description 6
- 238000002474 experimental method Methods 0.000 description 5
- 238000003672 processing method Methods 0.000 description 5
- 238000003860 storage Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 3
- 238000006243 chemical reaction Methods 0.000 description 3
- 239000011159 matrix material Substances 0.000 description 3
- 229920001690 polydopamine Polymers 0.000 description 3
- 238000011002 quantification Methods 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 230000008094 contradictory effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 230000009466 transformation Effects 0.000 description 2
- 241000251468 Actinopterygii Species 0.000 description 1
- 244000144730 Amygdalus persica Species 0.000 description 1
- 241000255925 Diptera Species 0.000 description 1
- AFCARXCZXQIEQB-UHFFFAOYSA-N N-[3-oxo-3-(2,4,6,7-tetrahydrotriazolo[4,5-c]pyridin-5-yl)propyl]-2-[[3-(trifluoromethoxy)phenyl]methylamino]pyrimidine-5-carboxamide Chemical compound O=C(CCNC(=O)C=1C=NC(=NC=1)NCC1=CC(=CC=C1)OC(F)(F)F)N1CC2=C(CC1)NN=N2 AFCARXCZXQIEQB-UHFFFAOYSA-N 0.000 description 1
- 244000046052 Phaseolus vulgaris Species 0.000 description 1
- 235000010627 Phaseolus vulgaris Nutrition 0.000 description 1
- 235000006040 Prunus persica var persica Nutrition 0.000 description 1
- 241000124033 Salix Species 0.000 description 1
- 206010044565 Tremor Diseases 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 230000003796 beauty Effects 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 210000000936 intestine Anatomy 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 239000000779 smoke Substances 0.000 description 1
- 239000002023 wood Substances 0.000 description 1
Landscapes
- Studio Devices (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- User Interface Of Digital Computer (AREA)
- Image Processing (AREA)
Abstract
Description
201141212 六、發明說明: 【發明所屬之技術領域】 本發明提供-種影片資料處理系統,係實現 之處理方法,特別地,此處理方法為—種 片縮放之處理方法及其運用此處理方:ϊ 相關裝置、電路的應用說明。 乃次之 I先前技術】 由純在科技發展卓越,將圖片與 縮放改變其解析度是-重要課題, 二ί下ί者各種^同_放格式,像是手機、PDAs、寬螢幕 筆記型電腦等等。而像是如手機、pDAs此“= ,式裝置上由於具有較小的螢幕及所播放關片鱼影 會不同’故’所要求的螢幕解析度會較高。目前 依據—目標螢幕尺寸大小,對圖片及影片均勻 地^^缩放或裁切左右兩邊之内容,以達到預定寬高比例^ ^疋簡單雜職纽成影像内容扭曲失真,而裁切合 ^除些位於影像邊緣之重要物體資訊。因此,近年來有學| =以内容為主之縮放技術,採用非等比例扭曲變形來 =和影#所需要的尺寸格式,鱗人麵倾官上較重要 内谷之形狀比例,並且將扭曲失真隱藏在較不重要區域。 近年來,藉由使用非等比例扭曲變形或基於片段 (segmentation-based)組成而達成内容感知圖片與影片重建亦 趨成熟。可惜地,前者存有影像失真的缺陋,後者 的圖片與片段的影片的出現。 然而,對於影片重新縮放基本上是不同於靜止的圖片縮 ,且不能完全解決問題只依靠現有圖片縮放處理方法加上 時間之限制。這個問題所存在之問題有兩項: (一)物體動作和時間動態是影片核心因素,必須明確地 处理,之前方法,影片中每幀重新縮放運算時,只沿著時間 201141212 生是無法處理具有複雜動作的影片且晝面會有 下,(:)當影片中重要物體涵蓋整張圖片時,在這種情況 2何·片内容為主之縮放技術皆受到關,對此 、’疋無法在沒有移除或扭曲變形重要内容下達成。 於於像是如手機、PDAs此類型的行動式農置上由 小的營幕及所播放的圖片與影片縮放比例會有不 =未亦麵處理方法及其運用此方法2 【發明内容】 現之一構想在於提供一種影片資料處理系統,传實 影片縮放之處理方法。在此專利的内容ί 標影片立二t二概比例目 ,的背景資訊仍 在不同縮放比例的要求下 ,採用此影片處^ 例問i揭是探討上面所述的範 兄服,、先刖技術(例如,此盧所;七、a 例的缺點。 U ^喊所述)所常相關範 存取=:it的裝置、系統、電腦可 序期間該至少-狀區域受影片重新標定程 ,露特定範例的程序能夠包括',例二根據本 框相關的視訊資料。 接收與至少一影片圖 用硬體處理配置,範例寇庠瀹处 —特定列(―及一)的 201141212 於:⑴與出現在-圖框中的資訊有關的内容,且 接下來的特定數目的圖框内消失,該接下 二=今 =寺;區域有關’及/或⑼包含與所述特定ΙίΪ= =導向前景物件的資訊。範例程序能夠進=關& 受保護而不被裁切。 以试匕域所迷特定區域 更包基純覺流量來絲,而範例程序 與母一貧訊相關像素相關聯的平均流量向旦,Ϊ 前框的任何特賴框中,資訊是否出現, 並 可 在ί續的j個圖框的任何-圖框中保持可ί:ί中:: 。未通過測試的該資訊可以被標記。基於與特i行 I的前旦2:;:ίΐ的資訊之流量相關聯的熵,顯著地移 定。使用量化的流量向量及/或基於流 行及進—步包括基於與超過—預定門插的特定 定的行及/或列。校流量熵,來選擇特 大可能_函數敎fm可岐赠量羽分布相關的最 片資發,某些實施例,範例程序可進—步包括在影 片立方體中ϊίί比例的次程序,其中特定區域在一目標影 來執行此I⑽μ。可使用至少暫時—朗*等比例函數’ 以促進相鄰序。—岭的頂點可以被限制, —基於最小平方^蚊目標函數和/或 頂點7包括辨認網格継位置,其中該網格 疋預疋鄰近區域之網格頂點的線性組合。變 作 201141212 包括列不之不等比例縮放子程序可使用一網格,豆 格可包tit 之欺方格,其中,該等特定方 竽特定至少一更進一步之至少時間軸上鄰接 格=有相同。且,可以使用-縮放= 之袼點和/或滑二窗n例縮放子程序可使用—像素水準 ㈣之糊罐置配置之ΐ 施^,例示過程電腦存取媒介和系統實 在此亦-例示處理影像#料以在影片 區域不等比例縮放之過程。例如,該2 括資 施例:包括’接收影片資料,其包 ^聯巴至域一之圖r出現和/或被 =特定數= ===移動前景物件之資訊來做成。該例= 步驟,其中挪定片貝抖上執行一不等比例縮放 形且受保護立方趙範圍内被變 明,將會更加清楚。田閱靖以下砰細例示實施例說 系想’本發明提供—種影片資料處理 式糸統’接收該系列晝面並執行⑷純包含 = 201141212 一影片;(b)界定包含—牲今广丄 立方體;⑹對該等圖拖區域之一預定縮放比例目標影片 等圖框符合該目標放’使得處理後的該 畫面之袼式。 體之大小比例以輸出另一系列 系統:構ί:本發明提供-種影片資料處理 -格式之-系列以 接收包含具-第 :例之三維影像以及(c)對該系列晝面進201141212 VI. Description of the Invention: [Technical Field] The present invention provides a film data processing system, which is a processing method implemented. In particular, the processing method is a processing method for a slice scaling and an application method thereof:应用 Application notes for related devices and circuits. It is the first technology of I. It is the development of pure technology, the change of the resolution of the picture and the zoom is an important topic, the two kinds of _ _ format, such as mobile phones, PDAs, wide-screen notebook computers and many more. For example, mobile phones, pDAs, etc., have a higher screen resolution due to the smaller screen and the different fish screens that are played. The current basis is based on the size of the target screen. Uniformly zoom or crop the left and right sides of the image and the movie to achieve the predetermined width and height ratio ^ ^ 疋 simple miscellaneous job into the image content distortion distortion, and cut and remove some important object information at the edge of the image. Therefore, in recent years, there has been learning | = content-based scaling technology, using the non-equal-scale distortion to = and the size format required by the shadow #, the scale of the face is more important than the shape of the inner valley, and will be distorted Distortion is hidden in less important areas. In recent years, content-aware images and video reconstruction have become more mature by using non-equal distortion or segmentation-based composition. Unfortunately, the former lacks image distortion. Hey, the latter's picture and the appearance of the clip's movie. However, re-scaling the movie is basically different from the still picture shrink, and can't completely solve the problem only rely on the present There are image scaling methods plus time limits. There are two problems with this problem: (1) object motion and time dynamics are the core elements of the film, and must be handled explicitly, before the method, re-scaling every frame in the movie Only along the time 201141212, it is impossible to process a movie with complex movements and there will be a lower face, (:) when the important object in the movie covers the entire picture, in this case 2 All of them are closed. In this regard, '疋 can't be achieved without removing or distorting the important content. For example, mobile phones, PDAs, this type of mobile farms are supported by small screens and pictures and videos. The scaling ratio may be no = no surface processing method and its application method 2 [Summary of the Invention] One of the ideas is to provide a film data processing system for realizing the processing method of the film zooming. The background information of the two t-two ratios is still under the requirements of different scales. The film is used in this case. The case is to discuss the fan brothers mentioned above. Technology (for example, this Lu's; seven, a case of shortcomings. U ^ shouted) often related to the scope of the access =:it device, system, computer order during the at least - region is subject to film recalibration, The program of the specific example can include ', the second part is based on the video data related to the frame. The receiving and at least one movie picture are configured by hardware, and the example is - the specific column (-and one) of 201141212 is: (1) and The content related to the information appearing in the - frame, and the next specific number of frames disappears, the next two = today = temple; the area related to 'and / or (9) contains the specific Ι Ϊ Ϊ = = oriented foreground The information of the object. The sample program can be protected and not protected. The specific area of the test area is more basic, and the sample program is associated with the parent-related pixel. The average traffic is dan, 任何 in any of the special boxes in the front box, whether the information appears, and can be maintained in any of the frames of the j-frames: ί: ί ::: . This information that failed the test can be marked. The entropy associated with the flow of the information of the previous 2:;::ΐ information is significantly shifted. The use of quantized traffic vectors and/or based on flow and progression includes specific rows and/or columns based on and over-predetermined gate insertions. School traffic entropy, to select the most likely _ function 敎fm can be the most relevant issue of the distribution of the plume distribution, in some embodiments, the sample program can further include a subroutine in the film cube, where the specific area This I(10)μ is performed in a target image. At least temporary - lang * equal scaling functions can be used to promote adjacent orders. The vertices of the ridges can be constrained, based on the least squares mosquito objective function and/or the vertices 7 including the recognizable grid 継 positions, wherein the grid 疋 pre-aligns the linear combination of the grid vertices of the adjacent regions. Changed to 201141212, including the unequal scale subroutine, a grid can be used, and the bean can be packed with a bite of a bit, wherein the particular squares are at least one further at least on the time axis adjacent to the grid = the same. Moreover, you can use - zoom = and / or slide two windows n example of the subroutine can be used - pixel level (four) paste can configuration ΐ, exemplify the process computer access media and system is also here - instant Process image # material to process the unequal scale in the film area. For example, the 2 stipulations include: 'receiving film material, which is generated by the map of Lianba to domain 1 and/or by = specific number = === information on moving foreground objects. In this example = step, it will be clearer that the dome is shaken to perform an unequal scale and the protected cube is modified. Tian Yuejing exemplifies the following examples: "The invention provides a film data processing system" to receive the series and execute (4) pure inclusion = 201141212 a film; (b) define the inclusion - the present a cube; (6) a predetermined scale of the map drag area, the target movie, etc., the frame conforms to the target, so that the processed image is displayed. The size ratio of the body to output another series system: ί ί: The present invention provides a kind of film data processing - format of the series to receive the three-dimensional image containing the - the first example and (c) the surface of the series
三小,以輸出具一第二格式後^晝二 季统:包括ί 7目的’本發明提供一種影片資料處理 狀式糸統,執行以下步驟:⑷接受包含具一 =^式之-目標影像之複數個圖框 二維尺度係,納該目標影像,並= 二為u尺度,該單㈣間係該複數侧框中每相 之時間間隔;以及⑻使該目標影像不等比例縮入該 矩形體内,俾使該影片具有一第二格式以供顯示。 【實施方式】 首先,對將欲播放包含至少一個圖框之影片於具有較小 的螢幕之手機、PDA或是播放的圖片與影片縮放比例會有不 同的要求’先行界定重要的影像物件。 對於欲進行縮放之影片,先行界定在每一圖框之一特定 區域所包含之重要的影像物件,例如移動前景物件,如何避 免被裁切。方法如下: 1、 計算每個圖框之視覺流量(optical fl〇w),經過分析量 化後’得到圖框中每個晝素之流量向量(fl〇wvect()I^。 2、 將所有流量向量導入一扇型統計圖(fan chart)以進行 201141212 • 編號統計,並將該等編號之分佈機率導入熵公式(entropy), ·· 以求得至少一圖框之每一行的熵資訊。 , 3、利用所有圖框之每一行熵’尋找出不允許裁切的特 定區域(critical region) 〇 4、結合裁切與不等比例縮放進行最佳化運算,使得該 圖框重新縮放,,符合目標影像立方體(target恤〇 cube)= 大小比例。換言之,在每一圖框透過定義一特定區域,每個 圖框位於此區域的内容絕對不能被刪除。利用視覺流量來 定其準則且計算出包含所有特定區域之目標影片立方體 表臨界區域以外的内容可以被摒棄。具體而言,欲將一 片變〒時,獨特定行之像素被移除,而欲將—段影片變^ 時,讓特定列保留下來。以影片變窄之做法為例: (1) 當内容剛出現於圖框或者是即將消失於下一個 框,此内容不具有於時間軸上持續出現之特性ό (2) 特定區域裡面必須包含顯著移動前景物體,並定義 定區域的最左邊及最右邊域枕_iealedumn)。 請參閱第1圖,其係本發明第一實施例之方法之 圖。本發明方法之流程如下: 步驟10:接收包含至少一個圖框之一影片; 步驟11:找尋包含與至少-圖框有關聯的移動前景 之一特定區域。 步驟12:界定包含-特定區域之一預定縮放比例目標 片立方體,其中該預定縮放比例係由人為決定。Three small, after outputting a second format, the second quarter: including ί 7 purpose 'The present invention provides a video data processing system, performing the following steps: (4) accepting a target image with a = ^ type a plurality of frame two-dimensional scales, the target image is imaged, and = two is a u scale, the single (four) is the time interval of each phase in the complex side frame; and (8) the target image is unequally retracted into the rectangle In the body, the movie has a second format for display. [Embodiment] First, there are different requirements for scaling a movie to be played on a mobile phone, a PDA, or a video having a smaller screen to a movie having at least one frame, and an important image object is defined first. For a movie to be scaled, first define the important image objects contained in a specific area of each frame, such as moving foreground objects, and how to avoid being cropped. The method is as follows: 1. Calculate the visual flow (optical fl〇w) of each frame, and after analysis and quantification, 'get the flow vector of each element in the frame (fl〇wvect() I^. 2. All traffic will be The vector is imported into a fan chart to perform 201141212 • number statistics, and the probability of distribution of the numbers is introduced into the entropy formula (entropy), to obtain the entropy information of each row of at least one frame. 3. Using each entropy of all the frames to find a critical region that does not allow cropping. 〇4, combining the cropping and unequal scaling to optimize the operation, so that the frame is rescaled, in accordance with Target image cube (target shirt cube) = size ratio. In other words, in each frame by defining a specific area, the content of each frame in this area can never be deleted. Use visual traffic to determine its criteria and calculate Content outside the critical area of the target movie cube table containing all specific areas can be discarded. Specifically, when you want to change a piece, the unique pixel of the line is removed, and you want to change the film to ^ Let the specific column be preserved. Take the practice of narrowing the movie as an example: (1) When the content just appears in the frame or is about to disappear in the next box, this content does not have the characteristics that continue to appear on the timeline (2) The specific area must contain significant moving foreground objects and define the leftmost and rightmost domain pillows of the fixed area _iealedumn). Please refer to Fig. 1, which is a view of the method of the first embodiment of the present invention. The flow of the method of the present invention is as follows: Step 10: Receive a movie containing at least one frame; Step 11: Find a specific area containing a moving foreground associated with at least the frame. Step 12: Defining a predetermined scale target slice cube containing one of the specific regions, wherein the predetermined zoom ratio is determined by an artificial one.
步驟13:該量化過程包含將至少一圖框的視覺流量導入 -統計圖以進行編號統計,並將該等編號之分佈機率導入綱 公式以求得至少-雖之至少—行的熵資訊 域係根據熵資訊而被決定。 甲这特疋S 。、對於欲進行縮放之影片先行界定在每一圖框之一特 區域所包含如移動前景物件重要的影像物件何必免被裁 201141212 切。方法為:ι:计算每個圖框之視覺流量(optical fl〇w),經過 分析量化後,得到圖框裡面每個晝素之流量向量(fl〇w vec㈣。2:將所有流量向f導人—扇型統計圖_ ehart)以進 行編號統計丨並將該等編號之分佈機率導入熵公式 ^ntropy) ’以求得至彡—圖框之每—行的熵資訊。&利用所 有圖框之每-行熵’尋找出不允許裁切的特定區域㈣^ 。4··結合裁切與不等比例縮放進行最佳化運算,Step 13: The quantification process includes importing visual traffic of at least one frame into a statistical graph for number statistics, and introducing the probability of distribution of the numbers into the formula to obtain at least - although at least - the entropy information domain of the row It is determined based on entropy information. A special 疋S. For the movie to be scaled, it is necessary to define the image object that is important in the moving area object in one of the special areas of each frame. The method is: ι: calculate the visual flow (optical fl〇w) of each frame, after analysis and quantification, obtain the flow vector of each element in the frame (fl〇w vec (4). 2: Guide all flow to f The human-fan statistic _ ehart is used to perform the numbering statistics and to introduce the probability of distribution of these numbers into the entropy formula ^ntropy) ' to obtain the entropy information for each line of the frame. & uses every per line entropy of all frames to find a specific area (4) that does not allow cropping. 4·· Combine cropping with unequal scaling for optimization,
該,框錄較5,符合目標雜财_arget vide。cube) ϋ、比例。換&之’在每一圖框透過定義一特定區域,每 :?=此,的内容絕對不能被刪除。_覺流量來 臨si 含所有特定區域之影片立方體;代表 到特定行之像素被mi 下來。以影片變窄之做法為例: 時;於圖框或者是即將消失於下一侧框,此 時不具气於時間軸上持續出現之特性。 此 =)特疋區域裡面必須包含顯著 射 域=;最右邊為特定行(:=: 圖框tii量進之入7=量可□以得知,影狀内容在下一個 量,並且測試它是否每—行像素之流量向 見於之後圖框(採用k吟= 框並且會保持&並且會保持可 此行將標記在特定“内2 2些?件都不成立’則 此物體之移動須獨立不二;含顯著,之物體’ 表每-行財料)進行量化㈣,此處C代 (微小流量向量抑矣忠负向蕙會被量化到間格較多的區域 格)。令柳表示I1量^訊’不需要區分較多的量化間 a里向1 乂經由量化後之整數值如下 201141212 %(1): /(fi)=2fc+ with fc= L〇.5£(f,)J. 柳和θ(/3分別代表著/之長度與方向,這公式的原理闊 :此扇形是由許多間距一樣的同心圓所構成,其第k ^之半㈣2(k+l) ’城k環區分成2ic等分,以及每一等The box record is 5, which is in line with the target miscellaneous _arget vide. Cube) ϋ, proportion. The change &' in each frame defines a specific area, and each: ?= this content must not be deleted. _ Sense flow comes to the movie cube containing all the specific areas; the pixels representing the specific line are down by mi. Take the practice of narrowing the film as an example: Time; in the frame or the frame that is about to disappear on the lower side, then there is no temperament on the timeline. This =) special area must contain significant field = = the right side is a specific line (: =: frame tii amount into 7 = amount can be □ to know, the shadow content is in the next amount, and test whether it is The flow of each line of pixels is seen in the frame after the frame (using the k吟= box and will keep & and will keep the line marked in the specific "2 2 pieces are not established" then the movement of this object must be independent Second; the significant object, the table's per-line material is quantified (4), where the C generation (the micro-flow vector suppresses the negative 蕙 will be quantized to the regional lattice with more compartments). The quantity ^ message 'does not need to distinguish more quantization between a and 1 to 乂 via the quantized integer value as follows 201141212 %(1): /(fi)=2fc+ with fc= L〇.5£(f,)J. Willow and θ (/3 represent the length and direction of /, respectively, the principle of this formula is wide: this fan shape is composed of many concentric circles of the same pitch, its k ^ half (four) 2 (k + l) 'city k ring The area is divided into 2ic aliquots, and each
3 i之角度為2π/2*;如第2圖所示,所有間格從最裡面為 了 =進行連續編號。將一流量向量放置於此扇形圖之原 ,!1用Eq.(l)求得該向量所位於的區間編號。詳細而言, fc = L〇.5卿代表其流量向量位於扇形圖中第幾個環,則為某 叭fiV(2?r/2fc)」環裡面的第幾個區間。 ^,介熵函式(entr〇py)。本專利中利用資訊理論中網 尋觸雜域最左邊及最右邊之邊界;熵函式 式為如P={ Pl’P2’Ρ3,"·,ΡΠ } ’ 則網函 H(C) = _^p(f.).1〇g2p(f.) iec 二=ίίΛ幾個重要特性,其—是函式值必定大於零,其 若ί ^中^事件士總數,則烟函式如0祕。 以使用摘J ί ί成立時,此時系統s之麻式為最大。所 時,則的主要原因在於此’當每一事件的機率相等 越平」ί θ翻最大,以視覺流量向量來看,當機率分佈 向=都率分佈都集中於有—範圍時,代表流量 統計之直方圖並且定義流量分佈機率(高度為】 直方圖讀所有整數直方圖進行正規化),如此就可以^得 201141212 母函式 C (entr〇Py of column C)。 時,PiUM系統中,設定當某行之流量熵函式超過〇.7好_ 現機率都於特定區域之内;而I為當每個事件出 Ζί 時,最大熵函式值。第3圖⑻及第3 _為利 統中’,所ίΪ簡定區域最左及最右之邊界示意®。在本系 特定F =出須限制保留的特定區域邊界’但不意味著位於 依攄有内容都必須完全裁切;初之裁切區域須 讀俘作縮放運算及時間軸上維持—致性之限制’並且 景物二以軸S以看見。因;:對於_前 很明確的準則。、要的’因為糸統採用的流量熵就是一個 _笼對該軸框進行不等比例縮放,使得處理後的 Ϊ 4 L二f δ-該目標影片立方體之大小比例’如第4圖⑻及 °其中’在麵14中更包含至少—個最佳化 isi人等圖框進行不等比例縮放,使得處理後的該等圖 攄^片立方體之大小比例,且該最佳化公式係根 據工間内谷及時間一致性而設計。 瞀所提出影片重新縮放架構是基於變分最佳化運 祕性之不等比例緻,域切時包含最佳化 制。猎由使用方格網格架構分離影片立方體區域,定 S3,函數計算網格之頂點位置:在幾個條件限制下 ϋ仔到刻、能量函健’讀得卿齡置,鎌對每個 ==插重新定位產生雌放後的影片。目標函數由 4個,件所構成’翻轉時間和空間視覺上重要的内容, 以及時間軸上物體内容的連貫性。 疋義標記符號。在影片中每個圖框〖之網格架Mt= =別{v=tl,v=i2...,v=tn}為向量位置合集,E和 ^刀別代表邊和方格面(_ face),且所有的圖框彼此之間 都疋相互連接。經由縮放形變後的新頂點=(χί,ι,; 201141212 這些變數皆使用最佳化計算過程。為簡化複雜度,將符號t 簡化成Vi ’當早一圖框頂點’以v’i。表示。縮小的影片大 小(rx’ry’rz) ’ 1^及ry為放後的影片解析度。Γζ圖框的總數。 基本上,將一段輸入的影片立方體壓縮至一預定縮放比例目 標影片立方體。 該最佳化公式包含用於維持空間内容之相似能量 (^^formal energy)、用於時間一致性在時間軸上内容之相似 能量(Temporal Coherence energy)、及裁切後對每一圖框進行 平滑化的二次平滑能量(second_order smo〇thing energy)。且藉The angle of 3 i is 2π/2*; as shown in Fig. 2, all the compartments are consecutively numbered from the innermost =. Place a flow vector in the original of this pie chart! 1 Use Eq. (l) to find the interval number in which the vector is located. In detail, fc = L〇.5 is the first interval in the ring of a certain fiV (2?r/2fc) ring whose flow vector is located in the first ring of the fan graph. ^, the entropy function (entr〇py). In this patent, the leftmost and rightmost boundary of the miscellaneous domain is found in the information theory; the entropy function is as P={ Pl'P2'Ρ3,"·,ΡΠ } ' then the network function H(C) = _^p(f.).1〇g2p(f.) iec two=ίίΛ several important characteristics, which are - the value of the function must be greater than zero, and if the number of events in ί ^ ^ ^, the smoke function is like 0 secret. When the use of J ί ί is established, the system s is the largest. At this time, the main reason is that 'when the probability of each event is equal, the θ 翻 is the largest. According to the visual flow vector, when the probability distribution to the ratio is concentrated in the range, it represents the flow. The histogram of the statistics and the definition of the flow distribution probability (height is] the histogram reads all integer histograms for normalization), so that you can get the 201141212 parent function C (entr〇Py of column C). In the PiUM system, it is set that when the flow entropy function of a certain line exceeds 〇.7, the current probability is within a specific area; and I is the maximum entropy function value when each event is Ζί. Figure 3 (8) and 3 _ are in the ',' and the leftmost and rightmost boundary of the simplified area is indicated by ®. In this system, the specific F = the boundary of the specific area that must be reserved for reservation 'but does not mean that the content must be completely cut according to the content; the initial cropping area must be read and scaled and the time axis is maintained. Limit 'and the scene two to see with the axis S. Because;: For _ before the very clear guidelines. , because 'the flow entropy adopted by the system is a _ cage to scale the axis frame unequally, so that the processed Ϊ 4 L two f δ - the size ratio of the target film cube ' as shown in Figure 4 (8) and ° wherein 'the surface 14 further includes at least one optimized isi person and the like to perform unequal scaling, so that the processed size of the image cubes is proportional, and the optimization formula is based on Designed for the inner valley and time consistency. The film re-scaling architecture proposed by 瞀 is based on the unequal proportion of variation-optimized privilege, and the domain cut includes optimal optimization. Hunting uses the grid grid structure to separate the film cube area, set S3, the function calculates the vertex position of the grid: under a few conditions, the ϋ 到 、 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量 能量= Insert repositioning to produce a female movie. The objective function consists of four pieces, the content of the flipping time and the visually important content of the space, and the coherence of the object content on the time axis. Derogatory mark symbol. In each frame of the film, the grid frame Mt==other {v=tl, v=i2..., v=tn} is the vector position collection, and E and ^ knife represent the edge and square plane (_ Face), and all the frames are connected to each other. The new vertex after scaling deformation = (χί,ι,; 201141212 These variables use the optimization calculation process. To simplify the complexity, the symbol t is reduced to Vi 'when the previous frame vertex' is represented by v'i. Reduced movie size (rx'ry'rz) ' 1^ and ry are the resolution of the released movie. The total number of frames. Basically, compress an input movie cube to a predetermined scale target movie cube. The optimization formula includes a similar energy for maintaining spatial content (^^formal energy), a Temporal Coherence energy for temporal consistency on the time axis, and a frame for each frame after cutting. Smoothed secondary smoothing energy (second_order smo〇thing energy)
由使用迭代函數(iterative minimization 解一最小平謂題,以取得-組最佳化的絲。) ’在步驟14巾’至少—圖㈣基於曝架構而進 仃不4比例縮放(該不等比例縮放係使用框架在長、 順地滑動,裁⑽部較不重要的區域, 至少-幾何單元尺寸i權之 以下為本實施例較佳說明。 等職之處财法奴,雜放變形後,原 ,角洛之頂點座標必須位於新解析度影片中,此丄 施例中,將所有的特定區域經形變後,處^ 令vd方體之外’如此-來則被裁切掉。 網點頂i 奴健之左上和訂角落的 範_。為了二 =丄包含在這 須滿足下列條件如下Eq.(3^M在目放立方體内,必 201141212 維持物縮,時間軸具有 域,設計不同的限制。 ,時b〗軸上一致性的裁切區 採要的物體, (conformal energy)。 、 )斤提出的之相似能量By using an iterative function (iterative minimization to solve a minimally flattened problem to obtain - group optimized silk.) 'In step 14 towel' at least - Figure (4) based on the exposure structure, not to scale 4 (the unequal ratio The zooming system uses the frame to slide in a long and smooth manner, and the (10) portion is less important. At least the geometric unit size i is lower than the following. This is a better description of the embodiment. Originally, the vertex coordinates of the corner Luo must be in the new resolution movie. In this example, all the specific areas are deformed, and then the vd square is outside the 'so--is cut off. i The slave left and the corner of the corner _. For the second = 丄 included here must meet the following conditions as Eq. (3 ^ M in the eye cube, must 201141212 to maintain the object, the time axis has a domain, the design is different Restriction., b) the object in the cutting area of the consistency of the axis, (conformal energy).
令Vi丨、Vi2、Vi3及vi4分別代裘方炊 維相似轉換參數化是由_數字 q之四_點’而二 望的q和q,,達到最佳相似…所期Let Vi丨, Vi2, Vi3, and vi4 respectively represent the similarity of the transformation. The parametric transformation is determined by the _number q of the four _points and the expected q and q, to achieve the best similarity...
«I p [s, r. u. v]q^qi =: argmin s —r s,r,*u,v 7· S 4 r«I p [s, r. u. v]q^qi =: argmin s —r s,r,*u,v 7· S 4 r
•VL• VL
J L 這是屬於一線性最小平方問題,可寫成 [s’r’M9,9'=«49) Wb,’ ’ 其中如下別.(5) ^ίχ -Vh 1 0 - 「4 1 Vh xh 0 1 yf Aq = I l ; ; ,bgt = —yt4 1 0 -Vi4 ®»4 0 1 _ -vC . 矩陣Aq元全取決於網格架構,而%是一個未知數之矩陣。 將k C W,V]q,q’,將可以將從方格q以得到 广1<-/)v 可寫成如下Eq.(6;) A (⑽') = ΣΣΚ 肠 V), 、 是第t個圖框中視覺重要方格之權重值,而每個圖框 之空間重要資訊圖(spatial importance map),結合顏色梯度量 測’影像視覺特徵圖,以及精準人臉偵測,該重要資訊圖經 12 201141212 ^正規化後之棚為[〇],㈣之間,防衫重要區域過度縮 成明顯地失真現象;而不等比例縮放方法近似= (KRAHENBUHL,等人 2009)及(WANQ 等人 2〇〇9)。 網格直線發生強列地扭曲現象。如下Eq.(7) " α = Σ“ Σ{ί,桃K)2+ (:Vi -Vj)2 )·JL This is a linear least squares problem, which can be written as [s'r'M9,9'=«49) Wb,' 'which is as follows. (5) ^ίχ -Vh 1 0 - "4 1 Vh xh 0 1 Yf Aq = I l ; ; , bgt = —yt4 1 0 -Vi4 ®»4 0 1 _ -vC . The matrix Aq element depends on the grid structure, and % is a matrix of unknowns. k CW,V]q , q', will be able to get wide 1 from the square q <-/) v can be written as follows Eq. (6;) A ((10)') = ΣΣΚ Intestine V), , is the visual importance of the t-th frame The weight value of the square, and the spatial importance map of each frame, combined with the color gradient measurement 'image visual feature map, and accurate face detection, the important information map 12 201141212 ^ normalized After the shed is [〇], (four), the important area of the shirt is excessively reduced to a significant distortion phenomenon; the unequal scaling method is approximately = (KRAHENBUHL, et al. 2009) and (WANQ et al. 2〇〇9). The grid line is strongly distorted. As follows, Eq.(7) " α = Σ“ Σ{ί, peach K)2+ (:Vi -Vj)2 )·
Ev*Eh分別代表網格架構中垂直和水平的邊。 為了實現時間轴-致性之影;={縮放,本專 处β qi 持物體動作資訊,並將影片_,顫抖,波ϊί 失真現象降至最低。藉由視覺流量 等 演化至下-侧框時情況,以!^表示之取侍母個方格由 ,到最佳擬,線性轉換功___ 拖η貫施例不需要計算出連内部都有包I的ί 換丁,因為只需要包含轉換Τ外圍形狀之偷的轉 J地位置。本專利目的在於影片縮放伴:J其, 性轉換,ϋ此制定下列能量函式。如 ^保持上述之線 队(¾) = 卜 tq.⑻ ^能量函式已包含攝影機鏡頭移動 無而分別處理這兩餘況。剩下要 個體運動’而 ,之未知數,像是網格頂點。利^作就$正確定義 頂點為線性組合最鄰近 量所分析得知,在此射,3 基於視覺流 粗條網格頂點之線性組合,以u 左上角頂點,採用 〜來表示。如下Eq.⑼Ev*Eh represents the vertical and horizontal edges in the grid architecture, respectively. In order to achieve the time axis-induced shadow; = {Zoom, this special place β qi holds the object motion information, and minimizes the distortion of the film _, trembling, wave ϊ ί. By visual flow, etc., to the case of the lower-side frame, to! ^ indicates that the square of the waiter is taken, to the best fit, the linear conversion work ___ drag and drop the example does not need to calculate the ί change of the package I even inside, because only need to include the outer shape of the transform Stealing the position of J. The purpose of this patent is to zoom in with the film: J, the sex conversion, and the following energy function is formulated accordingly. For example, ^ maintain the above line (3⁄4) = 卜 tq. (8) ^ The energy function already contains the camera lens movement. The only thing left is the individual movement, and the unknown, like the vertices of the grid. For the correct definition of the vertices for the linear combination, the nearest neighbor is analyzed. In this shot, 3 is based on the linear combination of the vertices of the visual stream and the upper vertices of u, denoted by ~. As follows Eq. (9)
Vi’重新 定義’财可以利用 201141212 仏(必=Σ 哝(<-<)-(11;+1/-〇||2, ’ Ε(^)是方格q/之集合。 有些情況下,方袼Q%已經移動至影片圖框外面,對於 這些方格’利用如下Eq.(ll) ’簡化經時間縮放後,時間轴上 相鄰方格能盡量維持相似之限制 办(必=Σ 丨丨«-<) - (V5+1' - 〇||2. 0';fc)6E(9*) ·Vi' redefining 'financial can use 201141212 仏 (must=Σ 哝(<-<)-(11;+1/-〇||2, ' Ε(^) is a collection of squares q/. Some cases Next, the square Q% has moved to the outside of the movie frame. For these squares, use the following Eq.(ll) to simplify the time scaling, and the adjacent squares on the timeline can maintain similar restrictions as much as possible (must = Σ 丨丨«-<) - (V5+1' - 〇||2. 0';fc)6E(9*) ·
•,所有時間軸上相似之能合 Eq.(12) r 9:eQ; 在Eq.(ll)此能量利用局部性限制,達到保持時間軸上相 ,物體具有-致性’這代林—致性的誤差在圖框間會持 累積。為解決這個問題’係提出—方法,既可靖持時間轴 上相應方格之-致性’並進—步降低誤差程度。明確而古, 二qi與其對應之方格f,取代原本的 λ=5。因為在影片中,物體形狀 :生Πίί明顯的,尤其在有物體或攝影機移動 Hi 容許在進行縮放時會有些微不一致 二ίίΐ提出之能量只討論如何調整縮放。 制其位置在相鄰圖框間改變能維持平順。因此由二 滑函式(second - order smoothing term)。如下匈(1曰3)白千• All similarities on the time axis are Eq.(12) r 9:eQ; in Eq.(ll) this energy is used to localize the limit, to maintain the phase on the time axis, and the object has a -generational forest. The resulting error will accumulate between frames. In order to solve this problem, the method is proposed to both control the corresponding squares on the time axis and to reduce the degree of error. Clearly and anciently, the two qi and its corresponding square f replace the original λ=5. Because in the movie, the shape of the object: Π ίί obvious, especially when there is an object or camera moving Hi allows for slight inconsistency when zooming. The energy proposed is only discussed how to adjust the zoom. The position is changed between adjacent frames to maintain smoothness. Therefore, it is a second-order smoothing term. As follows: Hungary (1曰3) Baiqian
De = ||2v〇 — (v〇~1/ + v〇+1/)||2. 〇 t ’在公式中,n代表著網格繼數量,此平衡能量數 201141212 =函式與其他函式不同,其使騎有網格而非單一頂 最小在3= 欲得一最佳解,使形變網格架構失真達到 D^Dc + De + jDt + SDs, 在本系統中,7=10,占=1 s 界限制不等式是為了保護特定並! 非負邊之線長翻产轉本件不等式,要求網格邊線不能為 現象。筆直邊界限制採用線性方程式 2界邊界能維持筆直,其運算時利用每個圖框頂部ΐ: 最佳化過程,欲在-些線性限制以及線性條件 在本實,中」每次產生新的限制等絲做為下一次進 灯=代之依據。14邊請注意到,每當條件限做變時,系統 矩陣也會發纽變,這取決於是较反不等式財盾情^發 生。本專利之系統,根據[Buat〇isetal.2〇〇9]此篇研究,利^ GPU(GmPhiCS Process υώ)共軛梯度解法器(c〇njugate grafemsolver)和多重平行處理為核心架構,比起一般單次解 法器,其會需要使用大量記紐空間,但也大幅減短運算所 需時間、。—旦變形網格_已計算結束,從制定的目標縮放 立方體裡面剪輯出縮放後之影片。此外,將每一圖框之圖片 細放至母個方格,其系統使用線性内插,或者使用 陶hen_ et al 2009]所提出之實體成像法之高斯濾波器設 計(EWA surface splatting) 〇 根據本揭露的特定範例程序在桌上型個人電腦上進行 15 201141212 測試,該電腦具有Duo 2.33 GHz #m GTX 285的圖形顯示卡。例1 2處理^和Nvidia 參考資料π)所述的方法二=旦用=^^和_(請 成許夕糾,獨場景麵賴時是駐 ^ 景轉換時圖框内容毫盔相 〜曰因為% 性。以*4要考慮時_上之相似 ,j此菜略a改善了效能與記鋪 稷雜度是根據未知頂點數口為计开的 。曾月_# 成千方成長。為了縮放後影片的 σσ質及綠’在碰+,通常制每—方De = ||2v〇— (v〇~1/ + v〇+1/)||2. 〇t 'In the formula, n represents the number of grids. This equilibrium energy number 201141212 = function and other functions Different, it makes the ride a grid instead of a single top at 3 = wants an optimal solution, so that the deformation grid structure distortion reaches D ^ Dc + De + jDt + SDs, in this system, 7 = 10, The =1 s bound limit inequality is to protect the specific and non-negative side line length conversion to this inequality, requiring the grid edge line not to be a phenomenon. Straight boundary limits can be maintained straight by using the linear equation 2 boundary, which uses the top of each frame in the calculation: optimization process, in which some linear constraints and linear conditions are in the real, each time a new limit is generated Wait for the silk as the basis for the next entry into the lamp = generation. Please note that on the 14th side, whenever the conditional limit is changed, the system matrix will also change, depending on the opposite of the inequality. The system of this patent, according to [Buat〇isetal.2〇〇9] this research, GPU (GmPhiCS Process υώ) conjugate gradient solver (c〇njugate grafemsolver) and multiple parallel processing as the core architecture, compared to the general A single-time solver, which will require a lot of credit space, but also significantly reduces the time required for the operation. Once the deformed mesh _ has been calculated, the scaled movie is clipped from the specified target zoom cube. In addition, the picture of each frame is finely placed to the parent square, the system uses linear interpolation, or the EWA surface splatting of the solid imaging method proposed by Tao hen_ et al 2009] The specific example program disclosed herein performs a 15 201141212 test on a desktop PC with a graphics card of Duo 2.33 GHz #m GTX 285. Example 1 2 Processing ^ and Nvidia Reference π) The method described above = = ^^^ and _ (please become Xu Xi, the scene of the scene is the scene when the scene is converted to the frame of the frame ~ 曰Because of the sex. When the *4 should be considered when the _ is similar, j this dish slightly improved the performance and the noise of the shop is based on the number of unknown vertices. Zeng Yue _# Cheng Qianfang growth. After scaling, the σσ quality of the movie and the green 'in the touch +, usually made every square
之網格架構,後面會有更進—步探 新魏推 ΐΓ 2案使用ί重網格(感幽策略,ΐΐϋS 能。’在進行網格扭曲變形時提升系統效 達到平均每秒處理6侧框’並且可以處裡較多= 衫月。 型之it範姻絲綠3何⑽理各麵 巧;SV片根據本揭路的特定範例自動產生之結果,演算法 都是使用之前所提到之參數設定,某些特殊情況下,木^ :統:以允許讓使用者手動決定影片中之重要物體;在某二圖 框中’以視覺流量對物體進行圖形分#K h 視覺流量自動延展至其它圖框。 ^ 根據本揭露的特定範例的程序與線性縮放、與由,例 如,Wang等人(請參考資料26)所述的以動作為主/影片縮放 (MAR)程序、與由,例如,以池enb他1等人(請參考資料1 所述的隨時間編輯之影片縮放(SVR)程序做比較'。由於 MAR和SVR程序兩者是目前最先賴則驗技術,故將 本結果與MAR和SVR程序進行比較。之前研究[w〇if过乩 2007]、[Rubinstein et al. 2008]、[Zhang et al. 2008]在針對影片 進行縮放時,皆沒有考慮動作之物體於時間軸上一致性^因 16 S] 201141212 此^讀無絲美以動作為主方法,[Kr^henbtihl et al. 2009] * ^泛,用者調查作為依據,推得出此項結論。有趣的是圖 ^ et al. 2009] > [Rubinstein et al. 2009]^# 3 了裁切以及其他技術,以最佳化方式獲得與原本圖片最相 似之結果,但這些方法所需要很長的運算時間,並且僅僅適 用於靜態影像,並沒有延伸至影片,考慮時間軸上一致 性的問題。 、—作為比較的一文獻,最主要與[Wang et al 2⑻9]之 進行比較,因為此篇研究巾,其明確地處理有關時間轴上一 • 致性的問題。但是其需要利用SIFT方法,進行每個圖框特 徵點對位,如果-影片只有均勻單調之背景,則將會導致 MAR失敗’例如第7圖⑻·第7圖⑼所示,其中第7圖⑻ ,原來的圖框’第7剛為線性縮放(linearsealing)的圖框, 第7圖(c)為KrShenbtihl等人所處理之圖片,而第7圖 為本實施例。 進-步而言,MAR在特徵點對位時存在著視差㈣論) 的問題,其方法無法將在不同景深下的物體進行一致性轉 換’在這種情況下,MAR此方法將退化成為線性縮放,例 ^第6圖⑻第6圖(h)所示’其中第6圖⑻及第6圖⑷為原 來的圖框,第6圖(b)及第6圖(ί)為線性縮放(lhear scaUn ) 的圖框,第6圖(c)及第6圖(g)為[Wang等人所處理之圖片], 而第6圖(d)及第6圖(h)為本實施例。相車交之下,本案的方法 能無失真地處理所有動作類型影片,且不需要任何關於圖框 特徵點對位,因此與MAR做比較,本案能成功解決任音深 度改變及攝影機鏡頭移動之影片。 “ [Krahenbahletal.2009]的網格架構是以像素為大小, 現及時影片重新縮放。(可參考例如參考資料第13)。為了達 到如此快速之效能’ SVR分別對於每個圖框解決最佳化不 比例縮放之問題,且只是單純限制時間軸上相鄰像素轉換時 201141212 的一致性。處理時間軸上-致性是以每五個圖 均,個圖框在空間上的重要資訊圖,並且 顯=物,資訊;如此-來’視覺上顯著和移 可獲得較南的重要資訊。然後’每個圖框進行 味 如果存在著攝影機是絲物體场度二 避免晝面失真及波動現象。 將不月匕 除了之前最先進的影片重新縮放方法,本案也盥丰 =影=(此會比自動產生的結果要好許多)進行比車交,可以 發現’並不會有鏡頭劇烈搖晃的現象發生 顯_勢在於採用裁切與不等比例縮放,特別是 有很顯著改變時。在本實驗中,本^結果“ 視覺上重要的物體或嚴重地改變攝影機路徑。值 = t: 採用更細小、甚至像素等級解析度的網格架 祕資訊能更加鮮地分析運算,是,為了改盖影 ί ΓΪ ’採用更精細網格是有侷限的,因為網袼裡每個方格 内^^份都是—樣的。本案實驗了各種不同網格解析 網格架構後進行運算時間以及所須記憶體大小, 二看出來’本案系統在於40x40、20x20、l〇xio、5痛格 3眷25有任何明顯地差異存在。雜採用精細的網^ 二暢費ifr記憶體空間’但也使得重新縮放影片更加平順 能上最佳的平衡點。根據先_露-些例示實施例2 ^序係藉執行以96位不同背景與年齡層的使者用調查,作 =估本案方法的依據。本案制Pavid 196騎提出的比較 「η/將本揭路程序的影片結果與[Κτ池enbiihl et al. 2009]和 旦^ng et al. 2009]之結果兩兩互相比較;發明人會提供一原始 衫片内容以及任兩種方法的結果,讓使用者選擇他們所喜歡 Γ·, 201141212 的重新縮放版本。在一開始測試時,均沒有對使用者提供任 何特殊的技術指導,以確保實驗的準確性。在實驗中,本案 使用了六種不同的影片’採用本揭露演算法、 2009]、[Wang et al. 2009]全自動寬度減少50%之影片。 每部影片會做二次兩兩方法比較,因此每位使用者會被要求 做3><6 = 18次測試。本案選取的六段影片,包括不同類型的場 景以及物體動作型態:像是現場拍攝的鏡頭、CG電影、特 寫鏡頭、廣㈣攝、單-或多個前景物體、快速或慢速移動 的鏡頭晝面、以及有無視差效果;六部影>{中,我們使用了 ^部電影題材和-部CG動晝短片,並且盡量保持每部剪輯 影片不會有太翅框’因絲個短片會多加人3個比較且我 們不能期望每個使用者會花超過2〇_3()分鐘再參與實驗。並 ^問題是α賴咖雜丨崎倾頗。本實驗巾,取得總 數msasx96)的答案,且每一方法總共被評比1152次(24以6)。 較佳於 示範程序 MVR SVR Total 示範程序 - 488 508 996 MVR 88 - 309 397 SVR 68 一 一>—· 267 - 335 表格一The grid structure, there will be more in the future - step by step, the new Wei pushes the case 2 use ί heavy grid (sense secluded strategy, ΐΐϋS can. 'Improve the system efficiency in the grid distortion to achieve an average of 6 sides per second The box 'can be more in the place = the shirt month. The type of it's fan marriage silk green 3 (10) rationality; SV film automatically generated according to the specific example of the road, the algorithm is used before the use Parameter setting, in some special cases, wood ^: system: to allow the user to manually determine the important objects in the film; in a certain frame 'to visually flow the object to the graphics #K h visual flow automatically extended To other frames. ^ Programs and linear scaling in accordance with the specific examples of the present disclosure, and motion-based/film scaling (MAR) programs, as described by, for example, Wang et al. (see Resources 26). For example, take a pool enb he 1 et al. (please refer to the 1 time edited movie scaling (SVR) program for comparison]. Since both MAR and SVR programs are currently the most advanced technology, this will be The results were compared with the MAR and SVR procedures. Previous studies [w〇if too乩2007], [Rubinstein et al. 2008], [Zhang et al. 2008] did not consider the consistency of the action object on the time axis when scaling the film. ^16] 201141212 This ^ read no silk beauty Taking action as the main method, [Kr^henbtihl et al. 2009] * ^pan, user survey as a basis to draw this conclusion. Interesting is the figure ^ et al. 2009] > [Rubinstein et al. 2009 ]^# 3 cropping and other techniques to get the most similar results to the original image in an optimized way, but these methods require a long calculation time and are only suitable for still images, and do not extend to the film, consider The problem of consistency on the time axis. - As a comparative literature, it is mainly compared with [Wang et al 2 (8) 9], because this research paper clearly deals with the problem of the one on the time axis. However, it is necessary to use the SIFT method to perform the alignment of the feature points of each frame. If the film has only a uniform monotonous background, it will cause the MAR to fail. For example, Figure 7 (8) and Figure 7 (9), Figure 7 (8), the original frame '7th just for the line The frame of linear scaling (Fig. 7 (c) is the picture processed by KrShenbtihl et al., and the figure 7 is the embodiment. In the case of the step, the MAR has parallax when the feature points are aligned (4) On the problem, the method cannot convert the objects in different depths of field consistently'. In this case, the MAR method will degenerate into a linear scaling, as shown in Figure 6 (8) and Figure 6 (h). Figure 6 (8) and Figure 6 (4) are the original frames, and Figures 6 (b) and 6 (ί) are the frames of linear scaling (lhear scaUn ), Figure 6 (c) and Figure 6 (g) is [picture processed by Wang et al.], and FIGS. 6(d) and 6(h) are the embodiments. Under the car, the method of this case can process all action type films without distortion, and does not need any alignment of the feature points of the frame. Therefore, compared with MAR, this case can successfully solve the change of the tone depth and the movement of the camera lens. film. "[Krahenbahletal.2009]'s grid architecture is pixel-sized and re-scaled in time. (See, for example, Reference 13). In order to achieve such fast performance, SVR optimizes each frame separately. The problem of non-scaling, and simply limits the consistency of 201141212 when the adjacent pixels are converted on the time axis. The processing time axis is the important information map in space for every five graphs, and Display = object, information; so - to 'visually significant and move to get more important information about the south. Then 'each frame to taste if there is a camera is the object of the wire object 2 to avoid face distortion and fluctuations. In addition to the most advanced film re-scaling method before, this case is also 盥 = = shadow = (this will be much better than the automatically generated results) than the car, you can find that 'there will be no sharp shaking of the lens _ The trend lies in the use of cropping and unequal scaling, especially when there is a significant change. In this experiment, the result of this ^ "visually important object or seriously change the camera path . Value = t: The use of finer, even pixel-level resolution of the grid frame information can be more freshly analyzed. Yes, in order to change the shadow ΓΪ 采用 'The use of finer mesh is limited, because every net Each square is ^-like. In this case, we experimented with various grids to analyze the grid structure and then calculate the operation time and the size of the required memory. Secondly, the system in this case is 40x40, 20x20, l〇xio, and 5 pain cells 3眷25. Miscellaneous uses a fine mesh ^ two fee-free ifr memory space 'but also makes the re-scaling film smoother to the best balance point. According to the first-expo-exemplary embodiment 2, the order is used to calculate the basis of the 96-bit different background and age layer. The result of the comparison between the film and the Pavid 196 rider is "n/ compare the results of the film of the road and the results of [Κτ池enbiihl et al. 2009] and 丹^ng et al. 2009]; the inventor will provide one The original shirt content and the results of either method allow the user to choose the re-scaled version of their favorite 2011·, 201141212. At the beginning of the test, no special technical guidance was provided to the user to ensure the experiment. Accuracy. In the experiment, the film used six different films 'Using the Exposure Algorithm, 2009】, [Wang et al. 2009] to reduce the automatic width by 50% of the film. Each film will do two times two The method is compared, so each user will be asked to do 3><6 = 18 tests. The six films selected in this case include different types of scenes and object motion patterns: like live shots, CG movies, Close-up, wide (four) shots, single- or multiple foreground objects, fast or slow moving lens faces, and the presence or absence of parallax effects; six shadows > {, we used ^ movie theme and - part CG昼 short film, And try to keep each clip film will not have too winged frame 'Because the silk short film will add 3 more comparisons and we can't expect each user to spend more than 2 〇 _3 () minutes to participate in the experiment. And ^ question is赖 咖 咖 丨 。 。 。 。 。 。 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本 本88 - 309 397 SVR 68 一一>—· 267 - 335 Form 1
表^顯示%位使用者研究參與者之配對比較結果。總 ^方沐· /固比較被執行。在此例中’在表格中間欄元素%表 到,使用的二欠數。並且可以由圖表三十三觀察 者調一之、,·°果报明顯地偏好本案演算法所做出來的 201141212 結果。總而言之,本發明結果在經比較後,獲得的得票率為 86.5%(996/1152)次。與SVR相較之下有超過88.2%的得票 率,另外與MAR相較之下有超過847%的得票率。相反的, SVR 只有 29.1%(335/1152)、MAR 只有 34.5%(397/1152)的得 票率,代表著決大多數參與者傾向本論文結果較佳。所量測 之Kendall的一致性係數為“ =().356,代表統計顯著性為 p<o_oi。Kendall的一致性係’代表兩兩循環比對是否有矛盾 現象發生,如— ;本使用者結果調查,有78%的使Table ^ shows the results of the paired comparison of % of the user study participants. The total ^ Fang Mu · / solid comparison was carried out. In this case, the element % in the table is listed in the table, and the number of the two is used. And it can be adjusted by the observers of the chart thirty-three, and the results clearly match the 201141212 results of the algorithm. In summary, the results of the present invention, after comparison, yielded 86.5% (996/1152) votes. Compared with SVR, there are more than 88.2% of the votes, and in addition to MAR, there are more than 847% of the votes. Conversely, SVR has only 29.1% (335/1152) and MAR only 34.5% (397/1152), which means that most participants tend to prefer the results of this paper. The measured Kendall's consistency coefficient is "=().356, which means statistical significance is p<o_oi. Kendall's consistency system' represents whether there is a contradiction between the two or two cycle comparisons, such as - this user Results survey, 78% of the results
用者’個別使用者偏好統計不一致性為ί = 1,意味著他們並 ;又有矛盾的現象發生,且本使用者調查中,平均一致性係數 為? = 〇·94,標準差為〇·1,且只有3個使用者一致性分數為 卜ο.5 ’說明此調查結果有極高的準確度。 、 在本揭露中,完整對之前所有影片重新縮放技術進行使 用者調查是不太可㈣,瓶本案將比較的重點放在最近這 兩項技術[Kr址enbtihl et al. 2009]、[Wang et al 2009]。在 [K^enbtim et al. 2_研冑中’ SVR方法很明顯優於線性縮 放’且[Wang et al. 2009]研究展示中以證明比[w〇lfet此2 及[Rubinstein et al. 2008]結果較佳’因此本案不重複再 縮放、[Wolf et al.2007]、[Rubinstein et al. 2008]進行比較。葙 據使用者調查可以進一步幫助我們深入研究,了大多^ 希望看到何種重新收縮後影片’但也f要更多 且設計更複雜的實驗,例如本案也可以設計讓所有 未接觸原始影片狀態下,評比各種方法。 在使用者触貫驗巾’核也特顺對本揭 術:以時間軸上物體出現時間為依據的裁切技 有撥放原始影片的情況下,使用者只2論在是否 往往忽略則兩側資訊’且在杨統有針對裁 =&平 滑化下’由圖表三h«可得知’決大多數使用者 20 i S] 201141212 接受此種裁切情況。 如^發明之前所述’簡影片中重要物體 ’此為相互矛盾的目標;如果於影片中,-段J 移動ΐ跡涵蓋了所有4面,換言之,欲轉時間上的 π的在㈣中移動過的所有背景都必須以維持相 =Ϊ二:ίΐ種情況下,不等比例縮放將呈現線性縮放 8用轉部分視覺上已出現或未來可看Ϊ之ΐί如第 i itf8圖,示’攝影鏡頭隨著時間—直環繞圖中Ξ 士拉f者時間上前景物體的移動執跡,已經涵蓋空間上所 有t’ [Wang et al· 2009]之方法與線性縮放毫無差異^ 疋例之方法仍然可保留影片重要物㈣形狀大 ,·、’其中第8圖⑻為縣_框,第8剛為線性縮放 (lu^arscahng)的圖框,第8圖⑹為Wang等人所處理之圖片, 而第8圖(d)為本實施例。與純粹利用裁切相比,本案方法一 定可以保留最重要物_特定區域,社重要f訊被移除; 切結ΐ了不等比例縮放,可以大幅地降低虛擬鏡頭 ^吏用率;且在裁切無法朗或不㈣的情況下,不等比例 縮放,有效地利用空間位置,將不重要背景變形塵縮。裁切 與不等比讎放㈣_,㈣分最佳化函絲這兩者之 取得平衡。 、本案方法在於增加時間與空間上可以變形及移除的區 域丄但是於影>;㈣内容巾’铺存在許纽覺上顯著特徵 與則厅、物體,一旦經重新縮放後,在時間與空間上可能導致 扭曲失真的現象發生,例如第9圖⑻_第9圖⑹所示,其中 第9 _為原來_框’第9 _為線性縮放(linear scali ) 的圖,’第9圖(i)為Wang等人所處理之圖片,而第9圖(d) 為本實施例。在這種極端的情況下,必須從藝術的角度去分 析’決定影片中哪些關鍵圖框裡的範圍是可以永久存在出 21 201141212 裁切而I法出成杲些顯者物體求遠被 _二===㉟=可 =靠S此種鏡頭傾斜的,其:㈡=: 為雜訊與晝面閃:使最好的偵測技術有可能因 ΐ無:要不,:的特二來影 :ί:移動的=:=:3茲S3: 允許時’使用像素層次的網格架構即可二:b 裝置L1。-統方塊圖,_統包含一處理 體 23、一4=及 令24如^儲存媒體23可健存多個執行指 -内/外部網路Λ資:料選有J網路,-無線網路, 示裝=及====_息。此外’該顯 者存取格朗瓣可祕摘=於顯觀顧存一使用 流⑽提出的-含至少一圖框之二^置^來執仃。首先,接收包 框有關聯的前景物件資訊_2)==== 22 Si 201141212 的特定區域(步驟33)。 前述介紹本發明之—實絲 冑 者可從這些實施例中得知本發明之夕^則_ f&該項技術 明,並從上述多個系統'裝置、及:不同範例及實施說 的構思。此外,提*㈣Ϊ'及方法的說明來了解本發明 的實施態樣。所能了解地納入本發明 取記憶體、唯讀記憶Ξ隨2體包含硬碟、隨機存User's individual user preference statistical inconsistency is ί = 1, meaning they are; and there are contradictory phenomena, and the average consistency coefficient in this user survey is? = 〇·94, the standard deviation is 〇·1, and only 3 user consistency scores are ο.5 ’, indicating that the survey results are extremely accurate. In this disclosure, it is not a good idea to conduct a user survey on all previous film rescaling techniques. (4) The bottle will focus on the two recent technologies [Kr. enbtihl et al. 2009], [Wang et Al 2009]. In [K^enbtim et al. 2_, the 'SVR method is clearly superior to linear scaling' and [Wang et al. 2009] research shows to prove the ratio [w〇lfet2 and [Rubinstein et al. 2008] The results are better' so the case is not repeated and rescaled, [Wolf et al. 2007], [Rubinstein et al. 2008] for comparison. According to the user survey, we can further help us to further study, and most of them want to see what kind of re-contracted film 'but also more and more complex experiments, such as this case can also be designed to let all the original film status not touched. Next, evaluate various methods. In the case where the user touches the towel, the core is also specially succinct. In the case that the cutting technique based on the time of appearance of the object on the time axis has the original film, the user only discusses whether it is often ignored. The information 'and in Yang Tong has a cut=& smoothing' from the chart three h« can be known as 'most users 20 i S' 201141212 accept this kind of cutting situation. Such as the "important object in the film" as described before the invention is a contradictory target; if in the film, the - segment J movement track covers all 4 faces, in other words, the π in the turn time is moved in (4) All backgrounds must be maintained in the same phase: Ϊ 2: ί ΐ , 不 不 不 不 不 不 不 不 不 不 不 不 不 不 不 不 不 不 不 不 不 不 不 用 用 用 用 用 用 用 用 用 如 如 如 如 如 如 如 如 如 如 如The lens over time—straight around the figure, the movement of the foreground object on the time of the singer, has covered all the space in the t' [Wang et al. 2009] and the linear scaling has no difference. Can still retain the important objects of the film (4) large shape, ·, where 8 (8) is the county _ box, the 8th is the linear zoom (lu ^arscahng) frame, the 8th (6) is the image processed by Wang et al. And Fig. 8(d) is the embodiment. Compared with the pure use of cutting, the method of this case can retain the most important things _ specific areas, the social important information is removed; cut the unequal scale scaling, can greatly reduce the virtual lens utilization rate; In the case where the cropping is impossible or not (4), the scale is not scaled, the space position is effectively utilized, and the unimportant background is deformed and dusted. The cropping is equal to the unequal ratio of the four (4) _, (4) sub-optimal ties. The method of this case is to increase the area that can be deformed and removed in time and space, but in the shadows; (4) the content towel's presence of significant features and halls, objects, once rescaled, in time and Space distortion distortion may occur, for example, Figure 9 (8) _ 9 (6), where the 9th _ is the original _ box '9th _ is a linear scali diagram, '9th figure ( i) is a picture processed by Wang et al., and Figure 9(d) is the embodiment. In this extreme case, it is necessary to analyze from the artistic point of view. 'Determining which of the key frames in the film can be permanently present. 21 201141212 Cutting and I method is a sneak peek. ===35=Can be tilted by S such a lens, its: (2) =: For noise and 昼 flash: Make the best detection technology possible because of nothing: or not, the special second : ί: Mobile =:=:3z S3: When allowed, 'use a pixel-level grid architecture to do two: b device L1. - Unified block diagram, _ system includes a processing body 23, a 4 = and 24 such as storage medium 23 can store a plurality of execution fingers - internal / external network resources: material selection J network, - wireless network Road, display = and ====_ interest. In addition, the viewer's access to the singular stalk can be obtained by using the stream (10) and the at least one frame. First, the receiving packet has an associated foreground object information_2) ==== 22 a specific area of Si 201141212 (step 33). The foregoing description of the present invention can be seen from the embodiments of the present invention. The present invention is known from the above-described plurality of system 'devices, and: different examples and implementation concepts . Further, a description of the method of the present invention will be made by referring to the description of the method. Incorporating the invention into the memory, the read-only memory, the hard disk, the random storage
置。權置2〇執行指令可為-硬 f處,,一微處理機,*,_〇,mainfr_及U 荨。7人理解地’藉由本實施例所提 ; 語的同義名詞皆可納入本實施例概要。寻有名况子術用 统,上在影片重建中在本實施例中所提到的系 。移動的物件在本實施例中扮演重要的地位,在^ ίΐϊϊϊ物件仍可保有影像的比例縮放。根據前言所述, n的物件可使得重建物件的時間維度問題解決。且根據本 職覺流量在對於重建麟程巾適用於空間及時 _根據本文揭露的特定示範性實施例,由於對於整 鏡頭-直到場景片段的分析以及最佳化是程序中非常‘ 的觀,,其計算的代價姆高於只預雖最佳化的 時間系統。ϋ為本倾麟人士麟賴了縣案所揭^ 内容的觀點,此料算的代價㈣本s揭㈣容所提供 品質視訊處理結果的一示範性實施例的結果,可為一個名義 上的問題。 則述内容僅僅敘述了本揭露内容的原理。針對敘述的實 施=所,的各種各樣的修改以及變更,對於本領域技術人士 而言可藉由本案所教導的内容輕易的完成。本領域技術人士 23 201141212 :體悟而設計出更多的系統、裝置以及方法,然而就算上述 未在此明確的顯示或揭露,但仍包含本案的原理且屬 =案精=及所揭露的範圍内。此外,有關前述的所有出 獻係以在此整體合併為參考文獻。在此描述 2不祕的程序可儲存在任何電腦可使用的儲存媒體 ;=;、隨機存取記憶體、唯讀記憶體、隨身碟、光碟、 ίϊΪί,且可運用於微處理器、mhi、m_、mainframe 等處理裝置都是應該被知道的。 圖^下仿再士針^影片資料處理系、統敛述。詳言之,請參第U =)’依本發明之-種影片f料處理系統包含 :提Ϊ二系列晝面之格*,及-嵌入式系統220: 執行。該影片資料處理系統200,在應用 itf 時,通常係由該嵌入式系統22G於接收一影片 ‘ 如第12剛所示三步驟24G、25G及260。而 :步驟可/刀別為:接收包含至少—個圖框之—影片 區,一預定縮放比例目標影片立方體、及對該 標景心上例縮放’使得處理後的該等圖框符合該‘ 另比例。於完成此三步驟之後,則可輸出 揭之内容除可為以上所 一、該三步驟可分別為:接收包含具— :畫面之-影片、界定包含-特定區域之一:定ϊί;:; 小,_以輪三維影像之大 一、該二步驟亦可分別為:接受具—第一 2例界2用於各該複數個圖框之—特定區i之 、對母-該圖框進行不等比例縮放,使得處理二: 24 201141212 =符合該财縮放比例,俾使該影片具有一 供顯示 第二格式以 s ^外,該二步驟亦可分別為:接受包含且一 $拔 第三維尺納該目標影像,並以-單位時間為1 時間間隔個圖框中每相鄰兩圖框之 使該影片具有ιΐ格例縮人該矩形體内,俾Set. The right execution command can be -hard f, a microprocessor, *, _〇, mainfr_ and U 荨. 7 persons understand that the synonymous terms of the language can be included in the summary of the present embodiment. Look for the name of the sub-system, the system mentioned in this embodiment in the film reconstruction. The moving object plays an important role in this embodiment, and the scale of the image can still be preserved in the object. According to the introduction, the object of n can solve the problem of the time dimension of the reconstructed object. And according to the present stimuli flow, it is suitable for spatially timely for rebuilding the lining towel. According to the specific exemplary embodiment disclosed herein, since the analysis and optimization of the entire lens-up to the scene segment is a very 'view' in the program, The cost of the calculation is higher than the time system that is only optimized. ϋ ϋ 人士 人士 人士 人士 人士 人士 人士 人士 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县 县problem. The description merely describes the principles of the disclosure. Various modifications and alterations to the implementation of the description can be readily accomplished by those skilled in the art from the teachings herein. Those skilled in the art 23 201141212: to design more systems, devices and methods, but even if the above is not explicitly shown or disclosed herein, the principles of the present invention are included and are within the scope of the disclosure. . In addition, all of the above-mentioned contributions are hereby incorporated by reference in their entirety. The program described here can be stored in any computer-usable storage medium; =; random access memory, read-only memory, flash drive, CD, ίϊΪ, and can be used in microprocessors, mhi, Processing devices such as m_ and mainframe should all be known. Figure ^ below the imitation of the needles ^ film data processing system, the general convergence. In more detail, please refer to U =) </ br /> according to the invention - a film f material processing system includes: Ϊ Ϊ two series 昼 之 ,, and - embedded system 220: implementation. The video material processing system 200, when applying itf, usually receives a movie by the embedded system 22G, as shown in the 12th step 24G, 25G and 260. And: the step can be / the knife is: receiving at least a frame - the film area, a predetermined zoom target film cube, and zooming on the target case to make the processed frame meet the ' Another proportion. After the completion of the three steps, the content that can be outputted can be the above one, and the three steps can be respectively: receiving the inclusion of: - the picture - the film, defining the inclusion - one of the specific areas: ϊ ϊ; Small, _ in the round of the three-dimensional image of the first, the two steps can also be: the acceptance of - the first two cases of the boundary 2 for each of the plurality of frames - the specific area i, the mother - the frame Unequal scaling, so that the processing two: 24 201141212 = in line with the financial scale, so that the film has a second format for display s ^, the two steps can also be: accept the inclusion and a $ pull the third dimension The target image is measured and the unit time is 1 time interval. Each adjacent two frames in the frame makes the film have a ι ΐ 例 该 该 该 该 该 该 该
【主要元件符號說明】 2〇處理裝置 21處理器 22輸入/輸出裝置 23電腦儲存媒體 24執行指令 25儲存裝置 26顯示裝置 10〜14步驟 31〜33步驟 2〇〇影片資料處理系統 210 影片介面 220 嵌入式系統 240〜260步驟 【圖式簡單說明】 的流程圖 第.1圖為本發明所使用 第2圖為属形圖。 第3圖(a)及第3圖 右之邊界示意圖。 ()為利用上述方法侧败區域最左及最 25 201141212 4剛所示’對料目麵行不等比例縮放, 笛t 後的—該等圖框符合該目標影‘片立方體之大小比例。 圖(a)及第5圖(b)所示’對應方格示意圖。 6圖⑻所示,其中第6圖⑻及第6 _為原來 化圖J ’第6 _及第6圖_線性職(linear seaHng)的圖 6 it ΐ⑹及第6圖(g)為Wang #人所處理之圖片,而第 圖(d)及第6圖(h)為本實施例。 圖⑹所示,其中第7圖⑻為原來的圖框,第 人所處理之則’而第7剛為本實施例。 3圖(=)·”_所示’攝影鏡頭隨著時間一直環繞圖中 ii游ί味著時間上前景物體的移動執跡,已經涵蓋空間上 區域’其中第8圖⑻為原來的圖框’第8圖⑻為線 $,(h^scaling)的圖框,第 8 _為 Wang 等 ^圖片,而第8圖(d)為本實施例。 第9圖⑻第9圖(d)所示,其中第9圖(a)為 9圖⑼為線性縮放(linearscaling)的圖框,第'9圖⑹. ,人所處理,而第9_為本實施=_為〜吨 第10圖為本發明之一系統方塊圖。 第Π圖為依據本發明的實施例所提出 據本發明的影片資料處理系統之I塊圖。 第12圖(b)本發明的實施例所提出的另一流程圖。 26[Main component symbol description] 2 〇 processing device 21 processor 22 input/output device 23 computer storage medium 24 execution command 25 storage device 26 display device 10~14 steps 31 to 33 step 2 〇〇 video material processing system 210 film interface 220 Embedded System 240 to 260 Step [Simplified Schematic Description] Flowchart Fig. 1 is a genus diagram used in the second drawing of the present invention. Figure 3 (a) and Figure 3 are schematic diagrams of the right boundary. () In order to utilize the above method, the left side of the side defeat area and the most recent projections of the item surface are unequal scaled, and after the flute t, the frames conform to the size ratio of the target image slice cube. Figures (a) and 5 (b) show corresponding grid diagrams. 6 (8), in which the sixth figure (8) and the sixth _ are the original figure J '6th _ and the sixth figure _ linear sea (linear seaHng) Figure 6 it ΐ (6) and 6 (g) is Wang # The pictures processed by the person, and the figures (d) and 6 (h) are the embodiments. As shown in Fig. 6, the seventh figure (8) is the original frame, and the first one is processed, and the seventh is just the embodiment. 3 picture (=)·”_”The photographic lens has been around the picture for a long time. It is a movement of the foreground object in time. It has covered the space area. The 8th picture (8) is the original frame. 'Fig. 8 (8) is the frame of line $, (h^scaling), the 8th _ is the picture of Wang et al., and the 8th figure (d) is the embodiment. Fig. 9 (8) Fig. 9 (d) In the figure, Fig. 9(a) is 9 (9) is a linear scaling frame, the '9th figure (6). is processed by the person, and the 9th_ is the implementation = _ is ~ ton, the 10th figure is BRIEF DESCRIPTION OF THE DRAWINGS FIG. 12 is a block diagram of a film material processing system according to an embodiment of the present invention. FIG. 12(b) shows another flow of an embodiment of the present invention. Fig. 26
Claims (1)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US13/106,971 US20110279641A1 (en) | 2010-05-14 | 2011-05-13 | Apparatus, systems, computer-accessible medium and methods for video cropping, temporally-coherent warping and retargeting |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US33495310P | 2010-05-14 | 2010-05-14 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| TW201141212A true TW201141212A (en) | 2011-11-16 |
Family
ID=46760295
Family Applications (6)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| TW99127216A TW201141212A (en) | 2010-05-14 | 2010-08-13 | Video data processing system |
| TW99127218A TW201141205A (en) | 2010-05-14 | 2010-08-13 | System for transforming video outputting format |
| TW99127214A TW201141204A (en) | 2010-05-14 | 2010-08-13 | Method of warping video |
| TW99127215A TWI417809B (en) | 2010-05-14 | 2010-08-13 | Video playing system having display device |
| TW99127217A TW201140393A (en) | 2010-05-14 | 2010-08-13 | Touch control system |
| TW99127219A TWI419075B (en) | 2010-05-14 | 2010-08-13 | Video warping graphic processor |
Family Applications After (5)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| TW99127218A TW201141205A (en) | 2010-05-14 | 2010-08-13 | System for transforming video outputting format |
| TW99127214A TW201141204A (en) | 2010-05-14 | 2010-08-13 | Method of warping video |
| TW99127215A TWI417809B (en) | 2010-05-14 | 2010-08-13 | Video playing system having display device |
| TW99127217A TW201140393A (en) | 2010-05-14 | 2010-08-13 | Touch control system |
| TW99127219A TWI419075B (en) | 2010-05-14 | 2010-08-13 | Video warping graphic processor |
Country Status (1)
| Country | Link |
|---|---|
| TW (6) | TW201141212A (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI486794B (en) * | 2012-07-27 | 2015-06-01 | Wistron Corp | Video previewing methods and systems for providing preview of a video to be played and computer program products thereof |
| KR102317789B1 (en) * | 2015-02-12 | 2021-10-26 | 삼성전자주식회사 | Scaler circuit for generating various resolution images from single image and devices including the same |
| CN112367559B (en) * | 2020-10-30 | 2022-10-04 | 北京达佳互联信息技术有限公司 | Video display method and device, electronic equipment, server and storage medium |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6047088A (en) * | 1996-12-16 | 2000-04-04 | Sharp Laboratories Of America, Inc. | 2D mesh geometry and motion vector compression |
| US6178272B1 (en) * | 1999-02-02 | 2001-01-23 | Oplus Technologies Ltd. | Non-linear and linear method of scale-up or scale-down image resolution conversion |
| GB9906420D0 (en) * | 1999-03-19 | 1999-05-12 | Isis Innovation | Method and apparatus for image processing |
| GB0315412D0 (en) * | 2003-07-02 | 2003-08-06 | Queen Mary & Westfield College | Optical flow estimation method |
| TWI298465B (en) * | 2005-12-02 | 2008-07-01 | Prolific Technology Inc | Segment-based video and graphics system with video window |
| US7747107B2 (en) * | 2007-03-06 | 2010-06-29 | Mitsubishi Electric Research Laboratories, Inc. | Method for retargeting images |
| TW200945879A (en) * | 2008-04-22 | 2009-11-01 | Magima Digital Information Co Ltd | A universal picture scaling device and a corresponding method |
| US8255825B2 (en) * | 2008-10-07 | 2012-08-28 | Microsoft Corporation | Content aware adaptive display |
-
2010
- 2010-08-13 TW TW99127216A patent/TW201141212A/en unknown
- 2010-08-13 TW TW99127218A patent/TW201141205A/en unknown
- 2010-08-13 TW TW99127214A patent/TW201141204A/en unknown
- 2010-08-13 TW TW99127215A patent/TWI417809B/en not_active IP Right Cessation
- 2010-08-13 TW TW99127217A patent/TW201140393A/en unknown
- 2010-08-13 TW TW99127219A patent/TWI419075B/en not_active IP Right Cessation
Also Published As
| Publication number | Publication date |
|---|---|
| TWI417809B (en) | 2013-12-01 |
| TW201140393A (en) | 2011-11-16 |
| TW201140498A (en) | 2011-11-16 |
| TWI419075B (en) | 2013-12-11 |
| TW201141204A (en) | 2011-11-16 |
| TW201140491A (en) | 2011-11-16 |
| TW201141205A (en) | 2011-11-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | Motion-based video retargeting with optimized crop-and-warp | |
| US20200184251A1 (en) | System and method for creating navigable views | |
| Krähenbühl et al. | A system for retargeting of streaming video | |
| TWI739151B (en) | Method, device and electronic equipment for image generation network training and image processing | |
| Liu et al. | Optimizing photo composition | |
| Konrad et al. | Learning-based, automatic 2d-to-3d image and video conversion | |
| Su et al. | Preference-aware view recommendation system for scenic photos based on bag-of-aesthetics-preserving features | |
| US20200349391A1 (en) | Method for training image generation network, electronic device, and storage medium | |
| Song et al. | Tri 2-plane: Thinking head avatar via feature pyramid | |
| TW201141212A (en) | Video data processing system | |
| US20110279641A1 (en) | Apparatus, systems, computer-accessible medium and methods for video cropping, temporally-coherent warping and retargeting | |
| Roy et al. | Unmasking deepfake visual content with generative AI | |
| Wu et al. | Multi-source material image optimized selection based multi-option composition | |
| Li et al. | Interactive image/video retexturing using GPU parallelism | |
| Wu et al. | Modeling and rendering of impossible figures | |
| Kim et al. | A study on the possibility of implementing a real-time stereoscopic 3D rendering TV system | |
| CN108810512A (en) | A kind of object-based stereo-picture depth method of adjustment | |
| Kiess et al. | GPU video retargeting with parallelized SeamCrop | |
| Kairanbay et al. | Aesthetic evaluation of facial portraits using compositional augmentation for deep CNNs | |
| Xiang et al. | Panoramic image style transfer technology based on multi-attention fusion | |
| Jin et al. | Face illumination transfer and swapping via dense landmark and semantic parsing | |
| Deo et al. | IndicSideFace: A Dataset for Advancing Deepfake Detection on Side-Face Perspectives of Indian Subjects | |
| WO2018169843A1 (en) | Generation of alpha masks of video frames | |
| Nguyen et al. | Novel evaluation metrics for seam carving based image retargeting | |
| Koçberber et al. | Video retargeting: video saliency and optical flow based hybrid approach |