scholarly journals Extraction of γn→πN observables from deuteron-target data

2018 ◽  
Vol 98 (4) ◽  
Author(s):  
Satoshi X. Nakamura
Keyword(s):  
Deuteron Target ◽  
Target Data

Model Development to Support Analysis of Acoustic Buried Target Data

2007 ◽  
Author(s):  
Raymond Lim
Keyword(s):  
Model Development ◽  
Target Data

An Electronic Method of Smoothing Target Data

1952 ◽  
Author(s):  
G. C. Winston
Keyword(s):  
Electronic Method ◽  
Target Data

scholarly journals Multiple target data-driven models to enable sustainable process manufacturing: An industrial bioprocess case study

2021 ◽  
Vol 296 ◽  
pp. 126242
Author(s):  
Oliver J. Fisher ◽  
Nicholas J. Watson ◽  
Laura Porcu ◽  
Darren Bacon ◽  
Martin Rigley ◽  
...  
Keyword(s):  
Data Driven ◽  
Multiple Target ◽  
Process Manufacturing ◽  
Target Data

scholarly journals A Stochastic Model for Block Segmentation of Images Based on the Quadtree and the Bayes Code for It

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 991
Author(s):  
Yuta Nakahara ◽  
Toshiyasu Matsushima
Keyword(s):  
Computational Cost ◽  
Block Size ◽  
Input Image ◽  
Generative Model ◽  
Image Size ◽  
Variable Block ◽  
General Data ◽  
The Difference ◽  
Segmentation Of Images ◽  
Target Data

In information theory, lossless compression of general data is based on an explicit assumption of a stochastic generative model on target data. However, in lossless image compression, researchers have mainly focused on the coding procedure that outputs the coded sequence from the input image, and the assumption of the stochastic generative model is implicit. In these studies, there is a difficulty in discussing the difference between the expected code length and the entropy of the stochastic generative model. We solve this difficulty for a class of images, in which they have non-stationarity among segments. In this paper, we propose a novel stochastic generative model of images by redefining the implicit stochastic generative model in a previous coding procedure. Our model is based on the quadtree so that it effectively represents the variable block size segmentation of images. Then, we construct the Bayes code optimal for the proposed stochastic generative model. It requires the summation of all possible quadtrees weighted by their posterior. In general, its computational cost increases exponentially for the image size. However, we introduce an efficient algorithm to calculate it in the polynomial order of the image size without loss of optimality. As a result, the derived algorithm has a better average coding rate than that of JBIG.

scholarly journals Towards pixel-to-pixel deep nucleus detection in microscopy images

2019 ◽  
Vol 20 (1) ◽  
Author(s):  
Fuyong Xing ◽  
Yuanpu Xie ◽  
Xiaoshuang Shi ◽  
Pingjun Chen ◽  
Zizhao Zhang ◽  
...  
Keyword(s):  
Neural Networks ◽  
Large Scale ◽  
Deep Neural Networks ◽  
Image Data ◽  
Fine Tuning ◽  
Cell Detection ◽  
Imaging Protocol ◽  
Microscopy Image ◽  
Microscopy Images ◽  
Target Data

Abstract Background Nucleus or cell detection is a fundamental task in microscopy image analysis and supports many other quantitative studies such as object counting, segmentation, tracking, etc. Deep neural networks are emerging as a powerful tool for biomedical image computing; in particular, convolutional neural networks have been widely applied to nucleus/cell detection in microscopy images. However, almost all models are tailored for specific datasets and their applicability to other microscopy image data remains unknown. Some existing studies casually learn and evaluate deep neural networks on multiple microscopy datasets, but there are still several critical, open questions to be addressed. Results We analyze the applicability of deep models specifically for nucleus detection across a wide variety of microscopy image data. More specifically, we present a fully convolutional network-based regression model and extensively evaluate it on large-scale digital pathology and microscopy image datasets, which consist of 23 organs (or cancer diseases) and come from multiple institutions. We demonstrate that for a specific target dataset, training with images from the same types of organs might be usually necessary for nucleus detection. Although the images can be visually similar due to the same staining technique and imaging protocol, deep models learned with images from different organs might not deliver desirable results and would require model fine-tuning to be on a par with those trained with target data. We also observe that training with a mixture of target and other/non-target data does not always mean a higher accuracy of nucleus detection, and it might require proper data manipulation during model training to achieve good performance. Conclusions We conduct a systematic case study on deep models for nucleus detection in a wide variety of microscopy images, aiming to address several important but previously understudied questions. We present and extensively evaluate an end-to-end, pixel-to-pixel fully convolutional regression network and report a few significant findings, some of which might have not been reported in previous studies. The model performance analysis and observations would be helpful to nucleus detection in microscopy images.

