In this paper we introduce a novel platform for dense 3D modelling. This platform is an active image acquisition setup assisted with a set of light sources and a distance sensor. The hardware setup is designed for being mounted on a mobile robot which is remotely driven to create accurate dense 3D models from out-of-reach objects. For this reason, the object is actively illuminated by the imagi...

A method for spatial registering pairs of digital images of the retina is presented, using intrinsic feature points (landmarks) and dense local transformation. First, landmarks, i.e. blood vessel bifurcations, are extracted from both retinal images using filtering followed by thinning and branch point analysis. Correspondances are found by topological and structural comparisons between both ret...

We investigate some topological and geometric properties of the set R of all refinable functions in L(R), and of the set of all MRA affine frames. We prove that R is nowhere dense in L(R); the unit sphere of R is path-connected in the L-norm; and for any M -dimensional hyperplane generated by L-functions f0, . . . , fM , either almost all the functions in the hyperplane are refinable or almost ...

In both the first and the second editions of Hobson's Theory of the Functions of a Real Variable, the author attempts to prove that a non-dense closed set is enumerable if its complementary intervals are such that every one abuts on another at each of its ends. Professor E. L. Moore gave an example of a set satisfying the conditions of the hypothesis of Hobson's theorem, which is not enumerable...

A. We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that the distance-d dominating-set problem, also known as the (k, d)-centres problem, is fixed-parameter tractable on any class that is nowhere dense and closed under induced subgraphs. This generalises known re...

We study dense cases of several covering problems. An instance of the set cover problem with m sets is dense if there is > 0 such that any element belongs to at least m sets. We show that the dense set cover problem can be approximated with the performance ratio c log n for any c > 0 and it is unlikely to be NP-hard. We construct a polynomial-time approximation scheme for the dense Steiner tree...

dense medium cyclone is a high capacity device that is widely used in coal preparation. it is simple in design but the swirling turbulent flow, the presence of medium and coal with different density and size fraction and the presence of the air-core make the flow pattern in dmcs complex. in this article the flow pattern simulation of dmc is performed with computational fluid dynamics and fluent...

We investigate Tukey functions from the ideal of all closed nowhere dense subsets of 2N. In particular, we answer an old question of Isbell and Fremlin by showing that this ideal is not Tukey reducible to the ideal of density zero subsets of N. We also prove non-existence of various special types of Tukey reductions from the nowhere dense ideal to analytic P-ideals. In connection with these res...