A robust method for scale independent detection of curvature-based criticalities and intersections in line drawings

Date

2015-01-01

Author

Keles, Hacer Yalim
Tarı, Zehra Sibel

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

140
views

0
downloads

A novel two-phase iterative method is proposed to identify curvature based criticalities and intersections in line drawings. The method is based on evaluating a field obtained from the image via diffusion using adaptively changing ellipse-shaped analysis windows. The deviation of the average field strength values within the analysis windows from that of an external reference field is used as a metric to evaluate the criticality of a region. The external reference field is computed from an image of a straight line. The experimental results depict that the method is effective in detecting curvature based criticalities and intersections, even for noisy and disconnected drawings as well as drawings drawn with a variety of brush characteristics, such as glass, ocean, ripple, scatter, stamp, strokes effects. Our method can be employed as a part of a design grammar interpreter.

Subject Keywords

Line drawings, Varying brush characteristics, Curvature, Intersection points, Computational design

URI

https://hdl.handle.net/11511/32695

Journal

PATTERN RECOGNITION

DOI

https://doi.org/10.1016/j.patcog.2014.07.005

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

An algorithm for line matching in an image by mapping into an n-dimensional vector space Sultanov, Raiymbek; Atakan, Ahmet; Ismailova, Rita (2019-01-01) This paper proposes a minimal length difference algorithm for construction of a line in an image by solving the problem of optimal contour approximation. In this algorithm, a method for finding interest points is proposed, and the object matching (classification) is done by mapping interest points onto a vector space. In cases where the lines in the representation of the images are not smooth, the algorithm converges rapidly. The results of the experiments showed that for convergence of the contour simplifi...
A NOVEL METHOD FOR DISCRETE COEFFICIENT FIR DIGITAL FILTER DESIGN Çiloğlu, Tolga (1994-06-02) A local search algorithm for discrete coefficient FIR filter design is presented. The minmax objective function is minimized by moving along the low gradient directions. A new method to forecast these directions is proposed. The algorithm is suitable to design high order filters in a short time. The results are compared to other methods both in quality and computational load
A CIRCLE DETECTION APPROACH BASED ON RADON TRANSFORM Okman, O. Erman; Akar, Gözde (2013-05-31) In this paper a novel fast circle detection algorithm is proposed which depends on the spatial properties of the connected components on the image. Two 1-D transforms of each connected component is obtained by taking the Radon Transform of the image for two different directions, which are in fact the integrations of the image through horizontal and vertical directions. Circles are detected using the similarities of detected peaks on the transformed functions and the characteristics of the values in between ...
A short cut numerical method for determination of periods of free oscillations for basins with irregular geometry and bathymetry Yalçıner, Ahmet Cevdet (Elsevier BV, 2007-04-01) A short cut numerical method for evaluation of the modes of free oscillations of the basins which have irregular geometry and bathymetry is presented in this paper. In the method, a single wave is inputted to the basin as an initial impulse. The respective agitation in the basin is computed by using the numerical method solving the nonlinear form of long wave equations. The time histories of water surface fluctuations at different locations due to propagation of the waves in relation to the initial impulse ...
A NEAR-OPTIMAL ALGORITHM FOR SHORTEST PATHS AMONG CURVED OBSTACLES IN THE PLANE Hershberger, John; Suri, Subhash; Yıldız, Hakan (2022-01-01) © 2022 Society for Industrial and Applied Mathematics.We propose an algorithm for the problem of computing shortest paths among curved obstacles in the plane. If the obstacles have O(n) description complexity, then the algorithm runs in O(n log n) time plus a term dependent on the properties of the boundary arcs. Specifically, if the arcs allow a certain kind of bisector intersection to be computed in constant time, or even in O(log n) time, then the running time of the overall algorithm is O(n log n). If t...

Citation Formats

H. Y. Keles and Z. S. Tarı, “A robust method for scale independent detection of curvature-based criticalities and intersections in line drawings,” PATTERN RECOGNITION, pp. 140–155, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/32695.