DSHL generates music using segment concatenation and hash learning.
problem Music generation using deep learning.
method Deep recurrent neural network and ranking-based hash learning.
result DSHL generates original and enjoyable music.
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
48 results for “segment concatenation”
Overcoming the Curse of Sentence Length for Neural Machine Translation using Automatic Segmentationcs.CL
The authors of (Cho et al., 2014a) have shown that the recently introduced neural network translation systems suffer from a significant drop in translation quality when translating long sentences, unlike existing phrase-based translation systems. In this paper, we propose a way to address this issue by automatically se…
Improves instance segmentation accuracy by integrating low-level features.
problem Low-level features enhance instance localization accuracy.
method Integrates low-level features into all layers of a feature pyramid network.
result Consistent improvement in precision on COCO Dataset.
Proposes MorphMine for unsupervised morpheme segmentation to improve word embeddings.
problem Lack of semantic information in word-level analysis for infrequent and out-of-vocabulary words.
method MorphMine applies a parsimony criterion to hierarchically segment words into the fewest number of morphemes.
result MorphMine segments words into human-verified morphemes and improves word embedding quality.
NuClick uses clicks inside nuclei to improve nuclear segmentation.
problem Lack of efficient tools for nuclear segmentation due to labor-intensive annotation.
method Convolutional neural network framework that uses single point clicks for nuclei segmentation.
result NuClick generates superior segmentation results and facilitates more annotations.
TuNet improves glioma segmentation accuracy and efficiency.
problem Accurate and efficient glioma segmentation for early treatment.
method End-to-end cascaded network with hierarchical structure and ResNet-like blocks.
result Improved segmentation accuracy and reduced treatment costs.
Adapts CNN for robust medical image segmentation across different scanners and protocols.
problem Performance degradation of CNNs in medical image segmentation due to mismatch between training and test images.
method Designs a segmentation CNN as a concatenation of a shallow normalization CNN and a deep CNN. At test time, adapts the normalization sub-network for each test image using a denoising autoencoder.
result Consistently improves performance on multi-center MRI datasets of brain, heart, and prostate.
Optical flow enhances semantic segmentation for automated driving.
problem Improving semantic segmentation for automated driving systems.
method Constructed four architectures using RGB, flow, RGBF, and two-stream RGB + flow.
result Two-stream architecture achieves best results with 4% IoU improvement.
New technique stabilizes singular values in concatenated matrices.
problem How singular values of concatenated matrices relate to individual components.
method Developed perturbation technique extending classical results to concatenated matrices.
result Dominant singular values remain stable under small perturbations in submatrices.
FCMSC combines multi-view data through feature concatenation for improved clustering.
problem Clustering multi-view data with diverse and sometimes incompatible views.
method FCMSC concatenates multi-view data, integrates -norm, and uses graph regularization to explore consensus and complementary information.
result FCMSC outperforms state-of-the-art multi-view clustering methods on six real-world datasets.
i-DenseNets improve parameter efficiency and performance in density estimation.
problem Improving parameter efficiency and performance in density estimation models.
method Invertible Dense Networks (i-DenseNets) with learnable weighted concatenation and Concatenated LipSwish activation function.
result i-DenseNets outperform Residual Flows and other flow-based models in bits per dimension.
New projectively equivalent Finsler manifolds without derivatives found.
problem Finding new Finsler manifolds without derivatives.
method Presented a family of projectively equivalent -Finsler manifolds without derivatives.
result Found unique minimizing paths and properties of the manifolds.
This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent class analysis in which the observation space is subdivided and each aspect of the original space is represented by a separate latent class mod…
Nowadays, hyperspectral image classification widely copes with spatial information to improve accuracy. One of the most popular way to integrate such information is to extract hierarchical features from a multiscale segmentation. In the classification context, the extracted features are commonly concatenated into a lon…
Invertible DenseNetscs.LG
Invertible DenseNets improve model efficiency and performance.
problem Improving model efficiency and performance in neural networks.
method Enforcing invertibility in DenseNets by satisfying the Lipschitz constraint and proposing a learnable concatenation.
result i-DenseNets outperform Residual Flows in negative log-likelihood on various datasets.
Enhanced ODT with Feature Concatenation boosts learning efficiency.
problem Insufficient learning efficiency of ODT due to linear projections not being transmitted to child nodes.
method Feature Concatenation ( exttt{FC-ODT}) to transmit linear projections along decision paths.
result Experiments show exttt{FC-ODT} outperforms state-of-the-art decision trees with a limited tree depth.
Deep learning model improves corporate distress prediction using text data.
problem Predicting corporate distress using only financial data is insufficient.
method Convolutional recurrent neural network trained on auditors' and managers' reports.
result Unstructured textual data significantly enhances distress prediction, especially for large firms.
The paper proposes a new algorithm to estimate personalized treatment effects.
problem Estimating personalized heterogeneous treatment effects.
method Concatenation and augmentation of feature vectors, outcome regression function construction.
result The proposed algorithm outperforms T-learner and X-learner in various simulation experiments.
Adding supplementary axes improves neural network learnability and accuracy.
problem Overfitting and computational cost in deep neural networks.
method Analysis of a simple MLP model and comparison with and without supplementary information.
result Neural networks with supplementary axes show more robust and accurate training results.
Spatial Pyramid Encoding with Convex Length Normalization for Text-Independent Speaker Verificationeess.AS
Proposes SPE for robust speaker verification.
problem Improving text-independent speaker verification accuracy.
method Spatial pyramid encoding and deep length normalization.
result Proposed system outperforms i-vector and d-vector baselines.
The paper computes a knot's Kauffman bracket polynomial using recursive concatenation of a 4-tangle shadow.
problem Computing the Kauffman bracket polynomial for complex knots.
method Recursive concatenation of a 4-tangle shadow, followed by a closure operation and polynomial computation.
result A method to compute the Kauffman bracket polynomial for knots formed from 4-tangle shadows.
The GANs are generative models whose random samples realistically reflect natural images. It also can generate samples with specific attributes by concatenating a condition vector into the input, yet research on this field is not well studied. We propose novel methods of conditioning generative adversarial networks (GA…
Paper introduces multi-scale methods to improve CATE estimation from EO data.
problem Challenges in balancing fine-grained and contextual information in EO-based causal inference.
method Multi-Scale Representation Concatenation, combining Vision Transformer and Causal Forests.
result Multi-scale approach captures effect heterogeneity better than single-scale models.
MCN improves deep neural networks by bettering local minima and generalizing well.
problem Bad local minima and poor generalization in deep neural networks.
method Introducing Maximum-and-Concatenation Networks (MCN) to eliminate bad local minima and improve generalization.
result MCN can autonomously improve local minima's goodness by increasing network depth.
Polynomial fusion layer improves speech-driven facial animation.
problem Recent facial synthesis relies on low-dimensional representations and concatenation, ignoring higher-order interactions.
method Proposes a polynomial fusion layer to model higher-order interactions of facial encodings.
result Demonstrates improved video quality, audiovisual synchronisation, and blink generation.
There are a multitude of methods to perform multi-set correlated component analysis (MCCA), including some that require iterative solutions. The methods differ on the criterion they optimize and the constraints placed on the solutions. This note focuses perhaps on the simplest version, which can be solved in a single s…
New unsupervised speaker adaptation method for speech synthesis.
problem Adapting speech synthesis to new speakers with minimal data.
method Concatenating audio and text inputs, proposing new training schemes.
result Improves adaptation to unseen speakers and multi-speaker modeling.
Two new methods improve coherence modeling without complex machine translation.
problem Improving neural coherence modeling for better sentence ordering.
method Two novel methods combining regression and context concatenation.
result Achieves state-of-the-art Kendall-tau and positional accuracy scores.
This paper extends the construction of invariants for virtual knots to virtual long knots and introduces two new invariant modules of virtual long knots. Several interesting features are described that distinguish virtual long knots from their classical counterparts with respect to their symmetries and the concatenatio…
Paper uses virtual big data to improve autoencoder training and address imbalanced data classification.
problem Imbalanced data classification and autoencoder over-fitting.
method Cross-concatenation using Virtual Big Data.
result Cross-concatenation method effectively balances imbalanced class distributions.
DeepMRSeg: A convolutional deep neural network for anatomy and abnormality segmentation on MR imageseess.IV
DeepMRSeg uses deep learning for brain tissue segmentation.
problem Automated segmentation of brain tissues and abnormalities.
method Modified UNet architecture with multi-scale feature extraction.
result DeepMRSeg achieves high accuracy on various brain segmentation tasks.
Segmental structure is a common pattern in many types of sequences such as phrases in human languages. In this paper, we present a probabilistic model for sequences via their segmentations. The probability of a segmented sequence is calculated as the product of the probabilities of all its segments, where each segment …
Bayesian nonparametric method segments multi-sequence time series data.
problem Temporal segmentation of multi-sequence time series data into stationary segments.
method Gaussian process priors and nonparametric distribution for segment partitioning.
result Model effectively segments synthetic and real-time series data.
Embeddings of lab test codes improve mortality prediction and preserve ordinality.
problem Improving mortality prediction using lab test embeddings.
method Training embeddings for LOINC codes and their concatenations with abnormality symbols, evaluating performance on mortality prediction tasks.
result Embeddings of lab test codes improve mortality prediction and preserve ordinality.
Proposes guided networks for fast, accurate few-shot segmentation.
problem Few supervision limits learning-based segmentation methods.
method Extracts latent task representation from supervision, optimizes end-to-end.
result First results for segmentation from one pixel per concept, real-time interactive video segmentation.
BiPE blends intra-segment and inter-segment encodings for better length extrapolation.
problem Improving length extrapolation in language models.
method Bilevel Positional Encoding (BiPE) that separates intra-segment and inter-segment encodings.
result BiPE enhances length extrapolation across various text modalities.
CNNs can be trained with clinically available segmentations for OARs in radiotherapy.
problem Lack of dedicated training volumes for CNNs in radiotherapy.
method Used clinically available segmentations from PACS, applied multi-label segmentation, empirically assessed training set size.
result Clinically available segmentations can be used to train an accurate OAR segmentation model.
Novel framework provides statistical significance for image segmentation results.
problem Evaluating the reliability of individual image segmentation results.
method Selective inference to account for segmentation bias in p-value computation.
result Valid p-values for segmentation results, accounting for bias.
We develop a method to describe laws of random surfaces using surface holonomy.
problem Describing laws of random surfaces with structure.
method Introduce surface holonomy and develop expected surface developments.
result Expected surface development provides a structured description of random surface laws.
The classical theorem of Fáry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of Fáry's theorem to surfaces equipped with Riemannian metrics. In this setting, we require that every edge is drawn as a shortest pa…
QANet estimates image segmentation quality without human inspection.
problem Quantitative evaluation of image segmentation quality.
method QANet is a Quality Assurance Network that solves a regression problem to estimate quality measures.
result QANet accurately estimates segmentation quality with respect to ground truth.
Reducing the Hausdorff Distance in Medical Image Segmentation with Convolutional Neural Networkseess.IV
Paper reduces Hausdorff Distance in medical image segmentation.
problem Reduction of Hausdorff Distance in medical image segmentation.
method Three novel loss functions for training CNNs to estimate and reduce HD.
result Approximately 18-45% reduction in HD without degrading other performance metrics.
Develops deep learning for logical code segmentation.
problem Lack of logically segmented source code.
method Novel deep learning approach to generate logical code segments.
result Improves software analysis tasks like commenting, bug detection, and code synthesis.
A framework uses complex networks for image segmentation.
problem Over-segmentation in image segmentation.
method Initial segmentation, adaptive network construction, community detection.
result The proposed framework improves segmentation performance.
Hybrid CNN improves segmentation and registration of white matter tracts.
problem Accurate analysis of longitudinal brain imaging data.
method A hybrid CNN integrating segmentation and registration into a single procedure.
result Hybrid CNN outperforms multistage pipelines in segmentation accuracy, consistency, and speed.
UNet++ improves medical image segmentation with deep supervision.
problem Improving accuracy in medical image segmentation.
method Nested U-Net architecture with deep supervision.
result UNet++ achieves significant improvements in IoU scores.
New CRF model segments music into chords with rich features.
problem Harmonic analysis of music segments.
method Semi-Markov Conditional Random Field (semi-CRF) with segment-level features.
result Semi-CRF model performs better than previous approaches.
DNA rearrangement processes recombine gene segments that are organized on the chromosome in a variety of ways. The segments can overlap, interleave or one may be a subsegment of another. We use directed graphs to represent segment organizations on a given locus where contigs containing rearranged segments represent ver…