18,472 research outputs found
Supporting Knitwear Design Using Case-Based Reasoning
Organised by: Cranfield UniversityKnitwear design is a creative activity that is hard to automate using the computer. The production of the
associated knitting pattern, however, is repetitive, time-consuming and error-prone, calling for automation.
Our objectives are two-fold: to facilitate the design and to ease the burden of calculations and checks in
pattern production. We conduct a feasibility study for applying case-based reasoning in knitwear design: we
describe appropriate methods and show how they can be implemented.Mori Seiki – The Machine Tool Compan
Fuzzy Dynamic Discrimination Algorithms for Distributed Knowledge Management Systems
A reduction of the algorithmic complexity of the fuzzy inference engine has the following property: the inputs (the fuzzy rules and the fuzzy facts) can be divided in two parts, one being relatively constant for a long a time (the fuzzy rule or the knowledge model) when it is compared to the second part (the fuzzy facts) for every inference cycle. The occurrence of certain transformations over the constant part makes sense, in order to decrease the solution procurement time, in the case that the second part varies, but it is known at certain moments in time. The transformations attained in advance are called pre-processing or knowledge compilation. The use of variables in a Business Rule Management System knowledge representation allows factorising knowledge, like in classical knowledge based systems. The language of the first-degree predicates facilitates the formulation of complex knowledge in a rigorous way, imposing appropriate reasoning techniques. It is, thus, necessary to define the description method of fuzzy knowledge, to justify the knowledge exploiting efficiency when the compiling technique is used, to present the inference engine and highlight the functional features of the pattern matching and the state space processes. This paper presents the main results of our project PR356 for designing a compiler for fuzzy knowledge, like Rete compiler, that comprises two main components: a static fuzzy discrimination structure (Fuzzy Unification Tree) and the Fuzzy Variables Linking Network. There are also presented the features of the elementary pattern matching process that is based on the compiled structure of fuzzy knowledge. We developed fuzzy discrimination algorithms for Distributed Knowledge Management Systems (DKMSs). The implementations have been elaborated in a prototype system FRCOM (Fuzzy Rule COMpiler).Fuzzy Unification Tree, Dynamic Discrimination of Fuzzy Sets, DKMS, FRCOM
Supporting reinterpretation in computer-aided conceptual design
This paper presents research that aims to inform the development of computational tools that better support design exploration and idea transformation - key objectives in conceptual design. Analyses of experimental data from two fields - product design and architecture - suggest that the interactions of designers with their sketches can be formalised according to a finite number of generalised shape rules defined within a shape grammar. Such rules can provide a basis for the generation of alternative design concepts and they have informed the development of a prototype shape synthesis system that supports dynamic reinterpretation of shapes in design activity. The notion of 'sub-shapes' is introduced and the significance of these to perception, recognition and the development of emergent structures is discussed. The paper concludes with some speculation on how such a system might find application in a range of design fields
Higher-order Projected Power Iterations for Scalable Multi-Matching
The matching of multiple objects (e.g. shapes or images) is a fundamental
problem in vision and graphics. In order to robustly handle ambiguities, noise
and repetitive patterns in challenging real-world settings, it is essential to
take geometric consistency between points into account. Computationally, the
multi-matching problem is difficult. It can be phrased as simultaneously
solving multiple (NP-hard) quadratic assignment problems (QAPs) that are
coupled via cycle-consistency constraints. The main limitations of existing
multi-matching methods are that they either ignore geometric consistency and
thus have limited robustness, or they are restricted to small-scale problems
due to their (relatively) high computational cost. We address these
shortcomings by introducing a Higher-order Projected Power Iteration method,
which is (i) efficient and scales to tens of thousands of points, (ii)
straightforward to implement, (iii) able to incorporate geometric consistency,
(iv) guarantees cycle-consistent multi-matchings, and (iv) comes with
theoretical convergence guarantees. Experimentally we show that our approach is
superior to existing methods
A new and versatile method for the successful conversion of AFLP-TM markers into simple single locus markers
Genetic markers can efficiently be obtained by using amplified fragment length polymorphism (AFLP) fingerprinting because no prior information on DNA sequence is required. However, the conversion of AFLP markers from complex fingerprints into simple single locus assays is perceived as problematic because DNA sequence information is required for the design of new locus-specific PCR primers. In addition, single locus polymorphism (SNP) information is required to design an allele-specific assay. This paper describes a new and versatile method for the conversion of AFLP markers into simple assays. The protocol presented in this paper offers solutions for frequently occurring pitfalls and describes a procedure for the identification of the SNP responsible for the AFLP. By following this approach, a high success rate for the conversion of AFLP markers into locus-specific markers was obtained
Microstructural enrichment functions based on stochastic Wang tilings
This paper presents an approach to constructing microstructural enrichment
functions to local fields in non-periodic heterogeneous materials with
applications in Partition of Unity and Hybrid Finite Element schemes. It is
based on a concept of aperiodic tilings by the Wang tiles, designed to produce
microstructures morphologically similar to original media and enrichment
functions that satisfy the underlying governing equations. An appealing feature
of this approach is that the enrichment functions are defined only on a small
set of square tiles and extended to larger domains by an inexpensive stochastic
tiling algorithm in a non-periodic manner. Feasibility of the proposed
methodology is demonstrated on constructions of stress enrichment functions for
two-dimensional mono-disperse particulate media.Comment: 27 pages, 12 figures; v2: completely re-written after the first
revie
Accurate and linear time pose estimation from points and lines
The final publication is available at link.springer.comThe Perspective-n-Point (PnP) problem seeks to estimate the pose of a calibrated camera from n 3Dto-2D point correspondences. There are situations, though, where PnP solutions are prone to fail because feature point correspondences cannot be reliably estimated (e.g. scenes with repetitive patterns or with low texture). In such
scenarios, one can still exploit alternative geometric entities, such as lines, yielding the so-called Perspective-n-Line (PnL) algorithms. Unfortunately, existing PnL solutions are not as accurate and efficient as their point-based
counterparts. In this paper we propose a novel approach to introduce 3D-to-2D line correspondences into a PnP formulation, allowing to simultaneously process points and lines. For this purpose we introduce an algebraic line error
that can be formulated as linear constraints on the line endpoints, even when these are not directly observable. These constraints can then be naturally integrated within the linear formulations of two state-of-the-art point-based algorithms,
the OPnP and the EPnP, allowing them to indistinctly handle points, lines, or a combination of them. Exhaustive experiments show that the proposed formulation brings remarkable boost in performance compared to only point or
only line based solutions, with a negligible computational overhead compared to the original OPnP and EPnP.Peer ReviewedPostprint (author's final draft
- …