Focused crawls are collections of frequently-updated webcrawl data from narrow (as opposed to broad or wide) web crawls, often focused on a single domain or subdomain.
This is project page for the paper "RG-Flow: a hierarchical and explainable flow model based on renormalization group and sparse prior". Paper link: https://arxiv.org/abs/2010.00029
The documentation at this point is in a very poor state at this point. We need to do considerable effort and I suggest that we adhere to NumPy style docstrings
C and MATLAB implementation of CS recovery algorithm, i.e. Orthogonal Matching Pursuit, Approximate Message Passing, Iterative Hard Thresholding Algorithms
Point cloud completion tool based on dictionary learning. Takes a PCL point cloud surface and fills in gaps or densifies sparse regions by learning from the various surface features of the cloud. This is done using a variation of the k-SVD dictionary learning algorithm that allows for continuous atoms and dealing with unstructured point cloud data. Written in Qt C++, using Eigen, OpenMP, and OpenGL.
Code for paper "Efficient Sparse Coding using Hierarchical Riemannian Pursuit," in IEEE Transactions on Signal Processing, Y. Xue, V. K. N. Lau and S. Cai, doi: 10.1109/TSP.2021.3093769.
The documentation at this point is in a very poor state at this point. We need to do considerable effort and I suggest that we adhere to NumPy style docstrings