Most dominant point detection methods require heuristically chosen control parameters. One of the commonly used control parameter is maximum deviation. This paper uses a theoretical bound of the maximum deviation of pixels obtained by digitization of a line segment for constructing a general framework to make most dominant point detection methods non-parametric. The derived analytical bound of the maximum deviation can be used as a natural bench mark for the line fitting algorithms and thus dominant point detection methods can be made parameter-independent and non-heuristic. Most methods can easily incorporate the bound. This is demonstrated using three categorically different dominant point detection methods. Such non-parametric approach r...
This chapter presents an iterative smoothing technique for polygonal approximation of digital image ...
In computational shape analysis a crucial step consists in extracting meaningful features from digit...
This paper deals with the automated detection of a closed curvećs dominant points. We treat a curve ...
Most dominant point detection methods require heuristically chosen control parameters. One of the co...
International audienceIn this paper, we investigate the problem of dominant point detection on digit...
International audienceIn this paper, we investigate the problem of dominant point detection on digit...
International audienceWe propose two fast methods for dominant point detection and polygonal represe...
In this work we address the problem of closed digital curves polygonal approximation by locating a s...
A parallel algorithm is presented for detecting dominant points on a digital closed curve. The proce...
A parallel algorithm for detecting dominant points on a digital closed curve is presented. The proce...
In computational shape analysis a crucial step consists in extracting meaningful features from digit...
International audienceA new and fast method for dominant point detection and polygonal representatio...
This paper compares the error bounds of two classes of dominant point detection methods, viz. method...
A novel method that uses both the local and the global nature of fit for dominant point detection is...
In this paper the problem of dominant point detection on digital curves is addressed. Based on an in...
This chapter presents an iterative smoothing technique for polygonal approximation of digital image ...
In computational shape analysis a crucial step consists in extracting meaningful features from digit...
This paper deals with the automated detection of a closed curvećs dominant points. We treat a curve ...
Most dominant point detection methods require heuristically chosen control parameters. One of the co...
International audienceIn this paper, we investigate the problem of dominant point detection on digit...
International audienceIn this paper, we investigate the problem of dominant point detection on digit...
International audienceWe propose two fast methods for dominant point detection and polygonal represe...
In this work we address the problem of closed digital curves polygonal approximation by locating a s...
A parallel algorithm is presented for detecting dominant points on a digital closed curve. The proce...
A parallel algorithm for detecting dominant points on a digital closed curve is presented. The proce...
In computational shape analysis a crucial step consists in extracting meaningful features from digit...
International audienceA new and fast method for dominant point detection and polygonal representatio...
This paper compares the error bounds of two classes of dominant point detection methods, viz. method...
A novel method that uses both the local and the global nature of fit for dominant point detection is...
In this paper the problem of dominant point detection on digital curves is addressed. Based on an in...
This chapter presents an iterative smoothing technique for polygonal approximation of digital image ...
In computational shape analysis a crucial step consists in extracting meaningful features from digit...
This paper deals with the automated detection of a closed curvećs dominant points. We treat a curve ...