@article {18213,
	title = {Fingerprinting Compressed Multimedia Signals},
	journal = {Information Forensics and Security, IEEE Transactions on},
	volume = {4},
	year = {2009},
	month = {2009/09//},
	pages = {330 - 345},
	abstract = {Digital fingerprinting is a technique to deter unauthorized redistribution of multimedia content by embedding a unique identifying signal in each legally distributed copy. The embedded fingerprint can later be extracted and used to trace the originator of an unauthorized copy. A group of users may collude and attempt to create a version of the content that cannot be traced back to any of them. As multimedia data is commonly stored in compressed form, this paper addresses the problem of fingerprinting compressed signals. Analysis is carried out to show that due to the quantized nature of the host signal and the embedded fingerprint, directly extending traditional fingerprinting techniques for uncompressed signals to the compressed case leads to low collusion resistance. To overcome this problem and improve the collusion resistance, a new technique for fingerprinting compressed signals called Anti-Collusion Dither (ACD) is proposed, whereby a random dither signal is added to the compressed host before embedding so as to make the effective host signal appear more continuous. The proposed technique is shown to reduce the accuracy with which attackers can estimate the host signal, and from an information theoretic perspective, the proposed ACD technique increases the maximum number of users that can be supported by the fingerprinting system under a given attack. Both analytical and experimental studies confirm that the proposed technique increases the probability of identifying a guilty user and can approximately quadruple the collusion resistance compared to conventional Gaussian fingerprinting.},
	keywords = {coding;, coding;copy, collusion;digital, communication;video, compression;digital, compression;video, dither;collusion, domain, fingerprinting;anti-collusion, fingerprinting;multimedia, Gaussian, management;multimedia, protection;data, resistance;compressed, rights},
	isbn = {1556-6013},
	doi = {10.1109/TIFS.2009.2025860},
	author = {Varna,A.L. and He,Shan and Swaminathan,A. and M. Wu}
}
@conference {12650,
	title = {An algebraic approach to surface reconstruction from gradient fields},
	booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on},
	volume = {1},
	year = {2005},
	month = {2005/10//},
	pages = {174 - 181 Vol. 1 - 174 - 181 Vol. 1},
	abstract = {Several important problems in computer vision such as shape from shading (SFS) and photometric stereo (PS) require reconstructing a surface from an estimated gradient field, which is usually non-integrable, i.e. have non-zero curl. We propose a purely algebraic approach to enforce integrability in discrete domain. We first show that enforcing integrability can be formulated as solving a single linear system Ax =b over the image. In general, this system is under-determined. We show conditions under which the system can be solved and a method to get to those conditions based on graph theory. The proposed approach is non-iterative, has the important property of local error confinement and can be applied to several problems. Results on SFS and PS demonstrate the applicability of our method.},
	keywords = {algebra;, algebraic, approach;, Computer, confinement;, discrete, domain, error, field;, from, gradient, graph, image, integrability;, linear, local, methods;, photometric, reconstruction;, shading;, SHAPE, stereo;, surface, system;, theory;, vision;},
	doi = {10.1109/ICCV.2005.31},
	author = {Agrawal,A. and Chellapa, Rama and Raskar, R.}
}
@article {15401,
	title = {Resolution enhancement by applying MFM under UHV conditions},
	journal = {Magnetics, IEEE Transactions on},
	volume = {36},
	year = {2000},
	month = {2000/09//},
	pages = {2975 - 2977},
	abstract = {The enhancement in signal-to-noise ratio and lateral resolution in MFM in going from ambient pressure to UHV is demonstrated. The performance of several cantilevers is evaluated using a patterned 50 nm thick permalloy film, with cross-tie as well as 90 deg; domain walls, and a 200 nm thick permalloy film with perpendicular magnetization. The increase in the quality factor of the cantilever oscillation in UHV improves the sensitivity, consequently allowing less magnetic material on the tip to achieve the same signal-to-noise ratio. This reduction in magnetic volume sharpens the lateral resolution. We also demonstrate that the magnetic interaction can be so weak that a magnetic contrast is visible only under UHV conditions},
	keywords = {conditions;cantilevers;domain, contrast;magnetic, domain, enhancement;Permalloy;magnetic, enhancement;signal-to-noise, film;perpendicular, films;magnetisation;, force, magnetization;resolution, MFM;NiFe;UHV, microscopy;magnetic, ratio, resolution;magnetic, thin, volume;permalloy, walls;lateral, walls;magnetic},
	isbn = {0018-9464},
	doi = {10.1109/20.908645},
	author = {Dreyer,M. and Gomez,R.D. and Mayergoyz, Issak D}
}
@conference {18289,
	title = {Video transcoding by reducing spatial resolution},
	booktitle = {Image Processing, 2000. Proceedings. 2000 International Conference on},
	volume = {1},
	year = {2000},
	month = {2000///},
	pages = {972 -975 vol.1 - 972 -975 vol.1},
	abstract = {In network delivery of digital video, if the bandwidth required for a video is not available, the video has to be recoded at a reduced bit rate. It is highly desirable that the transcoding is carried out in real time while maintaining reasonable image quality. In this paper, we propose a fast approach to derive from an MPEG stream a new MPEG stream with half the spatial resolution. For the downsized video, we first generate from the original compressed video an improved estimate of the motion vectors. We then propose a compressed domain approach with data hiding to produce DCT residues by an open-loop method. The computational complexity is significantly lower than a number of previous approaches. Simulation suggests that our approach produces reasonable image quality},
	keywords = {approach;computational, coding;, coding;video, complexity;data, compression;data, cosine, DCT, delivery;open-loop, domain, encapsulation;discrete, estimation;network, estimation;transform, hiding;digital, method;spatial, quality;motion, reduction;video, residues;MPEG, resolution, resolution;motion, stream;compressed, transcoding;computational, transforms;image, vectors, video;downsized, video;image},
	doi = {10.1109/ICIP.2000.901123},
	author = {Yin,Peng and M. Wu and Liu,Bede}
}
@article {15374,
	title = {A parallel-in-time method for the transient simulation of SOI devices with drain current overshoots},
	journal = {Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on},
	volume = {13},
	year = {1994},
	month = {1994/08//},
	pages = {1035 - 1044},
	abstract = {This paper presents a new parallel-in-time algorithm for the two dimensional transient simulation of SOI devices. With this approach, simulation in both space and time domains is performed in parallel As a result, the CPU time is reduced significantly from the conventional serial-in-time method. This new approach fully exploits the inherent parallelism of the finite difference formulation of the basic semiconductor device equations and the massively parallel architecture of SIMD computers. The space domain computations are inherently parallel due to the nature of our technique of solving the finite-difference equations. Time domain parallelism is achieved by shifting the potentials from previous time points to subsequent points one-step forward along the time axis with each Gummel iteration. This algorithm employs a fixed-point iteration technique, therefore a direct solution of matrix equations is avoided. The algorithm is especially suitable for the transient simulation of SOI devices that exhibit transient drain current overshoot. Numerical experiments show that the new parallel-in-time method is up to eight times faster than the conventional serial-in-time method in SOI transient simulations. The program is coded in CM Fortran for the Connection Machine},
	keywords = {2D, algorithms;semiconductor, analysis;transient, architecture;parallel-in-time, boundaries;silicon;time-domain, computations;time, computers;SOI, computing;finite, current, device, devices;drain, devices;parallel, difference, dimensional, domain, effect, engineering, equations;fixed-point, equations;space, field, Fortran;CPU, gate, iteration, iteration;SIMD, Machine;Gummel, method;semiconductor, methods;insulated, methods;metal-insulator-semiconductor, models;semiconductor-insulator, overshoots;finite-difference, Parallel, parallelism;transient, response;, simulation;CM, simulation;digital, simulation;electronic, simulation;two, technique;massively, time;Connection, transistors;iterative},
	isbn = {0278-0070},
	doi = {10.1109/43.298039},
	author = {Tai,G.-C. and Korman,C.E. and Mayergoyz, Issak D}
}
