Skip to content

Suppose where one time takes one minute to be scanned, so if a person with monthly shopping interest has 50 items then it will take 50 minutes. Along with that we have a long queue which consists of 4-5 persons. With our model you can reduce that 50 minutes to 1 minute. Time complexity is O(1) instead of O(n)

License

Notifications You must be signed in to change notification settings

real-varshney/Cashierless-Counter

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Cashierless-Counter

For example - Suppose where one time takes one minute to be scanned, so if a person with monthly shopping interest has 50 items then it will take 50 minutes. Along with that we have a long queue which consists of 4-5 persons. With our model you can reduce that 50 minutes to 1 minute. Time complexity is O(1) instead of O(n). Also we have introduced a new method of payment via crypto currency Solana.

Yolov8, flask , object detection , react ,solana, upi

The Backend is deployed on pythonanywhere and routed through flask and the forntend at netlify.

About

Suppose where one time takes one minute to be scanned, so if a person with monthly shopping interest has 50 items then it will take 50 minutes. Along with that we have a long queue which consists of 4-5 persons. With our model you can reduce that 50 minutes to 1 minute. Time complexity is O(1) instead of O(n)

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • HTML 42.6%
  • JavaScript 33.6%
  • CSS 16.6%
  • Python 7.2%