Search results for "Algorithm"

showing 10 items of 4887 documents

Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms

2003

The Burrows-Wheeler transform [1] is one of the mainstays of lossless data compression. In most cases, its output is fed to Move to Front or other variations of symbol ranking compression. One of the main open problems [2] is to establish whether Move to Front, or more in general symbol ranking compression, is an essential part of the compression process. We settle this question positively by providing a new class of Burrows-Wheeler algorithms that use optimal partitions of strings, rather than symbol ranking, for the additional step. Our technique is a quite surprising specialization to strings of partitioning techniques devised by Buchsbaum et al. [3] for two-dimensional table compression…

Lossless compressionNew classBurrows–Wheeler transformComputer scienceString (computer science)Entropy (information theory)Data_CODINGANDINFORMATIONTHEORYPattern matchingAlgorithmData compression
researchProduct

Efficient image compression using directionlets

2007

Directionlets are built as basis functions of critically sampled perfect-reconstruction transforms with directional vanishing moments imposed along different directions. We combine the directionlets with the space-frequency quantization (SFQ) image compression method, originally based on the standard two-dimensional wavelet transform. We show that our new compression method outperforms the standard SFQ as well as the state-of-the-art image compression methods, such as SPIHT and JPEG-2000, in terms of the quality of compressed images, especially in a low-rate compression regime. We also show that the order of computational complexity remains the same, as compared to the complexity of the sta…

Lossless compressionTexture compressionbusiness.industryWavelet transformSet partitioning in hierarchical treesWaveletComputer visionArtificial intelligencebusinessQuantization (image processing)AlgorithmMathematicsData compressionImage compression2007 6th International Conference on Information, Communications & Signal Processing
researchProduct

Image compression based on a multi-directional map-dependent algorithm

2007

Abstract This work is devoted to the construction of a new multi-directional edge-adapted compression algorithm for images. It is based on a multi-scale transform that is performed in two steps: a detection step producing a map of edges and a prediction/multi-resolution step which takes into account the information given by the map. A short analysis of the multi-scale transform is performed and an estimate of the error associated to the largest coefficients for a piecewise regular function with Lipschitz edges is provided. Comparisons between this map-dependent algorithm and different classical algorithms are given.

Lossless compressionWork (thermodynamics)Texture compressionApplied MathematicsPiecewiseFunction (mathematics)Lipschitz continuityAlgorithmMathematicsImage compressionData compressionApplied and Computational Harmonic Analysis
researchProduct

Maximum Torque per Ampere Control strategy for low-saliency ratio IPMSMs

2019

This paper deals with electrical drives employing low-saliency ratio interior permanent magnet synchronous motors. In particular, in order to help the designers choosing the best control algorithm, the performances of the Maximum Torque Per Ampere Control (MTPA) and the Field Orientation Control (FOC) are here both theoretically and experimentally assessed and compared, by using, as performance indicators, the torque-current ratio and the power losses. The tests are carried out on a low-power motor for various speeds and loads by implementing the two control strategies in a dSPACE® rapid prototyping system. The results show that the Maximum Torque Per Ampere algorithm has some appreciable a…

Low saliency ratio machineMTPA control strategySettore ING-IND/32 - Convertitori Macchine E Azionamenti ElettriciFOC algorithmSettore ING-INF/07 - Misure Elettriche E ElettronicheIPMSM
researchProduct

New algorithms to evaluate the real shape of a hull

2018

In this study, a new method to compare rebuilt surfaces of hulls of sailing yachts is presented. In particular, the considered rebuilt surfaces are created through classic reverse engineering approaches. The new method has been developed by means of Grasshopper, a free generative algorithms editor that can be used as plugin of Rhinoceros, one of the most widespread free-form modelling software. In particular, two different algorithms have been developed: the first one allows controlling the quality of the rebuilt surfaces, the second one, instead, allows to measure the deviations between the original CAD Model and the rebuilt surface of the hull. A case study related to the hull of a small …

Low-cost reverse engineering analysiEngineering (all)CAE toolClose range photogrammetrySailing yachtSettore ICAR/17 - DisegnoCAD ModelGenerative algorithmSettore ING-IND/15 - Disegno E Metodi Dell'Ingegneria IndustrialeSettore ICAR/06 - Topografia E Cartografia
researchProduct

A smart and operator independent system to delineate tumours in Positron Emission Tomography scans

2018

Abstract Positron Emission Tomography (PET) imaging has an enormous potential to improve radiation therapy treatment planning offering complementary functional information with respect to other anatomical imaging approaches. The aim of this study is to develop an operator independent, reliable, and clinically feasible system for biological tumour volume delineation from PET images. Under this design hypothesis, we combine several known approaches in an original way to deploy a system with a high level of automation. The proposed system automatically identifies the optimal region of interest around the tumour and performs a slice-by-slice marching local active contour segmentation. It automa…

Lung NeoplasmsComputer sciencemedicine.medical_treatmentPET imagingPattern Recognition Automated030218 nuclear medicine & medical imaging0302 clinical medicineNeoplasmsImage Processing Computer-AssistedSegmentationDiagnosis Computer-AssistedNeoplasm MetastasisRadiation treatment planningSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniObserver VariationActive contour modelmedicine.diagnostic_testBrain NeoplasmsPhantoms ImagingComputer Science ApplicationsHead and Neck NeoplasmsPositron emission tomography030220 oncology & carcinogenesis18F-fluoro-2-deoxy-d-glucoseAlgorithms18F-fluoro-2-deoxy-d-glucose and 11C-labeled methionine PET imagingSimilarity (geometry)Health InformaticsSensitivity and SpecificityNOActive contour algorithm03 medical and health sciencesFluorodeoxyglucose F18Predictive Value of TestsRegion of interestmedicineHumansFalse Positive ReactionsRetrospective Studies18F-fluoro-2-deoxy-d-glucose 11C-labeled methionine PET imaging Active contour algorithm Biological target volume Cancer segmentationbusiness.industryRadiotherapy Planning Computer-Assisted11C-labeled methionineReproducibility of ResultsPattern recognitionGold standard (test)Cancer segmentationRadiation therapyBiological target volumePositron-Emission TomographyArtificial intelligenceTomography X-Ray ComputedbusinessSoftwareComputers in Biology and Medicine
researchProduct

