{"title":"运动估计的参数翘曲","authors":"Aria Nosratinia","doi":"10.1109/DCC.1997.582124","DOIUrl":null,"url":null,"abstract":"Summary form only given. In warping (also known as mesh-based) motion estimation, motion vectors at individual pixels are computed through an interpolation of a subsampled set of motion vectors. A method for calculating optimal warping coefficients was introduced previously. This algorithm finds the interpolation coefficients, at each individual pixel location (within a block), such that the mean squared luminance errors are minimized. It has been observed that optimal coefficients vary widely with time and across different sequences. This observation motivates the optimization of the warping coefficients locally in time. However, doing so requires the encoder to transmit the coefficients to the decoder. Assuming a 16/spl times/16 block and four floating point coefficients per pixel, this would require a considerable overhead in bitrate. Especially in low bitrate regimes, such overhead is likely to be unacceptable. This paper proposes a parametric class of functions to represent the warping interpolation kernels. More specifically, we propose to use the two-parameter family of functions.","PeriodicalId":403990,"journal":{"name":"Proceedings DCC '97. Data Compression Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Parametric warping for motion estimation\",\"authors\":\"Aria Nosratinia\",\"doi\":\"10.1109/DCC.1997.582124\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. In warping (also known as mesh-based) motion estimation, motion vectors at individual pixels are computed through an interpolation of a subsampled set of motion vectors. A method for calculating optimal warping coefficients was introduced previously. This algorithm finds the interpolation coefficients, at each individual pixel location (within a block), such that the mean squared luminance errors are minimized. It has been observed that optimal coefficients vary widely with time and across different sequences. This observation motivates the optimization of the warping coefficients locally in time. However, doing so requires the encoder to transmit the coefficients to the decoder. Assuming a 16/spl times/16 block and four floating point coefficients per pixel, this would require a considerable overhead in bitrate. Especially in low bitrate regimes, such overhead is likely to be unacceptable. This paper proposes a parametric class of functions to represent the warping interpolation kernels. More specifically, we propose to use the two-parameter family of functions.\",\"PeriodicalId\":403990,\"journal\":{\"name\":\"Proceedings DCC '97. Data Compression Conference\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '97. Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1997.582124\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '97. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1997.582124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Summary form only given. In warping (also known as mesh-based) motion estimation, motion vectors at individual pixels are computed through an interpolation of a subsampled set of motion vectors. A method for calculating optimal warping coefficients was introduced previously. This algorithm finds the interpolation coefficients, at each individual pixel location (within a block), such that the mean squared luminance errors are minimized. It has been observed that optimal coefficients vary widely with time and across different sequences. This observation motivates the optimization of the warping coefficients locally in time. However, doing so requires the encoder to transmit the coefficients to the decoder. Assuming a 16/spl times/16 block and four floating point coefficients per pixel, this would require a considerable overhead in bitrate. Especially in low bitrate regimes, such overhead is likely to be unacceptable. This paper proposes a parametric class of functions to represent the warping interpolation kernels. More specifically, we propose to use the two-parameter family of functions.