<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: BalKrishna Mehta</title>
    <description>The latest articles on DEV Community by BalKrishna Mehta (@balkrishna_mehta_5861b8b9).</description>
    <link>https://dev.to/balkrishna_mehta_5861b8b9</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F4173902%2Fc15dc424-b5fe-44a8-bbe2-f965f627f706.jpg</url>
      <title>DEV Community: BalKrishna Mehta</title>
      <link>https://dev.to/balkrishna_mehta_5861b8b9</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/balkrishna_mehta_5861b8b9"/>
    <language>en</language>
    <item>
      <title>Desire paths are pull requests the city never merged</title>
      <dc:creator>BalKrishna Mehta</dc:creator>
      <pubDate>Sun, 11 Oct 2026 19:47:55 +0000</pubDate>
      <link>https://dev.to/balkrishna_mehta_5861b8b9/desire-paths-are-pull-requests-the-city-never-merged-doh</link>
      <guid>https://dev.to/balkrishna_mehta_5861b8b9/desire-paths-are-pull-requests-the-city-never-merged-doh</guid>
      <description>&lt;p&gt;&lt;em&gt;This is a submission for the &lt;a href="https://dev.to/challenges/hacktoberfest-week1-2026-10-05"&gt;Hacktoberfest Open-Source AI Challenge Week 1: Touch Grass&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  devchallenge #hf26challenge #gemma #tabpfn
&lt;/h1&gt;

&lt;h2&gt;
  
  
  What I Built
&lt;/h2&gt;

&lt;p&gt;In Utrecht a desire path is an &lt;em&gt;olifantenpaadje&lt;/em&gt;: grass worn off because people cut the corner the pavement took. The official walk is already on the map. The shortcut is the line the map never accepted.&lt;/p&gt;

&lt;p&gt;Desire Lines looks for those cuts inside one box, 5.09°E, 52.075°N to 5.155°E, 52.125°N. Geometry comes from a Geofabrik OpenStreetMap extract. The pixels come from PDOK, the Dutch 25 cm orthophoto. A local Gemma model looks at each aerial chip and answers yes, no, or unclear. The pipeline writes a map, a GPX file, a printable field card, and mapper tasks. I have not walked the route. Nothing is written to OpenStreetMap.&lt;/p&gt;

&lt;h2&gt;
  
  
  Demo
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://desire-lines.vercel.app" rel="noopener noreferrer"&gt;https://desire-lines.vercel.app&lt;/a&gt;&lt;/p&gt;


&lt;div class="crayons-card c-embed text-styles text-styles--secondary"&gt;
    &lt;div class="c-embed__content"&gt;
      &lt;div class="c-embed__body flex items-center justify-between"&gt;
        &lt;a href="https://desire-lines.vercel.app" rel="noopener noreferrer" class="c-link fw-bold flex items-center"&gt;
          &lt;span class="mr-2"&gt;desire-lines.vercel.app&lt;/span&gt;
          

        &lt;/a&gt;
      &lt;/div&gt;
    &lt;/div&gt;
&lt;/div&gt;


&lt;p&gt;The map is central Utrecht. It draws 40 candidates. Click a line and a card opens with the length, the seconds that detour would save, the wear number, and a verdict.&lt;/p&gt;

&lt;p&gt;The field tab links a GPX file, an A6 card, and mapper tasks. The card lists eight stops. The boxes for worn, faint, gone, and paved are empty.&lt;/p&gt;

&lt;h2&gt;
  
  
  Code
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://github.com/BalkrishnaMehta/desire-lines/" rel="noopener noreferrer"&gt;https://github.com/BalkrishnaMehta/desire-lines/&lt;/a&gt;&lt;/p&gt;


&lt;div class="ltag-github-readme-tag"&gt;
  &lt;div class="readme-overview"&gt;
    &lt;h2&gt;
      &lt;img src="https://assets.dev.to/assets/github-logo-5a155e1f9a670af7944dd5e12375bc76ed542ea80224905ecaf878b9157cdefc.svg" alt="GitHub logo"&gt;
      &lt;a href="https://github.com/BalkrishnaMehta" rel="noopener noreferrer"&gt;
        BalkrishnaMehta
      &lt;/a&gt; / &lt;a href="https://github.com/BalkrishnaMehta/desire-lines" rel="noopener noreferrer"&gt;
        desire-lines
      &lt;/a&gt;
    &lt;/h2&gt;
    &lt;h3&gt;
      
    &lt;/h3&gt;
  &lt;/div&gt;
  &lt;div class="ltag-github-body"&gt;
    
