IP Library Granted Patent US 7,263,538
Granted Patent B2
US 7,263,538 · App. 10/126,000 · Granted Aug 28, 2007

Curve tracing system

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,263,538
App. No.
10/126,000
Granted
Aug 28, 2007
Kind
B2
Abstract

A curve tracing system and method of extracting a smooth curve from a plurality of image data points includes the steps of: partitioning the data points into a plurality of groups each defined by a center point, manipulating the center points into a sequential order, and re-partitioning the data points into a plurality of groups each defined by a center point with the condition that a curve passing through the center points must be smooth.

Claims (42)

1. A method in a computer of extracting a smooth curve from a plurality of image data points input into-the computer, comprising:

partitioning the data points into a plurality of first groups each defined by respective first center points,

manipulating the first center points into a sequential order,

re-partitioning the manipulated data points into a plurality of second groups each defined by respective second center points such that a curve passing through the second center points is smooth, and

outputting the curve passing through the second center points so that it is visible through display.

2. The method of claim 1 wherein a c-means algorithm or c-shells clustering algorithm is used for partitioning the data points into the plurality of first groups each defined by respective center points.

3. The method of claim 1 wherein manipulating the first center points into a sequential order includes determining a relationship between each first group of data points and its neighbouring groups of data points, and ranking the groups in terms of the relationships.

4. The method of claim 3 wherein the relationship is a spatial distance between a group and a neighbouring group.

5. The method of claim 1 wherein manipulating the first center points into a sequential order includes removing any looping paths.

6. The method of claim 1 wherein manipulating the first center points into a sequential order includes determining if a smooth curve will be an open or a closed curve.

7. The method of claim 1 wherein re-partitioning the manipulated data points into a plurality of second groups each defined by respective second center points such that a curve passing through the second center points must be smooth includes combining a criterion function from a c-means algorithm or c-shells clustering algorithm and a constraining term.

8. The method of claim 7 wherein each data sample is associated with a group membership value continuous between 0 and 1.

9. The method of claim 1 wherein the data is pre-processed to reduce noise.

10. The method of claim 1 wherein the image data is separated at comer points and or intersections to reveal subsets of data representing only smooth curves.

11. A curve tracing system for extracting a smooth curve from a plurality of image data points, comprising:

a computer having a processor,

a computer input device for inputting a plurality of data points,

a computer output device for outputting a curve extracted from the data points, and

a storage device having computer-readable instructions thereon which when executed by the processor perform steps for extracting a smooth curve from a plurality of image data points input into the computer the steps comprising:

partitioning the data points into first groups each defined by respective first center points,

determining a spatial distance between one of the first groups and its neighbouring groups,

arranging the first center points in terms of the spatial distance,

re-partitioning the partitioned first groups of data points into second groups each defined by respective second center points such that a curve passing through the second center points must be smooth, including combining a criterion function from a c-means algorithm or c-shells clustering algorithm and a constraining term, and

outputting the curve passing through the second center points to be visible on the computer output device.

12. A computer readable storage medium having computer readable instructions which when executed on a computer perform steps for extracting a smooth curve from a plurality of image data points input into the computer the steps comprising:

partitioning a plurality of image data points into a plurality of first groups each defined by respective first center points,

manipulating the first center points into a sequential order,

re-partitioning the manipulated data points into a plurality of second groups each defined by respective second center points such that a curve passing through the second center points is smooth, and

outputting the curve passing through the second center points so that it is visible through display.

13. The computer readable medium of claim 12 wherein a c-means algorithm or c-shells clustering algorithm is used for partitioning the data points into a plurality of groups each defined by a center point.

14. The computer readable medium of claim 12 wherein manipulating the center points into a sequential order includes determining a spatial distance between each first group of data points and its neighbouring groups of data points, and ranking the groups in terms of the spatial distance.

15. The computer readable medium of claim 12 wherein manipulating the first center points into a sequential order includes removing any looping paths.

16. The computer readable medium of claim 12 wherein manipulating the first center points into a sequential order includes determining if the smooth curve will be an open or a closed curve.

17. The computer readable medium of claim 12 wherein re-partitioning the manipulated data points into a plurality of second groups each defined by respective second center points such that a curve passing through the second center points must be smooth includes combining a criterion function from a c-means algorithm or c-shells clustering algorithm and a constraining term.

18. The computer readable medium of in claim 12 wherein the data is pre-processed to reduce noise.

19. The computer readable medium of claim 12 wherein the image data is separated at corner points and or intersections to reveal subsets of data representing only smooth curves.

20. A method in a computer of extracting a smooth curve from a plurality of image data points input into the computer, comprising:

partitioning the data points into a plurality of first groups each defined by respective first center points,

manipulating the first center points into a sequential order,

removing any looping paths from the ordered center points,

re-partitioning the manipulated data points into a plurality of second groups each defined by respective second center points such that a curve passing through the second center points is smooth, and

outputting the curve passing through the second center points so that it is visible through display.

Assignments (5)
MERGER Recorded Jun 18, 2013
From: INTELLECTUAL VENTURES HOLDING 57 LLC
To: INTELLECTUAL VENTURES II LLC
Reel/Frame 030638/0086 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 9, 2010
From: CITYU RESEARCH LIMITED
To: INTELLECTUAL VENTURES HOLDING 57 LLC
Reel/Frame 023915/0101 →
CORRECTION TO CORRECT THE NAME OF ASSIGNOR PREVIOUSLY RECORDED ON REEL 013020 FRAME 0177 Recorded Nov 12, 2009
From: YAN, HONG
To: CITY UNIVERSITY OF HONG KONG
Reel/Frame 023525/0495 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 3, 2009
From: CITY UNIVERSITY OF HONG KONG
To: CITYU RESEARCH LIMITED
Reel/Frame 023180/0671 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 18, 2002
From: HONG, YAN
To: CITY UNIVERSITY OF HONG KONG
Reel/Frame 013020/0177 →