A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Filters
Abstraction for Shape Analysis with Fast and Precise Transformers
[chapter]
2006
Lecture Notes in Computer Science
The overall number of successor abstract states can be exponential in V . A prototype of the algorithm was implemented and is shown to be fast. ...
We present a new abstraction for linked data structures whose underlying graphs do not contain cycles. ...
Acknowledgements We thank Noam Rinetzky and the anonymous CAV referees for many helpful comments. ...
doi:10.1007/11817963_49
fatcat:qqzj6lfccvfgpazoy4nnl4xlwu
Content Based CT Image Sign Retrieval using Fast Discrete Curvelet Transform and Deep Learning
2019
International Journal of Advanced Trends in Computer Science and Engineering
The Gray-Level Co-Occurrence Matrix (GLCM) is used to extract features and the extraction of feature is done by Fast Discrete Curvelet Transform (FDCT). ...
For lung cancer detection, the CAD system divided in four parts in CT images, such as noise removing process, segmentation of lung, detection of lung nodule and classification. ...
This paper proposed the Fast Discrete Curvelet Transform (FDCT) for efficient extraction of the feature. In image analysis, the gray level co-occurrence matrix (GLCM) features are used. ...
doi:10.30534/ijatcse/2019/80832019
fatcat:567pa4xstfbnhn2svw2tdmmkjq
Analyzing Emotional Semantics of Abstract Art Using Low-Level Image Features
[chapter]
2011
Lecture Notes in Computer Science
by machine using a variety of low-level image descriptors such as color, shape, and texture. ...
The abstract art dataset that we created for this work has been made downloadable to the public. ...
This work is supported by Information and Computer Science Department at Aalto University School of Science. We gratefully ...
doi:10.1007/978-3-642-24800-9_38
fatcat:p56clls5hbgaphsesyvydqtiki
Fast Points-to Analysis for Languages with Structured Types
[chapter]
2004
Lecture Notes in Computer Science
We present a points-to analysis, which is based on Steensgaard's approach to points-to analysis [12], but achieves a higher level of precision. 1 The address-taken analysis, e.g., which assumes that each ...
For many tools that operate on programs written in pointer languages like C, it is essential to have a good approximation of the information about where the pointer variables possibly may point to at runtime ...
This paper presents a new fast points-to analysis for languages with structured types. ...
doi:10.1007/978-3-540-30113-4_9
fatcat:2sma5mj6yvcv5joya5czrux7pu
Soft Adversarial Training Can Retain Natural Accuracy
[article]
2022
arXiv
pre-print
The focus of our work is to use abstract certification to extract a subset of inputs for (hence we call it 'soft') adversarial training. ...
Most suggest training with an adversarial version of the inputs, constantly moving away from the original distribution. ...
The authors in [5] , [19] , [18] and [17] have shown detailed analysis of box, zonotope and polytope regions with their We gratefully acknowledge the support from the advanced research computing ...
arXiv:2206.01904v1
fatcat:ow7hd2vicrfzpjv2akwzwfip2m
Classification of Chitinozoa (Llandoverian, Canada) Using Image Analysis
1996
Microscopy Microanalysis Microstructures
The boundary of each fossil was then traced by a vector centred at the centroid for Fast Fourier Transform (FFT). ...
Abstract. 2014 Chitinozoa (Llandoverian, Canada) were studied using image analysis. After digitalization of the objects, shape parameters were calculated. ...
Two anonymous reviewers are acknowledged for their constructive comments on the manuscript. ...
doi:10.1051/mmm:1996145
fatcat:6tiouuc54ffzpnkttfpwrp4jze
Description logics for shape analysis
2005
Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05)
We study well-known description logics as a framework for symbolic shape analysis. ...
We propose a predicate abstraction based shape analysis, parameterized by description logics to represent the abstraction predicates. ...
We thank Thomas Wies and the anonymous referees for discussions and suggestions. ...
doi:10.1109/sefm.2005.16
dblp:conf/sefm/GeorgievaM05
fatcat:cknrexgnlbdenob23hzjvchxjq
Cache analysis in presence of pointer-based data structures
2011
ACM SIGBED Review
The proposed analysis achieves precision by augmenting its abstract cache states with information about the structure of the program's allocated objects as well as a short term access history of these ...
This additional information is derived from an adapted shape analysis that serves as an pre-analysis phase to our actual cache analysis. ...
In summary, the main contribution of this work is the combination of shape analysis with traditional cache analysis to increase the precision of the latter. ...
doi:10.1145/2038617.2038618
fatcat:vlmx2vvjsbc5dkzucaq47jjwrq
Using Disjoint Reachability for Parallelization
[chapter]
2011
Lecture Notes in Computer Science
We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. ...
Our evaluation shows the analysis results are sufficiently precise to parallelize our benchmarks and achieve an average speedup of 16.9×. ...
Acknowledgements This research was supported by the National Science Foundation under grants CCF-0846195 and CCF-0725350. We thank Mark Marron and the reviewers for feedback. ...
doi:10.1007/978-3-642-19861-8_12
fatcat:3pw6t5vidrd65dmwjnkzjff7qi
A MASK-RCNN Based Approach Using Scale Invariant Feature Transform Key points for Object Detection from Uniform Background Scene
2019
Advances In Image and Video Processing
A key benefit of feature based Mask-RCNN approach is high precision (~94%) in classification and minimized feature points with SIFT key points. ...
The model is retrained to perform the detection of four types of metal objects, with the entire process of annotation and training for the new model per solid block. ...
Conclusion MASK-RCNN design approach [5] along with big data has made significant contribution for object classification and detection with good precision and accuracy. ...
doi:10.14738/aivp.75.6946
fatcat:or7yldka4raebgocxha2maprcy
Content-Based 3D Object Retrieval
2007
IEEE Computer Graphics and Applications
3D objects are an important multimedia data type with many applications in domains such as Computer Aided Design, Simulation, Visualization, and Entertainment. ...
We address the basic concepts for extraction of 3D object descriptors which in turn can be used for searching and indexing. ...
KE 740/6-1/8-1 and SA 449/10-1 within the strategic research initiative on "Distributed Processing and Delivery of Digital Documents" (V 3 D 2 ). ...
doi:10.1109/mcg.2007.80
pmid:17713231
fatcat:ntnosmtadzbu3bc5zukjg22uui
PtrTracker: Pragmatic pointer analysis
2013
2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)
We explain the underlying ideas and that it lends itself to a fast, modular and incremental analysis, features that are essential for large code bases. ...
speed and precision are important, but soundness (no missed bugs) and completeness (no false positives) do not necessarily need to be guaranteed. ...
In our case, we want to integrate in the tool Goanna [4] , a state-of-the-art bug finding tool for C/C++ which yet lacks a fast and precise pointer analysis module. ...
doi:10.1109/scam.2013.6648186
dblp:conf/scam/BiallasOCH13
fatcat:mk2schdbkzf3lf7usddofcduea
Sound Numerical Computations in Abstract Acceleration
[chapter]
2017
Lecture Notes in Computer Science
We propose the use of numerical floating-point computations to improve performance combined with an interval analysis to ensure soundness in reach-set computations for numerical dynamical models. ...
Our theory is implemented in a numerical algorithm for Abstract Acceleration in a tool called Axelerator. ...
The benchmarks have been first run using unsound standard long double precision and multiple precision arithmetic with the required precision for the problem to be solved correctly (i.e., the precision ...
doi:10.1007/978-3-319-63501-9_4
fatcat:24ygxhmt2jfz5lkbcj2563sqrm
Fast nonrigid 3D retrieval using modal space transform
2013
Proceedings of the 3rd ACM conference on International conference on multimedia retrieval - ICMR '13
Our method is fast, isometry-invariant, discriminative, and numerically stable with respect to multiple types of perturbations. ...
Our approach constructs a context-aware integral kernel operator on a manifold, then applies modal analysis to map this operator into a low-frequency functional representation, called fast functional transform ...
Acknowledgments The authors would like to thank anonymous reviewers for their comments and suggestions. ...
doi:10.1145/2461466.2461488
dblp:conf/mir/YeYY13
fatcat:o7pdcwxifrgctp6zno7ntplmai
Font Shape-to-Impression Translation
[article]
2022
arXiv
pre-print
The versatility of Transformer allows us to realize two very different approaches for the analysis, i.e., multi-label classification and translation. ...
This paper tackles part-based shape-impression analysis based on the Transformer architecture, which is able to handle the correlation among local parts by its self-attention mechanism. ...
] , we now consider another shape-impression relation analysis approach with Transformers. ...
arXiv:2203.05808v2
fatcat:4334pigvhrd37ftwnz5ej33rha
« Previous
Showing results 1 — 15 out of 113,832 results