[go: up one dir, main page]
Menu ▾ ▴

Code Commit Log


Commit Date  
[r574] by ltilib

alvarado: @ADD: The lti::multiclassNormalizedCuts functor implements the k-class normalized cuts algorithms used to optimally split a graph into k disconnected subgraphs proposed by Stella Yu in her Ph.D thesis. It requires as input the affinity matrix, which encodes the similarity between two nodes and returns a labels vector, which contains the label assignments for each node.

 2003-10-21 04:03:20 Tree
[r573] by ltilib

sltilib: Now compiles also with MS Visual C++

 2003-10-21 04:03:11 Tree
[r572] by ltilib

alvarado: Doxygen warnings fixed.

 2003-10-21 04:02:59 Tree
[r571] by ltilib

schnurr: added missing include limits

 2003-10-21 04:02:50 Tree
[r570] by ltilib

alvarado: @ADD: The edge detection algorithm of Gevers and Stokman has been implemented (lti::colorEdgesGS), which is capable to classify the edges in shadow, highlight or material edges. Is not as fast as lti::cannyEdges for color images, but the categorization of edges can be useful in those applications where the algorithm works.

 2003-10-21 04:02:39 Tree
[r569] by ltilib

sltilib: small MVC bug

 2003-10-21 04:02:19 Tree
[r568] by ltilib

alvarado: Towards compatibility with Visual .NET 2003

 2003-10-21 04:02:10 Tree
[r567] by ltilib

doerfler: @ADD: DBScan is a graph-based clustering algorithm. The number of clusters is dependent on a threshold and clusters are not neccessarily compact.

 2003-10-21 04:01:56 Tree
[r566] by ltilib

alvarado: @ADD: The separable kernels (lti::sepKernel<T>) now have also a method apply() to apply a C-like function to each one of its elements.

 2003-10-20 10:04:16 Tree
[r565] by ltilib

alvarado: @ADD: The lti::colorContrastGradient functor now provides an apply method to get the gradient of a single channel.

 2003-10-20 10:04:03 Tree
Older >