`
`i. An encoder, comprising:
`
`circuitry: and
`
`memory, wherein
`
`using the memory, the circuitry:
`
`calculates a cost that is an evaluation value for a current block to be
`
`encoded, for each of a plurality of search points included in a first set, the
`
`plurality of search points being a plurality of pixel positions in a reference
`
`picture:
`
`determines whether a base search point has a lowest cost among the
`
`base search point and a plurality of neighboring search points whichspatially
`
`neighbor the base search point,
`
`the base search point and the plurality of
`
`neighboring search points being included in the first set as the plurality of
`
`search points:
`
`when the base search point is determined to have the lowest cost among
`
`the base search point and the plurality of neighboring search points, selects the
`
`base search point as a first best search point:
`
`when the base search point is determined not to have the lowest cost
`
`among the base search point and the plurality of neighboring search points,
`
`20
`
`calculates a cost that is the evaluation value for the current block, for each ofa
`
`plurality of search points which spatially neighbor the base search point and
`
`are included in a second set different from the first set:
`
`selects a search point having a lowest cost from among the first set and
`
`the secondset, as a second best search point; and
`
`25
`
`encodes the current block, using a motion vector corresponding to the
`
`first best search point or the secondbest search point.
`
`91
`
`
`
`2. The encoder according to claim 1, wherein
`
`the circuitry:
`
`when the second best search point is selected,
`
`further determines whether an end condition to end an update of the
`
`Or
`
`base searchpoint is satisfied:
`
`when the end condition is determined not to be satisfied,
`
`updates the base search point to the secondbest search point, and
`
`sélects the first best search point based on the base search point
`
`updated or repeats selecting the second best search point; and
`
`when the end condition is determined to be satisfied,
`
`encodes the current block, using a motion vector corresponding to the
`
`second best search point selected mast recently.
`
`3. The encoder according to claim 1, wherein
`
`the circuitry:
`
`uses a pixel position indicated based on a motion vector of an encoded
`
`block, as the base search point; and
`
`when the cost is calculated for a search point inchided in the first set or
`
`the second set,
`
`20
`
`calculates the cost based on @ an image of a region indicated by the
`
`search point in the reference picture and Gi) a base image, and
`
`the base image
`
`is an image which is obtained from at least one encoded block which is
`
`used for deriving a motion vector of the current block instead of the current
`
`25
`
`block.
`
`4, The encoder according to claim 1, wherein
`
`92
`
`
`
`the circuitry:
`
`uses a pixel position indicated based on a motion vector of an encoded
`
`block, as the base search point; and
`
`when the cost is calculated for a search point included in the first set or
`
`Or
`
`the secondset,
`
`calculates the cost based on G) an image of a region indicated by the
`
`search point in the reference picture and (ii) a base image, and
`
`the base image is an imageof the current block.
`
`5. The encoder according to claim 8, whereim
`
`whenthe cost is calculated for the search point included in the first set
`
`or the second set,
`
`the circuitry calculates the cost using at least a distortion of the image
`
`of the region with respect to the base image.
`
`6. A decoder, comprising:
`
`circuitry; and
`
`memory, wherein
`
`using the memory, the circuitry:
`
`20
`
`calculates a cost that is an evaluation value for a current block to be
`
`decoded, for each of a plurality of search points included in afirst set, the
`
`plurality of search points being a plurality of pixel positions in a reference
`
`picture:
`
`determines whether a base search point has a lowest cost among the
`
`25
`
`base search point and a plurality of neighboring search points which spatially
`
`neighbor the base search point,
`
`the base search poimt and the plurality of
`
`neighboring search points being included in the first set as the plurality of
`
`
`
`search points:
`
`when the base search point is determined to have the lowest cost among
`
`the base search poimt and the plurality of neighboring search points, selects the
`
`base search point as a first best search point:
`
`when the base search point is determined not to have the lowest cost
`
`among the base search point and the plurality of neighboring search points,
`
`calculates a cost that is the evaluation value for the current block, for each ofa
`
`plurality of search points which spatially neighbor the base search point and
`
`are included in a second set different from the first set:
`
`selects a search point having a lowest cost from among the first set and
`
`the secondset, as a second best searchpoint; and
`
`decodes the current block, using a motion vector corresponding to the
`
`first best search point or the second best search point.
`
`7. The decoder according to claim 6, wherein
`
`the circuitry:
`
`when the second best search point is selected,
`
`further determines whether an end condition to end an update of the
`
`base search point is satisfied:
`
`20
`
`when the end condition is determined not to be satisfied,
`
`updates the base search point to the second best search point, and
`
`selects the first best search point based on the base search point
`
`updated or repeats selecting the secondbest search point; and
`
`when the end condition is determined to be satisfied,
`
`25
`
`decodes the current block, using a motion vector corresponding to the
`
`second best search point selected most recently.
`
`94
`
`
`
`8. The decoder according to claim 6, wherein
`
`the circuitry:
`
`uses a pixel position indicated based on a motion vector of a decoded
`
`block, as the base search point) and
`
`when the cost is calculated for the search point included in the first set
`
`or the second set,
`
`calculates the cost based on G) an image of a region indicated by the
`
`search point in the reference picture and Gi) a base image, and
`
`the base image
`
`is an image whichis obtained fromat least one decoded block whichis
`
`used for deriving a motion vector of the current block instead of the current
`
`block.
`
`9. The decoder according to claim $8, wherein
`
`when the cost is calculated for the search point included in the first set
`
`or the second set,
`
`the circuitry calculates the cost using at least a distortion of the image
`
`of the region with respect to the base image.
`
`20
`
`id. An encoding method, comprising:
`
`calculating a cost that is an evaluation value for a current block to be
`
`encoded, for each of a plurality of search points included in a first set, the
`
`plurality of search points being a plurality of pixel positions in a reference
`
`picture;
`
`25
`
`determining whether a base search point has a lowest cost among the
`
`base search point and a plurality of neighboring search points whichspatially
`
`neighbor the base search point,
`
`the base search point and the plurality of
`
`
`
`neighboring search points being included in the first set as the plurality of
`
`search points:
`
`when the base search pot is determined to have the lowest cost among
`
`the base search point and the plurality of neighboring search points, selecting
`
`the base search point as a first best search point:
`
`when the base search point is determined not to have the lowest cost
`
`among the base search point and the plurality of neighboring search points,
`
`calculating a cost that is the evaluation value for the current block, for eachofa
`
`plurality of search poimts which spatially neighbor the base search point and
`
`are included in a second set different from the first set:
`
`selecting a search point having a lowest cost from among the first set
`
`and the second set, as a second best search point: and
`
`encoding the current block, using a motion vector corresponding to the
`
`first best search point or the second best search point.
`
`11. A decoding method, comprising:
`
`calculating a cost that is an evaluation value for a current block to be
`
`decoded, for each of a plurality of search points included in a first set, the
`
`plurality of search points being a plurality of pixel positions in a reference
`
`20
`
`picture:
`
`determining whether a base search point has a lowest cost among the
`
`base search point and aplurality of neighboring search points which spatially
`
`neighbor the base search point,
`
`the base search point and the plurality of
`
`neighboring search points being included in the first set as the plurality of
`
`25
`
`search points:
`
`when the base search point is determined to have the lowest cost among
`
`the base search point andthe plurality of neighboring search points, selecting
`
`96
`
`
`
`the base search point as a first best search point:
`
`when the base search point is determined not to have the lowest cost
`
`among the base search point and the plurality of neighboring search points,
`
`calculating a cost that is the evaluation value for the current block, for eachofa
`
`plurality of search points which spatially neighbor the base search point and
`
`are included in a second set different from the first set;
`
`selecting a search point having a lowest cost from among thefirst set
`
`andthe second set, as a secondbest search point: and
`
`decoding the current block, using a motion vector corresponding to the
`
`Q
`
`first best search point or the second best searchpoint.
`
`97
`
`
Accessing this document will incur an additional charge of $.
After purchase, you can access this document again without charge.
Accept $ ChargeStill Working On It
This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.
Give it another minute or two to complete, and then try the refresh button.
A few More Minutes ... Still Working
It can take up to 5 minutes for us to download a document if the court servers are running slowly.
Thank you for your continued patience.
This document could not be displayed.
We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.
Your account does not support viewing this document.
You need a Paid Account to view this document. Click here to change your account type.
Your account does not support viewing this document.
Set your membership
status to view this document.
With a Docket Alarm membership, you'll
get a whole lot more, including:
- Up-to-date information for this case.
- Email alerts whenever there is an update.
- Full text search for other cases.
- Get email alerts whenever a new case matches your search.
One Moment Please
The filing “” is large (MB) and is being downloaded.
Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.
Your document is on its way!
If you do not receive the document in five minutes, contact support at support@docketalarm.com.
Sealed Document
We are unable to display this document, it may be under a court ordered seal.
If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.
Access Government Site