arXiv subjects

Minmin Wang

Publications and source records attributed to Minmin Wang.

At least 37 records · Page 2Linked to original sources

arXiv2021

Soliton decomposition of the Box-Ball System

The Box-Ball System, shortly BBS, was introduced by Takahashi and Satsuma as a discrete counterpart of the KdV equation. Both systems exhibit solitons whose shape and speed are conserved after collision with other solitons. We introduce a slot decomposition of ball configurations, each component being an infinite vector describing the number of size $k$ solitons in each $k$-slot. The dynamics of the components is linear: the $k$-th component moves rigidly at speed $k$. Let $ζ$ be a translation invariant family of independent random vectors under a summability condition and $η$ the ball configuration with components $ζ$. We show that the law of $η$ is translation invariant and invariant for the BBS. This recipe allows us to construct a big family of invariant measures, including product measures and stationary Markov chains with ball density less than $\frac12$. We also show that starting BBS with an ergodic measure, the position of a tagged $k$-soliton at time $t$, divided by $t$ converges as $t\to\infty$ to an effective speed $v_k$. The vector of speeds satisfies a system of linear equations related with the Generalized Gibbs Ensemble of conservative laws.

math-ph↗

arXiv2020

$k$-cut model for the Brownian Continuum Random Tree

To model the destruction of a resilient network, Cai, Holmgren, Devroye and Skerman introduced the $k$-cut model on a random tree, as an extension to the classic problem of cutting down random trees. Berzunza, Cai and Holmgren later proved that the total number of cuts in the $k$-cut model to isolate the root of a Galton--Watson tree with a finite-variance offspring law and conditioned to have $n$ nodes, when divided by $n^{1-1/2k}$, converges in distribution to some random variable defined on the Brownian CRT. We provide here a direct construction of the limit random variable, relying upon the Aldous-Pitman fragmentation process and a deterministic time change.

math.PR↗

arXiv2020

Limits of multiplicative inhomogeneous random graphs and Lévy trees: The continuum graphs

Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the multiplicative coalescent (the Erdős--Rényi random graph, more generally the so-called rank-one inhomogeneous random graphs of various types, and the configuration model). At the discrete level, the construction relies on a new point of view on (discrete) inhomogeneous random graphs that involves an embedding into a Galton--Watson forest. The new representation allows us to demonstrate that a processus that was already present in the pionnering work of Aldous [Ann. Probab., vol.~25, pp.~812--854, 1997] and Aldous and Limic [Electron. J. Probab., vol.~3, pp.~1--59, 1998] about the multiplicative coalescent actually also (essentially) encodes the limiting metric: The discrete embedding of random graphs into a Galton--Watson forest is paralleled by an embedding of the encoding process into a Lévy process which is crucial in proving the very existence of the local time functionals on which the metric is based; it also yields a transparent approach to compactness and fractal dimensions of the continuous objects. In a companion paper, we show that the continuous Lévy graphs are indeed the scaling limit of inhomogeneous random graphs.

math.PR↗

arXiv2020

Limits of multiplicative inhomogeneous random graphs and Lévy trees: Limit theorems

We consider a natural model of inhomogeneous random graphs that extends the classical Erd\H os-Rényi graphs and shares a close connection with the multiplicative coalescence, as pointed out by Aldous [AOP 1997]. In this model, the vertices are assigned weights that govern their tendency to form edges. It is by looking at the asymptotic distributions of the masses (sum of the weights) of the connected components of these graphs that Aldous and Limic [EJP 1998] have identified the entrance boundary of the multiplicative coalescence, which is intimately related to the excursion lengths of certain Lévy-type processes. We, instead, look at the metric structure of these components and prove their Gromov-Hausdorff-Prokhorov convergence to a class of random compact measured metric spaces that have been introduced in a companion paper. Our asymptotic regimes relate directly to the general convergence condition appearing in the work of Aldous and Limic. Our techniques provide a unified approach for this general "critical" regime, and relies upon two key ingredients: an encoding of the graph by some Lévy process as well as an embedding of its connected components into Galton-Watson forests. This embedding transfers asymptotically into an embedding of the limit objects into a forest of Lévy trees, which allows us to give an explicit construction of the limit objects from the excursions of the Lévy-type process. The mains results combined with the ones in the other paper allow us to extend and complement several previous results that had been obtained via regime-specific proofs, for instance: the case of Erd\H os-Rényi random graphs obtained by Addario-Berry, Goldschmidt and B. [PTRF 2012], the asymptotic homogeneous case as studied by Bhamidi, Sen and Wang [PTRF 2017], or the power-law case as considered by Bhamidi, Sen and van der Hofstad [PTRF 2018].

math.PR↗

arXiv2017

Reversing the cut tree of the Brownian continuum random tree

Consider the Aldous--Pitman fragmentation process [Ann Probab, 26(4):1703--1726, 1998] of a Brownian continuum random tree ${\cal T}^{\mathrm{br}}$. The associated cut tree cut$({\cal T}^{\mathrm{br}})$, introduced by Bertoin and Miermont [Ann Appl Probab, 23:1469--1493, 2013], is defined in a measurable way from the fragmentation process, describing the genealogy of the fragmentation, and is itself distributed as a Brownian CRT. In this work, we introduce a shuffle transform, which can be considered as the reverse of the map taking ${\cal T}^{\mathrm{br}}$ to cut$({\cal T}^{\mathrm{br}})$.

math.PR↗

arXiv2017

Enhanced Dual-frequency Pattern Scheme Based on Spatial-temporal Fringes Method

One of the major challenges of employing a dual-frequency phase-shifting algorithm for phase retrieval is its sensitivity to noise. Yun et. al [H Yun, B Li, S Zhang. 2017] proposed a dual-frequency method based on the Fourier transform profilometry (FTP), yet the low frequency lobes are close to each other for accurate band-pass filtering. In light of this problem, a novel dual-frequency pattern based on the spatial-temporal fringes (STF) method is developed in this paper. Three fringe patterns with two different frequency are required. The low frequency phase is obtained from two low frequency fringe patterns by the STF method, so the signal lobes can be extracted accurately as they are far away from each other. The high frequency phase is retrieved from another fringe pattern without the impact of the DC component. Simulations and experiments are conducted to demonstrate the excellent precision of the proposed method.

physics.ins-det↗

arXiv2017

Extended Depth-range Dual-wavelength Interferometry Based on Iterative Two-step Temporal Phase-unwrapping

Phase retrieval is one of the most challenging processes in many interferometry techniques. To promote the phase retrieval, Xu et. al [X. Xu, Y. Wang, Y. Xu, W. Jin. 2016] proposed a method based on dual-wavelength interferometry. However, the phase-difference brings large noise due to its low sensitivity and signal-to-noise ratio (SNR). Beside, special phase shifts are required in Xu's method. In the light of these problems, an extended depth-range dual-wavelength phase-shifting interferometry is proposed. Firstly, the least squares algorithm is utilized to retrieve the single-wavelength phase from a sequence of N-frame simultaneous phase-shifting dual-wavelength interferograms (SPSDWI) with random phase shifts. Then the phase-difference and phase-sum are calculated from the wrapped phases of single wavelength, and the iterative two-step temporal phase-unwrapping is introduced to unwrap the phase-sum, which can extend the depth-range and improve the sensitivity. Finally, the height of objects is achieved. Simulated experiments are conducted to demonstrate the superb precision and overall performance of the proposed method.

physics.ins-det↗

arXiv2017

Robust Wrapping-free Phase Retrieval Method Based on Weighted Least-square Method

For many profilometry techniques, phase unwrapping is one of the most challenging process. In order to sidestep the phase unwrapping process, Perciante et. al [Appl Opt 2015; 54(10):3018-23] proposed a wrapping-free method based on the direct integration of the spatial derivatives of the patterns to retrieve the phase. But it is only applicable for the case of the phase continuity for the tested object, which means it may fail to handle fringe patterns containing complicated singularities, such as noise, shadow, shears and surface discontinuity. In view of this problems, a robust wrapping-free phase retrieval method is proposed in this paper, which is based on combined Perciante's method and weighted least-squares method. Two partial derivatives of the desired phase is obtained from the fringe patterns, meanwhile the carrier is eliminated using direct phase difference method. The phase singularities are determined using derivative variance correlation map (DVCM), and the weighting coefficient is obtained from the binary mask of the reverse DVCM. Simulations and experiments are conducted to prove the validity of the proposed method. Results are analyzed and compared with those of Perciante's method, demonstrating that the proposed method can be available for measuring objects with some kinds of singularities sources.

physics.data-an↗

arXiv2016

Precise and Fast Phase Wraps Reduction in Fringe Projection Profilometry

The number of phase wraps in 2D wrapped phase map can be completely eliminated, or greatly reduced by frequency shifting. But the wraps usually cannot be optimally reduced using the conventional fast Fourier transform (FFT) because the spectrum can be shifted only by an integer number in the frequency domain. In order to completely eliminate the phase wraps or achieve a significant phase wrap reduction, in this paper, we propose a fast and precise two-step method for phase wraps reduction, which uses the iterative local discrete Fourier transform (DFT) to determine the sub-pixel spectral peak location and the frequency shifting algorithm that operates in spatial domain to reduce the number of phase wraps. Firstly, an initial estimate of the frequency peak is obtain by FFT, then the sub-pixel spectral peak with high resolution is determined by iteratively upsampling the local DFT around the initial spectral peak location, further the non-integer frequency shifting in spatial domain is realized to eliminate or reduce the number of phase wraps. Finally, simulations and experiments are conducted to prove the validity of the proposed method. The results demonstrate the proposed method's superb computing efficiency, high resolution and overall performance.

