File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Towards optimal design of time and color multiplexing codes

TitleTowards optimal design of time and color multiplexing codes
Authors
Keywordsconvex optimization
maximum SNR
Multiplexing codes
Issue Date2012
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, v. 7577 LNCS, n. PART 6, p. 485-498 How to Cite?
AbstractMultiplexed illumination has been proved to be valuable and beneficial, in terms of noise reduction, in wide applications of computer vision and graphics, provided that the limitations of photon noise and saturation are properly tackled. Existing optimal multiplexing codes, in the sense of maximum signal-to-noise ratio (SNR), are primarily designed for time multiplexing, but they only apply to a multiplexing system requiring the number of measurements (M) equal to the number of illumination sources (N). In this paper, we formulate a general code design problem, where M ≥ N, for time and color multiplexing, and develop a sequential semi-definite programming to deal with the formulated optimization problem. The proposed formulation and method can be readily specialized to time multiplexing, thereby making such optimized codes have a much broader application. Computer simulations will discover the main merit of the method- a significant boost of SNR as M increases. Experiments will also be presented to demonstrate the effectiveness and superiority of the method in object illumination. © 2012 Springer-Verlag.
Persistent Identifierhttp://hdl.handle.net/10722/326913
ISSN
2023 SCImago Journal Rankings: 0.606

 

DC FieldValueLanguage
dc.contributor.authorChan, Tsung Han-
dc.contributor.authorJia, Kui-
dc.contributor.authorWycoff, Eliot-
dc.contributor.authorChi, Chong Yung-
dc.contributor.authorMa, Yi-
dc.date.accessioned2023-03-31T05:27:27Z-
dc.date.available2023-03-31T05:27:27Z-
dc.date.issued2012-
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, v. 7577 LNCS, n. PART 6, p. 485-498-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/326913-
dc.description.abstractMultiplexed illumination has been proved to be valuable and beneficial, in terms of noise reduction, in wide applications of computer vision and graphics, provided that the limitations of photon noise and saturation are properly tackled. Existing optimal multiplexing codes, in the sense of maximum signal-to-noise ratio (SNR), are primarily designed for time multiplexing, but they only apply to a multiplexing system requiring the number of measurements (M) equal to the number of illumination sources (N). In this paper, we formulate a general code design problem, where M ≥ N, for time and color multiplexing, and develop a sequential semi-definite programming to deal with the formulated optimization problem. The proposed formulation and method can be readily specialized to time multiplexing, thereby making such optimized codes have a much broader application. Computer simulations will discover the main merit of the method- a significant boost of SNR as M increases. Experiments will also be presented to demonstrate the effectiveness and superiority of the method in object illumination. © 2012 Springer-Verlag.-
dc.languageeng-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
dc.subjectconvex optimization-
dc.subjectmaximum SNR-
dc.subjectMultiplexing codes-
dc.titleTowards optimal design of time and color multiplexing codes-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-642-33783-3_35-
dc.identifier.scopuseid_2-s2.0-84867861409-
dc.identifier.volume7577 LNCS-
dc.identifier.issuePART 6-
dc.identifier.spage485-
dc.identifier.epage498-
dc.identifier.eissn1611-3349-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats