3D Image Reconstruction From Truncated Helical Cone Beam Projection Data - A Linear Prediction Approach

With the introduction of 2D flat-panel X-ray detectors, 3D image reconstruction using helical cone-beam tomography is fast replacing the conventional 2D reconstruction techniques. In 3D image reconstruction, the source orbit or scanning geometry should satisfy the data sufficiency or completeness condition for exact reconstruction. The helical scan geometry satisfies this condition and hence can give exact reconstruction. The theoretically exact helical cone-beam reconstruction algorithm proposed by Katsevich is a breakthrough and has attracted interest in the 3D reconstruction using helical cone-beam Computed Tomography.In many practical situations, the available projection data is incomplete. One such case is where the detector plane does not completely cover the full extent of the object being imaged in lateral direction resulting in truncated projections. This result in artifacts that mask small features near to the periphery of the ROI when reconstructed using the convolution back projection (CBP) method assuming that the projection data is complete. A number of techniques exist which deal with completion of missing data followed by the CBP reconstruction. In 2D, linear prediction (LP)extrapolation has been shown to be efficient for data completion, involving minimal assumptions on the nature of the data, producing smooth extensions of the missing projection data.In this paper, we propose to extend the LP approach for extrapolating helical cone beam truncated data. The projection on the multi row flat panel detectors has missing columns towards either ends in the lateral direction in truncated data situation. The available data from each detector row is modeled using a linear predictor. The available data is extrapolated and this completed projection data is backprojected using the Katsevich algorithm. Simulation results show the efficacy of the proposed method.

Minimal Triangulations of Manifolds

Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for spheres and two series of manifolds, vertex-minimal triangulations are known for only few manifolds of dimension more than 2 (see the table given at the end of Section 5). In this article, we present a brief survey on the works done in last 30 years on the following:(i) Finding the minimal number of vertices required to triangulate a given pl manifold. (ii) Given positive integers n and d, construction of n-vertex triangulations of different d-dimensional pl manifolds. (iii) Classifications of all the triangulations of a given pl manifold with same number of vertices.In Section 1, we have given all the definitions which are required for the remaining part of this article. A reader can start from Section 2 and come back to Section 1 as and when required. In Section 2, we have presented a very brief history of triangulations of manifolds. In Section 3,we have presented examples of several vertex-minimal triangulations. In Section 4, we have presented some interesting results on triangulations of manifolds. In particular, we have stated the Lower Bound Theorem and the Upper Bound Theorem. In Section 5, we have stated several results on minimal triangulations without proofs. Proofs are available in the references mentioned there. We have also presented some open problems/conjectures in Sections 3 and 5.

C-H functionalization of tertiary amines by cross dehydrogenative coupling reactions: solvent-free synthesis of alpha-aminonitriles and beta-nitroamines under aerobic condition

A solvent-free synthesis of alpha-aminonitriles and beta-nitroamines by oxidative cross-dehydrogenative coupling under aerobic condition is reported. A catalytic amount of molybdenum(VI) acetylacetonoate was found to catalyze cyanation of tertiary amines to form alpha-aminonitriles, whereas vanadium pentoxide was found to promote aza-Henry reaction to furnish beta-nitroamines. Both of these environmentally benign reactions are performed in the absence of solvents using molecular oxygen as an oxidant.

A novel free floating accelerometer force balance system for shock tunnel applications

In order to overcome the interference of the model mounting system with the external aerodynamics of the body during shock tunnel testing, a new free floating internally mountable balance system that ensures unrestrained model motion during testing has been designed, fabricated and tested. Minimal friction ball bearings are used for ensuring the free floating condition of the model during tunnel testing. The drag force acting on a blunt leading edge flat plate at hypersonic Mach number has been measured using the new balance system. Finite element model (FEM) and CFD are exhaustively used in the design as well as for calibrating the new balance system. The experimentally measured drag force on the blunt leading edge flat plate at stagnation enthalpy of 0.7 and 1.2 MJ/kg and nominal Mach number of 5.75 matches well with FEM results. The concept can also be extended for measuring all the three fundamental aerodynamic forces in short duration test facilities like free piston driven shock tunnels.

Minimal unsatisfiable sets: Classification and bounds

Proving the unsatisfiability of propositional Boolean formulas has applications in a wide range of fields. Minimal Unsatisfiable Sets (MUS) are signatures of the property of unsatisfiability in formulas and our understanding of these signatures can be very helpful in answering various algorithmic and structural questions relating to unsatisfiability. In this paper, we explore some combinatorial properties of MUS and use them to devise a classification scheme for MUS. We also derive bounds on the sizes of MUS in Horn, 2-SAT and 3-SAT formulas.

Minimal triangulation, complementarity and projective planes

Brehm and Kuhnel proved that if M-d is a combinatorial d-manifold with 3d/2 + 3 vertices and \ M-d \ is not homeomorphic to Sd then the combinatorial Morse number of M-d is three and hence d is an element of {0, 2, 4, 8, 16} and \ M-d \ is a manifold like a projective plane in the sense of Eells and Kuiper. We discuss the existence and uniqueness of such combinatorial manifolds. We also present the following result: ''Let M-n(d) be a combinatorial d-manifold with n vertices. M-n(d) satisfies complementarity if and only if d is an element of {0, 2, 4, 8, 16} with n = 3d/2 + 3 and \ M-n(d) \ is a manifold like a projective plane''.

Contractive Hilbert modules and their dilations

In this note, we show that a quasi-free Hilbert module R defined over the polydisk algebra with kernel function k(z,w) admits a unique minimal dilation (actually an isometric co-extension) to the Hardy module over the polydisk if and only if S (-1)(z, w)k(z, w) is a positive kernel function, where S(z,w) is the Szego kernel for the polydisk. Moreover, we establish the equivalence of such a factorization of the kernel function and a positivity condition, defined using the hereditary functional calculus, which was introduced earlier by Athavale [8] and Ambrozie, Englis and Muller [2]. An explicit realization of the dilation space is given along with the isometric embedding of the module R in it. The proof works for a wider class of Hilbert modules in which the Hardy module is replaced by more general quasi-free Hilbert modules such as the classical spaces on the polydisk or the unit ball in a'', (m) . Some consequences of this more general result are then explored in the case of several natural function algebras.

Real-time monitoring of critical nodes with minimal number of Phasor Measurement Units

This paper presents a method for placement of Phasor Measurement Units, ensuring the monitoring of vulnerable buses which are obtained based on transient stability analysis of the overall system. Real-time monitoring of phase angles across different nodes, which indicates the proximity to instability, the very purpose will be well defined if the PMUs are placed at buses which are more vulnerable. The issue is to identify the key buses where the PMUs should be placed when the transient stability prediction is taken into account considering various disturbances. Integer Linear Programming technique with equality and inequality constraints is used to find out the optimal placement set with key buses identified from transient stability analysis. Results on IEEE-14 bus system are presented to illustrate the proposed approach.

Tight co-degree condition for perfect matchings in 4-graphs

We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.

Minimal residual method provides optimal regularization parameter for diffuse optical tomography

The inverse problem in the diffuse optical tomography is known to be nonlinear, ill-posed, and sometimes under-determined, requiring regularization to obtain meaningful results, with Tikhonov-type regularization being the most popular one. The choice of this regularization parameter dictates the reconstructed optical image quality and is typically chosen empirically or based on prior experience. An automated method for optimal selection of regularization parameter that is based on regularized minimal residual method (MRM) is proposed and is compared with the traditional generalized cross-validation method. The results obtained using numerical and gelatin phantom data indicate that the MRM-based method is capable of providing the optimal regularization parameter. (C) 2012 Society of Photo-Optical Instrumentation Engineers (SPIE). DOI: 10.1117/1.JBO.17.10.106015]

Leptonic minimal flavour violation in warped extra dimensions

Lepton mass hierarchies and lepton flavour violation are revisited in the framework of Randall-Sundrum models. Models with Dirac-type as well as Majorana-type neutrinos are considered. The five-dimensional c-parameters are fit to the charged lepton and neutrino masses and mixings using chi(2) minimization. Leptonic flavour violation is shown to be large in these cases. Schemes of minimal flavour violation are considered for the cases of an effective LLHH operator and Dirac neutrinos and are shown to significantly reduce the limits from lepton flavour violation.

Stability of Adult Emergence and Activity/Rest Rhythms in Fruit Flies Drosophila melanogaster under Semi-Natural Condition

Here we report the results of a study aimed at examining stability of adult emergence and activity/rest rhythms under seminatural conditions (henceforth SN), in four large outbred fruit fly Drosophila melanogaster populations, selected for emergence in a narrow window of time under laboratory (henceforth LAB) light/dark (LD) cycles. When assessed under LAB, selected flies display enhanced stability in terms of higher amplitude, synchrony and accuracy in emergence and activity rhythms compared to controls. The present study was conducted to assess whether such differences in stability between selected and control populations, persist under SN where several gradually changing time-cues are present in their strongest form. The study revealed that under SN, emergence waveform of selected flies was modified, with even more enhanced peak and narrower gate-width compared to those observed in the LAB and compared to control populations in SN. Furthermore, flies from selected populations continued to exhibit enhanced synchrony and accuracy in their emergence and activity rhythms under SN compared to controls. Further analysis of zeitgeber effects revealed that enhanced stability in the rhythmicity of selected flies under SN was primarily due to increased sensitivity to light because emergence and activity rhythms of selected flies were as stable as controls under temperature cycles. These results thus suggest that stability of circadian rhythms in fruit flies D. melanogaster, which evolved as a consequence of selection for emergence in a narrow window of time under weak zeitgeber condition of LAB, persists robustly in the face of day-to-day variations in cycling environmental factors of nature.

OTCYMIST: Otsu-Canny minimal spanning tree for born-digital images

Text segmentation and localization algorithms are proposed for the born-digital image dataset. Binarization and edge detection are separately carried out on the three colour planes of the image. Connected components (CC's) obtained from the binarized image are thresholded based on their area and aspect ratio. CC's which contain sufficient edge pixels are retained. A novel approach is presented, where the text components are represented as nodes of a graph. Nodes correspond to the centroids of the individual CC's. Long edges are broken from the minimum spanning tree of the graph. Pair wise height ratio is also used to remove likely non-text components. A new minimum spanning tree is created from the remaining nodes. Horizontal grouping is performed on the CC's to generate bounding boxes of text strings. Overlapping bounding boxes are removed using an overlap area threshold. Non-overlapping and minimally overlapping bounding boxes are used for text segmentation. Vertical splitting is applied to generate bounding boxes at the word level. The proposed method is applied on all the images of the test dataset and values of precision, recall and H-mean are obtained using different approaches.