2007-06-04 07:28:34 +00:00
|
|
|
/*
|
2007-07-05 19:53:34 +00:00
|
|
|
* Copyright (C) 2007 Vitor Sessak <vitor1001@gmail.com>
|
2007-06-04 07:28:34 +00:00
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* This file is part of Libav.
|
2007-06-04 07:28:34 +00:00
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is free software; you can redistribute it and/or
|
2007-06-04 07:28:34 +00:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is distributed in the hope that it will be useful,
|
2007-06-04 07:28:34 +00:00
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
2011-03-18 17:35:10 +00:00
|
|
|
* License along with Libav; if not, write to the Free Software
|
2007-06-04 07:28:34 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
|
2008-08-31 07:39:47 +00:00
|
|
|
#ifndef AVCODEC_ELBG_H
|
|
|
|
#define AVCODEC_ELBG_H
|
2007-06-17 00:01:30 +00:00
|
|
|
|
2009-03-20 10:47:02 +00:00
|
|
|
#include "libavutil/lfg.h"
|
2007-06-04 07:28:34 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Implementation of the Enhanced LBG Algorithm
|
|
|
|
* Based on the paper "Neural Networks 14:1219-1237" that can be found in
|
|
|
|
* http://citeseer.ist.psu.edu/patan01enhanced.html .
|
|
|
|
*
|
|
|
|
* @param points Input points.
|
|
|
|
* @param dim Dimension of the points.
|
|
|
|
* @param numpoints Num of points in **points.
|
|
|
|
* @param codebook Pointer to the output codebook. Must be allocated.
|
|
|
|
* @param numCB Number of points in the codebook.
|
|
|
|
* @param num_steps The maximum number of steps. One step is already a good compromise between time and quality.
|
|
|
|
* @param closest_cb Return the closest codebook to each point. Must be allocated.
|
2009-03-21 16:14:55 +00:00
|
|
|
* @param rand_state A random number generator state. Should be already initialized by av_lfg_init().
|
2007-06-04 07:28:34 +00:00
|
|
|
*/
|
|
|
|
void ff_do_elbg(int *points, int dim, int numpoints, int *codebook,
|
|
|
|
int numCB, int num_steps, int *closest_cb,
|
2009-03-08 17:43:12 +00:00
|
|
|
AVLFG *rand_state);
|
2007-06-04 07:28:34 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Initialize the **codebook vector for the elbg algorithm. If you have already
|
|
|
|
* a codebook and you want to refine it, you shouldn't call this function.
|
|
|
|
* If numpoints < 8*numCB this function fills **codebook with random numbers.
|
|
|
|
* If not, it calls ff_do_elbg for a (smaller) random sample of the points in
|
|
|
|
* **points. Get the same parameters as ff_do_elbg.
|
|
|
|
*/
|
|
|
|
void ff_init_elbg(int *points, int dim, int numpoints, int *codebook,
|
|
|
|
int numCB, int num_steps, int *closest_cb,
|
2009-03-08 17:43:12 +00:00
|
|
|
AVLFG *rand_state);
|
2007-06-17 00:01:30 +00:00
|
|
|
|
2008-08-31 07:39:47 +00:00
|
|
|
#endif /* AVCODEC_ELBG_H */
|