Automated reassembly of fragmented images

Anandabrata Pal, Kulesh Shanmugasundaram, Nasir Memon

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we address the problem of reassembly of images from a collection of their fragments. The image reassembly problem is formulated as a combinatorial optimization problem and image assembly is then done by finding an optimal ordering of fragments. We present implementation results showing that images can be reconstructed with high accuracy even when there are thousands of fragments and multiple images involved.

Original languageEnglish (US)
Title of host publicationProceedings - 2003 International Conference on Multimedia and Expo, ICME
PublisherIEEE Computer Society
PagesI625-I628
Volume1
ISBN (Print)0780379659
DOIs
StatePublished - 2003
Event2003 International Conference on Multimedia and Expo, ICME 2003 - Baltimore, United States
Duration: Jul 6 2003Jul 9 2003

Other

Other2003 International Conference on Multimedia and Expo, ICME 2003
CountryUnited States
CityBaltimore
Period7/6/037/9/03

Fingerprint

Combinatorial optimization

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Pal, A., Shanmugasundaram, K., & Memon, N. (2003). Automated reassembly of fragmented images. In Proceedings - 2003 International Conference on Multimedia and Expo, ICME (Vol. 1, pp. I625-I628). [1220995] IEEE Computer Society. https://doi.org/10.1109/ICME.2003.1220995

Automated reassembly of fragmented images. / Pal, Anandabrata; Shanmugasundaram, Kulesh; Memon, Nasir.

Proceedings - 2003 International Conference on Multimedia and Expo, ICME. Vol. 1 IEEE Computer Society, 2003. p. I625-I628 1220995.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pal, A, Shanmugasundaram, K & Memon, N 2003, Automated reassembly of fragmented images. in Proceedings - 2003 International Conference on Multimedia and Expo, ICME. vol. 1, 1220995, IEEE Computer Society, pp. I625-I628, 2003 International Conference on Multimedia and Expo, ICME 2003, Baltimore, United States, 7/6/03. https://doi.org/10.1109/ICME.2003.1220995
Pal A, Shanmugasundaram K, Memon N. Automated reassembly of fragmented images. In Proceedings - 2003 International Conference on Multimedia and Expo, ICME. Vol. 1. IEEE Computer Society. 2003. p. I625-I628. 1220995 https://doi.org/10.1109/ICME.2003.1220995
Pal, Anandabrata ; Shanmugasundaram, Kulesh ; Memon, Nasir. / Automated reassembly of fragmented images. Proceedings - 2003 International Conference on Multimedia and Expo, ICME. Vol. 1 IEEE Computer Society, 2003. pp. I625-I628
@inproceedings{3cac44d1e93443a7bb831e8982e92344,
title = "Automated reassembly of fragmented images",
abstract = "In this paper we address the problem of reassembly of images from a collection of their fragments. The image reassembly problem is formulated as a combinatorial optimization problem and image assembly is then done by finding an optimal ordering of fragments. We present implementation results showing that images can be reconstructed with high accuracy even when there are thousands of fragments and multiple images involved.",
author = "Anandabrata Pal and Kulesh Shanmugasundaram and Nasir Memon",
year = "2003",
doi = "10.1109/ICME.2003.1220995",
language = "English (US)",
isbn = "0780379659",
volume = "1",
pages = "I625--I628",
booktitle = "Proceedings - 2003 International Conference on Multimedia and Expo, ICME",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Automated reassembly of fragmented images

AU - Pal, Anandabrata

AU - Shanmugasundaram, Kulesh

AU - Memon, Nasir

PY - 2003

Y1 - 2003

N2 - In this paper we address the problem of reassembly of images from a collection of their fragments. The image reassembly problem is formulated as a combinatorial optimization problem and image assembly is then done by finding an optimal ordering of fragments. We present implementation results showing that images can be reconstructed with high accuracy even when there are thousands of fragments and multiple images involved.

AB - In this paper we address the problem of reassembly of images from a collection of their fragments. The image reassembly problem is formulated as a combinatorial optimization problem and image assembly is then done by finding an optimal ordering of fragments. We present implementation results showing that images can be reconstructed with high accuracy even when there are thousands of fragments and multiple images involved.

UR - http://www.scopus.com/inward/record.url?scp=84892390431&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84892390431&partnerID=8YFLogxK

U2 - 10.1109/ICME.2003.1220995

DO - 10.1109/ICME.2003.1220995

M3 - Conference contribution

SN - 0780379659

VL - 1

SP - I625-I628

BT - Proceedings - 2003 International Conference on Multimedia and Expo, ICME

PB - IEEE Computer Society

ER -