Reddit Programming
201 subscribers
1.22K photos
126K links
I will send you newest post from subreddit /r/programming
Download Telegram
Build Custom Image Segmentation Model Using YOLOv8 and SAM
https://www.reddit.com/r/programming/comments/1rsg1i4/build_custom_image_segmentation_model_using/

<!-- SC_OFF -->For anyone studying image segmentation and the Segment Anything Model (SAM), the following resources explain how to build a custom segmentation model by leveraging the strengths of YOLOv8 and SAM. The tutorial demonstrates how to generate high-quality masks and datasets efficiently, focusing on the practical integration of these two architectures for computer vision tasks. Link to the post for Medium users : https://medium.com/image-segmentation-tutorials/segment-anything-tutorial-generate-yolov8-masks-fast-2e49d3598578 You can find more computer vision tutorials in my blog page : https://eranfeit.net/blog/ Video explanation: https://youtu.be/8cir9HkenEY Written explanation with code: https://eranfeit.net/segment-anything-tutorial-generate-yolov8-masks-fast/ This content is for educational purposes only. Constructive feedback is welcome. Eran Feit <!-- SC_ON --> submitted by /u/Feitgemel (https://www.reddit.com/user/Feitgemel)
[link] (https://eranfeit.net/segment-anything-tutorial-generate-yolov8-masks-fast/) [comments] (https://www.reddit.com/r/programming/comments/1rsg1i4/build_custom_image_segmentation_model_using/)
Race conditions in generated code (tested across 10 models, 5 runs)
https://www.reddit.com/r/programming/comments/1rsx3bo/race_conditions_in_generated_code_tested_across/

<!-- SC_OFF -->Most of the web apps I've reviewed over the last year have had race conditions around the LLM requests. I ran a test and found it was systematic. Ten of the most popular LLMs used for coding produce the same race condition by default. They can all resolve the issue if prompted. Here's a full write-up and a link to a Jupyter Notebook if you want to verify. <!-- SC_ON --> submitted by /u/Apprehensive-Put-822 (https://www.reddit.com/user/Apprehensive-Put-822)
[link] (https://forward.deployed.agency/blog/check-call-deduct) [comments] (https://www.reddit.com/r/programming/comments/1rsx3bo/race_conditions_in_generated_code_tested_across/)
Jerry Lawson Doodle is Turing-Complete
https://www.reddit.com/r/programming/comments/1rt1oft/jerry_lawson_doodle_is_turingcomplete/

<!-- SC_OFF -->This system actually fulfills all of the Turing-completeness requirements. -It has an unbounded memory system (i.e. the infinite level editor)
-It has conditional branching in the form of portals
-It can loop arbitrarily (if you program it right)
-It can store memory and read it whenever needed in the form of pushable blocks. In this full adder, a 0 means collecting the key with the Jerry on the left and making the right Jerry fall, while a 1 means making the Jerry on the left go through the portal, allowing the right Jerry to go to the portal on the right. If you input a 0, walk left until the left Jerry pops out. If you input a 1, walk right and jump (jumping isn't necessary to enter the portal as the right Jerry) For the sum and carry blocks, left=0, right=1. Enter the portal whose number is 1 more than the one you came out of in the carry block section. A NAND gate is easily constructible if you put 2 keys and 2 locks instead. <!-- SC_ON --> submitted by /u/TeamReamy2 (https://www.reddit.com/user/TeamReamy2)
[link] (https://share.google/BlMKq4FQPCy5a0Ss7) [comments] (https://www.reddit.com/r/programming/comments/1rt1oft/jerry_lawson_doodle_is_turingcomplete/)