Curve Fitting

Chapter Contents (Back)
Curve Fitting. Curves, General.

Kanatani, K.,
Errors of the Incremental Method for Curves,
CVGIP(26), No. 1, April 1984, pp. 130-133.
WWW Link. Output of curves. BibRef 8404

Kanatani, K.[Kenichi],
Cramer-Rao Lower Bounds for Curve Fitting,
GMIP(60), No. 2, March 1998, pp. 93-99. BibRef 9803

Kiryati, N.[Nahum], Bruckstein, A.M.[Alfred M.],
What's in a Set of Points?,
PAMI(14), No. 4, April 1992, pp. 496-500.
IEEE DOI BibRef 9204
Earlier: Robust90(xx). Fitting a line to a set of points. BibRef

Reumann, K., and Witkam, A.P.,
Optimizing Curve Segmentation in Computer Graphics,
Intl. Computer SymposiumNew York, 1974, pp. 467-472. Early strip fitting system for line segment detection. BibRef 7400

Leung, M.K., and Yang, Y.H.,
Dynamic Strip Algorithm in Curve Fitting,
CVGIP(51), No. 2, August 1990, pp. 146-165.
WWW Link. Fit a strip to the points adjusting the direction to contain the most points. BibRef 9008

Leung, M.K., Yang, Y.H.,
Dynamic Two-Strip Algorithm in Curve Fitting,
PR(23), No. 1-2, 1990, pp. 69-79.
WWW Link. BibRef 9000

Tsai, D.M., Chen, M.F.,
Curve-Fitting Approach for Tangent Angle and Curvature Measurements,
PR(27), No. 5, May 1994, pp. 699-711.
WWW Link. BibRef 9405

Werman, M., Geyzel, Z.,
Fitting a Second Degree Curve in the Presence of Error,
PAMI(17), No. 2, February 1995, pp. 207-211.
IEEE DOI BibRef 9502

Redding, N.J.[Nicholas J.],
Implicit Polynomials, Orthogonal Distance Regression, and the Closest Point on a Curve,
PAMI(22), No. 2, February 2000, pp. 191-199.
Fitting a curve to the data. BibRef

Horng, J.H.[Ji-Hwei], Li, J.T.[Johnny T.],
A dynamic programming approach for fitting digital planar curves with line segments and circular arcs,
PRL(22), No. 2, February 2001, pp. 183-197.
Elsevier DOI 0101

Horng, J.H.[Ji-Hwei],
Improving fitting quality of polygonal approximation by using the dynamic programming technique,
PRL(23), No. 14, December 2002, pp. 1657-1673.
Elsevier DOI 0208

Pei, S.C., Horng, J.H.,
Fitting digital Curve Using Circular Arcs,
PR(28), No. 1, January 1995, pp. 107-116.
WWW Link. See also Circular-Arc Detection Based on Hough Transform. BibRef 9501

Pei, S.C., Horng, J.H.,
Optimum Approximation of Digital Planar Curves Using Circular Arcs,
PR(29), No. 3, March 1996, pp. 383-388.
WWW Link. BibRef 9603

Horng, J.H.[Ji-Hwei], Li, J.T.[Johnny T.],
An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves,
PRL(23), No. 1-3, January 2002, pp. 171-182.
Elsevier DOI 0201

Horng, J.H.[Ji-Hwei],
An adaptive smoothing approach for fitting digital planar curves with line segments and circular arcs,
PRL(24), No. 1-3, January 2003, pp. 565-577.
Elsevier DOI 0211

Wenzel, S.[Susanne], Förstner, W.[Wolfgang],
Finding Poly-Curves of Straight Line and Ellipse Segments in Images,
PFG(2013), No. 4, 2013, pp. 297-308.
DOI Link 1309

Stanberry, L.I.[Larissa I.], Besag, J.[Julian],
Boundary reconstruction in binary images using splines,
PR(47), No. 2, 2014, pp. 634-642.
Elsevier DOI 1311
Shape estimation BibRef

Türetken, E.[Engin], Benmansour, F.[Fethallah], Andres, B.[Bjoern], Pfister, H.[Hanspeter], Fua, P.[Pascal],
Reconstructing Curvilinear Networks Using Path Classifiers and Integer Programming,
PAMI(38), No. 12, December 2016, pp. 2515-2530.
Reconstructing Loopy Curvilinear Structures Using Integer Programming,
Biomedical imaging. Loops, not just a tree structure. BibRef

Turetken, E.[Engin], Becker, C.[Carlos], Glowacki, P.[Przemyslaw], Benmansour, F.[Fethallah], Fua, P.[Pascal],
Detecting Irregular Curvilinear Structures in Gray Scale and Color Imagery Using Multi-directional Oriented Flux,
Curvilinear networks BibRef

Turetken, E.[Engin], Benmansour, F.[Fethallah], Fua, P.[Pascal],
Automated reconstruction of tree structures using path classifiers and Mixed Integer Programming,

Gonzalez, G.[German], Turetken, E.[Engin], Fleuret, F.[Franccois], Fua, P.[Pascal],
Delineating trees in noisy 2D images and 3D image-stacks,

González, G.[Germán], Fleuret, F.[François], Fua, P.[Pascal],
Automated Delineation of Dendritic Networks in Noisy Image Stacks,
ECCV08(IV: 214-227).
Springer DOI 0810

Atashpaz-Gargari, E.[Esmaeil], Reis, M.S.[Marcelo S.], Braga-Neto, U.M.[Ulisses M.], Barrera, J.[Junior], Dougherty, E.R.[Edward R.],
A fast Branch-and-Bound algorithm for U-curve feature selection,
PR(73), No. 1, 2018, pp. 172-188.
Elsevier DOI 1709
Branch-and-bound algorithm BibRef

Sekiya, F.[Fumiki], Sugimoto, A.[Akihiro],
Discrete Polynomial Curve Fitting Guaranteeing Inclusion-Wise Maximality of Inlier Set,
DGMMCV16(II: 477-492).
Springer DOI 1704
Discrete Polynomial Curve Fitting to Noisy Data,
Springer DOI 1211

Toutant, J.L.,
Characterization of the Closest Discrete Approximation of a Line in the 3-Dimensional Space,
ISVC06(I: 618-627).
Springer DOI 0611
Line fitting. BibRef

Vosselman, G., Haralick, R.M.,
Performance Analysis of Line and Circle Fitting in Digital Images,
HTML Version. BibRef 9600

Liao, Y.Z.,
A Two-Stage Method of Fitting Conic Arcs and Straight Line Segments to Digitized Contours,
PRIP81(237-239). BibRef 8100

Chapter on Edge Detection and Analysis, Lines, Segments, Curves, Corners, Hough Transform continues in
Chain Code Representations .

Last update:Nov 18, 2017 at 20:56:18