IEEE Trans Pattern Anal Mach Intell
August 2021
Seeded segmentation methods have gained a lot of attention due to their good performance in fragmenting complex images, easy usability and synergism with graph-based representations. These methods usually rely on sophisticated computational tools whose performance strongly depends on how good the training data reflect a sought image pattern. Moreover, poor adherence to the image contours, lack of unique solution, and high computational cost are other common issues present in most seeded segmentation methods.
View Article and Find Full Text PDFDuring the creative process, designers use various techniques and strategies to move from the abstract to the concrete, utilizing different physical and virtual means to represent form. The changes between virtual and physical models are not always fluent, however. Differential 3D scanning can detect the differences between a scanned model (point cloud) and a reference model (polygon mesh or CAD model) and then reflect those changes in the reference model.
View Article and Find Full Text PDFIn this article we present the first effective method based on global optimization for the reconstruction of image puzzles comprising rectangle pieces-Puzzle Solving by Quadratic Programming (PSQP). The proposed novel mathematical formulation reduces the problem to the maximization of a constrained quadratic function, which is solved via a gradient ascent approach. The proposed method is deterministic and can deal with arbitrary identical rectangular pieces.
View Article and Find Full Text PDFThe remarkable maneuverability of flying animals results from precise movements of their highly specialized wings. Bats have evolved an impressive capacity to control their flight, in large part due to their ability to modulate wing shape, area, and angle of attack through many independently controlled joints. Bat wings, however, also contain many bones and relatively large muscles, and thus the ratio of bats' wing mass to their body mass is larger than it is for all other extant flyers.
View Article and Find Full Text PDFIEEE Trans Vis Comput Graph
March 2016
Existing algorithms for building layouts from geometric primitives are typically designed to cope with requirements such as orthogonal alignment, overlap removal, optimal area usage, hierarchical organization, among others. However, most techniques are able to tackle just a few of those requirements simultaneously, impairing their use and flexibility. In this work we propose a novel methodology for building layouts from geometric primitives that concurrently addresses a wider range of requirements.
View Article and Find Full Text PDFAs an introduction to the field, this article shows how to formulate several geometry-processing operations to solve systems of equations in the "least-squares" sense. The equations are derived from local geometric relations using elementary concepts from analytic geometry, such as points, lines, planes, vectors, and polygons. Simple and useful tools for interactive polygon mesh editing result from the most basic descent strategies to solve these optimization problems.
View Article and Find Full Text PDF