Object Detection In Image Using Particle Swarm Optimization

Object Detection In Image Using Particle Swarm Optimization

EnglishPaperback / softbackPrint on demand
Sharma, Ankit
LAP Lambert Academic Publishing
EAN: 9783847379225
Print on demand
Delivery on Friday, 28. of August 2026
CZK 1,297
Common price CZK 1,441
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

Cross-correlation and related techniques have dominated the Image processing field since the early fifties. Conventional template matching algorithm based on cross-correlation requires complex calculation and large time for object detection, which makes difficult to use them in real time applications. The shortcomings of this class of image matching methods have caused a slow-down in the development of operational automated correlation systems. In the proposed book particle swarm optimization & its variants based algorithm is used for detection of object in image. Implementation of this algorithm reduces the time required for object detection than conventional template matching algorithm. Algorithm can detect object in less number of iteration & hence less time & energy than the complexity of conventional template matching. This feature makes the method capable for real time implementation.
EAN 9783847379225
ISBN 3847379224
Binding Paperback / softback
Publisher LAP Lambert Academic Publishing
Publication date February 7, 2012
Pages 80
Language English
Dimensions 229 x 152 x 5
Country Germany
Readership General
Authors Sharma, Ankit; Singh, Nirbhow Jap
Edition Aufl.
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.