Macrosยง
- search_
pattern ๐ - Declares an array of motion vectors in structure of arrays syntax.
Compared to
search_pattern_subpel, this version creates motion vectors in fullpel resolution (x8). - search_
pattern_ ๐subpel - Declares an array of motion vectors in structure of arrays syntax.
Structsยง
- MVCandidateRD
- Holds data from computing rate distortion of a motion vector.
- Motion
Search Result - Result of motion search.
Constantsยง
- DIAMOND_
R1_ ๐PATTERN - Diamond pattern of radius 1 as shown below. Unlike
DIAMOND_R1_PATTERN, the vectors have been shifted fullpel scale. - DIAMOND_
R1_ ๐PATTERN_ SUBPEL - Diamond pattern of radius 1 as shown below. For fullpel search, use
DIAMOND_R1_PATTERN_FULLPELsince it has been scaled for fullpel search. - HEXAGON_
PATTERN ๐ - A hexagon pattern around a center point. The pattern is ordered so that the offsets circle around the center. This is done to allow pruning locations covered by the last iteration.
- SQUARE_
REFINE_ ๐PATTERN - A small square pattern around a center point.
- UMH_
PATTERN ๐ - Uneven multi-hexagon search pattern around a center point. Used for locating irregular movement.
Functionsยง
- compute_
motion_ ๐vectors - compute_
mv_ ๐rd - Compute the rate distortion stats for a motion vector.
- diff_
to_ ๐rate - estimate_
inter_ ๐costs - estimate_
motion ๐ - estimate_
sb_ ๐motion - estimate_
tile_ ๐motion - full_
pixel_ ๐me - full_
search ๐ - fullpel_
diamond_ ๐search - Run a full pixel diamond search. The search is run on multiple step sizes.
- get_
best_ ๐predictor - get_
fullpel_ ๐mv_ rd - get_
mv_ ๐range - get_
mv_ ๐rate - get_
subpel_ ๐mv_ rd - get_
subset_ ๐predictors - hexagon_
search ๐ - Perform hexagon search and refine afterwards.
- refine_
subsampled_ ๐motion_ estimate - Refine motion estimation that was computed one level of subsampling up.
- refine_
subsampled_ ๐sb_ motion - save_
me_ ๐stats - sub_
pixel_ ๐me - subpel_
diamond_ ๐search - Run a subpixel diamond search. The search is run on multiple step sizes.
- uneven_
multi_ ๐hex_ search - Perform an uneven multi-hexagon search. There are 4 stages: