Freehand 3D Scanning in a Mobile Environment using Video

This work is motivated by two important trends in consumer computing: (i) the growing pervasiveness of mobile computing devices, and (ii) the users’ desire for increasingly complex but readily acquired and manipulated information content. Specifically, we develop and describe a system for 3D model creation of an object, using only a standard mobile device such as a smart phone. Our approach applies the structured light projection methodology and exploits multiple image input such as frames from a video sequence. In comparison with previous work, a significant further challenge addressed here is that of lower quality input data and limited hardware (processing power and memory, camera and projector quality). Novelties include: (i) a comparison of projection pattern detection approaches in the context of a mobile environment – a robust method combining colour detection and a phase congruency descriptor is evaluated, (ii) a model for single view reconstruction which exploits epipolar, coplanarity and topological constraints, (iii) the use of mobile device sensor data in the iterative closest point algorithm used to register multiple partial 3D reconstructions, and (iv) two heuristics for determining the order in which buffered single view based reconstructions are merged. Our experiments demonstrate that visually appealing results are obtained in a speedy manner which does not require specialist knowledge or expertise from the user.

An iterative allocation mechanism in the edgeworth box

This paper considers an iterative allocation mechanism which resolves the problem of multiplicity of allocations given by a mechanism in commodity space. At each stage, the average of the extreme allocations is taken and used as the starting point of the next stage. As long as the mechanism is individually rational and Pareto optimal, this iterative procedure yields a unique final allocation which is also individually rational and Pareto optimal. (JEL C63, C71)

Switch point finding using polynomial regression for fuzzy type reduction algorithms

Karnik-Mendel (KM) algorithm is the most widely used type reduction (TR) method in literature for the design of interval type-2 fuzzy logic systems (IT2FLS). Its iterative nature for finding left and right switch points is its Achilles heel. Despite a decade of research, none of the alternative TR methods offer uncertainty measures equivalent to KM algorithm. This paper takes a data-driven approach to tackle the computational burden of this algorithm while keeping its key features. We propose a regression method to approximate left and right switch points found by KM algorithm. Approximator only uses the firing intervals, rnles centroids, and FLS strnctural features as inputs. Once training is done, it can precisely approximate the left and right switch points through basic vector multiplications. Comprehensive simulation results demonstrate that the approximation accuracy for a wide variety of FLSs is 100%. Flexibility, ease of implementation, and speed are other features of the proposed method.