[XviD-devel] re: BITS

[Christoph Lampert]

On Mon, 12 May 2003 syskin at ihug.com.au wrote:

> Hi,
> 
> gruel wrote
> > Maybe one shouldn't just compare BITS, but use the usual lagrangian R-D
> 
> > value = lambda*bits + distorsion
> 
> > where lambda = 0.85 * quant*quant (for MSE distorsion measure)
> > or some similar value (e.g. 1 to 1.15 was better in my tests). 
> 
> That would probably be much better :) I wonder how slow would it be...
> I'll do that.

Not much slower. I guess dequant and calc of SSE can be done in the same
loop as counting bits.
 
> > But my real question is: Why was encoding _faster_ when BITS was activated
> > for halfpelrefine. I can imagine BITS for whole search being faster, if
> > the search terminates much too early. But refinement is always done. How
> > can a slower refinement step speed up the encoding? 
> 
> I haven't even noticed that... so yes, it's definitely buggy.

First assumption: If BITS is set for refinement. Is ordinary _search_ done
at all? 

gruel