Driver mutations and differential sensitivity to targeted therapies: a new approach to the treatment of lung adenocarcinoma

2010

The adenocarcinoma of the lung has recently shown peculiar molecular characteristics, which relate with both carcinogenesis and response to targeted drugs. Several molecular alterations have been defined as "driver mutations". These are responsible for both the initiation and maintenance of the malignancy. The epidermal growth factor receptor (EGFR) pathway is the main regulator of cell function and cancer development. It has a widely defined role in the occurrence of driver mutations. Up till now EGFR gene mutations, KRAS gene mutations and EML4-ALK fusion genes are the most widely recognized alterations involved in both the biology and the clinical management of lung adenocarcinoma. In th…

Lung NeoplasmsOncogene Proteins FusionSettore MED/06 - Oncologia MedicaEGFRGene ExpressionAdenocarcinomaGene mutationmedicine.disease_causeProto-Oncogene Proteins p21(ras)Phosphatidylinositol 3-KinasesPredictive Value of TestsProto-Oncogene ProteinsAntineoplastic Combined Chemotherapy ProtocolsmedicineAdenocarcinoma of the lungHumansRadiology Nuclear Medicine and imagingMolecular Targeted TherapyEpidermal growth factor receptorTyrosine kinase inhibitorsMutationbiologybusiness.industryDriver mutationGeneral MedicineProtein-Tyrosine KinasesPrognosismedicine.diseaseErbB ReceptorsTreatment OutcomeOncologyMutationImmunologyras ProteinsCancer researchbiology.proteinAdenocarcinomaKRASCarcinogenesisbusinessTyrosine kinaseAlgorithmsCancer Treatment Reviews
researchProduct

MULTI-SCALE ANALYSIS OF LUNG COMPUTED TOMOGRAPHY IMAGES

2007

A computer-aided detection (CAD) system for the identification of lung internal nodules in low-dose multi-detector helical Computed Tomography (CT) images was developed in the framework of the MAGIC-5 project. The three modules of our lung CAD system, a segmentation algorithm for lung internal region identification, a multi-scale dot-enhancement filter for nodule candidate selection and a multi-scale neural technique for false positive finding reduction, are described. The results obtained on a dataset of low-dose and thin-slice CT scans are shown in terms of free response receiver operating characteristic (FROC) curves and discussed.

LungReceiver operating characteristicmedicine.diagnostic_testComputer sciencebusiness.industryFOS: Physical sciencesPattern recognitionComputed tomographyCADFilter (signal processing)Physics - Medical PhysicsScale analysis (statistics)Reduction (complexity)Computerized Tomography (CT) and Computed Radiography (CR ).medicine.anatomical_structuremedicineSegmentationMedical Physics (physics.med-ph)Artificial intelligencebusinessInstrumentationMedical-image reconstruction methods and algorithms computer-aided soMathematical Physics
researchProduct

Input-to-state stability for discrete-time nonlinear switched singular systems

2016

Discrete-time nonlinear switched singular systems (SSSs) are investigated.The input-to-state stability (ISS) problems for discrete-time nonlinear SSSs are concerned.The ISS criteria are obtained via average dwell time approach and iterative algorithm of discrete-time systems.The switching rules are optimized and designed. This paper investigates the input-to-state stability (ISS) problems for a class of discrete-time nonlinear switched singular systems (SSSs). Two novel ISS criteria are proposed based on average dwell time (ADT) approach and iterative algorithm of discrete-time systems (IADS). In particular, the following two cases are considered for the underlying systems: the first case i…

Lyapunov function0209 industrial biotechnologyInformation Systems and ManagementIterative method02 engineering and technologyStability (probability)Theoretical Computer Sciencesymbols.namesake020901 industrial engineering & automationExponential stabilityControl theoryArtificial IntelligenceIterative algorithm0202 electrical engineering electronic engineering information engineeringMathematicsSwitched singular systemInput-to-state stabilityProcess (computing)Computer Science Applications1707 Computer Vision and Pattern RecognitionAverage dwell time; Discrete-time system; Input-to-state stability; Iterative algorithm; Nonlinear system; Switched singular system; Control and Systems Engineering; Theoretical Computer Science; Software; Computer Science Applications1707 Computer Vision and Pattern Recognition; Information Systems and Management; Artificial IntelligenceComputer Science ApplicationsNonlinear systemDwell timeDiscrete time and continuous timeDiscrete-time systemControl and Systems EngineeringsymbolsNonlinear system020201 artificial intelligence & image processingAverage dwell timeSoftware
researchProduct

Exponential Transients in Continuous-Time Symmetric Hopfield Nets

2001

We establish a fundamental result in the theory of continuous-time neural computation, by showing that so called continuous-time symmetric Hopfield nets, whose asymptotic convergence is always guaranteed by the existence of a Liapunov function may, in the worst case, possess a transient period that is exponential in the network size. The result stands in contrast to e.g. the use of such network models in combinatorial optimization applications. peerReviewed

Lyapunov functionHopfield netsstabilityneural networksExponential functionHopfield networksymbols.namesakeModels of neural computationRecurrent neural networkConvergence (routing)symbolsApplied mathematicsCombinatorial optimizationdynaamiset systeemitAlgorithmMathematicsNetwork model
researchProduct