Search · four archives
Search · four archives
22 papers · ranked by Valyu relevance
Nicolas Sauwen, Marjan Acou, Halandur N. Bharath, Diana M. Sima + 6 more
'Jelle Veraart' 'Frederik Maes' 'Uwe Himmelreich' 'Eric Achten' 'Sabine Van Huffel' 'Daniel Monleon'] Non-negative matrix factorization (NMF) has become a widely used tool for additive parts-based analysis in a wide range of applications. As NMF is a non-convex problem, the quality of the solution will depend on the…
Wen-Jun Zeng, Jieping Ye
Solving large-scale systems of nonlinear equations/inequalities is a fundamental problem in computing and optimization. In this paper, we propose a generic successive projection (SP) framework for this problem. The SP sequentially projects the current iterate onto the constraint set corresponding to each nonlinear…
Jiashun Jin, Zheng Tracy Ke, Gabriel Moryoussef, Jiajun Tang + 1 more
'Jingming Wang'] Given a K-vertex simplex in a d-dimensional space, suppose we measure n points on the simplex with noise (hence, some of the observed points fall outside the simplex). Vertex hunting is the problem of estimating the K vertices of the simplex. A popular vertex hunting algorithm is successive projection…
Nicolas Gillis
In this paper, we propose a new fast and robust recursive algorithm for near-separable nonnegative matrix factorization, a particular nonnegative blind source separation problem. This algorithm, which we refer to as the successive nonnegative projection algorithm (SNPA), is closely related to the popular successive…
Christophe Kervazo, Nicolas Gillis, Nicolas Dobigeon
— In this work, we tackle the problem of hyperspectral (HS) unmixing by departing from the usual linear model and focusing on a Linear-Quadratic (LQ) one. The proposed algorithm, referred to as Successive Nonnegative Projection Algorithm for Linear Quadratic mixtures (SNPALQ), extends the Successive Nonnegative…
Wenjie Mei, Andrew Maiden
Set projection algorithms play a critical role in the reconstruction process of ptychography, and their performance greatly affects the accuracy and quality of the final images. Different set projection algorithms combine and iterate between the projections onto constraint sets in different ways, generally, these…
Scott Penfold, Yair Censor
This is a review paper on some of the physics, modeling, and iterative algorithms in proton computed tomography (pCT) image reconstruction. The primary challenge in pCT image reconstruction lies in the degraded spatial resolution resulting from multiple Coulomb scattering within the imaged object. Analytical models…
Mariusz Pleszczyński, Robertas Damaševičius
Computer tomography has a wide field of applicability; however, most of its applications assume that the data, obtained from the scans of the examined object, satisfy the expectations regarding their amount and quality. Unfortunately, sometimes such expected data cannot be achieved. Then we deal with the incomplete set…
Meilian Xu, Parimala Thulasiraman
Algebraic reconstruction techniques require about half the number of projections as that of Fourier backprojection methods, which makes these methods safer in terms of required radiation dose. Algebraic reconstruction technique (ART) and its variant OS-SART (ordered subset simultaneous ART) are techniques that provide…
Jhoirene Clemente, Francis George C. Cabarle, Henry N. Adorna
Motif finding is one of the NP-complete problems in Computational Biology. Existing nondeterministic algorithms for motif finding do not guarantee the global optimality of results and are sensitive to initial parameters. To address this problem, the PROJECTION algorithm provides a good initial estimate that can be…
Claire Simpson, Evgeniy Tabatsky, Zainab Rahil, Devon J. Eddins + 11 more
Unsupervised clustering is a powerful machine-learning technique widely used to analyze high-dimensional biological data. It plays a crucial role in uncovering patterns, structure, and inherent relationships within complex datasets without relying on predefined labels. In the context of biology, high-dimensional data…
Yael Harpaz, Yoel Shkolnisky
A common task in cryo-electron microscopy data processing is to compare three-dimensional density maps of macromolecules. In this paper, we propose an algorithm for aligning three-dimensional density maps, which exploits common lines between projection images of the maps. The algorithm is fully automatic and handles…
Kaitlin M. Stouffer, Menno P. Witter, Daniel J. Tward, Michael I. Miller
Reconstructing dense 3D anatomical coordinates from 2D projective measurements has become a central problem in digital pathology for both animal models and human studies. We describe a new family of diffeomorphic mapping technologies called Projective LDDMM which generate diffeomorphic mappings of dense human MRI…
Paul Harrison
langevitour displays interactive animated 2D projections of high-dimensional datasets. Langevin Dynamics is used to produce a smooth path of projections. Projections are initially explored at random. A “guide” can be activated to look for an informative projection, or variables can be manually positioned. After a…
Liubov Flores, Vicent Vidal, Gumersindo Verdú, Li Zeng
In practical applications of computed tomography imaging (CT), it is often the case that the set of projection data is incomplete owing to the physical conditions of the data acquisition process. On the other hand, the high radiation dose imposed on patients is also undesired. These issues demand that high quality CT…
Eric Hermes, Khachik Sargsyan, Habib Najm, Judit Zádor
We present a new algorithm for the optimization of molecular structures to saddle points on the potential energy surface using a redundant internal coordinate system. This algorithm automates the procedure of defining the internal coordinate system, including the handling of linear bending angles, e.g. through the…
Christoph Jacob, Johannes Neugebauer
The past years since the publication of our review on subsystem density-functional theory (sDFT) [WIREs Comput. Mol. Sci. 2014, 4:325--362] have witnessed a rapid development and diversification of quantum mechanical fragmentation and embedding approaches related to sDFT and frozen-density embedding (FDE). In this…
A. Daneshi, H. Behnam, Z. Alizadeh Sani
In this paper, we propose a new temporal frame interpolation algorithm for frame rate up-conversion (FRUC) in echocardiography images. This algorithm employs a combination of dimension reduction techniques and image registration to increase frame rate. If the distance between two successive frames of a video be great…
Danny Salem, Anuradha Surendra, Graeme SV McDowell, Miroslava Čuperlović-Culf
Unsupervised data projection for the determination of trends in the data, visualization of multidimensional data in a reduced dimension space or feature space reduction through combination of data is a major step in data mining. Methods such as Principal Component Analysis or t-Distribution Stochastic Neighbor…
Miloš Antić, Andrej Zdešar, Igor Škrjanc, Changho Lee + 1 more
'Changhan Yoon'] This paper presents an approach of depth image segmentation based on the Evolving Principal Component Clustering (EPCC) method, which exploits data locality in an ordered data stream. The parameters of linear prototypes, which are used to describe different clusters, are estimated in a recursive…
Yuhui Zhang, Wenhong Wei, Zijia Wang, Heming Jia + 2 more
'Xuewen Xia'] Image reconstruction is an interesting yet challenging optimization problem that has several potential applications. The task is to reconstruct an image using a fixed number of transparent polygons. Traditional gradient-based algorithms cannot be applied to the problem since the optimization objective has…
Benjamin D. Redelings, Mark T. Holder
The Open Tree of Life (OToL) project produces a supertree that summarizes phylogenetic knowledge from tree estimates published in the primary literature. The supetree construction algorithm iteratively calls Aho’s Build algorithm thousands of times in order to assess the compatability of different phylogenetic…