scholarly journals Shape Neutral Analysis of Graph-based Data-structures

2018 ◽  
Vol 18 (3-4) ◽  
pp. 470-483 ◽  
Author(s):  
GREGORY J. DUCK ◽  
JOXAN JAFFAR ◽  
ROLAND H. C. YAP
Keyword(s):  
Data Structure ◽  
Data Structures ◽  
Program Analysis ◽  
Constraint Handling ◽  
C Programs ◽  
Wide Range ◽  
Target Program ◽  
Target Data ◽  
Structure Graph ◽  
Structure Properties

AbstractMalformed data-structures can lead to runtime errors such as arbitrary memory access or corruption. Despite this, reasoning over data-structure properties for low-level heap manipulating programs remains challenging. In this paper we present a constraint-based program analysis that checks data-structure integrity, w.r.t. given target data-structure properties, as the heap is manipulated by the program. Our approach is to automatically generate a solver for properties using the type definitions from the target program. The generated solver is implemented using a Constraint Handling Rules (CHR) extension of built-in heap, integer and equality solvers. A key property of our program analysis is that the target data-structure properties are shape neutral, i.e., the analysis does not check for properties relating to a given data-structure graph shape, such as doubly-linked-lists versus trees. Nevertheless, the analysis can detect errors in a wide range of data-structure manipulating programs, including those that use lists, trees, DAGs, graphs, etc. We present an implementation that uses the Satisfiability Modulo Constraint Handling Rules (SMCHR) system. Experimental results show that our approach works well for real-world C programs.

scholarly journals Validation of Geant4 Hadronic Generators versus Thin Target Data

2011 ◽  
Vol 331 (3) ◽  
pp. 032034 ◽  
Author(s):  
S Banerjee ◽  
G Folger ◽  
A Ivanchenko ◽  
V N Ivanchenko ◽  
M Kossov ◽  
...  
Keyword(s):  
Thin Target ◽  
Target Data

VISUAL APPROACH TO SUPERVISED VARIABLE SELECTION BY SELF-ORGANIZING MAP

2005 ◽  
Vol 15 (01n02) ◽  
pp. 101-110 ◽  
Author(s):  
TIMO SIMILÄ ◽  
SAMPSA LAINE
Keyword(s):  
Variable Selection ◽  
The Self ◽  
Data Sets ◽  
Self Organizing Map ◽  
Robust Method ◽  
Relevant Variables ◽  
Visual Approach ◽  
Predefined Criterion ◽  
Target Data ◽  
Self Organizing

Practical data analysis often encounters data sets with both relevant and useless variables. Supervised variable selection is the task of selecting the relevant variables based on some predefined criterion. We propose a robust method for this task. The user manually selects a set of target variables and trains a Self-Organizing Map with these data. This sets a criterion to variable selection and is an illustrative description of the user's problem, even for multivariate target data. The user also defines another set of variables that are potentially related to the problem. Our method returns a subset of these variables, which best corresponds to the description provided by the Self-Organizing Map and, thus, agrees with the user's understanding about the problem. The method is conceptually simple and, based on experiments, allows an accessible approach to supervised variable selection.

Adiabatic Quantum Computing for Solving the Multi-Target Data Association Problem

2021 ◽  
Author(s):  
Felix Govaers ◽  
Veit Stoob ◽  
Martin Ulmke
Keyword(s):  
Quantum Computing ◽  
Data Association ◽  
Adiabatic Quantum Computing ◽  
Target Data
Sign in / Sign up

Export Citation Format

Share Document