Search results for "Rectangle"
showing 10 items of 17 documents
Real-time flaw detection on a complex object: comparison of results using classification with a support vector machine, boosting, and hyperrectangle-…
2006
We present a classification work performed on industrial parts using artificial vision, a support vector machine (SVM), boost- ing, and a combination of classifiers. The object to be controlled is a coated heater used in television sets. Our project consists of detect- ing anomalies under manufacturer production, as well as in classi- fying the anomalies among 20 listed categories. Manufacturer speci- fications require a minimum of ten inspections per second without a decrease in the quality of the produced parts. This problem is ad- dressed by using a classification system relying on real-time ma- chine vision. To fulfill both real-time and quality constraints, three classification algorit…
Real-time image segmentation for anomalies detection using SVM approximation
2003
In this paper, we propose a method of implementation improvement of the decision rule of the support vector machine, applied to real-time image segmentation. We present very high speed decisions (approximately 10 ns per pixel) which can be useful for detection of anomalies on manufactured parts. We propose an original combination of classifiers allowing fast and robust classification applied to image segmentation. The SVM is used during a first step, pre-processing the training set and thus rejecting any ambiguities. The hyperrectangles-based learning algorithm is applied using the SVM classified training set. We show that the hyperrectangle method imitates the SVM method in terms of perfor…
On ‘Visual Implication’: Outline of a Theory
2017
Most of us are ready to accept the view that the front elevation of a building is essentially determined by such openings of the wall as windows, doors, bays, and niches. Especially their location and their sizes create a compound of parts and details that appear as an orderly arrangement, as it might be called. Normally we are able to feel when everything seems to be in order, in the right place, thus creating a good and balanced picture of the wall. The lack of such an order can be felt equally easily. One reason of seeing such a balanced order, and/or the lack of it, is the system of rectangles presented by the openings within the parameter rectangle formed by the whole wall. It is easy …
U.I.R.D.A. – Unbuilt Italian Rationalism Digital Archive
2018
For twenty years, the architecture of Italian rationalism through the digital modelling has been investigated. Very often, the production of a model and the consequent representation of tridimensional views, in many case studies, as outcome of the research on architecture have been considered. Actually, the digital model, intended as a critical tool, has to be conceived as a ‘starting point' for graphic analysis of architecture and not as the outcome. Indeed, it is associated to other graphics, sometimes not ‘deducted' from the model, useful for the understanding/translation of architecture. The construction of the model is not the construction of a simple image, operation, which is often c…
Breakdown of separability due to confinement
2017
A simple system of two particles in a bidimensional configurational space S is studied. The possibility of breaking in S the time-independent Schrodinger equation of the system into two separated one-dimensional one-body Schrodinger equations is assumed. In this paper, we focus on how the latter property is countered by imposing such boundary conditions as confinement to a limited region of S and/or restrictions on the joint coordinate probability density stemming from the sign-invariance condition of the relative coordinate (an impenetrability condition). Our investigation demonstrates the reducibility of the problem under scrutiny into that of a single particle living in a limited domain …
A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
2005
This paper presents a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional non-guillotine cutting problem, the problem of cutting the rectangular pieces from a large rectangle so as to maximize the value of the pieces cut. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform extensive computational experiments with well-known instances previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures.
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem
2007
We develop a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional two-stage cutting-stock problem. This is a special cutting problem in which the cut is performed in two phases. In the first phase, the stock rectangle is slit down its width into different vertical strips and in the second phase, each of these strips is processed to obtain the final pieces. We propose two different algorithms based on GRASP methodology. One is “piece-oriented” while the other is “strip-oriented.” Both procedures are fast and provide solutions of different structures to this cutting problem. We also propose a path-relinking algorithm, which operates on a set of elite soluti…
Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts
2015
Abstract This paper presents an approach for solving a new real problem in cutting and packing. At its core is an innovative mixed integer programme model that places irregular pieces and defines guillotine cuts. The two-dimensional irregular shape bin packing problem with guillotine constraints arises in the glass cutting industry, for example, the cutting of glass for conservatories. Almost all cutting and packing problems that include guillotine cuts deal with rectangles only, where all cuts are orthogonal to the edges of the stock sheet and a maximum of two angles of rotation are permitted. The literature tackling packing problems with irregular shapes largely focuses on strip packing i…
A tabu search algorithm for a two-dimensional non-guillotine cutting problem
2007
In this paper we study a two-dimensional non-guillotine cutting problem, the problem of cutting rectangular pieces from a large stock rectangle so as to maximize the total value of the pieces cut. The problem has many industrial applications whenever small pieces have to be cut from or packed into a large stock sheet. We propose a tabu search algorithm. Several moves based on reducing and inserting blocks of pieces have been defined. Intensification and diversification procedures, based on long-term memory, have been included. The computational results on large sets of test instances show that the algorithm is very efficient for a wide range of packing and cutting problems.
Handling precedence constraints in scheduling problems by the sequence pair representation
2015
In this paper, we show that sequence pair (SP) representation, primarily applied to the rectangle packing problems appearing in the VLSI industry, can be a solution representation of precedence constrained scheduling. We present three interpretations of sequence pair, which differ in complexity of schedule evaluation and size of a corresponding solution space. For each interpretation we construct an incremental precedence constrained SP neighborhood evaluation algorithm, computing feasibility of each solution in the insert neighborhood in an amortized constant time per examined solution, and prove the connectivity property of the considered neighborhoods. To compare proposed interpretations…