Texture Mapping Real‐World Objects with Hydrographics

In the digital world, assigning arbitrary colors to an object is a simple operation thanks to texture mapping. However, in the real world, the same basic function of applying colors onto an object is far from trivial. One can specify colors during the fabrication process using a color 3D printer, but this does not apply to already existing objects. Paint and decals can be used during post‐fabrication, but they are challenging to apply on complex shapes. In this paper, we develop a method to enable texture mapping of physical objects, that is, we allow one to map an arbitrary color image onto a three‐dimensional object. Our approach builds upon hydrographics, a technique to transfer pigments printed on a sheet of polymer onto curved surfaces. We first describe a setup that makes the traditional water transfer printing process more accurate and consistent across prints. We then simulate the transfer process using a specialized parameterization to estimate the mapping between the planar color map and the object surface. We demonstrate that our approach enables the application of detailed color maps onto complex shapes such as 3D models of faces and anatomical casts.     

Computing Minimum Area Homologies

Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles. The minimum area homology exists for broader classes of cycles than previous measures which are based on homotopy. It is also much easier to compute than previously defined measures, yielding an efficient implementation that is based on linear algebra tools. We demonstrate our algorithm on a range of inputs, showing examples which highlight the feasibility of this similarity measure.     

Distilled Collections from Textual Image Queries

We present a distillation algorithm which operates on a large, unstructured, and noisy collection of internet images returned from an online object query. We introduce the notion of a distilled set, which is a clean, coherent, and structured subset of inlier images. In addition, the object of interest is properly segmented out throughout the distilled set. Our approach is unsupervised, built on a novel clustering scheme, and solves the distillation and object segmentation problems simultaneously. In essence, instead of distilling the collection of images, we distill a collection of loosely cutout foreground “shapes”, which may or may not contain the queried object. Our key observation, which motivated our clustering scheme, is that outlier shapes are expected to be random in nature, whereas, inlier shapes, which do tightly enclose the object of interest, tend to be well supported by similar shapes captured in similar views. We analyze the commonalities among candidate foreground segments, without aiming to analyze their semantics, but simply by clustering similar shapes and considering only the most significant clusters representing non‐trivial shapes. We show that when tuned conservatively, our distillation algorithm is able to extract a near perfect subset of true inliers. Furthermore, we show that our technique scales well in the sense that the precision rate remains high, as the collection grows. We demonstrate the utility of our distillation results with a number of interesting graphics applications.     

Variable precision intuitionistic fuzzy rough set model and applications based on conflict distance

Due to the complexity and uncertainty of the physical world, as well as the limitation of human ability to comprehend, it is very difficult for any single method of uncertainty to effectively deal with the decision‐making problem that exists in real life. So, it is natural for us to think about incorporating the advantages of various theories of uncertainty to develop a more powerful hybrid method of soft decision‐making. In view of this recognition, the thought and method of intuitionistic fuzzy sets and variable precision rough sets are used to construct a novel intuitionistic fuzzy rough set model. With respect to the fact that the information system is intuitionistic fuzzy, the idea of measuring intuitionistic fuzzy similarity is used to define conflict distance. After that, this concept is combined with the variable precision rough sets so that a variable precision intuitionistic fuzzy rough set model is established, and its properties are investigated. After proposing an attribute reduction algorithm based on variable precision intuitionistic fuzzy rough sets, a case study is used to verify the feasibility and effectiveness of our novel model. The results show that our model indeed improves the classification ability of earlier models and possesses some ability to tolerate faults through adjusting the parameter λ and the confidence threshold β; it realizes the correct classification and extracts the decision rules.     

A two‐level detector of short‐term unique changes in time series based on a similarity method

In the paper, a novel two‐level algorithm of time‐series change detection is presented. In the first level, to identify non‐stationary sequences in a processed signal, preliminary detection of events is performed with a short‐term prediction comparison. In the second stage, to confirm the changes detected in the first level, a similarity method aimed at identification of unique changes is employed. The detection of changes in a non‐stationary time series is discussed, implemented algorithms are described and the results produced on a sample four financial time series are shown. General conditions for implementing the proposed algorithm as an immune‐like event detector are discussed.     

A flowchart‐based intelligent tutoring system for improving problem‐solving skills of novice programmers

Intelligent tutoring and personalization are considered as the two most important factors in the research of learning systems and environments. An effective tool that can be used to improve problem‐solving ability is an Intelligent Tutoring System which is capable of mimicking a human tutor's actions in implementing a one‐to‐one personalized and adaptive teaching. In this paper, a novel Flowchart‐based Intelligent Tutoring System (FITS) is proposed benefiting from Bayesian networks for the process of decision making so as to aid students in problem‐solving activities and learning computer programming. FITS not only takes full advantage of Bayesian networks, but also benefits from a multi‐agent system using an automatic text‐to‐flowchart conversion approach for engaging novice programmers in flowchart development with the aim of improving their problem‐solving skills. In the end, in order to investigate the efficacy of FITS in problem‐solving ability acquisition, a quasi‐experimental design was adopted by this research. According to the results, students in the FITS group experienced better improvement in their problem‐solving abilities than those in the control group. Moreover, with regard to the improvement of a user's problem‐solving ability, FITS has shown to be considerably effective for students with different levels of prior knowledge, especially for those with a lower level of prior knowledge.     

Cluster Analysis Based on T‐transitive Interval‐Valued Fuzzy Relations

In this paper, we consider cluster analysis based on T‐transitive interval‐valued fuzzy relations. A fuzzy relation with its partitional tree for obtaining an agglomerative hierarchical clustering has been studied and applied. In general, these fuzzy‐relation‐based clustering approaches are based on real‐valued memberships of fuzzy relations. Since interval‐valued memberships may be better than real‐valued memberships to represent higher order imprecision and vagueness for human perception, in this paper we first extend fuzzy relations to interval‐valued fuzzy relations and then construct a clustering algorithm based on the proposed T‐transitive interval‐valued fuzzy relations. We use two examples to demonstrate the efficiency and usefulness of the proposed method. In practical application, we apply the proposed clustering method to performance evaluations for academic departments of higher education by using actual engineering school data in Taiwan.     

On Weakly Smooth Uninorms on Finite Chain

In this paper, we characterize all weakly smooth uninorms (i.e., uninorms with smooth underlying operators) defined on a finite chain. It is proved that any such uninorm is determined by three unary functions and vice versa. As a by‐product, we obtain the characterizations of smooth t‐norms, smooth t‐conorms through additive generators and show that on a finite chain, there exists no counterpart of the class of uninorms continuous in ]0, 1[².     

A note on the optimal pricing and production decisions with price‐driven substitution

Recently, Kim and Bell ( 2011 ) developed a revenue managemnent pricing model with price‐driven substitution. The authors considered production decisions under unlimited production capacity and investigated the impact of price‐driven substitution on a firm's pricing and production decisions. The authors modeled the consumer demands for each market segment as linear additive demand function based on exogenous variables, where demand substitution occurred as a function of price differences between the two products. In this article, we extend this work to examine the impact of a production capacity constraint on the firm's joint pricing and inventory decisions. Based on this extended model, we investigate the impact of price‐driven substitution on a firm's pricing and production decisions where there is a limit on total capacity. We show how revenue managers should adjust prices and production levels to take into account price‐driven substitution under a capacity constraint setting. Both deterministic and stochastic models are developed, and the impact of price‐driven substitution and a capacity constraint on the optimal prices, production levels, and revenues is illustrated.