Convex quadratic fitting (CQF) has demonstrated great success recently in the task of non-rigidly registering a face in a still image using a constrained local model (CLM). A CLM is a commonly used model for non-rigid object registration and contains two components: (i) local patch-experts that model the appearance of each landmark in the object, and (ii) a global shape prior describing how eac...

Natural materials, such as silk and cellulose, have an inspiring set of properties, which evolved over hundreds millions years. In this study, cellulose nanocrystals (CNCs) regenerated fibroin (RSF) are combined to evaluate their suitability for filament formation. This is assessed by tuning characterizing the interactions between these two materials finally studying alignment mixtures under sh...

A mathematical formulation for intensity-based slice-to-volume registration is proposed. The approach is flexible and accommodates various regularization schemes, similarity measures, and optimizers. The framework is evaluated by registering 2D and 3D cardiac magnetic resonance (MR) images obtained in vivo, aimed at realtime MR-guided applications. Rigid-body and affine transformations are used...

In this paper, a new framework of nonlocal deformation in non-rigid image registration is presented. It is well known that many non-rigid image registration techniques may lead to unsteady deformation (e.g. not one to one) if the dissimilarity between the reference and template images is too large. We present a novel variational framework of the total fractional-order variation to derive the un...

Non-rigid registration of ultrasound images takes an important role in image-guided radiotherapy and surgery. Intensity-based method is popular in non-rigid registration, but it is sensitive to intensity variations and has problems with matching small structure features for the existence of speckles in ultrasound images. In this paper, we develop a new algorithm integrating the intensity and fe...

An ideal I on a cardinal κ is called rigid if all automorphisms of P (κ)/I are trivial. An ideal is called μ-minimal if whenever G ⊆ P (κ)/I is generic and X ∈ P (μ)V [G] \ V , it follows that V [X] = V [G]. We prove that the existence of a rigid saturated μ-minimal ideal on μ+, where μ is a regular cardinal, is consistent relative to the existence of large cardinals. The existence of such an i...

Protein structure alignment is a fundamental problem in computational structure biology. Many programs have been developed for automatic protein structure alignment, but most of them align two protein structures purely based upon geometric similarity without considering evolutionary and functional relationship. As such, these programs may generate structure alignments which are not very biologi...

bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. many computational algorithms have been applied for solving the sequence alignment problem. dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods applied t...

Current alignment algorithms for registering range data captured from a 3D scanner assume that the range data depicts identical geometry taken from different views. However, in the presence of scanner calibration errors, the data will be slightly warped. These warps often cause current alignment algorithms to converge slowly, find the wrong alignment, or even diverge. In this paper, we present ...