11 citations · 13 across the 4 of their papers we have counts for
4 papers
Machine learning on images using a string-distance
Uzi Chester, Joel Ratsaby
We present a new method for image feature-extraction which is based on representing an image by a finite-dimensional vector of distances that measure how different the image is fro…
Descriptive-complexity based distance for fuzzy sets
Laszlo Kovacs, Joel Ratsaby
A new distance function dist(A,B) for fuzzy sets A and B is introduced. It is based on the descriptive complexity, i.e., the number of bits (on average) that are needed to describe…
An algorithmic complexity interpretation of Lin's third law of information theory
Joel Ratsaby
Instead of static entropy we assert that the Kolmogorov complexity of a static structure such as a solid is the proper measure of disorder (or chaoticity). A static structure in a…
On the Complexity of Binary Samples
Joel Ratsaby
Consider a class $\mH$ of binary functions on a finite interval $X=[0, B]\subset \Real$. Define the {\em sample width} of on a finite subset (a sample) $S\s…