Computer vision involves analyzing patterns in visual images and reconstructing the real world objects that produced them. The process in often broken up into two phases: feature detection and pattern recognition. Feature detection involves selecting important features of the image; pattern recognition involves discovering patterns in the features. We will investigate a particularly clean pattern recognition problem involving points and line segments. This kind of pattern recognition arises in many other applications, for example statistical data analysis. So I decided to embrace this challenge and tried to solve the problem from a mathematical point of view.
- Java JDK greater or equal 1.8
- A lot of patience
The implementation is based on few assumptions:
- A line segment is represented in the form y = mx + q
- A point is unique in a space set
- A point p is on a line l if it has the same line equation of another pair of points q and k
- Documentation and Swagger generation
- API Exception handling
- Unit testing