Przemyslaw Musialski

Przemyslaw Musialski

Auto-generated profile, based on publicly available information

Przemyslaw Musialski

New Jersey Institute of Technology (NJIT), Newark, USA

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 January 2012 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
JLJi Liu
Ji Liu
PMPrzemyslaw Musialski
Przemyslaw Musialski
PWPeter Wonka
Peter Wonka
JYJieping Ye
Jieping Ye
In this paper, we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process or because the user manually identified unwanted outliers. Our algorithm works even with a small amount of samples and it can propagate structure to fill larger missing regions. Our methodology is built on recent studies about matrix completion using the matrix trace norm. The contribution of our paper is to extend the matrix case to the tensor case by proposing the first definition of the trace norm for tensors and then by building a working algorithm. First, we propose a definition for the tensor trace norm that generalizes the established definition of the matrix trace norm. Second, similarly to matrix completion, the tensor completion is formulated as a convex optimization problem. Unfortunately, the straightforward problem extension is significantly harder to solve than the matrix case because of the dependency among multiple constraints. To tackle this problem, we developed three algorithms: simple low rank tensor completion (SiLRTC), fast low rank tensor completion (FaLRTC), and high accuracy low rank tensor completion (HaLRTC). The SiLRTC algorithm is simple to implement and employs a relaxation technique to separate the dependant relationships and uses the block coordinate descent (BCD) method to achieve a globally optimal solution; the FaLRTC algorithm utilizes a smoothing scheme to transform the original nonsmooth problem into a smooth one and can be used to solve a general tensor trace norm minimization problem; the HaLRTC algorithm applies the alternating direction method of multipliers (ADMMs) to our problem. Our experiments show potential applications of our algorithms and the quantitative evaluation indicates that our methods are more accurate and robust than heuristic approaches. The efficiency comparison indicates that FaLTRC and HaLRTC are more efficient than SiLRTC and between FaLRTC and HaLRTC the former is more efficient to obtain a low accuracy solution and the latter is preferred if a high-accuracy solution is desired.

10 May 2013 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
PMP. Musialski
P. Musialski
PWP. Wonka
P. Wonka
DAD. G. Aliaga
D. G. Aliaga
MWMichael Wimmer
Michael Wimmer
LGL. van Gool
L. van Gool
WPW. Purgathofer
W. Purgathofer

27 July 2015 in ACM Transactions on Graphics
Verified
Journal Article
Open access
PMPrzemyslaw Musialski
Przemyslaw Musialski
TAThomas Auzinger
Thomas Auzinger
MBMichael Birsak
Michael Birsak
MWMichael Wimmer
Michael Wimmer
LKLeif Kobbelt
Leif Kobbelt
Given the 2-manifold surface of a 3d object, we propose a novel method for the computation of an offset surface with varying thickness such that the solid volume between the surface and its offset satisfies a set of prescribed constraints and at the same time minimizes a given objective functional. Since the constraints as well as the objective functional can easily be adjusted to specific application requirements, our method provides a flexible and powerful tool for shape optimization. We use manifold harmonics to derive a reduced-order formulation of the optimization problem, which guarantees a smooth offset surface and speeds up the computation independently from the input mesh resolution without affecting the quality of the result. The constrained optimization problem can be solved in a numerically robust manner with commodity solvers. Furthermore, the method allows simultaneously optimizing an inner and an outer offset in order to increase the degrees of freedom. We demonstrate our method in a number of examples where we control the physical mass properties of rigid objects for the purpose of 3d printing.

1 September 2009
Verified
Conference Paper
Closed access
JLJi Liu
Ji Liu
PMPrzemyslaw Musialski
Przemyslaw Musialski
PWPeter Wonka
Peter Wonka
JYJieping Ye
Jieping Ye
In this paper we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process, or because the user manually identified unwanted outliers. Our algorithm works even with a small amount of samples and it can propagate structure to fill larger missing regions. Our methodology is built on recent studies about matrix completion using the matrix trace norm. The contribution of our paper is to extend the matrix case to the tensor case by laying out the theoretical foundations and then by building a working algorithm. First, we propose a definition for the tensor trace norm, that generalizes the established definition of the matrix trace norm. Second, similar to matrix completion, the tensor completion is formulated as a convex optimization problem. Unfortunately, the straightforward problem extension is significantly harder to solve than the matrix case because of the dependency among multiple constraints. To tackle this problem, we employ a relaxation technique to separate the dependant relationships and use the block coordinate descent (BCD) method to achieve a globally optimal solution. Our experiments show potential applications of our algorithm and the quantitative evaluation indicates that our method is more accurate and robust than heuristic approaches.

11 July 2016 in ACM Transactions on Graphics
Verified
Journal Article
Open access
PMPrzemyslaw Musialski
Przemyslaw Musialski
CHChristian Hafner
Christian Hafner
FRFlorian Rist
Florian Rist
MBMichael Birsak
Michael Birsak
MWMichael Wimmer
Michael Wimmer
LKLeif Kobbelt
Leif Kobbelt
In this paper we present a novel method for non-linear shape optimization of 3d objects given by their surface representation. Our method takes advantage of the fact that various shape properties of interest give rise to underdetermined design spaces implying the existence of many good solutions. Our algorithm exploits this by performing iterative projections of the problem to local subspaces where it can be solved much more efficiently using standard numerical routines. We demonstrate how this approach can be utilized for various shape optimization tasks using different shape parameterizations. In particular, we show how to efficiently optimize natural frequencies, mass properties, as well as the structural yield strength of a solid body. Our method is flexible, easy to implement, and very fast.

1 May 2012 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
PMPrzemyslaw Musialski
Przemyslaw Musialski
MWMichael Wimmer
Michael Wimmer
PWPeter Wonka
Peter Wonka