TY - JOUR

T1 - Smoothness in frame reduction

AU - Hsieh, Chung Chi

N1 - Funding Information:
The author would like to thank two anonymous referees for their valuable comments and suggestions which substantially enhanced the paper. This research was supported by National Science Council, Taiwan, ROC under Grant #NSC-87-2218-E-324-005.

PY - 2002/11

Y1 - 2002/11

N2 - A general framework for smoothing a finite sequential set of two-dimensional frames is proposed in this paper. It is intuitive that the more the number of frames is, the smoother the frames will be. However, the storage space required for handling the frames will also be increased. Given the desired size of the frames, finding an optimal frame set is facilitated by the notion of smoothness. The smoothness of a frame set is measured in terms of the energy embedded in the frame set, on the analogy of measuring the smoothness of motion data. A frame set with lower energy value is considered to be smoother. Then, the problem of finding a frame set of given frame size which gives the smoothest measure is formulated as an optimization problem that seeks to minimize the weighted sum of the frame energy and the sum of the squared distance errors.

AB - A general framework for smoothing a finite sequential set of two-dimensional frames is proposed in this paper. It is intuitive that the more the number of frames is, the smoother the frames will be. However, the storage space required for handling the frames will also be increased. Given the desired size of the frames, finding an optimal frame set is facilitated by the notion of smoothness. The smoothness of a frame set is measured in terms of the energy embedded in the frame set, on the analogy of measuring the smoothness of motion data. A frame set with lower energy value is considered to be smoother. Then, the problem of finding a frame set of given frame size which gives the smoothest measure is formulated as an optimization problem that seeks to minimize the weighted sum of the frame energy and the sum of the squared distance errors.

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

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

U2 - 10.1016/S0305-0548(01)00058-2

DO - 10.1016/S0305-0548(01)00058-2

M3 - Article

AN - SCOPUS:0036833010

VL - 29

SP - 1807

EP - 1818

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 13

ER -