20 pixels on the guidewire dataset and the MPE of 5.30 pixels on the retinal microsurgery dataset, both achieving the state-of-the-art localization results. Besides, the inference rate of our framework is at least 20FPS, which meets the real-time requirement of fluoroscopy images (6-12FPS).Facial expression editing plays a fundamental role in facial expression generation and has been widely applied in modern film productions and computer games. While the existing 2-D caricature facial expression editing methods are mostly realized by expression interpolation from the original image to the target image, expression extrapolation has rarely been studied before. In this article, we propose a novel expression extrapolation method for caricature facial expressions based on the Kendall shape space, in which the key idea is to introduce a representation for the 3-D expression model to remove rigid transformations, such as translation, scaling, and rotation, from the Kendall shape space. Built upon the proposed representation, the 2-D caricature expression extrapolation process can be controlled by the 3-D model reconstructed from the input 2-D caricature image and the exaggerated expressions of the caricature images generated based on the extrapolated expression of a 3-D model that is robust to facial poses in the Kendall shape space; this 3-D model can be calculated with tools such as exponential mapping in Riemannian space. The experimental results demonstrate that our method can effectively and automatically extrapolate facial expressions in caricatures with high consistency and fidelity. N-Acetyl-DL-methionine cell line In addition, we derive 3-D facial models with diverse expressions and expand the scale of the original FaceWarehouse database. Furthermore, compared with the deep learning method, our approach is based on standard face datasets and avoids the construction of complicated 3-D caricature training sets.Sketch recognition aims to segment and identify objects in a collection of hand-drawn strokes. In general, segmentation is a computationally demanding process since it requires searching through a large number of possible recognition hypotheses. It has been shown that, if the drawing order of the strokes is known, as in the case of online drawing, a class of efficient recognition algorithms become applicable. In this paper, we introduce a method that achieves efficient segmentation and recognition in offline drawings by combining dynamic programming with a novel stroke ordering method. Through rigorous evaluation, we demonstrate that the combined system is efficient as promised, and either beats or matches the state of the art in well-established databases and benchmarks.The growing demand for building information modeling (BIM) data and ubiquitous applications make it increasingly necessary to establish a reliable way to share the models on lightweight devices. Building scenes have strong occlusion features and the building exterior plays an important role in digital devices with limited computational resources. This allows the possibility to reduce the resource consumption while roaming in outdoor scenes by culling away the interior building data. This article addresses the task of automatic annotation of BIM building exterior via voxel index analysis. We showcase the research of using industry foundation classes (IFC) and other mainstream formats as our input data and proposed an automatic algorithm for annotating the building exterior. Afterward, a practical and accurate voxel index analysis procedure is designed for frequently flawed models. The annotation can be added directly into the original data file under the same IFC standard, avoiding the complex procedure and information loss in semantics mapping between different standards. The final examinations show the robustness of our algorithm and the capability of handling large BIM building models.The skeleton, or medial axis, is an important attribute of 2-D shapes. The disk B-spline curve (DBSC) is a skeleton-based parametric freeform 2-D region representation, which is defined in the B-spline form. The DBSC describes not only a 2-D region, which is suitable for describing heterogeneous materials in the region, but also the center curve (skeleton) of the region explicitly, which is suitable for animation, simulation, and recognition. In addition to being useful for error estimation of the B-spline curve, the DBSC can be used in designing and animating freeform 2-D regions. Despite increasing DBSC applications, its theory and fundamentals have not been thoroughly investigated. In this article, we discuss several fundamental properties and algorithms, such as the de Boor algorithm for DBSCs. We first derive the explicit evaluation and derivatives formulas at arbitrary points of a 2-D region (interior and boundary) represented by a DBSC and then provide heterogeneous object representation. We also introduce modeling and interactive heterogeneous object design methods for a DBSC, which consolidates DBSC theory and supports its further applications.Label-specific features serve as an effective strategy to learn from multi-label data, where a set of features encoding specific characteristics of each label are generated to help induce multi-label classification model. Existing approaches work by taking the two-stage strategy, where the procedure of label-specific feature generation is independent of the follow-up procedure of classification model induction. Intuitively, the performance of resulting classification model may be suboptimal due to the decoupling nature of the two-stage strategy. In this paper, a wrapped learning approach is proposed which aims to jointly perform label-specific feature generation and classification model induction. Specifically, one (kernelized) linear model is learned for each label where label-specific features are simultaneously generated within an embedded feature space via empirical loss minimization and pairwise label correlation regularization. Comparative studies over a total of twelve benchmark data sets clearly validate the effectiveness of the wrapped strategy in exploiting label-specific features for multi-label classification.