Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Linnan Liu

dblp:132/1341 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
3 papers
Image and video processing · 72% Multimedia analysis and retrieval · 28%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing
edge detection
0.021991
Multi-dimensional robust edge detection · CVPR 1991
Application of robust sequential edge detection and linking to boundaries of low contrast lesions in medical images · CVPR 1989
Multimedia analysis and retrieval › image analysis › contour analysis
contour approximation
0.011991
Optimal contour approximation by deformable piecewise cubic splines · CVPR 1991
Image and video processing
image segmentation
0.011989
Application of robust sequential edge detection and linking to boundaries of low contrast lesions in medical images · CVPR 1989
Medical and health informatics › medical imaging
medical image analysis
0.011989
Application of robust sequential edge detection and linking to boundaries of low contrast lesions in medical images · CVPR 1989

Methods — techniques the papers use, named apart from their topics

robust estimation · 0.0neyman-pearson criterion · 0.0markov random field · 0.0huber loss · 0.0adaptive trimmed mean · 0.0penalized maximum likelihood · 0.0least squares · 0.0first-order estimation · 0.0autoregressive moving-average model · 0.0autoregressive moving average model · 0.0
YearPublicationVenuePosition
2007 Power Allocation for Eigen- Beamforming Used in Multi-Antenna System
abstract
Eigen-beamforming technique is introduced in two typical multi-antenna systems: space-time block coding and VBALST. When the channel covariance information is known by the transmitter, optimal power allocation algorithm for eigen-beamforming is proposed based on minimizing the transmission errors. Also, it is indicated in this paper that this algorithm can be simplified when the channel is independent - identically distributed (I.I.D.) channel. By simulation and analysis, eigen-beamforming can greatly improve the performance of multi-antenna system when this power allocation algorithm is adopted.
Linnan Liu, Jingming Kuang 0001, Zesong Fei
PIMRC1
1991 Optimal contour approximation by deformable piecewise cubic splines
abstract
An optimal deformable contour approximation algorithm using a cardinal-form piecewise cubic spline (PCS) curve representation is presented. The approximation is optimal in the sense of least square errors in both location and orientation. The knots are set automatically at high curvature positions. The sample data are generated by a robust edge fragment detection algorithm which is optimal in the sense of a weighted absolute error. An initial contour placement algorithm uses a penalized maximum likelihood algorithm to group the edge fragments together for an initial contour. A controlled deformable contour algorithm refines the initial contour to cover meaningful edge features.>
Linnan Liu, Brian G. Schunck, Charles R. Meyer
CVPR1
1991 Multi-dimensional robust edge detection
abstract
A multidimensional edge model is established and a first-order estimation for multidimensional edge profiles is proposed. An optimal edge location detection algorithm is developed. The advantages of the algorithm are that (1) it has little dependence on assumptions of edge models, noise models, or smoothing filters, (2) it has better abilities for detecting very weak edges and making less edge orientation errors than other edge detectors, (3) it can handle corners and complicated multidimensional image structures, and (4) it detects different edge types at the same time.>
Linnan Liu, Brian G. Schunck, Charles R. Meyer
CVPR1
1989 Application of robust sequential edge detection and linking to boundaries of low contrast lesions in medical images
abstract
An algorithm for the optimal edge contour estimation in medical images without a priori shape models is described. The proposed method is an intermediate-level approach compared with the usual low-level edge-detection operators. An optimal and robust contour estimator is derived by the minimization of a risk function which measures the error from both an inappropriate choice of edge contour and an inappropriate choice of the noise model in the image. The result includes Huber's function. If a parametric statistical noise model and the Neyman-Pearson criterion are used, the result is an extension of maximum-likelihood function. A recursive formulation can be implemented by assuming an independent random field and a Markov path model. The assumption of independent statistics can be satisfied by the use of an autoregressive moving-average preprocessor. The problem of varying edge strength is lessened using an adaptive trimmed mean. The robust algorithm is implemented using a priority-tree (stack) structure. The system's performance is illustrated by estimation of lesion boundaries in medical images.>
Linnan Liu, Peyton H. Bland, David M. Williams, Brian G. Schunck, Charles R. Meyer
CVPR1