|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--edu.wlu.cs.levy.RAAM.IFSDecoder
IFSDecoder is a class supporting multi-dimensional IFS attractor and tree computations by Monte-Carlo sampling. Based on
@PhdThesis{LevyThesis, author = {S.D. Levy}, title = {Infinite RAAM: Initial Explorations into a Fractal Basis for Cognition}, school = {Brandeis University}, year = {2002}, address = {Waltham, Mass.}, }
Constructor Summary | |
IFSDecoder(double[][] w)
Creates an IFSDecoder, using K x (D^2+D) array of IFS transform weights, where K is # of transforms, D is # of dimensions. |
|
IFSDecoder(double[][] w,
double[] b)
Creates an IFSDecoder using weights and biases. |
|
IFSDecoder(double[] w,
int k)
Creates an IFSDecoder using one-dimensional array of weights. |
|
IFSDecoder(edu.wlu.cs.levy.RAAM.RAAM raam)
Construct decoder from RAAM network. |
Method Summary | |
double[][] |
getAttractor(int m,
int n)
Returns attractor points as array. |
double[][] |
getAttractor(int m,
int n,
long seed)
Returns attractor points as array. |
double[][] |
getAttractor(int m,
int n,
java.util.Random r)
Returns attractor points as array. |
edu.wlu.cs.levy.RAAM.Tree[] |
getTrees(int m,
int n,
double e)
Returns array of M trees by Monte Carlo sampling in [0,N)^D. |
edu.wlu.cs.levy.RAAM.Tree[] |
getTrees(int m,
int n,
double e,
long seed)
Returns array of M trees by Monte Carlo sampling in [0,N)^D. |
edu.wlu.cs.levy.RAAM.Tree[] |
getTrees(int m,
int n,
double e,
java.util.Random r)
Returns array of M trees by Monte Carlo sampling in [0,N)^D. |
edu.wlu.cs.levy.RAAM.Tree[] |
getTrees(int m,
int n,
edu.wlu.cs.levy.RAAM.Vectionary d,
double e)
Returns array of M trees by Monte Carlo sampling in [0,N)^D. |
edu.wlu.cs.levy.RAAM.Tree[] |
getTrees(int m,
int n,
edu.wlu.cs.levy.RAAM.Vectionary d,
double e,
long seed)
Returns array of M trees by Monte Carlo sampling in [0,N)^D. |
edu.wlu.cs.levy.RAAM.Tree[] |
getTrees(int m,
int n,
edu.wlu.cs.levy.RAAM.Vectionary d,
double e,
java.util.Random r)
Returns array of M trees by Monte Carlo sampling in [0,N)^D. |
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public IFSDecoder(double[][] w, double[] b)
w
- weightsb
- biasespublic IFSDecoder(double[] w, int k)
w
- linearized IFSDecoder weightsk
- number of IFSDecoder transformspublic IFSDecoder(double[][] w)
w
- IFS transform weightspublic IFSDecoder(edu.wlu.cs.levy.RAAM.RAAM raam)
raam
- RAAM networkMethod Detail |
public double[][] getAttractor(int m, int n, java.util.Random r)
m
- number of sample pointsn
- number of IFS iterationsr
- random-number generator
public double[][] getAttractor(int m, int n, long seed)
m
- number of sample pointsn
- number of IFS iterationsseed
- seed for random-number generator
public double[][] getAttractor(int m, int n)
m
- number of sample pointsn
- number of IFS iterations
public edu.wlu.cs.levy.RAAM.Tree[] getTrees(int m, int n, edu.wlu.cs.levy.RAAM.Vectionary d, double e, java.util.Random r) throws java.lang.RuntimeException
m
- number of points to samplen
- number of IFS iterations (= max tree depth)d
- dictionary for labeling pointse
- epsilon distance from dictionary entriesr
- random-number generator
java.lang.RuntimeException
public edu.wlu.cs.levy.RAAM.Tree[] getTrees(int m, int n, edu.wlu.cs.levy.RAAM.Vectionary d, double e, long seed) throws java.lang.RuntimeException
m
- number of points to samplen
- number of IFS iterations (= max tree depth)d
- dictionary for labeling pointse
- epsilon distance from dictionary entriesseed
- seed for random-number generator
java.lang.RuntimeException
public edu.wlu.cs.levy.RAAM.Tree[] getTrees(int m, int n, edu.wlu.cs.levy.RAAM.Vectionary d, double e) throws java.lang.RuntimeException
m
- number of points to samplen
- number of IFS iterations (= max tree depth)d
- dictionary for labeling pointse
- epsilon distance from dictionary entries
java.lang.RuntimeException
public edu.wlu.cs.levy.RAAM.Tree[] getTrees(int m, int n, double e, java.util.Random r) throws java.lang.RuntimeException
m
- number of points to samplen
- number of IFS iterations (= max tree depth)e
- epsilon distance from attractorr
- random-number generator
java.lang.RuntimeException
public edu.wlu.cs.levy.RAAM.Tree[] getTrees(int m, int n, double e, long seed) throws java.lang.RuntimeException
m
- number of points to samplen
- number of IFS iterations (= max tree depth)e
- epsilon distance from dictionary entriesseed
- seed for random-number generator
java.lang.RuntimeException
public edu.wlu.cs.levy.RAAM.Tree[] getTrees(int m, int n, double e) throws java.lang.RuntimeException
m
- number of points to samplen
- number of IFS iterations (= max tree depth)e
- epsilon distance from attractor
java.lang.RuntimeException
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |