bluuebunny/crossref_metadata_2025_split huggingface dataset:
3D Shape Segmentation and Labeling via Extreme Learning Machine
Authors: Xie Zhige , Xu Kai , Liu Ligang , Xiong Yueshan 
Published: August 2014

AbstractWe propose a fast method for 3D shape segmentation and labeling via Extreme Learning Machine (ELM). Given a set of example shapes with labeled segmentation, we train an ELM classifier and use it to produce initial segmentation for test shapes. Based on the initial segmentation, we compute the final smooth segmentation through a graph‐cut optimization constrained by the super‐face boundaries obtained by over‐segmentation and the active contours computed from ELM segmentation. Experimental results show that our method achieves comparable results against the state‐of‐the‐arts, but reduces the training time by approximately two orders of magnitude, both for face‐level and super‐face‐level, making it scale well for large datasets. Based on such notable improvement, we demonstrate the application of our method for fast online sequential learning for 3D shape segmentation at face level, as well as realtime sequential learning at super‐face level.
Transductive 3D Shape Segmentation using Sparse Reconstruction
Authors: Xu Weiwei , Shi Zhouxu , Xu Mingliang , Zhou Kun , Wang Jingdong , Zhou Bin , Wang Jinrong , Yuan Zhenming 
Published: August 2014

AbstractWe propose a transductive shape segmentation algorithm, which can transfer prior segmentation results in database to new shapes without explicitly specification of prior category information. Our method first partitions an input shape into a set of segmentations as a data preparation, and then a linear integer programming algorithm is used to select segments from them to form the final optimal segmentation. The key idea is to maximize the segment similarity between the segments in the input shape and the segments in database, where the segment similarity is computed through sparse reconstruction error. The segment‐level similarity enables to handle a large amount of shapes with significant topology or shape variations with a small set of segmented example shapes. Experimental results show that our algorithm can generate high quality segmentation and semantic labeling results in the Princeton segmentation benchmark.
Supervised learning of bag‐of‐features shape descriptors using sparse coding
Authors: Litman Roee , Bronstein Alex , Bronstein Michael , Castellani Umberto 
Published: August 2014

AbstractWe present a method for supervised learning of shape descriptors for shape retrieval applications. Many content‐based shape retrieval approaches follow the bag‐of‐features (BoF) paradigm commonly used in text and image retrieval by first computing local shape descriptors, and then representing them in a ‘geometric dictionary’ using vector quantization. A major drawback of such approaches is that the dictionary is constructed in an unsupervised manner using clustering, unaware of the last stage of the process (pooling of the local descriptors into a BoF, and comparison of the latter using some metric). In this paper, we replace the clustering with dictionary learning, where every atom acts as a feature, followed by sparse coding and pooling to get the final BoF descriptor. Both the dictionary and the sparse codes can be learned in the supervised regime via bi‐level optimization using a task‐specific objective that promotes invariance desired in the specific application. We show significant performance improvement on several standard shape retrieval benchmarks.
An Efficient Approach to Correspondences between Multiple Non‐Rigid Parts
Authors: Tam Gary K.L. , Martin Ralph R. , Rosin Paul L. , Lai Yu‐Kun 
Published: August 2014

AbstractIdentifying multiple deformable parts on meshes and establishing dense correspondences between them are tasks of fundamental importance to computer graphics, with applications to e.g. geometric edit propagation and texture transfer. Much research has considered establishing correspondences between non‐rigid surfaces, but little work can both identify similar multiple deformable parts and handle partial shape correspondences. This paper addresses two related problems, treating them as a whole: (i) identifying similar deformable parts on a mesh, related by a non‐rigid transformation to a given query part, and (ii) establishing dense point correspondences automatically between such parts. We show that simple and efficient techniques can be developed if we make the assumption that these parts locally undergo isometric deformation. Our insight is that similar deformable parts are suggested by large clusters of point correspondences that are isometrically consistent. Once such parts are identified, dense point correspondences can be obtained by an iterative propagation process. Our techniques are applicable to models with arbitrary topology. Various examples demonstrate the effectiveness of our techniques.
Learnt Real‐time Meshless Simulation
Authors: Sidorov K. A. , Marshall A. D. 
Published: August 2014

AbstractWe present a new real‐time approach to simulate deformable objects using a learnt statistical model to achieve a high degree of realism. Our approach improves upon state‐of‐the‐art interactive shape‐matching meshless simulation methods by not only capturing important nuances of an object's kinematics but also of its dynamic texture variation. We are able to achieve this in an automated pipeline from data capture to simulation. Our system allows for the capture of idiosyncratic characteristics of an object's dynamics which for many simulations (e.g. facial animation) is essential. We allow for the plausible simulation of mechanically complex objects without knowledge of their inner workings. The main idea of our approach is to use a flexible statistical model to achieve a geometrically‐driven simulation that allows for arbitrarily complex yet easily learned deformations while at the same time preserving the desirable properties (stability, speed and memory efficiency) of current shape‐matching simulation systems. The principal advantage of our approach is the ease with which a pseudo‐mechanical model can be learned from 3D scanner data to yield realistic animation. We present examples of non‐trivial biomechanical objects simulated on a desktop machine in real‐time, demonstrating superior realism over current geometrically motivated simulation techniques.
What Makes London Work Like London?
Authors: AlHalawani Sawsan , Yang Yong‐Liang , Wonka Peter , Mitra Niloy J. 
Published: August 2014

AbstractUrban data ranging from images and laser scans to traffic flows are regularly analyzed and modeled leading to better scene understanding. Commonly used computational approaches focus on geometric descriptors, both for images and for laser scans. In contrast, in urban planning, a large body of work has qualitatively evaluated street networks to understand their effects on the functionality of cities, both for pedestrians and for cars. In this work, we analyze street networks, both their topology (i.e., connectivity) and their geometry (i.e., layout), in an attempt to understand which factors play dominant roles in determining the characteristic of cities. We propose a set of street network descriptors to capture the essence of city layouts and use them, in a supervised setting, to classify and categorize various cities across the world. We evaluate our method on a range of cities, of various styles, and demonstrate that while standard image‐level descriptors perform poorly, the proposed network‐level descriptors can distinguish between different cities reliably and with high accuracy.
Pattern‐Based Quadrangulation for N‐Sided Patches
Authors: Takayama Kenshi , Panozzo Daniele , Sorkine‐Hornung Olga 
Published: August 2014

AbstractWe propose an algorithm to quadrangulate an N‐sided patch (2 ≤ N ≤ 6) with prescribed numbers of edge subdivisions at its boundary. Our algorithm is guaranteed to succeed for arbitrary valid input, which is proved using a canonical simplification of the input and a small set of topological patterns that are sufficient for supporting all possible cases. Our algorithm produces solutions with minimal number of irregular vertices by default, but it also allows the user to choose other feasible solutions by solving a set of small integer linear programs. We demonstrate the effectiveness of our algorithm by integrating it into a sketch‐based quad remeshing system. A reference C++ implementation of our algorithm is provided as a supplementary material.
Super 4PCS Fast Global Pointcloud Registration via Smart Indexing
Authors: Mellado Nicolas , Aiger Dror , Mitra Niloy J. 
Published: August 2014

AbstractData acquisition in large‐scale scenes regularly involves accumulating information across multiple scans. A common approach is to locally align scan pairs using Iterative Closest Point (ICP) algorithm (or its variants), but requires static scenes and small motion between scan pairs. This prevents accumulating data across multiple scan sessions and/or different acquisition modalities (e.g., stereo, depth scans). Alternatively, one can use a global registration algorithm allowing scans to be in arbitrary initial poses. The state‐of‐the‐art global registration algorithm, 4PCS, however has a quadratic time complexity in the number of data points. This vastly limits its applicability to acquisition of large environments. We present Super 4PCS for global pointcloud registration that is optimal, i.e., runs in linear time (in the number of data points) and is also output sensitive in the complexity of the alignment problem based on the (unknown) overlap across scan pairs. Technically, we map the algorithm as an ‘instance problem’ and solve it efficiently using a smart indexing data organization. The algorithm is simple, memory‐efficient, and fast. We demonstrate that Super 4PCS results in significant speedup over alternative approaches and allows unstructured efficient acquisition of scenes at scales previously not possible. Complete source code and datasets are available for research use at http://geometry.cs.ucl.ac.uk/projects/2014/super4PCS/.
Remeshing‐assisted Optimization for Locally Injective Mappings
Authors: Jin Y. , Huang J. , Tong R. 
Published: August 2014

AbstractConstructing locally injective mappings for 2D triangular meshes is vital in applications such as deformations. In such a highly constrained optimization, the prescribed tessellation may impose strong restriction on the solution. As a consequence, the feasible region may be too small to contain an ideal solution, which leads to problems of slow convergence, poor solution, or even that no solution can be found. We propose to integrate adaptive remeshing into interior point method to solve this issue. We update the vertex positions via a parameter‐free relaxation enhanced geometry optimization, and then use edge‐flip operations to reduce the residual and keep a reasonable condition number for better convergence. For more robustness, when the iteration of interior point method terminates but leaves the positional constraints unsatisfied, we estimate the edges in the current tessellation that block vertices moving based on the convergence information of the optimization, and then split neighboring edges to break the restriction. The results show that our method has better performance than the solely geometric optimization approaches, especially for extreme deformations.
Cross‐Collection Map Inference by Intrinsic Alignment of Shape Spaces
Authors: Shapira Nitzan , Ben‐Chen Mirela 
Published: August 2014

AbstractInferring maps between shapes is a long standing problem in geometry processing. The less similar the shapes are, the harder it is to compute a map, or even define criteria to evaluate it. In many cases, shapes appear as part of a collection, e.g. an animation or a series of faces or poses of the same character, where the shapes are similar enough, such that maps within the collection are easy to obtain. Our main observation is that given two collections of shapes whose “shape space” structure is similar, it is possible to find a correspondence between the collections, and then compute a cross‐collection map. The cross‐map is given as a functional correspondence, and thus it is more appropriate in cases where a bijective point‐to‐point map is not well defined. Our core idea is to treat each collection as a point‐sampling from a low‐dimensional shape‐space manifold, and use dimensionality reduction techniques to find a low‐dimensional Euclidean embedding of this sampling. To measure distances on the shape‐space manifold, we use the recently introduced shape differences, which lead to a similar low‐dimensional structure of the shape spaces, even if the shapes themselves are quite different. This allows us to use standard affine registration for point‐clouds to align the shape‐spaces, and then find a functional cross‐map using a linear solve. We demonstrate the results of our algorithm on various shape collections and discuss its properties.
KRAS status and resistance to epidermal growth factor receptor tyrosine‐kinase inhibitor treatment in patients with metastatic colorectal cancer: a meta‐analysis
Authors: Li W. , Shi Q. , Wang W. , Liu J. , Ren J. , Li Q. , Hou F. 
Published: August 2014

AbstractAimThis study reviewed the association between KRAS mutation and resistance to treatment with epidermal growth factor receptor (EGFR) tyrosine‐kinase inhibitors (TKIs) in patients with metastatic colorectal cancer (mCRC).MethodA search was carried out of PubMed, MEDLINE, EMBASE and the Cochrane Library databases (to November 2013) without language restrictions.ResultsTen studies were included in the final meta‐analysis, consisting of 1339 patients with mCRC, of whom 427 (32%) had a KRAS mutation. The objective response rate (ORR) of mCRC patients with KRAS mutation was 8% (33/427), whereas the ORR of mCRC patients with wild‐type KRAS was 34% (306/912). The overall pooled response rate (RR) for the ORR was 1.297 (95% CI 1.244–1.353, P < 0.01). Subgroup analysis comparing cetuximab monotherapy treatment with cetuximab plus chemotherapy, showed a pooled RR of 1.26 (95% CI 1.12–0.63, P < 0.01) and 1.30 (95% CI 1.25–1.36, P < 0.01), respectively. For patients receiving anti‐EGFR with monoclonal antibodies (mAb) given as first‐line treatment or not, the pooled RRs were 1.34 (95% CI 1.23–1.46, P < 0.01) and 1.29 (95% CI 1.23–1.35, P < 0.01). The data on progression‐free survival from five studies in the meta‐analysis gave a hazard ratio (HR) of 1.99 with a 95% CI of 1.69–2.29. Finally, the data for overall survival in mCRC patients were pooled from the only three studies reporting the HR (1.80; 95% CI 1.50–2.10). None of the results had any evidence of heterogeneity.ConclusionAll the results favoured a stronger link between mutant KRAS and anti‐EGFR mAb, but due to a mutually exclusive relationship between KRAS and other gene mutations the clinical usefulness of KRAS mutation as a selection marker for sensitivity to EGFR TKIs in mCRC is limited.
Complications after surgery for colorectal cancer affect quality of life and surgeon–patient relationship
Authors: Di Cristofaro L. , Ruffolo C. , Pinto E. , Massa M. , Antoniutti M. , Cagol M. , Massani M. , Alfieri R. , Costa A. , Bassi N. , Castoro C. , Scarpa M. 
Published: August 2014

AbstractAimThis multicentric prospective study aimed to investigate how postoperative complications after surgery for colorectal cancer affect patients' quality of life and satisfaction with care.MethodOne hundred and sixteen patients operated on for colorectal cancer were enrolled in this study. Patients answered three questionnaires about generic (EORTC QLQ‐C30) and disease‐specific (EORTC QLQ‐CR29) quality of life and treatment satisfaction (EORTC IN‐PATSAT32) at the time of admission and at 1 and 6 months after surgery. Non‐parametric tests and linear multiple regression models were used for statistical analysis.ResultsTwelve patients had complications requiring further surgery (anastomotic leakage, abdominal bleeding, abdominal wall sepsis, wound infection). Patients with complications that required surgery reported a worse score of physical function, emotional function and anxiety than patients without such complications 1 month after surgery. These patients judged their general satisfaction with the quality of care and doctors' interpersonal skills, technical skills, information provision and availability to be worse than in patients without such complications. The presence of postoperative psychiatric complications and anastomotic leakage were independent predictors of quality of life (β = −0.30, P = 0.004, and β = −0.42, P < 0.001).ConclusionIn patients undergoing surgery for colorectal cancer, complications requiring any kind of surgical management significantly affected patients' perception of all doctor‐related items suggesting an impairment of the entire surgeon–patient relationship. Convincing patients that ‘zero risk’ cannot be achieved in surgical practice is therefore a priority.
A systematic review of patient preference elicitation methods in the treatment of colorectal cancer
Authors: Currie A. , Askari A. , Nachiappan S. , Sevdalis N. , Faiz O. , Kennedy R. 
Published: August 2014

AbstractAimThis systematic review aimed to assess the use of patient preference in colorectal cancer treatment. Eliciting patient preference is important for shared decision‐making in colorectal cancer treatment. The introduction of newer treatments, which balance quality of life and overall survival, makes this an important future focus.MethodA systematic search strategy of MEDLINE, Embase, PsycINFO, CINAHL and the Cochrane Database for Systematic Reviews was undertaken to obtain relevant articles. Information regarding the type of patients included, preference instruments, study settings, outcomes and limitations was extracted.ResultsThe eight articles comprising this review each described an empirical study using a validated instrument to define patient preference for an aspect of colorectal cancer treatment. The evidence suggests that patients are prepared to trade significant reductions in life expectancy to avoid certain complications of colorectal surgery, particularly stoma formation. In the adjuvant setting, patients are prepared to risk significant treatment side effects to gain small potential increases in life expectancy and chance of survival. Where neoadjuvant or adjuvant treatment risks worsening function, however, patients generally forgo any potential increase in survival to improve bowel function and therefore quality of life. The only predictors of preference were tertiary education and previous cancer treatment.ConclusionMost patients judge a moderate survival benefit to be sufficient to make adjuvant therapy for colorectal cancer worthwhile, but they are willing to trade a potential reduction in life expectancy and survival to avoid certain unwanted surgical sequelae.
Major postoperative complications following elective resection for colorectal cancer decrease long‐term survival but not the time to recurrence
Authors: Odermatt M. , Miskovic D. , Flashman K. , Khan J. , Senapati A. , O'Leary D. , Thompson M. , Parvaiz A. 
Published: August 2014

AbstractAimThe aim of the study was to determine the effect of major complications after colorectal cancer surgery on survival and time to recurrence.MethodPatients having a curative colorectal cancer resection and a follow‐up of at least 3 years were identified from a prospective database. Major complications were defined as Clavien–Dindo Grades 3b or 4 and their impact on time to recurrence and mortality was analysed by univariate and multivariable analysis. Postoperative death within 30 days or during the initial hospitalization (Clavien–Dindo Grade 5) was a priori excluded.ResultsFrom 2003 to 2012, 868 colorectal cancer resections resulting in 63 (7%) major postoperative complications including deaths (Clavien–Dindo ≥ 3b) were identified. After exclusion of Grade 5 complications (postoperative or in‐hospital deaths), 844 resections with 39 (5%) major complications remained for analysis. Median follow‐up time was 5.7 years. Using the Kaplan–Meier method, the estimated crude 5‐year overall survival probability was 78% (95% CI 75–81) in the group without and 65% (95% CI 51–83) in the group with major complications (P = 0.009, log‐rank test). Major complications were a significant negative predictor for overall survival (hazard ratio 2.42, 95% CI 1.41–4.14) when adjusted for sex, age, American Society of Anesthesiologists grade, tumour site (colon vs rectum), R stage and tumour stage. However, in both univariate and multivariable analysis, major complications were not a significant predictor for time to recurrence (hazard ratio 1.29, 95% CI 0.56–2.99).ConclusionNon‐lethal major postoperative complications seem to have a negative long‐term impact on survival but not on time to recurrence.
Urinary and sexual dysfunction in women after resection with and without preoperative radiotherapy for rectal cancer: a population‐based cross‐sectional study
Authors: Bregendahl S. , Emmertsen K. J. , Lindegaard J. C. , Laurberg S. 
Published: August 2014

AbstractAimKnowledge of urinary and sexual dysfunction in women after rectal cancer treatment is limited. This study addresses this in relation to the use of preoperative radiotherapy, type of surgery and the presence of bowel dysfunction.MethodAll living female patients who underwent abdominoperineal excision (APE) or low anterior resection (LAR) for rectal cancer in Denmark between 2001 and 2007 were identified. Validated questionnaires (the ICIQ‐FLUTS and the SVQ) on urinary and sexual function were completed by 516 (75%) and 482 (72%) recurrence‐free patients in 2009.ResultsUrgency and incontinence were reported by 77 and 63% of respondents, respectively. Vaginal dryness, dyspareunia and reduced vaginal dimensions occurred in 72, 53 and 29%, respectively, and 69% reported that they had little/no sexual desire. Preoperative radiotherapy was associated with voiding difficulties (OR = 1.63, 95% CI 1.09–2.44), reduced vaginal dimensions (OR = 4.77, 95% CI 1.97–11.55), dyspareunia (OR = 2.76, 95% CI 1.12–6.79), lack of desire (OR = 2.22, 95% CI 1.09–4.53) and reduced sexual activity (OR = 0.55, 95% CI 0.30–0.98). Patients undergoing APE had a higher risk of dyspareunia (OR = 2.61, 95% CI 1.00–6.85). Bowel dysfunction after LAR was associated with bladder storage difficulties (OR = 1.64, 95% CI 1.01–2.65), symptoms of incontinence (OR = 2.17, 95% CI 1.35–3.50), lack of sexual desire (OR = 2.69, 95% CI 1.21–5.98), sexual inactivity (OR = 0.48, 95% CI 0.24–0.96) and sexual dissatisfaction (OR = 0.40, 95% CI 0.20–0.82).ConclusionUrinary and sexual problems are common in women after treatment for rectal cancer. Preoperative radiotherapy interferes with several aspects of urinary and sexual functioning. Bowel dysfunction after LAR is associated with urinary dysfunction and a reduction in sexual desire, activity and satisfaction.