towhee VS benchmark

As another commenter noted, Milvus is overkill and a "bit much" if you're learning/playing.

A good intro to the field with progression towards a full Milvus implementation could be starting with towhee[0] (which is also supported by Milvus).

towhee has an example to do exactly what you want with CLIP[1].

[0] - https://towhee.io/

[1] - https://github.com/towhee-io/examples/tree/main/image/text_i...

The description of this is kind of confusing but I think the easiest way to understand it is that it is a data processing pipeline of sorts. Take unstructured data and apply transformation and computation. A similar project to this is Towhee (https://github.com/towhee-io/towhee). This project tries to simplify unstructured data processing and provides pretrained models and pipelines from their hub.

Milvus also has incredible flexibility when it comes to choosing an indexing strategy, and we also have a library specifically meant to help vectorize a variety of data called Towhee (https://github.com/towhee-io/towhee).

Benchmarking the models with towhee is as simple as:

I made a tutorial for building an image search engine with python. The code example is as simple as 10 lines of code, using Towhee and Milvus To put images into the search engine:

Traditionally, I've done this through PyTorch by adding a hook, but this requires knowledge of the model itself (i.e. model arch and layer names). I found https://github.com/Hironsan/awesome-embedding-models but it didn't provide many CV-focused open-source projects. There's also https://github.com/towhee-io/towhee which is great but more targeted towards application development.

image_decode and img2img_translation.animegan are predefined operators from towhee hub. We already have nearly a hundred operators, officially maintained or contributed by our users.

We have just released Towhee 0.6, a framework for doing ML jobs over unstructured data. Our latest release includes DataCollection, a new user-centric method-chaining API that enables rapid development and prototyping of embedding applications.

Regarding Milvus. Well, there are a few essential differences between our projects: - Unlike Milvus, we perform filtering during the search in the vector index, which keeps retrieval complexity close to logarithmic - same as in original HNSW. - We can support complex types of filterable payloads like geo-points - it is not a trivial problem to keep the HNSW search graph connected during filtering. We solved it in our custom implementation of the HNSW index. - Unlike Milvus, we perform a query-planning phase to determine an optimal strategy of executing queries with filters - Qdrant uses Rust programming language - it gives us an advantage in avoiding stop-the-world issues of languages with garbage collection. We also have a retrieval speed benchmark - https://github.com/qdrant/benchmark.