NDLI: Looking for the same needle in multiple haystacks: Performance bounds

Content Provider	IEEE Xplore Digital Library
Author	Raich, R. Zeyu You
Copyright Year	2014
Description	Author affiliation: Sch. of EECS, Oregon State Univ., Corvallis, OR, USA (Raich, R.; Zeyu You)
Abstract	We consider the problem of finding the same pattern in multiple sets. This problem can be applied in a variety of signal processing and machine learning problems including DNA sequencing and detection of electrical signatures. In our problem setting, each set contains only a single unknown pattern of interest among many other patterns. To understand the performance limitations associated with this setting, we focus on the evaluation of the Cramér-Rao lower bound (CRLB). We introduce a probabilistic model for the problem. The random position of a pattern in a given set gives rise to a mixture model and consequently a non trivial CRLB analysis. We present the derivation of the CRLB for the problem and provide a numerical evaluation of the CRLB. We verify our expression for the CRLB against the mean-squared-error of an iterative implementation of the maximum likelihood estimator.
Sponsorship	IEEE Signal Process. Soc.
Starting Page	4533
Ending Page	4537
File Size	176958
Page Count	5
File Format	PDF
ISBN	9781479928934
DOI	10.1109/ICASSP.2014.6854460
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-05-04
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Signal to noise ratio Maximum likelihood estimation Vectors Pattern matching Joints Pattern Matching Cramér-Rao lower bound Mean Squared Error
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

MSE Bounds With Affine Bias Dominating the CramÉr–Rao Bound

Bayesian cramér-rao type bound for risk-unbiased estimation with deterministic nuisance parameters

Cyclic Bayesian Cramér-Rao bound for filtering in circular state space

Lower Bounds on the Mean-Squared Error of Low-Rank Matrix Reconstruction

Learning denoising bounds for noisy images

Notes on the Tightness of the Hybrid CramÉr–Rao Lower Bound

Performance of Hybrid Wideband Doppler Sonars

Performance bounds for sparse estimation with random noise

Maximum likelihood estimation under partial sparsity constraints

Looking for the same needle in multiple haystacks: Performance bounds

Similar Documents

MSE Bounds With Affine Bias Dominating the CramÉr–Rao Bound

Bayesian cramér-rao type bound for risk-unbiased estimation with deterministic nuisance parameters

Cyclic Bayesian Cramér-Rao bound for filtering in circular state space

Lower Bounds on the Mean-Squared Error of Low-Rank Matrix Reconstruction

Learning denoising bounds for noisy images

Notes on the Tightness of the Hybrid CramÉr–Rao Lower Bound

Performance of Hybrid Wideband Doppler Sonars

Performance bounds for sparse estimation with random noise

Maximum likelihood estimation under partial sparsity constraints

Looking for the same needle in multiple haystacks: Performance bounds