Shape from shading using graph cuts

In this paper, we investigate the applicability of graph cuts to the SFS (shape-from-shading) problem. We propose a new semi-global method for SFS using graph cuts. The new algorithm combines the local method proposed by Lee and Rosenfeld [C.H. Lee, A. Rosenfeld, Improved methods of estimating shape from shading using the light source coordinate system, Artif. Intell. 26 (1985) 125-143] and a global method using an energy minimization technique. By employing a new global energy minimization formulation, the convex/concave ambiguity problem of Lee and Rosenfeld's method can be resolved efficiently. A new combinatorial optimization technique, the graph cuts method, is used for the minimization of the proposed energy functional. Experimental results on a variety of synthetic and real-world images show that the proposed algorithm reconstructs the 3-D shape of objects very efficiently.     

An Example-based Procedural System for Element Arrangement

We present a method for synthesizing two dimensional (2D) element arrangements from an example. The main idea is to combine texture synthesis techniques based‐on a local neighborhood comparison and procedural modeling systems based‐on local growth. Given a user‐specified reference pattern, our system analyzes neigh‐borhood information of each element by constructing connectivity. Our synthesis process starts with a single seed and progressively places elements one by one by searching a reference element which has local features that are the most similar to the target place of the synthesized pattern. To support creative design activities, we introduce three types of interaction for controlling global features of the resulting pattern, namely a spray tool, a flow field tool, and a boundary tool. We also introduce a global optimization process that helps to avoid local error concentrations. We illustrate the feasibility of our method by creating several types of 2D patterns.     

Color Subspaces as Photometric Invariants

Complex reflectance phenomena such as specular reflections confound many vision problems since they produce image ‘features’ that do not correspond directly to intrinsic surface properties such as shape and spectral reflectance. A common approach to mitigate these effects is to explore functions of an image that are invariant to these photometric events. In this paper we describe a class of such invariants that result from exploiting color information in images of dichromatic surfaces. These invariants are derived from illuminant-dependent ‘subspaces’ of RGB color space, and they enable the application of Lambertian-based vision techniques to a broad class of specular, non-Lambertian scenes. Using implementations of recent algorithms taken from the literature, we demonstrate the practical utility of these invariants for a wide variety of applications, including stereo, shape from shading, photometric stereo, material-based segmentation, and motion estimation.     

Effects of the handle diameter and tip angle of chopsticks on the food-serving performance of male subjects

The effects of chopsticks handle diameter and tip angle on the food-serving performance of pinching food, pulling food, shearing food and thrusting food, were investigated in this study. A total of 24 male subjects was tested using 12 pairs of experimental chopsticks, consisting of three types of different handle diameters and four types of different tip angles. These results indicated that chopstick handle diameter and tip angle have a significant influence on eating efficiency, and that these two variables have a significant interaction. In addition, chopstick tip diameter also had significant effects on performance at the four tasks and subjective ratings. Generally, according to the results, when the chopsticks design is presented in terms of handle diameter, tip angle and tip diameter, a pair of chopsticks with 6 mm handle diameter × 2 ° tip angle × 4 mm tip diameter would be optimum.     

Novel Lyapunov-based rapid and ripple-free MPPT using a robust model reference adaptive controller for solar PV system

The technological, economic, and environmental benefits of photovoltaic (PV) systems have led to their widespread adoption in recent years as a source of electricity generation. However, precisely identifying a PV system''s maximum power point (MPP) under normal and shaded weather conditions is crucial to conserving the maximum generated power. One of the biggest concerns with a PV system is the existence of partial shading, which produces multiple peaks in the P–V characteristic curve. In these circumstances, classical maximum power point tracking (MPPT) approaches are prone to getting stuck on local peaks and failing to follow the global maximum power point (GMPP). To overcome such obstacles, a new Lyapunov-based Robust Model Reference Adaptive Controller (LRMRAC) is designed and implemented to reach GMPP rapidly and ripple-free. The proposed controller also achieves MPP accurately under slow, abrupt and rapid changes in radiation, temperature and load profile. Simulation and OPAL-RT real-time simulators in various scenarios are performed to verify the superiority of the proposed approach over the other state-of-the-art methods, i.e., ANFIS, INC, VSPO, and P&O. MPP and GMPP are accomplished in less than 3.8 ms and 10 ms, respectively. Based on the results presented, the LRMRAC controller appears to be a promising technique for MPPT in a PV system.     

暗藏外遮阳卷帘盒的窗户结构研究

本文结合传统的外遮阳做法,对外遮阳的构造做法进行了创新,力求实现既不影响建筑外立面效果又能切实起到遮阳实现节能建筑的要求构造方式.     

Linux EXT4文件系统分析

介绍EXT4文件系统的原理和数据结构,重点与EXT3文件系统做了比较,通过分析WRITE操作来解释EXT4文件系统的工作,为用户选择Linux内核提供参考。     

A Multidirectional Occlusion Shading Model for Direct Volume Rendering

In this paper, we present a novel technique which simulates directional light scattering for more realistic interactive visualization of volume data. Our method extends the recent directional occlusion shading model by enabling light source positioning with practically no performance penalty. Light transport is approximated using a tilted cone‐shaped function which leaves elliptic footprints in the opacity buffer during slice‐based volume rendering. We perform an incremental blurring operation on the opacity buffer for each slice in front‐to‐back order. This buffer is then used to define the degree of occlusion for the subsequent slice. Our method is capable of generating high‐quality soft shadowing effects, allows interactive modification of all illumination and rendering parameters, and requires no pre‐computation.     

Kinematics, pattern recognition, and motion control of mask-panel alignment system

Kinematics, pattern recognition, and motion control methods are investigated as an integrated approach for a mask-panel visual alignment system, which consists of the vision system to extract the mask-panel misalignment and the stage control system to compensate for it. First, a 4PPR alignment mechanism is considered and the inverse kinematic solution is found out to define the relationship between the mask-panel misalignment and the displacements of active joints. Then, a fast alignment mark recognition algorithm is proposed in terms of the geometric template matching (GTM), which is specific to simply shaped patterns but computationally much efficient compared with general correlation-based matchings. Finally, the kinematic solution and the developed vision algorithm are incorporated to implement a two-stage position-based visual servo, where both original fine images and reduced coarse ones are utilized together and the GTM plays a crucial role in achieving a near real-time visual feedback. Experimental results are shown to demonstrate the effectiveness of the GTM-based two-stage alignment control.     

Fast,Sub‐pixel Antialiased Shadow Maps

Solving aliasing artifacts is an essential problem in shadow mapping approaches. Many works have been proposed, however, most of them focused on removing the texel‐level aliasing that results from the limited resolution of shadow maps. Little work has been done to solve the pixel‐level shadow aliasing that is produced by the rasterization on the screen plane. In this paper, we propose a fast, sub‐pixel antialiased shadowing algorithm to solve the pixel aliasing problem. Our work is based on the alias‐free shadow maps, which is capable of computing accurate per‐pixel shadow, and only incurs little cost to extend to sub‐pixel accuracy. Instead of direct supersampling the screen space, we take facets to approximate pixels in shadow testing. The shadowed area of one facet is rapidly evaluated by projecting blocker geometry onto a supersampled 2D occlusion mask with bitmasks fusion. It provides a sub‐pixel occlusion sampling so as to capture fine shadow details and features. Furthermore, we introduce the silhouette mask map that limits visibility evaluation to pixels only on the silhouette, which greatly reduces the computation cost. Our algorithm runs entirely on the GPU, achieving real‐time performance and is an order of magnitude faster than the brute‐force supersampling method to produce comparable 32× antialiased shadows.