&lt;div id="readme" class="md"&gt;&lt;div class="markdown-heading"&gt;
&lt;h1 class="heading-element"&gt;Desire Lines&lt;/h1&gt;
&lt;/div&gt;
&lt;blockquote&gt;
&lt;p&gt;Pedestrian pull requests the city never merged.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;A desire path is a shortcut worn into grass by repeated footsteps. Desire Lines finds
places where the official pedestrian network takes a detour, checks open aerial imagery
for a continuous loss of vegetation, ranks candidates (TabPFN when its license gate
allows, otherwise sklearn and a transparent heuristic), and optionally asks a local
Gemma vision model for a conservative second opinion.&lt;/p&gt;
&lt;p&gt;This project was built for the
&lt;a href="https://dev.to/challenges/hacktoberfest-week1-2026-10-05" rel="nofollow"&gt;Hacktoberfest Open-Source AI Challenge: Touch Grass&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;No field walk has been done. The site can export a GPX and a printable card as an
invitation for a human mapper. The pipeline never writes to OpenStreetMap.&lt;/p&gt;
&lt;div class="markdown-heading"&gt;
&lt;h2 class="heading-element"&gt;What it produces&lt;/h2&gt;
&lt;/div&gt;
&lt;ul&gt;
&lt;li&gt;a map where each candidate looks like a pull request;&lt;/li&gt;
&lt;li&gt;a spatially cross-validated comparison of TabPFN (license-gated) and conventional baselines;&lt;/li&gt;
&lt;li&gt;optional GPX / A6 card / MapRoulette GeoJSON after &lt;code&gt;desire-lines walk&lt;/code&gt; — not a completed…&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;
  &lt;/div&gt;
  &lt;div class="gh-btn-container"&gt;&lt;a class="gh-btn" href="https://github.com/BalkrishnaMehta/desire-lines" rel="noopener noreferrer"&gt;View on GitHub&lt;/a&gt;&lt;/div&gt;
&lt;/div&gt;


&lt;p&gt;Source code is MIT. OpenStreetMap data remains ODbL. Aerial imagery is Beeldmateriaal.nl / PDOK, CC BY 4.0. TabPFN weights stay under Prior Labs' license. Gemma is Google's open-weight model. The local install was &lt;code&gt;ollama pull gemma3:4b&lt;/code&gt;.&lt;/p&gt;

&lt;h2&gt;
  
  
  How I Built It
&lt;/h2&gt;

&lt;p&gt;Mapped &lt;code&gt;informal=yes&lt;/code&gt; ways are removed from the walk graph before any detour is measured. A pair becomes a candidate when the straight line is 20–400 m, at least 80% of it lies in mapped green space, it crosses no mapped barrier, the official walk is at least 1.25× longer, and the line saves at least 15 m.&lt;/p&gt;

&lt;p&gt;This run found 81 candidates. Wear, scoring, and the map use the top 40.&lt;/p&gt;

&lt;p&gt;For each line the app computes Excess Green, &lt;code&gt;2G - R - B&lt;/code&gt;, inside a 1.5 m corridor and compares it with two parallel control strips. &lt;code&gt;wear&lt;/code&gt; is the greenness drop, in standard deviations of those strips. &lt;code&gt;continuity&lt;/code&gt; is the share of corridor pixels under the local vegetation threshold. Shade, dry grass, trees, and the age of the photo can move that number.&lt;/p&gt;

&lt;p&gt;A line is a positive when its Hausdorff distance to a mapped &lt;code&gt;informal=yes&lt;/code&gt; way is at most 12 m and the angles agree within 20°. Unmapped desire paths are labeled negative. Folds are 1 km blocks, five of them. Candidates in the same block stay in the same fold.&lt;/p&gt;

