Displaying 41 – 60 of 188

Showing per page

Combining adaptive vector quantization and prototype selection techniques to improve nearest neighbour classifiers

Francesc J. Ferri (1998)

Kybernetika

Prototype Selection (PS) techniques have traditionally been applied prior to Nearest Neighbour (NN) classification rules both to improve its accuracy (editing) and to alleviate its computational burden (condensing). Methods based on selecting/discarding prototypes and methods based on adapting prototypes have been separately introduced to deal with this problem. Different approaches to this problem are considered in this paper and their main advantages and drawbacks are pointed out along with some...

Connected components of sets of finite perimeter and applications to image processing

Luigi Ambrosio, Vicent Caselles, Simon Masnou, Jean-Michel Morel (2001)

Journal of the European Mathematical Society

This paper contains a systematic analysis of a natural measure theoretic notion of connectedness for sets of finite perimeter in N , introduced by H. Federer in the more general framework of the theory of currents. We provide a new and simpler proof of the existence and uniqueness of the decomposition into the so-called M -connected components. Moreover, we study carefully the structure of the essential boundary of these components and give in particular a reconstruction formula of a set of finite...

Connections between object classification criteria using an ultrasonic bi-sonar system

Bogdan Kreczmer (2016)

International Journal of Applied Mathematics and Computer Science

The paper presents connections between the criteria which make three types of objects possible to be recognized, namely, edges, planes and corners. These criteria can be applied while a binaural sonar system is used. It is shown that the criteria are specific forms of a general equation. The form of the equation depends on a single coefficient. In the paper, the meaning of this coefficient is discussed. The constructions of the arrangement of objects are presented and are bound with values of the...

Cross-task code reuse in genetic programming applied to visual learning

Wojciech Jaśkowski, Krzysztof Krawiec, Bartosz Wieloch (2014)

International Journal of Applied Mathematics and Computer Science

We propose a method that enables effective code reuse between evolutionary runs that solve a set of related visual learning tasks. We start with introducing a visual learning approach that uses genetic programming individuals to recognize objects. The process of recognition is generative, i.e., requires the learner to restore the shape of the processed object. This method is extended with a code reuse mechanism by introducing a crossbreeding operator that allows importing the genetic material from...

Curvature in image and shape processing

Yonathan Aflalo, Anastasia Dubrovina, Ron Kimmel, Aaron Wetzler (2013)

Actes des rencontres du CIRM

The laplacian operator applied to the coordinates of a manifold provides the mean curvature vector. Manipulating the metric of the manifold or interpreting its coordinates in various ways provide useful tools for shape and image processing and representation. We will review some of these tools focusing on scale invariant geometry, curvature flow with respect to an embedding of the image manifold in a high dimensional space, and object segmentation by active contours defined via the shape laplacian...

Data compression with Σ Π -approximations based on splines

Olga E. Baklanova, Vladimir A Vasilenko (1993)

Applications of Mathematics

The paper contains short description of Σ Π -algorithm for the approximation of the function with two independent variables by the sum of products of one-dimensional functions. Some realizations of this algorithm based on the continuous and discrete splines are presented here. Few examples concerning with compression in the solving of approximation problems and colour image processing are described and discussed.

Data Enhancements in a Digital Mathematical Library

Růžička, Michal, Sojka, Petr (2010)

Towards a Digital Mathematics Library. Paris, France, July 7-8th, 2010

The quality of digital mathematical library depends on the formats and quality of data it offers. We show several enhancements of (meta)data of the Czech Digital Mathematics Library DML-CZ. We discuss possible minimalist modification of regular LaTeX documents that would simplify generating basic metadata that describes the article in an XML/MathML format. We also show a proof of concept of a method that enables us to include LaTeX source code of mathematical expressions into pdfTeX-generated PDFs...

Designing a Semantic Ground Truth for Mathematical Formulae

Sexton, Alan, Sorge, Volker, Suzuki, Masakazu (2010)

Towards a Digital Mathematics Library. Paris, France, July 7-8th, 2010

We report on a new project to design a semantic ground truth set for mathematical document analysis. The ground truth set will be generated by annotating recognised mathematical symbols with respect to both their global meaning in the context of the considered documents and their local function within the particular mathematical formula they occur. The aim of our work is to have a reliable database available for semantic classification during the formula recognition process with the aim of enabling...

Developing a Metadata Exchange Format for Mathematical Literature

Ruddy, David (2010)

Towards a Digital Mathematics Library. Paris, France, July 7-8th, 2010

This paper describes an effort to develop a metadata element set for the exchange of descriptive metadata about mathematical literature. The approach taken uses the Dublin Core Application Profile (DCAP) framework, based on the DC Abstract Model. A fully developed DCAP for mathematical literature would be valuable, as both a guide and constraint in the creation of metadata records suitable for harvesting via OAI or sharing through other means. Adhering to the DCAP model would also enhance global...

Currently displaying 41 – 60 of 188