14 results on '"gradient based method"'
Search Results
2. An appropriate unstructured kinetic model describing the batch fermentation growth of Debaryomyces hansenii for xylitol production using hydrolysis of oil palm empty fruit bunch
- Author
-
Kasbawati Kasbawati, Efri Mardawati, Rusni Samsir, Sri Suhartini, and Anisa Kalondeng
- Subjects
Oil palm empty fruit bunch ,batch fermentation ,unstructured model ,parameter estimation ,gradient based method ,sensitivity analysis ,Biotechnology ,TP248.13-248.65 - Abstract
AbstractThis study aimed to determine an appropriate unstructured kinetic model describing the growth of Debaryomyces hansenii with the hydrolysis of oil palm empty bunches as the substrate sources. We tested the well-known cell growth kinetic models for approximating the xylitol fermentation data. We modeled the extracellular process by considering the biomass as a variable, xylose as the substrate and xylitol as the product. The appropriate kinetic model was determined by fitting the models to the experimental data. The fitting process involved an optimization procedure that minimizes a least-squared error between the model solution and the experimental data using a gradient-based method. We found that the unstructured model with Monod specific kinetic growth model had the best approximating ability to describe the dynamics of the batch xylitol fermentation data. Some factors were highlighted as the key factors that influence the growth of yeast cells. One of them is the maximum growth rate of the yeast cell which had a high sensitivity to the maximum production of new cells and xylitol as the main product. As Monod was the best-approximated model, it implies that inhibitory effects by substrate and product played an important role in controlling the growth of yeast cells. There was a certain maximum growth rate for the yeast cell that generates maximum production of new cells and xylitol within a relatively short fermentation time. This result indicates that the growth rate parameter played an important role in adjusting the fermentation process for optimality purposes.
- Published
- 2022
- Full Text
- View/download PDF
3. Comparison of Volumetric Quantitative PET Parameters Before and After a CT-Based Elastic Deformation on Dual-Time 18FDG-PET/CT Images: A Feasibility Study in a Perspective of Radiotherapy Planning in Head and Neck Cancer
- Author
-
Meriem Maajem, Jean-Christophe Leclère, David Bourhis, Valentin Tissot, Nicolas Icard, Laëtitia Arnaud, Romain Le Pennec, Gurvan Dissaux, Dorothy M. Gujral, Pierre-Yves Salaün, Ulrike Schick, and Ronan Abgral
- Subjects
elastic registration ,dual time 18FDG-PET/CT images ,radiotherapy planning ,head neck cancer ,gradient based method ,Medicine (General) ,R5-920 - Abstract
BackgroundThe use of 18FDG-PET/CT for delineating a gross tumor volume (GTV, also called MTV metabolic tumor volume) in radiotherapy (RT) planning of head neck squamous cell carcinomas (HNSCC) is not included in current recommendations, although its interest for the radiotherapist is of evidence. Because pre-RT PET scans are rarely done simultaneously with dosimetry CT, the validation of a robust image registration tool and of a reproducible MTV delineation method is still required.ObjectiveOur objective was to study a CT-based elastic registration method on dual-time pre-RT 18FDG-PET/CT images to assess the feasibility of PET-based RT planning in patients with HNSCC.MethodsDual-time 18FDG-PET/CT [whole-body examination (wbPET) + 1 dedicated step (headPET)] were selected to simulate a 2-times scenario of pre-RT PET images deformation on dosimetry CT. ER-headPET and RR-headPET images were, respectively, reconstructed after CT-to-CT rigid (RR) and elastic (ER) registrations of the headPET on the wbPET. The MTVs delineation was performed using two methods (40%SUVmax, PET-Edge). The percentage variations of several PET parameters (SUVmax, SUVmean, SUVpeak, MTV, TLG) were calculated between wbPET, ER-headPET, and RR-headPET. Correlation between MTV values was calculated (Deming linear regression). MTVs intersections were assessed by two indices (OF, DICE) and compared together (Wilcoxon test). Additional per-volume analysis was evaluated (Mann-Whitney test). Inter- and intra-observer reproducibilities were evaluated (ICC = intra-class coefficient).Results36 patients (30M/6F; median age = 65 y) were retrospectively included. The changes in SUVmax, SUVmean and SUVpeak values between ER-headPET and RR-headPET images were 0.99). The ER-headPET MTVs had significant higher mean OF and DICE with the wbPET MTVs, for both delineation methods (p ≤ 0.002); and also when lesions had a volume > 5cc (excellent OF = 0.80 with 40%SUVmax). The inter- and intra-observer reproducibilities for MTV delineation were excellent (ICC ≥ 0.8, close to 1 with PET-Edge).ConclusionOur study demonstrated no significant changes in MTV after an elastic deformation of pre-RT 18FDG-PET/CT images acquired in dual-time mode. This opens possibilities for HNSCC radiotherapy planning improvement by transferring GTV-PET on dosimetry CT.
- Published
- 2022
- Full Text
- View/download PDF
4. Combining multi-scale composite windows with hierarchical smoothing strategy for fingerprint orientation field computation
- Author
-
Haiyan Li, Tangyu Wang, Yiying Tang, Jun Wu, Pengfei Yu, Lei Guo, Jianhua Chen, and Yufeng Zhang
- Subjects
Fingerprint orientation field (OF) ,Gradient based method ,Weighted multi-scale composite window ,Two-digitized orientation-zone filtering ,Three-digitized orientation-zone filtering ,Medical technology ,R855-855.5 - Abstract
Abstract Background Orientation field (OF) plays a very significant role in automatic fingerprint recognition systems. Many algorithms have been proposed for the estimation of fingerprints’ OF but it is hard to solve the dilemma of correcting spurious ridge structure and avoiding singularity location deviation, especially for poor images. So far, the following drawbacks still need to be solved for OF construction methods for practical application: (1) How to adaptively choose block scales to resolve the contradiction between accuracy and anti-noise, since small scale is beneficial to accuracy but is sensitive to noise, while large scale is more resistant to noise, but the accuracy is deteriorated. (2) How to construct the genuine OF in the areas close-by singular points and to evade singularity location deviation? Current block based methods give spurious OF estimates in the area near singular points because these areas have large curvature thus the detected singular points deviate from the genuine localizations. When these singular points are used as the anchor for referencing minutiae, it makes the average error of matching or recognition even larger. Therefore, it is essentials to construct the genuine OF in the areas close-by singular points and to evade singularity deviation. Methods To overcome the above-mentioned limitations, a novel method, combining a weighted multi-scale composite window (WMCM) with a hierarchical smoothing strategy has been proposed for the computation of fingerprint OF. This method mainly contains two procedures: the approximate OF estimation and the hierarchical OF smoothing. In the first procedure, a series of OFs are established under multiple scales of composite windows by using a gradient based method then a coarse OF is estimated using the weight of each scale determined by a squared gradient consistency. In the second procedure, the OF is first quantized into a two-digitized orientation zone and a two-orientation-zone filtering strategy is adapted to the OF blocks based on a filtering mask obtained after eliminating the isolated blocks. In the end a similar three-digitized orientation zone is performed to obtain an accurate and smooth OF. To validate the performance, the proposed method has been applied to OF computation using the FVC2004 databases and three experiments are designed. Experiment 1 aims to validate whether the weighted multi-scale composite window can balance the dilemma of accuracy and robustness more effectively than the previous works do. Experiment 2 is designed to examine whether the hierarchical smoothing method can correct the spurious ridge flow and preserve the genuine localization of singular points. The purpose of experiment 3 is to test the performance of the proposed method on OF reconstruction in low quality fingerprint images. The fingerprint databases FVC 2004 DB1–DB4 are employed in this study. Results The results of experiment I shows that the proposed method is capable to extract the information of OF reliably and it is more robust against singularity localization deviation in comparison with the other three gradient based methods. The results of experiment II indicates that the proposed smoothing method can balance the contradiction in correcting spurious ridge structures and preserving genuine singularity localization. The results of experiment III illustrates that our approach combing WMCW with the hierarchical smoothing method is capable to extract the information of OF ridge reliably and it is more robust against singularity deviation in comparison with the other three gradient based methods. In a word, the experiment results demonstrate that the proposed method can correct spurious ridge structure and meanwhile avoid singularity deviation compared with the previous works. Conclusions A novel gradient based algorithm has been proposed which is more reliable for the estimation of the ridge information for fingerprint OF and is more accurate in preserving the singularity localization. Compared with the previously proposed gradient based methods, the advantages of the proposed RBSF lie in three aspects. Firstly a weighted multi-scale composite window is put forward to replace the single window used by conventional gradient based methods and to adaptively choose the scales of the blocks. Secondly, a hierarchical smoothing strategy is proposed to enhance the OF by using the two-orientation-zone filtering and the three-orientation-zone filtering, aiming to correct the spurious ridges and preserving the genuine location of singular points. Finally, three experiments are designed to test the proposed algorithm together with other popular gradient based methods on real fingerprint images, which are selected from different categories and all are suffering from obvious noise effects. All the experiment results show that the proposed method is superior with respect to reliable OF construction and avoiding singularity localization deviation.
- Published
- 2018
- Full Text
- View/download PDF
5. Evaluating different approaches to identify a three parameter gas exchange model
- Author
-
Kretschmer Jörn, Docherty Paul D., Riedlinger Axel, and Möller Knut
- Subjects
gradient based method ,hierarchical approach ,mathematical modelling ,parameter identification ,Medicine - Abstract
Mathematical models can be employed to simulate a patient’s individual physiology and can therefore be used to predict reactions to changes in the therapy. To be clinically useful, those models need to be identifiable from data available at the bedside. Gradient based methods to identify the values of the model parameters that represent the recorded data highly depend on the initial estimates. The proposed work implements a previously developed method to overcome those dependencies to identify a three parameter model of gas exchange. The proposed hierarchical method uses models of lower order related to the three parameter model to calculate valid initial estimates for the parameter identification. The presented approach was evaluated using 12 synthetic patients and compared to a traditional direct approach as well as a global search method. Results show that the direct approach is highly dependent on how well the initial estimates are selected, while the hierarchical approach was able to find correct parameter values in all tested patients.
- Published
- 2016
- Full Text
- View/download PDF
6. A Study on Block Matching Algorithms and Gradient Based Method for Motion Estimation in Video Compression
- Author
-
Thomas, Deepa Mary, Nagamalai, Dhinaharan, editor, Renault, Eric, editor, and Dhanuskodi, Murugan, editor
- Published
- 2011
- Full Text
- View/download PDF
7. Using a Gradient Based Method to Seed an EMO Algorithm
- Author
-
Hernandez-Diaz, Alfredo G., Coello, Carlos A., Perez, Fatima, Caballero, Rafael, Molina, Julian, Ehrgott, Matthias, editor, Naujoks, Boris, editor, Stewart, Theodor J., editor, and Wallenius, Jyrki, editor
- Published
- 2010
- Full Text
- View/download PDF
8. Directional Diffusion Regulator (DDR) for some numerical solvers of hyperbolic conservation laws
- Author
-
Jaisankar, S. and Sheshadri, T.S.
- Subjects
- *
DIFFUSION , *CONSERVATION laws (Physics) , *DISCRETE systems , *PARAMETER estimation , *HYDRODYNAMICS , *ENERGY dissipation , *NUMERICAL analysis - Abstract
Abstract: A computational tool called “Directional Diffusion Regulator (DDR)” is proposed to bring forth real multidimensional physics into the upwind discretization in some numerical schemes of hyperbolic conservation laws. The direction based regulator when used with dimension splitting solvers, is set to moderate the excess multidimensional diffusion and hence cause genuine multidimensional upwinding like effect. The basic idea of this regulator driven method is to retain a full upwind scheme across local discontinuities, with the upwind bias decreasing smoothly to a minimum in the farthest direction. The discontinuous solutions are quantified as gradients and the regulator parameter across a typical finite volume interface or a finite difference interpolation point is formulated based on fractional local maximum gradient in any of the weak solution flow variables (say density, pressure, temperature, Mach number or even wave velocity etc.). DDR is applied to both the non-convective as well as whole unsplit dissipative flux terms of some numerical schemes, mainly of Local Lax–Friedrichs, to solve some benchmark problems describing inviscid compressible flow, shallow water dynamics and magneto-hydrodynamics. The first order solutions consistently improved depending on the extent of grid non-alignment to discontinuities, with the major influence due to regulation of non-convective diffusion. The application is also experimented on schemes such as Roe, Jameson–Schmidt–Turkel and some second order accurate methods. The consistent improvement in accuracy either at moderate or marked levels, for a variety of problems and with increasing grid size, reasonably indicate a scope for DDR as a regular tool to impart genuine multidimensional upwinding effect in a simpler framework. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF
9. Combining multi-scale composite windows with hierarchical smoothing strategy for fingerprint orientation field computation
- Author
-
Lei Guo, Wang Tangyu, Yiying Tang, Haiyan Li, Jianhua Chen, Pengfei Yu, Jun Wu, and Zhang Yufeng
- Subjects
lcsh:Medical technology ,Computer science ,Weighted multi-scale composite window ,Computation ,Biomedical Engineering ,02 engineering and technology ,Curvature ,Pattern Recognition, Automated ,Three-digitized orientation-zone filtering ,Biomaterials ,Singularity ,Fingerprint orientation field (OF) ,Robustness (computer science) ,0202 electrical engineering, electronic engineering, information engineering ,Image Processing, Computer-Assisted ,Radiology, Nuclear Medicine and imaging ,Dermatoglyphics ,Spurious relationship ,Minutiae ,Radiological and Ultrasound Technology ,Research ,020206 networking & telecommunications ,General Medicine ,Fingerprint recognition ,Gradient based method ,Two-digitized orientation-zone filtering ,lcsh:R855-855.5 ,020201 artificial intelligence & image processing ,Algorithm ,Smoothing ,Algorithms - Abstract
Background Orientation field (OF) plays a very significant role in automatic fingerprint recognition systems. Many algorithms have been proposed for the estimation of fingerprints’ OF but it is hard to solve the dilemma of correcting spurious ridge structure and avoiding singularity location deviation, especially for poor images. So far, the following drawbacks still need to be solved for OF construction methods for practical application: (1) How to adaptively choose block scales to resolve the contradiction between accuracy and anti-noise, since small scale is beneficial to accuracy but is sensitive to noise, while large scale is more resistant to noise, but the accuracy is deteriorated. (2) How to construct the genuine OF in the areas close-by singular points and to evade singularity location deviation? Current block based methods give spurious OF estimates in the area near singular points because these areas have large curvature thus the detected singular points deviate from the genuine localizations. When these singular points are used as the anchor for referencing minutiae, it makes the average error of matching or recognition even larger. Therefore, it is essentials to construct the genuine OF in the areas close-by singular points and to evade singularity deviation. Methods To overcome the above-mentioned limitations, a novel method, combining a weighted multi-scale composite window (WMCM) with a hierarchical smoothing strategy has been proposed for the computation of fingerprint OF. This method mainly contains two procedures: the approximate OF estimation and the hierarchical OF smoothing. In the first procedure, a series of OFs are established under multiple scales of composite windows by using a gradient based method then a coarse OF is estimated using the weight of each scale determined by a squared gradient consistency. In the second procedure, the OF is first quantized into a two-digitized orientation zone and a two-orientation-zone filtering strategy is adapted to the OF blocks based on a filtering mask obtained after eliminating the isolated blocks. In the end a similar three-digitized orientation zone is performed to obtain an accurate and smooth OF. To validate the performance, the proposed method has been applied to OF computation using the FVC2004 databases and three experiments are designed. Experiment 1 aims to validate whether the weighted multi-scale composite window can balance the dilemma of accuracy and robustness more effectively than the previous works do. Experiment 2 is designed to examine whether the hierarchical smoothing method can correct the spurious ridge flow and preserve the genuine localization of singular points. The purpose of experiment 3 is to test the performance of the proposed method on OF reconstruction in low quality fingerprint images. The fingerprint databases FVC 2004 DB1–DB4 are employed in this study. Results The results of experiment I shows that the proposed method is capable to extract the information of OF reliably and it is more robust against singularity localization deviation in comparison with the other three gradient based methods. The results of experiment II indicates that the proposed smoothing method can balance the contradiction in correcting spurious ridge structures and preserving genuine singularity localization. The results of experiment III illustrates that our approach combing WMCW with the hierarchical smoothing method is capable to extract the information of OF ridge reliably and it is more robust against singularity deviation in comparison with the other three gradient based methods. In a word, the experiment results demonstrate that the proposed method can correct spurious ridge structure and meanwhile avoid singularity deviation compared with the previous works. Conclusions A novel gradient based algorithm has been proposed which is more reliable for the estimation of the ridge information for fingerprint OF and is more accurate in preserving the singularity localization. Compared with the previously proposed gradient based methods, the advantages of the proposed RBSF lie in three aspects. Firstly a weighted multi-scale composite window is put forward to replace the single window used by conventional gradient based methods and to adaptively choose the scales of the blocks. Secondly, a hierarchical smoothing strategy is proposed to enhance the OF by using the two-orientation-zone filtering and the three-orientation-zone filtering, aiming to correct the spurious ridges and preserving the genuine location of singular points. Finally, three experiments are designed to test the proposed algorithm together with other popular gradient based methods on real fingerprint images, which are selected from different categories and all are suffering from obvious noise effects. All the experiment results show that the proposed method is superior with respect to reliable OF construction and avoiding singularity localization deviation.
- Published
- 2018
10. SWIPT techniques for multiuser MIMO broadcast systems
- Author
-
Antonio Pascual-Iserte, Javier Rubio, Andrea Goldsmith, Daniel P. Palomar, Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions, and Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions
- Subjects
Mathematical optimization ,Convex programming ,Optimization problem ,Computer science ,MIMO ,MathematicsofComputing_NUMERICALANALYSIS ,02 engineering and technology ,Enginyeria de la telecomunicació::Radiocomunicació i exploració electromagnètica [Àrees temàtiques de la UPC] ,Interference (wave propagation) ,MIMO systems ,Nonconvex optimization problem ,simultaneous wireless information and power transfer ,0202 electrical engineering, electronic engineering, information engineering ,Wireless ,Classical block-diagonalization strategy ,Sistemes MIMO ,interuser interference ,business.industry ,020208 electrical & electronic engineering ,Constrained optimization ,MIMO SWIPT design ,020206 networking & telecommunications ,Covariance ,Gradient based method ,Convex optimization ,business ,Convex function ,Transmit covariance matrices - Abstract
In this paper, we present an approach to solve the nonconvex optimization problem that arises when designing the transmit covariance matrices in multiuser multiple-input multiple-output (MIMO) broadcast networks implementing simultaneous wireless information and power transfer (SWIPT). The MIMO SWIPT design is formulated as a nonconvex optimization problem in which system sum rate is optimized considering per-user harvesting constraints. Two different approaches are proposed. The first approach is based on a classical gradient-based method for constrained optimization. The second approach is based on difference of convex (DC) programming. The idea behind this approach is to obtain a convex function that approximates the nonconvex objective and, then, solve a series of convex subproblems that, eventually, will provide a (locally) optimum solution of the general nonconvex problem. The solution obtained from the proposed approach is compared to the classical block-diagonalization (BD) strategy, typically used to solve the nonconvex multiuser MIMO network by forcing no inter-user interference. Simulation results show that the proposed approach improves both the system sum rate and the power harvested by users simultaneously. In terms of computational time, the proposed DC programming outperforms the classical gradient methods.
- Published
- 2016
11. SWIPT techniques for multiuser MIMO broadcast systems
- Author
-
Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions, Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions, Rubio López, Javier, Pascual Iserte, Antonio, Perez Palomar, Daniel, Goldsmith, Andrea, Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions, Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions, Rubio López, Javier, Pascual Iserte, Antonio, Perez Palomar, Daniel, and Goldsmith, Andrea
- Abstract
In this paper, we present an approach to solve the nonconvex optimization problem that arises when designing the transmit covariance matrices in multiuser multiple-input multiple-output (MIMO) broadcast networks implementing simultaneous wireless information and power transfer (SWIPT). The MIMO SWIPT design is formulated as a nonconvex optimization problem in which system sum rate is optimized considering per-user harvesting constraints. Two different approaches are proposed. The first approach is based on a classical gradient-based method for constrained optimization. The second approach is based on difference of convex (DC) programming. The idea behind this approach is to obtain a convex function that approximates the nonconvex objective and, then, solve a series of convex subproblems that, eventually, will provide a (locally) optimum solution of the general nonconvex problem. The solution obtained from the proposed approach is compared to the classical block-diagonalization (BD) strategy, typically used to solve the nonconvex multiuser MIMO network by forcing no inter-user interference. Simulation results show that the proposed approach improves both the system sum rate and the power harvested by users simultaneously. In terms of computational time, the proposed DC programming outperforms the classical gradient methods., Peer Reviewed, Postprint (author's final draft)
- Published
- 2016
12. Combining multi-scale composite windows with hierarchical smoothing strategy for fingerprint orientation field computation.
- Author
-
Li, Haiyan, Wang, Tangyu, Tang, Yiying, Wu, Jun, Yu, Pengfei, Guo, Lei, Chen, Jianhua, and Zhang, Yufeng
- Subjects
HUMAN fingerprints ,BIOMETRIC identification ,STATISTICAL smoothing ,INFORMATION filtering ,ALGORITHMS - Abstract
Background: Orientation field (OF) plays a very significant role in automatic fingerprint recognition systems. Many algorithms have been proposed for the estimation of fingerprints' OF but it is hard to solve the dilemma of correcting spurious ridge structure and avoiding singularity location deviation, especially for poor images. So far, the following drawbacks still need to be solved for OF construction methods for practical application: (1) How to adaptively choose block scales to resolve the contradiction between accuracy and anti-noise, since small scale is beneficial to accuracy but is sensitive to noise, while large scale is more resistant to noise, but the accuracy is deteriorated. (2) How to construct the genuine OF in the areas close-by singular points and to evade singularity location deviation? Current block based methods give spurious OF estimates in the area near singular points because these areas have large curvature thus the detected singular points deviate from the genuine localizations. When these singular points are used as the anchor for referencing minutiae, it makes the average error of matching or recognition even larger. Therefore, it is essentials to construct the genuine OF in the areas close-by singular points and to evade singularity deviation.Methods: To overcome the above-mentioned limitations, a novel method, combining a weighted multi-scale composite window (WMCM) with a hierarchical smoothing strategy has been proposed for the computation of fingerprint OF. This method mainly contains two procedures: the approximate OF estimation and the hierarchical OF smoothing. In the first procedure, a series of OFs are established under multiple scales of composite windows by using a gradient based method then a coarse OF is estimated using the weight of each scale determined by a squared gradient consistency. In the second procedure, the OF is first quantized into a two-digitized orientation zone and a two-orientation-zone filtering strategy is adapted to the OF blocks based on a filtering mask obtained after eliminating the isolated blocks. In the end a similar three-digitized orientation zone is performed to obtain an accurate and smooth OF. To validate the performance, the proposed method has been applied to OF computation using the FVC2004 databases and three experiments are designed. Experiment 1 aims to validate whether the weighted multi-scale composite window can balance the dilemma of accuracy and robustness more effectively than the previous works do. Experiment 2 is designed to examine whether the hierarchical smoothing method can correct the spurious ridge flow and preserve the genuine localization of singular points. The purpose of experiment 3 is to test the performance of the proposed method on OF reconstruction in low quality fingerprint images. The fingerprint databases FVC 2004 DB1-DB4 are employed in this study.Results: The results of experiment I shows that the proposed method is capable to extract the information of OF reliably and it is more robust against singularity localization deviation in comparison with the other three gradient based methods. The results of experiment II indicates that the proposed smoothing method can balance the contradiction in correcting spurious ridge structures and preserving genuine singularity localization. The results of experiment III illustrates that our approach combing WMCW with the hierarchical smoothing method is capable to extract the information of OF ridge reliably and it is more robust against singularity deviation in comparison with the other three gradient based methods. In a word, the experiment results demonstrate that the proposed method can correct spurious ridge structure and meanwhile avoid singularity deviation compared with the previous works.Conclusions: A novel gradient based algorithm has been proposed which is more reliable for the estimation of the ridge information for fingerprint OF and is more accurate in preserving the singularity localization. Compared with the previously proposed gradient based methods, the advantages of the proposed RBSF lie in three aspects. Firstly a weighted multi-scale composite window is put forward to replace the single window used by conventional gradient based methods and to adaptively choose the scales of the blocks. Secondly, a hierarchical smoothing strategy is proposed to enhance the OF by using the two-orientation-zone filtering and the three-orientation-zone filtering, aiming to correct the spurious ridges and preserving the genuine location of singular points. Finally, three experiments are designed to test the proposed algorithm together with other popular gradient based methods on real fingerprint images, which are selected from different categories and all are suffering from obvious noise effects. All the experiment results show that the proposed method is superior with respect to reliable OF construction and avoiding singularity localization deviation. [ABSTRACT FROM AUTHOR]- Published
- 2018
- Full Text
- View/download PDF
13. A gradient based method for fully constrained least-squares unmixing of hyperspectral images
- Author
-
Celine Theys, Cedric Richard, Paul Honeine, H. Lantéri, Jie Chen, Laboratoire Hippolyte Fizeau (FIZEAU), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire de la Côte d'Azur, Université Côte d'Azur (UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Modélisation et Sûreté des Systèmes (LM2S), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), Joseph Louis LAGRANGE (LAGRANGE), Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Observatoire de la Côte d'Azur, Université Côte d'Azur (UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS), Université Nice Sophia Antipolis - Faculté des Sciences (UNS UFR Sciences), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Université Nice Sophia Antipolis (1965 - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)
- Subjects
Hyperspectral imaging ,0211 other engineering and technologies ,coefficient update process ,02 engineering and technology ,linear unmixing ,remote sensing ,Mathematical model ,[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing ,0202 electrical engineering, electronic engineering, information engineering ,Materials ,Mathematics ,gradient based method ,iterative algorithm ,full-additivity constraints ,sparsity ,Process (computing) ,sensed images ,Hyperspectral imagery ,Constrained least squares ,[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing ,gradient methods ,hyperspectral images ,mean transient behavior ,Equations ,Iterative method ,non-negativity constraints ,least squares approximations ,non-negativity ,Image (mathematics) ,[INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG] ,Transient (computer programming) ,021101 geological & geomatics engineering ,Pixel ,business.industry ,[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV] ,020206 networking & telecommunications ,Pattern recognition ,constrained least-squares unmixing ,linear unmixing problem ,geophysical image processing ,hyperspectral ,estimation under constraints ,hyperspectral image unmixing ,Gradient based algorithm ,Computer Science::Computer Vision and Pattern Recognition ,Artificial intelligence ,Signal processing algorithms ,business - Abstract
International audience; Linear unmixing of hyperspectral images is a popular approach to determine and quantify materials in sensed images. The linear unmixing problem is challenging because the abundances of materials to estimate have to satisfy non-negativity and full-additivity constraints. In this paper, we investigate an iterative algorithm that integrates these two requirements into the coefficient update process. The constraints are satisfied at each iteration without using any extra operations such as projections. Moreover, the mean transient behavior of the weights is analyzed analytically, which has never been seen for other algorithms in hyperspectral image unmixing. Simulation results illustrate the effectiveness of the proposed algorithm and the accuracy of the model.
- Published
- 2011
- Full Text
- View/download PDF
14. Optimal control of robot-guided laser material treatment
- Author
-
Hömberg, Dietmar, Steinbrecher, Andreas, and Stykel, Tatjana
- Subjects
gradient based method ,35K05 ,49M05} ,heat equation ,49K15 ,coupled systems ,ComputingMethodologies_GENERAL ,equations of motion ,49K20 ,Optimal control - Abstract
In this article we will consider the optimal control of robot guided laser material treatments, where the discrete multibody system model of a robot is coupled with a PDE model of the laser treatment. We will present and discuss several optimization approaches of such optimal control problems and its properties in view of a robust and suitable numerical solution. We will illustrate the approaches in an application to the surface hardening of steel.
- Published
- 2009
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.