&lt;div class="table-wrapper-paragraph"&gt;&lt;table&gt;
&lt;thead&gt;
&lt;tr&gt;
&lt;th&gt;Model&lt;/th&gt;
&lt;th&gt;ROC-AUC&lt;/th&gt;
&lt;th&gt;PR-AUC&lt;/th&gt;
&lt;th&gt;Precision at 10&lt;/th&gt;
&lt;/tr&gt;
&lt;/thead&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td&gt;logistic regression&lt;/td&gt;
&lt;td&gt;0.9771&lt;/td&gt;
&lt;td&gt;0.8762&lt;/td&gt;
&lt;td&gt;0.5&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;histogram gradient boosting&lt;/td&gt;
&lt;td&gt;0.5&lt;/td&gt;
&lt;td&gt;0.125&lt;/td&gt;
&lt;td&gt;0.0&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;detour + wear heuristic&lt;/td&gt;
&lt;td&gt;0.4029&lt;/td&gt;
&lt;td&gt;0.1176&lt;/td&gt;
&lt;td&gt;0.0&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;TabPFN&lt;/td&gt;
&lt;td&gt;no token&lt;/td&gt;
&lt;td&gt;n/a&lt;/td&gt;
&lt;td&gt;n/a&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;&lt;/div&gt;

&lt;p&gt;Logistic regression is the measured model. Samples: 40. Mapped positives: 5. TabPFN returned no score. This machine had no &lt;code&gt;TABPFN_TOKEN&lt;/code&gt;.&lt;/p&gt;

&lt;p&gt;&lt;code&gt;utrecht-080&lt;/code&gt; ranks first. It is a mapped informal way, 27.403 m, wear -0.392, continuity 0.204, score 0.9927. The corridor is greener than the grass beside it.&lt;/p&gt;

&lt;p&gt;The five positives are stored with a filled-in detour. The code writes detour ratio 1.8, metres saved as 0.8 × length, and seconds as that distance at 1.3 m/s. The 0.9771 ROC-AUC is agreement with those labels.&lt;/p&gt;

&lt;p&gt;Gemma 3 4B reviewed the top 8 chips through Ollama at &lt;code&gt;http://127.0.0.1:11434&lt;/code&gt;. The laptop is a CPU-only Windows machine with no NVIDIA GPU. The prompt asks whether a narrow worn track is visible under the red line. All 8 verdicts were &lt;code&gt;unclear&lt;/code&gt;. The other 32 cards use a fallback that says yes only when wear is at least 1 and continuity is at least 0.55.&lt;/p&gt;

&lt;h2&gt;
  
  
  Why Does Open Innovation Matter?
&lt;/h2&gt;

&lt;p&gt;PDOK publishes the national 25 cm orthophoto under CC BY 4.0, layer &lt;code&gt;Actueel_ortho25&lt;/code&gt;. That license allows a published measurement from the pixels, so the corridor score and the chips can sit in the repository.&lt;/p&gt;

&lt;p&gt;The chips are aerial frames of Utrecht parks. Gemma ran on the laptop. The request went to &lt;code&gt;127.0.0.1&lt;/code&gt;.&lt;/p&gt;

&lt;h2&gt;
  
  
  Prize categories
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Best Use of Gemma.&lt;/strong&gt; Local Ollama, model &lt;code&gt;gemma3:4b&lt;/code&gt;, verdicts &lt;code&gt;yes&lt;/code&gt;, &lt;code&gt;no&lt;/code&gt;, or &lt;code&gt;unclear&lt;/code&gt;. This run saved 8 Gemma verdicts, all &lt;code&gt;unclear&lt;/code&gt;.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Best Use of TabPFN.&lt;/strong&gt; The scorer calls &lt;code&gt;TabPFNClassifier&lt;/code&gt; on the same spatial folds as logistic regression and histogram gradient boosting. This run had no token and no TabPFN ROC-AUC.&lt;/p&gt;

&lt;h2&gt;
  
  
  Honest limits
&lt;/h2&gt;

&lt;p&gt;I have not walked the eight stops. The worn, faint, gone, and paved boxes are unticked.&lt;/p&gt;

&lt;p&gt;The task file says to survey a line before mapping it. No stage calls an OpenStreetMap write API.&lt;/p&gt;

</description>
      <category>devchallenge</category>
      <category>hf26challenge</category>
      <category>gemma</category>
      <category>tabpfn</category>
    </item>
  </channel>
</rss>
