Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/electricite-electronique/image-co-segmentation/descriptif_4822901
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=4822901

0 article 

 Frais de port 0,01€*

Exclusivité web : à partir de 35 euros d’achat, frais de port à 1 centime pour les expéditions vers la France métropolitaine, la Suisse et l’UE avec Colissimo ou GLS

Image Co-segmentation, 1st ed. 2023 Studies in Computational Intelligence Series, Vol. 1082

Langue : Anglais

Auteurs :

Couverture de l’ouvrage Image Co-segmentation

This book presents and analyzes methods to perform image co-segmentation. In this book, the authors describe efficient solutions to this problem ensuring robustness and accuracy, and provide theoretical analysis for the same. Six different methods for image co-segmentation are presented. These methods use concepts from statistical mode detection, subgraph matching, latent class graph, region growing, graph CNN, conditional encoder?decoder network, meta-learning, conditional variational encoder?decoder, and attention mechanisms. The authors have included several block diagrams and illustrative examples for the ease of readers. This book is a highly useful resource to researchers and academicians not only in the specific area of image co-segmentation but also in related areas of image processing, graph neural networks, statistical learning, and few-shot learning.

Introduction.- Survey of Image Co-segmentation.- Mathematical Background.- Co-segmentation using a Classification Framework.- Use of Maximum Common Subgraph Matching.- Maximally Occurring Common Subgraph Matching.- Co-segmentation using Graph Convolutional Neural Network.- Use of a Conditional Siamese Convolutional Network.- Few-shot Learning for Co-segmentation.- Conclusions.

Avik Hati is currently an Assistant Professor at National Institute of Technology Tiruchirappalli, Tamilnadu. He received his B.Tech. Degree in Electronics and Communication Engineering from Kalyani Government Engineering College, West Bengal in 2010 and M.Tech. Degree in Electronics and Electrical Engineering from the Indian Institute of Technology Guwahati in 2012. He received his Ph.D. degree in Electrical Engineering from the Indian Institute of Technology Bombay in 2018. He was a Postdoctoral Researcher at the Pattern Analysis and Computer Vision Department of Istituto Italiano di Tecnologia, Genova, Italy. He was an Assistant Professor at Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT), Gandhinagar from 2020 to 2022. He joined National Institute of Technology Tiruchirappalli in 2022. His research interests include image and video co-segmentation, subgraph matching, saliency detection, scene analysis, robust computer vision, adversarial machine learning.

Rajbabu Velmurugan is a Professor in the Department of Electrical Engineering, Indian Institute of Technology Bombay. He received his Ph.D. in Electrical and Computer Engineering from Georgia Institute of Technology, USA, in 2007. He was in L&T, India, from 1995 to 1996 and in the MathWorks, USA, from 1998 to 2001. He joined IIT Bombay in 2007. His research interests are broadly in signal processing, inverse problems with application in image and audio processing such as blind deconvolution and source separation, low-level image processing and video analysis, speech enhancement using multi-microphone arrays, and developing efficient hardware systems for signal processing applications.

Sayan Banerjee received his B.Tech. degree in Electrical Engineering from the West Bengal University of Technology, India, in 2012 and M.E. degree in Electrical Engineering from Jadavpur University, Kolkata, in 2015. Currently, he is completin
Introduces novel computer science concepts of maximally occurring common subgraph matching Provides complete algorithmic details for the ease of implementation and reproducibility by practitioners in this area Presents extensive illustrative examples of the algorithms and their results on popular datasets

Date de parution :

Ouvrage de 221 p.

15.5x23.5 cm

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

137,14 €

Ajouter au panier

Date de parution :

Ouvrage de 221 p.

15.5x23.5 cm

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

Prix indicatif 126,59 €

Ajouter au panier