Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

68136204272 · Jun 202019922001200920172026
48 results for object contour

FineFool attacks deep models by focusing on object contours, improving attack performance.

problem Adversarial attacks on deep learning models, especially those that focus on perturbation size and success rate.
method FineFool uses attention to focus on object contours, producing more efficient and imperceptible perturbations.
result FineFool achieves better attack performance compared to state-of-the-art attacks, including higher success rate and smaller perturbations.

Describing shapes by suitable measures in object segmentation, as proposed in [24], allows to combine the advantages of the representations as parametrized contours and indicator functions. The pseudo-Riemannian structure of optimal transport can be used to model shapes in ways similar as with contours, while the Kanto…

2013-09-09abs ↗pdf ↗

Study of curves and surfaces from single-direction projections.

problem Obtaining complete shape information from a single view.
method Theoretical study of differential geometric information from multiple orthogonal projections.
result Formulae for recovering certain information on curves or surfaces from their projections.

In this paper we consider planar sections and visual contours of co-dimension one affine immersions. The main theorem says that the third order Taylor expansion of the difference between the visual contour and planar section functions is exactly the cubic form. We also consider parameterizations on two dimensional affi…

2010-03-30abs ↗pdf ↗

Paper proposes a new Wasserstein distance for mixtures of radially contoured distributions.

problem Generalization of Wasserstein distance to non-elliptically contoured distributions.
method Relaxed formulation for mixtures of radially contoured distributions without marginal consistency.
result The new distance yields more stable error and better color distribution in image transfer tasks.

The paper studies curves in surfaces using flow-spines and apparent contours.

problem Understanding curves in arbitrary surfaces using flow-spines and apparent contours.
method By considering generic curves and their apparent contours relative to a traversing flow, the paper reconstructs curves and allows them to vary up to homotopy.
result A finite set of local moves on decorated graphs allows for the reconstruction and variation of curves within a fixed generic flow.

Deep convolutional neural networks have become a key element in the recent breakthrough of salient object detection. However, existing CNN-based methods are based on either patch-wise (region-wise) training and inference or fully convolutional networks. Methods in the former category are generally time-consuming due to…

2018-03-30abs ↗pdf ↗

IrisNet tracks tongue contours in ultrasound videos using deep learning.

problem Automatic and real-time tracking of tongue contours in ultrasound videos.
method Convolutional neural network mimicking peripheral vision.
result Outstanding generalization on various ultrasound tongue datasets.

The contour map of estimation error of Expected Shortfall (ES) is constructed. It allows one to quantitatively determine the sample size (the length of the time series) required by the optimization under ES of large institutional portfolios for a given size of the portfolio, at a given confidence level and a given esti…

2015-02-22abs ↗pdf ↗

We present a new implementation of anisotropic mean curvature flow for contour recognition. Our procedure couples the mean curvature flow of planar closed smooth curves, with an external field from a potential of point-wise charges. This coupling constrains the motion when the curve matches a picture placed as backgrou…

2018-03-10abs ↗pdf ↗

The paper finds surfaces closest to being flat that span a given contour.

problem Finding surfaces in R3\mathbb{R}^3 that are as flat as possible while spanning a given contour.
method The approach involves minimizing the total Gaussian curvature squared and solving a system of PDEs.
result The optimal surface is shown to be controlled by a biharmonic equation with specific boundary conditions.

New method uses contours of segmented images for X-ray classification.

problem Classifying X-ray images of segmented radiography.
method Develops a new approach for image analysis of multivariate planar curves, addressing alignment issues.
result Demonstrates the robustness and appeal of the proposed method through detection of cardiomegaly and numerical experiments.

Completeness of the eigenfunctions of a quantum mechanical system is crucial for its probability interpretation. By using the method of contour integral we give properly normalized eigenfunctions for both discrete and continuum spectrum of the Morse potential, and explicitly prove the completeness relation. As an appli…

2010-10-19abs ↗pdf ↗

Proposes a new network to improve nuclei segmentation in histopathology images.

problem Challenges in separating overlapped nuclei in histopathology images.
method Introduces a bending loss regularized network to minimize contour points with large curvatures.
result Outperforms six state-of-the-art approaches on five quantitative metrics.

Improved image learning using elliptically contoured tensor-variate distributions.

problem Inadequate statistical analysis for tensor-valued data, especially with heavier or lighter tails.
method Developed a family of elliptically contoured tensor-variate distributions and derived their properties and procedures for estimation.
result Tensor-variate classification rules and tensor-on-tensor regression better predict and characterize data than TVN-based methods.

New methods improve accuracy in predicting complex systems.

problem Improving accuracy in predicting complex physical systems from simulators.
method Proposes two new methods of design approaches that sequentially select input settings.
result Demonstrates effectiveness of the proposed methods through numerical examples.

The paper tightens bounds on distances between Reeb graphs.

problem Certifying quasi-universality of distances between Reeb graphs.
method Establishes tight bi-Lipschitz bounds for various distances.
result Proves strict universality of the functional contortion distance for contour trees and coincides with interleaving distance for merge trees.

Study improves tongue contour recognition in ultrasound images using transfer learning.

problem Difficulty in recognizing tongue gestures due to low-contrast and noisy ultrasound images.
method Transfer learning with U-net and fine-tuning on different ultrasound datasets.
result Fine-tuned U-net models perform well on images from different ultrasound devices.

It is proposed a new code for contours of plane images. This code was applied for optical character recognition of printed and handwritten characters. One can apply it to recognition of any visual images.

2012-12-04abs ↗pdf ↗

Wilson loops in N=4{\cal N}=4 supersymmetric Yang-Mills theory correspond at strong coupling to extremal surfaces in AdS5AdS_5. We study a class of extremal surfaces known as special Legendrian submanifolds. The "hemisphere" corresponding to the circular Wilson loop is an example of a special Legendrian submanifold, and w…

2002-11-24abs ↗pdf ↗

We consider a complex Plateau problem for strongly pseudoconvex contours in non Kähler manifolds. A positive solution in the case of manifolds carrying a pluriclosed Hermitian metric forms is given. For the general case we propose a conjecture.

1998-04-02abs ↗pdf ↗

Wavelet features improve image clustering and segmentation accuracy.

problem Noise and lack of spatial context in pixel intensity-based methods.
method Modified K-means, Fuzzy c-means, and ACWE algorithms incorporating Wavelet features.
result Wavelet-based algorithms converge to different segmentation results based on frequency information.

A new algorithm efficiently partitions images without seeds or thresholds.

problem Efficiently partitioning images without explicit seeds or thresholds.
method Mutex Watershed algorithm that incorporates both attractive and repulsive cues.
result Determines optimal segments without seeds or thresholds, solving NP-hard problem.

We determine the precise bifurcation diagrams of the apparent contours of generic crosscaps, which contain the information of bifurcations with respect to the images of the singular sets of crosscaps: crosscap points and double point curves. Especially, three different kinds of equivalences play key roles.

2018-05-23abs ↗pdf ↗

A new algorithm flattens multi-modal distributions for better deep learning.

problem Bayesian learning in big data with multi-modal distributions.
method Contour Stochastic Gradient Langevin Dynamics (CSGLD) algorithm.
result The CSGLD algorithm avoids local traps in deep neural networks.

Entropy-based GP adaptive design improves failure probability estimation.

problem Limited accuracy in failure probability estimation due to model evaluation costs.
method Entropy-based Gaussian process (GP) adaptive design combined with multifidelity importance sampling (MFIS).
result More accurate failure probability estimates and higher confidence.