國立虎尾科技大學 |

Optimization techniques in computer vision = ill-posed problems and regularization /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Optimization techniques in computer vision/ by Mongi A. Abidi, Andrei V. Gribok, Joonki Paik.
其他題名:	ill-posed problems and regularization /
作者:	Abidi, Mongi A.
其他作者:	Gribok, Andrei V.
出版者:	Cham :Springer International Publishing : : 2016.,
面頁冊數:	xv, 293 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
標題:	Computer vision. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-46364-3
ISBN:	9783319463643

Optimization techniques in computer vision = ill-posed problems and regularization /
Abidi, Mongi A.

Optimization techniques in computer visionill-posed problems and regularization /[electronic resource] :by Mongi A. Abidi, Andrei V. Gribok, Joonki Paik. - Cham :Springer International Publishing :2016. - xv, 293 p. :ill., digital ;24 cm. - Advances in computer vision and pattern recognition,2191-6586. - Advances in computer vision and pattern recognition..

Ill-Posed Problems in Imaging and Computer Vision -- Selection of the Regularization Parameter -- Introduction to Optimization -- Unconstrained Optimization -- Constrained Optimization -- Frequency-Domain Implementation of Regularization -- Iterative Methods -- Regularized Image Interpolation Based on Data Fusion -- Enhancement of Compressed Video -- Volumetric Description of Three-Dimensional Objects for Object Recognition -- Regularized 3D Image Smoothing -- Multi-Modal Scene Reconstruction Using Genetic Algorithm-Based Optimization -- Appendix A: Matrix-Vector Representation for Signal Transformation -- Appendix B: Discrete Fourier Transform -- Appendix C: 3D Data Acquisition and Geometric Surface Reconstruction -- Appendix D: Mathematical Appendix -- Index.

This book presents practical optimization techniques used in image processing and computer vision problems. Ill-posed problems are introduced and used as examples to show how each type of problem is related to typical image processing and computer vision problems. Unconstrained optimization gives the best solution based on numerical minimization of a single, scalar-valued objective function or cost function. Unconstrained optimization problems have been intensively studied, and many algorithms and tools have been developed to solve them. Most practical optimization problems, however, arise with a set of constraints. Typical examples of constraints include: (i) pre-specified pixel intensity range, (ii) smoothness or correlation with neighboring information, (iii) existence on a certain contour of lines or curves, and (iv) given statistical or spectral characteristics of the solution. Regularized optimization is a special method used to solve a class of constrained optimization problems. The term regularization refers to the transformation of an objective function with constraints into a different objective function, automatically reflecting constraints in the unconstrained minimization process. Because of its simplicity and efficiency, regularized optimization has many application areas, such as image restoration, image reconstruction, optical flow estimation, etc. Optimization plays a major role in a wide variety of theories for image processing and computer vision. Various optimization techniques are used at different levels for these problems, and this volume summarizes and explains these techniques as applied to image processing and computer vision.

ISBN: 9783319463643

Standard No.: 10.1007/978-3-319-46364-3doiSubjects--Topical Terms:

561800
Computer vision.

LC Class. No.: TA1634

Dewey Class. No.: 006.37

Optimization techniques in computer vision = ill-posed problems and regularization /
LDR:03577nam a2200349 a 4500 001 868586
003 DE-He213
005 20161206180647.0
006 m d
007 cr nn 008maaau
008 170720s2016 gw s 0 eng d
020 $a 9783319463643 $q (electronic bk.)
020 $a 9783319463636 $q (paper)
024 7 $a 10.1007/978-3-319-46364-3 $2 doi
035 $a 978-3-319-46364-3
040 $a GP $c GP
041 0 $a eng
050 4 $a TA1634
072 7 $a UYT $2 bicssc
072 7 $a UYQV $2 bicssc
072 7 $a COM012000 $2 bisacsh
072 7 $a COM016000 $2 bisacsh
082 0 4 $a 006.37 $2 23
090 $a TA1634 $b .A148 2016
100 1 $a Abidi, Mongi A. $3 596754
245 1 0 $a Optimization techniques in computer vision $h [electronic resource] : $b ill-posed problems and regularization / $c by Mongi A. Abidi, Andrei V. Gribok, Joonki Paik.
260 $a Cham : $c 2016. $b Springer International Publishing : $b Imprint: Springer,
300 $a xv, 293 p. : $b ill., digital ; $c 24 cm.
490 1 $a Advances in computer vision and pattern recognition, $x 2191-6586
505 0 $a Ill-Posed Problems in Imaging and Computer Vision -- Selection of the Regularization Parameter -- Introduction to Optimization -- Unconstrained Optimization -- Constrained Optimization -- Frequency-Domain Implementation of Regularization -- Iterative Methods -- Regularized Image Interpolation Based on Data Fusion -- Enhancement of Compressed Video -- Volumetric Description of Three-Dimensional Objects for Object Recognition -- Regularized 3D Image Smoothing -- Multi-Modal Scene Reconstruction Using Genetic Algorithm-Based Optimization -- Appendix A: Matrix-Vector Representation for Signal Transformation -- Appendix B: Discrete Fourier Transform -- Appendix C: 3D Data Acquisition and Geometric Surface Reconstruction -- Appendix D: Mathematical Appendix -- Index.
520 $a This book presents practical optimization techniques used in image processing and computer vision problems. Ill-posed problems are introduced and used as examples to show how each type of problem is related to typical image processing and computer vision problems. Unconstrained optimization gives the best solution based on numerical minimization of a single, scalar-valued objective function or cost function. Unconstrained optimization problems have been intensively studied, and many algorithms and tools have been developed to solve them. Most practical optimization problems, however, arise with a set of constraints. Typical examples of constraints include: (i) pre-specified pixel intensity range, (ii) smoothness or correlation with neighboring information, (iii) existence on a certain contour of lines or curves, and (iv) given statistical or spectral characteristics of the solution. Regularized optimization is a special method used to solve a class of constrained optimization problems. The term regularization refers to the transformation of an objective function with constraints into a different objective function, automatically reflecting constraints in the unconstrained minimization process. Because of its simplicity and efficiency, regularized optimization has many application areas, such as image restoration, image reconstruction, optical flow estimation, etc. Optimization plays a major role in a wide variety of theories for image processing and computer vision. Various optimization techniques are used at different levels for these problems, and this volume summarizes and explains these techniques as applied to image processing and computer vision.
650 0 $a Computer vision. $3 561800
650 1 4 $a Computer Science. $3 593922
650 2 4 $a Image Processing and Computer Vision. $3 670819
650 2 4 $a Signal, Image and Speech Processing. $3 670837
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Mathematical Applications in Computer Science. $3 815331
700 1 $a Gribok, Andrei V. $3 1116267
700 1 $a Paik, Joonki. $3 1116268
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a Advances in computer vision and pattern recognition. $3 886855
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-46364-3
950 $a Computer Science (Springer-11645)