physics.ins-det↗

arXiv2016

Improved phase-unwrapping method using geometric constraints

Conventional dual-frequency fringe projection algorithm often suffers from phase unwrapping failure when the frequency ratio between the high frequency and the low one is too large. Zhang et.al. proposed an enhanced two-frequency phase-shifting method to use geometric constraints of digital fringe projection(DFP) to reduce the noise impact due to the large frequency ratio. However, this method needs to calibrate the DFP system and calculate the minimum phase map at the nearest position from the camera perspective, these procedures are are relatively complex and more time-cosuming. In this paper, we proposed an improved method, which eliminates the system calibration and determination in Zhang's method,meanwhile does not need to use the low frequency fringe pattern. In the proposed method,we only need a set of high frequency fringe patterns to measure the object after the high frequency is directly estimated by the experiment. Thus the proposed method can simplify the procedure and improve the speed. Finally, the experimental evaluation is conducted to prove the validity of the proposed method.The results demonstrate that the proposed method can overcome the main disadvantages encountered by Zhang's method.

cs.CV↗

arXiv2016

Scaling limits for a family of unrooted trees

We introduce weights on the unrooted unlabelled plane trees as follows: let $μ$ be a probability measure on the set of nonnegative integers whose mean is no larger than $1$; then the $μ$-weight of a plane tree $t$ is defined as $Π\, μ(degree (v) -1)$, where the product is over the set of vertices $v$ of $t$. We study the random plane tree with a fixed diameter $p$ sampled according to probabilities proportional to these $μ$-weights and we prove that, under the assumption that the sequence of laws $μ_p$, $p\! \geq \! 1$, belongs to the domain of attraction of an infinitely divisible law, the scaling limits of such random plane trees are random compact real trees called the unrooted Levy trees, which have been introduced in Duquense & Wang.

math.PR↗

arXiv2016

Comment on "Dual-wavelength in-line phase-shifting interferometry based on two dc-term-suppressed intensities with a special phase shift for quantitative phase extraction"

We comment on the recent Letter by Xu and Wang et al. [Opt. Lett. 41, 2430 (2016)] in which an approach of quantitative phase extraction in dual-wavelength in-line phase-shifting interferometry (DWILPSI) was proposed. It is noted that a special phase shift is used, which more or less embarrasses its practical operation. We wish to show that the same result can also be reached by combining the generalized phase-shifting algorithm and the least-square algorithm, in which the phase shift can be chosen randomly. In addition to maintaining high accuracy and rapid processing speed of the DWILPSI method, the proposed method greatly facilitates its application in actual measurement.

physics.optics↗

arXiv2016

Enhanced high dynamic range 3D shape measurement based on generalized phase-shifting algorithm

It is a challenge for Phase Measurement Profilometry (PMP) to measure objects with a large range of reflectivity variation across the surface. Saturated or dark pixels in the deformed fringe patterns captured by the camera will lead to phase fluctuations and errors. Jiang et al. proposed a high dynamic range real-time 3D shape measurement method without changing camera exposures. Three inverted phase-shifted fringe patterns are used to complement three regular phase-shifted fringe patterns for phase retrieval when any of the regular fringe patterns are saturated. But Jiang's method still has some drawbacks: (1) The phases in saturated pixels are respectively estimated by different formulas for different cases. It is shortage of an universal formula; (2) it cannot be extended to four-step phase-shifting algorithm because inverted fringe patterns are the repetition of regular fringe patterns; (3) only three unsaturated intensity values at every pixel of fringe patterns are chosen for phase demodulation, lying idle the other unsaturated ones. We proposed a method for enhanced high dynamic range 3D shape measurement based on generalized phase-shifting algorithm, which combines the complementary technique of inverted and regular fringe patterns with generalized phase-shifting algorithm. Firstly, two sets of complementary phase-shifted fringe patterns, namely regular and inverted fringe patterns are projected and collected. Then all unsaturated intensity values at the same camera pixel from two sets of fringe patterns are selected, and employed to retrieve the phase by generalized phase-shifting algorithm. Finally, simulations and experiments are conducted to prove the validity of the proposed method. The results are analyzed and compared with Jiang's method, which demonstrate that the proposed method not only expands the scope of Jiang's method, but also improves the measurement accuracy.

cs.CV↗

arXiv2016

One shot profilometry using iterative two-step temporal phase-unwrapping

