Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
snyy
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
snyy
6d ago
Happy to hear it!
2.
▲
by
snyy
6d ago
Demo runs on an AWS VM with L4 GPUs. We don't record any logs/data, so feel free to use the demo on whatever images you want. MultiMatte is open source, so you can also run the model locally or in your VM too
3.
▲
Show HN: MultiMatte, a Promptable Image Background Removal Model
(usefeyn.com)
57 points
by
snyy
6d ago
|
8 comments
4.
▲
by
snyy
2mo ago
Our blog covers this: https://usefeyn.com/blog/feynobg/#strength-in-diverse-data Recapping here: Our first train was on 4,000 images from the MaskFactory dataset alone. This improved some benchmarks but regressed
5.
▲
by
snyy
2mo ago
Your question touches on excellent points. > what is the subject? FeyNoBg is an "automatic" model. It automatically detects foreground elements and segments the image. Most of the time, this includes all foreground elements. As
6.
▲
by
snyy
2mo ago
This pertains to the larger open source licensing discussions that have been happening (as I'm sure you've seen too). We've released projects under the MIT license before, most notably https://github.com/feyni
7.
▲
by
snyy
2mo ago
Please do try, I would love nothing more! All I ask is you make a PR to https://github.com/feyninc/nobg with your results. We'd love to see what you make, contribute in any way we can, and share onwards.
8.
▲
by
snyy
2mo ago
We resize the opacity mask. That tends to scale better
9.
▲
by
snyy
2mo ago
Thanks! Feel free to open an issue if you run into any issues with the outputs https://github.com/feyninc/nobg/issues
10.
▲
by
snyy
2mo ago
The 4K cap was a judgement call, we didn't want one source to dominate. The license is cc-by-nc, just added it to the hugging face
11.
▲
Show HN: FeyNoBg – Automatic background removal model and training library
(usefeyn.com)
121 points
by
snyy
2mo ago
|
29 comments
12.
▲
by
snyy
2mo ago
Exactly this. Thank you for answering!
13.
▲
by
snyy
2mo ago
Ah yes, I meant accuracy.
14.
▲
by
snyy
2mo ago
Yes. I tried it with https://www.allbirds.com/products/womens-cruiser-canvas on our HF space and Pulpie worked great. HF Space: https://huggingface.co/spaces/feyninc/pulpie
15.
▲
by
snyy
2mo ago
Images pass through as they are considered main content. Same with tables. Pulpie will return all main content on a page as HTML/Markdown. I’m not sure I fully understand “which one this is good at?”. perhaps you can try the model on h
16.
▲
by
snyy
2mo ago
We see far better performance with models. Heuristics break on richer content like codeblocks, formulae, quotes, etc. In our testing, our model was 25 F1 points better than Trafilatura.
17.
▲
by
snyy
2mo ago
Fixed. Try again. Let me know if any other issues
18.
▲
by
snyy
2mo ago
Thanks! Good questions: We haven't run a targeted eval against SEO spam yet. However, with Pulpie, each block gets labeled by what the text actually says rather than what the tags look like. Wrapping boilerplate in semantic tags fools
19.
▲
by
snyy
2mo ago
Funnily enough, that wasn't my first choice either. I A/B tested it with a small group and people understood "up and to the right is better" faster.
20.
▲
Show HN: Pulpie – Models for Cleaning the Web
(usefeyn.com)
106 points
by
snyy
2mo ago
|
26 comments
21.
▲
Show HN: Pulpie – Pareto-Optimal Models for Cleaning the Web
(usefeyn.com)
1 points
by
snyy
3mo ago
|
0 comments
22.
▲
by
snyy
8mo ago
You have the right understanding. We've found that maximizing chunk size gives the best retrieval performance and is easier to maintain since you don't have to customize chunking strategy per document type. The upper limit for chu
23.
▲
by
snyy
8mo ago
As the other comment said, its a practice in good enough chunks quality. We focus on big chunks (largest we can make without hurting embedding quality) as fast as possible. In our experience, retrieval accuracy is mostly driven by embedding
24.
▲
by
snyy
8mo ago
No, delimiters can be multiple bytes. They have to be passed as a pattern. // With multi-byte pattern let metaspace = "<japanese_full_stop>".as_bytes(); let chunks: Vec<&[u8]> = chunk(text).pattern(metasp
25.
▲
by
snyy
8mo ago
A big chunk size with overlap solves this. Chunks don't have to be be "perfectly" split in order to work well.
26.
▲
by
snyy
8mo ago
Which language are you thinking of? Ideally, how would you identify split points in this language? I suppose we've only tested this with languages that do have delimiters - Hindi, English, Spanish, and French There are two ways to cont
27.
▲
by
snyy
8mo ago
> Chunking is generally a one-time process where users aren't latency sensitive. This is not necessarily true. For example, in our use case we are constantly monitoring websites, blogs, and other sources for changes. When a new page
28.
▲
by
snyy
8mo ago
Memchunk is already in Chonkie as the `FastChunker` To install: pip install chonkie[fast] ``` from chonkie import FastChunker chunker = FastChunker(chunk_size=4096) chunks = chunker(huge_document) ```
29.
▲
So, you want to chunk really fast?
(minha.sh)
153 points
by
snyy
8mo ago
|
42 comments
30.
▲
by
snyy
8mo ago
We're the maintainers of Chonkie, a chunking library for RAG pipelines. Recently, we've been using Chonkie to build deep research agents that watch topics for new developments and automatically update their reports. This requires
More ›