This paper reviews two techniques that have been recently published for 3D profilometry and proposes one shot profilometry using iterative two-step temporal phase-unwrapping by combining the composite fringe projection and the iterative two-step temporal phase unwrapping algorithm. In temporal phase unwrapping, many images with different frequency fringe pattern are needed to project which would take much time. In order to solve this problem, Ochoa proposed a phase unwrapping algorithm based on phase partitions using a composite fringe, which only needs projecting one composite fringe pattern with four kinds of frequency information to complete the process of 3D profilometry. However, we found that the fringe order determined through the construction of phase partitions tended to be imprecise. Recently, we proposed an iterative two-step temporal phase unwrapping algorithm, which can achieve high sensitivity and high precision shape measurement. But it needs multiple frames of fringe images which would take much time. In order to take into account both the speed and accuracy of 3D shape measurement, we get a new, and more accurate unwrapping method based on composite fringe pattern by combining these two techniques. This method not only retains the speed advantage of Ochoa's algorithm, but also greatly improves its measurement accuracy. Finally, the experimental evaluation is conducted to prove the validity of the proposed method, and the experimental results show that this method is feasible.

physics.ins-det↗

arXiv2016

An algorithm to increase the residues of wrapped-phase in spatial domain

In phase unwrapping, the locations and densities of residues are indicative of the severity of the unwrapping problem. The residues are used to detect and evade inconsistent phase areas. Gdeisat et al. proposed an algorithm to increase the number of residues in a wrapped-phase map to improve the results of phase unwrapping. But this method will take much time to make the Fourier transform, inverse Fourier transform, select and shift the spectral components, and there is no theoretical analysis on why the frequency shift can increase the number of residues. In view of the above problems, we proposed an algorithm to increase the number of residues in a wrapped-phase map, which only uses a simple multiply operation in spatial domain to realize frequency shift by taking advantage of the frequency shift property of Fourier transform. Besides that, we discuss the relationship between the number of residues and frequency shift. Finally, the experimental evaluation is conducted to prove the validity of the proposed method. Experimental results demonstrated that the proposed method can speed up more than 50%.

physics.ins-det↗

arXiv2016

Improved method for phase wraps reduction in profilometry

In order to completely eliminate, or greatly reduce the number of phase wraps in 2D wrapped phase map, Gdeisat et al. proposed an algorithm, which uses shifting the spectrum towards the origin. But the spectrum can be shifted only by an integer number, meaning that the phase wraps reduction is often not optimal. In addition, Gdeisat's method will take much time to make the Fourier transform, inverse Fourier transform, select and shift the spectral components. In view of the above problems, we proposed an improved method for phase wraps elimination or reduction. First, the wrapped phase map is padded with zeros, the carrier frequency of the projected fringe is determined by high resolution, which can be used as the moving distance of the spectrum. And then realize frequency shift in spatial domain. So it not only can enable the spectrum to be shifted by a rational number when the carrier frequency is not an integer number, but also reduce the execution time. Finally, the experimental results demonstrated that the proposed method is feasible.

physics.ins-det↗

arXiv2015

Height and diameter of brownian tree

By computations on generating functions, Szekeres proved in 1983 that the law of the diameter of a uniformly distributed rooted labelled tree with n vertices, rescaled by a factor n^{1/2} , converges to a distribution whose density is explicit. Aldous observed in 1991 that this limiting distribution is the law of the diameter of the Brownian tree. In our article, we provide a computation of this law which is directly based on the normalized Brownian excursion. Moreover, we provide an explicit formula for the joint law of the height and diameter of the Brownian tree, which is a new result.

math.PR↗

arXiv2015

Decomposition of Levy trees along their diameter

We study the diameter of L{é}vy trees that are random compact metric spaces obtained as the scaling limits of Galton-Watson trees. L{é}vy trees have been introduced by Le Gall and Le Jan (1998) and they generalise Aldous' Continuum Random Tree (1991) that corresponds to the Brownian case. We first characterize the law of the diameter of L{é}vy trees and we prove that it is realized by a unique pair of points. We prove that the law of L{é}vy trees conditioned to have a fixed diameter r $\in$ (0, $\infty$) is obtained by glueing at their respective roots two independent size-biased L{é}vy trees conditioned to have height r/2 and then by uniformly re-rooting the resulting tree; we also describe by a Poisson point measure the law of the subtrees that are grafted on the diameter. As an application of this decomposition of L{é}vy trees according to their diameter, we characterize the joint law of the height and the diameter of stable L{é}vy trees conditioned by their total mass; we also provide asymptotic expansions of the law of the height and of the diameter of such normalised stable trees, which generalises the identity due to Szekeres (1983) in the Brownian case.

math.PR↗